Project Euler 4

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.

Solve：

clear
clc
palindromenew = 0;
for i = 999:-1:100
for j = 999:-1:100
answer = i*j;
str = num2str(answer);
if all(str == str(end:-1:1))==1 && answer > palindromenew
palindromenew = answer;
break;
end
if answer < palindromenew
break
end
end
end
fprintf('The largest palindrome is %.0d\n',palindromenew)

转载于:https://www.cnblogs.com/JerryBerry/p/10629354.html