Longest increasing subsequence: Difference between revisions
Content added Content deleted
(Scala contribution maintained.) |
(Scala contribution maintained.) |
||
Line 2,073: | Line 2,073: | ||
val tests = Map( |
val tests = Map( |
||
"3,2,6,4,5,1" -> Seq("2,4,5", "3,4,5"), |
"3,2,6,4,5,1" -> Seq("2,4,5", "3,4,5"), |
||
"0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15" -> |
"0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15" -> Seq("0,2,6,9,11,15", "0,2,6,9,13,15", "0,4,6,9,13,15", "0,4,6,9,11,15") |
||
Seq("0,2,6,9,11,15", "0,2,6,9,13,15", "0,4,6,9,13,15", "0,4,6,9,11,15") |
|||
) |
) |
||
Line 2,100: | Line 2,099: | ||
println( |
println( |
||
s"$given has ${allLongests.length} longest increasing subsequences, e.g. ${ |
s"$given has ${allLongests.length} longest increasing subsequences, e.g. ${ |
||
allLongests.last |
allLongests.last.mkString(",")}") |
||
.mkString(",") |
|||
}") |
|||
allLongests.forall(lis => expect.contains(lis.mkString(","))) |
allLongests.forall(lis => expect.contains(lis.mkString(","))) |
||
}) |
}) |