Project Euler > Problem 36 > Double-base palindromes (Java Solution)

Problem:

The decimal number, 585 = 10010010012 (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.)

Solution:

872187

Code:
The solution may include methods that will be found here: Library.java .

public interface EulerSolution{

public String run();

}

/* 
 * Solution to Project Euler problem 36
 * By Nayuki Minase
 * 
 * http://nayuki.eigenstate.org/page/project-euler-solutions
 * https://github.com/nayuki/Project-Euler-solutions
 */


public final class p036 implements EulerSolution {
 
 public static void main(String[] args) {
  System.out.println(new p036().run());
 }
 
 
 public String run() {
  int sum = 0;
  for (int i = 1; i < 1000000; i++) {
   if (Library.isPalindrome(Integer.toString(i, 10)) && Library.isPalindrome(Integer.toString(i, 2)))
    sum += i;
  }
  return Integer.toString(sum);
 }
 
}