zoukankan      html  css  js  c++  java
  • leetcode 581. 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 <=.

    ....排序

    class Solution {
    public:
        int findUnsortedSubarray(vector<int>& nums) {
            int n = nums.size();
            vector<int> v(n);
            for (int i = 0; i <n; ++i) v[i] =nums[i];
            sort(nums.begin(), nums.end());
            int l = 0;
            int r = n -1;
            while (l < r && nums[l] == v[l]) l++;
            if (l == r) return 0;
            while (r > l && nums[r] == v[r]) r--;
            return r - l + 1;
        }
    };
  • 相关阅读:
    Python自学笔记(12day)
    Python自学笔记(11day)
    Python自学笔记(10day)
    Python自学笔记(9day)
    Python自学笔记(8day)
    form标签的使用
    form标签的使用法
    img标签的使用方法
    <a></a>标签的使用
    html的标签
  • 原文地址:https://www.cnblogs.com/pk28/p/7255559.html
Copyright © 2011-2022 走看看