150强访谈中等

回文子串

“回文子串”问题的详细指南和 Python 实现。

问题陈述

中等

给定一个字符串 s,返回其中回文子串的数量。

当一个字符串向后读与向前读相同时,它就是回文。子字符串是字符串中连续的字符序列。

编写一个函数 countSubstrings(s: str) -> int

约束条件
  • 1 <= len(s) <= 1000
  • s consists of lowercase English letters

示例

Example 1
Input
s = "abc"
Output
3
Explanation

Three palindromic substrings: "a", "b", "c".

Example 2
Input
s = "aaa"
Output
6
Explanation

Six palindromic substrings: "a", "a", "a", "aa", "aa", "aaa".

Need a Hint?
考虑使用一维 DP 特定的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。