Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
#include<stdio.h>
int removeElement(int A[], int n, int elem) {
int i,flag;
int cnt=0;
for(i=0,flag=0;i+cnt<n;){
printf("i=%d,j=%d,cnt=%d,k=%d\n",i,j,cnt,k);
if(A[i+cnt]==elem){
flag=1;
cnt++;
}
if(flag==1&&A[i+cnt]!=elem) {
A[i]=A[i+cnt];
i++;
}
if(flag==0&&A[i+cnt]!=elem) i++;
}
return n-cnt;
}
void main()
{
int a[]={3,3};
int elem=3;
int n=2;
int cnt=removeElement(a,n,elem);
printf("%d\n",cnt);
for(n=0;n<cnt;n++) printf("%d,",a[n]);
}