leetcode之三数之和 II

最新推荐文章于 2023-07-10 20:43:58 发布

luckyu1

最新推荐文章于 2023-07-10 20:43:58 发布

阅读量405

点赞数

文章标签：算法 lintcode leetcode 面试

本文链接：https://blog.csdn.net/luckyu1/article/details/51204937

版权

题目:

给一个包含n个整数的数组S, 找到和与给定整数target最接近的三元组，返回这三个数的和

解答：

two pinters实现，很简单

class Solution {
public:    
    /**
     * @param numbers: Give an array numbers of n integer
     * @param target: An integer
     * @return: return the sum of the three integers, the sum closest target.
     */
    int threeSumClosest(vector<int> nums, int target) {
        // write your code here
        int size = nums.size();
        sort(nums.begin(), nums.end());
        int res = nums[0] + nums[1] + nums[2];
        for (int i = 0; i < size - 2; ++i) {
            int start = i + 1;
            int end = size - 1;
            while (start < end) {
                if (nums[i] + nums[start] + nums[end] < target) {
                    if (abs(nums[i] + nums[start] + nums[end] - target) < abs(res - target)) { 
                        res = nums[i] + nums[start] + nums[end];
                    }
                    start++;
                } else {
                    if (abs(nums[i] + nums[start] + nums[end] - target) < abs(res - target)) {
                        res = nums[i] + nums[start] + nums[end];
                    }
                    end--;
                }
            }
        }
        return res;
    }
};