[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 in place with constant memory.

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

Example:

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

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

分析：删除一个数组中的特定值

解题思路：将不含val的数组重新赋值，并记录count数量。

public int removeElement(int[] nums, int val) {
int length=nums.length;
//考虑除去数组长度为0的情况
if(length==0){
return 0;
}

int[] array=new int[length];
int count=0;
//将不含特定元素的数组重新赋给一个新的数组
for(int i=0;i<length;i++){
if(nums[i]!=val){
array[count++]=nums[i];
}
}
//重新将数组的元素赋值到原数组中
for(int i=0;i<count;i++){
nums[i]=array[i];
}
return count;
}