2. Add Two Numbers 两数相加 #Linked List #Math

2. Add Two Numbers

https://leetcode.com/problems/add-two-numbers/

Description

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

Solutions

1. 思路一，把链表转为数字，加起来，再把数字转为链表。在其中转为数字的时候用到Math.pow()；在把数字转为链表的时候记得保存表头（所谓的哑结点？）
2. 思路二，大数相加，从末位开始逐位相加，引入进位carry。

Submissions

我的~
因为根本不知道最后两数相加到底有多大，这样做是非常不安全的。

/**
 * 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) {
        //将链表转为数字
        double num1=0;
        double num2=0;
        double i1=0;
        while(l1!=null)
        {
            num1=num1+l1.val*Math.pow(10,i1);
            i1++;
            l1=l1.next;
        }
        double i2=0;
        while(l2!=null)
        {
            num2=num2+l2.val*Math.pow(10,i2);
            i2++;
            l2=l2.next;
        }
        int sum=(int)(num1+num2);     
        //将数字转为字符串
        String s=String.valueOf(sum);
        //将字符串转为链表
        ListNode lres=new ListNode(s.charAt(s.length()-1)-'0');
        //注意这里要把头结点保存下来，后面循环赋值的时候指针会跑到最后
        ListNode ans =lres;
        for(int i=s.length()-2;i>=0;i--)
        {
            lres.next = new ListNode(s.charAt(i)-'0');
            lres=lres.next;
        }
        return ans;
    }
}

用大数相加的方法，自己写了一遍，其中不会的new链表部分参考了答案，以及return head.next操作：

/**
 * 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) {
        ListNode prev = new ListNode(0);
        ListNode head = prev;
        int num1=0;
        int num2=0;
        int sum=0;
        int carry=0;
        while(l1!=null||l2!=null)
        {
            num1=(l1==null)?0:l1.val;
            num2=(l2==null)?0:l2.val;
            sum=num1+num2+carry;
            carry=sum/10;
            prev.next = new ListNode(sum % 10);
            prev=prev.next;
            
            if (l1!= null) l1= l1.next;
            if (l2!= null) l2= l2.next;
        }
        if(carry!=0)
            prev.next=new ListNode(1);
        return head.next;
    }
}

答案写得很ok：
https://leetcode-cn.com/problems/add-two-numbers/solution/liang-shu-xiang-jia-by-leetcode/

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode dummyHead = new ListNode(0);
    ListNode p = l1, q = l2, curr = dummyHead;
    int carry = 0;
    while (p != null || q != null) {
        int x = (p != null) ? p.val : 0;
        int y = (q != null) ? q.val : 0;
        int sum = carry + x + y;
        carry = sum / 10;
        curr.next = new ListNode(sum % 10);
        curr = curr.next;
        if (p != null) p = p.next;
        if (q != null) q = q.next;
    }
    if (carry > 0) {
        curr.next = new ListNode(carry);
    }
    return dummyHead.next;
}

Summary

遇到的错误：

1. if (p != null) p = p.next;
   if (q != null) q = q.next;
   忘记写向后继续遍历的这两句，然后死循环了……
2. 不知道可以返回dummyHead.next
3. 为什么要多写p = l1, q = l2，我直接用l1、l2也是可以过的。