454.四数相加II
复杂度感觉还是很高
class Solution {
public:
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4)
{
unordered_map<int,int>mp;
for(int a:nums1)
{
for(int b:nums2)
mp[a+b]++;
}
int count=0;
for(int c:nums3)
{
for(int d:nums4)
{
if(mp.find(0-(c+d))!=mp.end())
count+=mp[0-(c+d)];
}
}
return count;
}
};
383. 赎金信
数据量比较小的情况下用数组处理比较节约时间。
class Solution {
public:
bool canConstruct(string ransomNote, string magazine)
{
// unordered_map<char,int>mp;
int record[26]={0};
// for(int i=0;i<magazine.size();i++)
if(ransomNote.size()>magazine.size())
return false;
for(int i=0;i<magazine.size();i++)
{
record[magazine[i]-'a']++;
//mp[magazine[i]]++;
}
for(int i=0;i<ransomNote.size();i++)
{
// if(mp.find(ransomNote[i])==mp.end()||mp[ransomNote[i]]<=0)
record[ransomNote[i]-'a']--;
if(record[ransomNote[i]-'a']<0)
return false;
//mp[ransomNote[i]]--;
}
return true;
}
};
15. 三数之和
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums)
{
vector<vector<int>>ans;
if(nums.size()<3)
return ans;
sort(nums.begin(),nums.end());
for(int k=0;k<nums.size()-2;k++)
{
if(nums[k]>0)
return ans;
if( k>0&&nums[k]==nums[k-1])
continue;
int i=k+1,j=nums.size()-1;
while(i<j){
int s=nums[k]+nums[i]+nums[j];
if(s>0)
j--;
else if(s<0)
i++;
else
{
ans.push_back({nums[k],nums[i],nums[j]});
while(j>i&&nums[j]==nums[j-1])
j--;
while(j>i&&nums[i]==nums[i+1])
i++;
j--;
i++;
}
}
}
return ans ;
}
};
// 这道题目使用双指针要比哈希表高效
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ans;
if (nums.size() < 3) return ans;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size(); i++) {
if (nums[i] > 0) return ans;
// 去重
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
int left = i + 1;
int right = nums.size() - 1;
while (left < right) {
if (nums[left] + nums[right] + nums[i] > 0) {
right--;
} else if (nums[left] + nums[right] + nums[i] < 0){
left++;
} else {
ans.push_back({nums[left], nums[right], nums[i]});
while (right > left && nums[right] == nums[right - 1]) right--;
while (right > left && nums[left] == nums[left + 1]) left++;
left++;
right--;
}
}
}
return ans;
}
};
18. 四数之和
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target)
{
sort(nums.begin(),nums.end());
vector<vector<int>>res;
if(nums.size()<4)
return res;
int a,b,c,d,n=nums.size();
for(a=0;a<=n-4;a++)
{
if(a>0&&nums[a]==nums[a-1])
continue;
for(b=a+1;b<=n-3;b++)
{
if(b>a+1&&nums[b]==nums[b-1])
continue;
c=b+1,d=n-1;
while(c<d)
{
long cur_target=target-(long)nums[a]-nums[b];
if(nums[c]+nums[d]<cur_target)
c++;
else if(nums[c]+nums[d]>cur_target)
d--;
else
{
res.push_back({nums[a],nums[b],nums[c],nums[d]});
while(c<d&&nums[c]==nums[c+1])
c++;
while(c<d&&nums[d]==nums[d-1])
d--;
c++;
d--;
}
}
}
}
return res;
}
};