题目部分
454.四数相加II
跟之前的两数之和差不多
class Solution {
public:
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
unordered_map<int,int>map;
int count = 0;
for(auto num1:nums1){
for(auto num2:nums2){
map[num1+num2]++;
}
}
for(auto num3:nums3){
for(auto num4:nums4){
auto it = map.find(0-num3-num4);
if(it!=map.end()){
count+=it->second;
}
}
}
return count;
}
};
383.赎金信
先是看答案做的暴力解法,但是两层循环的顺序反了,一定要先遍历杂志,如果先遍历赎金信可能出问题
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
for (int i = 0; i < magazine.length(); i++) {
for (int j = 0; j < ransomNote.length(); j++) {
// 在ransomNote中找到和magazine相同的字符
if (magazine[i] == ransomNote[j]) {
ransomNote.erase(ransomNote.begin() + j); // ransomNote删除这个字符
break;
}
}
}
// 如果ransomNote为空,则说明magazine的字符可以组成ransomNote
if (ransomNote.length() == 0) {
return true;
}
return false;
}
};
用数组做哈希比较快一些,跟字母异位词挺像
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
int record[26];
for(int i=0;i<magazine.size();i++){
record[magazine[i]-'a']++;
}
for(int j =0;j<ransomNote.size();j++){
record[ransomNote[j]-'a']--;
if(record[ransomNote[j]-'a']<0)return false;
}
return true;
}
};
15.三数之和
有点难度,题目不适合用哈希做,适合双指针做,核心是去重
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> result;
sort(nums.begin(),nums.end());
for(int i =0;i<nums.size();i++){
if(nums[i]>0)return result;
if(i>0&&nums[i]==nums[i-1])continue;
int left =i+1,right = nums.size()-1;
while(left<right){
if(nums[i]+nums[left]+nums[right]>0)right--;
else if(nums[i]+nums[left]+nums[right]<0)left++;
else{
result.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++;
right--;
left++;
}
}
}
return result;
}
};
18.四数之和
plus版的三数之和,剪枝和去重更复杂些,但是大体跟三数之和很像
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 (nums[k] + nums[i] > target && nums[k] + nums[i] >= 0)
break;
if (i > k + 1 && nums[i] == nums[i - 1])
continue;
int left = i + 1, right = nums.size()-1;
while (right > left) {
if ((long)nums[k] + nums[i] + nums[left] + nums[right] >
target) {
right--;
// nums[k] + nums[i] + nums[left] + nums[right] < target
// 会溢出
} else if ((long)nums[k] + nums[i] + nums[left] +
nums[right] <
target) {
left++;
} else {
result.push_back(vector<int>{nums[k], nums[i],
nums[left], nums[right]});
// 对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;
}
};