Add Two Numbers——Linked List

题目

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.

思路

同时遍历两个单向链表，当有其中一个链表遍历完时，链表相应数字位赋值为0，并且需要维护一个进位值。当两个链表都遍历完且进位为0时，求和运算完成。

代码

/**
 * 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 *dummyHead = new ListNode(0);
        ListNode *p = l1, *q = l2, *cur = dummyHead;
        int a = 0, b = 0, carry = 0, sum = 0;
        while(p != NULL or q != NULL or carry != 0){
            if(p != NULL){
                a = p->val;
                p = p->next;
            }
            else
                a = 0;
            
            if(q != NULL){
                b = q->val;
                q = q->next;
            }
            else
                b = 0;
            
            sum = a + b + carry;
            carry = sum / 10;
            cur->next = new ListNode(sum % 10);
            cur = cur->next;
        }
        
        return dummyHead->next;
    }
};