给定两个 非空链表 l1
和 l2
来代表两个非负整数。数字最高位位于链表开始位置。它们的每个节点只存储一位数字。将这两数相加会返回一个新的链表。
可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例1:
输入:l1 = [7,2,4,3], l2 = [5,6,4] 输出:[7,8,0,7]
示例2:
输入:l1 = [2,4,3], l2 = [5,6,4] 输出:[8,0,7]
示例3:
输入:l1 = [0], l2 = [0] 输出:[0]
提示:
- 链表的长度范围为
[1, 100]
0 <= node.val <= 9
- 输入数据保证链表代表的数字无前导 0
进阶:如果输入链表不能修改该如何处理?换句话说,不能对列表中的节点进行翻转。
/**
* Definition for singly-linked list.
* 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; }
* }
*/
class Solution {
public ListNode reverse(ListNode head) {
ListNode newHead = new ListNode(0);
ListNode cur = head;
while (cur != null) {
ListNode curN = cur.next;
cur.next = newHead.next;
newHead.next = cur;
cur = curN;
}
return newHead.next;
}
public ListNode addTwoNumbers(ListNode head1, ListNode head2) {
// 逆序
head1 = reverse(head1);
head2 = reverse(head2);
// 高精度加法
ListNode cur1 = head1, cur2 = head2;
int t = 0;
ListNode ret = new ListNode(0), prev = ret;
while (cur1 != null || cur2 != null || t != 0) {
if (cur1 != null) {
t += cur1.val;
cur1 = cur1.next;
}
if (cur2 != null) {
t += cur2.val;
cur2 = cur2.next;
}
prev = prev.next = new ListNode(t % 10);
t /= 10;
}
return reverse(ret.next);
}
}