LeetCode 题解-2.add two numbers - 张磊的技术笔记

对Leetcode 2. two sum 题目的求解。

Problem 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#

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

Solution#

就像用链表实现大整数运算一样，算法没有什么可将的，就是要注意边界条件

考虑两个n位数加起来为n+1位数的情况
考虑0+一个数的情况
考虑对齐相加进位的实现。

Code#

1
class Solution {
2

3
    public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
4
        ListNode res = new ListNode(0);
5
        ListNode tmp = res;
6
        int last = 0;
7
        while (l1 != null && l2 != null){
8
            tmp.next = new ListNode((l1.val + l2.val + last)%10);
9
            last = (l1.val + l2.val +last) / 10;
10
            l1 = l1.next;
11
            l2 = l2.next;
12
            tmp = tmp.next;
13
        }
14
        ListNode temp = null;
15
        if (l1 != null){
16
            temp = l1;
17
        }
18
        if (l2 != null){
19
            temp = l2;
20
        }
21
        while (temp != null){
22
            tmp.next = new ListNode((temp.val + last)%10);
23
            last = (temp.val +last) / 10;
24
            temp = temp.next;
25
            tmp = tmp.next;
26
        }
27
        if (last > 0){
28
            tmp.next = new ListNode(last);
29
        }
30
        return res.next;
31
    }
32
}