2. Add Two Numbers

最新推荐文章于 2024-01-03 15:29:28 发布

lifeqiuzhi521

最新推荐文章于 2024-01-03 15:29:28 发布

阅读量83

点赞数

CC 4.0 BY-SA版权

分类专栏：算法编程挑战

本文链接：https://blog.youkuaiyun.com/lifeqiuzhi521/article/details/80963203

算法同时被 2 个专栏收录

82 篇文章

订阅专栏

编程挑战

81 篇文章

订阅专栏

本文介绍了一种算法，该算法接收两个非空链表作为输入，这两个链表分别表示两个非负整数，并以逆序方式存储每位数字。通过将这两个数相加后返回一个新的链表来表示其结果。

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

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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
           ListNode header = null;
            int forward = 0;
            ListNode temp = null;

            while (l1 != null && l2 != null) {
                int digitCount = l1.val + l2.val + forward;
                forward = digitCount / 10;
                if (header == null) {
                    header = temp = new ListNode(digitCount % 10);
                } else {
                    temp.next = new ListNode(digitCount % 10);
                    temp = temp.next;
                }
                l1 = l1.next;
                l2 = l2.next;
            }
            while (l1 != null) {
                temp.next = l1;
                temp = temp.next;
                int count = (l1.val + forward);
                l1.val = count % 10;
                forward = count / 10;
                l1 = l1.next;

            }
            while (l2 != null) {
                temp.next = l2;
                temp = temp.next;
                int count = (l2.val + forward);
                l2.val = count % 10;
                forward = count / 10;
                l2 = l2.next;

            }


            if (forward != 0) {
                temp.next = new ListNode(forward);
            }
            return header;





    }

}