Shortest Unsorted Continuous Subarray问题及解法

最新推荐文章于 2022-12-09 14:36:04 发布

我们要爱学习

最新推荐文章于 2022-12-09 14:36:04 发布

阅读量2.2k

点赞数

分类专栏： LeetCode算法练习（Easy）文章标签： LeetCode Easy

本文链接：https://blog.csdn.net/u011809767/article/details/72137498

版权

LeetCode算法练习（Easy）专栏收录该内容

156 篇文章 3 订阅

订阅专栏

问题描述：

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.

示例：

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.

问题分析：

根据题意，我们可以先把数组升序排序，比较哪些元素变了，左右两边发生变化的元素的位置就是要求的子数组的长度范围。

过程详见代码：

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        vector<int> nums2 = nums;
        sort(nums.begin(),nums.end());
        int begin = -1;
        int end = -2;
        for(int i = 0;i < nums.size(); i++)
        {
        	if(nums[i] != nums2[i]) 
        	{
        		if(begin == -1)
        			begin = i;
        		end = i;
			}
		}
		return end - begin + 1;
    }
};