首页 > 其他 > 详细

【LeetCode】027. Remove Element

时间:2017-04-23 14:11:04      阅读:280      评论:0      收藏:0      [点我收藏+]

题目:

Given an array and a value, remove all instances of that value in place and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

The order of elements can be changed. It doesn‘t matter what you leave beyond the new length.

Example:

Given input array nums = [3,2,2,3], val = 3

  

题解:

  这个题和之前的题类似,难度不大

Solution 1 ()

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int n = nums.size();
        int cnt = 0;
        for(int i=0; i<n;i++) {
            if(nums[i] == val) cnt++;
            else {
                nums[i - cnt] = nums[i];
            }
        } 
        return n - cnt;
    }
};

 

Solution 2 ()

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int len = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] != val) nums[len++] = nums[i];
        }
        return len;
    }
};

 

【LeetCode】027. Remove Element

原文:http://www.cnblogs.com/Atanisi/p/6752342.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!