(added one more implementation)
m (oops mixed up my edge case)
Revision as of 17:06, 15 September 2010
(**) Pack consecutive duplicates of list elements into sublists.
If a list contains repeated elements they should be placed in separate sublists.
pack (x:xs) = let (first,rest) = span (==x) xs in (x:first) : pack rest pack  = 
A more verbose solution is
pack :: Eq a => [a] -> [[a]] pack  =  pack (x:xs) = (x:first) : pack rest where getReps  = (, ) getReps (y:ys) | y == x = let (f,r) = getReps ys in (y:f, r) | otherwise = (, (y:ys)) (first,rest) = getReps xs
This is implemented as
pack :: Eq a => [a] -> [[a]] pack  =  pack (x:xs) = (x:reps) : (pack rest) where (reps, rest) = maybe (xs,) (\i -> splitAt i xs) (findIndex (/=x) xs)
. Another solution using
pack :: (Eq a) => [a] -> [[a]] pack  =  pack (x:xs) = (x : takeWhile (==x) xs) : pack (dropWhile (==x) xs)