Partición por longitudes

3 Comentarios

1. Haskell

   particion :: [a] -> [Int] -> [[a]] particion _ [] = [] particion xs (n:ns) = ys:particion zs ns where (ys,zs) = splitAt n xs

   1 2 3 4

   particion :: [a] -> [Int] -> [[a]] particion _ [] = [] particion xs (n:ns) = ys:particion zs ns where (ys,zs) = splitAt n xs

   Responder

2. Una solución algo exótica usando «arrows» :

   Haskell

   import Control.Arrow (second, (>>>)) particion :: [a] -> [Int] -> [[a]] particion xs ns = (f ns) xs where f [] = const [] f (r:rs) = splitAt r >>> second (f rs) >>> uncurry (:)

   1 2 3 4 5 6 7 8

   import Control.Arrow (second, (>>>))   particion :: [a] -> [Int] -> [[a]] particion xs ns = (f ns) xs    where f []     =   const []          f (r:rs) =   splitAt r                   >>> second (f rs)                   >>> uncurry (:)

   Responder

3. Haskell

   particion :: [a] -> [Int] -> [[a]] particion [] _ = [] particion _ [] = [] particion xs (y:ys) = take y xs : particion (drop y xs) ys

   1 2 3 4

   particion :: [a] -> [Int] -> [[a]] particion [] _ = [] particion _ [] = [] particion xs (y:ys) = take y xs : particion (drop y xs) ys

   Responder