动态规划dp
文章平均质量分 61
Heisenberg_888
互联网工程师,努力学习中
展开
-
最小编辑代价
题目描述给定两个字符串str1和str2,再给定三个整数ic,dc和rc,分别代表插入、删除和替换一个字符的代价,请输出将str1编辑成str2的最小代价。示例1输入"abc","adc",5,3,2返回值2示例2输入"abc","adc",5,3,100返回值8备注:题目链接:https://www.nowcoder.com/practice/05fed41805ae4394ab6607d0d745c8e4?tpId=188&tq原创 2021-04-04 16:17:07 · 141 阅读 · 0 评论 -
354. Russian Doll Envelopes俄罗斯套娃信封dp
You are given a 2D array of integersenvelopeswhereenvelopes[i] = [wi, hi]represents the width and the height of an envelope.One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and heigh...原创 2021-03-23 21:31:35 · 174 阅读 · 0 评论 -
403. Frog Jump
A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.Given a list ofstones' positions (in units) in sortedasc..原创 2021-03-22 21:58:57 · 123 阅读 · 0 评论 -
72. Edit Distance
Given two stringsword1andword2, returnthe minimum number of operations required to convertword1toword2.You have the following three operations permitted on a word:Insert a character Delete a character Replace a characterExample 1:Input:...原创 2021-03-20 16:28:54 · 177 阅读 · 0 评论 -
115. Distinct Subsequences
Given two stringssandt, returnthe number of distinct subsequences ofswhich equalst.A string'ssubsequenceis a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining characters'...原创 2021-03-20 14:23:47 · 258 阅读 · 0 评论 -
221. Maximal Square
Given anm x nbinarymatrixfilled with0's and1's,find the largest square containing only1'sand return its area.Example 1:Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]Output: 4...原创 2021-03-20 09:55:30 · 188 阅读 · 0 评论 -
91. Decode Ways
A message containing letters fromA-Zcan beencodedinto numbers using the following mapping:'A' -> "1"'B' -> "2"...'Z' -> "26"Todecodean encoded message, all the digits must be grouped then mapped back into letters using the reverse o...原创 2021-03-19 11:10:13 · 180 阅读 · 0 评论 -
华为机试 购物单 分组背包
题目描述王强今天很开心,公司发给N元的年终奖。王强决定把年终奖用于购物,他把想买的物品分为两类:主件与附件,附件是从属于某个主件的,下表就是一些主件与附件的例子:主件 附件 电脑 打印机,扫描仪 书柜 图书 书桌 台灯,文具 工作椅 无 如果要买归类为附件的物品,必须先买该附件所属的主件。每个主件可以有0个、1个或2个附件。附件不再有从属于自己的附件。王强想买的东西很多,为了不超出预算,他把每件物品规定了一个重要度,分为5...原创 2021-01-27 21:36:01 · 529 阅读 · 2 评论 -
300. Longest Increasing Subsequence最长上升子序列lower_bound()upper_bound()
Given an integer arraynums, return the length of the longest strictly increasing subsequence.Asubsequenceis a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example,...原创 2021-01-27 10:14:10 · 303 阅读 · 0 评论 -
416. Partition Equal Subset Sum dp动态规划
Given anon-emptyarraynumscontainingonly positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Example 1:Input: nums = [1,5,11,5]Output: trueExplanation: The array can be ...原创 2021-01-25 14:19:19 · 143 阅读 · 0 评论 -
322. Coin Change 01-背包、完全背包、多重背包及其相关应用
You are given coins of different denominations and a total amount of moneyamount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, retur.原创 2020-11-11 22:53:33 · 191 阅读 · 0 评论 -
714. Best Time to Buy and Sell Stock with Transaction Fee
Your are given an array of integersprices, for which thei-th element is the price of a given stock on dayi; and a non-negative integerfeerepresenting a transaction fee.You may complete as many transactions as you like, but you need to pay the transa...原创 2020-11-08 16:04:54 · 195 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.Note t...原创 2020-11-04 21:06:07 · 116 阅读 · 0 评论 -
583. Delete Operation for Two Strings
Given two wordsword1andword2, find the minimum number of steps required to makeword1andword2the same, where in each step you can delete one character in either string.Example 1:Input: "sea", "eat"Output: 2Explanation: You need one step to mak...原创 2020-10-13 19:37:32 · 145 阅读 · 0 评论 -
HDU1963(完全背包)
Problem DescriptionJohn never knew he had a grand-uncle, until he received the notary’s letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor.John did not need that muc原创 2020-05-19 14:50:18 · 274 阅读 · 0 评论 -
HDU2602(01背包复习)
Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …The bone collector had a big bag with a volume of V ,a原创 2020-05-19 13:50:38 · 269 阅读 · 0 评论 -
POJ1458 最长公共子序列长度
DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., ...原创 2020-05-04 12:32:32 · 366 阅读 · 0 评论 -
poj1163
Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts ...原创 2020-05-03 16:51:48 · 538 阅读 · 0 评论 -
POJ2533 最长有序子序列长度
这次做个动态规划的深度复习,把思路讲清楚,加深自己记忆,也方便他人。DescriptionA numeric sequence ofaiis ordered ifa1<a2< ... <aN. Let the subsequence of the given numeric sequence (a1,a2, ...,aN) be any sequence...原创 2020-05-03 16:21:02 · 356 阅读 · 0 评论 -
Leetcode 55. Jump Game dp
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if yo...原创 2019-01-17 15:50:18 · 239 阅读 · 0 评论 -
leetcode 53. Maximum Subarray DP连续子数组最大和
Given an integer arraynums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanati...原创 2019-01-16 13:27:53 · 183 阅读 · 1 评论 -
Leetcode 70. Climbing Stairs dp
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 to the top?Note:Givennwill be a positive...原创 2019-01-20 14:31:05 · 166 阅读 · 0 评论 -
Leetcode 120. Triangle巧妙的dp
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], [6,5...原创 2019-02-11 13:54:46 · 226 阅读 · 0 评论 -
Leetcode 64. Minimum Path Sum Dp
Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:You can only move either down or right at a...原创 2019-01-19 17:08:06 · 177 阅读 · 0 评论 -
Leetcode 132. Palindrome Partitioning II dp
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs.Example:Input:"aab"Output: 1Explana...原创 2019-02-14 18:24:25 · 346 阅读 · 0 评论 -
Leetcode 62. Unique Paths dp动态规划,递归会超时
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 in time. The robot is trying to reach the bo...原创 2019-01-19 14:43:53 · 276 阅读 · 0 评论 -
Leetcode 139. Word Break dp以及kmp的失败尝试
Given anon-emptystringsand a dictionarywordDictcontaining a list ofnon-emptywords, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.Note:The ...原创 2019-02-18 20:54:37 · 228 阅读 · 0 评论 -
leetcode 63. Unique Paths II dp
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 in time. The robot is trying to reach the bo...原创 2019-01-19 15:31:27 · 196 阅读 · 0 评论 -
Leetcode 741. Cherry Pickup dp
In a N x Ngridrepresenting a field of cherries, each cell is one of three possible integers.0 means the cell is empty, so you can pass through; 1 means the cell contains a cherry, that you can pi...原创 2019-03-03 20:22:29 · 286 阅读 · 0 评论 -
Leetcode 198. House Robber dp
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 house...原创 2019-03-12 15:07:10 · 164 阅读 · 0 评论 -
Leetcode 213. House Robber II 2遍dp
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place arearranged in a circle.That means the first house is ...原创 2019-03-12 16:18:54 · 232 阅读 · 0 评论 -
Leetcode 174. Dungeon Game dp
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially pos...原创 2019-03-02 18:44:04 · 186 阅读 · 0 评论