两数之和——LeetCode

最新推荐文章于 2024-10-16 10:13:45 发布

AllenC6

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量72

点赞数

分类专栏： Leetcode 文章标签： leetcode 算法 list

本文链接：https://blog.csdn.net/m0_37707561/article/details/125062456

版权

Leetcode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

本文介绍了一种使用Python实现的链表算法，通过递归或迭代方式将两个给定的链表相加，同时处理进位问题。主要涉及ListNode类的定义、addTwoNumbers方法的详细步骤，展示了如何在链表操作中应用基础数学原理。

摘要由CSDN通过智能技术生成

实现:

public class AddTwoNumbers {

    public static void main(String[] args) {

    }

    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int added = 0;
        ListNode header = l1;
        ListNode tempListNode = l1;
        while (l1 != null || l2 != null){
            if (l1 != null && l2 != null){
                int temp = l1.val + l2.val + added;
                if (temp >= 10){
                    temp = temp - 10;
                    added = 1;
                }else {
                    added = 0;
                }
                l1.val = temp;
                l1 = l1.next;
                if (l1 != null){
                   tempListNode = l1;
                }
                l2 = l2.next;
            }else if (l1 != null){
                int temp = l1.val + added;
                if (temp >= 10){
                    temp = temp - 10;
                    added = 1;
                }else {
                    added = 0;
                }
                l1.val = temp;
                l1 = l1.next;
                if (l1 != null){
                    tempListNode = l1;
                }
            }else{
                int temp = l2.val + added;
                if (temp >= 10){
                    temp = temp - 10;
                    added = 1;
                }else {
                    added = 0;
                }
                l2.val = temp;
                if (tempListNode != null){
                    tempListNode.next = l2;
                    tempListNode = tempListNode.next;
                }
                l2 = l2.next;
            }
        }
        if (added == 1 && tempListNode != null){
            tempListNode.next = new ListNode(1);
        }
        return header;
    }


    public class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
}