Difference between revisions of "99 questions/Solutions/2"
< 99 questions | Solutions
Jump to navigation
Jump to search
m (Add description to foldl solution.) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 14: | Line 14: | ||
myButLast'''' = head . tail . reverse |
myButLast'''' = head . tail . reverse |
||
| − | </haskell> |
||
| + | lastbut1 :: Foldable f => f a -> a |
||
| − | We can also use a pair to keep the last two elements processed from the list. We take advantage of lazy evaluation, such that if the list is too small, the initial elements in the pair get evaluated, resulting in an error: |
||
| ⚫ | |||
| − | <haskell> |
||
| + | where |
||
| ⚫ | |||
| − | + | err1 = error "lastbut1: Empty list" |
|
| − | + | err2 = error "lastbut1: Singleton" |
|
| + | |||
| + | lastbut1safe :: Foldable f => f a -> Maybe a |
||
| + | lastbut1safe = fst . foldl (\(a,b) x -> (b,Just x)) (Nothing,Nothing) |
||
</haskell> |
</haskell> |
||
Revision as of 17:26, 28 December 2014
(*) Find the last but one element of a list.
myButLast :: [a] -> a
myButLast = last . init
myButLast' x = reverse x !! 1
myButLast'' [x,_] = x
myButLast'' (_:xs) = myButLast'' xs
myButLast''' (x:(_:[])) = x
myButLast''' (_:xs) = myButLast''' xs
myButLast'''' = head . tail . reverse
lastbut1 :: Foldable f => f a -> a
lastbut1 = fst . foldl (\(a,b) x -> (b,x)) (err1,err2)
where
err1 = error "lastbut1: Empty list"
err2 = error "lastbut1: Singleton"
lastbut1safe :: Foldable f => f a -> Maybe a
lastbut1safe = fst . foldl (\(a,b) x -> (b,Just x)) (Nothing,Nothing)