leetcode整理 Dynamic Programming
StudyCoder
这个作者很懒,什么都没留下…
展开
-
70. Climbing Stairs
题目:You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?题意:你在爬楼梯的情景下,到顶转载 2016-07-11 10:18:15 · 264 阅读 · 0 评论 -
198. 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 adjac转载 2016-07-11 09:47:34 · 364 阅读 · 0 评论 -
95. Unique Binary Search Trees II
题目:唯一的二叉搜索树2Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's转载 2016-07-16 16:17:57 · 239 阅读 · 0 评论 -
96. Unique Binary Search Trees
题目:Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2转载 2016-07-16 11:25:52 · 297 阅读 · 0 评论 -
368. Largest Divisible Subset
题目:Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If there are multiple转载 2016-07-16 10:48:51 · 490 阅读 · 0 评论 -
357. Count Numbers with Unique Digits
题目:Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x [11,转载 2016-07-16 10:10:20 · 367 阅读 · 0 评论 -
304. Range Sum Query 2D - Immutable
题目:Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).The above rectangle (with t转载 2016-07-12 11:07:38 · 309 阅读 · 0 评论 -
309. Best Time to Buy and Sell Stock with Cooldown
题目:Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i转载 2016-07-12 10:17:49 · 282 阅读 · 0 评论 -
322. Coin Change
题目: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转载 2016-07-11 16:08:01 · 371 阅读 · 0 评论 -
338. Counting Bits
题目:Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:Fo转载 2016-07-11 15:26:07 · 379 阅读 · 0 评论 -
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) ->转载 2016-07-11 12:19:38 · 303 阅读 · 0 评论 -
221. Maximal Square
题目:最大正方形Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11 1 1 1转载 2016-07-16 18:01:08 · 281 阅读 · 0 评论