[Haskell-cafe] How to take a minimum sub list that only contain certain number of elements of certain type?
Magicloud Magiclouds
magicloud.magiclouds at gmail.com
Tue Sep 25 08:51:16 CEST 2012
Hi,
For example, I have an array [0..]. Now I want to take a sub list
that starts from index 0, and only contain 4 odds, and is minimum
result. The answer should be [0, 1, 2, 3, 4, 5, 6, 7].
How to do that? Combining lazy computing, I cannot figure out an
efficient algorithm.
--
竹密岂妨流水过
山高哪阻野云飞
And for G+, please use magiclouds#gmail.com.
More information about the Haskell-Cafe
mailing list