Merge Sorted Array--LeetCode
2015-04-13 11:37
369 查看
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的空间够,那么从后往前开始填充即可
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的空间够,那么从后往前开始填充即可
void merge(int A[], int m, int B[], int n) { int i,j=m-1; int cur= m+n-1; for(i=n-1;i>=0;) { if(A[j] > B[i]) A[cur--] = A[j--]; else A[cur--] = B[i--]; } }
相关文章推荐
- 【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(088) Merge Sorted Array(Java)
- [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