leetcode---longest-palindromic-substring---字符串
来源:互联网 发布:百度搜索排名算法 编辑:程序博客网 时间:2024/06/06 01:41
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.
class Solution {public: string longestPalindrome(string s) { int n = s.size(); if(n == 0 || n == 1) return s; vector< vector<bool> > ok(n, vector<bool>(n, false)); string longest = ""; int maxLen = 0; for(int i=n-1; i>=0; i--) { for(int j=i; j<n; j++) { int len = j - i + 1; if(s[i] == s[j] && (i+1>=j-1 || ok[i+1][j-1])) { ok[i][j] = true; if(len > maxLen) { maxLen = len; longest = s.substr(i, len); } } } } return longest; }};
阅读全文
0 0
- leetcode---longest-palindromic-substring---字符串
- [LeetCode]Longest Palindromic Substring最长回文字符串
- Leetcode 5. Longest Palindromic Substring(字符串)
- [leetcode] 【字符串】 5. Longest Palindromic Substring
- LeetCode:Longest Palindromic Substring最长回文字符串
- LeetCode 5. Longest Palindromic Substring(字符串)
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- LeetCode Longest Palindromic Substring
- MongoDB和Redis区别
- 难道做开发板的这的没有几家?
- 判断网络请求方式工具类
- Java设计模式--观察者模式
- docker使用——容器不能访问外网
- leetcode---longest-palindromic-substring---字符串
- 反射在android中的应用
- 5.1
- 如何用线程Asynctask获取网络数据
- 不依赖具体activity弹出全局性弹窗
- MySQL之视图
- 正则表达式
- 网络连接+HttpUrlConnection+AsyncTask
- LeetCode.500 Keyboard Row