leetcode:3Sum [15]

Given an array S of n integers, are there elements a, b, c in S 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.

For example, given array S = [-1, 0, 1, 2, -1, -4],

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

class Solution {
public:
	vector<vector<int>> threeSum(vector<int>& nums) {
		sort(nums.begin(), nums.end());
		vector<vector<int>> ali;
		if (nums.size() < 3) return ali;
		vector<int> temp;
		for (int i = 0; i < nums.size(); i++) {
			if (nums[i] > 0) break;
			if (i != 0 && nums[i] == nums[i - 1]) continue;
			for (int j = i + 1; j < nums.size(); j++) {
				if (j > i + 1 && nums[j] == nums[j - 1]) continue;
				for (int k = nums.size() - 1; k > j; k--) {
					if (nums[i] + nums[j] + nums[k] == 0) {
						if (!ali.empty()&&ali[ali.size() - 1][0] == nums[i] && ali[ali.size() - 1][1] == nums[j] && ali[ali.size() - 1][2] == nums[k]) {
							continue;
						}
						temp.push_back(nums[i]);
						temp.push_back(nums[j]);
						temp.push_back(nums[k]);
						ali.push_back(temp);
						temp.clear();
					}
					else if (nums[i] + nums[j] + nums[k] < 0) {
						break;
					}
				}
			}
		}
		return ali;
	}
};