Create README - LeetHub

hajin-kim · hajin-kim · commit 7cbfe4b536cb · 2025-04-27T18:34:59.000+09:00
diff --git a/0167-two-sum-ii-input-array-is-sorted/README.md b/0167-two-sum-ii-input-array-is-sorted/README.md
@@ -0,0 +1,43 @@
+<h2><a href="https://leetcode.com/problems/two-sum-ii-input-array-is-sorted">167. Two Sum II - Input Array Is Sorted</a></h2><h3>Medium</h3><hr><p>Given a <strong>1-indexed</strong> array of integers <code>numbers</code> that is already <strong><em>sorted in non-decreasing order</em></strong>, find two numbers such that they add up to a specific <code>target</code> number. Let these two numbers be <code>numbers[index<sub>1</sub>]</code> and <code>numbers[index<sub>2</sub>]</code> where <code>1 &lt;= index<sub>1</sub> &lt; index<sub>2</sub> &lt;= numbers.length</code>.</p>
+
+<p>Return<em> the indices of the two numbers, </em><code>index<sub>1</sub></code><em> and </em><code>index<sub>2</sub></code><em>, <strong>added by one</strong> as an integer array </em><code>[index<sub>1</sub>, index<sub>2</sub>]</code><em> of length 2.</em></p>
+
+<p>The tests are generated such that there is <strong>exactly one solution</strong>. You <strong>may not</strong> use the same element twice.</p>
+
+<p>Your solution must use only constant extra space.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> numbers = [<u>2</u>,<u>7</u>,11,15], target = 9
+<strong>Output:</strong> [1,2]
+<strong>Explanation:</strong> The sum of 2 and 7 is 9. Therefore, index<sub>1</sub> = 1, index<sub>2</sub> = 2. We return [1, 2].
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> numbers = [<u>2</u>,3,<u>4</u>], target = 6
+<strong>Output:</strong> [1,3]
+<strong>Explanation:</strong> The sum of 2 and 4 is 6. Therefore index<sub>1</sub> = 1, index<sub>2</sub> = 3. We return [1, 3].
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> numbers = [<u>-1</u>,<u>0</u>], target = -1
+<strong>Output:</strong> [1,2]
+<strong>Explanation:</strong> The sum of -1 and 0 is -1. Therefore index<sub>1</sub> = 1, index<sub>2</sub> = 2. We return [1, 2].
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= numbers.length &lt;= 3 * 10<sup>4</sup></code></li>
+	<li><code>-1000 &lt;= numbers[i] &lt;= 1000</code></li>
+	<li><code>numbers</code> is sorted in <strong>non-decreasing order</strong>.</li>
+	<li><code>-1000 &lt;= target &lt;= 1000</code></li>
+	<li>The tests are generated such that there is <strong>exactly one solution</strong>.</li>
+</ul>

-Original file line number
+Diff line change
@@ @@ -0,0 +1,43 @@ @@
 +<h2><a href="https://leetcode.com/problems/two-sum-ii-input-array-is-sorted">167. Two Sum II - Input Array Is Sorteda>h2><h3>Mediumh3><hr><p>Given a <strong>1-indexedstrong> array of integers <code>numberscode> that is already <strong><em>sorted in non-decreasing orderem>strong>, find two numbers such that they add up to a specific <code>targetcode> number. Let these two numbers be <code>numbers[index<sub>1sub>]code> and <code>numbers[index<sub>2sub>]code> where <code>1 &lt;= index<sub>1sub> &lt; index<sub>2sub> &lt;= numbers.lengthcode>.p>
++
 +<p>Return<em> the indices of the two numbers, em><code>index<sub>1sub>code><em> and em><code>index<sub>2sub>code><em>, <strong>added by onestrong> as an integer array em><code>[index<sub>1sub>, index<sub>2sub>]code><em> of length 2.em>p>
++
 +<p>The tests are generated such that there is <strong>exactly one solutionstrong>. You <strong>may notstrong> use the same element twice.p>
++
 +<p>Your solution must use only constant extra space.p>
++
 +<p>&nbsp;p>
 +<p><strong class="example">Example 1:strong>p>
++
 +<pre>
 +<strong>Input:strong> numbers = [<u>2u>,<u>7u>,11,15], target = 9
 +<strong>Output:strong> [1,2]
 +<strong>Explanation:strong> The sum of 2 and 7 is 9. Therefore, index<sub>1sub> = 1, index<sub>2sub> = 2. We return [1, 2].
 +pre>
++
 +<p><strong class="example">Example 2:strong>p>
++
 +<pre>
 +<strong>Input:strong> numbers = [<u>2u>,3,<u>4u>], target = 6
 +<strong>Output:strong> [1,3]
 +<strong>Explanation:strong> The sum of 2 and 4 is 6. Therefore index<sub>1sub> = 1, index<sub>2sub> = 3. We return [1, 3].
 +pre>
++
 +<p><strong class="example">Example 3:strong>p>
++
 +<pre>
 +<strong>Input:strong> numbers = [<u>-1u>,<u>0u>], target = -1
 +<strong>Output:strong> [1,2]
 +<strong>Explanation:strong> The sum of -1 and 0 is -1. Therefore index<sub>1sub> = 1, index<sub>2sub> = 2. We return [1, 2].
 +pre>
++
 +<p>&nbsp;p>
 +<p><strong>Constraints:strong>p>
++
 +<ul>
 +	2 <= numbers.length <= 3 * 10⁴
 +	-1000 <= numbers[i] <= 1000
 +	numbers is sorted in non-decreasing order.
 +	-1000 <= target <= 1000
 +	The tests are generated such that there is exactly one solution.
 +ul>