Question

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

Était-ce utile?

La solution

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

Licencié sous: CC-BY-SA avec attribution
Non affilié à StackOverflow
scroll top