// [3,2,2,3] 3 [2,2]
// [0,1,2,2,3,0,4,2] 2 [0,1,3,0,4]
// k是非val的元素个数,
pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
let mut k = 0;
for i in 0..nums.len() {// 遍历数组
if nums[i] != val {// 如果当前元素不是val,则将其放入nums[k]中
nums[k] = nums[i];// 放入nums[k]中
k += 1;// k加1
}
}
k as i32
}
fn main() {
assert_eq!(remove_element(&mut vec![3, 2, 2, 3], 3), 2);
assert_eq!(remove_element(&mut vec![0, 1, 2, 2, 3, 0, 4, 2], 2), 5);
}