{"id":781,"date":"2014-12-09T06:00:22","date_gmt":"2014-12-09T04:00:22","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=781"},"modified":"2014-12-27T20:55:06","modified_gmt":"2014-12-27T18:55:06","slug":"sin-consecutivos-repetidos","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/sin-consecutivos-repetidos\/","title":{"rendered":"Sin consecutivos repetidos"},"content":{"rendered":"<h4>Enunciado<\/h4>\n<pre lang=\"text\">\n-- Definir la funci\u00f3n\n--    sinConsecutivosRepetidos :: Eq a => [a] -> [a]\n-- tal que (sinConsecutivosRepetidos xs) es la lista obtenida a partir\n-- de xs de forma que si hay dos o m\u00e1s elementos id\u00e9nticos consecutivos,\n-- borra las repeticiones y deja s\u00f3lo el primer elemento. Por ejemplo,\n--    ghci> sinConsecutivosRepetidos \"eesssooo essss   toodddooo\"\n--    \"eso es todo\"\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List (group)\n\n-- 1\u00aa soluci\u00f3n (por comprensi\u00f3n):\nsinConsecutivosRepetidos :: Eq a => [a] -> [a]\nsinConsecutivosRepetidos xs = [x | (x:_) <- group xs]\n\n-- 2\u00aa soluci\u00f3n (por recursi\u00f3n):\nsinConsecutivosRepetidos2 :: Eq a => [a] -> [a]\nsinConsecutivosRepetidos2 [] = []\nsinConsecutivosRepetidos2 (x:xs) = \n    x : sinConsecutivosRepetidos2 (dropWhile (==x) xs)\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Enunciado &#8212; Definir la funci\u00f3n &#8212; sinConsecutivosRepetidos :: Eq a => [a] -> [a] &#8212; tal que (sinConsecutivosRepetidos xs) es la lista obtenida a partir &#8212; de xs de forma que si hay dos o m\u00e1s elementos id\u00e9nticos consecutivos, &#8212; borra las repeticiones y deja s\u00f3lo el primer elemento. Por ejemplo, &#8212; ghci> sinConsecutivosRepetidos \u00abeesssooo&#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":[5],"tags":[8,59,13,11],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/781"}],"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=781"}],"version-history":[{"count":5,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/781\/revisions"}],"predecessor-version":[{"id":875,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/781\/revisions\/875"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=781"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=781"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=781"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}