Lets use erlang to solve it
-module(anagram).
-compile([export_all]).
anagram([ ]) -> [ [ ]];
anagram(L) -> [[H|T] || H <- L, T <- anagram(L -- [H])].
Social Profiles
Popular Posts
-
Lets us write an algorithm to find the height of a binary tree in c //Define Binary tree node struct BTreeNode { struct BTre... -
Lets use erlang to solve it -module(anagram). -compile([export_all]). anagram([ ]) -> [ [ ]]; anagram(L) -> [[H|T] || H ...
-
Diameter of a binary tree Diameter of a tree is the maximum distance between any of its two nodes. In the above diagram the nodes us...
0 comments:
Post a Comment