Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

如果真的有比O(m+n)快的那应该是考虑:两"有序"数组,根据有序不知能否进行优化呢。。。还是说有序的本来就是o(n+m).其实我不懂，只是-____-弱弱发下见解

Posted by majia5 at 2008-10-23 17:41:10 and last updated at 2008-10-23 17:43:28
In Reply To:请教高手一个面试题 Posted by:lastview at 2008-10-23 12:02:55

> 两有序数组，长度分别m,n，求交。
> 
> 求世界上最快算法。比O(m+n)快的。

Followed by:

Post your reply here:

Home Page Go Back To top