Skip to content

feat: update rust solution to lc problem: No.106 #2362

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
Feb 21, 2024
Merged

feat: update rust solution to lc problem: No.106 #2362

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
13 changes: 6 additions & 7 deletions ...-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -249,7 +249,6 @@ impl Solution {
d.insert(inorder[i], i);
}
fn dfs(
inorder: &[i32],
postorder: &[i32],
d: &HashMap<i32, usize>,
i: usize,
Expand All @@ -259,13 +258,13 @@ impl Solution {
if n <= 0 {
return None;
}
let v = postorder[j + n - 1];
let k = *d.get(&v).unwrap();
let l = dfs(inorder, postorder, d, i, j, k - i);
let r = dfs(inorder, postorder, d, k + 1, j + k - i, n - 1 - (k - i));
Some(Rc::new(RefCell::new(TreeNode { val: v, left: l, right: r })))
let val = postorder[j + n - 1];
let k = *d.get(&val).unwrap();
let left = dfs(postorder, d, i, j, k - i);
let right = dfs(postorder, d, k + 1, j + k - i, n - 1 - (k - i));
Some(Rc::new(RefCell::new(TreeNode { val, left, right })))
}
dfs(&inorder, &postorder, &d, 0, 0, n)
dfs(&postorder, &d, 0, 0, n)
}
}
```
Expand Down
13 changes: 6 additions & 7 deletions ...99/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -245,7 +245,6 @@ impl Solution {
d.insert(inorder[i], i);
}
fn dfs(
inorder: &[i32],
postorder: &[i32],
d: &HashMap<i32, usize>,
i: usize,
Expand All @@ -255,13 +254,13 @@ impl Solution {
if n <= 0 {
return None;
}
let v = postorder[j + n - 1];
let k = *d.get(&v).unwrap();
let l = dfs(inorder, postorder, d, i, j, k - i);
let r = dfs(inorder, postorder, d, k + 1, j + k - i, n - 1 - (k - i));
Some(Rc::new(RefCell::new(TreeNode { val: v, left: l, right: r })))
let val = postorder[j + n - 1];
let k = *d.get(&val).unwrap();
let left = dfs(postorder, d, i, j, k - i);
let right = dfs(postorder, d, k + 1, j + k - i, n - 1 - (k - i));
Some(Rc::new(RefCell::new(TreeNode { val, left, right })))
}
dfs(&inorder, &postorder, &d, 0, 0, n)
dfs(&postorder, &d, 0, 0, n)
}
}
```
Expand Down
13 changes: 6 additions & 7 deletions ...ion/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,6 @@ impl Solution {
d.insert(inorder[i], i);
}
fn dfs(
inorder: &[i32],
postorder: &[i32],
d: &HashMap<i32, usize>,
i: usize,
Expand All @@ -37,12 +36,12 @@ impl Solution {
if n <= 0 {
return None;
}
let v = postorder[j + n - 1];
let k = *d.get(&v).unwrap();
let l = dfs(inorder, postorder, d, i, j, k - i);
let r = dfs(inorder, postorder, d, k + 1, j + k - i, n - 1 - (k - i));
Some(Rc::new(RefCell::new(TreeNode { val: v, left: l, right: r })))
let val = postorder[j + n - 1];
let k = *d.get(&val).unwrap();
let left = dfs(postorder, d, i, j, k - i);
let right = dfs(postorder, d, k + 1, j + k - i, n - 1 - (k - i));
Some(Rc::new(RefCell::new(TreeNode { val, left, right })))
}
dfs(&inorder, &postorder, &d, 0, 0, n)
dfs(&postorder, &d, 0, 0, n)
}
}
8 changes: 2 additions & 6 deletions solution/util.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -181,9 +181,7 @@ def generate_question_readme(result):
def generate_category_summary(result, category=""):
"""generate category summary files"""
summary_cn = (
"- " + category_dict.get(category, category) + "专项练习\n\n"
if category
else ""
"- " + category_dict.get(category, category) + "专项练习\n\n" if category else ""
)
summary_en = "- " + category + " Practice\n\n" if category else ""
category = category.lower() if category else ""
Expand Down Expand Up @@ -308,9 +306,7 @@ def refresh(result):
)

# update question content
old_content = re.search(
"<!-- 这里写题目描述 -->(.*?)## 解法", cn_content, re.S
).group(1)
old_content = re.search("<!-- 这里写题目描述 -->(.*?)## 解法", cn_content, re.S).group(1)
if question.get("content_cn"):
cn_content = cn_content.replace(
old_content, "\n\n" + question["content_cn"] + "\n\n"
Expand Down