From back to front

Author: GuanhuiGuan

Merge Sorted Array.java

@@ -0,0 +1,12 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        // from back to front
+        int i = m+n-1, j = m-1, k = n-1;
+        while(j >= 0 && k >= 0) {
+            nums1[i--] = nums1[j] > nums2[k] ? nums1[j--] : nums2[k--];
+        }
+        while(k >= 0) {
+            nums1[i--] = nums2[k--];
+        }
+    }
+}