algorithm之unique

1. #include<iostream>
2. #include<algorithm>
4. usingnamespace std;
6. /**< unique函数的算法思想 */
7. vector<int>::iterator uniqueElements(vector<int>::iterator begPos,vector<int>::iterator endPos)
8. {
9. auto currPos = begPos +1;
10. while(currPos != endPos)
11. {
12. if(*begPos !=*currPos)
13. *(++begPos)=*(currPos++);
14. else
15. ++currPos;
16. }
17. return begPos+1;
18. }
20. int main()
21. {
22. vector<int> intVector;
24. for(int i =0; i <20;++i)
25. {
26. intVector.push_back(rand()%10);
27. }
29. for(auto val : intVector)
30. {
31. cout << val <<" ";
32. }
33. cout << endl;
35. sort(intVector.begin(), intVector.end());
37. for(auto val : intVector)
38. {
39. cout << val <<" ";
40. }
41. cout << endl;
43. auto end_unique = unique(intVector.begin(), intVector.end());
44. /**< 可以查看算法，unique并不是简单的将重复的元素放置到最后面去 */
46. for(vector<int>::iterator it = intVector.begin(); it != intVector.end();++it)
47. {
48. if(it == end_unique)
49. cout <<"##";
50. cout <<*it <<" ";
51. }
52. cout << endl;
54. intVector.erase(end_unique,intVector.end());
55. for(auto val:intVector )
56. cout << val <<" ";
57. cout << endl;
59. return0;
60. }

 

来自为知笔记(Wiz)