DynamicProgramming
Hsueh YH
这个作者很懒,什么都没留下…
展开
-
Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1]原创 2017-05-20 17:17:51 · 229 阅读 · 0 评论 -
House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2017-05-20 17:28:03 · 253 阅读 · 0 评论 -
House Robber II (houses are arranged in a circle)
题目描述:After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arrange原创 2017-05-20 17:53:01 · 262 阅读 · 0 评论