516. Longest Palindromic Subsequence Medium
来源:互联网 发布:数据库接口怎么写 编辑:程序博客网 时间:2024/06/05 11:39
这道题是求最长回文子序列,跟最长回文子串相似。
用dp[ i ][ j ]表示s从 i 到 j 之间,它的最长回文子序列的长度。最终结果就是dp[ 0 ] [ s.size() - 1 ]。状态转移方程是:如果s[i] == s[j],那么dp[ i ][ j ] = dp[ i + 1 ][ j - 1 ] + 2。 否则 dp[ i ][ j ] = max(dp[ i + 1 ][ j ], dp[ i ][ j - 1 ])。
class Solution {public: int longestPalindromeSubseq(string s) { int dp[s.size()][s.size()]; for(int i = s.size() - 1; i >= 0; i--){ for(int j = i; j < s.size(); j++){ if(i == j)dp[i][j] = 1; else if (s[i] == s[j]) { if(j - i == 1)dp[i][j] = 2; else dp[i][j] = dp[i + 1][j - 1] + 2; } else { if(j - i == 1)dp[i][j] = 1; else dp[i][j] = max(dp[i + 1][j], dp[i][j - 1]); } } } return dp[0][s.size() - 1]; }};
阅读全文
0 0
- 516. Longest Palindromic Subsequence Medium
- 516. Longest Palindromic Subsequence (Medium)
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- 2017山东省赛 Fireworks
- LeedCode 之 Integer to Roman
- 23种设计模式(概念、原则、场景、优点、缺点、应用)简述
- freeRTOS 在 BlackFin533 平台上的移植 (1)
- 省赛 Plumbing the depth of lake
- 516. Longest Palindromic Subsequence Medium
- 【IApplication】基于MVP+Dagger2+Retrofit+Rxjava框架之IApplication
- 开关按钮(ToggleButton)与开关(Switch)的功能与用法
- php面试题
- 计算机(SoC)系统启动的比较与分析
- u3d的3dText一直正面显示的方法:让用户看不到反面的文字
- 深度学习的发展历程
- linux(centos)用户与权限
- 建造者模式