002_LeetCode_2 Add Two Numbers 题解

最新推荐文章于 2024-05-14 22:09:50 发布

夕舞雪薇

最新推荐文章于 2024-05-14 22:09:50 发布

阅读量303

点赞数 1

分类专栏： LeetCode题解文章标签： leetcode 算法

本文链接：https://blog.youkuaiyun.com/fzy1993/article/details/78167599

版权

LeetCode题解专栏收录该内容

20 篇文章

订阅专栏

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.

给出了两个非空链表，表示两个非负整数。数字以倒序存储，每个节点都包含一个数字。将两个整数相加并返回相加后的链表。

解：

两个链表相加的值加上进位为当前值，当前值与10的余数作为当前节点的值，同时更新进位。直到两个链表均遍历完且无进位。

java代码：

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode head = new ListNode(0);
        ListNode prev = head;
        int count = 0;
        while (l1 != null || l2 != null || count != 0){
            ListNode now = new ListNode(0);
            int sum = (l1 == null ? 0 : l1.val) + (l2 == null ? 0 : l2.val) + count;
            now.val = sum % 10;
            count = sum / 10;
            prev.next = now;
            prev = now;
            if (l1 != null) l1 = l1.next;
            if (l2 != null) l2 = l2.next;
        }
        return head.next;
    }
}