88. Merge Sorted Array
# Easy
Merge to nums1 from the end to beginning.
逆向思维
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int p1 = m - 1, p2 = n - 1, p = m + n - 1;;
while(p1 >= 0 && p2 >= 0) {
if(nums1[p1] >= nums2[p2]) {
nums1[p] = nums1[p1];
p1 --;
} else {
nums1[p] = nums2[p2];
p2 --;
}
p --;
}
while(p2 >= 0) {
nums1[p] = nums2[p2];
p2 --;
p --;
}
}
}
Time complexity:
Last updated
Was this helpful?