码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] #27 Remove Element

时间:2015-06-12 00:38:54      阅读:113      评论:0      收藏:0      [点我收藏+]

标签:

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) {
        if (n <= 0)
            return 0;
        int len = n;
        vector<bool> v;
        for (int i = 0, j = 0; i < n; i++){
            if (A[i] == elem){
                v.push_back(0);
                len--;
            }
            else
                v.push_back(1);
        }
        if (len != n){
            for (int i = 0, j = 0; i < n; i++){
                if(v[i] == 1)
                    A[j++] = A[i];
            }
        }
        return len;
    }
};

 

[LeetCode] #27 Remove Element

标签:

原文地址:http://www.cnblogs.com/Scorpio989/p/4570369.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!