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

auto commit

Browse Source
This commit is contained in:
CyC2018 2021-04-19 01:03:52 +08:00
parent 01f9a926dc
commit f6c2333822
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

@ -209,7 +209,7 @@ Output: [1,2,2,3,5,6]
public void merge(int[] nums1, int m, int[] nums2, int n) { public void merge(int[] nums1, int m, int[] nums2, int n) {
int index1 = m - 1, index2 = n - 1; int index1 = m - 1, index2 = n - 1;
int indexMerge = m + n - 1; int indexMerge = m + n - 1;
while (index1 >= 0 || index2 >= 0) { while (index2 >= 0) {
if (index1 < 0) { if (index1 < 0) {
nums1[indexMerge--] = nums2[index2--]; nums1[indexMerge--] = nums2[index2--];
} else if (index2 < 0) { } else if (index2 < 0) {