[数据结构][Sort]Radix Sort

public class Solution 
{
    public void radixSort(int[] data) 
    {
        for (int position = 0; position <= getMaxDigit(data); position++) 
        {
            int[][] bucket = new int[data.length + 1][10];

            for (int i = 0; i < data.length; i++) 
            {
                int col = 0;

                if (getDigit(data[i]) >= position) 
                {
                    col = (data[i] / (int) Math.pow(10, position)) % 10;
                }

                int row = ++ bucket[0][col];

                bucket[row][col] = data[i];
            }

            for (int count = 0, col = 0; col < 10; col++) 
            {
                for (int row = 1; row <= bucket[0][col]; row++) 
                {
                    data[count++] = bucket[row][col];
                }
            }
        }
    }

    public int getMaxDigit(int[] data) 
    {
        int result = 0;

        for (int item : data) 
        {
            int position = getDigit(item);

            if (position > result) 
            {
                result = position;
            }
        }

        return result;
    }

    public int getDigit(int data) 
    {
        int result = 0;

        for (int i = 10; data / i > 0; i = i * 10) 
        {
            result++;
        }

        return result;
    }
    
}