小白笔记--------------------leetcode27. Remove Element

public class Solution {
public int removeElement(int[] nums, int val) {
int count = 0;
int result = 0;
int s = nums.length;
int j = 0;
for(int i = 0 ; i < nums.length;i++){
if(nums[i] != val){
nums[j] = nums[i];
j++;

}else{
count++;
}

}
result = s - count;

return result;
}
}