Leetcode:27. Remove Element(JAVA)

【问题描述】

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.

【思路】

O(N)时间复杂度内,顺序扫描nums。

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


你可能感兴趣的:(Leetcode)