赞
踩
共三道算法题
1.求最大子矩阵和
2.求最长回文字串
- string longestPalindromeDP(string s)
- {
- int n = s.length();
- int longestBegin = 0, maxLen = 1;
- bool table[1000][1000] = {false};
- for (int i=0; i<n; i++)
- table[i][i] = true;
- for (int i=0; i<n-1; i++) {
- if (s[i] == s[i+1]) {
- table[i][i+1] = true;
- longestBegin = i;
- maxLen = 2;
- }
- }
- /*依次求table[i][i+2]...table[i][i+n-1]等*/
- for (int len=3; l
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。