Skip to content

feat: add rust solution to lc problem: No.3531 #4896

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
Dec 10, 2025
+260 −0
Merged

feat: add rust solution to lc problem: No.3531 #4896

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
90 changes: 90 additions & 0 deletions solution/3500-3599/3531.Count Covered Buildings/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -297,6 +297,96 @@ function countCoveredBuildings(n: number, buildings: number[][]): number {
}
```

#### Rust

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

impl Solution {
pub fn count_covered_buildings(_n: i32, buildings: Vec<Vec<i32>>) -> i32 {
let mut g1: HashMap<i32, Vec<i32>> = HashMap::new();
let mut g2: HashMap<i32, Vec<i32>> = HashMap::new();

for b in &buildings {
let x = b[0];
let y = b[1];
g1.entry(x).or_insert(Vec::new()).push(y);
g2.entry(y).or_insert(Vec::new()).push(x);
}

for v in g1.values_mut() {
v.sort();
}
for v in g2.values_mut() {
v.sort();
}

let mut ans: i32 = 0;

for b in &buildings {
let x = b[0];
let y = b[1];

let l1 = g1.get(&x).unwrap();
let l2 = g2.get(&y).unwrap();

if l2[0] < x && x < l2[l2.len() - 1] && l1[0] < y && y < l1[l1.len() - 1] {
ans += 1;
}
}

ans
}
}
```

#### C#

```cs
public class Solution {
public int CountCoveredBuildings(int n, int[][] buildings) {
var g1 = new Dictionary<int, List<int>>();
var g2 = new Dictionary<int, List<int>>();

foreach (var b in buildings) {
int x = b[0], y = b[1];

if (!g1.ContainsKey(x)) {
g1[x] = new List<int>();
}
g1[x].Add(y);

if (!g2.ContainsKey(y)) {
g2[y] = new List<int>();
}
g2[y].Add(x);
}

foreach (var kv in g1) {
kv.Value.Sort();
}
foreach (var kv in g2) {
kv.Value.Sort();
}

int ans = 0;

foreach (var b in buildings) {
int x = b[0], y = b[1];
var l1 = g1[x];
var l2 = g2[y];

if (l2[0] < x && x < l2[l2.Count - 1] &&
l1[0] < y && y < l1[l1.Count - 1]) {
ans++;
}
}

return ans;
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
90 changes: 90 additions & 0 deletions solution/3500-3599/3531.Count Covered Buildings/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -295,6 +295,96 @@ function countCoveredBuildings(n: number, buildings: number[][]): number {
}
```

#### Rust

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

impl Solution {
pub fn count_covered_buildings(_n: i32, buildings: Vec<Vec<i32>>) -> i32 {
let mut g1: HashMap<i32, Vec<i32>> = HashMap::new();
let mut g2: HashMap<i32, Vec<i32>> = HashMap::new();

for b in &buildings {
let x = b[0];
let y = b[1];
g1.entry(x).or_insert(Vec::new()).push(y);
g2.entry(y).or_insert(Vec::new()).push(x);
}

for v in g1.values_mut() {
v.sort();
}
for v in g2.values_mut() {
v.sort();
}

let mut ans: i32 = 0;

for b in &buildings {
let x = b[0];
let y = b[1];

let l1 = g1.get(&x).unwrap();
let l2 = g2.get(&y).unwrap();

if l2[0] < x && x < l2[l2.len() - 1] && l1[0] < y && y < l1[l1.len() - 1] {
ans += 1;
}
}

ans
}
}
```

#### C#

```cs
public class Solution {
public int CountCoveredBuildings(int n, int[][] buildings) {
var g1 = new Dictionary<int, List<int>>();
var g2 = new Dictionary<int, List<int>>();

foreach (var b in buildings) {
int x = b[0], y = b[1];

if (!g1.ContainsKey(x)) {
g1[x] = new List<int>();
}
g1[x].Add(y);

if (!g2.ContainsKey(y)) {
g2[y] = new List<int>();
}
g2[y].Add(x);
}

foreach (var kv in g1) {
kv.Value.Sort();
}
foreach (var kv in g2) {
kv.Value.Sort();
}

int ans = 0;

foreach (var b in buildings) {
int x = b[0], y = b[1];
var l1 = g1[x];
var l2 = g2[y];

if (l2[0] < x && x < l2[l2.Count - 1] &&
l1[0] < y && y < l1[l1.Count - 1]) {
ans++;
}
}

return ans;
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
42 changes: 42 additions & 0 deletions solution/3500-3599/3531.Count Covered Buildings/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,42 @@
public class Solution {
public int CountCoveredBuildings(int n, int[][] buildings) {
var g1 = new Dictionary<int, List<int>>();
var g2 = new Dictionary<int, List<int>>();

foreach (var b in buildings) {
int x = b[0], y = b[1];

if (!g1.ContainsKey(x)) {
g1[x] = new List<int>();
}
g1[x].Add(y);

if (!g2.ContainsKey(y)) {
g2[y] = new List<int>();
}
g2[y].Add(x);
}

foreach (var kv in g1) {
kv.Value.Sort();
}
foreach (var kv in g2) {
kv.Value.Sort();
}

int ans = 0;

foreach (var b in buildings) {
int x = b[0], y = b[1];
var l1 = g1[x];
var l2 = g2[y];

if (l2[0] < x && x < l2[l2.Count - 1] &&
l1[0] < y && y < l1[l1.Count - 1]) {
ans++;
}
}

return ans;
}
}
38 changes: 38 additions & 0 deletions solution/3500-3599/3531.Count Covered Buildings/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
use std::collections::HashMap;

impl Solution {
pub fn count_covered_buildings(_n: i32, buildings: Vec<Vec<i32>>) -> i32 {
let mut g1: HashMap<i32, Vec<i32>> = HashMap::new();
let mut g2: HashMap<i32, Vec<i32>> = HashMap::new();

for b in &buildings {
let x = b[0];
let y = b[1];
g1.entry(x).or_insert(Vec::new()).push(y);
g2.entry(y).or_insert(Vec::new()).push(x);
}

for v in g1.values_mut() {
v.sort();
}
for v in g2.values_mut() {
v.sort();
}

let mut ans: i32 = 0;

for b in &buildings {
let x = b[0];
let y = b[1];

let l1 = g1.get(&x).unwrap();
let l2 = g2.get(&y).unwrap();

if l2[0] < x && x < l2[l2.len() - 1] && l1[0] < y && y < l1[l1.len() - 1] {
ans += 1;
}
}

ans
}
}
Loading