Skip to content

feat: add solutions to lc problem: No.3170 #4466

New issue

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

#

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

Already on GitHub? # to your account

Merged
merged 1 commit into from
Jun 7, 2025
Merged

feat: add solutions to lc problem: No.3170 #4466

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
75 changes: 75 additions & 0 deletions .../3100-3199/3170.Lexicographically Minimum String After Removing Stars/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -235,6 +235,81 @@ function clearStars(s: string): string {
}
```

#### Rust

```rust
impl Solution {
pub fn clear_stars(s: String) -> String {
let n = s.len();
let s_bytes = s.as_bytes();
let mut g: Vec<Vec<usize>> = vec![vec![]; 26];
let mut rem = vec![false; n];
let chars: Vec<char> = s.chars().collect();

for (i, &ch) in chars.iter().enumerate() {
if ch == '*' {
rem[i] = true;
for j in 0..26 {
if let Some(idx) = g[j].pop() {
rem[idx] = true;
break;
}
}
} else {
g[(ch as u8 - b'a') as usize].push(i);
}
}

chars
.into_iter()
.enumerate()
.filter_map(|(i, ch)| if !rem[i] { Some(ch) } else { None })
.collect()
}
}
```

#### C#

```cs
public class Solution {
public string ClearStars(string s) {
int n = s.Length;
List<int>[] g = new List<int>[26];
for (int i = 0; i < 26; i++) {
g[i] = new List<int>();
}

bool[] rem = new bool[n];
for (int i = 0; i < n; i++) {
char ch = s[i];
if (ch == '*') {
rem[i] = true;
for (int j = 0; j < 26; j++) {
if (g[j].Count > 0) {
int idx = g[j][g[j].Count - 1];
g[j].RemoveAt(g[j].Count - 1);
rem[idx] = true;
break;
}
}
} else {
g[ch - 'a'].Add(i);
}
}

var ans = new System.Text.StringBuilder();
for (int i = 0; i < n; i++) {
if (!rem[i]) {
ans.Append(s[i]);
}
}

return ans.ToString();
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
75 changes: 75 additions & 0 deletions ...00-3199/3170.Lexicographically Minimum String After Removing Stars/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -233,6 +233,81 @@ function clearStars(s: string): string {
}
```

#### Rust

```rust
impl Solution {
pub fn clear_stars(s: String) -> String {
let n = s.len();
let s_bytes = s.as_bytes();
let mut g: Vec<Vec<usize>> = vec![vec![]; 26];
let mut rem = vec![false; n];
let chars: Vec<char> = s.chars().collect();

for (i, &ch) in chars.iter().enumerate() {
if ch == '*' {
rem[i] = true;
for j in 0..26 {
if let Some(idx) = g[j].pop() {
rem[idx] = true;
break;
}
}
} else {
g[(ch as u8 - b'a') as usize].push(i);
}
}

chars
.into_iter()
.enumerate()
.filter_map(|(i, ch)| if !rem[i] { Some(ch) } else { None })
.collect()
}
}
```

#### C#

```cs
public class Solution {
public string ClearStars(string s) {
int n = s.Length;
List<int>[] g = new List<int>[26];
for (int i = 0; i < 26; i++) {
g[i] = new List<int>();
}

bool[] rem = new bool[n];
for (int i = 0; i < n; i++) {
char ch = s[i];
if (ch == '*') {
rem[i] = true;
for (int j = 0; j < 26; j++) {
if (g[j].Count > 0) {
int idx = g[j][g[j].Count - 1];
g[j].RemoveAt(g[j].Count - 1);
rem[idx] = true;
break;
}
}
} else {
g[ch - 'a'].Add(i);
}
}

var ans = new System.Text.StringBuilder();
for (int i = 0; i < n; i++) {
if (!rem[i]) {
ans.Append(s[i]);
}
}

return ans.ToString();
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
36 changes: 36 additions & 0 deletions solution/3100-3199/3170.Lexicographically Minimum String After Removing Stars/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
public class Solution {
public string ClearStars(string s) {
int n = s.Length;
List<int>[] g = new List<int>[26];
for (int i = 0; i < 26; i++) {
g[i] = new List<int>();
}

bool[] rem = new bool[n];
for (int i = 0; i < n; i++) {
char ch = s[i];
if (ch == '*') {
rem[i] = true;
for (int j = 0; j < 26; j++) {
if (g[j].Count > 0) {
int idx = g[j][g[j].Count - 1];
g[j].RemoveAt(g[j].Count - 1);
rem[idx] = true;
break;
}
}
} else {
g[ch - 'a'].Add(i);
}
}

var ans = new System.Text.StringBuilder();
for (int i = 0; i < n; i++) {
if (!rem[i]) {
ans.Append(s[i]);
}
}

return ans.ToString();
}
}
29 changes: 29 additions & 0 deletions solution/3100-3199/3170.Lexicographically Minimum String After Removing Stars/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
impl Solution {
pub fn clear_stars(s: String) -> String {
let n = s.len();
let s_bytes = s.as_bytes();
let mut g: Vec<Vec<usize>> = vec![vec![]; 26];
let mut rem = vec![false; n];
let chars: Vec<char> = s.chars().collect();

for (i, &ch) in chars.iter().enumerate() {
if ch == '*' {
rem[i] = true;
for j in 0..26 {
if let Some(idx) = g[j].pop() {
rem[idx] = true;
break;
}
}
} else {
g[(ch as u8 - b'a') as usize].push(i);
}
}

chars
.into_iter()
.enumerate()
.filter_map(|(i, ch)| if !rem[i] { Some(ch) } else { None })
.collect()
}
}