leetcode 2. 两数相加

题目描述:

思路:

$$模拟链表,注意进位$$

代码:

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

    	//链表常用书写模版 
    	//创建链表result,使用head节点模拟 
        ListNode result = new ListNode(0); 
        ListNode head = result; 
        
        int carry = 0; 
        
        while(l1 != null || l2 != null) { 
            int v1 = l1 != null ? l1.val : 0; 
            int v2 = l2 != null ? l2.val : 0; 

            int sum = v1 + v2 + carry; 
			
            head.next = new ListNode(sum % 10); 

            carry = sum / 10; 

            if(l1 != null) { 
                l1 = l1.next; 
            }
            
            if(l2 != null) { 
                l2 = l2.next; 
            }
            
            head = head.next; 
        }
		
		//特判有无进位 
        head.next = carry != 0 ? new ListNode(carry) : null; 

        return result.next; 
    }
}