Tony's Log

Algorithms, Distributed System, Machine Learning

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

I prefer shorter code, so this one:
https://discuss.leetcode.com/topic/75448/memoization-c-solution

Please note: we don't want to be too greedy - desperately shrink the string from one side - no, that may not be a global optimal solution. So, we simply do DFS, putting char from hand into each slot - however, we always put same char, not new char, because we are trying to accumulate, not creating new one.

posted on 2017-01-22 12:08  Tonix  阅读(248)  评论(0)    收藏  举报