Implementation of go language for deleting duplicate items in sorting array

The goal is ： Delete duplicates in sort array

---

To give you one Ascending order Array of nums , Would you please In situ Delete duplicate elements , Make each element Only once , Returns the new length of the deleted array . Elemental Relative order It should be maintained Agreement .

Because the length of an array cannot be changed in some languages , So you have to put the result in an array nums The first part of . More formally , If there is... After deleting duplicates k Elements , that nums Before k An element should hold the final result .

Insert the final result into nums Before k Return to... After a position k .

Don't use extra space , You must be there. In situ Modify input array And using O(1) Complete with extra space .

author ： Power button (LeetCode)
link ：https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2gy9m/
source ： Power button （LeetCode）
The copyright belongs to the author . Commercial reprint please contact the author for authorization , Non-commercial reprint please indicate the source .

Result output ：

---

// Double pointer 
func removeDuplicates(nums []int) int {
    
	//len（） Take the length of the array 
     if (len(nums) == 0){
    
             return 0
         }
          slow,fast := 0,0
         for ; fast < len(nums); fast++{
    
             if (nums[fast] != nums[slow]){
    
                 slow++
                 nums[slow] = nums[fast]
             }
         }
         return slow+1
}