http://oj.leetcode.com/problems/merge-sorted-array/
合并两个数组,因为A的空间足够大,把B加到A后快排即可
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
for(int i = m; i
http://oj.leetcode.com/problems/merge-sorted-array/
合并两个数组,因为A的空间足够大,把B加到A后快排即可
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
for(int i = m; i