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
/**
* Definition for singly-linked list.* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode t = new ListNode(0);
ListNode result = t;
ListNode next1=l1;
ListNode next2=l2;
int val1=0;
int val_1=0;
int val_2=0;
while(next1!=null||next2!=null){
if(next1==null&&next2!=null){
val1=next2.val+val_2;
next2=next2.next;
}
if(next2==null&&next1!=null){
val1= next1.val +val_2;
next1=next1.next;
}
if(next2!=null&&next1!=null){
val1= next1.val + next2.val+val_2;
next1=next1.next;
next2=next2.next;
}
val_1=val1%10;
val_2=val1/10;
t.next= new ListNode(val_1);
t=t.next;
if(val_2!=0){
t.next=new ListNode(val_2);
}
}
return result.next;
}
}