Leetcode 581 Shortest Unsorted Continuous Subarray

Leetcode 581 Shortest Unsorted Continuous Subarray

#include <vector>
#include <algorithm>
using namespace std;
//多开一个vector，从前从后比较从哪儿开始元素不一样
class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        if (nums.empty())
            return 0;
        int size = nums.size();
        int indexleft = 0;
        int indexright = 0;
        vector<int> numscopy = nums;
        sort(numscopy.begin(), numscopy.end());
        for (int i = 0; i < size; i++){
            if (nums[i] != numscopy[i]){
                indexleft = i;
                break;
            }
        }
        for (int i = size - 1; i > 0; i--){
            if (nums[i] != numscopy[i]){
                indexright = i;
                break;
            }
        }
        if (indexright == indexleft)
            return 0;
        int length = indexright - indexleft +1;
        return length;
    }
};