题解 | #明明的随机数#

#include <bits/stdc++.h>

using namespace std;

int main()
{ 
    int N = 0;
    while (cin >> N)
    {
        vector<int> nums;
        int num1 = 0;
        for (int i = 0; i < N; ++i)
        {
            cin >> num1;
            nums.push_back(num1);
        }

        // 利用双指针来进行元素的移除        
        sort(nums.begin(), nums.end());
        int l = 0, r = 1;
        while (r < nums.size())
        {
            while (r < nums.size() && nums[r] == nums[l])
                ++r;
            if (r < nums.size())
                nums[++l] = nums[r++];
        }

        for (int i = 0; i <= l; ++i)
            cout << nums[i] << endl;
    }

    return 0;
}