Create README - LeetHub

    source:2c230995811c1ec12cb02b44eabe503c84e422e0

Author: yeyounging

공예영/9주차/0016-3sum-closest/README.md

@@ -0,0 +1,31 @@
+<h2><a href="https://leetcode.com/problems/3sum-closest">16. 3Sum Closest</a></h2><h3>Medium</h3><hr><p>Given an integer array <code>nums</code> of length <code>n</code> and an integer <code>target</code>, find three integers at <strong>distinct indices</strong> in <code>nums</code> such that the sum is closest to <code>target</code>.</p>
+
+<p>Return <em>the sum of the three integers</em>.</p>
+
+<p>You may assume that each input would have exactly one solution.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [-1,2,1,-4], target = 1
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,0,0], target = 1
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> The sum that is closest to the target is 0. (0 + 0 + 0 = 0).
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>3 &lt;= nums.length &lt;= 500</code></li>
+	<li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
+	<li><code>-10<sup>4</sup> &lt;= target &lt;= 10<sup>4</sup></code></li>
+</ul>