/**
* 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 res=new ListNode();//最终返回的链表,首节点不存数据
//将res链表的地址给curr
ListNode curr=res;//curr是辅助链表,用于链表后续元素拼接
//用于获取十位上的数字,这里一般是0或1
int next1=0;
while(l1!=null && l2!=null)
{
int sum=l1.val+l2.val+next1;
curr.next=new ListNode(sum%10);//求余获取个位上的数字
next1=sum/10;//获取十位上的数字
l1=l1.next;
l2=l2.next;
curr=curr.next;
}
//到这里一般出现了l1或者l2链表有一个为空的情况
while(l1!=null)
{
int sum=l1.val+next1;
curr.next=new ListNode(sum%10);
next1=sum/10;
l1=l1.next;
curr=curr.next;
}
while(l2!=null)
{
int sum=l2.val+next1;
curr.next=new ListNode(sum%10);
next1=sum/10;
l2=l2.next;
curr=curr.next;
}
//当l1和l2都为空的情况下,判断next1是否还有值(为1)
if(next1==1)
{
ListNode q=new ListNode(1);
curr.next=q;
q.next=null;
}
//返回首节点的下一个结点
return res.next;
}
}