Skip to content
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

fix: update solutions to lc problem: No.0677 #4276

Merged
merged 1 commit into from
Mar 21, 2025
Merged

fix: update solutions to lc problem: No.0677 #4276

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
127 changes: 43 additions & 84 deletions solution/0600-0699/0676.Implement Magic Dictionary/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -431,124 +431,83 @@ class MagicDictionary {

```rust
struct Trie {
children: Vec<Option<Box<Trie>>>,
val: i32,
children: [Option<Box<Trie>>; 26],
is_end: bool,
}

impl Trie {
fn new() -> Self {
Trie {
children: (0..26).map(|_| None).collect(),
val: 0,
children: Default::default(),
is_end: false,
}
}

fn insert(&mut self, w: &str, x: i32) {
fn insert(&mut self, w: &str) {
let mut node = self;
for c in w.chars() {
let idx = (c as usize) - ('a' as usize);
if node.children[idx].is_none() {
node.children[idx] = Some(Box::new(Trie::new()));
let i = (c as usize) - ('a' as usize);
if node.children[i].is_none() {
node.children[i] = Some(Box::new(Trie::new()));
}
node = node.children[idx].as_mut().unwrap();
node.val += x;
node = node.children[i].as_mut().unwrap();
}
node.is_end = true;
}

fn search(&self, w: &str) -> i32 {
let mut node = self;
for c in w.chars() {
let idx = (c as usize) - ('a' as usize);
if node.children[idx].is_none() {
return 0;
}
node = node.children[idx].as_ref().unwrap();
}
node.val
fn search(&self, w: &str) -> bool {
self.dfs(w, 0, 0)
}
}

struct MapSum {
d: std::collections::HashMap<String, i32>,
trie: Trie,
}

impl MapSum {
fn new() -> Self {
MapSum {
d: std::collections::HashMap::new(),
trie: Trie::new(),
fn dfs(&self, w: &str, i: usize, diff: usize) -> bool {
if i == w.len() {
return diff == 1 && self.is_end;
}
}

fn insert(&mut self, key: String, val: i32) {
let x = val - self.d.get(&key).unwrap_or(&0);
self.d.insert(key.clone(), val);
self.trie.insert(&key, x);
}

fn sum(&self, prefix: String) -> i32 {
self.trie.search(&prefix)
}
}
```

#### C#

```cs
public class Trie {
private Trie[] children = new Trie[26];
private int val;
let j = (w.chars().nth(i).unwrap() as usize) - ('a' as usize);

public void Insert(string w, int x) {
Trie node = this;
for (int i = 0; i < w.Length; ++i) {
int idx = w[i] - 'a';
if (node.children[idx] == null) {
node.children[idx] = new Trie();
if let Some(child) = &self.children[j] {
if child.dfs(w, i + 1, diff) {
return true;
}
node = node.children[idx];
node.val += x;
}
}

public int Search(string w) {
Trie node = this;
for (int i = 0; i < w.Length; ++i) {
int idx = w[i] - 'a';
if (node.children[idx] == null) {
return 0;
if diff == 0 {
for k in 0..26 {
if k != j {
if let Some(child) = &self.children[k] {
if child.dfs(w, i + 1, 1) {
return true;
}
}
}
}
node = node.children[idx];
}
return node.val;
false
}
}

public class MapSum {
private Dictionary<string, int> d = new Dictionary<string, int>();
private Trie trie = new Trie();
struct MagicDictionary {
trie: Trie,
}

public MapSum() {
impl MagicDictionary {
fn new() -> Self {
MagicDictionary {
trie: Trie::new(),
}
}

public void Insert(string key, int val) {
int x = val - (d.ContainsKey(key) ? d[key] : 0);
d[key] = val;
trie.Insert(key, x);
fn build_dict(&mut self, dictionary: Vec<String>) {
for w in dictionary {
self.trie.insert(&w);
}
}

public int Sum(string prefix) {
return trie.Search(prefix);
fn search(&self, search_word: String) -> bool {
self.trie.search(&search_word)
}
}

/**
* Your MapSum object will be instantiated and called as such:
* MapSum obj = new MapSum();
* obj.Insert(key,val);
* int param_2 = obj.Sum(prefix);
*/
```

<!-- tabs:end -->
Expand Down
127 changes: 43 additions & 84 deletions solution/0600-0699/0676.Implement Magic Dictionary/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -423,124 +423,83 @@ class MagicDictionary {

```rust
struct Trie {
children: Vec<Option<Box<Trie>>>,
val: i32,
children: [Option<Box<Trie>>; 26],
is_end: bool,
}

impl Trie {
fn new() -> Self {
Trie {
children: (0..26).map(|_| None).collect(),
val: 0,
children: Default::default(),
is_end: false,
}
}

fn insert(&mut self, w: &str, x: i32) {
fn insert(&mut self, w: &str) {
let mut node = self;
for c in w.chars() {
let idx = (c as usize) - ('a' as usize);
if node.children[idx].is_none() {
node.children[idx] = Some(Box::new(Trie::new()));
let i = (c as usize) - ('a' as usize);
if node.children[i].is_none() {
node.children[i] = Some(Box::new(Trie::new()));
}
node = node.children[idx].as_mut().unwrap();
node.val += x;
node = node.children[i].as_mut().unwrap();
}
node.is_end = true;
}

fn search(&self, w: &str) -> i32 {
let mut node = self;
for c in w.chars() {
let idx = (c as usize) - ('a' as usize);
if node.children[idx].is_none() {
return 0;
}
node = node.children[idx].as_ref().unwrap();
}
node.val
fn search(&self, w: &str) -> bool {
self.dfs(w, 0, 0)
}
}

struct MapSum {
d: std::collections::HashMap<String, i32>,
trie: Trie,
}

impl MapSum {
fn new() -> Self {
MapSum {
d: std::collections::HashMap::new(),
trie: Trie::new(),
fn dfs(&self, w: &str, i: usize, diff: usize) -> bool {
if i == w.len() {
return diff == 1 && self.is_end;
}
}

fn insert(&mut self, key: String, val: i32) {
let x = val - self.d.get(&key).unwrap_or(&0);
self.d.insert(key.clone(), val);
self.trie.insert(&key, x);
}

fn sum(&self, prefix: String) -> i32 {
self.trie.search(&prefix)
}
}
```

#### C#

```cs
public class Trie {
private Trie[] children = new Trie[26];
private int val;
let j = (w.chars().nth(i).unwrap() as usize) - ('a' as usize);

public void Insert(string w, int x) {
Trie node = this;
for (int i = 0; i < w.Length; ++i) {
int idx = w[i] - 'a';
if (node.children[idx] == null) {
node.children[idx] = new Trie();
if let Some(child) = &self.children[j] {
if child.dfs(w, i + 1, diff) {
return true;
}
node = node.children[idx];
node.val += x;
}
}

public int Search(string w) {
Trie node = this;
for (int i = 0; i < w.Length; ++i) {
int idx = w[i] - 'a';
if (node.children[idx] == null) {
return 0;
if diff == 0 {
for k in 0..26 {
if k != j {
if let Some(child) = &self.children[k] {
if child.dfs(w, i + 1, 1) {
return true;
}
}
}
}
node = node.children[idx];
}
return node.val;
false
}
}

public class MapSum {
private Dictionary<string, int> d = new Dictionary<string, int>();
private Trie trie = new Trie();
struct MagicDictionary {
trie: Trie,
}

public MapSum() {
impl MagicDictionary {
fn new() -> Self {
MagicDictionary {
trie: Trie::new(),
}
}

public void Insert(string key, int val) {
int x = val - (d.ContainsKey(key) ? d[key] : 0);
d[key] = val;
trie.Insert(key, x);
fn build_dict(&mut self, dictionary: Vec<String>) {
for w in dictionary {
self.trie.insert(&w);
}
}

public int Sum(string prefix) {
return trie.Search(prefix);
fn search(&self, search_word: String) -> bool {
self.trie.search(&search_word)
}
}

/**
* Your MapSum object will be instantiated and called as such:
* MapSum obj = new MapSum();
* obj.Insert(key,val);
* int param_2 = obj.Sum(prefix);
*/
```

<!-- tabs:end -->
Expand Down
Loading