Update Leetcode 题解 - 双指针.md

Fix the typo
2021-11-17 21:56:30 +08:00 · 2021-11-17 21:56:30 +08:00 · fff80d4dc1
commit fff80d4dc1
parent 456ff183d5
1 changed files with 1 additions and 1 deletions
--- a/notes/Leetcode
+++ b/notes/Leetcode
@ -39,7 +39,7 @@ Output: index1=1, index2=2
 ```java
 public int[] twoSum(int[] numbers, int target) {
    if (numbers == null) return null;
-    int i = 0, j = numbers.length - 1;
+    int i = 0, j = numbers.Length - 1;
    while (i < j) {
        int sum = numbers[i] + numbers[j];
        if (sum == target) {