Leetcode_AddTwoNumbers

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

用到链表的知识，注意一下对于一些特殊情况的处理即可，类似{0} {1,8}, {5} {5}

ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
	int increment = 0;
	ListNode *ret;
	ListNode *currentnode;
	if(l1!=NULL && l2!=NULL){
	    ListNode* newnode = new ListNode(increment + l1->val + l2->val);
	    if(newnode -> val > 9){
	        newnode -> val -=10;
	        increment = 1;
	    }
	    ret = new ListNode(newnode->val);
	    currentnode = ret;
	   	l1 = l1 -> next;
		l2 = l2 -> next;
	}
	while(l1 != NULL && l2 !=NULL){
			ListNode *newnode = new ListNode(increment + l1->val + l2->val);
			currentnode -> next = newnode;
			currentnode = newnode;
		if(currentnode -> val > 9){
			currentnode -> val -= 10;
			increment = 1;
		}
		else{
			increment = 0;
		}
		l1 = l1 -> next;
		l2 = l2 -> next;
	}
	while(l1 != NULL){
		ListNode *newnode = new ListNode(increment + l1->val);
		currentnode -> next = newnode;
		currentnode = newnode;
		if(currentnode -> val > 9){
			currentnode -> val -= 10;
			increment = 1;
		}
		else{
			increment = 0;
		}
		l1 = l1 -> next;
	}

	while(l2 != NULL){
		ListNode *newnode = new ListNode(increment + l2->val);
		currentnode -> next = newnode;
		currentnode = newnode;
		if(currentnode -> val > 9){
			currentnode -> val -= 10;
			increment = 1;
		}
		else{
			increment = 0;
		}
		l2 = l2 -> next;
	}
	if(increment != 0){
	    currentnode -> next = new ListNode(increment);
	}
	return ret;
}