-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2239.FindClosestNumber.cs
31 lines (30 loc) · 1.04 KB
/
2239.FindClosestNumber.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
// 2239. Find Closest Number to Zero
// 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.
public class Solution {
public int FindClosestNumber(int[] nums) {
int min = nums[0];
for(int i = 1; i < nums.Length; i++){
if(Math.Abs(min) > Math.Abs(nums[i])){
min = nums[i];
}
if(Math.Abs(min) == Math.Abs(nums[i])){
min = Math.Max(min,nums[i]);
}
}
return min;
}
}