Domanda

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

È stato utile?

Soluzione

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

Autorizzato sotto: CC-BY-SA insieme a attribuzione
Non affiliato a StackOverflow
scroll top