Skip to content

feat: add solutions to lc problem: No.2273 #4784

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
merged 1 commit into from
Oct 12, 2025
+191 −0
Merged

feat: add solutions to lc problem: No.2273 #4784

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
67 changes: 67 additions & 0 deletions solution/2200-2299/2273.Find Resultant Array After Removing Anagrams/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -230,6 +230,73 @@ function removeAnagrams(words: string[]): string[] {
}
```

#### Rust

```rust
impl Solution {
pub fn remove_anagrams(words: Vec<String>) -> Vec<String> {
fn check(s: &str, t: &str) -> bool {
if s.len() != t.len() {
return true;
}
let mut cnt = [0; 26];
for c in s.bytes() {
cnt[(c - b'a') as usize] += 1;
}
for c in t.bytes() {
let idx = (c - b'a') as usize;
cnt[idx] -= 1;
if cnt[idx] < 0 {
return true;
}
}
false
}

let mut ans = vec![words[0].clone()];
for i in 1..words.len() {
if check(&words[i - 1], &words[i]) {
ans.push(words[i].clone());
}
}
ans
}
}
```

#### JavaScript

```js
/**
* @param {string[]} words
* @return {string[]}
*/
var removeAnagrams = function (words) {
const ans = [words[0]];
const check = (s, t) => {
if (s.length !== t.length) {
return true;
}
const cnt = Array(26).fill(0);
for (const c of s) {
++cnt[c.charCodeAt() - 97];
}
for (const c of t) {
if (--cnt[c.charCodeAt() - 97] < 0) {
return true;
}
}
return false;
};
for (let i = 1; i < words.length; ++i) {
if (check(words[i - 1], words[i])) {
ans.push(words[i]);
}
}
return ans;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
67 changes: 67 additions & 0 deletions solution/2200-2299/2273.Find Resultant Array After Removing Anagrams/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -223,6 +223,73 @@ function removeAnagrams(words: string[]): string[] {
}
```

#### Rust

```rust
impl Solution {
pub fn remove_anagrams(words: Vec<String>) -> Vec<String> {
fn check(s: &str, t: &str) -> bool {
if s.len() != t.len() {
return true;
}
let mut cnt = [0; 26];
for c in s.bytes() {
cnt[(c - b'a') as usize] += 1;
}
for c in t.bytes() {
let idx = (c - b'a') as usize;
cnt[idx] -= 1;
if cnt[idx] < 0 {
return true;
}
}
false
}

let mut ans = vec![words[0].clone()];
for i in 1..words.len() {
if check(&words[i - 1], &words[i]) {
ans.push(words[i].clone());
}
}
ans
}
}
```

#### JavaScript

```js
/**
* @param {string[]} words
* @return {string[]}
*/
var removeAnagrams = function (words) {
const ans = [words[0]];
const check = (s, t) => {
if (s.length !== t.length) {
return true;
}
const cnt = Array(26).fill(0);
for (const c of s) {
++cnt[c.charCodeAt() - 97];
}
for (const c of t) {
if (--cnt[c.charCodeAt() - 97] < 0) {
return true;
}
}
return false;
};
for (let i = 1; i < words.length; ++i) {
if (check(words[i - 1], words[i])) {
ans.push(words[i]);
}
}
return ans;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
28 changes: 28 additions & 0 deletions solution/2200-2299/2273.Find Resultant Array After Removing Anagrams/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
/**
* @param {string[]} words
* @return {string[]}
*/
var removeAnagrams = function (words) {
const ans = [words[0]];
const check = (s, t) => {
if (s.length !== t.length) {
return true;
}
const cnt = Array(26).fill(0);
for (const c of s) {
++cnt[c.charCodeAt() - 97];
}
for (const c of t) {
if (--cnt[c.charCodeAt() - 97] < 0) {
return true;
}
}
return false;
};
for (let i = 1; i < words.length; ++i) {
if (check(words[i - 1], words[i])) {
ans.push(words[i]);
}
}
return ans;
};
29 changes: 29 additions & 0 deletions solution/2200-2299/2273.Find Resultant Array After Removing Anagrams/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 remove_anagrams(words: Vec<String>) -> Vec<String> {
fn check(s: &str, t: &str) -> bool {
if s.len() != t.len() {
return true;
}
let mut cnt = [0; 26];
for c in s.bytes() {
cnt[(c - b'a') as usize] += 1;
}
for c in t.bytes() {
let idx = (c - b'a') as usize;
cnt[idx] -= 1;
if cnt[idx] < 0 {
return true;
}
}
false
}

let mut ans = vec![words[0].clone()];
for i in 1..words.len() {
if check(&words[i - 1], &words[i]) {
ans.push(words[i].clone());
}
}
ans
}
}