3. 实现
def is_palindrome(s):
return all(a==b for a,b in itertools.zip_longest(
s, reversed(s)))
def palindrome_number():
for i in CANDIDATES:
if is_palindrome(f'{num:o}') and is_palindrome(
f'{num:b}'):
return -1
3 / 11
7. Numba
from numba import jit, int32
@jit(int32())
def palindrome_number2() -> int:
for num in CANDIDATES:
if num == reverse8(num) and num == reverse2(num):
return num
return -1
7 / 11