Tony's Log

Algorithms, Distributed System, Machine Learning
  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

2016年10月24日

LeetCode "Is Subsequence"
摘要： There are 3 possible approaches: DP, divide&conquer and greedy. And apparently, DP has O(n^2) complexity (TLE), DivideConquer can only be worse. Greed 阅读全文
posted @ 2016-10-24 03:25 Tonix 阅读(96) 评论(0) 推荐(0)