-
Notifications
You must be signed in to change notification settings - Fork 14
/
AddTwoNumbers_2.swift
88 lines (65 loc) · 1.99 KB
/
AddTwoNumbers_2.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
//
// AddTwoNumbers_2.swift
// LeetCode_Swift
//
// Created by Huni on 08/05/2018.
// Copyright © 2018 KnighhtJoker. All rights reserved.
//
import Foundation
class AddTwoNumbers_2 {
func addTwoNumbers(_ l1: ListNode?, _ l2: ListNode?) -> ListNode? {
var result:ListNode?
var resultp:ListNode?
var l1p = l1
var l2p = l2
var carry = false
while let p1 = l1p, let p2 = l2p {
let num = AddTwoNumbers_2.handleCarry(p1.val + p2.val, carry: &carry)
let node = ListNode(num)
if result == nil {
result = node
resultp = node
} else {
resultp?.next = node
resultp = node
}
l1p = l1p?.next
l2p = l2p?.next
}
if l1p == nil {
while let p2 = l2p {
let num = AddTwoNumbers_2.handleCarry(p2.val, carry: &carry)
p2.val = num
resultp?.next = p2
resultp = p2
l2p = l2p?.next
}
} else if l2p == nil {
while let p1 = l1p {
let num = AddTwoNumbers_2.handleCarry(p1.val, carry: &carry)
p1.val = num
resultp?.next = p1
resultp = p1
l1p = l1p?.next
}
}
if carry {
let tail = ListNode(1)
resultp?.next = tail
}
return result
}
class func handleCarry(_ num:Int, carry:inout Bool) -> Int {
var n = num
if carry {
n += 1
}
if n > 9 {
n -= 10
carry = true
} else {
carry = false
}
return n
}
}