remove element in java leetcode

# program for given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

class Solution {
    public int removeDuplicates(int[] nums) {
        int c=0;
        for (int i=0; i<nums.length-1;i++){
            if (nums[i]==nums[i+1]){
                c++;
                nums[i]=Integer.MAX_VALUE;
            
                
            }

        }
        Arrays.sort(nums);
        return nums.length-c;
    }
}