algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

精简代码

Browse Source
This commit is contained in:
Kade
2020-08-23 00:00:42 +08:00
committed by GitHub
parent 5e6111e107
commit 8075f0696f
1 changed files with 14 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go
View File

@ -16,36 +16,27 @@ type ListNode = structures.ListNode
*/
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
if l1 == nil || l2 == nil {
return nil
}
head := &ListNode{Val: 0, Next: nil}
head := &ListNode{Val: 0}
current := head
carry := 0
for l1 != nil || l2 != nil {
var x, y int
var n1, n2, carry int
for l1 != nil || l2 != nil || carry != 0 {
if l1 == nil {
x = 0
n1 = 0
} else {
x = l1.Val
}
if l2 == nil {
y = 0
} else {
y = l2.Val
}
current.Next = &ListNode{Val: (x + y + carry) % 10, Next: nil}
current = current.Next
carry = (x + y + carry) / 10
if l1 != nil {
n1 = l1.Val
l1 = l1.Next
}
if l2 != nil {
if l2 == nil {
n2 = 0
} else {
n2 = l2.Val
l2 = l2.Next
}
current.Next = &ListNode{Val: (n1 + n2 + carry) % 10}
current = current.Next
carry = (n1 + n2 + carry) / 10
}
if carry > 0 {
current.Next = &ListNode{Val: carry % 10, Next: nil}
}
return head.Next
}