516. Longest Palindromic Subsequence
来源:互联网 发布:js获取子元素属性 编辑:程序博客网 时间:2024/06/06 06:30
1、题目描述
给一个字符串s,返回最长的回文序列长度。
2、思路
动归。
dp[i][j] refers to the maximum length of the longest palindromic subsquence of s, starting from the index i and ending at the index j.
dp[i][j] = dp[i+1][j-1] + 2, if i<j and s[i]==s[j];
dp[i][j] = 1, if i==j;
dp[i][j] = max(dp[i+1][j],dp[i][j-1]), otherwise.
bottom-up。
3、代码
int longestPalindromeSubseq(string s) { int len = s.size(); int dp[len][len]; for(int i=0;i<len;i++) for(int j=0;j<len;j++) dp[i][j]=0; for(int i=len-1;i>=0;i--){ for(int j=i;j<len;j++){ if(i==j) dp[i][j]=1; else{ if(s[i]==s[j]) dp[i][j]=dp[i+1][j-1]+2; else dp[i][j]=max(dp[i+1][j],dp[i][j-1]); } } } return dp[0][len-1]; }
阅读全文
0 0
- 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
- 516. Longest Palindromic Subsequence
- 516. Longest Palindromic Subsequence
- Beginning PowerApps.pdf 2017 英文原版 免费下载
- hive常用命令总结
- alsa-lib和alsa-util安装编译及开发板移植
- vector,template,typedef,typename
- BZOJ4811: [Ynoi2017]由乃的OJ
- 516. Longest Palindromic Subsequence
- 一周IT歪评 | 中兴员工坠亡事件进展/19岁女孩电脑被植入偷窥软件/周鸿祎怒怼92年女生
- 从菜鸟到精英——相信胜利属于坚持它的人!
- Python抓取妹子图
- css+jQuery+angular+table查询排序添加和批量删除
- Spring Bean作用域及其实例化
- 文件及其编码
- linux常用总结
- Tomcat和SQL优化的面试题总结