LeetCode 学习记录 16. 3Sum Closest

1 题目要求：

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

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.

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

2 解决方法:

与3SUM类似，排序后遍历

class Solution {
public:
	int threeSumClosest(vector<int>& nums, int target) {
		int ret = nums[0] + nums[1] + nums[2];
		sort(nums.begin(), nums.end(), less<int>());
		for (int first = 0; first < nums.size() - 2; first++) {
			int second = first + 1, third = nums.size() - 1;
			while (second < third) {
				int temp = nums[first] + nums[second] + nums[third];
				if (abs(temp - target) < abs(ret - target)) ret = temp;				
				if (temp - target > 0) {
					third--;
					while (nums[third] == nums[third - 1] && second < third - 1) third--;
				}
				else if (temp - target < 0) {
					second++;
					while (nums[second] == nums[second + 1] && second + 1 < third) second++;
				}
				else return ret;
			}
		}
		return ret;
	}
};

算法复杂度O(n2)

空间复杂度O(1)