Nice and short O(n) in Java


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

Log in to reply
 

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