16. 3Sum Closest 解题记录

题目描述：

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

解题思路：

本题我的思路借鉴了上一题的3Sum的思路：先将数组进行排序，再将头一个数固定，这个数以下的数组从左右两端开始搜索，每次都将得到的值进行比较。

代码：

 1 class Solution {
 2 public:
 3     int threeSumClosest(vector<int>& nums, int target) {
 4         int n = nums.size();
 5         if(n < 3)
 6             return 0;
 7         int sum = nums[0]+nums[1]+nums[2];
 8         sort(nums.begin(),nums.end());
 9         for(int i = 0; i < n-2; i++){
10             int left = i+1, right = n-1;
11             while(right > left){
12                 int temp = nums[i]+nums[left]+nums[right];
13                 sum = abs(temp-target)>abs(sum-target)?sum:temp;
14                 if(temp == target)
15                     break;
16                 else if(temp > target)
17                     right--;
18                 else
19                     left++;
20             }
21             if(sum == target)
22                 break;
23         }
24         return sum;
25     }
26 };

 

 

 

转载于:https://www.cnblogs.com/sakuya0000/p/8465907.html