Java [leetcode 27]Remove Element

题目描述：

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

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

解题思路：

遍历即可。

代码如下：

public int removeElement(int[] nums, int val) {
		int length = nums.length;
		int count = 0;
		if(length == 0)
			return 0;
		for(int i = 0; i < nums.length; i++){
			if(nums[i] != val){
				nums[count] = nums[i];
				count++;
			}else{
				continue;
			}
		}
		return count;
	}

 

转载于:https://www.cnblogs.com/zihaowang/p/4506806.html