Tony's Log

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

2017年12月23日

HackerRank "Richie Rich"
摘要： Fun Greedy. My first thought was a DFS based solution... however the editorial provides a super neat 2-pass O(n) solution: Pass 1: if s[l] != s[r], ch 阅读全文
posted @ 2017-12-23 10:32 Tonix 阅读(127) 评论(0) 推荐(0)