美文网首页ACM题库~
LeetCode 27. Remove Element

LeetCode 27. Remove Element

作者: 关玮琳linSir | 来源:发表于2017-09-08 13:37 被阅读33次

    27. Remove Element

    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

    Your function should return length = 2, with the first two elements of nums being 2.

    这个题的意思是说,要在给定的数组中,删除指定的数字,并且,把剩下的数字,放在数组的前方。

    c++:

    class Solution {
    public:
        int removeElement(std::vector<int>& nums, int val) {
            
            if (nums.size() == 0) {
                return 0;
            }
            
            int count = 0;
            int max = nums.size();
            for(int i=0;i<max;i++){
                if(nums[i] != val){
                    nums[count++] = nums[i];
                }
            }
            return count;
        }
        
        void print(){
            std::cout<<"test";
        }
    };
    
    

    相关文章

      网友评论

        本文标题:LeetCode 27. Remove Element

        本文链接:https://www.haomeiwen.com/subject/uubgjxtx.html