四刷167

Author: diguage

docs/0167-two-sum-ii-input-array-is-sorted.adoc

@@ -1,23 +1,49 @@
 [#0167-two-sum-ii-input-array-is-sorted]
-= 167. Two Sum II - Input array is sorted
+= 167. 两数之和 II - 输入有序数组
 
-{leetcode}/problems/two-sum-ii-input-array-is-sorted/[LeetCode - Two Sum II - Input array is sorted^]
+https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/[LeetCode - 167. 两数之和 II - 输入有序数组 ^]
 
-Given an array of integers that is already **sorted in ascending order**, find two numbers such that they add up to a specific target number.
+给你一个下标从 *1* 开始的整数数组 `numbers` ，该数组已按 *非递减顺序排列* ，请你从数组中找出满足相加之和等于目标数 `target` 的两个数。如果设这两个数分别是 `+numbers[index~1~]+` 和 `+numbers[index~2~]+` ，则 `+1 <= index~1~ < index~2~ <= numbers.length+` 。
 
-The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.
+以长度为 2 的整数数组 `+[index~1~, index~2~]+` 的形式返回这两个整数的下标 `index~1~` 和 `index~2~`。
 
-*Note:*
+你可以假设每个输入 *只对应唯一的答案* ，而且你 *不可以* 重复使用相同的元素。
 
-* Your returned answers (both index1 and index2) are not zero-based.
-* You may assume that each input would have *exactly* one solution and you may not use the *same* element twice.
+你所设计的解决方案必须只使用常量级的额外空间。
+
+*示例 1：*
+
+....
+输入：numbers = [2,7,11,15], target = 9
+输出：[1,2]
+解释：2 与 7 之和等于目标数 9 。因此 index1 = 1, index2 = 2 。返回 [1, 2] 。
+....
+
+*示例 2：*
+
+....
+输入：numbers = [2,3,4], target = 6
+输出：[1,3]
+解释：2 与 4 之和等于目标数 6 。因此 index1 = 1, index2 = 3 。返回 [1, 3] 。
+....
+
+*示例 3：*
+
+....
+输入：numbers = [-1,0], target = -1
+输出：[1,2]
+解释：-1 与 0 之和等于目标数 -1 。因此 index1 = 1, index2 = 2 。返回 [1, 2] 。
+....
+
+
+*提示：*
+
+* `2 \<= numbers.length \<= 3 * 10^4^`
+* `+-1000 <= numbers[i] <= 1000+`
+* `numbers` 按 *非递减顺序* 排列
+* `+-1000 <= target <= 1000+`
+* *仅存在一个有效答案*
 
-.Example:
-----
-Input: numbers = [2,7,11,15], target = 9
-Output: [1,2]
-Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
-----
 
 == 思路分析
 
@@ -62,8 +88,18 @@ include::{sourcedir}/_0167_TwoSumIIInputArrayIsSorted_2.java[tag=answer]
 include::{sourcedir}/_0167_TwoSumIIInputArrayIsSorted_3.java[tag=answer]
 ----
 --
+
+四刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0167_TwoSumIiInputArrayIsSorted_4.java[tag=answer]
+----
+--
 ====
 
+
 == 参考资料
 
 . https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/solutions/337156/liang-shu-zhi-he-ii-shu-ru-you-xu-shu-zu-by-leet-2/[167. 两数之和 II - 输入有序数组 - 官方题解^]

logbook/202503.adoc

@@ -543,6 +543,11 @@ endif::[]
 |{doc_base_url}/0670-maximum-swap.adoc[题解]
 |✅ 贪心算法。最高位尽可能跟后面的最大数字进行交换。
 
+|{counter:codes2503}
+|{leetcode_base_url}/two-sum-ii-input-array-is-sorted/[167. Two Sum II - Input array is sorted^]
+|{doc_base_url}/0167-two-sum-ii-input-array-is-sorted.adoc[题解]
+|✅ 双指针
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

src/main/java/com/diguage/algo/leetcode/_0167_TwoSumIiInputArrayIsSorted_4.java

@@ -0,0 +1,25 @@
+package com.diguage.algo.leetcode;
+
+public class _0167_TwoSumIiInputArrayIsSorted_4 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-04-29 08:30
+   */
+  public int[] twoSum(int[] numbers, int target) {
+    int left = 0, right = numbers.length - 1;
+    while (left < right) {
+      int sum = numbers[left] + numbers[right];
+      if (sum == target) {
+        break;
+      } else if (sum < target) {
+        left++;
+      } else {
+        right--;
+      }
+    }
+    return new int[]{left + 1, right + 1};
+  }
+  // end::answer[]
+}