上次编辑到这里，代码来自缓存 点击恢复默认模板
class Solution {
public:
int maxNumberOfFamilies(int n, vector<vector<int>>& reservedSeats) {
}
};
golang 解法, 执行用时: 88 ms, 内存消耗: 6.9 MB, 提交时间: 2023-09-05 22:03:50
func maxNumberOfFamilies(n int, reservedSeats [][]int) int {
seats := make(map[int]byte)
for k := range reservedSeats {
if 2 <= reservedSeats[k][1] && reservedSeats[k][1] <= 9 {
seats[reservedSeats[k][0]] |= 1 << (reservedSeats[k][1] - 2)
}
}
ans := (n - len(seats)) * 2
for _, seat := range seats {
if ^seat & 0xF == 0xF || ^seat >> 2 & 0xF == 0xF || ^seat >> 4 & 0xF == 0xF {
ans++
}
}
return ans
}
java 解法, 执行用时: 16 ms, 内存消耗: 47.3 MB, 提交时间: 2023-09-05 22:03:19
class Solution {
public int maxNumberOfFamilies(int n, int[][] reservedSeats) {
int left = 0b11110000;
int middle = 0b11000011;
int right = 0b00001111;
Map <Integer, Integer> occupied = new HashMap <Integer, Integer> ();
for (int[] seat: reservedSeats) {
if (seat[1] >= 2 && seat[1] <= 9) {
int origin = occupied.containsKey(seat[0]) ? occupied.get(seat[0]) : 0;
int value = origin | (1 << (seat[1] - 2));
occupied.put(seat[0], value);
}
}
int ans = (n - occupied.size()) * 2;
for (Map.Entry <Integer, Integer> entry : occupied.entrySet()) {
int row = entry.getKey(), bitmask = entry.getValue();
if (((bitmask | left) == left) || ((bitmask | middle) == middle) || ((bitmask | right) == right)) {
++ans;
}
}
return ans;
}
}
python3 解法, 执行用时: 124 ms, 内存消耗: 19.1 MB, 提交时间: 2023-09-05 22:03:03
class Solution:
def maxNumberOfFamilies(self, n: int, reservedSeats: List[List[int]]) -> int:
left, middle, right = 0b11110000, 0b11000011, 0b00001111
occupied = collections.defaultdict(int)
for seat in reservedSeats:
if 2 <= seat[1] <= 9:
occupied[seat[0]] |= (1 << (seat[1] - 2))
ans = (n - len(occupied)) * 2
for row, bitmask in occupied.items():
if (bitmask | left) == left or (bitmask | middle) == middle or (bitmask | right) == right:
ans += 1
return ans
