1、题目
https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/
2、题意
题解1:排序找出前后不相等的index;
class Solution {
public:
int findUnsortedSubarray(vector<int>& nums) {
vector<int> temp(nums);
sort(temp.begin(),temp.end());
int i = 0,j = nums.size()-1;
while(i<nums.size())
{
if(nums[i]!=temp[i])
break;
i++;
}
while(j>=0)
{
if(nums[j]!=temp[j])
break;
j--;
}
return i<=j?j-i+1:0;
}
};