LeetCode 2. Add Two Numbers -Java

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 contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example 1:

Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

Constraints:

The number of nodes in each linked list is in the range [1, 100].
0 <= Node.val <= 9
It is guaranteed that the list represents a number that does not have leading zeros.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode l3 = new ListNode(0, null);
    	int carry = 0;	//	carry是进位
        int val1 = 0, val2 = 0;
    	ListNode l1_ptr = l1, l2_ptr = l2, l3_ptr = l3;	//	ptr 指向当前结点
    	ListNode l3_ptr_pre = null;	//	l3_ptr_pre 指向当前3号结点的前一个结点
    	while(l1_ptr != null || l2_ptr != null) {
    		val1 = (l1_ptr == null) ? 0 : l1_ptr.val;
    		
    		val2 = (l2_ptr == null) ? 0 : l2_ptr.val;
            
    		l3_ptr.val = (val1 + val2 + carry) % 10;
    		
    		carry = (val1 + val2 + carry) / 10;
    		
    		if(l1_ptr != null) {
    			l1_ptr = l1_ptr.next;
    		}
    		
    		if(l2_ptr != null) {
    			l2_ptr = l2_ptr.next;
    		}

    		l3_ptr_pre = l3_ptr;
    		l3_ptr.next = new ListNode(0, null);
    		
    		l3_ptr = l3_ptr.next;
    	}
        if(carry > 0){
            l3_ptr.val = carry;
        }
		
    	if(l3_ptr.val == 0 && l3_ptr != l3) {
			l3_ptr_pre.next = null;	//	若非零整数的最高位为零，则丢弃这个val为零的结点
		}
    	
    	return l3;
    }
}