java 解法, 执行用时: 0 ms, 内存消耗: 39.1 MB, 提交时间: 2023-11-02 00:24:21

class Solution {
    public int countPoints(String rings) {
        char[] chars = rings.toCharArray();
        int[] num = new int[10];
        for (int i = 0; i < chars.length; i += 2) {
            num[chars[i + 1] - '0'] |= chars[i] == 'R' ? 1 : chars[i] == 'G' ? 2 : 4;
        }

        int count = 0;
        for (int i : num) {
            if (i == 7) {
                count++;
            }
        }
        return count;
    }
}

golang 解法, 执行用时: 0 ms, 内存消耗: 1.9 MB, 提交时间: 2023-11-02 00:24:02

var POLE_NUM, COLOR_NUM = 10, 3

func countPoints(rings string) int {
    state := make([][]int, POLE_NUM)
    for i := 0; i < POLE_NUM; i++ {
        state[i] = make([]int, COLOR_NUM)
    }
    n := len(rings)
    for i := 0; i < n; i += 2 {
        color := rings[i]
        pole_index := rings[i + 1] - '0'
        state[pole_index][getColorId(color)] = 1
    }
    res := 0
    for i := 0; i < POLE_NUM; i++ {
        flag := true
        for j := 0; j < COLOR_NUM; j++ {
            if state[i][j] == 0 {
                flag = false
                break
            }
        }
        if flag {
            res++
        }
    }
    return res
}

func getColorId(color byte) int {
    if color == 'R' {
        return 0
    } else if color == 'G' {
        return 1
    }
    return 2
}

python3 解法, 执行用时: 44 ms, 内存消耗: 16 MB, 提交时间: 2023-11-02 00:23:42

class Solution:
    def countPoints(self, rings: str) -> int:
        def getColorId(color):
            if color == 'R':
                return 0
            elif color == 'G':
                return 1
            else:
                return 2

        POLE_NUM, COLOR_NUM = 10, 3
        state = [[0 for i in range(COLOR_NUM)]  for j in range(POLE_NUM)]
        n = len(rings)
        for i in range(0, n, 2):
            color = rings[i]
            pole_index = ord(rings[i + 1]) - ord('0')
            state[pole_index][getColorId(color)] = 1
        res = 0
        for i in range(POLE_NUM):
            flag = True
            for j in range(COLOR_NUM):
                if state[i][j] == 0:
                    flag = False
                    break
            if flag:
                res += 1
        return res

python3 解法, 执行用时: 28 ms, 内存消耗: 15 MB, 提交时间: 2022-06-02 11:02:27

class Solution:
    def countPoints(self, rings: str) -> int:
        n = len(rings)
        ans = 0
        m = defaultdict(set)
        for i in range(1, n, 2):
            m[rings[i]].add(rings[i-1])
        for _, v in m.items():
            if len(v) == 3:
                ans += 1
        return ans