码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode OJ 4. Median of Two Sorted Arrays

时间:2016-08-25 23:58:26      阅读:342      评论:0      收藏:0      [点我收藏+]

标签:

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

Subscribe to see which companies asked this question


【题目分析】

给定两个升序排列的整数数组,找到这两个数组所有元素的中位数。


【思路】

技术分享技术分享技术分享技术分享技术分享技术分享

LeetCode OJ 4. Median of Two Sorted Arrays

标签:

原文地址:http://www.cnblogs.com/liujinhong/p/5808722.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!