672. Bulb Switcher II ¶ Time: $O(1)$ Space: $O(1)$ C++JavaPython 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15class Solution { public: int flipLights(int n, int m) { n = min(n, 3); if (m == 0) return 1; if (m == 1) return vector{2, 3, 4}[n - 1]; if (m == 2) return vector{2, 4, 7}[n - 1]; return pow(2, n); } }; 1 2 3 4 5 6 7 8 9 10 11 12 13 14class Solution { public int flipLights(int n, int m) { n = Math.min(n, 3); if (m == 0) return 1; if (m == 1) return new int[] {2, 3, 4}[n - 1]; if (m == 2) return new int[] {2, 4, 7}[n - 1]; return (int) Math.pow(2, n); } } 1 2 3 4 5 6 7 8 9 10 11 12class Solution: def flipLights(self, n: int, m: int) -> int: n = min(n, 3) if m == 0: return 1 if m == 1: return [2, 3, 4][n - 1] if m == 2: return [2, 4, 7][n - 1] return [2, 4, 8][n - 1]