LeetCode445 Add Two Numbers II

题目：

       You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.

       Follow up:
       What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

       Example:

       Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)

       Output: 7 -> 8 -> 0 -> 7

public class AddTwoNumbersII {
    public static class ListNode {
        int val;
        ListNode next;
        ListNode(int x) {
            val = x;
        }
    }

    public  ListNode addTwoNumbers(ListNode l1, ListNode l2) {

        l1 =reverseList(l1);
        l2 = reverseList(l2);
        ListNode p = l1, q = l2, cur = null;


        int carry = 0;
        while (p != null || q != null){
            int x = (p != null) ? p.val : 0;
            int y = (q != null) ? q.val : 0;

            int sum = carry + x + y;
            carry = sum / 10;

            ListNode node = new ListNode(sum % 10);
            node.next = cur;
            cur = node;

            if (p != null) p = p.next;
            if (q != null) q = q.next;
        }

        if (carry > 0){
            ListNode node = new ListNode(carry);
            node.next = cur;
            cur = node;
        }

        return cur;

    }

    private ListNode reverseList(ListNode head){
        ListNode pre = null;
        ListNode cur = head;
        while(cur != null) {
            ListNode next = cur.next;
            cur.next = pre;
            pre = cur;
            cur = next;
        }
        return pre;
    }

    public static ListNode createLinkedList(int arr[], int n){
        if (n == 0)
            return null;
        ListNode head = new ListNode(arr[0]);
        ListNode cur = head;
        for (int i = 1; i < n; i++) {
            cur.next = new ListNode(arr[i]);
            cur = cur.next;
        }

        return head;
    }

    public static void printLinkedList(ListNode head){
        ListNode cur = head;
        while (cur != null){
            System.out.print(cur.val + " -> ");
            cur = cur.next;
        }
        System.out.println("NULL");
    }

    public static void main(String[] args) {
        int[] num1 = {7, 2, 4, 3};
        int[] num2 = {5, 6, 4};
        ListNode l1 = createLinkedList(num1, num1.length);
        ListNode l2 = createLinkedList(num2, num2.length);
        printLinkedList(new AddTwoNumbersII().addTwoNumbers(l1, l2));
    }
}