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;
}
};
leetcode 面试题 16.16. 部分排序
猜你喜欢
转载自blog.csdn.net/weixin_43956456/article/details/107687748
今日推荐
周排行