LeetCode: Merge Sorted Array [088]
2014-05-31 10:28
381 查看
【题目】
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 andn respectively.
【题意】
给定两个有序的数组A和B,把两个数组合并成一个数组。注意,本题要求把B合并到A中去,并保证A的空间足够大。
【思路】
如果按照以往处理链表合并或者申请新空间来合并的一贯做法,即从头开始依次合并,在本题的环境下会造成A中元素的大量移动。我们注意到A中有足够的空间,A数组后面的空间可以利用起来。我们换个方向,从数组尾部向头部合并,这样就避免了A中元素的移动。
【代码】
class Solution { public: void merge(int A[], int m, int B[], int n) { int pa=m-1; int pb=n-1; int p=n+m-1; while(pa>=0 && pb>=0){ if(A[pa]>B[pb]){ A[p--]=A[pa--]; } else{ A[p--]=B[pb--]; } } while(pb>=0){ A[p--]=B[pb--]; } } };
相关文章推荐
- Java for LeetCode 088 Merge Sorted Array
- 【LeetCode-面试算法经典-Java实现】【088-Merge Sorted Array(合并排序数组)】
- leetcode 088 —— Merge Sorted Array
- LeetCode088 Merge Sorted Array
- leetcode_088 Merge Sorted Array
- LeetCode 088 Merge Sorted Array
- leetcode 088 Merge Sorted Array
- 088 Merge Sorted Array [Leetcode]
- [LeetCode 088] Merge Sorted Array
- leetcode_088 Merge Sorted Array
- LeetCode(088) Merge Sorted Array(Java)
- LeetCode 088 Merge Sorted Array
- Leetcode_c++: Merge Sorted Array (088)
- [LeetCode]题解(python):088-Merge Sorted Array
- LeetCode 088 Merge Sorted Array
- 【LeetCode】Merge Sorted Array
- leetcode Merge Sorted Array
- LeetCode-Merge Sorted Array
- leetcode88 merge sorted array
- LeetCode|Merge Sorted Array -java