Median of Two Sorted Arrays LeetCode solution in Java

1
class Solution {
2
  public double findMedianSortedArrays(int[] nums1, int[] nums2) {
3
    if (nums1.length == 1 && nums2.length == 1) return (double) (nums1[0] + nums2[0]) / 2.0;
4
    int i = 0;
5
    int j = 0;
6
    int k = 0;
7
    int nums[] = new int[nums1.length + nums2.length];
8
    if (nums1.length != 0 && nums2.length != 0) {
9
      while (i < nums1.length && j < nums2.length) {
10
        if (nums1[i] < nums2[j]) {
11
          nums[k] = nums1[i];
12
          i++;
13
          k++;
14
        } else {
15
          nums[k] = nums2[j];
16
          j++;
17
          k++;
18
        }
19
      }
20
      while (i < nums1.length) {
21
        nums[k] = nums1[i];
22
        i++;
23
        k++;
24
      }
25
      while (j < nums2.length) {
26
        nums[k] = nums2[j];
27
        j++;
28
        k++;
29
      }
30
    }
31
    if (nums1.length == 0) {
32
      for (int h : nums2) {
33
        nums[k] = h;
34
        k++;
35
      }
36
    }
37

38
    if (nums2.length == 0) {
39
      for (int d : nums1) {
40
        nums[k] = d;
41
        k++;
42
      }
43
    }
44

45
    int mid = (nums.length / 2);
46

47
    if (nums.length % 2 == 0) {
48
      return ((double) nums[mid] + (double) nums[mid - 1]) / 2.0;
49
    } else {
50
      return nums[mid];
51
    }
52
  }
53
}