标签：style blog http color io strong ar div cti
LeetCode: Merge Sorted Array
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.
地址：https://oj.leetcode.com/problems/merge-sorted-array/
直接给代码吧：
1 class Solution {
2 public:
3 void merge(int A[], int m, int B[], int n) {
4 if(m < 0 || n <= 0) return ;
5 int i_A = m - 1, i_B = n - 1;
6 int i_AB = m + n - 1;
7 while(i_A >= 0 && i_B >= 0){
8 if(A[i_A] < B[i_B]){
9 A[i_AB--] = B[i_B--];
10 }else{
11 A[i_AB--] = A[i_A--];
12 }
13 }
14 while(i_B >= 0){
15 A[i_AB--] = B[i_B--];
16 }
17 return ;
18 }
19 };
标签：style blog http color io strong ar div cti
原文地址：http://www.cnblogs.com/boostable/p/leetcode_merge_sorted_array.html
