leetcode581

public class Solution {
    public int FindUnsortedSubarray(int[] nums) {
        int n = nums.Length, beg = -, end = -, min = nums[n - ], max = nums[];
            for (int i = ; i < n; i++)
            {
                max = Math.Max(max, nums[i]);
                min = Math.Min(min, nums[n -  - i]);
                if (nums[i] < max)
                {
                    end = i;
                }
                if (nums[n -  - i] > min)
                {
                    beg = n -  - i;
                }
            }
            return end - beg + ;
    }
}

https://leetcode.com/problems/shortest-unsorted-continuous-subarray/#/description

另外一种比较容易理解的方案:

public class Solution {
    public int FindUnsortedSubarray(int[] nums) {
        int n = nums.Length;
            var temp = new List<int>();
            for (int i = ; i < n; i++)
            {
                temp.Add(nums[i]);
            }
            temp = temp.OrderBy(x => x).ToList();

            int start = ;
            while (start < n && nums[start] == temp[start])
            {
                start++;
            }
            //正序找到第一个不同，确定start的位置

            int end = n - ;
            while (end > start && nums[end] == temp[end])
            {
                end--;
            }
            //逆序找到第一个不同，确定end的位置

            return end - start + ;
    }
}