Visibilidad de listas y matrices

3 Comentarios

1. Haskell

   import Data.List import Data.Matrix import qualified Data.Vector as V (toList) -- definición recursiva visibilidadLista :: [Int] -> Int visibilidadLista [] = 0 visibilidadLista [_] = 1 visibilidadLista (x:y:xs) | x < y = 1 + visibilidadLista (y:xs) | otherwise = visibilidadLista (x:xs) visibilidadMatriz :: Matrix Int -> ([Int],[Int]) visibilidadMatriz p = ( [ visibilidadLista $ V.toList (getRow i p) | i <- [1..nrows p] ], [ visibilidadLista $ V.toList (getCol j p) | j <- [1..ncols p] ] )

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

   import           Data.List import           Data.Matrix import qualified Data.Vector as V (toList)     -- definición recursiva visibilidadLista  :: [Int] -> Int visibilidadLista []    = 0 visibilidadLista [_]   = 1 visibilidadLista (x:y:xs) | x < y     = 1 + visibilidadLista (y:xs)                           | otherwise =     visibilidadLista (x:xs)   visibilidadMatriz :: Matrix Int -> ([Int],[Int]) visibilidadMatriz p =     ( [ visibilidadLista $ V.toList (getRow i p) | i <- [1..nrows p] ],       [ visibilidadLista $ V.toList (getCol j p) | j <- [1..ncols p] ]  )

   Responder

2. Haskell

   import Data.List import Data.Matrix visibilidadLista :: [Int] -> Int visibilidadLista [] = 0 visibilidadLista xs = sum[test ys|ys<-inits xs] where test [] = 0 test [x] = 1 test ys | all (\y -> y<x) (init ys) = 1 | otherwise = 0 where x = last ys filas :: Matrix Int -> [[Int]] filas p = [[p!(i,j)|j<-[1..m]]|i<-[1..n]] where n = nrows p m = ncols p columnas :: Matrix Int -> [[Int]] columnas p = [[p!(i,j)|i<-[1..n]]|j<-[1..m]] where n = nrows p m = ncols p visibilidadMatriz :: Matrix Int -> ([Int],[Int]) visibilidadMatriz p = ([visibilidadLista xs|xs<-filas p],[visibilidadLista xs|xs<-columnas p])

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

   import Data.List import Data.Matrix   visibilidadLista  :: [Int] -> Int visibilidadLista [] = 0 visibilidadLista xs = sum[test ys|ys<-inits xs]                     where test [] = 0                           test [x] = 1                           test ys | all (\y -> y<x) (init ys) = 1                                   | otherwise = 0                                   where x = last ys filas :: Matrix Int -> [[Int]] filas p = [[p!(i,j)|j<-[1..m]]|i<-[1..n]]         where n = nrows p               m = ncols p columnas :: Matrix Int -> [[Int]] columnas p = [[p!(i,j)|i<-[1..n]]|j<-[1..m]]            where n = nrows p                  m = ncols p visibilidadMatriz :: Matrix Int -> ([Int],[Int]) visibilidadMatriz p = ([visibilidadLista xs|xs<-filas p],[visibilidadLista xs|xs<-columnas p])

   Responder

3. Haskell

   import Data.List (inits) import qualified Data.Vector as V (toList) import qualified Data.Matrix as M visibilidadLista :: [Int] -> Int visibilidadLista xs = length $ filter (\ys -> all (< last ys) (init ys)) (tail $ inits xs) visibilidadMatriz :: M.Matrix Int -> ([Int],[Int]) visibilidadMatriz p = (visibilidadFilas p, visibilidadColumnas p) where visibilidadFilas p = map (visibilidadLista . V.toList . (`M.getRow` p)) [1..M.nrows p] visibilidadColumnas p = map (visibilidadLista . V.toList . (`M.getCol` p)) [1..M.ncols p]

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

   import Data.List (inits) import qualified Data.Vector as V (toList) import qualified Data.Matrix as M   visibilidadLista  :: [Int] -> Int visibilidadLista xs =     length $ filter (\ys -> all (< last ys) (init ys)) (tail $ inits xs)   visibilidadMatriz :: M.Matrix Int -> ([Int],[Int]) visibilidadMatriz p = (visibilidadFilas p, visibilidadColumnas p)     where visibilidadFilas p    =               map (visibilidadLista . V.toList . (`M.getRow` p)) [1..M.nrows p]           visibilidadColumnas p =               map (visibilidadLista . V.toList . (`M.getCol` p)) [1..M.ncols p]

   Responder