最长连续次数
【题目】给定一个串,其中可能有的字母连续出现。求最大连续出现的次数。
例如:abcddddefgaaaabb,最长连续次数=4,贡献者是 a 和 d
这个问题对haskell 而言有点作弊了。因为标准库中的个 group 函数,可以按相同的连续字母进行分组。
看代码:
import Data.List (group)
maxRepeat :: String -> Int
maxRepeat = maximum . map length . group
main :: IO ()
main = print $ maxRepeat "abcddddefgaaaabb"
好吧,这个不算,我们自己加点难度。要求输出所有连续出现次数最多的字母。
这个对 haskell 来说,也相当容易。
上代码:
import Data.List (group)
maxRepeat :: String -> String
maxRepeat s = let n = maximum . map length . group $ s
in [ head xs | xs <- group s, length xs == n]
main :: IO ()
main = print $ maxRepeat "abcddddefgaaaabb"
还是觉得作弊? 好吧,自己写个 group 好了。
--import Data.List (group)
group :: Eq a => [a] -> [[a]]
group [] = []
group [x] = [[x]]
group (x:xs) | head ys == x = (x:ys):yss
| otherwise = [x] : yall
where yall@(ys:yss) = group xs
maxRepeat :: String -> String
maxRepeat s = let n = maximum . map length . group $ s
in [ head xs | xs <- group s, length xs == n]
main :: IO ()
main = print $ maxRepeat "abcddddefgaaaabb"
自己写也没费多大事。感觉 haskell 就是这样的。仿佛越是通用性的需求,实现起来就越简单。