LeetCode 2. Add Two Numbers

最新推荐文章于 2024-01-03 15:29:28 发布

ov大鱼vo

最新推荐文章于 2024-01-03 15:29:28 发布

阅读量128

点赞数

分类专栏： LeetCode Java

本文链接：https://blog.csdn.net/flowingfog/article/details/88929285

版权

LeetCode 同时被 2 个专栏收录

77 篇文章 0 订阅

订阅专栏

Java

24 篇文章 0 订阅

订阅专栏

分析

难度中
来源 https://leetcode.com/problems/add-two-numbers/

题目

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order 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.
Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.

解答

Runtime: 2 ms, faster than 99.15% of Java online submissions for Add Two Numbers.
Memory Usage: 40.9 MB, less than 73.09% of Java online submissions for Add Two Numbers.
package LeetCode;

import java.util.Iterator;

public class L2_AddTwoNumbers {
    public ListNode String2List(String num){//链表的头是数字低位
        ListNode ln=new ListNode(-1);
        ListNode pointer=ln;
        for(int i=num.length()-1;i>=0;i--){
            pointer.next=new ListNode(Integer.valueOf(num.charAt(i)-'0'));
            pointer=pointer.next;
        }
        return ln.next;
    }
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int carry=0,temp=0;
        ListNode presum=new ListNode(-1);
        ListNode pointer=presum;
        while(l1!=null||l2!=null){
            temp=carry;//carry为上一步的进位
            if(l1!=null) {
                temp += l1.val;
                l1=l1.next;
            }
            if(l2!=null){
                temp+=l2.val;
                l2=l2.next;
            }
            carry=temp/10;//当前步产生的进位
            pointer.next=new ListNode(temp%10);
            pointer=pointer.next;
        }
        if(carry!=0)
            pointer.next=new ListNode(carry);
        return presum.next;
    }

    public static void main(String[] args){
        //int num1=342,num2=465;
        String num1="9";
        String num2="9999999991";
        L2_AddTwoNumbers l2=new L2_AddTwoNumbers();
        ListNode ln1=l2.String2List(num1);
        ListNode.printList(ln1);
        ListNode ln2=l2.String2List(num2);
        ListNode.printList(ln2);
        ListNode.printList(l2.addTwoNumbers(ln1,ln2));
    }
}