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.
给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1 == null) return l2;
if(l2 == null) return l1;
ListNode dummy = new ListNode(0); //结果链表
ListNode current = dummy;//跟随变化的指针
int carry = 0; //进位
while(l1 != null && l2 != null){ //两链表可以一一对应时
int dig = l1.val+l2.val+carry;
int val = dig%10;
carry = dig/10;
ListNode newnode = new ListNode(val);
current.next=newnode;
current = current.next;
l1 = l1.next;
l2 = l2.next;
}
while(l1 != null){ //不对应的时候
int val = (l1.val + carry)%10;
carry = (l1.val + carry)/10;
current.next = new ListNode(val);
current = current.next;
l1 = l1.next;
}
while(l2 != null){
int val = (l2.val + carry)%10;
carry = (l2.val + carry)/10;
current.next = new ListNode(val);
current = current.next;
l2 = l2.next;
}
if(carry != 0) //进最高位
current.next = new ListNode(carry);
return dummy.next;
}
}