-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0581-ShortestUnsortedContinuousSubarray.cs
44 lines (40 loc) · 1.28 KB
/
0581-ShortestUnsortedContinuousSubarray.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
//-----------------------------------------------------------------------------
// Runtime: 116ms
// Memory Usage: 31.5 MB
// Link: https://leetcode.com/submissions/detail/359594641/
//-----------------------------------------------------------------------------
using System;
namespace LeetCode
{
public class _0581_ShortestUnsortedContinuousSubarray
{
public int FindUnsortedSubarray(int[] nums)
{
int min = int.MaxValue, max = int.MinValue;
var 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 ? r - l + 1 : 0;
}
}
}