Tony's Log

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

2016年1月6日

LeetCode "Maximum Size Subarray Sum Equals k"
摘要： Nothing special. Point is, how clean can you do it?class Solution {public: int maxSubArrayLen(vector& nums, int k) { int n = nums.size()... 阅读全文
posted @ 2016-01-06 18:33 Tonix 阅读(162) 评论(0) 推荐(0)

LeetCode "Coin Change"
摘要： 1AC. Intuitive DP. But please note the if condition, there's a trick - we cannot build upon an invalid dp slot.class Solution {public: int coinChan... 阅读全文
posted @ 2016-01-06 18:29 Tonix 阅读(194) 评论(0) 推荐(0)