思路:
定义一个unordered_map,key放a+b的和,value放a+b的和的出现次数
遍历nums1和nums2,统计a+b的和以及出现次数,放到unordered_map中
定义count,统计a+b+c+d=0的次数
遍历nums3和nums4,找到如果0-(c+d)出现在map中,就用count把map中key对应的value统计出来
返回count
class Solution {
public:
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
unordered_map<int,int> umap;
for(int a:nums1) {
for(int b:nums2) {
umap[a+b]++;
}
}
int count = 0;
for(int c:nums3) {
for(int d:nums4) {
if(umap.find(0-(c+d)) != umap.end()){
count += umap[0-(c+d)];
}
}
}
return count;
}
};
思路:
通过record记录magezine中字符出现的次数
遍历ransomNote,在record里的对应字符做--操作,如果小于0,说明ransomNote中存在magezine没有的字符
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
int record[26] = {0};
if(ransomNote.size()>magazine.size()){
return false;
}
for(int i = 0; i < magazine.length(); i++){
record[magazine[i] - 'a']++;
}
for(int j = 0; j < ransomNote.length(); j++){
record[ransomNote[j] - 'a']--;
if(record[ransomNote[j] - 'a'] < 0){
return false;
}
}
return true;
}
};
方法一:哈希表
思路:两层for循环确定a和b,再用哈希表确定0-(a+b)是否在数组中出现过。同时要注意去重问题
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){
break;
}
if(i > 0 && nums[i] == nums[i - 1]) {//元素a去重
continue;
}
unordered_set<int> set;
for(int j = i + 1; j < nums.size(); j++) {
if(j > i + 2 && nums[j] == nums[j-1] && nums[j-1] == nums[j-2]){//元素b去重
continue;
}
int c = 0 - (nums[i] + nums[j]);
if(set.find(c) != set.end()) {
result.push_back({nums[i],nums[j],c});
set.erase(c);//元素c去重
}else{
set.insert(nums[j]);
}
}
}
return result;
}
};
方法二:双指针
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){
break;
}
if(i > 0 && nums[i] == nums[i - 1]) {//去重
continue;
}
int left = i + 1;
int right = nums.size() - 1;
while(right > left){
if(nums[right]+nums[left]+nums[i]>0){
right--;
}else if(nums[right]+nums[left]+nums[i]<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;
}
};
本题中双指针的方法在时间和空间上均优于哈希表
思路:双指针,和三数之和相同,再套一层for循环,注意去重
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;
}
//对nums[k]去重
if(k>0&&nums[k]==nums[k-1]){
continue;
}
for(int i=k+1;i<nums.size();i++){
//2级剪枝处理
if(nums[k]+nums[i]>target&&nums[i]>=0){
break;
}
//对nums[i]去重
if(i>k+1&&nums[i]==nums[i-1]){
continue;
}
int left = i+1;
int right = nums.size()-1;
while(right>left){
if((long)nums[k]+nums[i]+nums[left]+nums[right]>target){
right--;
}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;
}
};