LeetCode 15. 3Sum C++

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

分析：

很经典的题目，用BF暴力时间复杂度达到O(n³)必然超时，需要用two pointer 算法改良。

C++（Two Pointers 时间复杂度O（n²））

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
    	vector <vector<int> > res;
		sort(nums.begin(),nums.end());//先sort
    	for(int i=0;i< (int)nums.size() - 2;i++){//这里只需要到nums.size()-2即可
    		if(i==0 || (i > 0 && nums[i] != nums[i-1] ) ){//避免重复返回
    			int low = i+1;
    			int high =nums.size()-1;
    			int sum = 0 - nums[i];
    			while(low < high){
    				if(nums[low] + nums[high] == sum)// perfect case
					{
    					res.push_back({nums[i],nums[low],nums[high]});
    					while(low < high && nums[low] == nums[low+1] ) low++;//避免重复计算,跳过
    					while(low < high && nums[high] == nums[high-1]) high--;//避免重复计算,跳过
    					low++;//两个指针靠进，Low右移，high左移
    					high--;
					}else if(nums[low] + nums[high] > sum){//值太大了，期望得到更小的值，需要high左移
						high--;
					}else{
						low++;
					}
				}
			}
		}
		return res;
    }
};