题:A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99.
Find the largest palindrome made from the product of two 3-digit numbers.
代码:
def fun1(num):
for arr in str(num).split():
for i in range(len(arr)):
if(arr[i]!=arr[len(arr)-1-i]):
return False
return True
def fun2(num):
for i in range(100,1000):
if(num%i==0 and num/i>=100 and num/i<1000):
return True
return False
for num in range(1000000,10000,-1):
if(fun1(num)):
if(fun2(num)):
print num
break