Package com.almworks.integers
Class IntLongestCommonSubsequence
java.lang.Object
com.almworks.integers.IntLongestCommonSubsequence
- Author:
- Igor Sereda Copied from IntLongestCommonSequence.
-
Method Summary
Modifier and TypeMethodDescriptionstatic com.almworks.integers.IntListgetLCS(com.almworks.integers.IntList aseq, com.almworks.integers.IntList bseq) static com.almworks.integers.IntListgetLCS(com.almworks.integers.IntList aseq, com.almworks.integers.IntList bseq, boolean tryOptimize) static com.almworks.integers.IntListgetLcsForPermutation(com.almworks.integers.IntList aseq, com.almworks.integers.IntList bseq) contract: aseq shouldn't contain duplicates and bseq should be permutation of aseq.
-
Method Details
-
getLcsForPermutation
public static com.almworks.integers.IntList getLcsForPermutation(com.almworks.integers.IntList aseq, com.almworks.integers.IntList bseq) contract: aseq shouldn't contain duplicates and bseq should be permutation of aseq.- Parameters:
aseq- list without duplicatesbseq- list without duplicates- Returns:
- longest common subsequence for
aseqandbseq
-
getLCS
public static com.almworks.integers.IntList getLCS(com.almworks.integers.IntList aseq, com.almworks.integers.IntList bseq) -
getLCS
public static com.almworks.integers.IntList getLCS(com.almworks.integers.IntList aseq, com.almworks.integers.IntList bseq, boolean tryOptimize)
-