Commite2b9754

authored

tests: add tests ofLongestIncreasingSubsequence (#1660)

1 parentcc1e1dc commite2b9754Copy full SHA for e2b9754

File tree

+27

-0

lines changed

+27

-0

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,9 @@`
`6`	`6`	`// Return the length of the Longest Increasing Subsequence, given array x`
`7`	`7`	`functionlongestIncreasingSubsequence(x){`
`8`	`8`	`constlength=x.length`
	`9`	`+if(length==0){`
	`10`	`+return0`
	`11`	`+}`
`9`	`12`	`constdp=Array(length).fill(1)`
`10`	`13`
`11`	`14`	`letres=1`

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,24 @@`
	`1`	`+import{longestIncreasingSubsequence}from'../LongestIncreasingSubsequence'`
	`2`	`+`
	`3`	`+describe('Testing longestIncreasingSubsequence',()=>{`
	`4`	`+it.each([`
	`5`	`+[[],0],`
	`6`	`+[[1],1],`
	`7`	`+[[2,2],1],`
	`8`	`+[[3,3,3],1],`
	`9`	`+[[4,4,4,4],1],`
	`10`	`+[[1,2],2],`
	`11`	`+[[1,2,2,2,2],2],`
	`12`	`+[[1,0,2],2],`
	`13`	`+[[1,10,2,30],3],`
	`14`	`+[[5,8,3,7,9,1],3],`
	`15`	`+[[10,9,2,5,3,7,101,18],4],`
	`16`	`+[[10,10,9,9,2,2,5,5,3,3,7,7,101,101,18,18],4],`
	`17`	`+[[0,1,0,3,2,3],4],`
	`18`	`+[[1,1,2,2,2],2],`
	`19`	`+[[1,1,2,2,2,3,3,3,3],3],`
	`20`	`+[[0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15],6]`
	`21`	`+])('check with %j',(input,expected)=>{`
	`22`	`+expect(longestIncreasingSubsequence(input)).toBe(expected)`
	`23`	`+})`
	`24`	`+})`

Comments

(0)