leetcode 面试题 16.16. 部分排序

class Solution {
public:
    vector<int> subSort(vector<int>& array) {
        if(!array.size())
        {
            return {-1, -1};
        }
        vector<int> res;
        vector<int> temp = array;
        sort(temp.begin(), temp.end());
        if(temp == array)
        {
            return {-1, -1};
        }
        for(int i = 0; i < array.size(); i++)
        {
            if(temp[i] != array[i])
            {
                res.push_back(i);
                break;
            }
        }
        for(int i = array.size() - 1; i >= 0; i--)
        {
            if(array[i] != temp[i])
            {
                res.push_back(i);
                break;
            }
        }
        return res;
    }
};