day3 哈希表

242. 有效的字母异位词

class Solution {
public:
    bool isAnagram(string s, string t) {
        int sett[26]={0};
        for(int i=0;i<s.size();i++){
            sett[s[i]-97]++;
        }
        for(int i=0;i<t.size();i++){
            sett[t[i]-97]--;
        }
        for(int i=0;i<26;i++){
            if(sett[i]!=0) return false;
        }
        return true;
    }
};

349. 两个数组的交集

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> res;
        unordered_set<int> nums_set(nums1.begin(),nums1.end());
        for(int i=0;i<nums2.size();i++){
            if(nums_set.find(nums2[i])!=nums_set.end())
            res.insert(nums2[i]);
        }     
        return vector<int>(res.begin(),res.end());   
   }
};

202. 快乐数

class Solution {
public:
    int getnum(int n){
            int sum=0;
            while(n){
                sum+=(n%10)*(n%10);
                n/=10;
            }
            return sum;
    }
    bool isHappy(int n) {
        unordered_set<int> res;
        while(1){
            n=getnum(n);
            if(n==1)return true;
            if(res.find(n)!=res.end()) return false;
            else res.insert(n);
        }
    }
};

1. 两数之和

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int>res;
        for(int i=0;i<nums.size();i++){
            auto iter=res.find(target-nums[i]);
            if(iter!=res.end()) return {iter->second,i};
            res.insert(pair<int,int>(nums[i],i));
        }
        return {};
    }
};

454. 四数相加 II

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
    unordered_map<int,int>res;
    int count=0;
    for(int i=0;i<nums1.size();i++){
        for(int j=0;j<nums2.size();j++){
             res[nums1[i]+nums2[j]]++;
        }
    }
    for(int i=0;i<nums3.size();i++){
        for(int j=0;j<nums4.size();j++){
            auto iter=res.find(-nums3[i]-nums4[j]);
            if(iter!=res.end()) count+=iter->second;
        }
    }
    return count;
}
};

383. 赎金信

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        unordered_map<int,int> res;
        for(int i=0;i<magazine.size();i++){
            res[magazine[i]]++;
        }
        for(int i=0;i<ransomNote.size();i++){
            if(res.find(ransomNote[i])==res.end()||res[ransomNote[i]]<=0) return false;
            else res[ransomNote[i]]--;
        }
        return true;
    }
};

15. 三数之和

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

            }

        }
        return res;
    }
};

18. 四数之和

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