LeetCode-2.Add Two Numbers

https://leetcode.com/problems/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

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */

public ListNode AddTwoNumbers(ListNode l1, ListNode l2)
    {
        int v;
        ListNode result = new ListNode(0);
        var nextNode = result;
        while (l1 != null || l2 != null)
        {
            v = nextNode.val;
            if (l1 != null)
            {
                v += l1.val;
                l1 = l1.next;
            }
            if (l2 != null)
            {
                v += l2.val;
                l2 = l2.next;
            }
            nextNode.val = v % 10;
            if (l1 != null || l2 != null || v/10!=0)
            {
                nextNode.next = new ListNode(v / 10);
                nextNode = nextNode.next;
            }
        }
        return result;
    }


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值