2两数相加

LeetCode:

https://leetcode-cn.com/problems/add-two-numbers/

两数相加

给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。

如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例：

输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出：7 -> 0 -> 8
原因：342 + 465 = 807

package com.example.myapp;

import com.example.myapp.node.ListNode;

import org.junit.Assert;
import org.junit.Test;

/**
 * Created by mike.
 * Created on 2020/3/20.
 */
public class LeetCode_3_20_TwoNumberPlus {
    @Test
    public void Test() {
        ListNode _342_ = new ListNode(2);
        _342_.next = new ListNode(4);
        _342_.next.next = new ListNode(3);

        ListNode _465_ = new ListNode(5);
        _465_.next = new ListNode(6);
        _465_.next.next = new ListNode(4);

        ListNode result = twoNumPlus(_342_, _465_);
        Assert.assertEquals(7, result.val);
        Assert.assertEquals(0, result.next.val);
        Assert.assertEquals(8, result.next.next.val);

        ListNode listNode = twoNumPlus(new ListNode(5), new ListNode(5));
        Assert.assertEquals(0, listNode.val);
        Assert.assertEquals(1, listNode.next.val);

        ListNode _98_ = new ListNode(9);
        _98_.next = new ListNode(8);

        ListNode _1_ = new ListNode(1);
        ListNode listNode1 = twoNumPlus(_98_, _1_);
        Assert.assertEquals(0, listNode1.val);
        Assert.assertEquals(9, listNode1.next.val);

    }

    private ListNode twoNumPlus(ListNode l1, ListNode l2) {
        ListNode temp = null;
        ListNode result = null;

        boolean flag = false;

        while (l1 != null && l2 != null){
            int cur = l1.val + l2.val + (flag ? 1 : 0);
            flag = cur >= 10;
            ListNode node = new ListNode(flag ? cur % 10 : cur);
            if(temp == null){
                temp = node;
                result = temp;
            }else {
                temp.next = node;
                temp = temp.next;
            }
            l1 = l1.next;
            l2 = l2.next;
        }
        while (l1 != null){
            int cur = l1.val + (flag ? 1 : 0);
            flag = cur >= 10;
            ListNode node = new ListNode(flag ? cur % 10 : cur);
            if(temp == null){
                temp = node;
                result = temp;
            }else {
                temp.next = node;
                temp = temp.next;
            }
            l1 = l1.next;
        }

        while (l2 != null){
            int cur = l2.val + (flag ? 1 : 0);
            flag = cur >= 10;
            ListNode node = new ListNode(flag ? cur % 10 : cur);
            if(temp == null){
                temp = node;
                result = temp;
            }else {
                temp.next = node;
                temp = temp.next;
            }
            l2 = l2.next;
        }

        if(flag){
            temp.next = new ListNode(1);
        }

        return result;
    }

}

 

package com.example.myapp.node;

/**
 * Created by mike.
 * Created on 2020/3/20.
 */
public class ListNode {
    public int val;
    public ListNode next;

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