Commit d8214e4

committed

feat: add typescript solution to lc problem: No.0300.Longest Increasing Subsequence

1 parent d9f7995 commit d8214e4Copy full SHA for d8214e4

File tree

+46

-0

lines changed

+46

-0

lines changed

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -107,6 +107,23 @@ class Solution {`
`107`	`107`	`}`
`108`	`108`	```
`109`	`109`
	`110`	`+### TypeScript`
	`111`	`+`
	`112`	+```ts
	`113`	`+function lengthOfLIS(nums: number[]): number {`
	`114`	`+ let n = nums.length;`
	`115`	`+ let dp = new Array(n).fill(1);`
	`116`	`+ for (let i = 0; i < n; i++) {`
	`117`	`+ for (let j = 0; j < i; j++) {`
	`118`	`+ if (nums[j] < nums[i]) {`
	`119`	`+ dp[i] = Math.max(dp[i], dp[j] + 1);`
	`120`	`+ }`
	`121`	`+ }`
	`122`	`+ }`
	`123`	`+ return Math.max(...dp);`
	`124`	`+};`
	`125`	+```
	`126`	`+`
`110`	`127`	`### C++`
`111`	`128`
`112`	`129`	```cpp

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -91,6 +91,23 @@ class Solution {`
`91`	`91`	`}`
`92`	`92`	```
`93`	`93`
	`94`	`+### TypeScript`
	`95`	`+`
	`96`	+```ts
	`97`	`+function lengthOfLIS(nums: number[]): number {`
	`98`	`+ let n = nums.length;`
	`99`	`+ let dp = new Array(n).fill(1);`
	`100`	`+ for (let i = 0; i < n; i++) {`
	`101`	`+ for (let j = 0; j < i; j++) {`
	`102`	`+ if (nums[j] < nums[i]) {`
	`103`	`+ dp[i] = Math.max(dp[i], dp[j] + 1);`
	`104`	`+ }`
	`105`	`+ }`
	`106`	`+ }`
	`107`	`+ return Math.max(...dp);`
	`108`	`+};`
	`109`	+```
	`110`	`+`
`94`	`111`	`### C++`
`95`	`112`
`96`	`113`	```cpp

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+function lengthOfLIS(nums: number[]): number {`
	`2`	`+ let n = nums.length;`
	`3`	`+ let dp = new Array(n).fill(1);`
	`4`	`+ for (let i = 0; i < n; i++) {`
	`5`	`+ for (let j = 0; j < i; j++) {`
	`6`	`+ if (nums[j] < nums[i]) {`
	`7`	`+ dp[i] = Math.max(dp[i], dp[j] + 1);`
	`8`	`+ }`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ return Math.max(...dp);`
	`12`	`+};`

Comments

(0)