shortest-unsorted-continuous-subarray.cpp

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
     
        vector<int> newNums;
        for (int num: nums) {
            newNums.push_back(num);
        }
        
        sort(newNums.begin(), newNums.end());
        
        
        int firstMismatchIdx = -1;
        int lastMismatchIdx = -1;
        
        for(int i=0; i<nums.size(); i++) {
            if (nums[i] != newNums[i]) {
                
                if (firstMismatchIdx == -1) {
                    firstMismatchIdx = i;
                }
                
                lastMismatchIdx = i;
            }
        }
        
        if (firstMismatchIdx == -1 && lastMismatchIdx == -1) {
            return 0;
        }
        
        return (lastMismatchIdx - firstMismatchIdx + 1);
    }
};