27. Remove Element(1st).java

public class Solution {
    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;
    }
}

27. Remove Element.java

public class Solution {
    public int removeElement(int[] nums, int val) {
        if (nums.length == 0 || nums == null) return 0;
        
        Arrays.sort(nums);
        
        int count = 0;
        for (int i = 0; i < nums.length; i++){
            if (nums[i] < val) {
                continue;
            } else if (nums[i] == val) {
                count++;
            } else {
                nums[i - count] = nums[i];
            }
        }
        
        return nums.length - count;   
    }
}