質問

Does someone know how to find the longest common subsequence of a set of strings in Ocaml language?

役に立ちましたか?

解決

Look at other questions tagged "lcs", like Longest common subsequence of 3+ strings . Then you should be able to write the code in OCaml.

ライセンス: CC-BY-SA帰属
所属していません StackOverflow
scroll top