class Solution {
public:
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
unordered_map<int,int> unOrdMap;
for(int a : nums1)
for(int b : nums2)
{
//哈希表是可以像数组一样去查值
unOrdMap[a+b]++;
}
int iCount = 0;
for(int c: nums3)
for(int d : nums4)
{
if(unOrdMap[0-(c+d)] != 0)
{
iCount += unOrdMap[0-(c+d)];
}
}
return iCount;
}
};
2. 383. 赎金信
这次在VSCODE上编辑提交,体验感不错,效率提升
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
int cSum[26] = {0};
for(char i : ransomNote)
{
cSum[i - 'a']++;
}
for(char i : magazine)
{
cSum[i - 'a']--;
}
for(int i : cSum)
{
if(i > 0)
return false;
}
return true;
}
};
3. 三数之和(题目比较难)
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> vecRes;
sort(nums.begin(), nums.end());
for(int i = 0;i < nums.size(); i++)
{
if(nums[i] > 0 ) return vecRes;
if(i>0 && nums[i] == nums[i - 1])
{
continue;
}
int iLeft = i + 1;
int iRight = nums.size() - 1;
while(iLeft < iRight)
{
if(nums[i] + nums[iLeft] + nums[iRight] > 0)
{
iRight--;
}
else if(nums[i] + nums[iLeft] + nums[iRight] < 0)
{
iLeft++;
}
else
{
vecRes.push_back(vector<int> {nums[i], nums[iLeft], nums[iRight]});
while(iLeft < iRight && nums[iLeft] == nums[iLeft+1]) iLeft++;
while(iLeft < iRight && nums[iRight] == nums[iRight-1]) iRight--;
iLeft++;
iRight--;
}
}
}
return vecRes;
}
};
4. 18.四数之和(后续重做)
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> vecRes;
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;
int right = nums.size() - 1;
while(left < right)
{
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 {
vecRes.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 vecRes;
}
};