You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
package leetcode;
class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode temp=new ListNode(0);
ListNode result=temp;
while(l1!=null||l2!=null){
int nextval=((l1==null?0:l1.val)+(l2==null?0:l2.val)+temp.val)/10;
temp.val=((l1==null?0:l1.val)+(l2==null?0:l2.val)+temp.val)%10;
if(nextval>0||(l1!=null&&l1.next!=null)||(l2!=null&&l2.next!=null)){
ListNode next=new ListNode(0);
next.val=nextval;
temp.next=next;
temp=next;
}
if(l1!=null&&l1.next!=null){
l1=l1.next;
}else{
l1=null;
}
if(l2!=null&&l2.next!=null){
l2=l2.next;
}else{
l2=null;
}
}
return result;
}
public static void main(String[]args){
ListNode l=new ListNode(1);
l.next=new ListNode(8);
ListNode r=new ListNode(0);
Solution s=new Solution();
ListNode t=s.addTwoNumbers(l,r);
System.out.print(""+t.val+""+t.next.val+"");
}
}