algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: Update 1365，建议不使用built-in func作为var name

Browse Source 
题解中使用`hash`作为变量名，而hash本身也是python3的built-in函数，故建议更改变量名
This commit is contained in:
Yuan Yuan
2024-12-04 12:33:40 -06:00
committed by GitHub
parent 5b94b44864
commit 14223a2fa6
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/1365.有多少小于当前数字的数字.md
View File

@ -144,13 +144,13 @@ public int[] smallerNumbersThanCurrent(int[] nums) {
class Solution: class Solution:
def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]: def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
res = nums[:] res = nums[:]
hash = dict() hash_dict = dict()
res.sort() # 从小到大排序之后，元素下标就是小于当前数字的数字 res.sort() # 从小到大排序之后，元素下标就是小于当前数字的数字
for i, num in enumerate(res): for i, num in enumerate(res):
if num not in hash.keys(): # 遇到了相同的数字，那么不需要更新该 number 的情况 if num not in hash_dict.keys(): # 遇到了相同的数字，那么不需要更新该 number 的情况
hash[num] = i hash_dict[num] = i
for i, num in enumerate(nums): for i, num in enumerate(nums):
res[i] = hash[num] res[i] = hash_dict[num]
return res return res
``` ```