Skip to content

Fixed type-o #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fixed type-o #10

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions Solutions/Solutions/Easy/Easy_007_Reverse_Integer.swift
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,10 +35,10 @@ Inspired by @wshaoxuan at https://leetcode.com/discuss/120/how-do-we-handle-the-
struct Easy_007_Reverse_Integer {
// t = O(N), s = O(1)
static func reverse(_ x: Int) -> Int {
var negtive: Bool
var negative: Bool
var i: UInt
if x < 0 {
negtive = true
negative = true
if x == Int.min {
// The "minus 1 then add 1" trick is used to negate Int.min without overflow
i = UInt(-(x+1))
Expand All @@ -47,24 +47,24 @@ struct Easy_007_Reverse_Integer {
i = UInt(-x)
}
} else {
negtive = false
negative = false
i = UInt(x)
}
var res:UInt = 0
while i > 0 {
res = res * 10 + i % 10
i = i / 10
}
if negtive == false && res > UInt(Int.max) {
if negative == false && res > UInt(Int.max) {
return 0
} else if negtive == true && res == UInt(Int.max) + 1 {
} else if negative == true && res == UInt(Int.max) + 1 {
// When input is the reverse of Int.min
return (-1) * Int(res-1) - 1
} else if negtive == true && res > UInt(Int.max) + 1 {
} else if negative == true && res > UInt(Int.max) + 1 {
return 0
}

if negtive {
if negative {
return (-1) * Int(res)
} else {
return Int(res)
Expand Down