LeetCode之Remove Element

来源:互联网 发布:网络教学的优点 编辑:程序博客网 时间:2024/03/29 17:12

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.

class Solution {public:    int removeElement(int A[], int n, int elem) {        int k=0;        for(int i=0;i<n;i++){            if(A[i]==elem) k++;            else A[i-k]=A[i];        }        return n-k;    }};


0 0