Coding-problem-solutions/Balance_array.cpp at master · shalini264/Coding-problem-solutions · GitHub

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
int Solution::solve(vector<int> &A) {
int n = A.size();
int prefo[n],prefe[n],sum=0;
for(int i=0;i<n;i++)
     {
         if(i==0)
         {prefo[i]=A[i];
          prefe[i]=0;}
         else if(i==1)
         {prefe[i]=A[i];
          prefo[i]=prefo[i-1];}
         else if(i%2==0)
         {prefo[i]=A[i]+prefo[i-1];
         prefe[i]=prefe[i-1];}
         else
         {prefe[i]=A[i]+prefe[i-1];
         prefo[i]=prefo[i-1];}
     }
for(int i=0;i<n;i++)
{
    if(i%2==0)
    {
        if(prefo[i]-A[i]+prefe[n-1]-prefe[i]==prefe[i]+prefo[n-1]-prefo[i])
        {
            sum++;
        }
    }
    else
    {
     if(prefe[i]-A[i]+prefo[n-1]-prefo[i]==prefo[i]+prefe[n-1]-prefe[i])
        {
            sum++;
        }
    }
}
return sum;
}