×

Loading...

我感觉楼主找出的O(n^2*log(n))的解法的时间复杂度算是最优了。但在面试中当场板书,除非已知该算法,否则我是写不出来。

iamflying (自食其水果)
(#9938616@0)
2016-2-11 -05:00
Reply
Page address has been copied.
To share, click to copy page address.
Share Online by QR Code

Back To Topic: 一道面试题,大家给出出主意哈,我一点头绪都没有

Back To Forum: HOME枫下论坛枫下论坛主坛工作学习学科技术