首页 > 代码库 > 【Leetcode】Remove Element

【Leetcode】Remove Element

 

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. 

 

1st (2 tries)

class Solution {public:    int removeElement(int A[], int n, int elem)     {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int i,j;        for(i = 0;i < n;++i)        {            if(A[i] == elem)            {                for(j = i+1;j < n;++j)                {                    A[j-1] = A[j];                }                --n;                --i;            }        }        return n;    }};

  

2nd(2 tries)

class Solution {public:    int removeElement(int A[], int n, int elem) {        //swap to the end;        int start = 0,end = n-1;        for(int i = start;i <= end;i++) {            if(A[i] == elem) {                swap(A[i--],A[end--]);            }        }        return end - start + 1;    }};