LeetCode(2): Add Two Numbers

最新推荐文章于 2020-07-14 12:02:11 发布

Chen_Cheng_Caspar

最新推荐文章于 2020-07-14 12:02:11 发布

阅读量227

点赞数

分类专栏： LeetCode 文章标签： LeetCode Add Two Numbers Linked List

本文链接：https://blog.csdn.net/Chen_Cheng_Caspar/article/details/88561685

版权

LeetCode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

LeetCode(2): Add Two Numbers

这个题目比较简单，就是用两个linked list来模拟两个数加法的过程，也就是每位数相加，并把carry out加进下一位。用两个pointer来指向当前需要相加的数位，并不断forward这两个pointer。需要注意的是处理当pointer是NULL时的情况。

题干

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.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    #iterate through the two linked lists, add the corresponding values,
    #create a new node for every added value and connect to the resulting list
    def addTwoNumbers(self, l1: 'ListNode', l2: 'ListNode') -> 'ListNode':
        result = ListNode(0)
        num = 0     #num stores the carry out digit
        current = result
        while l1!=None or l2!=None or num!=0:
            temp=num
            if l1!=None:
                temp+=l1.val
            if l2!=None:
                temp+=l2.val
            #suppose the current two digits to add are a and b, then
            #temp = a + b + carry-out-from-last
            current.val = temp%10
            num = int(temp/10)
            if (l1!=None and l1.next!=None) or (l2!=None and l2.next!=None) or num!=0:
                current.next = ListNode(0)
                current =current.next
            if (l1!=None):
                l1 = l1.next
            if l2!=None:
                l2 = l2.next
        current=None
        return result