3sum

题目15：3sum

题目描述：
3Sum Total Accepted: 73112 Total Submissions: 433057 My Submissions Question Solution
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:
Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
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)

题目分析:
要求返回的3元组不能由重复的，且3元组中3个数非递减排序。可能输入的数组中有重复的值，注意对重复的3元组的处理。

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int> > result;
        vector<int> res;
        int i, j, k, len;
        len = nums.size();
        for (i = 0; i < len; i ++) {
            j = i + 1;
            k = len - 1;
            while (j < k) {
                int sum = nums[i] + nums[j] + nums[k];
                if (sum == 0) {
                    res.push_back(nums[i]);
                    res.push_back(nums[j]);
                    res.push_back(nums[k]);
                    result.push_back(res);
                    res.clear();
                    while (j < k && nums[j] == nums[j + 1])
                        ++ j;
                    while (j < k && nums[k] == nums[k - 1])
                        -- k;
                    ++ j;
                    -- k;
                } else if (sum < 0) {
                    ++ j;
                } else {
                    -- k;
                }
            }
            while (i < len && nums[i] == nums[i + 1])
                ++ i;
        }
        return result;
    }
};