【LeetCode】2_Add Two Numbers

题目

Add Two Numbers

  Total Accepted: 81118  Total Submissions: 398160 My Submissions

Question  Solution 

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

解析

就是链表的操作。需要注意的是

1.满10需要进位

2.要考虑链表个数不等的情况

3.要考虑类似[1],[9,9]这种加起来比最长的链表还长的情况

我的代码极长极复杂。

先贴出来吧。

/**
 * 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)
		{
			return l2;
		}
		if (l2 == NULL)
		{
			return l1;
		}
		ListNode *p1 = l1->next;
		ListNode *p2 = l2->next;

		ListNode *ret = new ListNode(0);
		ListNode *point = ret;

		bool flag = false;
		while(l1 && l2  ||(l1 ==NULL && l2==NULL && flag==true))
		{
			int value ;
			if (l1 ==NULL && l2==NULL)
			{
				value = 0;
			}
			else
			{
				value = l1->val + l2->val;
			}
			if (flag)
			{
				value++;
			}
			if (value > 9)
			{
				flag = true;
				point->val = value - 10;
			}
			else
			{
				flag = false;
				point->val = value;
			}

			if (l1 ==NULL && l2==NULL)
			{
				
			}
			else
			{
				l1 = l1->next;
				l2 = l2->next;
			}
			

			if (l1 || l2 ||(l1 ==NULL && l2==NULL&&flag==true))
			{
				ListNode *p = new ListNode(0);
				point->next = p;
				point = p;
			}
			
			//ret = tmp;
		}

		while (l1 || (l1==NULL && flag==true&&l2==NULL))
		{
			if (flag && l1==NULL)
			{
				point->val =  1;
			}
			else if (flag)
			{
				point->val = l1->val + 1;
			}
			else
			{
				point->val = l1->val;
			}
			
			if (point->val > 9)
			{
				point->val = point->val - 10;
				flag = true;
			}
			else
			{
				flag = false;
				point->val = point->val;
			}
			
			if (l1)
			{
				l1=l1->next;
			}
			if (l1 || (l1==NULL && flag==true))
			{
				ListNode *p = new ListNode(0);
				point->next = p;
				point = p;
			}
		}


		while (l2|| (l2==NULL && flag==true&&l1==NULL))
		{
			if (flag && l2==NULL)
			{
				point->val =  1;
			}
			else if (flag)
			{
				point->val = l2->val + 1;
			}
			else
			{
				point->val = l2->val;
			}
			if (point->val > 9)
			{
				point->val = point->val - 10;
				flag = true;
			}
			else
			{
				flag = false;
				point->val = point->val;
			}
			if (l2)
			{
				l2=l2->next;
			}
			if (l2 ||(l2==NULL && flag==true))
			{
				ListNode *p = new ListNode(0);
				point->next = p;
				point = p;
			}
		}
		return ret;
	}
};

废话不多说，直接上大神的代码

	ListNode* addTwoNumbers_2_BigGod(ListNode *l1, ListNode *l2) {
		ListNode dummy(-1); // 头节点
		int carry = 0;
		ListNode *prev = &dummy;
		for (ListNode *pa = l1, *pb = l2;
			pa != nullptr || pb != nullptr;
			pa = pa == nullptr ? nullptr : pa->next,
			pb = pb == nullptr ? nullptr : pb->next,
			prev = prev->next) {
				const int ai = pa == nullptr ? 0 : pa->val;
				const int bi = pb == nullptr ? 0 : pb->val;
				const int value = (ai + bi + carry) % 10;
				carry = (ai + bi + carry) / 10;
				prev->next = new ListNode(value); // 尾插法
		}
		if (carry > 0)
			prev->next = new ListNode(carry);
		return dummy.next;
	}

仔细想了想，自己对链表的使用还是太弱了，才会把简单的问题折腾的这么复杂。

同时，另一种方法是把链表换成数字，求和后再换成链表，感觉思路很清晰的是如下代码

public class Solution {
        public Long listTOLong(ListNode l){
        long num = 0;
        long temp =1;
        int i=0;
        while(l!=null){
            num = num+l.val*temp;
            temp=temp*10;
            l=l.next;
        }
        return num;
    }   
    public ListNode longToList(Long num){        
        ListNode l3 = new ListNode(-1);
        l3.next = null;
        ListNode c = l3;
        c.val=(int)(num%10);
        num = num/10;
        while(num>0){        
            ListNode cnext = new ListNode((int)(num%10));
            cnext.next=null;
            c.next=cnext;
            num = num/10;
            c=c.next;
        }
        return l3;
    }
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if(l1==null&&l2==null){
            return null;
        }
        //链表转long型
        long num1 = listTOLong(l1);
        long num2 = listTOLong(l2);
        //System.out.println("l1:"+num1+" l2:"+num2);
        long num3 = num1+num2;
        //System.out.println("l3:"+num3);
        //long型转链表
        ListNode l3 = longToList(num3);
        return l3;
         
    }
}