Skip to content

Commit 076f086

Browse files
solves #2239: Find Closest Number to Zero
in java
1 parent d9d4ec6 commit 076f086

File tree

2 files changed

+19
-1
lines changed

2 files changed

+19
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -728,7 +728,7 @@
728728
| 2231 | [Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity) | [![Java](assets/java.png)](src/LargestNumberAfterDigitSwapsByParity.java) | |
729729
| 2235 | [Add Two Integers](https://leetcode.com/problems/add-two-integers) | [![Java](assets/java.png)](src/AddTwoIntegers.java) | |
730730
| 2236 | [Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children) | [![Java](assets/java.png)](src/RootEqualsSumOfChildren.java) | |
731-
| 2239 | [Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero) | | |
731+
| 2239 | [Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero) | [![Java](assets/java.png)](src/FindClosestNumberToZero.java) | |
732732
| 2243 | [Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string) | | |
733733
| 2248 | [Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays) | | |
734734
| 2255 | [Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string) | | |

src/FindClosestNumberToZero.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
// https://leetcode.com/problems/find-closest-number-to-zero
2+
// T: O(N)
3+
// S: O(1)
4+
5+
public class FindClosestNumberToZero {
6+
public int findClosestNumber(int[] array) {
7+
int nearest = Integer.MAX_VALUE;
8+
for (int element : array) {
9+
if (Math.abs(element) < Math.abs(nearest)) {
10+
nearest = element;
11+
} else if (Math.abs(element) == Math.abs(nearest)) {
12+
nearest = Math.max(nearest, element);
13+
}
14+
}
15+
16+
return nearest;
17+
}
18+
}

0 commit comments

Comments
 (0)