×

Loading...

check this out

mustang (mustang)
it's not that hard as it looks like:

1) sort;
2) calculate delta different between current element & its immediate predecessor
3) count the longest sequence with the same delta.

code here:
http://1drv.ms/1T4l44b
(#9936192@0)
2016-2-9 -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枫下论坛枫下论坛主坛工作学习学科技术