{"id":7262,"date":"2022-08-23T06:00:22","date_gmt":"2022-08-23T04:00:22","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7262"},"modified":"2022-12-14T16:47:26","modified_gmt":"2022-12-14T14:47:26","slug":"elementos-finales","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/elementos-finales\/","title":{"rendered":"Elementos finales"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   finales :: Int -> [a] -> [a]\n<\/pre>\n<p>tal que <code>(finales n xs)<\/code> es la lista formada por los <code>n<\/code> finales elementos de <code>xs<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   finales 3 [2,5,4,7,9,6]  ==  [7,9,6]\n<\/pre>\n<p><b>Soluciones<\/b><\/p>\n<p>A continuaci\u00f3n se muestran las <a href=\"#haskell\">soluciones en Haskell<\/a> y las <a href=\"#python\">soluciones en Python<\/a>.<\/p>\n<p><a name=\"haskell\"><\/a><br \/>\n<b>Soluciones en Haskell<\/b><\/p>\n<pre lang=\"haskell\">\nimport Test.QuickCheck\n\n-- 1\u00aa definici\u00f3n\nfinales1 :: Int -> [a] -> [a]\nfinales1 n xs = drop (length xs - n) xs\n\n-- 2\u00aa definici\u00f3n\nfinales2 :: Int -> [a] -> [a]\nfinales2 n xs = reverse (take n (reverse xs))\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_finales :: Int -> [Int] -> Bool\nprop_finales n xs =\n  finales1 n xs == finales2 n xs\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_finales\n--    +++ OK, passed 100 tests.\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium\/blob\/main\/src\/Elementos_finales.hs\">GitHub<\/a><\/p>\n<p><a name=\"python\"><\/a><br \/>\n<b>Soluciones en Python<\/b><\/p>\n<pre lang=\"python\">\nfrom typing import TypeVar\nfrom hypothesis import given, strategies as st\n\nA = TypeVar('A')\n\n# 1\u00aa definici\u00f3n\ndef finales1(n: int, xs: list[A]) -> list[A]:\n    if len(xs) <= n:\n        return xs\n    return xs[len(xs) - n:]\n\n# 2\u00aa definici\u00f3n\ndef finales2(n: int, xs: list[A]) -> list[A]:\n    if n == 0:\n        return []\n    return xs[-n:]\n\n# 3\u00aa definici\u00f3n\ndef finales3(n: int, xs: list[A]) -> list[A]:\n    ys = list(reversed(xs))\n    return list(reversed(ys[:n]))\n\n# La propiedad de equivalencia es\n@given(st.integers(min_value=0), st.lists(st.integers()))\ndef test_equiv_finales(n, xs):\n    assert finales1(n, xs) == finales2(n, xs) == finales3(n, xs)\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q elementos_finales.py\n#    1 passed in 0.18s\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium-Python\/blob\/main\/src\/elementos_finales.py\">GitHub<\/a><\/p>\n<p><b>Comentarios<\/b><\/p>\n<ul>\n<li>La longitud de la lista <code>xs<\/code> se calcula\n<ul>\n<li>en Haskell, con <code>length xs<\/code> y<\/li>\n<li>en Python, con <code>len(xs)<\/code>.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n finales :: Int -> [a] -> [a] tal que (finales n xs) es la lista formada por los n finales elementos de xs. Por ejemplo, finales 3 [2,5,4,7,9,6] == [7,9,6] Soluciones A continuaci\u00f3n se muestran las soluciones en Haskell y las soluciones en Python. Soluciones en Haskell import Test.QuickCheck &#8212; 1\u00aa definici\u00f3n&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[581],"tags":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7262"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=7262"}],"version-history":[{"count":7,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7262\/revisions"}],"predecessor-version":[{"id":7708,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7262\/revisions\/7708"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7262"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7262"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7262"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}