Median of Two Sorted Arrays

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Example 1:

nums1 = [1, 3]
nums2 = [2]

The median is 2.0

 

Example 2:

nums1 = [1, 2]
nums2 = [3, 4]

The median is (2 + 3)/2 = 2.5

 

大体就是把两个数组合并起来，经过排序求最中间的数是多少，代码如下;

var findMedianSortedArrays = function(nums1, nums2) {
    var newArr=nums1.concat(nums2);
                    var number;

                    //交换排序
                    for(var i=0;i<newArr.length;i++){
                        for(var j=i+1;j<newArr.length;j++){
                             if(newArr[i]>newArr[j]){
                                    var temp=newArr[i];
                                    newArr[i]=newArr[j];
                                    newArr[j]=temp;
                             }
                        }
                         //console.log(newArr[i]);
                    }
                    if(newArr.length%2==0){
                          number=(newArr[newArr.length/2]+newArr[newArr.length/2-1])/2;
                    }else{
                          number=newArr[(newArr.length-1)/2];
                    }
                    return number;
};