每天一个小程序（十）--- Remove Element

RemoveElement

俺の命は君のものだ、アスナ、だから君のために使う、最后の一瞬まで一绪にいよう。

前言：

晕哦，最近好忙，还封网了，今天一看连leetcode都上不去了，只有拿点存货出来

---

package array;

/**
 * @author BlackSugar
 * @date 2019/4/16
 * Given an array nums and a value val, remove all instances of that value in-place and return the new length.
 * <p>
 * Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
 * <p>
 * The order of elements can be changed. It doesn't matter what you leave beyond the new length.
 * <p>
 * Example 1:
 * <p>
 * Given nums = [3,2,2,3], val = 3,
 * <p>
 * Your function should return length = 2, with the first two elements of nums being 2.
 * <p>
 * It doesn't matter what you leave beyond the returned length.
 * Example 2:
 * <p>
 * Given nums = [0,1,2,2,3,0,4,2], val = 2,
 * <p>
 * Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
 * <p>
 * Note that the order of those five elements can be arbitrary.
 * <p>
 * It doesn't matter what values are set beyond the returned length.
 * Clarification:
 * <p>
 * Confused why the returned value is an integer but your answer is an array?
 * <p>
 * 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.
 * <p>
 * Internally you can think of this:
 * <p>
 * // nums is passed in by reference. (i.e., without making a copy)
 * int len = removeElement(nums, val);
 * <p>
 * // 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]);
 * }
 */
public class RemoveElement {
    /**
     * int数组隐藏目标参数
     * 思路：由于要求O(1)空间复杂度，因此没办法真正改变int数组，而是跳过目标数字，在前n个放入非目标数字，不用管后面的数字
     * 遍历数组，若和目标参数相等则跳过，返回新数组不相等数字的长度
     *
     * @param nums
     * @param val
     * @return
     */
    public int removeElement(int[] nums, int val) {
        int preIndex;
        int currentIndex = 0;
        for (preIndex = 0; preIndex < nums.length; preIndex++) {
            if (nums[preIndex] != val) {
                nums[currentIndex] = nums[preIndex];
                currentIndex++;
            }
        }
        return currentIndex;
    }

    public static void main(String[] args) {
        int[] array = new int[]{1, 2, 2, 3};
        int len = new RemoveElement().removeElement(array, 2);
        System.out.println("length: " + len);
        for (int i = 0; i < len; i++) {
            System.out.print(array[i]);
        }
        System.out.println();
    }
}

总结：

这道题很多人点了 ?，因为要求只能用O(1)的空间复杂度，这个完全打乱了原始数组，某种意义上算是cheat，采用双指针，一个遍历，一个记录当前位置即可

1、时间复杂度O(n)
2、空间复杂度O(1)