Add Two Numbers

Add Two Numbers Nov 1 '11

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

这道题不难，主要是复习一下链表。代码如下：

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function

		ListNode *last = NULL;
		ListNode *ret = NULL;
		int sum,val,carry = 0;
        while(l1!=NULL && l2!=NULL)
        {
            sum = l1->val + l2->val+carry;
            carry = sum/10;
			val = sum%10;
            ListNode *node = new ListNode(val);
			if(last!=NULL){
				last->next = node;		
			}else{
				ret = node;
			}
			last = node;
			l1=l1->next;
            l2=l2->next;
        }

		if(l1!=NULL){
			while(l1!=NULL)
			{
				sum = l1->val + carry;
				carry = sum/10;
				val = sum%10;

				ListNode *node = new ListNode(val);
				if(last!=NULL){
					last->next = node;
				}else{
					ret = node;
				}
				last = node;
				l1=l1->next;
			}
		}else if(l2!=NULL){

			while(l2!=NULL)
			{
				sum = l2->val + carry;
				carry = sum/10;
				val = sum%10;
				ListNode *node = new ListNode(val);
				if(last!=NULL){
					last->next = node;
				}else{
					ret = node;
				};
				last = node;
				l2=l2->next;
			}
		}
		
		if(carry>0) {
			ListNode *node = new ListNode(carry);
			last->next = node;
			last = node;
			carry = 0;
		}
        last->next = NULL;
        return ret;
		}
    
};

写得比较啰嗦，改了一下。

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ListNode *head = new ListNode(0);
        ListNode *p = head;
        
        int sum  = 0;
        int carry = 0;
        while(l1 || l2 || carry)
        {
            int num1 = (l1==NULL)? 0 : l1->val;
            int num2 = (l2==NULL)? 0 : l2->val;
            sum = num1 + num2 + carry;
            carry = sum/10;
            p->next = new ListNode(sum%10);
            p = p->next;
            l1 = (l1==NULL)? NULL : l1->next;
            l2 = (l2==NULL)? NULL : l2->next;     
        }
        return head->next;
    }
};

200 milli secs