{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fchiwawa-star.hatenablog.com%2Fentry%2F2016%2F10%2F12%2F012815\" title=\"std::unique\uff5c\u7d9a\u30fb\u91cd\u8907\u8981\u7d20\u30c1\u30a7\u30c3\u30af\uff5cC++ - C++\u7af6\u30d7\u30ed\u5b66\u7fd2\u65e5\u8a18(\u4eee)\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","width":"100%","blog_url":"https://chiwawa-star.hatenablog.com/","version":"1.0","published":"2016-10-12 01:28:15","description":"std::unique *1 \u306e\u6319\u52d5\u306b\u30cf\u30de\u3063\u305f\u306e\u3067\u899a\u3048\u66f8\u304d\ud83d\udcdd #include <bits/stdc++.h> using namespace std; bool check( vector<int> A ){ sort( begin( A ), end( A ) ); return unique( begin( A ), end( A ) ) == end( A ); } int main() { vector<int> vc1{ 1,1,1,2,3,3,3,1,1,1 }; vector<int> vc2{ 1,2,3 }; cout << \"\u91cd\u8907\uff1a\" << ( check( vc1 ) \u2026","image_url":null,"provider_url":"https://hatena.blog","title":"std::unique\uff5c\u7d9a\u30fb\u91cd\u8907\u8981\u7d20\u30c1\u30a7\u30c3\u30af\uff5cC++","author_url":"https://blog.hatena.ne.jp/chiwawa_star/","categories":["\u95a2\u6570","\u7af6\u30d7\u30ed\u30e1\u30e2","C++","STL"],"author_name":"chiwawa_star","type":"rich","url":"https://chiwawa-star.hatenablog.com/entry/2016/10/12/012815","blog_title":"C++\u7af6\u30d7\u30ed\u5b66\u7fd2\u65e5\u8a18(\u4eee)","height":"190"}