zoukankan      html  css  js  c++  java
  • LeetCode 581. Shortest Unsorted Continuous Subarray

    原题链接在这里:https://leetcode.com/problems/shortest-unsorted-continuous-subarray/

    题目:

    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:

    1. Then length of the input array is in range [1, 10,000].
    2. The input array may contain duplicates, so ascending order here means <=.

    题解:

    If the input nums is not sorted, then we want to find out the boundary index. 

    Then how, lets take start position as example. If the first part is sorted, then traversing right -> left, the updated minimum should be nums[i].

    We want to find out the position when minimum != nums[i], and the most left one, then it should be start position of output. 

    Vice versa for the ending position. 

    Time Complexity: O(nums.length).

    Space: O(1).

    AC Java:

     1 class Solution {
     2     public int findUnsortedSubarray(int[] nums) {
     3         if(nums == null || nums.length == 0){
     4             return 0;
     5         }
     6         
     7         int s = -1;
     8         int e = -2;
     9         int len = nums.length;
    10         int max = nums[0];
    11         int min = nums[len-1];
    12         for(int i = 0; i<len; i++){
    13             max = Math.max(max, nums[i]);
    14             if(max != nums[i]){
    15                 e = i;
    16             }
    17             
    18             min = Math.min(min, nums[len-1-i]);
    19             if(min != nums[len-1-i]){
    20                 s = len-1-i;
    21             }
    22         }
    23         
    24         return e-s+1;
    25     }
    26 }
  • 相关阅读:
    Linux下Tomcat服务器-maven项目部署
    数据库设计感悟
    数据库设计规范
    从零到一: 代码调试
    Java泛型与反射的综合应用
    Eclipse中,tomcat插件方式启动项目
    集合查询表--Map
    集合线性表--List之LinkedList(队列与栈)
    集合线性表--List之ArrayList
    Java中的日期操作
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/7561072.html
Copyright © 2011-2022 走看看