Add: tag filename

Author: Openset

internal/tag/tag.go

@@ -26,7 +26,7 @@ func runTag(cmd *base.Command, args []string) {
 	buf.WriteString("| # | Title | 标题 | | # | Title | 标题 |\n")
 	buf.WriteString("| :-: | - | :-: | - | :-: | - | :-: |\n")
 	tags := leetcode.GetTags()
-	format := "| %d | [%s](https://github.com/openset/leetcode/tree/master/tag/%s) | [%s](https://github.com/openset/leetcode/tree/master/tag/%s) | "
+	format := "| %d | [%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md) | [%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md) | "
 	for i, tag := range tags {
 		buf.WriteString(fmt.Sprintf(format, i+1, tag.Name, tag.Slug, tag.TranslatedName, tag.Slug))
 		if i&1 == 1 {

tag/README.md

@@ -9,20 +9,20 @@
 
 | # | Title | 标题 | | # | Title | 标题 |
 | :-: | - | :-: | - | :-: | - | :-: |
-| 1 | [Array](https://github.com/openset/leetcode/tree/master/tag/array) | [数组](https://github.com/openset/leetcode/tree/master/tag/array) | | 2 | [Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming) | [动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming) | 
-| 3 | [String](https://github.com/openset/leetcode/tree/master/tag/string) | [字符串](https://github.com/openset/leetcode/tree/master/tag/string) | | 4 | [Math](https://github.com/openset/leetcode/tree/master/tag/math) | [数学](https://github.com/openset/leetcode/tree/master/tag/math) | 
-| 5 | [Tree](https://github.com/openset/leetcode/tree/master/tag/tree) | [树](https://github.com/openset/leetcode/tree/master/tag/tree) | | 6 | [Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table) | [哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table) | 
-| 7 | [Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search) | [深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search) | | 8 | [Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search) | [二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search) | 
-| 9 | [Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers) | [双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers) | | 10 | [Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search) | [广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search) | 
-| 11 | [Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy) | [贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy) | | 12 | [Stack](https://github.com/openset/leetcode/tree/master/tag/stack) | [栈](https://github.com/openset/leetcode/tree/master/tag/stack) | 
-| 13 | [Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking) | [回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking) | | 14 | [Design](https://github.com/openset/leetcode/tree/master/tag/design) | [设计](https://github.com/openset/leetcode/tree/master/tag/design) | 
-| 15 | [Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list) | [链表](https://github.com/openset/leetcode/tree/master/tag/linked-list) | | 16 | [Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation) | [位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation) | 
-| 17 | [Heap](https://github.com/openset/leetcode/tree/master/tag/heap) | [堆](https://github.com/openset/leetcode/tree/master/tag/heap) | | 18 | [Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer) | [分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer) | 
-| 19 | [Sort](https://github.com/openset/leetcode/tree/master/tag/sort) | [排序](https://github.com/openset/leetcode/tree/master/tag/sort) | | 20 | [Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find) | [并查集](https://github.com/openset/leetcode/tree/master/tag/union-find) | 
-| 21 | [Queue](https://github.com/openset/leetcode/tree/master/tag/queue) | [队列](https://github.com/openset/leetcode/tree/master/tag/queue) | | 22 | [Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree) | [二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree) | 
-| 23 | [Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree) | [线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree) | | 24 | [Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax) | [极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax) | 
-| 25 | [Trie](https://github.com/openset/leetcode/tree/master/tag/trie) | [字典树](https://github.com/openset/leetcode/tree/master/tag/trie) | | 26 | [Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion) | [递归](https://github.com/openset/leetcode/tree/master/tag/recursion) | 
-| 27 | [Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser) | [脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser) | | 28 | [Random](https://github.com/openset/leetcode/tree/master/tag/random) | [](https://github.com/openset/leetcode/tree/master/tag/random) | 
-| 29 | [Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling) | [](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling) | | 30 | [Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry) | [几何](https://github.com/openset/leetcode/tree/master/tag/geometry) | 
-| 31 | [Graph](https://github.com/openset/leetcode/tree/master/tag/graph) | [图](https://github.com/openset/leetcode/tree/master/tag/graph) | | 32 | [Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort) | [拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort) | 
-| 33 | [Memoization](https://github.com/openset/leetcode/tree/master/tag/memoization) | [记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization) | | 34 | [Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree) | [树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree) | 
+| 1 | [Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md) | [数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md) | | 2 | [Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md) | [动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md) | 
+| 3 | [String](https://github.com/openset/leetcode/tree/master/tag/string/README.md) | [字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md) | | 4 | [Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md) | [数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md) | 
+| 5 | [Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md) | [树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md) | | 6 | [Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md) | [哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md) | 
+| 7 | [Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md) | [深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md) | | 8 | [Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md) | [二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md) | 
+| 9 | [Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md) | [双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md) | | 10 | [Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md) | [广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md) | 
+| 11 | [Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md) | [贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md) | | 12 | [Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md) | [栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md) | 
+| 13 | [Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md) | [回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md) | | 14 | [Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md) | [设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md) | 
+| 15 | [Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md) | [链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md) | | 16 | [Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | [位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | 
+| 17 | [Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md) | [堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md) | | 18 | [Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md) | [分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md) | 
+| 19 | [Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) | [排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) | | 20 | [Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md) | [并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md) | 
+| 21 | [Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md) | [队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md) | | 22 | [Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md) | [二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md) | 
+| 23 | [Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md) | [线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md) | | 24 | [Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md) | [极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md) | 
+| 25 | [Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md) | [字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md) | | 26 | [Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | [递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | 
+| 27 | [Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md) | [脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md) | | 28 | [Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md) | [](https://github.com/openset/leetcode/tree/master/tag/random/README.md) | 
+| 29 | [Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md) | [](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md) | | 30 | [Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md) | [几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md) | 
+| 31 | [Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | [图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | | 32 | [Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md) | [拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md) | 
+| 33 | [Memoization](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | [记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | | 34 | [Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md) | [树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md) |