标签：
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.
1 int removeElement(int A[], int n, int elem) 2 { 3 int fast = 0, slow = 0; 4 5 while (fast < n) 6 { 7 if (elem != A[fast]) 8 { 9 A[slow] = A[fast]; 10 slow++; 11 } 12 fast++; 13 } 14 15 return slow; 16 }
标签：
原文地址：http://www.cnblogs.com/ym65536/p/4249063.html
