public class Solution {
public void sortColors(int[] A) {
int sum=0;
int sum1=0;
for(int i=0;i<=A.length-1;i++)
{
sum=sum+A[i];
}
for(int i=0;i<=A.length-1;i++)
{
if(A[i]==1)
{
sum1=sum1+1;
}
}
int sum2=sum-sum1;
int s2=sum2/2;
for(int i=0;i<=A.length-sum1-s2-1;i++)
{
A[i]=0;
}
for(int i=A.length-sum1-s2;i<=A.length-s2-1;i++)
{
A[i]=1;
}
for(int i=A.length-s2;i<=A.length-1;i++)
{
A[i]=2;
}
}
}
public void sortColors(int[] A) {
int sum=0;
int sum1=0;
for(int i=0;i<=A.length-1;i++)
{
sum=sum+A[i];
}
for(int i=0;i<=A.length-1;i++)
{
if(A[i]==1)
{
sum1=sum1+1;
}
}
int sum2=sum-sum1;
int s2=sum2/2;
for(int i=0;i<=A.length-sum1-s2-1;i++)
{
A[i]=0;
}
for(int i=A.length-sum1-s2;i<=A.length-s2-1;i++)
{
A[i]=1;
}
for(int i=A.length-s2;i<=A.length-1;i++)
{
A[i]=2;
}
}
}