LeetCode——Add Two Numbers

** 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.

• Example:
  Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
  Output: 7 -> 0 -> 8
  Explanation: 342 + 465 = 807.

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode res=new ListNode(-1);
        ListNode cur=res;
        int carry=0;
        while(l1!=null||l2!=null)
        {
        	int p=l1==null?0:l1.val;
        	int q=l2==null?0:l2.val;
        	cur.next=new ListNode((p+q+carry)%10);
        	carry=(p+q+carry)/10;
        	l1=l1==null?l1:l1.next;
        	l2=l2==null?l2:l2.next;
        	cur=cur.next;
        }
        cur.next=carry==1?new ListNode(1):null;
        return res.next;
    }

Runtime: 20 ms, faster than 98.89% of Java online submissions for Add Two Numbers.
Memory Usage: 48.2 MB, less than 20.09% of Java online submissions for Add Two Numbers.