动态规划
文章平均质量分 81
sscssz
这个作者很懒,什么都没留下…
展开
-
【34.7】【H】【leetcode】Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2015-11-28 15:43:26 · 459 阅读 · 0 评论 -
【leetcode题解】[E][52]303. Range Sum Query - Immutable
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRan原创 2015-12-23 21:41:35 · 338 阅读 · 0 评论 -
120. Triangle【M】【95】【leetcode】
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4],原创 2016-02-24 11:06:45 · 346 阅读 · 0 评论 -
【VIP】322. Coin Change 【M】【53】【动态规划】
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money原创 2016-03-21 11:01:36 · 557 阅读 · 0 评论 -
213. House Robber II【M】【60】【leetcode】
Note: This is an extension of House Robber.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 ti原创 2016-02-26 15:44:04 · 274 阅读 · 0 评论 -
【重来】【vip】5. Longest Palindromic Substring【m】【30】【97】
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.Subscribe to s原创 2016-04-13 13:12:14 · 1266 阅读 · 0 评论 -
63. Unique Paths II【M】【30】
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 is marked as 1 and 0 respectively in the原创 2016-04-14 09:36:29 · 841 阅读 · 0 评论 -
72. Edit Distance【H】【65】
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:原创 2016-05-09 16:24:52 · 643 阅读 · 0 评论 -
413. Arithmetic Slices 【M】
A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, these are arithmetic seque原创 2016-11-13 22:05:40 · 373 阅读 · 0 评论