随笔分类 -  leetcode:DP

leetCode 63 Unique Paths II
摘要：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文
posted @ 2015-05-30 04:12 爱刷题的小盒子 阅读(1407) 评论(0) 推荐(0)
LeetCode198 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 yo... 阅读全文
posted @ 2015-05-30 01:39 爱刷题的小盒子 阅读(191) 评论(0) 推荐(0)
LeetCode 64 Minimum Path Sum
摘要：Minimum Path SumGiven amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along ... 阅读全文
posted @ 2015-05-30 01:26 爱刷题的小盒子 阅读(150) 评论(0) 推荐(0)
LeetCode 123 Best Time to Buy and Sell Stock III
摘要：123Best Time to Buy and Sell Stock IIISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find ... 阅读全文
posted @ 2015-05-28 13:46 爱刷题的小盒子 阅读(633) 评论(0) 推荐(0)
leetCode 122 Best Time to Buy and Sell Stock II
摘要：leetCode 122 Best Time to Buy and Sell Stock IISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm... 阅读全文
posted @ 2015-05-27 10:42 爱刷题的小盒子 阅读(158) 评论(0) 推荐(0)
leetCode 121 Best Time to Buy and Sell Stock
摘要：leetCode 121 Best Time to Buy and Sell StockSay you have an array for which theithelement is the price of a given stock on dayi.If you were only permi... 阅读全文
posted @ 2015-05-27 09:30 爱刷题的小盒子 阅读(211) 评论(0) 推荐(0)
LeetCode 62 Unique Paths
摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2015-05-27 08:48 爱刷题的小盒子 阅读(182) 评论(0) 推荐(0)
LeetCode 70 Climbing Stairs
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2015-05-27 08:24 爱刷题的小盒子 阅读(166) 评论(0) 推荐(0)
LeetCode: 53 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,... 阅读全文
posted @ 2015-05-27 08:14 爱刷题的小盒子 阅读(148) 评论(0) 推荐(0)
leetcode 96: Unique Binary Search Trees java
摘要：96:Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's.1... 阅读全文
posted @ 2015-05-26 13:44 爱刷题的小盒子 阅读(1705) 评论(0) 推荐(0)