使用 Python 语言实现算法,可以这样:
def countSuperPalindromes(L, R): count = 0 for i in range(int(L), int(R) + 1): if isPalindrome(i) and isPalindrome(i * i): count += 1 return count
def isPalindrome(n): s = str(n) return s == s[::-1]
print(countSuperPalindromes(L, R))