2239. Find Closest Number to Zero

Problem

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.

https://leetcode.cn/problems/find-closest-number-to-zero/

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
• -10⁵ <= nums[i] <= 10⁵

Test Cases

1
2

class Solution:
    def findClosestNumber(self, nums: List[int]) -> int:

1
2
3
4
5
6
7
8
9
10
11
12

import pytest

from solution import Solution


@pytest.mark.parametrize('nums, expected', [
    ([-4,-2,1,4,8], 1),
    ([2,-1,1], 1),
])
@pytest.mark.parametrize('sol', [Solution()])
def test_solution(sol, nums, expected):
    assert sol.findClosestNumber(nums) == expected

Thoughts

直接遍历 nums，记录绝对值最小的数字。如果绝对值相等，则保留较大的。

Code

1
2
3
4
5
6
7
8
9
10
11
12

class Solution:
    def findClosestNumber(self, nums: list[int]) -> int:
        res = nums[0]
        dist = abs(nums[0])
        for num in nums:
            if abs(num) < dist:
                res = num
                dist = abs(num)
            elif abs(num) == dist and num > res:
                res = num

        return res

许可协议

本文除了题目描述（Problem）部分之外，其他内容由 Calf 原创，采用 CC BY-NC-SA 4.0 许可协议，转载请注明出处。

分享文章