Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge fff80d4dc1c84220952a711b78a33028b835d497 into b70121d377cb6005eb65f12b098cd5decd905669

Browse Source
This commit is contained in:
Neo Cui 2023-07-20 02:07:08 -07:00 committed by GitHub
commit 687be30fac
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/Leetcode 题解 - 双指针.md
View File

@ -39,7 +39,7 @@ Output: index1=1, index2=2
```java ```java
public int[] twoSum(int[] numbers, int target) { public int[] twoSum(int[] numbers, int target) {
if (numbers == null) return null; if (numbers == null) return null;
int i = 0, j = numbers.length - 1; int i = 0, j = numbers.Length - 1;
while (i < j) { while (i < j) {
int sum = numbers[i] + numbers[j]; int sum = numbers[i] + numbers[j];
if (sum == target) { if (sum == target) {