Commit 52a4861

committed

添加(0674.最长连续递增序列.md):增加typescript版本

1 parent 047c4db commit 52a4861Copy full SHA for 52a4861

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -319,6 +319,45 @@ const findLengthOfLCIS = (nums) => {`
`319`	`319`	`};`
`320`	`320`	```
`321`	`321`
	`322`	`+TypeScript:`
	`323`	`+`
	`324`	`+> 动态规划:`
	`325`	`+`
	`326`	+```typescript
	`327`	`+function findLengthOfLCIS(nums: number[]): number {`
	`328`	`+ /**`
	`329`	`+ dp[i]: 前i个元素,以nums[i]结尾,最长连续子序列的长度`
	`330`	`+ */`
	`331`	`+ const dp: number[] = new Array(nums.length).fill(1);`
	`332`	`+ let resMax: number = 1;`
	`333`	`+ for (let i = 1, length = nums.length; i < length; i++) {`
	`334`	`+ if (nums[i] > nums[i - 1]) {`
	`335`	`+ dp[i] = dp[i - 1] + 1;`
	`336`	`+ }`
	`337`	`+ resMax = Math.max(resMax, dp[i]);`
	`338`	`+ }`
	`339`	`+ return resMax;`
	`340`	`+};`
	`341`	+```
	`342`	`+`
	`343`	`+> 贪心:`
	`344`	`+`
	`345`	+```typescript
	`346`	`+function findLengthOfLCIS(nums: number[]): number {`
	`347`	`+ let resMax: number = 1;`
	`348`	`+ let count: number = 1;`
	`349`	`+ for (let i = 0, length = nums.length; i < length - 1; i++) {`
	`350`	`+ if (nums[i] < nums[i + 1]) {`
	`351`	`+ count++;`
	`352`	`+ } else {`
	`353`	`+ count = 1;`
	`354`	`+ }`
	`355`	`+ resMax = Math.max(resMax, count);`
	`356`	`+ }`
	`357`	`+ return resMax;`
	`358`	`+};`
	`359`	+```
	`360`	`+`
`322`	`361`
`323`	`362`
`324`	`363`

Comments

(0)