算法：长数相加

题目：

由于 python 存储不了很长的数字，如果很长的数字做计算，可以用链表进行计算。

时间复杂度：O（n）

空间复杂度：O（1）

import sys

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class Linklist:
    def __init__(self):
        self.head = None
     
    def insert(self, data=None, string=None):
        if data:
            if not self.head:
                self.head = Node(data)                
            else:
                tmp = Node(data)
                tmp.next = self.head
                self.head = tmp
        if string:
            self.head = Node(string[0])
            for s in string[1:]:
                tmp = Node(s)
                tmp.next = self.head
                self.head = tmp
        return self.head

    def print(self, tmp):
        while tmp:
            print(tmp.data, end='')
            tmp = tmp.next
        print('')

def Addnum(r1, r2):
    r3 = Linklist()
    remain = 0
    str3 = ''
    while r1 or r2:
        v1, v2 = 0, 0
        if r1:
            v1 = int(r1.data)
            r1 = r1.next
        if r2:
            v2 = int(r2.data)
            r2 = r2.next
        add = v1 + v2 + remain
        val = add % 10
        remain = add // 10
        str3 += str(val)
        
    if remain != 0:
        str3 += str(remain)
    hed3 = r3.insert(string=str3)
    r3.print(hed3)
   
if __name__ == '__main__':
    if len(sys.argv) != 3:
        print("Usage: python3 %s <num1> <num2>" % sys.argv[0])
        sys.exit()

    str1, str2 = sys.argv[1], sys.argv[2]

    r1 = Linklist().insert(string=str1)
    r2 = Linklist().insert(string=str2)

    Addnum(r1, r2)