Type Here to Get Search Results !

Reverse integer leetcode solution.

0

 Reverse integer leetcode solution.

Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.

Assume the environment does not allow you to store 64-bit integers (signed or unsigned).

 

Example 1:

Input: x = 123
Output: 321

Example 2:

Input: x = -123
Output: -321

Example 3:

Input: x = 120
Output: 21
 

Constraints:

-231 <= x <= 231 - 1


Reverse integer Java Solution

class Solution {
public int reverse(int x) {
long rev=0;

    while(x!=0){
       rev=((rev*10)+(x%10));
        x/=10;
    }
        
    
       if(rev>Integer.MAX_VALUE||rev<Integer.MIN_VALUE)
    {
        return 0;
    }   
   
    else
        return (int) rev;
}

}


Run Code -👉👉 

Post a Comment

0 Comments