摘要：
An interesting DFS with a lot of details to take care of.class Solution { vector> ret; void go(int n, vector sofar, int minF) { int st... 阅读全文
posted @ 2015-08-23 12:43
Tonix
阅读(262)
评论(0)
推荐(0)
摘要：
Classic DP! For house[i] to pick a min-color from dp[i-1], we only need to check if color j is the min cost color index of dp[i - 1]; if yes, then we ... 阅读全文
posted @ 2015-08-23 12:21
Tonix
阅读(236)
评论(0)
推荐(0)
浙公网安备 33010602011771号