diff --git a/notes/Leetcode 题解 - 双指针.md b/notes/Leetcode 题解 - 双指针.md
index 1dbd48df..4ccaaeb0 100644
--- a/notes/Leetcode 题解 - 双指针.md	
+++ b/notes/Leetcode 题解 - 双指针.md	
@@ -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) {