动态规划
文章平均质量分 73
_TCgogogo_
这个作者很懒,什么都没留下…
展开
-
LeetCode 2400 Number of Ways to Reach a Position After Exactly k Steps (dp 或 组合数 推荐)
联立得x = (endPos - startPos + k) / 2,答案即为C(n, x),取模需要用到除法逆元,由费马小定理a^(p - 1) ≡ 1 mod p。题目分析:最容易想到的是记忆化搜索,dp[i][j]表示从位置i到终点走k步的方案数。设向右走x步,向左走y步,假设endPos比startPos大则。题目大意:直线给两点,从起点到终点走k步的方案数。94ms,时间击败82.98%2ms,时间击败98.14%原创 2022-09-06 21:17:10 · 431 阅读 · 0 评论 -
LeetCode 1035 Uncrossed Lines(dp 推荐)
You are given two integer arraysnums1andnums2. We write the integers ofnums1andnums2(in the order they are given) on two separate horizontal lines.We may draw connecting lines: a straight line connecting two numbersnums1[i]andnums2[j]such that...原创 2022-05-07 10:13:48 · 209 阅读 · 0 评论 -
LeetCode 688 Knight Probability in Chessboard (概率dp)
On ann x nchessboard, a knight starts at the cell(row, column)and attempts to make exactlykmoves. The rows and columns are0-indexed, so the top-left cell is(0, 0), and the bottom-right cell is(n - 1, n - 1).A chess knight has eight possible move...原创 2022-03-19 11:09:12 · 435 阅读 · 0 评论 -
LeetCode 1749 Maximum Absolute Sum of Any Subarray (dp)
You are given an integer arraynums. Theabsolute sumof a subarray[numsl, numsl+1, ..., numsr-1, numsr]isabs(numsl+ numsl+1+ ... + numsr-1+ numsr).Returnthemaximumabsolute sum of any(possibly empty)subarray ofnums.Note thatabs(x)is defin...原创 2022-02-28 18:42:50 · 187 阅读 · 0 评论 -
LeetCode 1024 Video Stitching (dp,jump game)
You are given a series of video clips from a sporting event that lastedtimeseconds. These video clips can be overlapping with each other and have varying lengths.Each video clip is described by an arrayclipswhereclips[i] = [starti, endi]indicates t...原创 2022-02-22 12:49:50 · 277 阅读 · 0 评论 -
LeetCode 1029 Two City Scheduling (dp)
A company is planning to interview2npeople. Given the arraycostswherecosts[i] = [aCosti, bCosti],the cost of flying theithperson to cityaisaCosti, and the cost of flying theithperson to citybisbCosti.Returnthe minimum cost to fly every p...原创 2022-02-10 13:58:13 · 401 阅读 · 0 评论 -
LeetCode 72 Edit Distance (动态规划 一维空间优化)
LeetCode 72 Edit Distance (动态规划)原创 2016-09-01 13:45:32 · 971 阅读 · 0 评论 -
LeetCode 45 Jump Game II (dp)
Given an array of non-negative integers nums, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to reach the last index in the minimum number of jump原创 2022-01-27 19:07:02 · 535 阅读 · 0 评论 -
LeetCode 377 Combination Sum IV (dp 完全背包类 推荐)
Given an array ofdistinctintegersnumsand a target integertarget, returnthe number of possible combinations that add up totarget.The test cases are generated so that the answer can fit in a32-bitinteger.Example 1:Input: nums = [1,2,3], targe...原创 2022-01-26 15:11:14 · 542 阅读 · 0 评论 -
LeetCode 1671 Minimum Number of Removals to Make Mountain Array (LIS 二分)
You may recall that an arrayarris amountain arrayif and only if:arr.length >= 3 There exists some indexi(0-indexed) with0 < i < arr.length - 1such that: arr[0] < arr[1] < ... < arr[i - 1] < arr[i] arr[i] > arr[i + 1] &...原创 2021-08-09 17:22:21 · 129 阅读 · 0 评论 -
LeetCode 1425 Constrained Subsequence Sum (dp,滑动窗,推荐)
Given an integer arraynumsand an integerk, return the maximum sum of anon-emptysubsequence of that array such that for every twoconsecutiveintegers in the subsequence,nums[i]andnums[j], wherei < j, the conditionj - i <= kis satisfied.A...原创 2021-07-29 13:46:12 · 198 阅读 · 0 评论 -
LeetCode 1312 Minimum Insertion Steps to Make a String Palindrome (dp)
Given a strings. In one step you can insert any character at any index of the string.Returnthe minimum number of stepsto makespalindrome.APalindrome Stringis one that reads the same backward as well as forward.Example 1:Input: s = "zzazz"...原创 2021-07-19 14:11:35 · 205 阅读 · 0 评论 -
LeetCode 518 Coin Change 2 (dp 完全背包)
You are given an integer arraycoinsrepresenting coins of different denominations and an integeramountrepresenting a total amount of money.Returnthe number of combinations that make up that amount. If that amount of money cannot be made up by any com...原创 2021-07-19 14:04:29 · 167 阅读 · 0 评论 -
LeetCode 1373 Maximum Sum BST in Binary Tree (DFS, DP 推荐)
Given abinary treeroot, the task is to return the maximum sum of all keys ofanysub-tree which is also a Binary Search Tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keysless thanthe node's key. ...原创 2021-07-15 23:43:36 · 196 阅读 · 3 评论 -
LeetCode 1277 Count Square Submatrices with All Ones (dp)
Given am * nmatrix of ones and zeros, return how manysquaresubmatrices have all ones.Example 1:Input: matrix =[ [0,1,1,1], [1,1,1,1], [0,1,1,1]]Output: 15Explanation: There are 10 squares of side 1.There are 4 squares of side 2.There ...原创 2021-07-08 10:25:10 · 121 阅读 · 0 评论 -
LeetCode 1547 Minimum Cost to Cut a Stick (推荐 区间dp)
Given a wooden stick of lengthnunits. The stick is labelled from0ton. For example, a stick of length6is labelled as follows:Given an integer arraycutswherecuts[i]denotes a position you should perform a cut at.You should perform the cuts in...原创 2021-07-04 20:09:30 · 386 阅读 · 1 评论 -
LeetCode 805 Split Array With Same Average (推荐 预处理 类01背包dp 详解 640ms -> 16ms)
You are given an integer arraynums.You should move each element ofnumsinto one of the two arraysAandBsuch thatAandBare non-empty, andaverage(A) == average(B).Returntrueif it is possible to achieve that andfalseotherwise.Notethat for ...原创 2021-07-04 18:45:00 · 276 阅读 · 2 评论 -
LeetCode 1186 Maximum Subarray Sum with One Deletion (dp)
Given an array of integers, return the maximum sum for anon-emptysubarray (contiguous elements) with at most one element deletion.In other words, you want to choose a subarray and optionally delete one element from it so that there is still at least one...原创 2021-06-11 13:03:42 · 198 阅读 · 0 评论 -
LeetCode 576 Out of Boundary Paths (记忆化搜索)
There is anm x ngrid with a ball. The ball is initially at the position[startRow, startColumn]. You are allowed to move the ball to one of the four adjacent four cells in the grid (possibly out of the grid crossing the grid boundary). You can applyat m...原创 2021-05-31 13:15:11 · 176 阅读 · 0 评论 -
LeetCode 1235 Maximum Profit in Job Scheduling (dp 排序 二分)
We havenjobs, where every jobis scheduled to be done fromstartTime[i]toendTime[i], obtaining a profitofprofit[i].You're given thestartTime,endTimeandprofitarrays,you need to output the maximum profit you can take such that there are no 2 j...原创 2020-10-11 14:45:15 · 322 阅读 · 0 评论 -
HDU 1058 Humble Numbers && NOJ 1420 丑数 (数位dp)
有趣的数位dp原创 2015-02-05 10:22:58 · 991 阅读 · 0 评论 -
POJ 1651 Multiplication Puzzle (区间dp 矩阵连乘)
Multiplication PuzzleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6275Accepted: 3808DescriptionThe multiplication puzzle is played with a row of car原创 2014-08-05 01:13:01 · 974 阅读 · 0 评论 -
POJ 1958 Strange Towers of Hanoi (线性dp 推公式)
Strange Towers of HanoiTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2506 Accepted: 1662DescriptionBackgroundCharlie Darkbrown sits in another one o原创 2014-11-24 20:14:40 · 1019 阅读 · 0 评论 -
POJ 1948 Triangular Pastures (线性dp)
Triangular PasturesTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 6689Accepted: 2180DescriptionLike everyone, cows enjoy variety. Their current fancy原创 2014-11-26 15:37:21 · 995 阅读 · 0 评论 -
NOJ 2045 罗马PK (线性dp 最大连续子段和)
罗马PKTime Limit(Common/Java):1000MS/2000MS Memory Limit:65536KByteTotal Submit:140 Accepted:28Description一天,机智的罗老师和小马哥想比试以下到底谁更机智,于是他们找到了一个很长的数列串,决定看谁能更快地算出这条长串中子串和的最大值。这原创 2014-11-23 00:41:14 · 927 阅读 · 0 评论 -
NOJ 1031 建筑群最长坡值 (线性dp)
建筑群最长坡值 Time Limit(Common/Java) : 1000 MS/ 3000 MS Memory Limit : 65536 KByteTotal Submit : 489 Accepted : 193 Description 建筑群所有建筑高度分别为h1、h2…hN,可以得到一些单调递减的序列hi1、hi2…hiK原创 2014-11-23 00:25:56 · 1192 阅读 · 0 评论 -
HDU 1069 Monkey and Banana (线性dp 完全背包)
Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description A group of原创 2014-12-01 13:25:17 · 944 阅读 · 0 评论 -
POJ 3624 Charm Bracelet (线性dp 0/1背包)
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24286 Accepted: 10952DescriptionBessie has gone to the mall's jewelry store and spies原创 2014-11-24 20:33:46 · 770 阅读 · 0 评论 -
NOJ 1224 编辑距离问题 (线性dp 分类)
编辑距离问题Time Limit(Common/Java):1000MS/3000MS Memory Limit:65536KByteDescription 设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括(1)删除一个字符;(2)插入一个字符;(3)将一个字符改为另一个字符。将字原创 2014-10-09 01:04:54 · 957 阅读 · 0 评论 -
NOJ 1017 乘积最大 (经典的区间dp)
乘积最大 时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte描述 今年是国际数学联盟确定的“2000——世界数学年”,又恰逢我国著名数学家华罗庚先生诞辰90周年。在华罗庚先生的家乡江苏金坛,组织了一场别开生面的数学智力竞赛的活动,你的一个好朋友XZ也有幸得以参加。活动中,主持人给所有参加活动的选手出了原创 2014-11-09 17:56:10 · 2549 阅读 · 1 评论 -
HDU 4472 Count (线性dp 推公式)
CountTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1631 Accepted Submission(s): 1028Problem DescriptionProf. Tigris is the原创 2014-09-29 19:31:59 · 1298 阅读 · 0 评论 -
HDU 1159 Common Subsequence (线性dp 裸LCS)
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25383 Accepted Submission(s): 11253Problem Description A subs原创 2015-02-14 01:09:53 · 627 阅读 · 0 评论 -
HDU 3006 The Number of set (状态压缩+hash)
The Number of setTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1181 Accepted Submission(s): 722Problem Description Given you n原创 2015-02-15 00:46:53 · 827 阅读 · 0 评论 -
POJ 2411 && HDU 1400 Mondriaan's Dream (状压dp 经典题)
POJ 2411 && HDU 1400 Mondriaan's Dream (状压dp 经典题)原创 2015-02-20 23:33:59 · 1397 阅读 · 0 评论 -
POJ 3311 Hie with the Pie (Floyd + 状压dp 简单TSP问题)
POJ 3311 Hie with the Pie (Floyd + 状压dp 简单TSP问题)原创 2015-02-21 01:37:05 · 2432 阅读 · 0 评论 -
POJ 3783 Balls (线性dp 智力题)
POJ 3783 Balls (线性dp 智力题)原创 2015-02-24 12:44:36 · 1908 阅读 · 0 评论 -
HDU 1087 Super Jumping! Jumping! Jumping! (线性dp 最大上升子序列)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24409 Accepted Submission(s): 10757Problem Descriptio原创 2015-02-12 01:15:04 · 771 阅读 · 0 评论 -
2014蓝桥杯B组c/c++预赛 第九题地宫取宝 (四维线性dp)
2014蓝桥杯B组c/c++预赛 第九题地宫取宝 (四维线性dp)原创 2015-03-25 17:21:43 · 1855 阅读 · 0 评论 -
HDU 5135 Little Zu Chongzhi's Triangles (14广州 状压dp)
HDU 5135 Little Zu Chongzhi's Triangles (14广州 状压dp)原创 2015-03-01 16:14:57 · 1142 阅读 · 0 评论 -
HDU 5119 Happy Matt Friends (14北京 类背包dp)
Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 667 Accepted Submission(s): 253Problem DescriptionMatt has N原创 2015-03-01 17:07:24 · 1375 阅读 · 0 评论