LeetCode-005 Longest Palindromic Substring
来源:互联网 发布:ipad 看电影软件 编辑:程序博客网 时间:2024/05/17 05:11
Description
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example
Input: “babad”
Output: “bab”
Note: “aba” is also a valid answer.
Input: “cbbd”
Output: “bb”
Analyse
题目的意思很简单,就是找出最长的回文子串,但要是我们单纯的用最简单的枚举所有起点和终点然后再判断是否为回文串的方法,那么时间复杂度为
Code
class Solution {public: string longestPalindrome(string s) { int start=0,len=1; for (int i=0;i<s.size();i++) { int p=i,q=i; //长度为奇数的回文子串 while (p>0 && q<s.size()-1 && s[p-1]==s[q+1]) {p--;q++;} if (q-p+1>len) { start=p; len=q-p+1; } //长度为偶数的回文子串 p=i+1;q=i; while (p>0 && q<s.size()-1 && s[p-1]==s[q+1]) {p--;q++;} if (q-p+1>len) { start=p; len=q-p+1; } } return s.substr(start,len); }};
阅读全文
0 0
- leetcode-005:Longest Palindromic Substring
- LeetCode-005 Longest Palindromic Substring
- LeetCode 005 Longest Palindromic Substring
- [LeetCode]-005-Longest Palindromic Substring
- LeetCode 005 Longest Palindromic Substring
- 005 Longest Palindromic Substring [Leetcode]
- [LeetCode]005-Longest Palindromic Substring
- LeetCode 005 Longest Palindromic Substring
- leetcode Longest Palindromic Substring 005
- LeetCode 005 Longest Palindromic Substring *
- LeetCode 005: Longest Palindromic Substring
- leetcode-005 Longest Palindromic Substring
- leetcode 005 Longest Palindromic Substring
- LeetCode-005 Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- 你需要了解的前端测试“金字塔”
- 关于Spring Cloud Netflix
- Facebook 颠覆式前端 UI 开发框架 —— React
- 蚂蚁金服数据可视化解决方案 AntV 3.0 全新发布
- 一文读懂 JavaScript 和 ECMAScript 的区别
- LeetCode-005 Longest Palindromic Substring
- Mysql笔记2
- spi控制器驱动模型
- python 整型转成二进制十六进制八进制等
- Spring boot 国际化自动加载资源文件去除默认国际化文件
- java访问权限笔记
- 理解关于清除浮动的几种情况
- RecyclerView的点击事件
- Solr6.2集群搭建