【小熊刷题】Add Two Numbers in Linked Lists

String和number的未解锁的题先放一放,开始linked list.

Question

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contains 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

*Difficulty: Medium, Frequency: High

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

My Solution

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode dummyHead = new ListNode(0);
        ListNode R = dummyHead;
        int carryOn = 0;
        while(l1 != null || l2 != null || carryOn == 1){
            int l1v = (l1!=null) ? l1.val : 0 ;
            int l2v = (l2!=null) ? l2.val : 0 ;
            int sum = l1v + l2v + carryOn;
            if(sum >= 10){
                sum = sum - 10;
                carryOn = 1;
            }else carryOn = 0;
            ListNode sumNode = new ListNode(sum);
            R.next = sumNode;
            if(l1!=null) l1 = l1.next;
            if(l2!=null) l2 = l2.next;
            R = R.next;
        }
        return dummyHead.next;
    }
}

comments

carryOn 是两个data structure相加通常的edge cases e.g.【9,9,9】+【1】=【0,0,0,1】

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值