超级会员免费看
该博客介绍了如何解决LeetCode上的2题——将两个按逆序存储的非负整数链表相加。文章讨论了两种方法，其中方法1是正确的解决方案，能够有效处理链表并记录进位，而方法2则被指出是错误的。正确方法的运行效率超过了87.48%的Java提交。
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: (1 -> 4 -> 3) + (5 -> 8 -> 4)
Output: 6 -> 2 -> 8
Constraints:
- The number of nodes in each linked list is in the range
[1, 100].//100位数,int/long会溢出 0 <= Node.val <= 9- It is guaranteed that the list represents a number that
订阅专栏 解锁全文
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
