-
Notifications
You must be signed in to change notification settings - Fork 0
/
1004. Max Consecutive Ones III.c
91 lines (77 loc) · 2.08 KB
/
1004. Max Consecutive Ones III.c
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
int longestOnes(int* nums, int numsSize, int k)
{
int start_index = 0;
int end_index = 0;
int max = INT_MIN;
if(k==0)
{
//Calculate no of consecutive 1's
while(end_index < numsSize)
{
if(nums[end_index] == 1)
{
end_index++;
}
else
{
start_index++;
if(start_index > end_index)
{
end_index = start_index;
}
}
if(end_index - start_index >= max)
{
max = (end_index - start_index);
}
}
return max;
}
int no_of_flips = 0;
int * index_arr = (int *)malloc(sizeof(int) * k);
int index_arr_index = 0;
int cur_check_index = 0;
while(end_index<numsSize)
{
if(nums[end_index] == 1)
{
end_index++;
}
else if(nums[end_index] == 0)
{
if(no_of_flips < k)
{
no_of_flips++;
index_arr[index_arr_index++] = end_index;
end_index++;
}
else
{
if(start_index != index_arr[cur_check_index])
{
start_index++;
}
else if(start_index == index_arr[cur_check_index])
{
cur_check_index++;
if(cur_check_index == k)
{
cur_check_index = 0;
}
no_of_flips--;
if(index_arr_index == k)
{
index_arr_index = 0;
}
start_index++;
}
}
}
if(end_index - start_index > max)
{
max = end_index - start_index;
}
}
free(index_arr);
return max;
}