g0001_0100.s0007_reverse_integer.solution.ts Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

The newest version!

// #Medium #Top_Interview_Questions #Math #Udemy_Integers
// #2023_08_25_Time_56_ms_(95.68%)_Space_43.8_MB_(99.70%)

function reverse(x: number): number {
    let remaining = Math.abs(x)
    let power = Math.floor(Math.log10(remaining))
    let reversed = 0
    while (remaining > 0) {
        const digit = remaining % 10
        remaining = (remaining - digit) / 10
        reversed += digit * 10 ** power--
        if (reversed > 2 ** 31 - 1) return 0
    }
    return x > 0 ? reversed : -reversed
}

export { reverse }