特殊排序

 

这是交互式的题目，leetcode上很常见，只需要实现一个函数就好

// Forward declaration of compare API.
// bool compare(int a, int b);
// return bool means whether a is less than b.

class Solution {
public:
    vector<int> specialSort(int n) {
        vector<int> res;
        res.push_back(1);
        for (int i = 2; i <= n; i++) {
            int l = 0, r = res.size() - 1;
            while (l < r) {
                int mid = l + r + 1 >> 1;
                if (compare(res[mid], i)) {
                    l = mid;
                } else {
                    r = mid - 1;
                }
            }
            res.push_back(i);
            for (int j = res.size() - 2; j > r; j--) {
                swap (res[j], res[j + 1]);
            }
            if (compare(i, res[r])) {
                swap(res[r], res[r + 1]);
            }
        }
        return res;
    }
};