LeetCode OJ(2.Add Two Numbers)

题目:
You are given two linked lists representing two non-negative numbers. 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.

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) {
        int flag = 0;
        ListNode* tail = new ListNode(0);
        ListNode* current = tail;

        while(l1 || l2){
            int val1 = 0;
            if(l1 != NULL){
                val1 = l1->val;
                l1 = l1->next;
            }

            int val2 = 0;
            if(l2 != NULL){
                val2 = l2->val;
                l2 = l2->next;
            }

            int temp = val1 + val2 + flag;
           current->next = new ListNode(temp % 10);
            flag = temp / 10;
            current = current->next;
        }

        if(flag == 1){
            current->next = new ListNode(1);
        }//注意最后的进位
        return tail->next;
    }
};