从零开始的CPP(27)——双指针遍历

leetcode15

给你一个整数数组 nums ，判断是否存在三元组 [nums[i], nums[j], nums[k]] 满足 i != j、i != k 且 j != k ，同时还满足 nums[i] + nums[j] + nums[k] == 0 。请你返回所有和为 0 且不重复的三元组。

注意：答案中不可以包含重复的三元组。

示例 1：

输入：nums = [-1,0,1,2,-1,-4]
输出：[[-1,-1,2],[-1,0,1]]
解释：
nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0 。
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0 。
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0 。
不同的三元组是 [-1,0,1] 和 [-1,-1,2] 。
注意，输出的顺序和三元组的顺序并不重要。

最开始决定用map提前储存一些结果，把三层循环变成双层循环。

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        //储存任意两数的和与其索引
        map<vector<int>, int> map1;
        vector<vector<int>> res = {};
        cout << "1" << endl;
        for (int i = 0; i < nums.size()-1; i++) {
            for (int j = i + 1; j < nums.size(); j++) {
                map1[{i,j}] = nums[i] + nums[j];
            }
        }
        cout << "2" << endl;
        //遍历数组，比对其是否与map1的值相加为0
        for (int i = 0; i < nums.size(); i++) {
            for (auto pair : map1) {
                if (i != pair.first[0] && i != pair.first[1] && nums[i] + pair.second == 0) {    
                    res.push_back({ nums[i],nums[pair.first[0]],nums[pair.first[1]] });
                }
            }
        }
        cout << "3" << endl;
        if (res.empty()) {
            return res;
        }
        //剔除重复的
        for (int i = 0; i < res.size(); i++) {
            sort(res[i].begin(), res[i].end());
        } 
        cout << "4" << endl;
        
        set<vector<int>> set1;
        for (int i = 0; i < res.size(); i++) {
            set1.insert(res[i]);
        }
        vector<vector<int>> res1 = {};
        for (auto element : set1) {
            res1.push_back(element);
        }
        cout << "5" << endl;
        return res1;
    }
};
int main()
{
    Solution solution;     
    vector<int> nums = { 8,-15,-2,-13,8,5,6,-3,-9,3,6,-6,8,14,-9,-8,-9,-6,-14,5,-7,3,-10,-14,-12,-11,12,-15,-1,12,8,-8,12,13,-13,-3,-5,0,10,2,-11,-7,3,4,-8,9,3,-10,11,5,10,11,-7,7,12,-12,3,1,11,9,-9,-4,9,-12,-6,11,-7,4,-4,-12,13,-8,-12,2,3,-13,-12,-8,14,14,12,9,10,12,-6,-1,8,4,8,4,-1,14,-15,-7,9,-14,11,9,5,14 };
    vector<vector<int>> res = solution.threeSum(nums);
    for (int i = 0; i < res.size(); i++) {
        cout << i << ":";
        for (int j = 0; j < 3; j++) {
            cout << res[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}

结果第三步执行时间太长，不行。

决定用双循环

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {   
        sort(nums.begin(), nums.end());
        cout << nums[0];
        vector<vector<int>> res = {};
        
        for (int i = 1; i < nums.size() - 1; i++) {
            int l_index = 0;
            int r_index = nums.size() - 1;
            while(l_index< r_index){
                if (nums[l_index] + nums[r_index] + nums[i] > 0) {
                    //cout << "1" << endl;
                    r_index--;
                    if (r_index == i) {
                        break;
                    }
                }
                else if (nums[l_index] + nums[r_index] + nums[i] < 0) {
                    l_index++;
                    //cout << "2" << endl;
                    if (l_index == i) {
                        break;
                    }
                }
                else if (nums[l_index] + nums[r_index] + nums[i] == 0) {
                    //cout << "3" << endl;
                    res.push_back({ nums[i], nums[r_index], nums[l_index] });
                    r_index--;
                    if (r_index == i) {
                        break;
                    }
                }
            }
        }
        if (res.empty()) {
            return res;
        }
        //剔除重复的

        set<vector<int>> set1;
        for (int i = 0; i < res.size(); i++) {
            set1.insert(res[i]);
        }
        vector<vector<int>> res1 = {};
        for (auto element : set1) {
            res1.push_back(element);
        }
        //cout << "5" << endl;
        return res1;
    }
};

写的很糙，还需要用set剔除一下，不过总算是合格了