//這種發(fā)放適用于string,int,float等切片，會對切片中的元素進行排序
func SliceRemoveDuplicates(slice []string) []string {
  sort.Strings(slice)
  i:= 0
  var j int
  for{
    if i >= len(slice)-1 {
     break
    }
 
    for j = i + 1; j < len(slice) && slice[i] == slice[j]; j++ {
    }
    slice= append(slice[:i+1], slice[j:]...)
    i++
  }
  return slice
}

func RemoveDuplicate(list *[]int) []int {
  var x []int = []int{}
  for _, i := range *list {
    if len(x) == 0 {
     x = append(x, i)
    } else {
     for k, v := range x {
       if i == v {
         break
       }
       if k == len(x)-1 {
         x = append(x,i)
       }
     }
    }
  }
  return x
}

package main
import (
	"log"
	LogHandleStu "github.com/yangshun2005/stu_golang/src/stu_view/3-1-LogHandles"
)
func main() {
	//
	LogHandleStu.LogHandleStu01()
	nums := []int{0, 0, 1, 1, 1, 2, 2, 3, 3, 4}
	removeDuplicates01(nums)
	//fmt.Println(removeDuplicates02(nums))
}
//算法一
func removeDuplicates01(nums []int) (rest []int) {
	for i := len(nums) - 1; i >= 0 && i < len(nums); {
		//fmt.Println(i)
		if nums[i] == nums[i-1] {
			//fmt.Println(nums)
			nums = append(nums[:i], nums[i+1:]...)
			//fmt.Println(nums)
		} else {
			i--
		}
	}
	log.Println(nums)
	return nums
}
`推薦`
//算法2 
func removeDuplicates02(nums []int) int {
	for i := 0; i+1 < len(nums); {
		if nums[i] == nums[i+1] {
			nums = append(nums[:i], nums[i+1:]...)
		} else {
			i++
		}
	}
	log.Println(nums)
	return len(nums)
}