haskell的排列组合

combination :: [a] -> [[a]]
combination [] =  [[]]
combination (x:xs) =  (map (x:) (combination xs) )++ (combination xs)

permutation :: Eq a => [a] -> [[a]]
permutation [] = [[]]
permutation xs = concatMap (\x -> map (x:) $ permutation (delete x xs)) xs

2 Responses to “haskell的排列组合”

---

• fle

  2009年04月22日 at 4:58 下午

  拜大牛~

  回复
• ssword

  2009年04月22日 at 5:33 下午

  @fle 囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧囧

  回复