给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/add-two-numbers
/**
* 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) {
if(l1==null||l2==null) return null;
ListNode dummy = new ListNode(0);
ListNode l3 = dummy;
int carry = 0;
int sum = 0;
while(l1!=null&&l2!=null){
int temp = l1.val + l2.val;
sum = (temp+carry)%10;
carry = (temp+carry)/10;
l3.next = new ListNode(sum);
l3 = l3.next;
l2 = l2.next;
l1 = l1.next;
}
while(l1!=null){
int temp = l1.val;
sum = (temp+carry)%10;
carry = (temp+carry)/10;
l3.next = new ListNode(sum);
l3 = l3.next;
l1 = l1.next;
}
while(l2!=null){
int temp = l2.val;
sum = (temp+carry)%10;
carry = (temp+carry)/10;
l3.next = new ListNode(sum);
l3 = l3.next;
l2 = l2.next;
}
if(carry==1)l3.next = new ListNode(1);
return dummy.next;
}
}
总结
1.sum = (temp+carry)%10;
carry = (temp+carry)/10;
2.if(carry==1)l3.next = new ListNode(1);