Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

[pull] master from youngyangyang04:master #518

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 8 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Dec 30, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 42 additions & 9 deletions problems/1365.有多少小于当前数字的数字.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -115,7 +115,7 @@ public:

## 其他语言版本

### Java:
### Java:

```Java
public int[] smallerNumbersThanCurrent(int[] nums) {
Expand All @@ -138,18 +138,51 @@ public int[] smallerNumbersThanCurrent(int[] nums) {

### Python:

```python
> 暴力法:

```python3
class Solution:
def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
res = [0 for _ in range(len(nums))]
for i in range(len(nums)):
cnt = 0
for j in range(len(nums)):
if j == i:
continue
if nums[i] > nums[j]:
cnt += 1
res[i] = cnt
return res
```

> 排序+hash:

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

# 方法二:使用数组
def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
# 同步进行排序和创建新数组的操作,这样可以减少一次冗余的数组复制操作,以减少一次O(n) 的复制时间开销
sort_nums = sorted(nums)
# 题意中 0 <= nums[i] <= 100,故range的参数设为101
hash_lst = [0 for _ in range(101)]
# 从后向前遍历,这样hash里存放的就是相同元素最左面的数值和下标了
for i in range(len(sort_nums)-1,-1,-1):
hash_lst[sort_nums[i]] = i
for i in range(len(nums)):
nums[i] = hash_lst[nums[i]]
return nums
```

### Go:
Expand Down Expand Up @@ -220,7 +253,7 @@ var smallerNumbersThanCurrent = function(nums) {
};
```

### TypeScript:
### TypeScript:

> 暴力法:

Expand All @@ -241,7 +274,7 @@ function smallerNumbersThanCurrent(nums: number[]): number[] {
};
```

> 排序+hash
> 排序+hash:

```typescript
function smallerNumbersThanCurrent(nums: number[]): number[] {
Expand All @@ -260,7 +293,7 @@ function smallerNumbersThanCurrent(nums: number[]): number[] {
};
```

### rust
### Rust:
```rust
use std::collections::HashMap;
impl Solution {
Expand Down

AltStyle によって変換されたページ (->オリジナル) /