2239_FindClosestNumbertoZero - a920604a/leetcode GitHub Wiki
class Solution {
public:
int findClosestNumber(vector<int>& nums) {
int ret = nums[0];
for(int n:nums){
if(abs(n) <= abs(ret) ) {
if(abs(n)==abs(ret) && n>0) ret= n;
// else if(abs(n) == abs(ret)) continue;
else if(abs(n) < abs(ret)) ret = n;
}
}
return ret;
}
};
- time complexity
O(n)
- space complexity
O(1)