Leetcode1-100: 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.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeElement(nums, val);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

题目要求： 跟上一题比较相似，输入一个有序数组，和一个目标数字，去掉数组中跟目标元素值相同的元素。注意这题的要求是只返回一个整数，代表数组中前多少个数字是给出的输出，意思就是如果输入[1,1,2,2,3], 1 ,只需要输出结果3，然后数组的前三个元素分别是2，2，3即可（顺序不限）。

解题思路

解题思路也跟上一题，比较相似顺序迭代数组中的元素，然后用一个数字代表当前发现的不等于目标数字的元素的个数，如果遇到不等于目标的元素，赋值并且增加个数即可。

代码实现

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

复杂度分析：

时间复杂度：O(n)
空间复杂度：O(1)