两数之和
力扣第二题 终于做完了
主要是进位;
ListNode dummy = new ListNode(0);
ListNode cur = dummy;
int carry = 0;
while(l1!=null||l2!=null){
int x = l1==null?0:l1.val;
int y = l2==null?0:l2.val;
int sum = x+y+carry;
cur.next = new ListNode(sum%10);
//计算进位
carry = sum/10;
if(l1!=null) l1=l1.next;
if(l2!=null) l2=l2.next;
cur=cur.next;
}
if(carry==1) cur.next = new ListNode(carry);
return dummy.next;