[leedcode]–
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.
public class RemoveElement {
public static int removeElement(int nums[],int val){
int j =0;
for(int i =0;i<nums.length;i++){
if(nums[i] != val){
nums[j] = nums[i];
j++;
}
}
return j;
}
public static void main(String[] args) {
int nums[] ={3,2,2,3};
int val =3;
int lengthOfNew=removeElement(nums,val);
System.out.println(lengthOfNew);
}
}
//搞不懂为什么对结果的数组也要验证的,果然大家觉得题不好是有原因的;