Leetcode_Linked_List --2. Add Two Numbers [medium]

---

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.

给定两个非空链表，代表了两个非负整数。整数被倒序存储在链表的每一个节点中，将这两个数相加并返回一个相同形式的链表。

假定除了数字0，这两个数不以0开头。

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

Solution：

Python

# Definition for singly-linked list. #定义单链表
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def addTwoNumbers(self, l1: 'ListNode', l2: 'ListNode') -> 'ListNode':
        '''
        定义一个链表和两个指向链表的指针
        dummy用来返回题目所需的链表(题目所需链表接在定义的链表后)
        cur用来更新链表
        '''
        dummy = cur = ListNode(0) 
        num = 0
        while l1 or l2 or num:
            #判断num的原因是当两链表的最后一个节点相加大于10的时候，需要记录两位，即个位存入链表之后，还需要在链表最后记录进位的十位1
            if l1:
                num += l1.val
                l1 = l1.next
            if l2:
                num += l2.val
                l2 = l2.next
            cur.next = ListNode(num%10) #num对10求余，得到小于10的数
            cur = cur.next
            num = num//10 #如果两个数相加大于10，进位的1需要在下一位被加入计算
        return dummy.next

C++


/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
		ListNode* dummy = new ListNode(-1);
		ListNode* temp = dummy;
        int num = 0;
        while(l1 or l2 or num){
            if (l1){
                num += l1->val;
                l1 = l1->next;
            }
            if (l2){
                num += l2->val;
                l2 = l2->next;
            }
            ListNode *node = new ListNode(num%10);
            temp->next = node;
            temp = temp->next;
            num = int(num/10);
        }
        return dummy->next;
        
    }
};