LeetCode 64 Merge Sorted Array
2014-09-01 11:55
260 查看
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
分析:
归并排序的中间步骤,注意点是要把最后结果放在A里,为了不覆盖A中元素,要从后向前归并。
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
分析:
归并排序的中间步骤,注意点是要把最后结果放在A里,为了不覆盖A中元素,要从后向前归并。
public class Solution { public void merge(int A[], int m, int B[], int n) { int index = m+n-1; int aIndex = m-1; int bIndex = n-1; while(aIndex>=0 && bIndex>=0){ if(A[aIndex]>=B[bIndex]){ A[index--] = A[aIndex--]; }else A[index--] = B[bIndex--]; } //如果aIndex>=0,A中元素不需要处理 while(bIndex >= 0) A[index--] = B[bIndex--]; } }
相关文章推荐
- [leetCode]Merge Sorted Array
- Leetcode 第88题 Merge Sorted Array
- 【LeetCode】Merge-sorted-array
- leetcode--Merge Sorted Array
- leetcode 88 Merge Sorted Array
- LeetCode-Merge Sorted Array
- Leetcode NO.88 Merge Sorted Array
- LeetCode (1) Merge Sorted Array
- LeetCode-Merge Sorted Array
- LeetCode小白菜笔记[21]:Merge Sorted Array
- LeetCode88 Merge Sorted Array
- leetcode_oj_Merge Sorted Array
- Leetcode Q88:Merge Sorted Array
- 《leetCode》:Merge Sorted Array
- [LeetCode] Merge Sorted Array
- LeetCode Merge Sorted Array 合并已排序的数组
- leetcode88:Merge Sorted Array
- LeetCode: Merge Sorted Array
- Leetcode Problem.88 —Merge Sorted Array
- Leetcode: Merge Sorted Array