Add Two Numbers

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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

这道题注意加法进位

/**
 * 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 *p1 = l1->next;
        ListNode *p2 = l2->next;

        int sum, carry;//carry表进位

        sum = l1->val + l2->val;
        if (sum >=10)
        {
            carry = 1;
        }
        else
        {
            carry=0;
        }
        ListNode *result = new ListNode(sum % 10);
        ListNode *m = result;

        while (p1!= nullptr&& p2!= nullptr)
        {
            sum = p1->val + p2->val;
            ListNode *p = new ListNode(sum%10 + carry);

            if (sum >=10)
            {
                carry = 1;

            }
            else
            {
                carry = 0;
            }

            m->next = p;
              m= p;
            p1 = p1->next;
            p2 = p2->next;



        }
    while(p1)
        {
            sum = p1->val + carry;
            ListNode *p = new ListNode(sum%10 + carry);
            if (sum >= 10)
            {
                carry = 1;
            }
            else
            {
                carry = 0;
            }
            m->next = p;
            m = p;
            p1 = p1->next;

        }
        while (p2)
        {
            sum = p2->val + carry;
            ListNode *p = new ListNode(sum % 10 + carry);
            if (sum >= 10)
            {
                carry = 1;
            }
            else
            {
                carry = 0;
            }
            m->next = p;
            m = p;
            p2 = p2->next;

        }
        if (carry!=0)
        {
            ListNode *p = new ListNode(1);
            m->next = p;
            m = m->next;



        }
        return result;
    }

    };

        经检查发现其实是
        进位对下次和有影响但不影响本次和。代码修改如下：

        /**
 * 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 *p1 = l1->next;
        ListNode *p2 = l2->next;

        int sum, carry;

        sum = l1->val + l2->val;
        if (sum >=10)
        {
            carry = 1;
        }
        else
        {
            carry=0;
        }
        ListNode *result = new ListNode(sum %10);
        ListNode *m = result;

        while (p1!= nullptr&& p2!= nullptr)
        {
            sum = p1->val + p2->val+carry;
            ListNode *p = new ListNode((sum)%10);

            if (sum >=10)
            {
                carry = 1;

            }
            else
            {
                carry = 0;
            }

            m->next = p;
              m= p;
            p1 = p1->next;
            p2 = p2->next;



        }
    while(p1)
        {
            sum = p1->val + carry;
            ListNode *p = new ListNode((sum 
            )%10);
            if (sum >= 10)
            {
                carry = 1;
            }
            else
            {
                carry = 0;
            }
            m->next = p;
            m = p;
            p1 = p1->next;

        }
        while (p2)
        {
            sum = p2->val + carry;
                ListNode *p = new ListNode((sum 
                )%10);
            if (sum >= 10)
            {
                carry = 1;
            }
            else
            {
                carry = 0;
            }
            m->next = p;
            m = p;
            p2 = p2->next;

        }
        if (carry!=0)
        {
            ListNode *p = new ListNode(1);
            m->next = p;
            m = m->next;



        }
        return result;
    }

    };
最终结果accepted.