Tony's Log

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

2015年7月21日

HackerRank "Sherlock and Cost"
摘要： Classic.. just classic. It is a mix of Greedy and DP. The naive DP is, iterate over all [1..Bi] which is O(n^3). However, deeper thought into the prob... 阅读全文
posted @ 2015-07-21 15:40 Tonix 阅读(694) 评论(0) 推荐(0)

LeetCode "Maximal Square"
摘要： Intuition: 2D DP. Basic idea: compose square at dp[i][j] from dp[i-1][j-1]. You need 2 facility 2D matrix: accumulated horizontal\vertical number of 1... 阅读全文
posted @ 2015-07-21 13:18 Tonix 阅读(171) 评论(0) 推荐(0)