LeetCode Reverse Integer Solution Explained - Java

Показать описание

Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering

Рекомендации по теме

Комментарии

Integer.MAX_VALUE is equal 2147483647. Integer.MIN_VALUE is equal -2147483648. Last digits are 7 and 8. This is the reason why we check pop>7 and pop < -8 conditions

wayfarer

Similar solution, easy to understand, checking the boundary condition before so we don't have to use pop

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

pragyadhawan

Good Job, seeing your mistakes is good, makes us see how you debug

rayprusia

i didn't get it why there is reversed = (reversed * 10) + pop; ???

aislofi

Thanks for it, I convert it to Python format.
```
class Solution:
def reverse(self, x: int) -> int:
reversed = 0
sign = -1 if x < 0 else 1
x = abs(x)

while x > 0:
pop = x % 10
x //= 10

reversed = reversed * 10 + pop

if reversed > -2**31 and reversed < 2**31 - 1:
return reversed * sign

return 0
```

ZhouHaibo

Excellent job! You really broke this down for a novice like myself.

CaseTechnologies

Having watched a video where it was said when learning a new language it's good trying interview questions. So I did this question in Dart - and it's good to now refer to your video to see similar or differences in the way you approached.

lifeofamobiledeveloper

In 3:40 and 4:12 why do we have conditions for pop > 7 and pop<=8

Fahodinho

why the while(x !=0) loop not a infinite loop?

masong

Why does Integer.MAX_VALUE has to be divided by 10?

matthewstraughn

Not sure how fancy their compiler is and if it optimizes, but if you take those MAX/MIN calculations out of the loop and store them in a variable then you are trading 4N divisions for just 2 total. A real compiler would probably optimize this though, and as you said there is a Wifi bug anyway. 😁

Gideon_Judges

Hey Nick,
can u explain y we are using pop varibale inside the if conditions

thesoftwareengineer

Can someone please elaborate why we divide Max and Min by 10..None of the comments helped me out plss 🙏

pratikawate

Hey Nick, why Min and Max values are divided by 10 and why do you check for pop being >7 or <-8????

_-

For those who do not understand the overflow check... it's not necessary :)

We can do:

int reversedCopy = reversed;

reversed = reversed * 10 + pop;

if ( (reversed - pop) / 10 != reversedCopy) {
return 0
}

darod

why Pop > 7 or pop < -8 in boundary checking?

jollymail

I am having trouble understanding what reversed = (reversed * 10) + pop; does. What integer does reversed store? in other words, what is being multiplied by 10?

jayhun

Does anyone know how to do this but with a string as an input?

dontgoogleme-yebt

Help me understand the logic behind the pop>7 and pop < -8 conditions please.

adityaranjalker

Hi, can someone explain what is meant by 32 bit signed integer?

okey

LeetCode Reverse Integer Solution Explained - Java

LeetCode Reverse Integer Solution Explained - Java

Reverse Integer - Bit Manipulation - Leetcode 7 - Python

Visualizing Leetcode: Reverse Integer Solution Explained 🔄💡

Google Engineer Explains - LeetCode #7 - Reverse Integer - Solution (Python)

Reverse Integer | LeetCode problem 7

LeetCode Explained - Reverse Integer [EASIEST WAY]

Reverse Integer | LeetCode 7 | Google Coding Interview Tutorial

Reverse Integer - leetcode 7

3228. Maximum Number of Operations to Move Ones to the End (Leetcode Medium)

Reverse Integer | Leetcode #7 | Modulo concept | Integer MAX_VALUE

LeetCode 7: Reverse Integer - Interview Prep Ep 55

REVERSE INTEGER C++ | SOLVING FAANG CODING INTERVIEW | LEETCODE QUESTION 7

Google Question | LeetCode 7. Reverse Integer | Interview Preparation | English | code io

LeetCode | #7 | Reverse Integer (Python)

Leetcode 7 - Reverse Integer (Java, Solution Explained)

Leetcode Solution - 7.0 Reverse Integer | Javascript

LeetCode 007 - Reverse Integer Solution

Reverse Integer

Reverse Integer - LeetCode 7 - LeetCode Daily Challenge

Reverse integer Leetcode problem solution in Python | Google coding interview questions

Leetcode 7 Reverse Integer

LeetCode 007 - Reverse Integer Explanation Solution

REVERSE INTEGER | Leetcode Solution (Explained full)

LeetCode solutions explanation JavaScript. Problem #7 - Reverse Integer explained solution