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.
返回数组长度,并且数组的头两个元素为2,如果数组中只有两种元素,那么返回的元素就是相同的剩余的元素。如果数组里的元素有很多种,,那么返回的元素的顺序则不一定。
public class Solution {
public int removeElement(int[] nums, int val) {
int count=0;
for(int i=0; i<nums.length;i++){
if(nums[i]!=val){
nums[count]=nums[i];
count++;
}else{
continue;
}
}
return count;
}
}