No.259 - LeetCode[581] Shortest Unsorted Continuous Subarray

/*
 * @lc app=leetcode id=581 lang=cpp
 *
 * [581] Shortest Unsorted Continuous Subarray
 */

// @lc code=start
class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        int N = nums.size();
        vector<int> v(N);
        for(int i=0;i<N;i++){
            v[i] = nums[i];
        }
        sort(v.begin(), v.end());

        int L = 0;
        int R = N-1;
        for(int i=0;i<N;i++){
            L = max(L, i);
            if(v[i] != nums[i]) break;
        }
        for(int i=N-1;i>=0;i--){
            R = min(R, i);
            if(v[i] != nums[i]) break;
        }
        return R<=L?0:R-L+1;
    }
};
// @lc code=end