Leetcode2两链表之和（个位数在左边，无需用栈）

 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.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

/**
 * 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*dummynode=new ListNode(-1);
        ListNode*pnode=dummynode;//由于要新建链表，且返回头节点因此要设置dummy 
        if(l1==NULL){
            return l2;
        }
        if(l2==NULL){
            return l1;
        }
        int jinwei=0;
        int sum;
        while(l1!=NULL||l2!=NULL){
            sum=0;//sum=0要定义在循环内部，每一次相加都要清空sum
            if(l2!=NULL){
                sum+=l2->val;
                l2=l2->next;//别忘了更新l1和l2
            }
            if(l1!=NULL){
                sum+=l1->val;
                l1=l1->next;
            }
            sum+=jinwei;
            pnode->next=new ListNode(sum%10);//建立pnode->next
            jinwei=sum/10;
            pnode=pnode->next;//pnode要更新
        }
        if(jinwei==1){
            pnode->next=new ListNode(1);
        }
        return dummynode->next;
    }
};//思想，建立dummynode，再声明一个递归的节点pnode=dummy，依次建立pnode->next
//即可，一切以dummy为起点