• Home
• com.github.javadev
• leetcode-in-java11
• 1.19
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2201_2300.s2239_find_closest_number_to_zero.readme.md Maven / Gradle / Ivy

2239\. Find Closest Number to Zero

Easy

Given an integer array `nums` of size `n`, return _the number with the value **closest** to_ `0` _in_ `nums`. If there are multiple answers, return _the number with the **largest** value_.

**Example 1:**

**Input:** nums = [-4,-2,1,4,8]

**Output:** 1

**Explanation:** 

The distance from -4 to 0 is |-4| = 4. 

The distance from -2 to 0 is |-2| = 2. 

The distance from 1 to 0 is |1| = 1. The distance from 4 to 0 is |4| = 4. 

The distance from 8 to 0 is |8| = 8. 

Thus, the closest number to 0 in the array is 1. 

**Example 2:**

**Input:** nums = [2,-1,1]

**Output:** 1

**Explanation:** 1 and -1 are both the closest numbers to 0, so 1 being larger is returned. 

**Constraints:**

*   `1 <= n <= 1000`
*   -105 <= nums[i] <= 105