radixSort golang 基数排序

radixSort.go

func radixSort(nums []int) []int{
    maxValue := maxValueOfList(nums...)
    a := 1
    for k:=0;a<=maxValue;k++{
        buckets := map[int][]int{}
        for i:=0;i<10;i++{
            buckets[i] = []int{}
        }
       
        for _,num := range nums{
            d := num / a % 10
            buckets[d] = append(buckets[d], num)
        }
        
        nums = []int{}
        for v:=0;v<10;v++{
            nums = append(nums, buckets[v]...)
        }
         a *= 10
        
    }
    return nums

}