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
[code]
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1==null)return l2;
if(l2==null)return l1;
ListNode prev1=new ListNode(-1), prev2=new ListNode(-1), head =l1;
prev1.next=l1;prev2.next=l2;
int carry=0, r=0;
while(l1!=null && l2!=null)
{
r=l1.val+l2.val+carry;
carry=r/10;
l1.val=r%10;
l1=l1.next;prev1=prev1.next;
l2=l2.next;prev2=prev2.next;
}
if(l1==null)prev1.next=l2;
l1=prev1.next;
while(l1!=null && carry==1)
{
r=l1.val+carry;
carry=r/10;
l1.val=r%10;
l1=l1.next;
prev1=prev1.next;
}
if(carry==1)
{
prev1.next=new ListNode(1);
}
return head;
}
}
[Thoughts]
dummy+previous