前往小程序,Get更优阅读体验!
立即前往
发布
社区首页 >专栏 >Leetcode 1365. How Many Numbers Are Smaller Than the Current Number

Leetcode 1365. How Many Numbers Are Smaller Than the Current Number

作者头像
Tyan
发布2021-07-08 16:22:47
发布2021-07-08 16:22:47
30800
代码可运行
举报
文章被收录于专栏:SnailTyanSnailTyan
运行总次数:0
代码可运行

文章作者:Tyan 博客:noahsnail.com | CSDN | 简书

1. Description

2. Solution

**解析:**Version 1是两两比较所有的数,简单直接。Version 2,由于所有的数都在[0, 100]之间,因此统计[0,100]之间的数字个数即可,比98小的数是[0,97]之间数字的个数之和。Version 3是Version 2的通用版,不用限制数字的大小。Version 4是进一步优化,只统计出现的数字数量。

  • Version 1
代码语言:javascript
代码运行次数:0
复制
class Solution:
    def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
        n = len(nums)
        result = [0 for _ in range(n)]
        for i in range(n):
            for j in range(i+1, n):
                if nums[i] > nums[j]:
                    result[i] += 1
                elif nums[i] < nums[j]:
                    result[j] += 1
        return result
  • Version 2
代码语言:javascript
代码运行次数:0
复制
class Solution:
    def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
        stat = {i: 0 for i in range(101)}
        for num in nums:
            stat[num] = stat.get(num, 0) + 1

        count = 0
        for i in range(101):
            pre = count
            count += stat[i]
            stat[i] = pre

        result = [stat[num] for num in nums]
        return result
  • Version 3
代码语言:javascript
代码运行次数:0
复制
class Solution:
    def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
        maximun = max(nums)
        stat = {i: 0 for i in range(maximun+1)}
        for num in nums:
            stat[num] = stat.get(num, 0) + 1

        count = 0
        for i in range(maximun+1):
            pre = count
            count += stat[i]
            stat[i] = pre

        result = [stat[num] for num in nums]
        return result
  • Version 4
代码语言:javascript
代码运行次数:0
复制
class Solution:
    def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
        order = sorted(set(nums))
        stat = {num: 0 for num in order}
        for num in nums:
            stat[num] = stat.get(num, 0) + 1

        count = 0
        for num in order:
            pre = count
            count += stat[num]
            stat[num] = pre

        result = [stat[num] for num in nums]
        return result

Reference

  1. https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2021/07/02 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. Description
  • 2. Solution
  • Reference
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档