Skip to content

feat: add solutions to lc problem: No.1386 #5356

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
yanglbme merged 1 commit into from
Aug 19, 2026
Merged

feat: add solutions to lc problem: No.1386 #5356

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
87 changes: 87 additions & 0 deletions solution/1300-1399/1386.Cinema Seat Allocation/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -214,6 +214,93 @@ function maxNumberOfFamilies(n: number, reservedSeats: number[][]): number {
}
```

#### Rust

```rust
use std::collections::HashMap;

impl Solution {
pub fn max_number_of_families(n: i32, reserved_seats: Vec<Vec<i32>>) -> i32 {
let mut d: HashMap<i32, i32> = HashMap::new();

for e in reserved_seats {
let row = e[0];
let col = e[1];
let mask = 1 << (10 - col);

d.entry(row)
Comment on lines +227 to +231
.and_modify(|x| *x |= mask)
.or_insert(mask);
}

let masks = [
0b0111100000,
0b0000011110,
0b0001111000,
];

let mut ans = (n - d.len() as i32) * 2;

for mut x in d.values().copied() {
for &mask in &masks {
if (x & mask) == 0 {
x |= mask;
ans += 1;
}
}
}

ans
}
}
```

#### C#

```cs
using System;
using System.Collections.Generic;

public class Solution {
public int MaxNumberOfFamilies(int n, int[][] reservedSeats) {
Dictionary<int, int> d = new Dictionary<int, int>();

foreach (var e in reservedSeats) {
int row = e[0];
int col = e[1];
int mask = 1 << (10 - col);

if (d.ContainsKey(row)) {
d[row] |= mask;
} else {
d[row] = mask;
}
}

int[] masks = {
0b0111100000,
0b0000011110,
0b0001111000
};

int ans = (n - d.Count) * 2;

foreach (int value in d.Values) {
int x = value;

foreach (int mask in masks) {
if ((x & mask) == 0) {
x |= mask;
ans++;
}
}
}

return ans;
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
87 changes: 87 additions & 0 deletions solution/1300-1399/1386.Cinema Seat Allocation/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -212,6 +212,93 @@ function maxNumberOfFamilies(n: number, reservedSeats: number[][]): number {
}
```

#### Rust

```rust
use std::collections::HashMap;

impl Solution {
pub fn max_number_of_families(n: i32, reserved_seats: Vec<Vec<i32>>) -> i32 {
let mut d: HashMap<i32, i32> = HashMap::new();

for e in reserved_seats {
let row = e[0];
let col = e[1];
let mask = 1 << (10 - col);

d.entry(row)
Comment on lines +225 to +229
.and_modify(|x| *x |= mask)
.or_insert(mask);
}

let masks = [
0b0111100000,
0b0000011110,
0b0001111000,
];

let mut ans = (n - d.len() as i32) * 2;

for mut x in d.values().copied() {
for &mask in &masks {
if (x & mask) == 0 {
x |= mask;
ans += 1;
}
}
}

ans
}
}
```

#### C#

```cs
using System;
using System.Collections.Generic;

public class Solution {
public int MaxNumberOfFamilies(int n, int[][] reservedSeats) {
Dictionary<int, int> d = new Dictionary<int, int>();

foreach (var e in reservedSeats) {
int row = e[0];
int col = e[1];
int mask = 1 << (10 - col);

if (d.ContainsKey(row)) {
d[row] |= mask;
} else {
d[row] = mask;
}
}

int[] masks = {
0b0111100000,
0b0000011110,
0b0001111000
};

int ans = (n - d.Count) * 2;

foreach (int value in d.Values) {
int x = value;

foreach (int mask in masks) {
if ((x & mask) == 0) {
x |= mask;
ans++;
}
}
}

return ans;
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
41 changes: 41 additions & 0 deletions solution/1300-1399/1386.Cinema Seat Allocation/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
using System;
using System.Collections.Generic;

public class Solution {
public int MaxNumberOfFamilies(int n, int[][] reservedSeats) {
Dictionary<int, int> d = new Dictionary<int, int>();

foreach (var e in reservedSeats) {
int row = e[0];
int col = e[1];
int mask = 1 << (10 - col);

if (d.ContainsKey(row)) {
d[row] |= mask;
} else {
d[row] = mask;
}
}

int[] masks = {
0b0111100000,
0b0000011110,
0b0001111000
};

int ans = (n - d.Count) * 2;

foreach (int value in d.Values) {
int x = value;

foreach (int mask in masks) {
if ((x & mask) == 0) {
x |= mask;
ans++;
}
}
}

return ans;
}
}
30 changes: 30 additions & 0 deletions solution/1300-1399/1386.Cinema Seat Allocation/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
use std::collections::HashMap;

impl Solution {
pub fn max_number_of_families(n: i32, reserved_seats: Vec<Vec<i32>>) -> i32 {
let mut d: HashMap<i32, i32> = HashMap::new();

for e in reserved_seats {
let row = e[0];
let col = e[1];
let mask = 1 << (10 - col);

d.entry(row).and_modify(|x| *x |= mask).or_insert(mask);
}

let masks = [0b0111100000, 0b0000011110, 0b0001111000];

let mut ans = (n - d.len() as i32) * 2;

for mut x in d.values().copied() {
for &mask in &masks {
if (x & mask) == 0 {
x |= mask;
ans += 1;
}
}
}

ans
}
}
Loading