正西风落叶下长安

π seconds equal to one nano-century.

[Leetcode刷题总结系列][Dynamic programming][Divide-and-conquer]53.Maximum Subarray

leetcode 53.Maximum Subarray Find a continguous subarray within an array (containing at least one number) which has the largest sum. 找到一个数组中一个连续相加之和最...

2016-04-29 08:59:40

阅读数 690

评论数 0

Knapsack Problem|背包问题

Knapsack Problem,背包问题 本文详细分析了0-1背包问题(0-1 Knapsack Problem )和部分背包问题(Fractional knapsack Problem),给出了具体的解决算法和算法分析。

2016-04-28 09:18:17

阅读数 961

评论数 0

[Leetcode刷题总结系列][Dynamic programming]198. House Robber

Leetcode 198. House Robber You are a professional robber who is planing to rob houses along a street. Each house has a certain amount of money stashe...

2016-04-25 09:40:34

阅读数 348

评论数 0

[Leetcode刷题总结系列][Dynamic programming] 121. Best time to buy and sell stock

Leetcode 121. Best time to buy and sell stock

2016-04-24 08:36:49

阅读数 881

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭