Jump to content

Listas de Tuplos


Recommended Posts

Boa tarde.
Podes percorrer recursivamente a lista, decrementando o valor dado como índice a não incluir, e, quando o valor for zero, não acrescentas o valor ao resultado.

Este é o esqueleto base (estou a assumir que sabes estruturas de decisão em Haskell para poderes completar):

foo i (x:xs) = x : foo (i-1) xs


Edited by thoga31

Knowledge is free!

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
  • Create New...

Important Information

By using this site you accept our Terms of Use and Privacy Policy. We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.