You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode h=new ListNode(0);
ListNode cur=h;
int curry=0;
while(l1!=null||l2!=null||curry!=0){
cur.next=new ListNode(0);
int sum=curry;
if(l1!=null){sum+=l1.val;l1=l1.next;}
if(l2!=null){sum+=l2.val;l2=l2.next;}
curry=sum/10;
cur.next.val=sum%10;
cur=cur.next;
}
return h.next;
}
}
看似是两个数相加,实际上应该是三个数相加,每一位的结果由三个部分组成:l1,l2,carry,只要三个部分其中有一个不是0,那么就要新建一个节点来储存。。
头节点是建立的辅助节点。不能存贮在当当前节点中,不然就会最后多一个节点。