LeetCode-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.

Example:

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

思路：sum标记当前位之和，如有进位，carry置1，否则置0，最后不要忘记最后的进位1~

/**
 * 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* head = new ListNode(-1);
        ListNode* h=head;
        int sum=0;
        bool carry=false;
        while(l1!=NULL || l2!=NULL){
            sum=0;
            if(l1!=NULL){
                sum+=l1->val;
                l1=l1->next;
            }
            if(l2!=NULL){
                sum+=l2->val;
                l2=l2->next;
            }
            if(carry) sum++;
            h->next = new ListNode(sum%10);
            if(sum>=10) carry=true;
            else carry=false;
            h=h->next;
        }
        if(carry) h->next = new ListNode(1);
        return head->next;
    }
};