摘要:
求最大的回文数,同时回文数是2个三位数的乘积/** * 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. */代码:private static int largePalin(int n) { if (n < 1... 阅读全文
posted @ 2013-04-27 15:31
dark_lake
阅读(111)
评论(0)
推荐(0)
2013年4月27日