Merge Sorted Array
2016-02-22 11:11
369 查看
Leetcode
public void merge(int[] nums1, int m, int[] nums2, int n) {
int end = m + n - 1;
int start = m - 1;
int i=m-1,j=n-1;
if(m==0){
for (int k = 0;k<n;k++){
nums1[k] = nums2[k];
}
return;
}else if (n==0){
return;
}
while (i>=0 && j>=0) {
if (nums1[i] >= nums2[j]) {
nums1[end--] = nums1[i--];
} else {
nums1[end--] = nums2[j--];
}
}
while (i>=0){
nums1[end--] = nums1[i--];
}
while(j>=0){
nums1[end--] = nums2[j--];
}
}遇到多个数组或者链表的合并或者其他操作时，从前往后都比较复杂，可以考虑从后向前操作
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解