超级会员免费看
该博客介绍了一个LeetCode题目，目标是计算给定字符串中的回文子串个数。即使子串由相同字符组成，但起始或结束索引不同也视为不同的子串。题目的例子和解决方案也在文中提及，程序已通过所有测试用例，运行时间为15毫秒，优于66.73%的Java提交。
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.
package com.main;
public class Main {
订阅专栏 解锁全文
扫一扫
713
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
