美文网首页
Median of Two Sorted Arrays

Median of Two Sorted Arrays

作者: sunner168 | 来源:发表于2017-06-24 10:54 被阅读11次

题目

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

作答

js

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
var findMedianSortedArrays = function(nums1, nums2) {
    var newArr = nums1.concat(nums2),mid = 0,temp=0;
  newArr.sort(function(a,b){
      return a-b;
  });
    if(newArr){
        mid = newArr.length/2;
        temp = Math.floor(mid);
        if(temp != mid){
               //奇数
               return newArr[temp];
        }else{
             //偶数
               return (newArr[mid]+newArr[mid-1])/2;
        }
    }
};

拓展笔记

深入了解javacript sort

相关文章

网友评论

      本文标题:Median of Two Sorted Arrays

      本文链接:https://www.haomeiwen.com/subject/gdxkcxtx.html