代码随想录训练营 day7 && day9 补课

1. LC 454 四数相加 II

四数相加，目标为0.统计两两数组每个元素间的和

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
        //target : 0
        unordered_map<int, int> mp;
        for (auto a : nums1) {
            for (auto b : nums2) {
                mp[a + b]++;
            }
        }

        int res = 0;
        for (auto c : nums3) {
            for (auto d : nums4) {
                if (mp.find(0 - (c + d)) != mp.end()) res += mp[0 - (c + d)];
            }
        }
        return res;
    }
};

两两数组可随便组合

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
        //target : 0
        unordered_map<int, int> mp;
        for (auto a : nums4) {
            for (auto b : nums1) {
                mp[a + b]++;
            }
        }

        int res = 0;
        for (auto c : nums3) {
            for (auto d : nums2) {
                if (mp.find(0 - (c + d)) != mp.end()) res += mp[0 - (c + d)];
            }
        }
        return res;
    }
};

2. LC 383 赎金信

1 map

最快秒掉的一集

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        map<char, int> mp;
        for (auto ch : magazine) mp[ch]++;
        for (auto ch : ransomNote) {
            if (mp.find(ch) == mp.end() || mp[ch] == 0) return false;
            mp[ch]--;
        } 
        return true;;
    }
};

2 代码随想录解法

使用数组而非map,map会有效率损耗，用数组会更快

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int mp[26] = {0};
        if (ransomNote.size() > magazine.size()) return false;
        for (auto ch : magazine) mp[ch - 'a']++;//仅有小写字母
        for (auto ch : ransomNote) {
            mp[ch - 'a']--;
            if (mp[ch - 'a'] < 0) return false;
        }
        return true;
    }
};

3. LC 15 三数之和

1. 哈希

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        //target == 0
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] > 0) break;//已经进行过排序，如果排序后，第一个所取元素大于0，则三数之和比不可能等于0
            if (i > 0 && nums[i] == nums[i - 1]) continue;//不可重复
            unordered_set<int> st;
            for (int j = i + 1; j < nums.size(); j++) {
                if (j > i + 2 && nums[j] == nums[j - 1] && nums[j - 1] == nums[j - 2]) continue;//不可重复
                int c = 0 - (nums[j] + nums[i]);
                if (st.find(c) != st.end()) {
                    res.push_back({nums[i], nums[j], c});
                    st.erase(c);
                } else st.insert(nums[j]);
            }
        }
        return res;
    }
};

2.双指针

这题去重很麻烦

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        sort(nums.begin(), nums.end());
        if (nums[0] > 0) return {};
        if (nums.size() < 3) return {};

        for (int i = 0; i < nums.size() - 2; i++) {
            if(i > 0 && nums[i - 1] == nums[i]) continue;//去重
            int target = -nums[i];
            for (int l = i + 1, r = nums.size() - 1; l < r;) {
                if (l > i + 1 && nums[l - 1] == nums[l]) {//跳过重复数字
                    l++;
                    continue;
                }
                if (nums[l] + nums[r] == target) {
                    res.push_back({nums[i], nums[l], nums[r]});
                    l++;
                    r--;
                } else if (nums[l] + nums[r] < target) l++;
                else r--;
            }
        }
        return res;
    }
};

4. LC 18 四数之和

排序+双指针，n数之和都可以用

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
          vector<vector<int>> result;
          sort(nums.begin(), nums.end());

          for(int k = 0; k < nums.size(); k++) { 
              if(nums[k] > target && nums[k] > 0) break;
              if(k > 0 && nums[k] == nums[k-1]) {
                  continue;
              }
              for(int i = k + 1; i < nums.size(); i++) {
                  if(i > k + 1 && nums[i] == nums[i-1]) {
                      continue;
                  }
                  int left = i + 1;
                  int right = nums.size() - 1;
                  while(right > left){
                      if(nums[k] + nums[i] > target - (nums[left] + nums[right])){
                          right--;
                      }
                      else if(nums[k] + nums[i] < target - (nums[left] + nums[right])){
                          left++;
                      }else{
                          result.push_back(vector<int>{nums[k], nums[i], nums[left], nums[right]});
                          while(right > left && nums[right] == nums[right-1]) right--;
                          while(right > left && nums[left] == nums[left+1]) left++;
                          right--;
                          left++;
                      }
                  }
              }
          }
          return result;
    }
};

5.LC 151 反转字符串中的单词

细心就行

class Solution {
public:
    void removeLeadindSpaces(string &s) {
        size_t start = 0;
        while (start < s.size() && s[start] == ' ') start++;
        s = s.substr(start);
    }
    
    vector<string> getWords(const string& s){
        vector<string> words;
        string temp = "";
        for (int i = 0; i < s.size(); i++) {
            if (s[i] == ' ') {
                if (s[i - 1] == ' ') continue;
                else {
                    words.push_back(temp);
                    temp = "";
                }
            } else {
                temp += s[i];
            }
        }
        int n = s.size() - 1;
        if (s[n] != ' ') words.push_back(temp);
        return words;
    }
    
    string reverseWords(string s) {
        string res;
        removeLeadindSpaces(s);
        vector<string> words = getWords(s);
        int i = words.size() - 1;
        for (; i >= 0; i--) {
            res += words[i] + ' ';
        }
        int n = res.size() - 1;
        res = res.substr(0, n);
        return res;
    }
};

6. 卡码网 55 右旋字符串（第八期模拟笔试）

55. 右旋字符串（第八期模拟笔试） (kamacoder.com)

直接做很简单，题解的方法比较有意思

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string rightSpinStr(int k, string s){
    string res;
    int n = s.size();
    string temp1 = s.substr(n - k, n);
    s = s.substr(0, n - k);
    res += temp1 + s;
    return res;
}

int main(){
    int k = 0;
    string s = "";
    cin >> k >> s;
    string res = rightSpinStr(k, s);
    cout << res << endl;
    return 0;
}

附题解方法:

#include<iostream>
#include<algorithm>
using namespace std;
int main() {
    int n;
    string s;
    cin >> n;
    cin >> s;
    int len = s.size(); //获取长度
    reverse(s.begin(), s.begin() + len - n); // 先反转前一段，长度len-n 
    reverse(s.begin() + len - n, s.end()); // 再反转后一段
    reverse(s.begin(), s.end()); // 整体反转
    cout << s << endl;

}