27 delete elements
·data-structure-and-algorithm
#array
27.移除元素
cpp:
class Solution {
public:
int removeElement(vector<int>& nums, int val)
{
int slow = 0; //创建慢指针
for (int fast = 0; fast < nums.size(); fast++)
{
if (nums[fast] != val) //快指针先遍历
{
nums[slow] = nums[fast]; //如果没找到要删除的,就赋值并右移慢指针
slow++;
}
}
return slow;
}
};
go:
func removeElement(nums []int, val int) int {
slow := 0
for fast := 0; fast < len(nums); fast++ {
if nums[fast] != val {
nums[slow] = nums[fast]
slow++
}
}
return slow
}