对一组包含k种颜色的n个对象进行排序，本解法使用桶排序，时间复杂度为O(nlogn),空间复杂度为O(1) -For a group that contains k colors to sort n objects, this solution using bucket sort, the time complexity is O (nlogn), space complexity is O (1)