标签：min over which duplicate int color index base margin
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] ]
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 | class Solution {public: vector<vector<int>> threeSum(vector<int>& nums) { int len = nums.size(); vector<vector<int> > result; if (len < 3) return result; sort(nums.begin(), nums.end()); for(int i = 0; i < len -2; i++){ if(i > 0 && nums[i] == nums[i - 1]){ continue; } int l = i + 1, r = len - 1; while(l < r){ if( nums[l] + nums[r] + nums[i] > 0){ r--; } else if(nums[l] + nums[r] + nums[i] < 0){ l++; } else{ result.push_back(vector<int>{nums[i],nums[l],nums[r]}); l++; while( l < r && nums[l] == nums[l - 1]){ l++; } } } } return result; } }; |
标签：min over which duplicate int color index base margin
原文地址：http://www.cnblogs.com/zhxshseu/p/cfbfe78871573549689a51ec8435df28.html
