LeetCode Add Two Numbers

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) {
		int add = 0;
        ListNode listNode = new ListNode((l1.val+l2.val+add)%10);
        add = (l1.val+l2.val+add)/10;
        ListNode tempListNode = listNode;
        l1 = l1.next; l2 = l2.next;
        while(l1!=null&&l2!=null){
        	tempListNode.next = new ListNode((l1.val+l2.val+add)%10);
        	add = (l1.val+l2.val+add)/10;
        	tempListNode = tempListNode.next;
        	l1 = l1.next;
        	l2 = l2.next;
        }
        while(l1!= null){
        	tempListNode.next = new ListNode((l1.val+add)%10);
        	add = (l1.val+add)/10;
        	tempListNode = tempListNode.next;
        	l1 = l1.next;
        }
        while (l2!=null) {
        	tempListNode.next = new ListNode((l2.val+add)%10);
        	add = (l2.val+add)/10;
        	tempListNode = tempListNode.next;
        	l2 = l2.next;
		}
        if(add!=0){
        	tempListNode.next = new ListNode(add);
        }
        return listNode;
    }
    public static void main(String [] args){
    	
    	Solution solution = new Solution();
    	ListNode l1 = new ListNode(1);
    	l1.next = new ListNode(8);
    	ListNode l2 = new ListNode(0);

    	ListNode tempListNode = solution.addTwoNumbers(l1, l2);
    	while (tempListNode!=null) {
			System.out.println(tempListNode.val);
			tempListNode = tempListNode.next;
		}
    }
}