Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

2016年4月8日

摘要: I saw the same sub-problem in LeetCode, and there exists a O(n) neat greedy solution: Please note: '[' is the first char after 'Z'. 阅读全文
posted @ 2016-04-08 03:13 Tonix 阅读(316) 评论(0) 推荐(0)

摘要: Typical topological sorting problem .. why is it 'difficult'? 阅读全文
posted @ 2016-04-08 02:26 Tonix 阅读(244) 评论(0) 推荐(0)