LeetCode 2. 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.

解法一:从两个linkedlist的头部开始往后走,每次都将两个头部的数值和carry相加得到sum,于是linkedlist当前node的值即为sum%10, carray值为sum/10, 然后继续往下走直到都为null. 注意每次移动l1和l2指针的时候要先判断一下是不是为null,否则会导致空指针error,注意最后要判断一下carry值是不是为0,如果不为0,则再多加一个值为1的node. 时间复杂度为O(n), 空间复杂度为O(n).

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if (l1 == null) return l2;
        if (l2 == null) return l1;
        ListNode dummy = new ListNode(-1), cur = dummy;
        int carry = 0, sum = 0;
        while (l1 != null || l2 != null) {
            int num1 = l1 == null ? 0 : l1.val;
            int num2 = l2 == null ? 0 : l2.val;
            sum = num1 + num2 + carry;
            ListNode temp = new ListNode(sum % 10);
            carry = sum / 10;
            cur.next = temp;
            cur = temp;
            if (l1 != null) l1 = l1.next;
            if (l2 != null) l2 = l2.next;
        }
        if (carry != 0) {
            cur.next = new ListNode(1);
        }
        return dummy.next;
    }
阅读更多
文章标签: leetcode
个人分类: LinkedList
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭