zzString :: [(Int, String)]
zzString = [ (3, "fizz"), (5, "buzz")]
fizzbuzz :: [String] -> Int -> Int -> [String]
fizzbuzz _ i n = map fizzbuzz' [i .. n]
where fizzbuzz' x = case [ s | (n, s) <- zzString, x mod n == 0 ] of
[] -> show x
xs -> concat xs
module Solution where zzString :: [(Int, String)] zzString = [ (3, "fizz"), (5, "buzz")] fizzbuzz :: [String] -> Int -> Int -> [String] fizzbuzz _ i n = map fizzbuzz' [i .. n] where fizzbuzz' x = case [ s | (n, s) <- zzString, x `mod` n == 0 ] of [] -> show x xs -> concat xs -- we don't need the empty accumulator -- could be fizzbuzz :: Int -> Int -> [String] -- generalized so we can have any number of replacements -- for example -- zzString [ (3, "fizz"), (5, "buzz"), (2, "muzz")]- module Solution where
- zzString :: [(Int, String)]
- zzString = [ (3, "fizz"), (5, "buzz")]
- fizzbuzz :: [String] -> Int -> Int -> [String]
fizzbuzz _ i n = map fizzbuzz' [i .. n]where fizzbuzz' n| n `mod` 15 == 0 = "fizzbuzz"| n `mod` 3 == 0 = "fizz"| n `mod` 5 == 0 = "buzz"| otherwise = show n- fizzbuzz _ i n = map fizzbuzz' [i .. n]
- where fizzbuzz' x = case [ s | (n, s) <- zzString, x `mod` n == 0 ] of
- [] -> show x
- xs -> concat xs
- -- we don't need the empty accumulator
- --- could be fizzbuzz :: Int -> Int -> [String]
- -- could be fizzbuzz :: Int -> Int -> [String]
- -- generalized so we can have any number of replacements
- -- for example
- -- zzString [ (3, "fizz"), (5, "buzz"), (2, "muzz")]
module Solution where
fizzbuzz :: [String] -> Int -> Int -> [String]
fizzbuzz _ i n = map fizzbuzz' [i .. n]
where fizzbuzz' n
| n mod 15 == 0 = "fizzbuzz"
| n mod 3 == 0 = "fizz"
| n mod 5 == 0 = "buzz"
| otherwise = show n
-- we don't need the empty accumulator
-- could be fizzbuzz :: Int -> Int -> [String]
module Solution where fizzbuzz :: [String] -> Int -> Int -> [String] fizzbuzz _ i n = map fizzbuzz' [i .. n] where fizzbuzz' n | n `mod` 15 == 0 = "fizzbuzz" | n `mod` 3 == 0 = "fizz" | n `mod` 5 == 0 = "buzz" | otherwise = show n -- we don't need the empty accumulator -- could be fizzbuzz :: Int -> Int -> [String]- module Solution where
- fizzbuzz :: [String] -> Int -> Int -> [String]
fizzbuzz acc i n| n < i = acc| otherwise = fizzbuzz (s : acc) i (n - 1)wheres = case (mod n 3, mod n 5) of(0, 0) -> "fizzbuzz"(0, _) -> "fizz"(_, 0) -> "buzz"_ -> show n- fizzbuzz _ i n = map fizzbuzz' [i .. n]
- where fizzbuzz' n
- | n `mod` 15 == 0 = "fizzbuzz"
- | n `mod` 3 == 0 = "fizz"
- | n `mod` 5 == 0 = "buzz"
- | otherwise = show n
- -- we don't need the empty accumulator
- -- could be fizzbuzz :: Int -> Int -> [String]