<p>Let&#39;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>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> left = &quot;4&quot;, right = &quot;1000&quot;
<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 class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> left = &quot;1&quot;, right = &quot;2&quot;
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= left.length, right.length &lt;= 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>

class Solution {
public:
  int superpalindromesInRange(string left, string right) {
    int result{0};
    long l{stol(left)};
    long r{stol(right)};

    // 长度为偶数的情况: ABCCBA
    for(int i{1}; i < 100000; ++i) {
      string s1{to_string(i)};
      string s2{s1};
      reverse(s2.begin(), s2.end());
      long m{stol(s1 + s2)}; // m is palindrome
      m *= m;
      if(m > r) {
        break;
      }else if(m >= l && isPalindrom(m)) {
        ++result;
      }
    }
    // 长度为奇数的情况: ABCBA
    for(int i{1}; i < 100000; ++i) {
      string s1{to_string(i)};
      string s2{s1};
      reverse(s2.begin(), s2.end());
      s1.append(s2.begin() + 1, s2.end());
      long m{stol(s1)};
      m *= m;
      if(m > r) {
        break;
      }else if(m >= l && isPalindrom(m)) {
        ++result;
      }
    }

    return result;
  }
private:
  bool isPalindrom(long num) {
    long temp{0};
    long n{num};
    while(n) {
      temp = temp * 10 + n % 10;
      n /= 10;
    }
    return temp == num;
  }
};
11000