题目描述： There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity sho....
分类：
其他好文 时间：
2014-12-02 18:57:38
阅读次数：
213
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be ...
分类：
其他好文 时间：
2014-11-30 19:56:07
阅读次数：
103
问题描述：
基本思想：
代码：
double findMedianSortedArrays(int A[], int m, int B[], int n) { //C++
int pre = 0;
int midpos = (m+n)/2;
bool isodd = (m+n)%2 == 1;...
分类：
其他好文 时间：
2014-11-23 14:33:47
阅读次数：
163
A fast method to determine the number is odd or even:total & 0x1 //true, if total is oddtotal & 0x1 //false, if total is evenProblem StatementThere ar...
分类：
其他好文 时间：
2014-11-21 20:28:27
阅读次数：
151
# 题目 There are two sorted arrays A and B 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)). # 思路 1. 丢掉一个最小的，...
分类：
编程语言 时间：
2014-11-11 19:26:00
阅读次数：
285
题目描述：
There are two sorted arrays A and B 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)).
思路：写一个找两个数组中第k大数的函数，...
分类：
其他好文 时间：
2014-11-11 12:45:34
阅读次数：
205
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be ...
分类：
其他好文 时间：
2014-11-10 17:15:00
阅读次数：
173
DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as muc...
分类：
其他好文 时间：
2014-11-07 16:33:31
阅读次数：
170
二分。情况讨论
class Solution {
public:
int findPos(int* p,int n,int x){
int low=0,high=n-1,mid;
while(low>1;
if(p[mid]<=x)low=mid...
分类：
其他好文 时间：
2014-11-06 00:47:00
阅读次数：
171
Weighted Median
Time Limit: 2000ms Memory limit: 65536K 有疑问？点这里^_^
题目描述
For n elements x1,?x2,?...,?xn with positive integer weights w1,?w2,?...,?wn. The weighted median is the...
分类：
其他好文 时间：
2014-11-04 22:51:14
阅读次数：
290
