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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。