leetcode -- Merge Sorted Array

标签：style   blog   color   io   strong   ar   问题   cti   

过去已无法改变，未来又难以琢磨，我们只能把握当下

[问题描述]

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.

[解题思路]

 1 void Solution::merge(int A[], int m, int B[], int n)
 2 {
 3     int p = m + n;
 4     while(p){
 5         if (n == 0)
 6             A[p-- - 1] = A[m-- - 1];
 7         else if (m == 0)
 8             A[p-- - 1] = B[n-- - 1];
 9         else
10             A[p-- - 1] = A[m - 1] > B[n - 1]?(A[m-- -1]):(B[n-- -1]);
11     }
12 }

leetcode -- Merge Sorted Array,布布扣,bubuko.com

leetcode -- Merge Sorted Array

标签：style   blog   color   io   strong   ar   问题   cti   

原文地址：http://www.cnblogs.com/taizy/p/3915627.html