2. Add Two Numbers leetcode

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 * result = new ListNode(0);
        ListNode * head;
        int sum = 0,val = 0,next_val = 0;
        //result = new ListNode;
        head = result;
        while(l1!=NULL&&l2!=NULL)
        {
            sum = l1->val + l2->val+next_val;
            next_val = sum>=10?1:0;
            result->next = new ListNode(sum>=10?sum-10:sum);
            result = result->next;       
            l1 = l1->next;
            l2 = l2->next;
        }
        l1 = l1 == NULL?l2:l1;
        while(l1!=NULL)
        {
            sum = l1->val + next_val;
            next_val = sum>=10?1:0;
            result->next = new ListNode(sum>=10?sum-10:sum);
            result = result->next;  
            l1 = l1->next;
        }
        if(next_val!=0)
        {
            result->next = new ListNode(next_val);
        }
        return head->next;
    }
    
};