Let's say a positive integer is a superpalindrome if it is a palindrome, and it is also the square of a palindrome.
Now, given two positive integers L
and R
(represented as strings), return the number of superpalindromes in the inclusive range [L, R]
.
Example 1:
Input: L = "4", R = "1000" Output: 4 Explanation: 4, 9, 121, and 484 are superpalindromes. Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrome.
Note:
1 <= len(L) <= 18
1 <= len(R) <= 18
L
andR
are strings representing integers in the range[1, 10^18)
.int(L) <= int(R)
题目理解:
定义超集回文数:如果数a是回文,而且a的平方根也是回文整数,那么a是一个超集回文数。给定L和R,问[L,R]范围内有多少个超集回文数
解题思路:
根据给的约束,L和R的范围是10^18,这么大的范围如果全部遍历一定会超时。根据定义,超集回文数的平方根也是整数回文,那么我们可以先找到这个平方根b,然后判断b*b是不是回文,如果a的范围是10^18,那么b的范围就会缩小为10^9。如果遍历1 ~ 10^9之间的所有数,应该也会超时。因为b是回文,因此我么可以直接构造10^9之内的回文整数,因为b的第i个数字和第len-i个数字一定是相同的,所以范围再次缩小为10^5左右。
构造回文整数的方法就是,使得b的第i个数字和第len-i个数字相同,len是b的位数。len的范围大致是L的位数的一半到R的位数的一半。构造这些长度范围内的所有回文整数b,然后判断b的平方是不是一个回文数就可以了
class Solution {
int res = 0;
long l, r;
public void helper(int left, int right, char[] chs){
if(left > right)
return;
for(int i = 0; i < 9; i++){
if(left == 0 && i == 0)
continue;
chs[left] = (char)('0' + i);
chs[right] = (char)('0' + i);
if(right - left < 2 && judge(chs)) {
//System.out.println(String.valueOf(chs));
res++;
}
helper(left + 1, right - 1, chs);
chs[left] = '0';
chs[right] = '0';
}
}
public boolean judge(char[] chs){
long num = Long.valueOf(String.valueOf(chs));
num = num * num;
if(num < l || num > r)
return false;
chs = String.valueOf(num).toCharArray();
int left = 0, right = chs.length - 1;
while(left <= right){
if(chs[left] != chs[right])
return false;
left++;
right--;
}
return true;
}
public int superpalindromesInRange(String L, String R) {
l = Long.valueOf(L);
r = Long.valueOf(R);
int maxLen = (R.length() + 1) / 2;
for(int len = L.length() / 2; len <= maxLen; len++){
char[] chs = new char[len];
Arrays.fill(chs, '0');
helper(0, len - 1, chs);
}
return res;
}
}