2. Add Two Numbers 难度：Medium

题目：

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

解题思路：

这道题主要考察的是对单链表的操作，根据已有的两个链表来建立新的链表。算法的过程主要是在遍历两个链表的过程中模拟两个整数加法的操作，相应数位与上一位的进位相加，得到的结果除以10的余数为结果当前数位的值，商为进位传递给下一位。在遍历两个链表的时候会遇到四种情况，第一种是两个链表均未到底，此时按常规加法操作，第二种是两个链表有一个已到底而另一个并未到底，此时结果为未到底的数位加上上一位的进位，第三种是两个链表均到底，此时要判断上一位是否有进位，如果有在结果链表后面加上该进位，遍历结束，返回结果链表的第一个结点。复杂度为O(n),n为两个链表长度的最大值。

程序：

/**
 * 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) {
	if(l1 == NULL&&l2 == NULL)
	    return NULL;
		
	ListNode *root = NULL;
	ListNode *tail = NULL;
	ListNode *p = NULL;
	int sum = 0;
	int carry = 0;
	
	while(1)
	{
		if(l1 != NULL&&l2 != NULL)
		{
			sum = carry + l1->val + l2->val;
			p = new ListNode(sum % 10);
			carry = sum / 10;
			if(root == NULL)
			{
				root = p;
				tail = root;
			}
			
			else
			{
				tail->next = p;
				tail = tail->next;
			}
			l1 = l1->next;
			l2 = l2->next;
		}
		
		else if(l1 != NULL&&l2 == NULL)
		{
			sum = carry + l1->val;
			p = new ListNode(sum % 10);
			carry = sum / 10;
			if(root == NULL)
			{
				root = p;
				tail = root;
			}
			
			else
			{
				tail->next = p;
				tail = tail->next;
			}
			l1 = l1->next;
		}
		
		else if(l1 == NULL&&l2 != NULL)
		{
			sum = carry + l2->val;
			p = new ListNode(sum % 10);
			carry = sum / 10;
			if(root == NULL)
			{
				root = p;
				tail = root;
			}
			
			else
			{
				tail->next = p;
				tail = tail->next;
			}
			l2 = l2->next;
		}
		else
		{
			if(carry)
			{
				p = new ListNode(carry);
				tail->next = p;
			}
			
			break;
		}
		
	}
	
	return root;
        
    }
};