-
Notifications
You must be signed in to change notification settings - Fork 1
/
flip-interviewbit.cpp
60 lines (53 loc) · 1.27 KB
/
flip-interviewbit.cpp
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
vector<int> Solution::flip(string A) {
int maxone, sl, sr, absmax, currmax, slhere, srhere, vlen, len, change;
vlen = A.length();
//printf("len is %d", vlen);
len = vlen;
sl = 0;
sr = 0;
srhere = 0;
slhere = 0;
absmax = 0;
currmax = 0;
/*for(int i =0; i < len; i++)
{
if (A[i] == '1')
{absmax++;}
//printf("under abs max %d", absmax);
//printf("abs max %d, ai %c", absmax, A[i]);
}*/
vector <int> retur;
// count total one
for (int i = 0; i < vlen; i++)
{
if(A[i] == '0')
{
change = 1;
}
else
{
change = -1;
}
//printf("cange is %d", change);
if(change > (currmax + change))
{
slhere = i;
currmax = change;
}
else{
currmax = currmax + change;
}
srhere = i;
if(currmax > absmax)
{ //printf("i am here");
sl = slhere + 1;
sr = srhere + 1;
absmax = currmax;
retur.clear();
retur.push_back(sl);
retur.push_back(sr);
}
}
//printf("vals are%d %d ", retur[0], retur[1]);
return retur;
}