LeetCode:Merge Sorted Array
2015-02-02 21:58
387 查看
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.
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.
// https://oj.leetcode.com/problems/merge-sorted-array/ // Author : Chao Zeng // Date : 2015-2-2 class Solution { public: void merge(int A[], int m, int B[], int n) { int newlength = m + n - 1; int length1 = m - 1; int length2 = n - 1; //两个数组末尾开始比较 while(length1 >= 0 && length2 >= 0){ if (A[length1] > B[length2]){ A[newlength] = A[length1]; length1--; } else{ A[newlength] = B[length2]; length2--; } newlength--; } //如果数组B比数组A长 while(length2 >= 0){ A[newlength] = B[length2]; length2--; newlength--; } } };
相关文章推荐
- 【LeetCode with Python】 Merge Sorted Array
- LeetCode || Merge Sorted Array
- leetcode Merge Sorted Array
- [leetcode] Merge Sorted Array
- Merge Sorted Array ---leetcode---AC1
- [leetcode][array][two pointers] Merge Sorted Array
- [LeetCode]Merge Sorted Array
- LeetCode - Merge Sorted Array
- leetcode-Merge Sorted Array
- [LeetCode]题解(python):088-Merge Sorted Array
- 【Leetcode】【Easy】Merge Sorted Array
- LeetCode小白菜笔记[21]:Merge Sorted Array
- [leetcode] Merge Sorted Array
- 【LeetCode】-Merge Sorted Array
- leetcode 之 Merge Sorted Array
- LeetCode编程练习 - Merge Sorted Array学习心得
- LeetCode--No.88--Merge Sorted Array
- 【Leetcode】 Merge Sorted Array
- leetcode第88题-Merge Sorted Array
- [Leetcode] Merge Sorted Array