"Leetcode-Interview algorithm classic-java Implementation" "007-reverse integer (flipping integers)"

"007-reverse integer (flipping integers)""leetcode-Interview algorithm classic-java Implementation" "All topics Directory Index"Original Question

Reverse digits of an integer.
EXAMPLE1:X = 123, return 321
example2:x = -123, return-321

Main Topic

Enter an integer to flip it

Thinking of solving problems

The operation of commercial law is obtained by seeking remainder.

Code Implementation

 Public classSolution { Public int Reverse(intx) {LongTMP = x;//Prevent result overflow        Longresult =0; while(TMP! =0) {result = result *Ten+ tmp%Ten; TMP = TMP/Ten; }//Overflow judgment        if(Result < Integer.min_value | | result > Integer.max_value) {result =0; }return(int) result; }}

Evaluation Results

Special InstructionsWelcome reprint, Reprint please indicate the source "http://blog.csdn.net/derrantcm/article/details/46938355"

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

"Leetcode-Interview algorithm classic-java Implementation" "007-reverse integer (flipping integers)"