題目: 兩個(gè)鏈表表示的證書，每個(gè)結(jié)點(diǎn)包含一個(gè)數(shù)位，數(shù)位是反向存放，即個(gè)位排在鏈表首部.對(duì)兩個(gè)整數(shù)求和，并用鏈表形式返回結(jié)果.

解法一

兩個(gè)鏈表同時(shí)遍歷，相加之后進(jìn)位向前進(jìn)一位，?余數(shù)作為當(dāng)前的數(shù)值存儲(chǔ).
核心代碼:
<pre><code>` func addListNode(node1:ListNode,node2:ListNode) -> ListNode {

    var first:ListNode? = node1
    var second:ListNode? = node2
    
    var result:ListNode?
    
    var carry:Int = 0
    
    while first != nil || second != nil {
        
        var num1:Int = 0
        if (first?.value) != nil {
            num1 = Int((first?.value)!)!
        }
        
        var num2:Int = 0
        if second?.value != nil {
            num2 = Int((second?.value)!)!
        }
        
        let value:Int = num1 + num2 + carry
        
        let mod:Int = value % 10
        carry = value / 10
        
         let node:ListNode = ListNode(value: "\(mod)")
        if result == nil {
            result = node
        } else {
            var nextNode:ListNode? = result
            while nextNode?.next != nil {
                nextNode = nextNode?.next
            }
            nextNode?.next = node
        }
        
        first = first?.next
        second = second?.next
    }
    
    return result!
}`</code></pre>

解法二

當(dāng)然也可以通過遞歸的方式，返回最后的節(jié)點(diǎn).
核心代碼:
<pre><code>` func addListNode1(node1:ListNode?,node2:ListNode?,carry:Int) -> ListNode? {

    if node1 == nil && node2 == nil && carry == 0 {
        return nil
    }
    
    var value:Int = carry
    
    if node1?.value != nil {
        value += Int((node1?.value)!)!
    }
    
    if node2?.value != nil {
        value += Int((node2?.value)!)!
    }
    
    let mod:Int = value % 10
    let nextCarry:Int = value / 10
    
    let result:ListNode = ListNode(value: "\(mod)")
    let nextNode:ListNode? = addListNode1(node1: node1?.next, node2: node2?.next, carry: nextCarry)
    result.next = nextNode
    return result
}`</code></pre>

測(cè)試代碼:
<pre><code>`listNodeManger.appendToTail(value: "(0)")
listNodeManger.appendToTail(value: "(5)")
listNodeManger.appendToTail(value: "(2)")
listNodeManger.appendToTail(value: "(7)")

var addHeadNode1:ListNode = listNodeManger.headNode!
listNodeManger.headNode = nil

listNodeManger.appendToTail(value: "(7)")
listNodeManger.appendToTail(value: "(8)")
listNodeManger.appendToTail(value: "(9)")

var addHeadNode2:ListNode = listNodeManger.headNode!

var addResultNode:ListNode = listNodeManger.addListNode(node1: addHeadNode1, node2: addHeadNode2)
print("FlyElephant---鏈表原始數(shù)據(jù)")
listNodeManger.printListNode(headNode: addHeadNode1)
listNodeManger.printListNode(headNode: addHeadNode2)
print("FlyElephant---相加之后結(jié)果")
listNodeManger.printListNode(headNode: addResultNode)

var addResultNode2:ListNode? = listNodeManger.addListNode1(node1: addHeadNode1, node2: addHeadNode2, carry: 0)
print("FlyElephant---相加之后結(jié)果2")
listNodeManger.printListNode(headNode: addResultNode2!)`</code></pre>

FlyElephant.png