Tony's Log

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

2014年7月26日

LeetCode "Populating Next Right Pointers in Each Node II"
摘要： Compared with I version, the tree could be incomplete. The only difference is that, we connect current node's child to next non-childrenless' node's f... 阅读全文
posted @ 2014-07-26 15:01 Tonix 阅读(151) 评论(0) 推荐(0)

LeetCode "Surrounded Regions"
摘要： Flood-Fill. BFS. But there's a trick. If we fill surrounded region directly, extra bookkeeping cost is needed - because we don't know whether that reg... 阅读全文
posted @ 2014-07-26 14:09 Tonix 阅读(191) 评论(0) 推荐(0)