Merge Sorted Array 合并数组并排序

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

 1 public class Solution {
 2     public void merge(int[] nums1, int m, int[] nums2, int n) {
 3           int[] newArr = new int[m+n];
 4         int i = 0,j = 0,k = 0;
 5         while(i < m || j< n)
 6         {
 7             int a = i < m ?nums1[i] :Integer.MAX_VALUE;
 8             int b = j < n ?nums2[j] :Integer.MAX_VALUE;
 9             if(a > b)
10             {
11                 newArr[k++] = b;
12                 j++;
13             }
14             else
15             {
16                 newArr[k++] = a;
17                 i++;
18             }
19         }
20         System.arraycopy(newArr, 0, nums1, 0, newArr.length);
21     }
22 }