【C++编程基础】AOJ (C++ Programming II)—4-D-unique

4-D-unique

题目

Unique For a sequence of integers A={a0,a1,…,an−1} which is sorted by ascending order, eliminate all equivalent elements.

输入

A sequence is given in the following format.

n

a0 a1…,an−1

输出

Print the sequence after eliminating equivalent elements in a line. Separate adjacency elements by a space character.

样例输入

4
1 2 2 4

样例输出

1 2 4

题解（代码流程）

#include<bits/stdc++.h>
#include<iostream>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vector<int> A(n);
    for (int i = 0; i < n; i++)cin >> A[i];
    auto p = unique(A.begin(), A.end());//定义自动变量p，调用查重函数unique
    for (int i = 0; i < p - A.begin(); i++) {//输出查重后，不重复的元素
        cout << A[i] << " ";
    }
    cout << endl;
    return 0;
}

小结

学会运用unique函数来查重

unique(A.begin(), A.end())