{"id":3108,"date":"2017-03-20T06:00:36","date_gmt":"2017-03-20T04:00:36","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=3108"},"modified":"2017-03-27T13:40:58","modified_gmt":"2017-03-27T11:40:58","slug":"reduccion-de-repeticiones-consecutivas","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/reduccion-de-repeticiones-consecutivas\/","title":{"rendered":"Reducci\u00f3n de repeticiones consecutivas"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   reducida :: Eq a => [a] -> [a]\n<\/pre>\n<p>tal que (reducida xs) es la lista obtenida a partir de xs de forma que si hay dos o m\u00e1s elementos id\u00e9nticos consecutivos, borra las repeticiones y deja s\u00f3lo el primer elemento. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   ghci> reducida \"eesssooo essss   toodddooo\"\n   \"eso es todo\"\n<\/pre>\n<p><strong>Nota<\/strong>: Basado en el ejercicio <a href=\"http:\/\/bit.ly\/2n4CKDF\">Apaxiaaaaaaaaaaaans!<\/a> de <a href=\"https:\/\/open.kattis.com\">Kattis<\/a>.<\/p>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List (group)\n\n-- 1\u00aa soluci\u00f3n (por recursi\u00f3n):\nreducida1 :: Eq a => [a] -> [a]\nreducida1 []     = []\nreducida1 (x:xs) = x : reducida1 (dropWhile (==x) xs)\n\n-- 2\u00aa soluci\u00f3n (por comprensi\u00f3n):\nreducida2 :: Eq a => [a] -> [a]\nreducida2 xs = [x | (x:_) <- group xs]\n\n-- 3\u00aa soluci\u00f3n (sin argumentos):\nreducida3 :: Eq a => [a] -> [a]\nreducida3 = map head . group\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n reducida :: Eq a => [a] -> [a] tal que (reducida xs) es la lista obtenida a partir de xs de forma que si hay dos o m\u00e1s elementos id\u00e9nticos consecutivos, borra las repeticiones y deja s\u00f3lo el primer elemento. Por ejemplo, ghci> reducida \u00abeesssooo essss toodddooo\u00bb \u00abeso es todo\u00bb Nota: Basado&#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":[4],"tags":[8,59,13,71,10,11,6],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3108"}],"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=3108"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3108\/revisions"}],"predecessor-version":[{"id":3142,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3108\/revisions\/3142"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3108"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3108"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}