当前位置：网站首页>Add two numbers of leetcode

Add two numbers of leetcode

2022-07-02 20:35:00 【wx58c8fa5d0b356】

List of articles

LeetCode Add two numbers

Title Description

Example

Problem solving

Code
leetcode Exhibition

LeetCode Add two numbers

Title Description

Two are given. Non empty The list of is used to represent two non negative integers . among , Their respective digits are based on The reverse Stored in , And each of their nodes can only store a Numbers .

If , Let's add the two numbers together , A new list will be returned to represent their sum .

You can assume that in addition to the numbers 0 outside , Neither of these numbers 0 start .

Example

Input ：(2 -> 4 -> 3) + (5 -> 6 -> 4)

Output ：7 -> 0 -> 8

reason ：342 + 465 = 807

Problem solving

Code

       
        /**
        
 * @program: algorithm_code
        
 * @description:  Algorithm problem 2
        
 * @author: YangHang
        
 * @create: 2019-08-25 21:57
        
 **/
        

        
public class Num2_AddTwoNumbers {
        

        
    public static void main(String[] args) {
        
        //  Assembly data 
        
        ListNode list11 = new ListNode(9);
        
        ListNode list12 = new ListNode(9);
        
        list11.next = list12;
        

        
        ListNode list21 = new ListNode(9);
        
        printLinkedList(addTwoNumbers(list11, list21));
        

        
    }
        

        
    public static ListNode addTwoNumbers(ListNode list11, ListNode list21) {
        

        
        ListNode temp1 = list11;
        
        ListNode temp2 = list21;
        

        
        //  Carry or not 
        
        boolean flag = false;
        

        
        ListNode result = new ListNode(-1);
        
        ListNode temp = result;
        
        while (temp1 != null || temp2 != null) {
        
            int num1 = 0;
        
            int num2 = 0;
        
            if (temp1 != null) {
        
                num1 = temp1.val;
        
            }
        
            if (temp2 != null) {
        
                num2 = temp2.val;
        
            }
        

        
            if (flag) {
        
                if (num1 + num2 + 1 >= 10) {
        
                    temp.next = new ListNode(num1 + num2 + 1 - 10);
        
                    flag = true;
        
                } else {
        
                    temp.next = new ListNode(num1 + num2 + 1);
        
                    flag = false;
        
                }
        
            } else {
        
                if (num1 + num2 >= 10) {
        
                    temp.next = new ListNode(num1 + num2 - 10);
        
                    flag = true;
        
                } else {
        
                    temp.next = new ListNode(num1 + num2);
        
                    flag = false;
        
                }
        
            }
        
            temp = temp.next;
        
            if (temp1 != null) {
        
                temp1 = temp1.next;
        
            }
        
            if (temp2 != null) {
        
                temp2 = temp2.next;
        
            }
        
        }
        

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

        
    public static void printLinkedList(ListNode listNode) {
        

        
        ListNode temp = listNode;
        

        
        while (temp != null) {
        
            System.out.print(temp.val + " ");
        
            temp = temp.next;
        
        }
        
        System.out.println();
        
    }
        
}
        

        
//  List class 
        
class ListNode {
        
    int val;
        
    ListNode next;
        

        
    ListNode(int x) {
        
        val = x;
        
    }
        
}
       
       
        1.
        2.
        3.
        4.
        5.
        6.
        7.
        8.
        9.
        10.
        11.
        12.
        13.
        14.
        15.
        16.
        17.
        18.
        19.
        20.
        21.
        22.
        23.
        24.
        25.
        26.
        27.
        28.
        29.
        30.
        31.
        32.
        33.
        34.
        35.
        36.
        37.
        38.
        39.
        40.
        41.
        42.
        43.
        44.
        45.
        46.
        47.
        48.
        49.
        50.
        51.
        52.
        53.
        54.
        55.
        56.
        57.
        58.
        59.
        60.
        61.
        62.
        63.
        64.
        65.
        66.
        67.
        68.
        69.
        70.
        71.
        72.
        73.
        74.
        75.
        76.
        77.
        78.
        79.
        80.
        81.
        82.
        83.
        84.
        85.
        86.
        87.
        88.
        89.
        90.
        91.
        92.
        93.