Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
46 changes: 46 additions & 0 deletions solution/3600-3699/3606.Coupon Code Validator/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -305,6 +305,52 @@ function validateCoupons(code: string[], businessLine: string[], isActive: boole
}
```

#### Rust

```rust
use std::collections::HashSet;

impl Solution {
pub fn validate_coupons(
code: Vec<String>,
business_line: Vec<String>,
is_active: Vec<bool>,
) -> Vec<String> {
fn check(s: &str) -> bool {
if s.is_empty() {
return false;
}
s.chars()
.all(|c| c.is_ascii_alphanumeric() || c == '_')
}

let bs: HashSet<&str> =
["electronics", "grocery", "pharmacy", "restaurant"]
.iter()
.copied()
.collect();

let mut idx: Vec<usize> = Vec::new();
for i in 0..code.len() {
if is_active[i] && bs.contains(business_line[i].as_str()) && check(&code[i]) {
idx.push(i);
}
}

idx.sort_by(|&i, &j| {
let cmp = business_line[i].cmp(&business_line[j]);
if cmp == std::cmp::Ordering::Equal {
code[i].cmp(&code[j])
} else {
cmp
}
});

idx.into_iter().map(|i| code[i].clone()).collect()
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
46 changes: 46 additions & 0 deletions solution/3600-3699/3606.Coupon Code Validator/README_EN.md
Original file line number Diff line number Diff line change
Expand Up @@ -298,6 +298,52 @@ function validateCoupons(code: string[], businessLine: string[], isActive: boole
}
```

#### Rust

```rust
use std::collections::HashSet;

impl Solution {
pub fn validate_coupons(
code: Vec<String>,
business_line: Vec<String>,
is_active: Vec<bool>,
) -> Vec<String> {
fn check(s: &str) -> bool {
if s.is_empty() {
return false;
}
s.chars()
.all(|c| c.is_ascii_alphanumeric() || c == '_')
}

let bs: HashSet<&str> =
["electronics", "grocery", "pharmacy", "restaurant"]
.iter()
.copied()
.collect();

let mut idx: Vec<usize> = Vec::new();
for i in 0..code.len() {
if is_active[i] && bs.contains(business_line[i].as_str()) && check(&code[i]) {
idx.push(i);
}
}

idx.sort_by(|&i, &j| {
let cmp = business_line[i].cmp(&business_line[j]);
if cmp == std::cmp::Ordering::Equal {
code[i].cmp(&code[j])
} else {
cmp
}
});

idx.into_iter().map(|i| code[i].clone()).collect()
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
41 changes: 41 additions & 0 deletions solution/3600-3699/3606.Coupon Code Validator/Solution.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
use std::collections::HashSet;

impl Solution {
pub fn validate_coupons(
code: Vec<String>,
business_line: Vec<String>,
is_active: Vec<bool>,
) -> Vec<String> {
fn check(s: &str) -> bool {
if s.is_empty() {
return false;
}
s.chars()
.all(|c| c.is_ascii_alphanumeric() || c == '_')
}

let bs: HashSet<&str> =
["electronics", "grocery", "pharmacy", "restaurant"]
.iter()
.copied()
.collect();

let mut idx: Vec<usize> = Vec::new();
for i in 0..code.len() {
if is_active[i] && bs.contains(business_line[i].as_str()) && check(&code[i]) {
idx.push(i);
}
}

idx.sort_by(|&i, &j| {
let cmp = business_line[i].cmp(&business_line[j]);
if cmp == std::cmp::Ordering::Equal {
code[i].cmp(&code[j])
} else {
cmp
}
});

idx.into_iter().map(|i| code[i].clone()).collect()
}
}