Simple java 0ms solution


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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.