移0问题_h

int Func(int* A, int nSize)

{

int firstZeroIndex = -1; //-1表示没有0

int firstNumIndex = 0;

bool findZero = false;

for (int i = 0; i < nSize; i++)

{

if (A[i] == 0 && !findZero)

{

findZero = true;

firstZeroIndex = i;

}

else if (A[i] != 0)

{

firstNumIndex = i;

}

 

if (findZero && firstNumIndex > firstZeroIndex)

{

A[firstZeroIndex] = A[firstNumIndex];

A[firstNumIndex] = 0;

firstZeroIndex++;   

firstNumIndex = 0; 

}

}

return firstZeroIndex;

}