Project Euler 36

最新推荐文章于 2020-11-28 18:25:22 发布

xiaoman111

最新推荐文章于 2020-11-28 18:25:22 发布

阅读量364

点赞数

分类专栏： Project Euler 文章标签： string numbers include less class java

本文链接：https://blog.csdn.net/xiaoman111/article/details/6524035

版权

Project Euler 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

原题：

The decimal number, 585 = 1001001001 (binary), is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include leading zeros.)

分析：

利用java的Integer.toBinaryString(10)方法，将十进制转化为二进制。

public class Problem36 { //判断是否为回文数。 static boolean isReverseNumber(String numberStr){ int length = numberStr.length(); for(int i=0;i<length-1/2;i++){ if(numberStr.charAt(i) != numberStr.charAt(length-i-1)) return false; } return true; } public static void main(String[] args) { //System.out.println(Integer.toBinaryString(10)); 10-2 //System.out.println(Integer.valueOf("1010", 2)); 2-10 long beginTime = System.currentTimeMillis(); int count = 0; for(int i=999999;i>0;i=i-2){ if(isReverseNumber(String.valueOf(i))&&isReverseNumber(Integer.toBinaryString(i))){ System.out.print(i+" -- "); System.out.print(Integer.toBinaryString(i)); System.out.println(); count += i; } } System.out.println("count:"+count);//872187 long endTime = System.currentTimeMillis(); System.out.println(endTime - beginTime +"ms"); } }