Leetcode Add two numbers

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

[code]

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if(l1==null)return l2;
        if(l2==null)return l1;
        ListNode prev1=new ListNode(-1), prev2=new ListNode(-1), head =l1;
        prev1.next=l1;prev2.next=l2;
        int carry=0, r=0;
        while(l1!=null && l2!=null)
        {
            r=l1.val+l2.val+carry;
            carry=r/10;
            l1.val=r%10;
            l1=l1.next;prev1=prev1.next;
            l2=l2.next;prev2=prev2.next;
        }
        if(l1==null)prev1.next=l2;
        l1=prev1.next;
        while(l1!=null && carry==1)
        {
            r=l1.val+carry;
            carry=r/10;
            l1.val=r%10;
            l1=l1.next;
            prev1=prev1.next;
        }
        if(carry==1)
        {
            prev1.next=new ListNode(1);
        }
        return head;
    }
}

[Thoughts]
dummy+previous

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值