11.8---维护x的秩（CC150）

    
    public static int[] getRankOfNumber(int[] a, int n){
        int[] res = new int[n];
        HashSet<Integer> hash = new HashSet();
        for(int i = 0; i < n;i++){
            int num = 0;
            for(int tmp : hash){
                if(tmp <= a[i]){
                    num++;
                }
            }
            hash.add(a[i]);
            res[i] = num;
        }
        
        
        
        
        return res;
    }