LeetCode----- 27.Remove Element

Given an array and a value, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Example:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

给定一个数组和一个值，就地删除该值的所有实例并返回新的长度。不要为其他数组分配额外的空间，您必须通过在O（1）额外的内存中就地修改输入数组来实现这一点。元素的顺序可以改变。 无论你离开新的长度，都没有关系。

代码如下：

public class RemoveElement {
	public static void main(String[] args) {
		int[] nums = new int[]{3,2,2,3};
		System.out.println(removeElement(nums, 3));
	}
	
    public static int removeElement(int[] nums, int val) {
    	if(nums.length == 0) {
    		return 0;
    	}
    	int result = 0;
    	for(int i=0;i<nums.length;i++) {
    		if(nums[i] != val) {	
    			nums[result] = nums[i];
    			result++;
    		}
    	}
    	return result;
    }

}