[Leetcode] Merge Sorted Array

标签：style   blog   io   color   ar   sp   div   on   log   

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 mand n respectively.

Solution: 从后往前推。

 1 public class Solution {
 2     public void merge(int A[], int m, int B[], int n) {
 3         int i=m+n-1;
 4         int j=m-1;
 5         int k=n-1;
 6         while(j>=0&&k>=0){
 7             A[i--]=(A[j]>B[k])?A[j--]:B[k--];
 8         }
 9         while(k>=0){
10             A[i--]=B[k--];
11         }
12     }
13 }

[Leetcode] Merge Sorted Array

标签：style   blog   io   color   ar   sp   div   on   log   

原文地址：http://www.cnblogs.com/Phoebe815/p/4068320.html