easy JAVA version to understand


  • 0
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
            Arrays.sort(nums1);
            Arrays.sort(nums2);
            int[] c = new int[nums1.length + nums2.length];
            int i = 0, j = 0, k = 0;
            while(i < nums1.length && j < nums2.length) {
                if (nums1[i] <= nums2[j]) {
                   c[k++] = nums1[i++];
                }
                else {
                    c[k++] = nums2[j++];
                }
            }
            while (i < nums1.length) {
                c[k++] = nums1[i++];
            }
            while (j < nums2.length) {
                c[k++] = nums2[j++];
            }
            return k % 2 == 0 ? (c[k / 2 - 1] + c[k / 2]) / 2.0 : c[k / 2];
        }
    

  • 0
    Y

    nice solution, easy to understand


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.