[leetcode] merge sorted array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
The number of elements initialized in nums1 and nums2 are m and n respectively.

• 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

  public void (int[] nums1, int m, int[] nums2, int n) { for (int i = m + n - 1; i >= 0; i--) { if (n == 0) { break; } if (m == 0) { for (int j = 0; j < n; j++) { nums1[j] = nums2[j]; } break; } if (nums1[m - 1] > nums2[n - 1]) { nums1[i] = nums1[m - 1]; m--; } else { nums1[i] = nums2[n - 1]; n--; } } }