173 accepted. 44ms

aQuaYi · aQuaYi · commit 87754d3534f0 · 2019-04-20T22:39:17.000+08:00
diff --git a/.vscode/settings.json b/.vscode/settings.json
@@ -4,6 +4,7 @@
         "ASCI",
         "IDID",
         "Icode",
+        "Inorder",
         "Leet",
         "Puerkito",
         "Qedo",
diff --git a/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go
@@ -16,30 +16,29 @@ type TreeNode = kit.TreeNode
 
 // BSTIterator is the iterator of BST
 type BSTIterator struct {
-	index *int
-	nums  *[]int
+	index int
+	nums  []int
 }
 
 // Constructor returns a BST iterator
 func Constructor(root *TreeNode) BSTIterator {
 	nums := convert(root)
-	index := 0
 	return BSTIterator{
-		index: &index,
-		nums:  &nums,
+		index: 0,
+		nums:  nums,
 	}
 }
 
 // Next returns the next smallest number
 func (it *BSTIterator) Next() int {
-	res := (*it.nums)[*it.index]
-	*it.index++
+	res := it.nums[it.index]
+	it.index++
 	return res
 }
 
 // HasNext returns whether we have a next smallest number
 func (it *BSTIterator) HasNext() bool {
-	return *it.index < len(*it.nums)
+	return it.index < len(it.nums)
 }
 
 func convert(root *TreeNode) []int {
