You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode ln1, head;
int flag = 0;
head = ln1 = new ListNode(0);
while (l1 != null || l2 != null) {

这篇博客介绍了如何解决LeetCode中的2. Add Two Numbers问题,即如何将两个反向链表表示的非负数相加。博主分享了自己的解决方案,并提及看到一个更优的解法,感到印象深刻。
订阅专栏 解锁全文
390

被折叠的 条评论
为什么被折叠?



