DP
我真的不会Coding
任何时候努力都不晚,要保持自信
展开
-
leetcode63. Unique Paths II
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 bott...原创 2018-07-08 21:56:03 · 130 阅读 · 0 评论 -
两字符串最长公共子序列--动态规划连续和非连续
史上最全最丰富的“最长公共子序列”、“最长公共子串”问题的解法与思路https://blog.csdn.net/wangdd_199326/article/details/76464333 非连续的最长公共子序列求两个字符串的最长公共子序列。借用算法导论上的表示方法,给定一个字符串X=<x_1,x_2,...,x_m>(下划线后面的数字表示下标),另一个字符串Y...原创 2018-08-13 19:58:53 · 3516 阅读 · 0 评论 -
最全的最长公共子序列&最长公共子串的不同题型
转:https://blog.csdn.net/qq_19446965/article/details/816680471.最长公共子序列的长度题目:对于两个字符串,请设计一个高效算法,求他们的最长公共子序列的长度,这里的最长公共子序列定义为有两个序列U1,U2,U3...Un和V1,V2,V3...Vn,其中Ui&ltUi+1,Vi&ltVi+1。且A[Ui] == B[...转载 2018-08-14 17:52:03 · 372 阅读 · 0 评论 -
跳台阶最短路径类型题动态规划
更新中:最短路径//这个题还是动态规划,创造这样一个数组location make_pair(int,int)//这个题由其他变形过来的,就比如给一个一维数组,每个位置可以跳不同的步数,问,跳//到数组最后一位所需要的步数是多少,这两个的区别就是,所有点都是可以到达的,而不是像//其他的问题,他们只是在跳跃的步数上来动手脚,有的类型题是,在点i可以跳的步数是arry[i]步//又或...原创 2018-08-02 10:19:08 · 637 阅读 · 0 评论 -
动态规划和题目总结
https://blog.csdn.net/qq_19446965/article/details/81331187持续更新1 动态规划背包问题 https://blog.csdn.net/qq_36303472/article/details/689359542 0-1背包:https://www.cnblogs.com/lfeng1205/p/5981198.html...原创 2018-08-01 14:30:05 · 237 阅读 · 0 评论 -
背包问题动态规划
第一种:定义一个f[i][j]这样一个组,代表比如f[8][90],我用前八个数的和到达90的种类,包含但不一定这八个数都要,反正这八个数只要能组成90就算作合理,所以,当我需要再加一个数的时候,我想看看和到达90还有几种可能,一种是,这个新加入的数他要比90大,那完了。这个数肯定不能要了,那么能到达90的种类只有之前那些了,所以(最后一本书放和不放两种选择)放不进去:if(book...转载 2018-04-26 19:46:27 · 431 阅读 · 0 评论 -
leetcode回文例题
132. Palindrome Partitioning II 回文分割Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partition...原创 2018-08-04 12:40:17 · 152 阅读 · 0 评论 -
leetcode5最长回文子
在网上找了很多相关算法,一直想证明自己的思路有没有问题,但是leetcode提交时没找到错误,细节上有问题,思路:?1234567891011121314151617181920212223242526272829303132既然是最大连续的回文字符串,那么我可以这样构成dp的状态方程,以string[i]为结尾的最长连续会问字符串dp[i],当然会有这么一个maxlen=max{maxlen,d...原创 2018-07-14 17:54:51 · 176 阅读 · 0 评论 -
leetcode115. Distinct Subsequences
描述:Given a string S and a string T, count the number of distinct subsequences of S which equals T.A subsequence of a string is a new string which is formed from the original string by deleting some (c...原创 2018-07-14 17:53:48 · 134 阅读 · 0 评论 -
leecode97. Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.Example 1:Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"Output: trueExample 2:Input: s1 = "aabcc", s2 = "dbbca", s3...原创 2018-07-13 22:54:11 · 110 阅读 · 0 评论 -
leetcode 32. Longest Valid Parentheses DP
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.Example 1:Input: "(()"Output: 2Explanation: The longest valid par...转载 2018-07-07 14:24:16 · 188 阅读 · 0 评论 -
leetcode123. Best Time to Buy and Sell Stock III
It's not difficult to get the DP recursive formula: dp[k, i] = max(dp[k, i-1], prices[i] - prices[j] + dp[k-1, j-1]), j=[0..i-1] For k transactions, on i-th day,if we don't trade then the p...转载 2018-07-17 21:48:33 · 156 阅读 · 0 评论 -
leetcodeLongest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with...原创 2018-07-23 15:08:33 · 122 阅读 · 0 评论 -
leetcode120. 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], [3,4], [...转载 2018-07-17 13:05:19 · 374 阅读 · 0 评论 -
动态规划解最长回文子序列并优化空间复杂度
一个字符串有许多子序列,比如字符串abcfgbda,它的子序列有a、bfg、bfgbd,在这些子序列中肯定有回文字符串。现在要对任意字符串求其最长的回文子序列。注意,本文不是解决最长回文子串,回文子串是连续的,回文子序列是不连续的。 字符串abcfgbda的最长回文子序列为abcba,长度为5。 输入:包含若干行,每行有一个字符串,字符串由大小写字母构成,长度不超过100。 ...转载 2018-07-16 16:48:10 · 473 阅读 · 0 评论 -
leetcode72. Edit Distance
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.You have the following 3 operations permitted on a word:Insert a characterDelete a characterRe...原创 2018-07-09 09:44:46 · 175 阅读 · 0 评论 -
leetcode 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 any...原创 2018-07-08 22:52:58 · 127 阅读 · 0 评论 -
eetcode题解(10): Regular Expression Matching——DP解决正则匹配
两个参考:http://xiaohuiliucuriosity.blogspot.com/2014/12/regular-expression-matching.htmlhttps://www.youtube.com/watch?v=l3hda49XcDE&list=PLrmLmBdmIlpuE5GEMDXWf0PWbBD9Ga1lO问题Implement regular ...原创 2018-08-20 22:22:28 · 466 阅读 · 0 评论