【力扣2-两数相加】递归+模拟（golang）

目录

目录

题目链接

题目解法

---

题目链接

https://leetcode-cn.com/problems/add-two-numbers/

题目解法

模拟法

func addTwoNumbers(l1, l2 *ListNode) (head *ListNode) {
    var tail *ListNode
    carry := 0
    for l1 != nil || l2 != nil {
        n1, n2 := 0, 0
        if l1 != nil {
            n1 = l1.Val
            l1 = l1.Next
        }
        if l2 != nil {
            n2 = l2.Val
            l2 = l2.Next
        }
        sum := n1 + n2 + carry
        sum, carry = sum%10, sum/10
        if head == nil {
            head = &ListNode{Val: sum}
            tail = head
        } else {
            tail.Next = &ListNode{Val: sum}
            tail = tail.Next
        }
    }
    if carry > 0 {
        tail.Next = &ListNode{Val: carry}
    }
    return
}

递归法

func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
    if l1 == nil && l2 == nil {
        return nil
    }
    if l1 == nil {
        return l2
    }
    if l2 == nil {
        return l1
    }
    
    sum := l1.Val + l2.Val
    nextNode := addTwoNumbers(l1.Next, l2.Next)
    if sum < 10 {
        return &ListNode{ Val: sum, Next: nextNode }
    } else {
        tempNode := &ListNode{
            Val: 1,
            Next: nil,
        }
        return &ListNode{
            Val: sum - 10,
            Next: addTwoNumbers(nextNode, tempNode),
        }
    }
}