Commit 2e8ca32

authored

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

1 parent 4d6c701 commit 2e8ca32Copy full SHA for 2e8ca32

File tree

+20

-27

lines changed

solution
- 0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal
- util.py

+20

-27

lines changed

Lines changed: 6 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -249,7 +249,6 @@ impl Solution {`
`249`	`249`	`d.insert(inorder[i], i);`
`250`	`250`	`}`
`251`	`251`	`fn dfs(`
`252`		`- inorder: &[i32],`
`253`	`252`	`postorder: &[i32],`
`254`	`253`	`d: &HashMap<i32, usize>,`
`255`	`254`	`i: usize,`
`@@ -259,13 +258,13 @@ impl Solution {`
`259`	`258`	`if n <= 0 {`
`260`	`259`	`return None;`
`261`	`260`	`}`
`262`		`- let v = postorder[j + n - 1];`
`263`		`- let k = *d.get(&v).unwrap();`
`264`		`- let l = dfs(inorder, postorder, d, i, j, k - i);`
`265`		`- let r = dfs(inorder, postorder, d, k + 1, j + k - i, n - 1 - (k - i));`
`266`		`- Some(Rc::new(RefCell::new(TreeNode { val:v, left:l, right:r })))`
	`261`	`+ let val = postorder[j + n - 1];`
	`262`	`+ let k = *d.get(&val).unwrap();`
	`263`	`+ let left = dfs(postorder, d, i, j, k - i);`
	`264`	`+ let right = dfs(postorder, d, k + 1, j + k - i, n - 1 - (k - i));`
	`265`	`+ Some(Rc::new(RefCell::new(TreeNode { val, left, right })))`
`267`	`266`	`}`
`268`		`- dfs(&inorder, &postorder, &d, 0, 0, n)`
	`267`	`+ dfs(&postorder, &d, 0, 0, n)`
`269`	`268`	`}`
`270`	`269`	`}`
`271`	`270`	```

Lines changed: 6 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -245,7 +245,6 @@ impl Solution {`
`245`	`245`	`d.insert(inorder[i], i);`
`246`	`246`	`}`
`247`	`247`	`fn dfs(`
`248`		`- inorder: &[i32],`
`249`	`248`	`postorder: &[i32],`
`250`	`249`	`d: &HashMap<i32, usize>,`
`251`	`250`	`i: usize,`
`@@ -255,13 +254,13 @@ impl Solution {`
`255`	`254`	`if n <= 0 {`
`256`	`255`	`return None;`
`257`	`256`	`}`
`258`		`- let v = postorder[j + n - 1];`
`259`		`- let k = *d.get(&v).unwrap();`
`260`		`- let l = dfs(inorder, postorder, d, i, j, k - i);`
`261`		`- let r = dfs(inorder, postorder, d, k + 1, j + k - i, n - 1 - (k - i));`
`262`		`- Some(Rc::new(RefCell::new(TreeNode { val:v, left:l, right:r })))`
	`257`	`+ let val = postorder[j + n - 1];`
	`258`	`+ let k = *d.get(&val).unwrap();`
	`259`	`+ let left = dfs(postorder, d, i, j, k - i);`
	`260`	`+ let right = dfs(postorder, d, k + 1, j + k - i, n - 1 - (k - i));`
	`261`	`+ Some(Rc::new(RefCell::new(TreeNode { val, left, right })))`
`263`	`262`	`}`
`264`		`- dfs(&inorder, &postorder, &d, 0, 0, n)`
	`263`	`+ dfs(&postorder, &d, 0, 0, n)`
`265`	`264`	`}`
`266`	`265`	`}`
`267`	`266`	```

Lines changed: 6 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -27,7 +27,6 @@ impl Solution {`
`27`	`27`	`d.insert(inorder[i], i);`
`28`	`28`	`}`
`29`	`29`	`fn dfs(`
`30`		`- inorder: &[i32],`
`31`	`30`	`postorder: &[i32],`
`32`	`31`	`d: &HashMap<i32, usize>,`
`33`	`32`	`i: usize,`
`@@ -37,12 +36,12 @@ impl Solution {`
`37`	`36`	`if n <= 0 {`
`38`	`37`	`return None;`
`39`	`38`	`}`
`40`		`- let v = postorder[j + n - 1];`
`41`		`- let k = *d.get(&v).unwrap();`
`42`		`- let l = dfs(inorder,postorder, d, i, j, k - i);`
`43`		`- let r = dfs(inorder,postorder, d, k + 1, j + k - i, n - 1 - (k - i));`
`44`		`- Some(Rc::new(RefCell::new(TreeNode { val: v, left: l, right: r })))`
	`39`	`+ let val = postorder[j + n - 1];`
	`40`	`+ let k = *d.get(&val).unwrap();`
	`41`	`+ let left = dfs(postorder, d, i, j, k - i);`
	`42`	`+ let right = dfs(postorder, d, k + 1, j + k - i, n - 1 - (k - i));`
	`43`	`+ Some(Rc::new(RefCell::new(TreeNode { val, left, right })))`
`45`	`44`	`}`
`46`		`- dfs(&inorder,&postorder, &d, 0, 0, n)`
	`45`	`+ dfs(&postorder, &d, 0, 0, n)`
`47`	`46`	`}`
`48`	`47`	`}`

Lines changed: 2 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -181,9 +181,7 @@ def generate_question_readme(result):`
`181`	`181`	`def generate_category_summary(result, category=""):`
`182`	`182`	`"""generate category summary files"""`
`183`	`183`	`summary_cn = (`
`184`		`- "- " + category_dict.get(category, category) + "专项练习\n\n"`
`185`		`- if category`
`186`		`- else ""`
	`184`	`+ "- " + category_dict.get(category, category) + "专项练习\n\n" if category else ""`
`187`	`185`	`)`
`188`	`186`	`summary_en = "- " + category + " Practice\n\n" if category else ""`
`189`	`187`	`category = category.lower() if category else ""`
`@@ -308,9 +306,7 @@ def refresh(result):`
`308`	`306`	`)`
`309`	`307`
`310`	`308`	`# update question content`
`311`		`- old_content = re.search(`
`312`		`- "<!-- 这里写题目描述 -->(.*?)## 解法", cn_content, re.S`
`313`		`- ).group(1)`
	`309`	`+ old_content = re.search("<!-- 这里写题目描述 -->(.*?)## 解法", cn_content, re.S).group(1)`
`314`	`310`	`if question.get("content_cn"):`
`315`	`311`	`cn_content = cn_content.replace(`
`316`	`312`	`old_content, "\n\n" + question["content_cn"] + "\n\n"`

Comments

(0)