动态规划
文章平均质量分 62
hling_so
这个作者很懒,什么都没留下…
展开
-
413. Arithmetic Slices
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, thes原创 2017-11-07 17:11:27 · 127 阅读 · 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: 3Explanation: The repeated subarray wit原创 2017-11-25 19:47:14 · 181 阅读 · 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 adjacent hous原创 2017-11-25 19:55:40 · 137 阅读 · 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) -> -1sumRange(0, 5)原创 2017-11-25 20:01:08 · 142 阅读 · 0 评论 -
91. Decode Ways
题目A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total number of原创 2017-11-25 20:05:07 · 140 阅读 · 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, 3, 7, 101], therefo原创 2017-11-25 20:21:37 · 150 阅读 · 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 or right at an原创 2017-11-25 20:31:06 · 125 阅读 · 0 评论 -
474. Ones and Zeroes
题目In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the other h原创 2017-11-25 20:36:34 · 168 阅读 · 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]target = 4The possible c原创 2017-11-25 20:45:47 · 253 阅读 · 0 评论 -
746. Min Cost Climbing Stairs
题目题意cost数组存放了每一级楼梯的花费, 要经过这一级就要付出相应的花费, 每次可以走1~2级, 可以选择从第0级和第1级开始走, 问走到顶(n)的最少花费是多少?(级数从0开始编号,对应开销cost[0])分析一些转化: 可以选择从第0级和第1级开始走->加一个第-1级,cost为0,从-1级出发 走到顶(n)->加一个第n级, cost为0, 走到第n级才算走完(前一步可以是n-1或者n原创 2017-12-24 23:51:24 · 205 阅读 · 0 评论 -
638. Shopping Offers
题目题意不同的商品i有不同需求needs[i] 有些特价组合special[],对应每一种商品i有相应的数量,买相应的数量就可以用组合价(但是有一些组合未必会比单买便宜) 求恰好买够需求needs[]的的最低总价.分析用动态规划+DFS 每一次调用遍历一次组合special[i], 看剩余的需求里面能不能用组合i的方式购买,如果可以,则使用组合i,并且减去相应的need的数量,剩余的数量再调用原创 2017-12-24 23:51:00 · 380 阅读 · 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] has the larges...原创 2017-12-17 22:50:27 · 145 阅读 · 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 respectively in the gr...原创 2017-12-17 22:54:07 · 147 阅读 · 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 element equal ...原创 2017-12-17 22:53:12 · 168 阅读 · 0 评论 -
416. Partition Equal Subset Sum
题目Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note: Each of the array elemen原创 2017-12-03 11:51:45 · 156 阅读 · 0 评论 -
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 time, a原创 2017-12-03 11:09:43 · 144 阅读 · 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 (ie, buy one a原创 2017-12-10 21:03:40 · 157 阅读 · 0 评论 -
712. Minimum ASCII Delete Sum for Two Strings
Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.Example 1:Input: s1 = "sea", s2 = "eat"Output: 231Explanation: Deleting "s"原创 2017-11-08 09:43:20 · 361 阅读 · 0 评论 -
646. Maximum Length of Pair Chain
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.Now, we define a pair (c, d) can follow another pair (a, b) if and only原创 2017-11-08 10:13:43 · 153 阅读 · 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 tim原创 2017-11-08 14:14:52 · 149 阅读 · 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.Examp原创 2017-11-03 12:13:14 · 283 阅读 · 0 评论 -
647. Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substr原创 2017-11-03 13:05:51 · 134 阅读 · 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 bot原创 2017-11-17 22:21:56 · 192 阅读 · 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 1 \ /原创 2017-11-18 21:09:40 · 136 阅读 · 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 will be a positive in原创 2017-11-18 22:19:37 · 164 阅读 · 0 评论 -
392. Is Subsequence
子序列原创 2017-11-16 10:22:45 · 153 阅读 · 0 评论 -
494. Target Sum
题目You are given a list of non-negative integers, a1, a2, …, an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.Find out how many原创 2017-11-16 11:55:54 · 222 阅读 · 0 评论 -
516. Longest Palindromic Subsequence
题目题意求数组的回文子序列的最长长度分析用f[i][j]f[i][j]表示从i到j的回文子序列的最长长度 转移方程如下 如果s[i]==s[j]s[i] == s[j], f[i][j]=f[i+1][j−1]+2f[i][j] = f[i+1][j-1] +2 如果s[i]!=s[j]s[i] != s[j], f[i][j]=max(f[i][j−1],f[i+1][j])f[i][j]原创 2017-11-16 20:43:27 · 170 阅读 · 0 评论 -
312. Burst Balloons
题目题意炸掉i处的气球能获得nums[i−1]∗nums[i]∗nums[i+1]nums[i-1]*nums[i]*nums[i+1], 用过的气球就没有了, 可以将最左端和最右端看作有一个额外的1, 求总收益的最大值分析参考了这里有例子分析依次遍历不同长度len的子串s[left, right] (left∈[0, n -len], right = left+len-1);用k∈[left,原创 2017-11-16 21:27:22 · 132 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock
题目题意找到 max(nums[j] - nums[i]) , j > i && nums[j] > nums[i]max(nums[j] - nums[i]) , j&nbs原创 2017-11-16 23:54:14 · 136 阅读 · 0 评论 -
238. 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(n).For原创 2017-12-17 22:51:23 · 172 阅读 · 0 评论