leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0581.cpp (480B)

0 class Solution { 1 public: 2 int findUnsortedSubarray(const vector<int> &nums) const { 3 const int n = size(nums); 4 int mini = nums[n - 1], maxi = nums[0]; 5 int low = -1, high = -2; 6 7 for (int i = 1; i < n; i++) { 8 mini = min(mini, nums[n - i - 1]); 9 maxi = max(maxi, nums[i]); 10 11 if (nums[i] < maxi) high = i; 12 if (nums[n - i - 1] > mini) low = n - i - 1; 13 } 14 15 return high - low + 1; 16 } 17 };