leetcode 27. Remove Element(Easy) 移除元素

1. 描述

• Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.
  Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.
  Return k after placing the final result in the first k slots of nums.
  Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
• 给你一个数组 nums 和一个值 val，你需要 原地 移除所有数值等于 val 的元素，并返回移除后数组的新长度。
  不要使用额外的数组空间，你必须仅使用 O(1) 额外空间并 原地 修改输入数组。
  元素的顺序可以改变。你不需要考虑数组中超出新长度后面的元素。

2. 分析

本题思路为遍历数组，发现与val不等的值就放到数组头部，故需要两个指针，fast指针用于遍历数组，slow指针指向数组头部下一元素放入的位置

3. 代码

class Solution{
	public int removeElement(int[] nums, int val){
		// corner case
		if(nums.length == 0) return 0;
		int fast, slow;
		fast = slow = 0;
		while(fast < nums.length){
			if(nums[fast] != val){
				nums[slow++] = nums[fast];
			}
			fast++;
		}
		return slow;
	}
}