动态规划
Carl_Hugo
Knowledge is Power
展开
-
213. House Robber II
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 t...原创 2018-03-13 09:09:34 · 169 阅读 · 0 评论 -
650. 2 Keys Keyboard
Initially on a notepad only one character ‘A’ is present. You can perform two operations on this notepad for each step: Copy All: You can copy all the characters present on the notepad (p...原创 2018-03-13 09:14:16 · 197 阅读 · 0 评论 -
300. Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence. For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2,...原创 2018-03-13 09:19:04 · 143 阅读 · 0 评论 -
718. Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,3,2,1] B: [3,2,1,4,7] Output: 3 Explana...原创 2018-03-13 09:23:38 · 136 阅读 · 0 评论 -
152. Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] h...原创 2018-03-13 09:26:23 · 192 阅读 · 0 评论 -
64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down o...原创 2018-03-13 09:30:42 · 133 阅读 · 0 评论 -
279. 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; gi...原创 2018-03-13 09:35:27 · 163 阅读 · 0 评论 -
486. Predict the Winner
Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player...原创 2018-03-13 09:48:10 · 139 阅读 · 0 评论 -
120. Triangle
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],...原创 2018-03-13 09:51:15 · 147 阅读 · 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...原创 2018-03-13 09:53:50 · 172 阅读 · 0 评论 -
62. 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 bo...原创 2018-03-13 09:56:32 · 157 阅读 · 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 adjace...原创 2018-03-13 09:02:04 · 161 阅读 · 0 评论 -
查找最长回文子序列
解题思路: dp[i][j]表示字符串索引从i~j之间是否为最长回文子序列(长度) 状态转移方程dp[i][j] = dp[i+1][j-1]+1 if(str[i]==str[j]) max(dp[i+1][j],dp[i][j-1]) if(str[i]!=str[j])边界dp[i][i] = 1dp[i...原创 2018-03-13 08:58:43 · 482 阅读 · 0 评论 -
[LeetCode]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 so...原创 2018-03-12 19:42:57 · 232 阅读 · 0 评论 -
【LeetCode】516. Longest Palindromic Subsequence
Given a string s, find the longest palindromic subsequence’s length in s. You may assume that the maximum length of s is 1000. Example 1: Input: “bbbab” Output: 4 One po...原创 2018-03-12 19:57:24 · 203 阅读 · 0 评论 -
221. Maximal Square
Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area. For example, given the following matrix: 1 0 1 0 0 1 0 1 ...原创 2018-03-12 20:12:42 · 107 阅读 · 0 评论 -
673. Number of Longest Increasing Subsequence
Given an unsorted array of integers, find the number of longest increasing subsequence. Example 1: Input: [1,3,5,4,7] Output: 2 Explanation: The two longest increasing subsequ...原创 2018-03-12 20:31:23 · 118 阅读 · 0 评论 -
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 is marked as 1 and 0 respective...原创 2018-03-12 20:41:30 · 122 阅读 · 0 评论 -
Word Break 139
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You ...原创 2018-03-12 20:46:10 · 140 阅读 · 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 (...原创 2018-03-12 20:50:37 · 227 阅读 · 0 评论 -
714. Best Time to Buy and Sell Stock with Transaction Fee
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee. You may compl...原创 2018-03-12 22:03:23 · 161 阅读 · 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 o...原创 2018-03-12 22:07:37 · 279 阅读 · 0 评论 -
377. Combination Sum IV
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. Example: nums = [1, 2, 3] t...原创 2018-03-12 22:52:02 · 150 阅读 · 0 评论 -
740. Delete and Earn
Given an array nums of integers, you can perform operations on the array. In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must delete every elemen...原创 2018-03-13 08:48:51 · 172 阅读 · 0 评论 -
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? Note: Given n wi...原创 2018-03-20 15:42:43 · 185 阅读 · 0 评论