Skip to content

trie golf/nit #84

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
lrvideckis merged 1 commit into from
Jul 6, 2024
Merged

trie golf/nit #84

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
9 changes: 5 additions & 4 deletions src/data_structures/trie.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,7 +45,7 @@ impl Trie {
pub fn insert(&mut self, s: &[char]) {
let mut v = 0;
for &ch in s {
let idx = (ch as u8 - FIRST_CHAR as u8) as usize;
let idx = ch as usize - FIRST_CHAR as usize;
if self.t[v].next[idx].is_none() {
self.t[v].next[idx] = Some(self.t.len());
self.t.push(Node::default());
Expand All @@ -63,11 +63,12 @@ impl Trie {
pub fn find(&self, s: &[char]) -> usize {
let mut v = 0;
for &ch in s {
let idx = (ch as u8 - FIRST_CHAR as u8) as usize;
if self.t[v].next[idx].is_none() {
let idx = ch as usize - FIRST_CHAR as usize;
if let Some(u) = self.t[v].next[idx] {
v = u;
} else {
return 0;
}
v = self.t[v].next[idx].unwrap();
}
self.t[v].cnt_words
}
Expand Down