-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
581.java
64 lines (59 loc) · 1.62 KB
/
581.java
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public int findUnsortedSubarray(int[] nums) {
int head = 0;
int tail = nums.length-1;
int flag = 0;
for(int i = 0 ; i < nums.length ; ++ i)
if(nums[i] < nums[head])
{
while(head >= 0 && nums[i] < nums[head])
head --;
if(head < 0)
break;
flag = 1;
}
else if(flag == 0)
head = i;
flag = 0;
for(int i = nums.length-1 ; i >= 0 ; -- i)
if(nums[i] > nums[tail])
{
while(tail < nums.length && nums[i] > nums[tail])
tail ++;
if(tail == nums.length)
break;
flag = 1;
}
else if(flag == 0)
tail = i;
return Math.max(tail - head - 1 , 0 );
}
}
__________________________________________________________________________________________________
sample 38936 kb submission
class Solution {
public int findUnsortedSubarray(int[] nums) {
if(nums == null || nums.length == 0){
return -1;
}
int start = 0, end = 0;
int min = nums[nums.length - 1];
int max = nums[0];
for(int i = 1; i < nums.length; i++){
if(nums[i] < max){
end = i;
}
max = Math.max(max, nums[i]);
}
for(int i = nums.length - 1; i >= 0; i--){
if(nums[i] > min){
start = i;
}
min = Math.min(min, nums[i]);
}
return start != end ? end - start + 1 : 0;
}
}
__________________________________________________________________________________________________