Merge pull request #47 from halfrost/add_hugo

generate PDF version
Merge pull request #46 from j3rrywan9/master
2025-07-06 17:44:10 +08:00 · 2020-08-16 20:55:26 +08:00 · 2020-08-15 12:31:01 +08:00 · 2020-08-15 11:26:50 +08:00 · 2020-08-14 19:25:19 -07:00 · 2020-08-15 07:01:41 +08:00
4 changed files with 3 additions and 6 deletions
--- a/README.md
+++ b/README.md
@ -64,7 +64,6 @@
 * [Segment Tree ✅](#segment-tree)
 * [Binary Indexed Tree ✅](#binary-indexed-tree)

-
 | 数据结构 | 变种 | 相关题目 |
 |:-------:|:-------|:------|
 |顺序线性表：向量|||
--- a/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md
+++ b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md
@ -14,7 +14,7 @@ For example, given

 Return the following binary tree:

-    		3
+    	3
       / \
      9  20
        /  \
--- a/leetcode/0283.Move-Zeroes/283.
+++ b/leetcode/0283.Move-Zeroes/283.
@ -9,10 +9,8 @@ func moveZeroes(nums []int) {
 		if nums[i] != 0 {
 			if i != j {
 				nums[i], nums[j] = nums[j], nums[i]
-				j++
-			} else {
-				j++
 			}
+			j++
 		}
 	}
 }
--- a/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
+++ b/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
@ -14,7 +14,7 @@ For example, given

 Return the following binary tree:

-    		3
+		3
       / \
      9  20
        /  \
Author	SHA1	Message	Date
halfrost	2e88f5cc7a	Merge pull request #47 from halfrost/add_hugo generate PDF version	2020-08-16 20:55:26 +08:00
halfrost	d4c623c182	Merge pull request #46 from j3rrywan9/master chore: remove unnecessary else branch	2020-08-15 12:31:01 +08:00
halfrost	0b95129054	Merge pull request #45 from halfrost/add_hugo Optimized solution 3、39 & update README	2020-08-15 11:26:50 +08:00
Jerry Wang	cc54973fa2	chore: remove unnecessary else branch	2020-08-14 19:25:19 -07:00
halfrost	4e3a42e02f	Merge pull request #45 from halfrost/add_hugo Optimized solution 3、39 & update README	2020-08-15 07:01:41 +08:00