{"id":12715,"date":"2022-10-01T16:23:10","date_gmt":"2022-10-01T10:53:10","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/"},"modified":"2022-10-01T16:23:10","modified_gmt":"2022-10-01T10:53:10","slug":"solved-group-duplicate-items-in-vector-c-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/","title":{"rendered":"[Solved] Group duplicate items in vector &#8211; c++ [closed]"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-46809304\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"46809304\" data-parentid=\"46808980\" data-score=\"-1\" data-position-on-page=\"2\" data-highest-scored=\"0\" data-question-has-accepted-highest-score=\"0\" itemprop=\"suggestedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>You&#8217;re close. You already figured out your bounds problem, but consider what happens at the interface of clusters:<\/p>\n<pre><code>..2,2,3,3...\n    ^ ^\n    i i+1\n<\/code><\/pre>\n<p>You are going to enter the <code>else<\/code> (<code>else if<\/code> is unnecessary if the condition is the exact opposite of the original <code>if<\/code>) and forget to add that last <code>2<\/code>. If there are no duplicates in the vector, such as<\/p>\n<pre><code>`{1,2,3,4}`\n<\/code><\/pre>\n<p>You are not going to add anything but empty clusters! So, you always want to add the number, rather you&#8217;re in a cluster or ending it. If you&#8217;re ending a cluster you <strong>also<\/strong> want to add it and clear.<\/p>\n<pre><code>for(int i = 0 ; i &lt; sorted.size()-1 ; i++ ){\n    cluster.push_back(sorted[i]);\n    if ( sorted[i] != sorted[i+1]){\n        clusters.push_back(cluster);\n        cluster.clear();\n    }\n}\n<\/code><\/pre>\n<p>Finally, as @tobi303 mentioned the last element is missing. This is especially obvious with a list with a single element (<code>{3}<\/code>). Note the last cluster is not added in any case, whether if it&#8217;s a new single element at the end or just a final cluster.<\/p>\n<p>So, once we exit the <code>for<\/code> we need one more check (not really) &#8211; if the cluster is empty that means the last element is not a part of it, and is a new one. Otherwise, the last cluster wasn&#8217;t added yet and you need to append the last element to it, and then add the cluster. I&#8217;m leaving this one up to you.<\/p>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\">6<\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved Group duplicate items in vector &#8211; c++ [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] You&#8217;re close. You already figured out your bounds problem, but consider what happens at the interface of clusters: ..2,2,3,3&#8230; ^ ^ i i+1 You are going to enter the else (else if is unnecessary if the condition is the exact opposite of the original if) and forget to add that last 2. If there &#8230; <a title=\"[Solved] Group duplicate items in vector &#8211; c++ [closed]\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\" aria-label=\"More on [Solved] Group duplicate items in vector &#8211; c++ [closed]\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324,806],"class_list":["post-12715","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c","tag-vector"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] Group duplicate items in vector - c++ [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Group duplicate items in vector - c++ [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] You&#8217;re close. You already figured out your bounds problem, but consider what happens at the interface of clusters: ..2,2,3,3... ^ ^ i i+1 You are going to enter the else (else if is unnecessary if the condition is the exact opposite of the original if) and forget to add that last 2. If there ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-10-01T10:53:10+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Group duplicate items in vector &#8211; c++ [closed]\",\"datePublished\":\"2022-10-01T10:53:10+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\"},\"wordCount\":225,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"c++\",\"vector\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\",\"name\":\"[Solved] Group duplicate items in vector - c++ [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-10-01T10:53:10+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Group duplicate items in vector &#8211; c++ [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Group duplicate items in vector - c++ [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Group duplicate items in vector - c++ [closed] - JassWeb","og_description":"[ad_1] You&#8217;re close. You already figured out your bounds problem, but consider what happens at the interface of clusters: ..2,2,3,3... ^ ^ i i+1 You are going to enter the else (else if is unnecessary if the condition is the exact opposite of the original if) and forget to add that last 2. If there ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/","og_site_name":"JassWeb","article_published_time":"2022-10-01T10:53:10+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Group duplicate items in vector &#8211; c++ [closed]","datePublished":"2022-10-01T10:53:10+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/"},"wordCount":225,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++","vector"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/","name":"[Solved] Group duplicate items in vector - c++ [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-10-01T10:53:10+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-group-duplicate-items-in-vector-c-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Group duplicate items in vector &#8211; c++ [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/12715","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=12715"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/12715\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=12715"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=12715"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=12715"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}