摘要：
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
阅读(163)
评论(0)
推荐(0)
摘要：
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
阅读(195)
评论(0)
推荐(0)
浙公网安备 33010602011771号