Commit 282cdc2

committed

添加(1365.有多少小于当前数字的数字.md):增加typescript版本

1 parent b78e750 commit 282cdc2Copy full SHA for 282cdc2

File tree

+40

-0

lines changed

+40

-0

lines changed

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -217,6 +217,46 @@ var smallerNumbersThanCurrent = function(nums) {`
`217`	`217`	`};`
`218`	`218`	```
`219`	`219`
	`220`	`+TypeScript:`
	`221`	`+`
	`222`	`+> 暴力法:`
	`223`	`+`
	`224`	+```typescript
	`225`	`+function smallerNumbersThanCurrent(nums: number[]): number[] {`
	`226`	`+ const length: number = nums.length;`
	`227`	`+ const resArr: number[] = [];`
	`228`	`+ for (let i = 0; i < length; i++) {`
	`229`	`+ let count: number = 0;`
	`230`	`+ for (let j = 0; j < length; j++) {`
	`231`	`+ if (nums[j] < nums[i]) {`
	`232`	`+ count++;`
	`233`	`+ }`
	`234`	`+ }`
	`235`	`+ resArr[i] = count;`
	`236`	`+ }`
	`237`	`+ return resArr;`
	`238`	`+};`
	`239`	+```
	`240`	`+`
	`241`	`+> 排序+hash`
	`242`	`+`
	`243`	+```typescript
	`244`	`+function smallerNumbersThanCurrent(nums: number[]): number[] {`
	`245`	`+ const length: number = nums.length;`
	`246`	`+ const sortedArr: number[] = [...nums];`
	`247`	`+ sortedArr.sort((a, b) => a - b);`
	`248`	`+ const hashMap: Map<number, number> = new Map();`
	`249`	`+ for (let i = length - 1; i >= 0; i--) {`
	`250`	`+ hashMap.set(sortedArr[i], i);`
	`251`	`+ }`
	`252`	`+ const resArr: number[] = [];`
	`253`	`+ for (let i = 0; i < length; i++) {`
	`254`	`+ resArr[i] = hashMap.get(nums[i]);`
	`255`	`+ }`
	`256`	`+ return resArr;`
	`257`	`+};`
	`258`	+```
	`259`	`+`
`220`	`260`
`221`	`261`
`222`	`262`	`-----------------------`

Comments

(0)