https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/
class Solution {
public:
int findUnsortedSubarray(vector<int>& nums) {
vector<int> cpnums(nums);
sort(nums.begin(), nums.end());
int len = nums.size();
int i=0, j=len-1;
while (nums[i]==cpnums[i]) {
i++;
}
while (nums[j]==cpnums[j]) {
j--;
}
return j-i+1<0? 0:j-i+1;
}
};