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.
问题描述:就是给定一个数组和一个值value,要将数组中所有等于value的“移除”并返回新的数组长度。要求不能创建新的数组,数组内元素的顺序可以改变,最后数组里剩下什么没有所谓。
解题思路:问题的话比较简单。根据问题描述,我们可以将数组中等于value的值全部设为一个很小的数,并且计数,最后再对数组进行从大到小的排序,就ok了,代码如下
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int length = nums.size();
for(int t=0;t<nums.size();t++){
if(nums[t]==val){
nums[t]=-100;
length -= 1;
}
}
for(int i=0;i<nums.size();i++){
for(int j=i+1;j<nums.size();j++){
if(nums[i]<nums[j]){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
}
return length;
}
};