哈希笔记（七）***

题目：

（15）三数之和

版本一,自己想用哈希结构去实现，未能实现

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> result_array;
        unordered_map<int,int> result_map;
        int sum = 0;
        int val = 0;
        for (int i = 0; i < nums.size(); i++){
            for (int j = i+1; j < nums.size(); j++){
                sum = nums[i]+ nums[j];
                val = nums[i] * 10 + nums[j];  
                if()
                result_map[val] = sum;   
            }
        }

        for (int h = 0; h < nums.size(); h++){
            auto iterator = result_map.find(nums[h]);
            if (iterator != result_map.end()){
                val = iterator->first;
                int i = val / 10;
                int j = val % 10;
                if(i != h && j != h)
                    result_array.push_back({nums[i],nums[j],nums[h]});        
            }
        }
        return result_array;
    }
};

解法二:排序加双指针

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> result_array;
        sort(nums.begin(),nums.end());
        for(int i = 0; i < nums.size(); i++){
            if(nums[i]>0){
                return result_array;
            }
            if (i > 0 && nums[i] == nums[i-1]){
                continue;
            }
            int left = i + 1;
            int right = nums.size() - 1;
            while (right > left) {
                if (nums[i] + nums[left] + nums[right] > 0) {
                    right--;
                } else if (nums[i] + nums[left] + nums[right] < 0) {
                    left++;
                    }
                else {
                    result_array.push_back(vector<int>{nums[i],nums[left],nums[right]});
                    while(left < right && nums[left] == nums[left+1]){left++;}
                    while(left < right && nums[right] == nums[right-1]){right--;}
                    right--;
                    left++;
                }
            }
            
        }
        return result_array;
    }
};

(18)四数之和

排序+双指针

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> result;
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size(); i++){
            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;
                }
                int left = j + 1;
                int right = nums.size() - 1;
                while(left < right){
                    if (nums[i] + nums[j] - target > -(nums[left] + nums[right])){ 
                        right--;
                        }
                    else if (nums[i] + nums[j] - target< -(nums[left] + nums[right])){ 
                        left++;
                        }
                    else{
                        result.push_back(vector<int>{nums[i], nums[j], nums[left], nums[right]});
                        while(left < right && nums[left] == nums[left+1]) left++;
                        while(left < right && nums[right] == nums[right-1]) right--;
                        left++;
                        right--;
                    }
                }

            }

        }
        return result;
    }
};