Subárboles monovalorados

4 Comentarios

1. Haskell

   data Arbol = H Int | N Int Arbol Arbol deriving Show monovalorados :: Arbol -> [Arbol] monovalorados (H x) = [H x] monovalorados (N x i d) | monovalorado i x && monovalorado d x = [N x i d] ++ subarboles i ++ subarboles d | otherwise = monovalorados i ++ monovalorados d monovalorado :: Arbol -> Int -> Bool monovalorado (H y) x = y == x monovalorado (N y i d) x = y == x && monovalorado i x && monovalorado d x subarboles :: Arbol -> [Arbol] subarboles (H x) = [H x] subarboles (N x i d) = [N x i d] ++ subarboles i ++ subarboles d

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

   data Arbol = H Int            | N Int Arbol Arbol            deriving Show monovalorados :: Arbol -> [Arbol] monovalorados (H x) = [H x] monovalorados (N x i d)   | monovalorado i x && monovalorado d x =       [N x i d] ++ subarboles i ++ subarboles d   | otherwise = monovalorados i ++ monovalorados d monovalorado :: Arbol -> Int -> Bool monovalorado (H y) x     = y == x monovalorado (N y i d) x = y == x && monovalorado i x && monovalorado d x subarboles :: Arbol -> [Arbol] subarboles (H x)     = [H x] subarboles (N x i d) = [N x i d] ++ subarboles i ++ subarboles d

   Responder

2. Haskell

   import Data.List (nub) monovalorados :: Arbol -> [Arbol] monovalorados zs = [xs | xs <- monovalorados1 zs , (length . nub . aux) xs == 1] where monovalorados1 (H x ) = [H x] monovalorados1 (N x xs ys ) | (x == ((head . aux) xs)) && x == ((head . aux) ys) = (N x xs ys) : monovalorados1 xs ++ monovalorados1 ys | otherwise = monovalorados1 xs ++ monovalorados1 ys aux (H x) = [x] aux (N x xs ys) = x: aux xs ++ aux ys

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

   import Data.List (nub)   monovalorados :: Arbol -> [Arbol] monovalorados zs = [xs | xs <- monovalorados1 zs                        , (length . nub . aux) xs == 1]   where monovalorados1 (H x ) = [H x]         monovalorados1 (N x xs ys )           | (x == ((head . aux) xs)) && x == ((head . aux) ys) =             (N x xs ys) : monovalorados1 xs ++ monovalorados1 ys           | otherwise =  monovalorados1 xs ++ monovalorados1 ys         aux (H x) = [x]         aux (N x xs ys) = x: aux xs ++ aux ys

   Responder

3. Haskell

   monovalorados :: Arbol -> [Arbol] monovalorados = filter esMonovalorado . subarboles esMonovalorado :: Arbol -> Bool esMonovalorado (H _) = True esMonovalorado (N x (H y) (H z)) = x == y && y == z esMonovalorado (N x i d) = esMonovalorado i && esMonovalorado d && x == valor i && x == valor d valor :: Arbol -> Int valor (H x) = x valor (N x _ _) = x subarboles :: Arbol -> [Arbol] subarboles (H x) = [H x] subarboles (N x i d) = N x i d : subarboles i ++ subarboles d

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

   monovalorados :: Arbol -> [Arbol] monovalorados = filter esMonovalorado . subarboles esMonovalorado :: Arbol -> Bool esMonovalorado (H _)             = True esMonovalorado (N x (H y) (H z)) = x == y && y == z esMonovalorado (N x i d) =   esMonovalorado i && esMonovalorado d && x == valor i && x == valor d valor :: Arbol -> Int valor (H x)     = x valor (N x _ _) = x subarboles :: Arbol -> [Arbol] subarboles (H x)     = [H x] subarboles (N x i d) = N x i d : subarboles i ++ subarboles d

   Responder

4. Haskell

   monovalorados :: Arbol -> [Arbol] monovalorados = filter esmonovalorado . subarboles esmonovalorado :: Arbol -> Bool esmonovalorado (H _ ) = True esmonovalorado (N c i d) = ms == replicate (length ms) (head ms) where ms = valoresHojas (N c i d) valoresHojas :: Arbol -> [Int] valoresHojas (H a) = [a] valoresHojas (N a (H x) (H d)) = a : [x] ++ [d] valoresHojas (N c i d) = c : valoresHojas i ++ valoresHojas d subarboles :: Arbol -> [Arbol] subarboles (H x) = [H x] subarboles (N x i d) = N x i d : subarboles i ++ subarboles d

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

   monovalorados :: Arbol -> [Arbol] monovalorados = filter esmonovalorado . subarboles esmonovalorado :: Arbol -> Bool esmonovalorado (H _ ) = True esmonovalorado (N c i d) =   ms == replicate (length ms) (head ms)   where ms = valoresHojas (N c i d) valoresHojas :: Arbol -> [Int] valoresHojas (H a)             = [a] valoresHojas (N a (H x) (H d)) = a : [x] ++ [d] valoresHojas (N c i d)         = c : valoresHojas i ++ valoresHojas d subarboles :: Arbol -> [Arbol] subarboles (H x)     = [H x] subarboles (N x i d) = N x i d : subarboles i ++ subarboles d

   Responder