Caracteres en la misma posición que en el alfabeto

5 Comentarios

1. Haskell

   import Data.Char (toLower) nBienColocados :: String -> Int nBienColocados cs = auxB 0 ['a'..'z'] (map toLower cs) where auxB v [] _ = v auxB v _ [] = v auxB v (x:xs) (y:ys) | x == y = auxB (1+v) xs ys | otherwise = auxB v xs ys

   1 2 3 4 5 6 7 8

   import Data.Char (toLower)   nBienColocados :: String -> Int nBienColocados cs = auxB 0 ['a'..'z'] (map toLower cs)   where auxB v [] _ = v         auxB v _ [] = v         auxB v (x:xs) (y:ys) | x == y    = auxB (1+v) xs ys                              | otherwise = auxB v     xs ys

   Responder

2. Haskell

   import Data.Char (toLower) nBienColocados :: String -> Int nBienColocados = length . filter (uncurry (==)) . zip ['a'..'z'] . map toLower

   1 2 3 4 5

   import Data.Char (toLower)   nBienColocados :: String -> Int nBienColocados =   length . filter (uncurry (==)) . zip ['a'..'z'] . map toLower

   Responder

3. Haskell

   import Data.Char (toLower) nBienColocados :: String -> Int nBienColocados xs = length [(x,y) | (x,y) <- zip (minusculas xs) [1..] , elem (x,y) abecedario] -- donde minusculas :: String -> String minusculas [] = [] minusculas (x:xs) = toLower x : minusculas xs abecedario :: [(Char,Int)] abecedario = zip ['a'..'z'] [1..26]

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

   import Data.Char (toLower)   nBienColocados :: String -> Int nBienColocados xs =   length [(x,y) | (x,y) <- zip (minusculas xs) [1..]                 , elem (x,y) abecedario]   -- donde minusculas :: String -> String minusculas []     = [] minusculas (x:xs) = toLower x : minusculas xs   abecedario :: [(Char,Int)] abecedario = zip ['a'..'z'] [1..26]

   Responder

4. Haskell

   nBienColocados :: String -> Int nBienColocados cs = length [a | a <- zip cs [0..] , a `elem` abecedario] abecedario :: [(Char,Int)] abecedario = (zip ['A'..'Z'] [0..]) ++ (zip ['a'..'z'] [0..])

   1 2 3 4 5 6

   nBienColocados :: String -> Int nBienColocados cs = length [a | a <- zip cs [0..]                               , a `elem` abecedario]   abecedario :: [(Char,Int)] abecedario = (zip ['A'..'Z'] [0..]) ++ (zip ['a'..'z'] [0..])

   Responder

5. Haskell

   nBienColocados = sum . map fromEnum . zipWith (==) ['a'..] . map toLower

   1	nBienColocados = sum . map fromEnum . zipWith (==) ['a'..] . map toLower

   Responder