三天一题-14-Add Two Numbers

题目地址：leetcode-Median of Two Sorted Arrays

描述：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.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.

public class AddTwoNumbers {
    static class ListNode {
        int val;
        ListNode next;

        public ListNode(int val) {
            this.val = val;
        }
    }

    public static ListNode addTwoNumbers(ListNode one, ListNode two) {
        if (two == null && one==null) {
            return one;
        }
        int twoVal = two == null ? 0 : two.val;
        int val = one.val + twoVal;
        if (one.next == null) {
            one.next = new ListNode(0);
        }
        if (val > 9) {
            one.val = val % 10;
            one.next.val++;
        }else{
            one.val=val;
        }
        return addTwoNumbers(one.next.val==0?one.next=null:one.next, two==null?null:two.next);
    }

    public static void main(String[] args) {
        //67+983
        ListNode oneList = new ListNode(6);
        oneList.next = new ListNode(7);
        ListNode twoList = new ListNode(9);
        ListNode node = new ListNode(8);
        twoList.next = node;
        node.next = new ListNode(3);
        addTwoNumbers(oneList, twoList);
        while (oneList != null) {
            System.out.println(oneList.val);
            oneList = oneList.next;
        }
    }
}