Quick hack to eval largest Palindrome in products of first 1000 numbers

Palindrome.java

public class Palindrome{

        int firstNum = 999;
	int secondNum = 100;
	int result = 0;
	int x = 0;
	int holder;

	public Palindrome(){

		while(firstNum > 100){
			x = firstNum * secondNum;
			if(result < x && isPalindrome(x)){
					result = x;
			}else
				changeNums();
		
		}
		System.out.println(result);
	}

	public boolean isPalindrome(int num){
		char[] stringed = Integer.toString(num).toCharArray();;
		int len = stringed.length - 1;
		int halflen = Math.round(stringed.length/2);

		for(int i = 0;i < halflen;i++){
			if(stringed[i] == stringed[len-i])
				continue;
			return false;
		}
		return true;
	}

	public void changeNums(){

		// Potentially do binary like jumps 

		if(firstNum == secondNum){
			firstNum--;
			secondNum = 100;
		}else{
			secondNum++;
		}
	}

	public static void main(String[] args) {
		new Palindrome();
	}
}