题目
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
我的代码
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
p1, p2 := l1, l2
carry := 0
var resultHead *ListNode = nil
var resultP *ListNode = nil
for !finish(p1, p2, carry) {
newListNode := new(ListNode)
if resultHead == nil {
resultHead = newListNode
resultP = newListNode
} else {
resultP.Next = newListNode
resultP = newListNode
}
sum := (addListNode(p1, p2) + carry) % 10
carry = (addListNode(p1, p2) + carry) / 10
newListNode.Val = sum
p1 = nextNode(p1)
p2 = nextNode(p2)
}
return resultHead
}
func nextNode(p1 *ListNode) *ListNode {
if p1 == nil {
return nil
}
return p1.Next
}
func addListNode(p1, p2 *ListNode) int {
return getListValue(p1) + getListValue(p2)
}
func getListValue(p1 *ListNode) int {
if p1 == nil {
return 0
}
return p1.Val
}
func finish(l1, l2 *ListNode, carry int) bool {
return l1 == nil && l2 == nil && carry <= 0
}