leecode 2

最新推荐文章于 2022-07-19 19:43:58 发布

xiayu98020214

最新推荐文章于 2022-07-19 19:43:58 发布

阅读量515

点赞数

分类专栏： leetcode java

本文链接：https://blog.csdn.net/xiayu98020214/article/details/45099541

版权

leetcode 同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

java

11 篇文章 0 订阅

订阅专栏

package xiayu;

public class add {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        ListNode l1 = new ListNode(0);
        ListNode l2 = new ListNode(0);
        ListNode l3 = addtwo.addTwoNumbers(l1, l2);
        int i = 6;
    }

}

class addtwo {

    public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {

        ListNode newNode = null;
        ListNode oldNode = null;

        ListNode head = new ListNode(0);
        ListNode current = head;
        int addone = 0;

        int sum;

        while ((l1 != null) || (l2 != null)) {

            sum = 0;
            if (l1 != null) {
                sum = l1.val;
            }

            if (l2 != null) {
                sum += l2.val;

            }

            newNode = new ListNode(sum);
            newNode.val += addone;
            if (newNode.val >= 10) {
                newNode.val -= 10;
                addone = 1;
            } else {
                addone = 0;
            }

            current.next = newNode;
            current = current.next;

            if (l1 != null) {
                l1 = l1.next;
            }
            if (l2 != null) {
                l2 = l2.next;
            }

        }

        if (addone == 1) {
            current.next = new ListNode(1);
        }
        return head.next;

    }
}

class ListNode {
    int val;

    ListNode next;

    ListNode(int x) {
        val = x;
        next = null;
    }
}