Hojas con caminos no decrecientes

4 Comentarios

1. Haskell

   data Arbol = N Int [Arbol] deriving Show hojasEnNoDecreciente :: Arbol -> [Int] hojasEnNoDecreciente a = sort [last xs | xs <- ramas a, esCreciente xs] esCreciente :: [Int] -> Bool esCreciente xs = and [signum (a-b) == -1 | (a,b) <- zip xs (tail xs)] ramas :: Arbol -> [[Int]] ramas (N x []) = [[x]] ramas (N x as) = [x : xs | a <- as, xs <- ramas a]

   1 2 3 4 5 6 7 8 9 10 11

   data Arbol = N Int [Arbol] deriving Show   hojasEnNoDecreciente :: Arbol -> [Int] hojasEnNoDecreciente a = sort [last xs | xs <- ramas a, esCreciente xs]   esCreciente :: [Int] -> Bool esCreciente xs = and [signum (a-b) == -1 | (a,b) <- zip xs (tail xs)]   ramas :: Arbol -> [[Int]] ramas (N x []) = [[x]] ramas (N x as) = [x : xs | a <- as, xs <- ramas a]

   Responder

2. Haskell

   hojasEnNoDecreciente :: Arbol -> [Int] hojasEnNoDecreciente (N x xs) = map last [ ys | ys <- (caminos (N x xs)), nodecreciente ys] caminos :: Arbol -> [[Int]] caminos (N x []) = [[x]] caminos (N x xs) = map (x:) (concatMap caminos xs) nodecreciente :: [Int] -> Bool nodecreciente [] = True nodecreciente [x] = True nodecreciente (x:y:xs) = x <= y && nodecreciente (y:xs)

   1 2 3 4 5 6 7 8 9 10 11 12

   hojasEnNoDecreciente :: Arbol -> [Int] hojasEnNoDecreciente (N x xs) =   map last [ ys | ys <- (caminos (N x xs)), nodecreciente ys]   caminos :: Arbol -> [[Int]] caminos (N x []) = [[x]] caminos (N x xs) = map (x:) (concatMap caminos xs)   nodecreciente :: [Int] -> Bool nodecreciente [] = True nodecreciente [x] = True nodecreciente (x:y:xs) = x <= y && nodecreciente (y:xs)

   Responder

3. Haskell

   hojasEnNoDecrecienteA3 :: Arbol -> [Int] hojasEnNoDecrecienteA3 = sort . map last . filter creciente . aux where creciente (x:y:xs) = x <= y && creciente (y:xs) creciente [_] = True aux (N x []) = [[x]] aux (N x xss) = concat [map (x:) (aux ys) | ys <- xss]

   1 2 3 4 5 6 7 8

   hojasEnNoDecrecienteA3 :: Arbol -> [Int] hojasEnNoDecrecienteA3  =   sort . map last . filter creciente . aux   where     creciente (x:y:xs) = x <= y && creciente (y:xs)     creciente [_]      = True     aux (N x [])       = [[x]]     aux (N x xss)      = concat [map (x:) (aux ys) | ys <-  xss]

   Responder

4. Haskell

   data Arbol = N Int [Arbol] deriving Show hojasEnNoDecreciente :: Arbol -> [Int] hojasEnNoDecreciente (N x xs) = [last xs | xs <- ramas (N x xs), esCreciente xs] ramas :: Arbol -> [[Int]] ramas (N x []) = [[x]] ramas (N x xs) = map (x:) (concatMap ramas xs) esCreciente :: [Int] -> Bool esCreciente [_] = True esCreciente (x:y:xs) = x <= y && esCreciente (y:xs)

   1 2 3 4 5 6 7 8 9 10 11 12 13

   data Arbol = N Int [Arbol]      deriving Show   hojasEnNoDecreciente :: Arbol -> [Int] hojasEnNoDecreciente (N x xs) = [last xs | xs <- ramas (N x xs), esCreciente xs]   ramas :: Arbol -> [[Int]] ramas (N x []) = [[x]] ramas (N x xs) = map (x:) (concatMap ramas xs)   esCreciente :: [Int] -> Bool esCreciente [_]      = True esCreciente (x:y:xs) = x <= y && esCreciente (y:xs)

   Responder