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
我感觉楼主找出的O(n^2*log(n))的解法的时间复杂度算是最优了。但在面试中当场板书，除非已知该算法，否则我是写不出来。
iamflying
(自食其水果)
(#9938616@0)
Last Updated: 2016-2-11
This post has been archived. It cannot be replied.
Share
Report
Replies, comments and Discussions:
一道面试题，大家给出出主意哈，我一点头绪都没有
枫下论坛主坛
/
工作学习
/
学科技术