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

 

Solution: 从后往前推。

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int i=m+n-1;
        int j=m-1;
        int k=n-1;
        while(j>=0&&k>=0){
            A[i--]=(A[j]>B[k])?A[j--]:B[k--];
        }
        while(k>=0){
            A[i--]=B[k--];
        }
    }
}