Rings and Rods

给一个string. 里面有一组组的字符, 第一个是RGB代表颜色,第二个是这个颜色对应的位置[0,9]. 求[0,9]中有几个同时有RGB.

class Solution {
    public int countPoints(String rings) {
        int n = rings.length();
        int[][] ary = new int[10][3];
        for(int i = 0; i < n; i+=2){
            char c = rings.charAt(i);
            char nn = rings.charAt(i + 1);
            if(c == 'R'){
                ary[nn - '0'][0] ++;
            }else if(c == 'G')
                ary[nn - '0'][1]++;
            else
                ary[nn - '0'][2]++;
        }
        int res = 0;
        for(int i = 0; i <= 9; i++) {
            if(ary[i][0] > 0 && ary[i][1] > 0 && ary[i][2] > 0)
                res++;
        }
        return res;
    }
}