摘要：
Recursion of course. But please make sure you cover all the cases. class Solution(object): # return: max value with node picked, max val w\o node pick 阅读全文
posted @ 2016-03-12 14:09
Tonix
阅读(139)
评论(0)
推荐(0)
摘要：
Backtrace idea is straightforward. But there are always smarter solutions - like this: https://leetcode.com/discuss/87314/non-recursive-time-space-sol 阅读全文
posted @ 2016-03-12 08:15
Tonix
阅读(136)
评论(0)
推荐(0)
浙公网安备 33010602011771号