Commit 14eb301

committed

feat: add typescript solution to lc problem: No.2012.Sum of Beauty in the Array

1 parent 480025a commit 14eb301Copy full SHA for 14eb301

File tree

+67

-0

lines changed

+67

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -74,6 +74,30 @@`
`74`	`74`
`75`	`75`	```
`76`	`76`
	`77`	`+### **TypeScript`
	`78`	`+`
	`79`	+```ts
	`80`	`+function sumOfBeauties(nums: number[]): number {`
	`81`	`+ let n = nums.length;`
	`82`	`+ let prefix = new Array(n), postfix = new Array(n);`
	`83`	`+ prefix[0] = nums[0];`
	`84`	`+ postfix[n - 1] = nums[n - 1];`
	`85`	`+ for (let i = 1, j = n - 2; i < n; ++i, --j) {`
	`86`	`+ prefix[i] = Math.max(nums[i], prefix[i - 1]);`
	`87`	`+ postfix[j] = Math.min(nums[j], postfix[j + 1]);`
	`88`	`+ }`
	`89`	`+ let ans = 0;`
	`90`	`+ for (let i = 1; i < n - 1; ++i) {`
	`91`	`+ if (prefix[i - 1] < nums[i] && nums[i] < postfix[i + 1]) {`
	`92`	`+ ans += 2;`
	`93`	`+ } else if (nums[i - 1] < nums[i] && nums[i] < nums[i + 1]) {`
	`94`	`+ ans += 1;`
	`95`	`+ }`
	`96`	`+ }`
	`97`	`+ return ans;`
	`98`	`+};`
	`99`	+```
	`100`	`+`
`77`	`101`	`### ...`
`78`	`102`
`79`	`103`	```

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -67,6 +67,30 @@`
`67`	`67`
`68`	`68`	```
`69`	`69`
	`70`	`+### TypeScript`
	`71`	`+`
	`72`	+```ts
	`73`	`+function sumOfBeauties(nums: number[]): number {`
	`74`	`+ let n = nums.length;`
	`75`	`+ let prefix = new Array(n), postfix = new Array(n);`
	`76`	`+ prefix[0] = nums[0];`
	`77`	`+ postfix[n - 1] = nums[n - 1];`
	`78`	`+ for (let i = 1, j = n - 2; i < n; ++i, --j) {`
	`79`	`+ prefix[i] = Math.max(nums[i], prefix[i - 1]);`
	`80`	`+ postfix[j] = Math.min(nums[j], postfix[j + 1]);`
	`81`	`+ }`
	`82`	`+ let ans = 0;`
	`83`	`+ for (let i = 1; i < n - 1; ++i) {`
	`84`	`+ if (prefix[i - 1] < nums[i] && nums[i] < postfix[i + 1]) {`
	`85`	`+ ans += 2;`
	`86`	`+ } else if (nums[i - 1] < nums[i] && nums[i] < nums[i + 1]) {`
	`87`	`+ ans += 1;`
	`88`	`+ }`
	`89`	`+ }`
	`90`	`+ return ans;`
	`91`	`+};`
	`92`	+```
	`93`	`+`
`70`	`94`	`### ...`
`71`	`95`
`72`	`96`	```

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+function sumOfBeauties(nums: number[]): number {`
	`2`	`+ let n = nums.length;`
	`3`	`+ let prefix = new Array(n), postfix = new Array(n);`
	`4`	`+ prefix[0] = nums[0];`
	`5`	`+ postfix[n - 1] = nums[n - 1];`
	`6`	`+ for (let i = 1, j = n - 2; i < n; ++i, --j) {`
	`7`	`+ prefix[i] = Math.max(nums[i], prefix[i - 1]);`
	`8`	`+ postfix[j] = Math.min(nums[j], postfix[j + 1]);`
	`9`	`+ }`
	`10`	`+ let ans = 0;`
	`11`	`+ for (let i = 1; i < n - 1; ++i) {`
	`12`	`+ if (prefix[i - 1] < nums[i] && nums[i] < postfix[i + 1]) {`
	`13`	`+ ans += 2;`
	`14`	`+ } else if (nums[i - 1] < nums[i] && nums[i] < nums[i + 1]) {`
	`15`	`+ ans += 1;`
	`16`	`+ }`
	`17`	`+ }`
	`18`	`+ return ans;`
	`19`	`+};`

Comments

(0)