程序代码：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class F
{
    public:
        F(vector<int> t):_v(t){}
        bool operator()(int i,int j)
        {
            if(count(_v.begin(),_v.end(),i)!=1)
                return true;
            else
                return false;
        }
    private:
        vector<int> _v;
};
int main()
{
    vector<int> arr1{1,2,3,4,4,5,6,5,6};
    arr1.erase(unique(arr1.begin(),arr1.end(),F(arr1)),arr1.end());
    for_each(begin(arr1),end(arr1),[](int i)
    {
        cout<<i<<' ';
    });
    cout<<endl;
    return 0;
}

程序代码：

#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
int a[10]={1,2,3,4,4,5,6,5,6};
std::vector<int> b;
int main()
{
    std::ios::sync_with_stdio(false);
    int i,n=0;
    for(i=0;i<9;i++)
    {
        b.push_back(a[i]);
    }
    std::sort(b.begin(),b.end());
    b.erase(unique(b.begin(),b.end()),b.end());
    for(i=0;i<b.size();i++)
    {
        if(n==0)
        {
            std::cout<<b[i];
            n++;
        }
        else std::cout<<" "<<b[i];
    }
    //std::cout<<endl;
    return 0;
}