LeetCode【#27】Remove Element（移除元素）

题目链接:

点击跳转

 

题目：

Given an array nums and a value val, 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 1:

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

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

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,1,2,2,3,0,4,2], val = 2,

Your function should return length = 5, with the first five elements of nums containing 0, 1,3, 0, and 4.

Note that the order of those five elements can be arbitrary.

It doesn't matter what values are set beyond the returned length.

题目分析：

给定一个整型数组和一个数值，将数组中等于该数值的值都去掉，求出此时的数组长度和在原数组的基础上，保留剩下的数。（数组大于返回长度的后面值不用管）。

 

解题思路：

遍历一遍数组，初始化一个计数res，如果相等，++res。如果不等，而且res 不为0，说明之前有应该移除的数，那么该位置的数应该前移，同时往前移动几位由 res 决定。

该方法的时间复杂度是O(n)，而且没有用到额外的空间。

 

AC代码：（Java）

class Solution {
    public int removeElement(int[] nums, int val) {
        int len = nums.length;
        int res = 0;
        for(int i = 0;i < len;++i)
        {
            if(res != 0)
            {
                nums[i-res] = nums[i];
            }
            
            if(nums[i] == val)
            {
                ++res;
            }
            
        }
        return len-res;
    }
}