tags

kimi0230 · kimi0230 · commit 60d8604cf383 · 2022-01-18T22:11:12.000+08:00
diff --git a/Leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md b/Leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md
@@ -1,5 +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, Two Pointers
 ## 題目
 Given the head of a linked list, remove the nth node from the end of the list and return its head.
 
diff --git a/Leetcode/0567.Permutation-in-String/README.md b/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, Sliding Window
 
 ## 題目
 Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
diff --git a/Leetcode/0704.Binary-Search/README.md b/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, Binary Search
 
 ## 題目
 
diff --git a/Leetcode/0752.Open-the-Lock/README.md b/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, 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.
 
diff --git a/Leetcode/0876.Middle-of-the-Linked-List/README.md b/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, Two Pointers
 
 ## 題目
 Given the head of a singly linked list, return the middle node of the linked list.
