【题目描述】
给你一个由 n 个整数组成的数组 nums ,和一个目标值 target 。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]] (若两个四元组元素一一对应,则认为两个四元组重复):
0 <= a, b, c, d < n
a、b、c 和 d 互不相同
nums[a] + nums[b] + nums[c] + nums[d] == target
你可以按 任意顺序 返回答案 。
【解答】
虽然但是,除了强制类型转换还有什么办法嘛?
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
sort(nums.begin(),nums.end());
vector<vector<int>> ans;
int a,b,c,d;
int n=nums.size();
for (a=0; a<n-3; a++)
{
if (a>0 && nums[a]==nums[a-1])
continue;
for (d=n-1; d>a+2; d--)
{
if (d<n-1 && nums[d]==nums[d+1])
continue;
//long long t= target-nums[d]-nums[a];
for (b=a+1; b<d-1; b++)
{
if (b>a+1 && nums[b]==nums[b-1]) continue;
c=d-1;
if ((long long)nums[c]+nums[b]+nums[a]+nums[d]<(long long)target) continue;
while ((long long)nums[c]+nums[b]+nums[a]+nums[d]>(long long)target && c>b)
{
c--;
while(c>b && c<d-1 && nums[c]==nums[c+1])
c--;
}
if (c<=0) continue;
if (b>=c) continue;
if ((long long)nums[b]+nums[c]+nums[a]+nums[d]==(long long)target)
{
vector<int> aa;
aa.push_back(nums[a]);
aa.push_back(nums[b]);
aa.push_back(nums[c]);
aa.push_back(nums[d]);
ans.push_back(aa);
}
}
}
}
return ans;
}
};
【BUG】
1. runtime error: addition of unsigned offset
2. runtime error: signed integer overflow