标签：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 m andn respectively.
1 public class Solution { 2 public void merge(int A[], int m, int B[], int n) { 3 int temp[] = new int[m + n]; 4 int i = 0; 5 int j = 0; 6 int k = 0; 7 while(i < m && j < n && B.length != 0){ 8 if(A[i] < B[j]) 9 temp[k++] = A[i++]; 10 else 11 temp[k++] = B[j++]; 12 } 13 while(i < m) 14 temp[k++] = A[i++]; 15 while(j < n) 16 temp[k++] = B[j++]; 17 System.arraycopy(temp, 0, A, 0, temp.length); 18 19 } 20 }
标签：style blog io color ar sp div on log
原文地址：http://www.cnblogs.com/luckygxf/p/4083523.html
