Project Euler - Problem 36

euler.java

package euler;

public class BasePalindrome {
	
	public static void main(String[] args) {
		int sum = 0;
		for (int i = 0; i < 1_000_000; i++) {
			if (isPalindrome(Integer.valueOf(i).toString()) && isPalindrome(Integer.toBinaryString(i))) {
				sum += i;
			}
		}
		System.out.println(sum);
	}
	
	public static boolean isPalindrome(String s) {
		for (int i = 0; i < s.length() / 2; i++) {
			if (s.charAt(i) != s.charAt(s.length() - i - 1)) return false;
		}
		
		return true;
	}
}