Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
package leetcode;
public class RemoveElement {
public int removeElement(int[] nums, int val){
int res=0;
for(int i=0; i<nums.length; ++i){
if(nums[i]==val){
res++;
}
else if(res>0){
nums[i-res]=nums[i];
}
}
return nums.length-res;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
}
}