title: largest palindrome made from the product of two 3-digit numbers. "JAVA"
body: <p>I realize that this question has been asked before, but I didn't like any of the answers. They all looked like they were more complex then need be. I prefer to keep things as simple as possible. </p>
  
  <p>I wrote my code and from what I see there is no reason it shouldn't work? Am I missing anything? I don't get an error, but I don't get any results.</p>
  
  <p>public class LargestPalindromeProduct {</p>
  
  <pre><code>public static void main(String[] args) {
  
      // A palindromic number reads the same both ways. The largest palindrome
      // made from the product of two 2-digit numbers is 9009 = 91 × 99.
      //
      // Find the largest palindrome made from the product of two 3-digit
      // numbers.
  
      long product;
      for (int i = 999; i &gt;= 100; i--) {
          for (int j = 999; i &gt;= 100; i--) {
              product = j * i;
              if (reverse(product)) {
                  System.out.println(product);
                  break;
              }
          }
      }
  }
  
  
  private static final boolean reverse(long value) {
      long result = 0;
      while (value != 0) {
          result *= 10;
          result += value % 10;
          value /= 10;
      }
      return (result == value);
    }
  }
  </code></pre>