Add: tag filename

Author: Openset

Diff for: internal/leetcode/tag.go

@@ -75,7 +75,7 @@ type ttQuestionType struct {
 
 func (question ttQuestionType) TagsStr() string {
 	var buf bytes.Buffer
-	format := "[[%s](https://github.com/openset/leetcode/tree/master/tag/%s)] "
+	format := "[[%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md)] "
 	for _, tag := range question.TopicTags {
 		buf.WriteString(fmt.Sprintf(format, tag.ShowName(), tag.Slug))
 	}

Diff for: tag/array/README.md

@@ -9,8 +9,8 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
-| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer)]  | Hard |
-| 307 | [区域和检索 - 数组可修改](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)]  | Medium |
-| 308 | [Range Sum Query 2D - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)]  | Hard |
-| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer)]  | Hard |
-| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer)]  | Hard |
+| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 307 | [区域和检索 - 数组可修改](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)]  | Medium |
+| 308 | [Range Sum Query 2D - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)]  | Hard |
+| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |

Diff for: tag/backtracking/README.md

@@ -9,17 +9,17 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
-| 220 | [存在重复元素 III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Medium |
-| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer)]  | Hard |
-| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer)]  | Hard |
-| 352 | [将数据流变为多个不相交间隔](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Hard |
-| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer)]  | Hard |
-| 530 | [二叉搜索树的最小绝对差](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Easy |
-| 683 | [K Empty Slots](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array)]  | Hard |
-| 699 | [掉落的方块](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Hard |
-| 715 | [Range 模块](https://github.com/openset/leetcode/tree/master/problems/range-module) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array)]  | Hard |
-| 731 | [我的日程安排表 II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array)]  | Medium |
-| 732 | [我的日程安排表 III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Hard |
-| 776 | [Split BST](https://github.com/openset/leetcode/tree/master/problems/split-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Medium |
-| 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Easy |
-| 938 | [二叉搜索树的范围和](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree)]  | Medium |
+| 220 | [存在重复元素 III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Medium |
+| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 352 | [将数据流变为多个不相交间隔](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Hard |
+| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 530 | [二叉搜索树的最小绝对差](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Easy |
+| 683 | [K Empty Slots](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Hard |
+| 699 | [掉落的方块](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Hard |
+| 715 | [Range 模块](https://github.com/openset/leetcode/tree/master/problems/range-module) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Hard |
+| 731 | [我的日程安排表 II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
+| 732 | [我的日程安排表 III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Hard |
+| 776 | [Split BST](https://github.com/openset/leetcode/tree/master/problems/split-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Medium |
+| 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Easy |
+| 938 | [二叉搜索树的范围和](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Medium |