647. Palindromic Substrings
来源:互联网 发布:js构造函数的使用实例 编辑:程序博客网 时间:2024/05/17 03:07
- 题目描述
- 题意分析
- 算法分析
- 具体实现
- 更多
题目描述
Given a string, your task is to count how many palindromic substrings in this string.
The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.
Example 1:
Input: “abc”
Output: 3
Explanation: Three palindromic strings: “a”, “b”, “c”.
Example 2:
Input: “aaa”
Output: 6
Explanation: Six palindromic strings: “a”, “a”, “a”, “aa”, “aa”, “aaa”.
Note:
The input string length won’t exceed 1000.
题意分析
找出回文串的个数
算法分析
从每个位置i开始左右扩展,如果左右相等,则count++,继续扩展,否则结束扩展。
扩展的时候还要分奇数串和偶数串。
复杂度为
具体实现
class Solution {public: int countSubstrings(string s) { int count = s.size(); for (int i = 0; i < s.size(); i++) { int left = i - 1, right = i + 1; while (left >= 0 && right < s.size() && (s[left--] == s[right++]) ) count++; // odd left = i - 1, right = i; while (left >= 0 && right < s.size() && (s[left--] == s[right++]) ) count++; // even } return count; }};
更多
网友Deribs4的博客 中提到一种复杂度为
阅读全文
0 0
- 647. Palindromic Substrings
- 647. Palindromic Substrings
- [leetcode]647. Palindromic Substrings
- leetcode 647. Palindromic Substrings
- [LeetCode]647. Palindromic Substrings
- leetcode 647. Palindromic Substrings
- [LeetCode] 647. Palindromic Substrings
- 647. Palindromic Substrings
- 【LeetCode】647. Palindromic Substrings
- 647. Palindromic Substrings
- 647. Palindromic Substrings
- Leetcode 647. Palindromic Substrings
- 647. Palindromic Substrings
- LeetCode:647. Palindromic Substrings
- #leetcode#647. Palindromic Substrings
- 647. Palindromic Substrings
- 647. Palindromic Substrings (DP)
- 647. Palindromic Substrings
- 栈的应用之括号匹配
- HDU 2022 海选女主角(water)
- android真机使用Charles抓包
- 176. Second Highest Salary(Leetcode)
- 使用MVP模式实现简单的登录功能
- 647. Palindromic Substrings
- Windows安装FFmpeg
- 现场赛日历图片2
- eclipse如何导出可用命令行传参执行的jar包
- mycat同机多库分表
- springcloud支持外嵌tomcat且支持zookeeper注册与发现
- 你猜是什么??? 十进制转化为任意进制咩咩咩!!!
- 大海波浪
- 免费 | 程序员如何在面试中避免被坑?今晚告诉你!