Leetcode Remove duplicates from Sorted array (removes repeating numbers in an ordered array)

title Link: https://leetcode.com/problems/remove-duplicates-from-sorted-array/?tab=DescriptionRemoves duplicate numbers from an ordered array and returns the number of non-repeating numbers traversal operation: You can use the new for loop for (int n:nums) {} to compare each time, and update the subscript of the first encountered unequal element to the I array for the re-assignment operation when the arrays are longer than 1 o'clock, The ANS initial value is 1, and when the array length is 0 o'clock, the 0 reference code is returned:

 Packageleetcode_50;/*** *  * @authorPengfei_zheng * Remove duplicate elements from an ordered array*/ Public classSolution26 { Public intRemoveDuplicates (int[] nums) {        if(nums.length==0)return0; inti = 1;  for(intn:nums)if(n > Nums[i-1])//if satisfied, the description does not repeatnums[i++] = n;//Update I        returni; }}

Leetcode Remove duplicates from Sorted array (removes repeating numbers in an ordered array)