LeetCode笔记 - OJ2 Add Two Numbers

LeetCode笔记 - OJ2 Add Two Numbers

题目描述
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.

---

• 注意多种corner cases：最后一次相加过后进位；一个Input已经耗尽之后仍在进位，如1+999等
• 遇到需要赋值才能新建的ListNode，不必要把第一次相加的操作做完再设定root，可以随意设定一个root，然后开始正式循环，最后返回root.next为结果。可以节省代码长度。

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int flag = 0;

        ListNode curr1;
        ListNode curr2;
        ListNode root;
        ListNode result;

        root = new ListNode(0);//随意新建一个root
        result = root;

        curr1 = l1;
        curr2 = l2;

        while(curr1 != null || curr2 != null){
            if(curr1 == null){
                int sum = curr2.val + flag;
                curr2 = curr2.next;

                if(sum > 9) flag = 1;
                else flag = 0;

                result.next = new ListNode(sum % 10);
                result = result.next;
            }
            else if(curr2 == null){
                int sum = curr1.val + flag;
                curr1 = curr1.next;

                if(sum > 9) flag = 1;
                else flag = 0;

                result.next = new ListNode(sum % 10);
                result = result.next;
            }
            else{
                int sum = curr1.val + curr2.val + flag;
                curr1 = curr1.next;
                curr2 = curr2.next;
                if(sum > 9) flag = 1;
                else flag = 0;

                result.next = new ListNode(sum % 10);
                result = result.next;
            }
        }
        //别忘了最后一次进位的结果
        if(flag == 1) result.next = new ListNode(1);
        //返回root.next
        return root.next;
    }
}