Last active
April 12, 2021 12:16
-
-
Save deedee47/04801070c8889d863d0b7d393db9e1dd to your computer and use it in GitHub Desktop.
Returns the Count of Distinct Elements from an Sorted Array of Numbers,
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public int uniqueCountOfElements(int[] nums) | |
{ | |
if (nums == null) return 0; | |
int arrSize = nums.length; | |
if (arrSize == 0) return 0; | |
int finalCount = 1; // Count the first element by default | |
for(int count = 0; count < arrSize; count++) | |
{ | |
if (count != arrSize - 1 && nums[count] != nums[count+1]) finalCount++; | |
} | |
return finalCount; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Thank You @meekg33k for setting this up. Very well appreciated.