DSA-PS-Java-Programs/RemoveDuplicates.java at master · codec-akash/DSA-PS-Java-Programs · GitHub

34 lines (32 loc) · 991 Bytes

/**

* Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.

*

* Example 1:

*

* Given nums = [1,1,2],

*

* Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

*

* It doesn't matter what you leave beyond the returned length.

* Example 2:

*

* Given nums = [0,0,1,1,1,2,2,3,3,4],

*

* Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

*

* It doesn't matter what values are set beyond the returned length.

*

public class RemoveDuplicates {

public int removeDuplicates(int[] nums) {

if (nums.length == 0) return 0;

int i = 0;

for (int j = 1; j < nums.length; j++) {

if (nums[j] != nums[i]) {

i++;

nums[i] = nums[j];

}

return i + 1;

}

Expand file tree