Problem 4 求回文数

最新推荐文章于 2022-09-28 18:15:21 发布

原创最新推荐文章于 2022-09-28 18:15:21 发布 · 823 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#numbers #string #class

欧拉项目专栏收录该内容

17 篇文章

订阅专栏

本文探讨了如何通过编程找到由两个三位数组成的最大回文数乘积，并展示了实现过程。

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.

Answer:

906609

public class Palindromic { public static void main(String args[]){ int max=0; int mul=0; int ch=0; for(int i=999;i>100;i--){ for(int j=999;j>100;j--){ mul=i*j; if(isPalindromic(mul)){ ch=mul; if(max<=ch){ max=ch; } } } } System.out.println(max); } public static boolean isPalindromic(int num){ StringBuffer sb=new StringBuffer(""+num); int num2=Integer.parseInt(sb.reverse().toString()); if(num==num2){ return true; } return false; } }