题目:https://projecteuler.net/problem=4
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.
题目的意思是找到两个三位数相乘的最大的回文数
MATLAB代码
>> max(feval(@(a)a(reverse(string(a))==string(a)), (100:999).*(100:999)'))
ans =
906609
Python代码
import math
import operator
s = 0
for k in [i*j for i in range(100,999) for j in range(100,999)]:
m = [k//10**i%10 for i in range(0,len(str(k)))]
if k>s and operator.eq(m,list(reversed(m))):
s = k
print(s)
该程序主要涉及,获取一个数字各位数字的方法