|
| 1 | +#include <iostream> |
| 2 | +#include <vector> |
| 3 | + |
| 4 | +using namespace std; |
| 5 | + |
| 6 | +vector<vector<int> > fourSum(vector<int>& nums, int target) |
| 7 | +{ |
| 8 | + sort(nums.begin(), nums.end()); |
| 9 | + int n = nums.size(); |
| 10 | + vector<vector<int> > ans; |
| 11 | + int i = 0; |
| 12 | + while (i < n) { |
| 13 | + int j = i + 1; |
| 14 | + while (j < n) { |
| 15 | + int s = j + 1, e = n - 1; |
| 16 | + while (s < e) { |
| 17 | + int cSum = nums[i] + nums[j] + nums[s] + nums[e]; |
| 18 | + if (cSum == target) { |
| 19 | + vector<int> temp = { nums[i], nums[j], nums[s], nums[e] }; |
| 20 | + ans.push_back(temp); |
| 21 | + s += 1; |
| 22 | + e -= 1; |
| 23 | + while (s < n && nums[s] == nums[s - 1]) |
| 24 | + s += 1; |
| 25 | + |
| 26 | + while (e >= 0 && nums[e] == nums[e + 1]) |
| 27 | + e -= 1; |
| 28 | + } |
| 29 | + else if (cSum > target) |
| 30 | + e -= 1; |
| 31 | + else |
| 32 | + s += 1; |
| 33 | + } |
| 34 | + j += 1; |
| 35 | + while (j < n && nums[j] == nums[j - 1]) |
| 36 | + j += 1; |
| 37 | + } |
| 38 | + i += 1; |
| 39 | + while (i < n && nums[i] == nums[i - 1]) |
| 40 | + i += 1; |
| 41 | + } |
| 42 | + return ans; |
| 43 | +} |
| 44 | + |
| 45 | +int main() { |
| 46 | + vector<int> array; |
| 47 | + |
| 48 | + int number, target; |
| 49 | + cin>>target; |
| 50 | + |
| 51 | + while (cin >> number) { |
| 52 | + array.push_back(number); |
| 53 | + } |
| 54 | + |
| 55 | + cout << fourSum(array, target) << endl; |
| 56 | + |
| 57 | + return 0; |
| 58 | +} |
0 commit comments