更新笔记

zjg23 · zjg23 · commit 18d9d4d221da · 2019-04-24T15:15:58.000+08:00
diff --git a/Week_02/id_27/NOTE.md b/Week_02/id_27/NOTE.md
@@ -15,7 +15,7 @@
 &#22256;&#38590;&#65306;https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/
 
 &#20108;&#21449;&#25628;&#32034;&#26641;
-&#31616;&#21333;&#65306;https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
+&#31616;&#21333;&#65306;https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/     --finish
 &#20013;&#31561;&#65306;https://leetcode-cn.com/problems/range-sum-of-bst/
 &#20013;&#31561;&#65306;https://leetcode-cn.com/problems/contains-duplicate-iii/
 &#22256;&#38590;&#65306;https://leetcode-cn.com/problems/count-of-range-sum/

-Original file line number
+Diff line change
 困难：https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/
 二叉搜索树
 -简单：https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
 +简单：https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/     --finish
 中等：https://leetcode-cn.com/problems/range-sum-of-bst/
 中等：https://leetcode-cn.com/problems/contains-duplicate-iii/
 困难：https://leetcode-cn.com/problems/count-of-range-sum/