leetcode 002 Add Two Numbers(java)

leetcode 002 Add Two Numbers

Add Two Numbers

My Submissions
Total Accepted: 105768 Total Submissions: 494750 Difficulty: Medium

 

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

题意:用链表实现两个数的相加。

java 毫不熟悉呀 我要加油了,cxq!


public class Solution {
    public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode l3 = new ListNode(-1);
        ListNode l3head=l3;
        if(l1==null)
            return l2;
        if(l2==null)
            return l1;
        int carry=0;
        
        while(l1!=null||l2!=null){
            if(l1!=null){
                carry +=l1.val;
                l1=l1.next;
            }
            if(l2!=null){
                carry += l2.val;
                l2=l2.next;
            }
            
            l3.next=new ListNode(carry%10);
            carry=carry/10;
            l3=l3.next;
            
        }
        
        if(carry==1){
            l3.next=new ListNode(1);
        }
        return l3head.next;
    }
    
    public static void main(String[] args) {
        ListNode l1=new ListNode(2);
        l1.next=new ListNode(4);
        l1.next.next=new ListNode(3);
        ListNode l2=new ListNode(5);
        l2.next=new ListNode(6);
        l2.next.next=new ListNode(4);
        ListNode anwer=addTwoNumbers(l1,l2);
        System.out.println(anwer.val+" "+anwer.next.val+" "+anwer.next.next.val);
        
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值