Exactly three adjacent 3 in lists: Difference between revisions
→{{header|Haskell}}: Settled for the simpler variant
(→{{header|Haskell}}: Settled for the simpler variant) |
|||
Line 45:
=={{header|Haskell}}==
<lang haskell>import Data.
import Data.List (elemIndex)▼
nnPeers :: Int -> [Int] -> Bool
nnPeers n xs = maybe False go (elemIndex n xs)
where▼
go i
(all p)▼
(not . any p)▼
--------------------------- TEST -------------------------
Line 73 ⟶ 77:
[1,2,3,4,5,6,7,8,9] -> False
[4,6,8,7,2,3,3,3,1] -> True</pre>
▲import Data.List (elemIndex)
▲ where
▲ (all p)
▲ (not . any p)
▲ (splitAt n (drop i xs))</lang>
=={{header|Julia}}==
| |||