妙用STL解题——使用set实现排序和去重

#include <iostream>
#include <set>

using namespace std;

int main(int argc, const char * argv[]) {
    set<int> array;
    int number;
    cout << "输入需排序去重的数字（空格分开，回车确认）:" << endl;
    while (1) {
        cin >> number;
        array.insert(number);
        if (cin.get() == '\n')
            break;
    }
    cout << "排序去重的结果如下：" << endl;
    for (set<int>::iterator it = array.begin(); it != array.end(); it++) {
        printf("%d ", *it);
    }
    printf("\n");
    return 0;
}