Median of Two Sorted Arrays
来源:互联网 发布:批量查询域名是否备案 编辑:程序博客网 时间:2024/06/06 05:00
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)).
解题思路:
先求出两个数组元素个数之和numsSize,则它们的中位数可以转换成求第k小的数
double func(int* nums1, int nums1Size, int* nums2, int nums2Size, int k)
if (nums1Size > nums2Size) return func(nums2, nums2Size, nums1, nums1Size, k);if (nums1Size == 0) return nums2[k-1];if (k == 1) return (nums1[0] > nums2[0]) ? nums2[0] : nums1[0];int pos_nums1 = (k/2) > nums1Size ? nums1Size : k/2;int pos_nums2 = k - pos_nums1;if (nums1[pos_nums1 - 1] > nums2[pos_nums2 - 1]) return func(nums1, nums1Size, nums2+pos_nums2, nums2Size-pos_nums2, k-pos_nums2);if (nums1[pos_nums1 - 1] < nums2[pos_nums2 - 1]) return func(nums1+pos_nums1, nums1Size-pos_nums1, nums2, nums2Size, k-pos_nums1);else return nums1[pos_nums1-1];
}
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {
if (nums1 == NULL || nums2 == NULL) return;int numsSize = nums1Size+nums2Size;if (numsSize & 0x01 == 1)//奇数 return func(nums1, nums1Size, nums2, nums2Size, numsSize/2+1);else return (func(nums1, nums1Size, nums2, nums2Size, numsSize/2) + func(nums1, nums1Size, nums2, nums2Size, numsSize/2+1))/2.0;
}
0 0
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of two sorted arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- median-of-two-sorted-arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- 常用正则表达式大全
- maven构建项目实现对redis的操作(jedis)
- 智力题
- Android开发:用getDrawingCache方法获取ImageView中的图像需要注意的问题
- 我的搬运! 华为 t8830 pro 获取root权限,安装sqlite3,用于真机调试sqlite database
- Median of Two Sorted Arrays
- axis2结合spring发布
- 黑马程序员_集合框架(二)
- hdu 4393 Throw nails 相同的状态做相同的处理 贪心
- ARP协议的实现
- Java中加载文件时路径问题
- ios tableView 的header for section无法加载的问题
- 51nod 1393 0和1相等串(鸽巢原理)
- three Sum Closest