integer palindrome 'no strings'

[billo bailey]

howdee there,
i'm a rookie and stuck on a problem. I need to write a program without the use of strings or arrays that works out if a number is a palindrome or not. I've got the number to reverse by % and /
but need to reconstruct it so I can compare the two numbers, what i've been trying to do is to find the number of digits in the number and using a loop multiply the corresponding digits by the appropriate number, ie 10,100,1000 etc. Any help would be great.
billo 'darn tootin' bailey

[Dirk Schreckmann]

Welcome to JavaRanch, billo!
What part of this problem are you stuck on? Feel free to post relevant example code - just be sure to surround it with the [code] and [/code] UBB Tags.

[Dermot Curley]

Billo, not sure if I have this straight, you have the two ints but you want to convert the new value back to the original to compare them ?? Why not just create 2 new Integer objects and use the int compareTo(Integer anotherInteger) method to do the compare for you?

[Dirk Schreckmann]

Sure, objects are nice, but a simple a == b test would likely suffice.

[Dermot Curley]

cant beat objects
well I had to make it a bit interesting !!

[Neil Laurance]

I think this does the trick:

public class NumberPalindrome {
  private static int reverse(int n) {
    int out = 0;
    int tens = (int) Math.pow(10, Math.floor(Math.log(n)/Math.log(10)));
    while(n > 0) {
      out += (n % 10) * tens;
      n /= 10;
      tens /= 10;
    }
    return out;
  }
  private static boolean test(int n) {
    return (reverse(n) == n);
  }
  public static void main(String[] args) {
    System.out.println(test(123));
    System.out.println(test(454));
    System.out.println(test(1238998321));
    System.out.println(test(55667788));
  }
}

Cheers, Neil