求两个整数之和(链表）

笔试题：求两个整数之和(链表）

给你两个 非空 的链表，表示两个非负的整数。每个节点只能存储 一位 数字，最开始的是个位数，然后是十位数，然后是千位数…

请你将两个数相加，并以相同形式返回一个表示和的链表。

public class TwoIntergerSum {

    public static class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

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

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }


    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode head = null;
        ListNode pointer = null;
        int p1 = 0;

        while (l1 != null || l2 != null) {
            int left = l1 == null ? 0 : l1.val;
            int right = l2 == null ? 0 : l2.val;

            int sum = left + right + p1;
            int p0 = sum % 10;
            p1 = sum / 10;

            ListNode p = new ListNode();
            p.val = p0;

            if (head == null) {
                head = p;
                pointer = p;
            } else {
                pointer.next = p;
                pointer = p;
            }
            l1 = l1 == null ? null : l1.next;
            l2 = l2 == null ? null : l2.next;
        }

        if (p1 > 0) {
            ListNode p = new ListNode();
            p.val = p1;
            pointer.next = p;
        }
        return head;
    }


    public static void main(String[] args) {
        ListNode l1 = new ListNode(9);
        ListNode l2 = new ListNode(9);
        ListNode l3 = new ListNode(7);

        l1.next = l2;
        l2.next = l3;


        ListNode l4 = new ListNode(3);
        ListNode l5 = new ListNode(9);

        l4.next = l5;


        ListNode lr = new TwoIntergerSum().addTwoNumbers(l1, l4);

        ListNode p = lr;

        while (p != null) {
            System.out.print(p.val);
            p = p.next;
        }


    }
}