-
Notifications
You must be signed in to change notification settings - Fork 0
/
Flip Bits.cpp
77 lines (67 loc) · 1.08 KB
/
Flip Bits.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
/*
Flip Bits
Example 1)
Input:
1
5
1 0 0 1 0
Output:
4
Example 2)
Input:
1
7
1 0 0 1 0 0 1
Output:
6
*/
class Solution
{
public:
// Solution is based on Kadane's Algorithm
int maxOnes(int a[], int n)
{
int maxSum, currSum, oneCnt;
maxSum = currSum = oneCnt = 0;
for (int i = 0; i < n; i++)
{
if (a[i] == 1)
{
oneCnt++;
currSum--;
}
else
{
currSum++;
}
maxSum = max(maxSum, currSum);
if (currSum < 0)
{
currSum = 0;
}
}
return maxSum + oneCnt;
}
};
//{ Driver Code Starts.
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int a[n + 5];
for (int i = 0; i < n; i++)
cin >> a[i];
Solution ob;
cout << ob.maxOnes(a, n) << endl;
}
return 0;
}
// } Driver Code Ends