Add Two Numbers

Add two nums

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; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode res = new ListNode(10);
        ListNode temp = res;
        int flag = 0;
        int sum;
        while(l1!=null&&l2!=null){
            sum = l1.val+l2.val+flag;
            if(sum>=10){
                flag = 1;
            }else
                flag = 0;


            res.next = new ListNode(sum%10);
            res = res.next;
            l1 = l1.next;
            l2 = l2.next;

        }
            if(l1==null&&l2==null&&flag==1){

            res.next = new ListNode(1);
        }
        while(l1==null&&l2!=null){
            sum = l2.val+flag;
            if(sum>=10)
                flag = 1;
            else
                flag = 0;
            res.next = new ListNode(sum%10);
            res = res.next;
            l2 = l2.next;
        }
        while(l2==null&&l1!=null){
            sum = l1.val+flag;
            if(sum>=10)
                flag = 1;
            else
                flag = 0;
            res.next = new ListNode(sum%10);
            res = res.next;
            l1 = l1.next;
        }

    if(flag==1){

            res.next = new ListNode(1);
        }

        return temp.next;
    }
}

改进后：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode res = new ListNode(10);
        ListNode temp = res;
        int flag = 0;
        int sum;
    while(l1!=null||l2!=null){
            if(l1==null)
                sum = 0+l2.val+flag;
            else if(l2==null)
                sum = l1.val+flag;
            else
                sum = l1.val+l2.val+flag;
            if(sum>=10){
                flag = 1;
            }else
                flag = 0;



            res.next = new ListNode(sum%10);
            res = res.next;
            if(l1==null)
                l2 = l2.next;
            else if(l2==null)
                l1 = l1.next;
            else{
            l1 = l1.next;
            l2 = l2.next;
            }

        }

    if(flag==1){

            res.next = new ListNode(1);
        }

        return temp.next;
    }
}