【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

对链表的考察，同时遍历两个链表，同时用一个变量记录是否有进位。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int carry = 0;
        ListNode result = new ListNode(0);
        ListNode ptr = result;
        while(l1!=null || l2!= null)
        {
            int val1 = 0;
            if(l1!=null)
            {
                val1 = l1.val;
                l1 = l1.next;
            }
            
            int val2 = 0;
            if(l2!=null)
            {
                val2 = l2.val;
                l2 = l2.next;
            }
            int sum = val1 + val2 + carry; 
            carry = sum/10;
            ptr.next = new ListNode(sum % 10);
            ptr = ptr.next;
            
        }
        if(carry == 1) ptr.next = new ListNode(1);
        
        return result.next;
       
}
}