tags

Author: kimi0230

Leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md

@@ -1,6 +1,5 @@
 # [19. Remove Nth Node From End of List](https://leetcode.com/problems/middle-of-the-linked-list/)
-###### tags: `Medium` `Leetcode` `two pointers`
-
+tags: Medium, Leetcode, Two Pointers
 ## 題目
 Given the head of a linked list, remove the nth node from the end of the list and return its head.
 
@@ -76,4 +75,7 @@ func RemoveNthFromEnd(head *ListNode, n int) *ListNode {
 	preSlow.Next = slow.Next
 	return dummyHead.Next
 }
-```
+```
+
+
+###### tags: `Medium` `Leetcode` `Two Pointers`

Leetcode/0310.Minimum-Height-Trees/README.md

@@ -1,5 +1,5 @@
 # [310. Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) 
-###### tags: `Medium` `Leetcode`
+tags: Medium, Leetcode
 
 ## 題目
 A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.

Leetcode/0567.Permutation-in-String/README.md

@@ -1,5 +1,5 @@
 # [567. Permutation in String](https://leetcode.com/problems/permutation-in-string/)
-###### tags: `Medium` `Leetcode` `Sliding Window`
+tags: Medium, Leetcode, Sliding Window
 
 ## 題目
 Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
@@ -122,4 +122,6 @@ func CheckInclusionSlice(s1 string, s2 string) bool {
 	}
 	return false
 }
-```
+```
+
+###### tags: `Medium` `Leetcode` `Sliding Window`

Leetcode/0704.Binary-Search/README.md

@@ -1,5 +1,5 @@
 # [704. Binary Search](https://leetcode.com/problems/binary-search/)
-###### tags: `Easy` `Leetcode` `Binary Search`
+tags: Easy, Leetcode, Binary Search
 
 ## 題目
 
@@ -196,4 +196,6 @@ func RightBound(nums []int, target int) (index int) {
 	return right
 }
 
-```
+```
+
+###### tags: `Easy` `Leetcode` `Binary Search`

Leetcode/0752.Open-the-Lock/README.md

@@ -1,5 +1,5 @@
 # [752. Open the Lock](https://leetcode.com/problems/open-the-lock/) 
-###### tags: `Medium` `Leetcode` `BFS`
+tags: Medium, Leetcode, BFS
 
 You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn '9' to be '0', or '0' to be '9'. Each move consists of turning one wheel one slot.
 
@@ -301,4 +301,6 @@ func strToInt(str string) int16 {
 	return int16(str[0]-'0')*1000 + int16(str[1]-'0')*100 + int16(str[2]-'0')*10 + int16(str[3]-'0')
 }
 
-```
+```
+
+###### tags: `Medium` `Leetcode` `BFS`

Leetcode/0876.Middle-of-the-Linked-List/README.md

@@ -1,5 +1,5 @@
 # [876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)
-###### tags: `Medium` `Leetcode` `two pointers`
+tags: Medium, Leetcode, Two Pointers
 
 ## 題目
 Given the head of a singly linked list, return the middle node of the linked list.
@@ -88,4 +88,6 @@ func MiddleNode(head *ListNode) *ListNode {
 		return slow
 	}
 }
-```
+```
+
+###### tags: `Medium` `Leetcode` `two pointers`