This website requires Javascript to function properly. Please go to the setting of your web browser and enable Javascript for this website.
×
Loading...
Close
Home
Share
不错,思路干净简洁。感觉平均不会close to O(n^2) ,可能会O(n^2*log(n))。我觉得应该有O(n^2)的算法,不过解释起来比较复杂,如果周末有空我会贴上来。
geekcode
(文心雕码)
(#9938556@0)
Last Updated: 2016-2-10
This post has been archived. It cannot be replied.
Share
Report
Replies, comments and Discussions:
一道面试题,大家给出出主意哈,我一点头绪都没有
枫下论坛主坛
/
工作学习
/
学科技术