Package g0001_0100.s0018_4sum
Class Solution
java.lang.Object
g0001_0100.s0018_4sum.Solution
18 - 4Sum.<p>Medium</p>
<p>Given an array <code>nums</code> of <code>n</code> integers, return <em>an array of all the <strong>unique</strong> quadruplets</em> <code>[nums[a], nums[b], nums[c], nums[d]]</code> such that:</p>
<ul>
<li><code>0 <= a, b, c, d < n</code></li>
<li><code>a</code>, <code>b</code>, <code>c</code>, and <code>d</code> are <strong>distinct</strong>.</li>
<li><code>nums[a] + nums[b] + nums[c] + nums[d] == target</code></li>
</ul>
<p>You may return the answer in <strong>any order</strong>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,0,-1,0,-2,2], target = 0</p>
<p><strong>Output:</strong> [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [2,2,2,2,2], target = 8</p>
<p><strong>Output:</strong> <a href="2,2,2,2">2,2,2,2</a></p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 200</code></li>
<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>
<li><code>-10<sup>9</sup> <= target <= 10<sup>9</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
fourSum
-