mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
32 lines
1.3 KiB
HTML
32 lines
1.3 KiB
HTML
|
<p>Let's say a positive integer is a <strong>super-palindrome</strong> if it is a palindrome, and it is also the square of a palindrome.</p>
|
||
|
|
|
||
|
|
<p>Given two positive integers <code>left</code> and <code>right</code> represented as strings, return <em>the number of <strong>super-palindromes</strong> integers in the inclusive range</em> <code>[left, right]</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> left = "4", right = "1000"
|
||
|
|
<strong>Output:</strong> 4
|
||
|
|
<strong>Explanation</strong>: 4, 9, 121, and 484 are superpalindromes.
|
||
|
|
Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrome.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> left = "1", right = "2"
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= left.length, right.length <= 18</code></li>
|
||
|
|
<li><code>left</code> and <code>right</code> consist of only digits.</li>
|
||
|
|
<li><code>left</code> and <code>right</code> cannot have leading zeros.</li>
|
||
|
|
<li><code>left</code> and <code>right</code> represent integers in the range <code>[1, 10<sup>18</sup> - 1]</code>.</li>
|
||
|
|
<li><code>left</code> is less than or equal to <code>right</code>.</li>
|
||
|
|
</ul>
|