(88) 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.

 1 public class Solution {
 2     public void merge(int A[], int m, int B[], int n) {
 3          int index = m + n;
 4         while (m > 0 && n > 0) {
 5             if (A[m - 1] > B[n - 1]) {
 6                 A[--index] = A[--m];
 7             } else {
 8                 A[--index] = B[--n];
 9             }
10         }
11         while (n > 0) {
12             A[--index] = B[--n];
13         }
14     }
15 }

https://oj.leetcode.com/problems/merge-sorted-array/

posted on 2015-02-11 15:56  lh_chuang  阅读(118)  评论(0)    收藏  举报

导航