88. Merge Sorted Array
2017-09-18 00:00
211 查看
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
if(nums1 == null || nums2 == null){
return;
}
int i = m-1;
int j = n-1;
int k = m + n -1;
while(i>=0 && j>=0){
if(nums1[i] > nums2[j]){
nums1[k--] = nums1[i--];
} else {
nums1[k--] = nums2[j--];
}
}
while(j >= 0){
nums1[k--] = nums2[j--];
}
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Lettcode_88_Merge Sorted Array ——“正难则反”的思想
- leetcode 88 Merge Sorted Array
- leetcode 88： Merge Sorted Array
- Leetcode OJ 88 Merge Sorted Array [Easy]
- LeetCode 88 Merge Sorted Array
- 88. Merge Sorted Array
- LeetCode---(88)Merge Sorted Array
- FTPrep, 88 Merge Sorted Array
- [88]Merge Sorted Array
- leetcode 88 Merge Sorted Array
- Leetcode_88_Merge Sorted Array
- 【LeetCode】88_Merge Sorted Array
- LeetCode 88：Merge Sorted Array
- leetcode 88 Merge Sorted Array
- leetcode-88-Merge Sorted Array
- 88. Merge Sorted Array
- 88 Merge Sorted Array
- leetcode[88]:Merge Sorted Array
- Java [Leetcode 88]CMerge Sorted Array
- 【leetcode】【88】Merge Sorted Array