【leetcode】2. 两数相加

 给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。

如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例：

输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出：7 -> 0 -> 8
原因：342 + 465 = 807

正确答案：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		if (l1 == null || l2 == null) {
			return null;
		}

		int sum = 0;
		ListNode head = new ListNode(0);
		ListNode current = head;
		int flag = 0;// 实现满十进一

		while (l1 != null && l2 != null) {
			sum = l1.val + l2.val + flag;

			flag = 0;// 上一轮导致的+1，加完之后清零。开启这一轮是否需要加1的判断
			if (sum >= 10) {
				sum = sum % 10;
				flag = 1; // 满十进一
			}

			current.next = new ListNode(sum);// 注意这里要new一个对象，不然会空指针异常。current.next之前并没有被实例化
			current = current.next;
			l1 = l1.next;
			l2 = l2.next;

		}

		// l1还有剩余
		while (l1 != null) {
			sum = l1.val + flag;

			flag = 0;
			if (sum >= 10) {
				sum = sum % 10;
				flag = 1;
			}

			current.next = new ListNode(sum);
			current = current.next;
			l1 = l1.next;

		}

		// l2还有剩余
		while (l2 != null) {
			sum = l2.val + flag;

			flag = 0;
			if (sum >= 10) {
				sum = sum % 10;
				flag = 1;
			}

			current.next = new ListNode(sum);
			current = current.next;
			l2 = l2.next;

		}
        
        //如果最后还剩一个进位的话
		if (flag == 1) {
			current.next = new ListNode(1);
		}

		return head.next;// 注意current指向的是尾结点，我们要通过头指针来找回链表头。
	}
}

 我之前的错误思路：

//错误原因：如果没有头结点。我们将再也找不到链表头，因为我们已经移动了list
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		if (l1 == null || l2 == null) {
			return null;
		}

		int sum = 0;
		ListNode list = new ListNode(0);
		int flag = 0;// 实现满十进一

		while (l1 != null && l2 != null) {
			sum = l1.val + l2.val + flag;
			flag = 0;// 上一轮导致的+1，加完之后清零。开启这一轮是否需要加1的判断

			if (sum >= 10) {
				list.val = sum % 10;
				flag = 1; // 满十进一
			} else {
				list.val = sum;
			}

			l1 = l1.next;
			l2 = l2.next;
			list.next = new ListNode(0);// 注意这里要new一个对象，不然会空指针异常。list.next之前并没有被实例化
			list = list.next;
		}

		while (l1 != null) {
			sum = sum = l1.val + flag;

			flag = 0;
			if (sum >= 10) {
				list.val = sum % 10;
				flag = 1;
			} else {
				list.val = sum;
			}

			l1 = l1.next;
			list.next = new ListNode(0);
			list = list.next;
		}

		while (l2 != null) {
			sum = sum = l2.val + flag;

			flag = 0;
			if (sum >= 10) {
				list.val = sum % 10;
				flag = 1;
			} else {
				list.val = sum;
			}

			l2 = l2.next;
			list.next = new ListNode(0);
			list = list.next;
		}

		if (flag == 1) {
			list.next = new ListNode(1);
		}

		return list;
	}
}

---

值得参考的代码： 

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

        ArrayList<Integer> list = new ArrayList<>();
        ListNode head1 = l1;
        ListNode head2 = l2;
        int count = 0;
        while (head1 != null && head2 !=null){
           int num =  head1.val + head2.val+ count;
            count = 0;
            if(num >= 10){
                count = num / 10 ;
                num %= 10;
            }
            list.add(num);
            head1= head1.next;
            head2 = head2.next;
        }
        //restNode表示剩下的较长链表的下一个未遍历结点
        ListNode restNode = (head1 == null) ? head2:head1; 
        while(restNode != null ){
            int num = restNode.val + count;
            count = 0;
            if(num >= 10){
                count = num / 10 ;
                num %= 10;
            }
            list.add(num);
            restNode = restNode.next;
        }
        if(count!= 0)
            list.add(count);
        ListNode dummyHead = new ListNode(-1);
        ListNode head = dummyHead;
        for (int i = 0; i < list.size(); i++) {
            head.next = new ListNode(list.get(i));
            head = head.next;
        }
        head.next = null;
        return dummyHead.next;
    }
}

 //类似于归并的过程
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int added = 0;
        int nodeSum = 0;
        ListNode head = new ListNode(0);
        ListNode cur = head;
        while(l1 != null && l2 != null){
           nodeSum = l1.val + l2.val + added;
           if(nodeSum >= 10){
               nodeSum = nodeSum % 10;
               added = 1;
           } else{
               added = 0;
           }
            cur.next = new ListNode(nodeSum);
            cur = cur.next;
            l1 = l1.next;
            l2 = l2.next;
        }
        while(l1 != null){
           nodeSum = l1.val + added;
           if(nodeSum >= 10){
               nodeSum = nodeSum % 10;
               added = 1;
           } else{
               added = 0;
           }
            cur.next = new ListNode(nodeSum);
            cur = cur.next;
            l1 = l1.next;
        }
        while(l2 != null){
           nodeSum = l2.val + added;
           if(nodeSum >= 10){
               nodeSum = nodeSum % 10;
               added = 1;
           } else{
               added = 0;
           }
            cur.next = new ListNode(nodeSum);
            cur = cur.next;
            l2 = l2.next;
        }
        if(added == 1){
            cur.next = new ListNode(1);
        }
        return head.next;
    }

//错误原因：如果没有头结点。我们将再也找不到链表头，因为我们已经移动了list
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		if (l1 == null || l2 == null) {
			return null;
		}

		int sum = 0;
		ListNode list = new ListNode(0);
		int flag = 0;// 实现满十进一

		while (l1 != null && l2 != null) {
			sum = l1.val + l2.val + flag;
			flag = 0;// 上一轮导致的+1，加完之后清零。开启这一轮是否需要加1的判断

			if (sum >= 10) {
				list.val = sum % 10;
				flag = 1; // 满十进一
			} else {
				list.val = sum;
			}

			l1 = l1.next;
			l2 = l2.next;
			list.next = new ListNode(0);// 注意这里要new一个对象，不然会空指针异常。list.next之前并没有被实例化
			list = list.next;
		}

		while (l1 != null) {
			sum = sum = l1.val + flag;

			flag = 0;
			if (sum >= 10) {
				list.val = sum % 10;
				flag = 1;
			} else {
				list.val = sum;
			}

			l1 = l1.next;
			list.next = new ListNode(0);
			list = list.next;
		}

		while (l2 != null) {
			sum = sum = l2.val + flag;

			flag = 0;
			if (sum >= 10) {
				list.val = sum % 10;
				flag = 1;
			} else {
				list.val = sum;
			}

			l2 = l2.next;
			list.next = new ListNode(0);
			list = list.next;
		}

		if (flag == 1) {
			list.next = new ListNode(1);
		}

		return list;
	}
}