Shortest Unsorted Continuous Subarray

Updated: Mar 25, 2021

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


  • 1 <= nums.length <= 104

  • -105 <= nums[i] <= 105


class Solution {
    public int findUnsortedSubarray(int[] nums) {
        int[] temp = new int[nums.length];
        for(int i=0;i<nums.length;i++)
        int start=0,end=nums.length-1;
        while(start<nums.length && nums[start]==temp[start]) start++;
        while(end>=0 && nums[end]==temp[end]) end--;
        if(end<start) return 0;
        return end-start+1;

2 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.