leetcode2239: Find Closest Number to Zero

[carloscn]

Description

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

[carloscn]

Analysis

static int32_t find_closest_number(int32_t *nums, size_t nums_size)
{
    int32_t ret = 0;

    UTILS_CHECK_PTR(nums);
    UTILS_CHECK_LEN(nums_size);

    int32_t min_dist = abs(nums[0]);
    int32_t min_val = INT32_MIN;
    for (size_t i = 1; i < nums_size; i ++) {
        if (abs(nums[i]) <= min_dist) {
            min_dist = abs(nums[i]);
            if (nums[i] > min_val) {
                min_val = nums[i];
            }
        }
    }

    ret = min_val;

finish:
    return ret;
}

[carloscn]

Code

https://review.gerrithub.io/c/carloscn/structstudy/+/1169946 https://github.com/carloscn/structstudy/commit/65fb32c3fd65e7bc8bdced0da5a2908e03907517