26. Remove Duplicates from Sorted Array 11769 ♡ Add to List Easy 8107 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. Share Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements. Return k after placing the final result in the first k slots of nums. Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory. Custom Judge: The judge will test your solution with the following code: int[] nums [...]; // Input array int[] expectedNums = [...]; // The expected answer with correct length int k = removeDuplicates (nums); // Calls your implementation assert k == expectedNums.length; for (int i = 0; i < k; i++) { assert nums [i] == expectedNums [i];

Answer:

Algorithms:

(1). We have create a function name as func and takes arguments array names as nums

(2). next thing we have initialized count as 1 to count the how many duplicate number

(3). using the for loop we have check if two array is same or not because they are sorted. if two element is not same then next array element put the previous element  and count by 1 and so on 

(4). return the count in the function 

(5).Last function is call the function and then print it