LeetCode Java First 400 题解 - 002

最新推荐文章于 2025-04-21 22:09:55 发布

Felomeng

最新推荐文章于 2025-04-21 22:09:55 发布

阅读量247

点赞数

CC 4.0 BY-SA版权

分类专栏：刷题

本文链接：https://blog.csdn.net/felomeng/article/details/102699071

刷题专栏收录该内容

34 篇文章

订阅专栏

这篇博客介绍了如何解决LeetCode中的002题，即给定两个反向存储非负整数的链表，进行相加并返回结果链表。题目要求不包含前导零。博主提供了详细的Java解题代码，通过创建虚拟头节点，遍历链表并处理进位来实现链表相加。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Add Two Numbers Medium

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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode dummy = new ListNode(0);
    ListNode cur = dummy;
    int carry = 0, val = 0;
    while (l1 != null || l2 != null) {
        val = carry;
        if (l1 != null) {
            val += l1.val;
            l1 = l1.next;
        }
        if (l2 != null) {
            val += l2.val;
            l2 = l2.next;
        }
        carry = val / 10;
        val = val % 10;
        cur.next = new ListNode(val);
        cur = cur.next;
    }
    if (carry > 0) {
        cur.next = new ListNode(carry);
    }
    return dummy.next;
}