The order of elements can be changed. It doesn‘t matter what you leave beyond the new length.
代码:
class Solution { public: int removeElement(int A[], int n, int elem) { for (int i = 0; i < n; ++i) { if (A[i] == elem) { for (int j = i; j < n; ++j) { A[j] = A[j+1]; } n--; i--; } } return n; } };
原文:http://blog.csdn.net/xujian_2014/article/details/44916045