Shortest Unsorted Continuous Subarray
Given an integer array nums, you need to find one continuous subarray such that if you only sort this subarray in non-decreasing order, then the whole array will be sorted in non-decreasing order.
Return the shortest such subarray and output its length.
class Solution {
public int findUnsortedSubarray(int[] nums) {
int end = -1;
int max = nums[0];
for(int i = 1; i < nums.length; i++){
if(max > nums[i]){ // the left value is greater then current value
end = i; // mark that index with end
}
else{
max = nums[i];
}
}
int start = 0;
int min = nums[nums.length - 1];
for(int i = nums.length - 2; i >= 0; i--){
if(min < nums[i]){ // the right value is smaller then current value
start = i; // mark that index with start
}
else{
min = nums[i];
}
}
return end - start + 1;
}
}Posted by Jamie Meyer 25 days ago