C++ 去重排序算法：从N个数中找出不重复的数字并排序输出

#include #include #include using namespace std;

int main() { int N; cin >> N; vector nums(N); for (int i = 0; i < N; i++) { cin >> nums[i]; }

sort(nums.begin(), nums.end());
vector<int> result;
for (int i = 0; i < N; i++) {
    if (i == 0 || nums[i] != nums[i-1]) {
        result.push_back(nums[i]);
    }
}

cout << result.size() << endl;
for (int i = 0; i < result.size(); i++) {
    cout << result[i] << endl;
}

return 0;

}