力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
/**
* 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 addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head=null,tail=null;
int sum=0,t=0;
while(l1!=null||l2!=null)
{
int x=(l1==null?0:l1.val);
int y=(l2==null?0:l2.val);
sum=x+y+t;
t=sum/10;
if(head==null)
{
head=tail=new ListNode(sum%10);
}
else
{
tail.next=new ListNode(sum%10);
tail=tail.next;
}
if(l1!=null)l1=l1.next;
if(l2!=null)l2=l2.next;
}
if(t>0)
{
tail.next=new ListNode(t);
}
return head;
}
}