程式語言 - LeetCode - C++ - 16. 3Sum Closest



參考資訊:
https://algo.monster/liteproblems/16

題目:


解答:

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int ret = 1 << 30;
        int size = nums.size();

        sort(nums.begin(), nums.end());

        for (int i = 0; i < size; i++) {
            int l = i + 1;
            int r = size - 1;

            while (l < r) {
                int cur = nums[i] + nums[l] + nums[r];

                if (cur == target) {
                    return cur;
                }

                if (abs(cur - target) < abs(ret - target)) {
                    ret = cur;
                }

                if (cur < target) {
                    l += 1;
                }
                else {
                    r -= 1;
                }
            }
        }

        return ret;
    }
};