LeetCode：M-2. Add Two Numbers

LeetCode链接

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.

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; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int up=0;
        ListNode t1 = l1;
        ListNode t2 = l2;
        ListNode pre = t1.next==null?t2:t1;
        while(t1!=null && t2!=null){
            int sum = t1.val + t2.val + up;
            t1.val = sum%10;
            t2.val = sum%10;
            up = sum/10;
            
            pre = t1.next==null?t2:t1;
            t1 = t1.next;
            t2 = t2.next;            
        }
        ListNode res = t1==null?l2:l1;        
        while(t1!=null){
            if(up==0){
                return res;
            }
            int sum = t1.val+up;
            t1.val = sum%10;
            up = sum/10;
            
            pre=t1;
            t1 = t1.next;
        }
        while(t2!=null){
            if(up==0){
                return res;
            }
            int sum = t2.val+up;
            t2.val = sum%10;
            up = sum/10;
            
            pre=t2;
            t2 = t2.next;
        }
        if(up!=0){
            ListNode node = new ListNode(up);
            if(res==l1)
                pre.next=node;
            else
                pre.next=node;
        }
        
        return res;
    }
}