mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
添加(1365.有多少小于当前数字的数字.md):增加typescript版本
This commit is contained in:
@ -217,6 +217,46 @@ var smallerNumbersThanCurrent = function(nums) {
|
||||
};
|
||||
```
|
||||
|
||||
TypeScript:
|
||||
|
||||
> 暴力法:
|
||||
|
||||
```typescript
|
||||
function smallerNumbersThanCurrent(nums: number[]): number[] {
|
||||
const length: number = nums.length;
|
||||
const resArr: number[] = [];
|
||||
for (let i = 0; i < length; i++) {
|
||||
let count: number = 0;
|
||||
for (let j = 0; j < length; j++) {
|
||||
if (nums[j] < nums[i]) {
|
||||
count++;
|
||||
}
|
||||
}
|
||||
resArr[i] = count;
|
||||
}
|
||||
return resArr;
|
||||
};
|
||||
```
|
||||
|
||||
> 排序+hash
|
||||
|
||||
```typescript
|
||||
function smallerNumbersThanCurrent(nums: number[]): number[] {
|
||||
const length: number = nums.length;
|
||||
const sortedArr: number[] = [...nums];
|
||||
sortedArr.sort((a, b) => a - b);
|
||||
const hashMap: Map<number, number> = new Map();
|
||||
for (let i = length - 1; i >= 0; i--) {
|
||||
hashMap.set(sortedArr[i], i);
|
||||
}
|
||||
const resArr: number[] = [];
|
||||
for (let i = 0; i < length; i++) {
|
||||
resArr[i] = hashMap.get(nums[i]);
|
||||
}
|
||||
return resArr;
|
||||
};
|
||||
```
|
||||
|
||||
|
||||
|
||||
-----------------------
|
||||
|
Reference in New Issue
Block a user