Given an integer array, 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, too.
You need to find the shortest such subarray and output its length.
Example 1:
Input: [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.
Note:
- Then length of the input array is in range [1, 10,000].
- The input array may contain duplicates, so ascending order here means <=.
题意:寻找一个最短区间,使得这个区间有序后,整个数组有序。
思路1:
1.将整个数组排序,然后与原数组比较,左边第一个不同的即为左边界,右边第一个不相同的即为右边界。做差即可。时间复杂度O(nlogn),空间复杂度O(n)
参考代码:
class Solution {
public:
int findUnsortedSubarray(vector<int>& nums) {
int i=0,j=nums.size()-1;
vector<int> v=nums;
sort(v.begin(),v.end());
while(i<nums.size()&&nums[i]==v[i]) ++i;
if(i==nums.size()) return 0;
while(j>0&&nums[j]==v[j]) --j;
return j-i+1;
}
};
思路2:
1.从左往右寻找遍历,如果碰到当前数字比左边的最大值小,则确定为右边界r,再从右往左遍历,如果当前数字比右边的最小值大,则确定为左边界,则r-l+1即为最终结果,如果原数组已经是正确的了,初始化l=0,r=-1即可。时间复杂度O(n),空间复杂度O(1)。
参考代码:
class Solution {
public:
int findUnsortedSubarray(vector<int>& nums) {
int n=nums.size(),mx=nums[0],mn=nums[n-1],l=0,r=-1;
for(int i=0;i<n;++i){
mx=max(mx,nums[i]);
if(nums[i]<mx) r=i;
}
for(int i=n-1;i>=0;--i){
mn=min(mn,nums[i]);
if(nums[i]>mn) l=i;
}
return r-l+1;
}
};