Java Common algorithm questions (24)

 PackageCom.xiaowu.demo;//a 5-digit number, judging whether it is a palindrome number. That is, 12321 is a palindrome number, single-digit and million-bit the same, 10 bits and thousands of the same.  Public classDemo24 { Public Static voidMain (string[] args) {F2 (123454321); }    //Method One     Public Static voidF1 (intN) {if(n >= 10000 && N < 100000) {String s=string.valueof (n); Char[] C =S.tochararray (); if(C[0] = = C[4] && c[1] = = C[3]) {System.out.println (n+ "is a palindrome number. "); } Else{System.out.println (n+ "not a palindrome number. "); }        } Else{System.out.println (n+ "not a 5-digit number!!! "); }    }    //Method Two     Public Static voidF2 (intN) {BooleanFlag =true; String s=long.tostring (n); Char[] C =S.tochararray (); intj =c.length;  for(inti = 0; i < J/2; i++) {            if(C[i]! = c[j-i-1]) {flag=false; }        }        if(flag) {SYSTEM.OUT.PRINTLN (n+ "is a palindrome number. "); } Else{System.out.println (n+ "not a palindrome number. "); }    }}

Java Common algorithm questions (24)