标签：script find cti amp ret function .so time else
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
Solution:
var findMedianSortedArrays = function(nums1, nums2) { var num = nums1.concat(nums2) nums = num.sort(function (a,b) { return a>b? 1:-1; }) if(nums.length%2 == 0) { return (nums[nums.length/2-1]+nums[nums.length/2])/2; } else { return nums[Math.floor(nums.length/2)] } };
4. Median of Two Sorted Arrays
标签：script find cti amp ret function .so time else
原文地址：http://www.cnblogs.com/witchgogogo/p/7266317.html
