iframe-proxy | Sunbelt Computer Software

87 lines (85 loc) · 2.79 KB

public class Solution {
    // https://leetcode.com/problems/shortest-unsorted-continuous-subarray/solution/
    /* public int findUnsortedSubarray(int[] nums) {
        int[] snums = nums.clone();
        Arrays.sort(snums);
        int start = snums.length, end = 0;
        for (int i = 0; i < snums.length; i++) {
            if (snums[i] != nums[i]) {
                start = Math.min(start, i);
                end = Math.max(end, i);
        return (end - start >= 0 ? end - start + 1 : 0);
    public int findUnsortedSubarray(int[] nums) {
        Stack < Integer > stack = new Stack < Integer > ();
        int l = nums.length, r = 0;
        for (int i = 0; i < nums.length; i++) {
            while (!stack.isEmpty() && nums[stack.peek()] > nums[i])
                l = Math.min(l, stack.pop());
            stack.push(i);
        stack.clear();
        for (int i = nums.length - 1; i >= 0; i--) {
            while (!stack.isEmpty() && nums[stack.peek()] < nums[i])
                r = Math.max(r, stack.pop());
            stack.push(i);
        return r - l > 0 ? r - l + 1 : 0;
    /* public int findUnsortedSubarray(int[] nums) {
        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        boolean flag = false;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] < nums[i - 1])
                flag = true;
            if (flag)
                min = Math.min(min, nums[i]);
        flag = false;
        for (int i = nums.length - 2; i >= 0; i--) {
            if (nums[i] > nums[i + 1])
                flag = true;
            if (flag)
                max = Math.max(max, nums[i]);
        int l, r;
        for (l = 0; l < nums.length; l++) {
            if (min < nums[l])
                break;
        for (r = nums.length - 1; r >= 0; r--) {
            if (max > nums[r])
                break;
        return r - l < 0 ? 0 : r - l + 1;
    /* public int findUnsortedSubarray(int[] nums) {
        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        boolean flag = false;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] < nums[i - 1])
                flag = true;
            if (flag)
                min = Math.min(min, nums[i]);
        flag = false;
        for (int i = nums.length - 2; i >= 0; i--) {
            if (nums[i] > nums[i + 1])
                flag = true;
            if (flag)
                max = Math.max(max, nums[i]);
        int l, r;
        for (l = 0; l < nums.length; l++) {
            if (min < nums[l])
                break;
        for (r = nums.length - 1; r >= 0; r--) {
            if (max > nums[r])
                break;
        return r - l < 0 ? 0 : r - l + 1;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

581_Shortest_Unsorted_Continuous_Subarray.java

Latest commit

History

581_Shortest_Unsorted_Continuous_Subarray.java

File metadata and controls