581. Shortest Unsorted Continuous Subarray | LeetCode Solution
Given an integer array nums
, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.
Return the shortest such subarray and output its length.
Example 1:
Input: nums = [2,6,4,8,10,9,15] Output: 5 Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
Example 2:
Input: nums = [1,2,3,4] Output: 0
Example 3:
Input: nums = [1] Output: 0
Constraints:
1 <= nums.length <= 104
-105 <= nums[i] <= 105
Follow up: Can you solve it in
O(n)
time complexity?class Solution
{
public:
int findUnsortedSubarray(vector<int> &nums)
{
int n = nums.size();
if (n == 0 || n == 1)
return 0;
int low = INT_MAX;
int high = INT_MIN;
for (int i = 0; i < n; i++)
{
if (i == 0 && nums[i] > nums[i + 1])
{
low = min(low, nums[i]);
high = max(high, nums[i]);
}
else if (i == n - 1 && nums[i] < nums[i - 1])
{
low = min(low, nums[i]);
high = max(high, nums[i]);
}
else if (i != 0 && i != n - 1)
{
if (nums[i] < nums[i - 1] || nums[i] > nums[i + 1])
{
low = min(low, nums[i]);
high = max(high, nums[i]);
}
}
}
if (low == INT_MAX)
return 0;
int start = 0;
int end = n - 1;
while (nums[start] <= low)
{
start++;
}
while (nums[end] >= high)
end--;
int s = abs(start - end);
if (s != 0)
return s + 1;
return s;
}
};
0 Comments
If you have any doubts/suggestion/any query or want to improve this article, you can comment down below and let me know. Will reply to you soon.