https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/

Author: masx200

README.md

@@ -618,6 +618,8 @@ https://leetcode.cn/problems/NYBBNL/
 
 https://leetcode.cn/problems/increasing-order-search-tree/
 
+https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/
+
 #### 安装教程
 
 1. 安装`deno`

two-sum-ii-input-array-is-sorted/index.ts

@@ -0,0 +1,17 @@
+export default function twoSum(numbers: number[], target: number): number[] {
+    let left = 0;
+    let right = numbers.length - 1;
+
+    while (right - left >= 1) {
+        const sum = numbers[left] + numbers[right];
+
+        if (sum === target) {
+            return [left + 1, right + 1];
+        } else if (sum < target) {
+            left++;
+        } else {
+            right--;
+        }
+    }
+    return [-1, -1];
+}