2023.11.2力扣每日一题

力扣2103

class Solution {
    public int countPoints(String rings) {
        int count = 0;
        Map<Integer, Set<Character>> map = new HashMap<>();
        char[] ch = rings.toCharArray();
        for (int i = 0; i < ch.length; i += 2) {
            char c1 = ch[i];
            char c2 = ch[i + 1];
            int index = c2 - '0';
            Set<Character> set = map.getOrDefault(index, new HashSet<>());
            if (set.size() == 2 && !set.contains(c1)) {
                count++;
            }
            set.add(c1);
            map.put(index, set);
        }
        return count;
    }
}

思路：

用Set集合去记录 红绿蓝 三种颜色是否已经存在的状态

class Solution {
    public int countPoints(String rings) {
        int count = 0;
        Map<Integer, Integer> map = new HashMap<>();
        char[] ch = rings.toCharArray();
        for (int i = 0; i < ch.length; i += 2) {
            char c1 = ch[i];
            char c2 = ch[i + 1];
            int index = c2 - '0';
            int num = map.getOrDefault(index, 0);
            if (num != 7 && (num | charToInt(c1)) == 7) {
                count++;
            }
            num |= charToInt(c1);
            map.put(index, num);
        }
        return count;
    }
    public int charToInt(char c) {
        if (c == 'R') {
            return 1;
        } else if (c == 'G') {
            return 2;
        } else {
            return 4;
        }
    }
}

思路

位运算 则0(000)-7(111)之间的数 就可以代表三种颜色是否存在的状态 节省空间