mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
31 lines
1022 B
HTML
31 lines
1022 B
HTML
<p>Given a string <code>s</code>, return <em>the number of <strong>palindromic substrings</strong> in it</em>.</p>
|
|
|
|
<p>A string is a <strong>palindrome</strong> when it reads the same backward as forward.</p>
|
|
|
|
<p>A <strong>substring</strong> is a contiguous sequence of characters within the string.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "abc"
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> Three palindromic strings: "a", "b", "c".
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "aaa"
|
|
<strong>Output:</strong> 6
|
|
<strong>Explanation:</strong> Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 1000</code></li>
|
|
<li><code>s</code> consists of lowercase English letters.</li>
|
|
</ul>
|