[Haskell-cafe] How to take a minimum sub list that only contain certain number of elements of certain type?

[Ivan Lazar Miljenovic]

On 25 September 2012 16:51, Magicloud Magiclouds
<magicloud.magiclouds at gmail.com> wrote:
> 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].

If you have listTest :: [a] -> Bool, then head . dropWhile (not .
listTest) . inits ?

>   How to do that? Combining lazy computing, I cannot figure out an
> efficient algorithm.
> --
> 竹密岂妨流水过
> 山高哪阻野云飞
>
> And for G+, please use magiclouds#gmail.com.
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe



-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com
http://IvanMiljenovic.wordpress.com