LeetCode 27. Remove Element

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.

這個題的意思是說,要在給定的數(shù)組中,刪除指定的數(shù)字,并且,把剩下的數(shù)字,放在數(shù)組的前方。

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";
    }
};

最后編輯于
?著作權歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點,簡書系信息發(fā)布平臺,僅提供信息存儲服務。

推薦閱讀更多精彩內(nèi)容