一、题目

二、代码

class Solution {
    
public:
    int removeElement(vector<int>& nums, int val) {
    
    
      //Variables are used routinely

      int i=0;
      int count_num_sub=0; //用于记录数组的长度 
      int return_count=0;

      //variables in this question
      int size= nums.size();  
      if(size!=0)
        {
    
                int another_num[size];

                for(i=0;i<=size-1;i++)  another_num[i]=0;  //The array is declared and cleared
                
                for(i=0;i<=size-1;i++)   //依次查找 If not removed into another array
                {
    
                    if(nums[i]!=val)  
                    {
    

                    std::cout<<" i "<<  i<<std::endl;

                    another_num[count_num_sub]=nums[i];
                    
                    count_num_sub=count_num_sub+1;
                    }
                }

                return_count=count_num_sub;
                //At this point the final numbers and arrays have been obtained reverse coverage

                for(i=0;i<=size-1;i++)  nums[i]=another_num[i];  //The array is declared and cleared
        }
        else return_count=0;
      return return_count;
    }
};

三、运行结果