leetcode 1365. How Many Numbers Are Smaller Than the Current Number（python）

描述

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j’s such that j != i and nums[j] < nums[i].

Return the answer in an array.

Example 1:

Input: nums = [8,1,2,2,3]
Output: [4,0,1,1,3]
Explanation:
For nums[0]=8 there exist four smaller numbers than it (1, 2, 2 and 3).
For nums[1]=1 does not exist any smaller number than it.
For nums[2]=2 there exist one smaller number than it (1).
For nums[3]=2 there exist one smaller number than it (1).
For nums[4]=3 there exist three smaller numbers than it (1, 2 and 2).

Example 2:

Input: nums = [6,5,4,8]
Output: [2,1,0,3]

Example 3:

Input: nums = [7,7,7,7]
Output: [0,0,0,0]

Note:

2 <= nums.length <= 500
0 <= nums[i] <= 100

解析

根据题意，只需要在 nums 中找出每个元素的比其小的元素的个数，然后组成列表即可。所以将 nums 升序排序为 tmp ，然后在遍历 nums 的时候只需要定位每个元素在 tmp 中第一次出现的索引追加到 res 中，遍历结束将得到的答案。

解答

class Solution(object):def smallerNumbersThanCurrent(self, nums):""":type nums: List[int]:rtype: List[int]"""tmp = sorted(nums)res = []for i in nums:res.append(tmp.index(i))return res

运行结果

Runtime: 48 ms, faster than 74.62% of Python online submissions for How Many Numbers Are Smaller Than the Current Number.
Memory Usage: 13.5 MB, less than 37.19% of Python online submissions for How Many Numbers Are Smaller Than the Current Number.

原题链接：https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/

leetcode 1365. How Many Numbers Are Smaller Than the Current Number（python）相关推荐

1365. How Many Numbers Are Smaller Than the Current Number 有多少小于当前数字的数字
给你一个数组 nums,对于其中每个元素 nums[i],请你统计数组中比它小的所有数字的数目. 换而言之,对于每个 nums[i] 你必须计算出有效的 j 的数量,其中 j 满足 j != i 且 ...
40 How Many Numbers Are Smaller Than the Current Number
题目 Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it ...
Leetcode 17. Letter Combinations of a Phone Number（python）
笨方法回溯啦 class Solution(object):def letterCombinations(self, digits):""":type digits: s ...
【LeetCode】91. Decode Ways 解题报告（Python）
[LeetCode]91. Decode Ways 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fux ...
【Leetcode】刷题之路1（python）
leetcode 刷题之路1(python) 看到有大佬总结了一些相关题目,想着先刷一类. 1.两数之和 15.三数之和 16.最接近的三数之和 11.盛最多的水 18.四数之和 454.四数相加II ...
[LeetCode]题解（python）：150-Evaluate Reverse Polish Notation
题目来源: https://leetcode.com/problems/evaluate-reverse-polish-notation/ 题意分析: 给定一个数组,用这个数组来表示加减乘除,例如 [ ...
[LeetCode]题解（python）：108-Convert Sorted Array to Binary Search Tree
题目来源: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ 题意分析: 给出一个排好序的数组,根据这 ...
[LeetCode]题解（python）：019-Remove Nth Node From End of List
题目来源: https://leetcode.com/problems/remove-nth-node-from-end-of-list/ 题意分析: 这道题是给定一个链表,删除倒数第n个节点.提醒, ...
[LeetCode]题解（python）：153-Find Minimum in Rotated Sorted Array
题目来源: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ 题意分析: 在一个不重复的翻转的数组里面找到最小那个 ...

leetcode 1365. How Many Numbers Are Smaller Than the Current Number（python）

描述

解析

解答

运行结果

leetcode 1365. How Many Numbers Are Smaller Than the Current Number（python）相关推荐

最新文章

热门文章