动态规划
文章平均质量分 56
back-to-back
忙忙碌碌终日,终于一事无成。
展开
-
LeetCode 之 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原创 2015-11-26 20:19:29 · 229 阅读 · 0 评论 -
LeetCode 之 Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O原创 2016-01-14 22:47:37 · 219 阅读 · 0 评论 -
LeetCode 之 Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2016-03-13 19:37:43 · 290 阅读 · 0 评论 -
LeetCode 之 Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =原创 2016-05-06 14:03:10 · 232 阅读 · 0 评论