fix: update README.md

Author: yanglbme

README_EN.md

@@ -35,12 +35,20 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 
 ### Arrays
 
+1. [Rotate Array](./solution/0100-0199/0189.Rotate%20Array/README_EN.md)
+
 ### Linked List
 
+1. [Reverse Linked List](./solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md)
+1. [Linked List Cycle](./solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md)
+1. [Linked List Cycle II](./solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md)
+
 ### Binary Tree
 
 ### Math
 
+1. [Set Mismatch](./solution/0600-0699/0645.Set%20Mismatch/README_EN.md)
+
 ### Stack & Queue
 
 ### Dynamic Programming

solution/0100-0199/0189.Rotate Array/README.md

@@ -38,17 +38,11 @@
 
 若 `k=3`，`nums=[1,2,3,4,5,6,7]`。
 
-先将 `nums` 整体翻转：
+先将 `nums` 整体翻转：`[1,2,3,4,5,6,7]` -> `[7,6,5,4,3,2,1]`
 
-`[1,2,3,4,5,6,7]` -> `[7,6,5,4,3,2,1]`
+再翻转 `0~k-1` 范围内的元素：`[7,6,5,4,3,2,1]` -> `[5,6,7,4,3,2,1]`
 
-再翻转 `0~k-1` 范围内的元素：
-
-`[7,6,5,4,3,2,1]` -> `[5,6,7,4,3,2,1]`
-
-最后翻转 `k~n-1` 范围内的元素，即可得到最终结果：
-
-`[5,6,7,4,3,2,1]` -> `[5,6,7,1,2,3,4]`
+最后翻转 `k~n-1` 范围内的元素，即可得到最终结果：`[5,6,7,4,3,2,1]` -> `[5,6,7,1,2,3,4]`
 
 <!-- tabs:start -->