684-redundant-connection.md Reworded.

gazeldx · gazeldx · commit ef7433b015da · 2024-12-22T09:03:02.000+08:00
diff --git a/solutions/1-1000/684-redundant-connection.md b/solutions/1-1000/684-redundant-connection.md
@@ -41,7 +41,7 @@ Output: [1,4]
 ![](../../images/684.png)
 
 - We are given `edges` data and need to divide them into multiple groups, each group can be abstracted into a **tree**.
-- Finally, those trees will be merged into one tree.
+- Finally, those trees can be merged into one tree if the redundant edge is removed.
 - `UnionFind` algorithm is designed for grouping and searching data.
 
 ### 'UnionFind' algorithm
diff --git a/solutions/1-1000/685-redundant-connection-ii.md b/solutions/1-1000/685-redundant-connection-ii.md
@@ -12,14 +12,14 @@ Return _an edge that can be removed so that the resulting graph is a rooted tree
 
 ### Example 1
 ![](../../images/examples/685_1.jpg)
-```
+```java
 Input: edges = [[1,2],[1,3],[2,3]]
 Output: [2,3]
 ```
 
 ### Example 2
 ![](../../images/examples/685_2.jpg)
-```
+```java
 Input: edges = [[1,2],[2,3],[3,4],[4,1],[1,5]]
 Output: [4,1]
 ```
@@ -37,7 +37,7 @@ Output: [4,1]
     2. If there is no vertex with in-degree 2, once a cycle is formed, return the edge that causes the cycle.
 
 - We are given `edges` data and need to divide them into multiple groups, each group can be abstracted into a **tree**.
-- Finally, those trees will be merged into one tree.
+- Finally, those trees can be merged into one tree if the redundant edge is removed.
 - `UnionFind` algorithm is designed for grouping and searching data.
 
 ### 'UnionFind' algorithm
@@ -47,7 +47,7 @@ Output: [4,1]
     - The `same_root(node1, node2)` method is used to determine whether two nodes are in the same tree.
 
 ## Approach
-1. Iterate `edges` data to look for the `two_conflict_edges` (two edges caused a vertex with in-degree 2).
+1. Iterate `edges` data to look for the `two_conflict_edges` (the two edges caused a vertex with in-degree 2).
 1. Initially, each node is in its own group.
 1. Iterate `edges` data and `unite(node1, node2)`.
 1. If there is no vertex with in-degree 2, as soon as `same_root(node1, node2) == true` (a cycle will be formed), return `[node1, node2]`.
diff --git a/solutions/dynamic_programming/unorganized.md b/solutions/dynamic_programming/unorganized.md
@@ -19,3 +19,6 @@ The principle of traversal (DFS or BFS) between `undirected graph` or `directed
 * First rule: don't visited nodes again. This rule make starting from a node to traverse the `undirected graph` have a direction.
 * The adjacent nodes of `undirected graph` are its non-visited neighbors.
 * The adjacent nodes of `directed graph` are its targeted nodes.
+
+# Features
+* Add Google translate as a link. Link example: https://github-com.translate.goog/gazeldx/leetcode-solutions/blob/main/solutions/1-1000/122-best-time-to-buy-and-sell-stock-ii.md?_x_tr_sl=auto&_x_tr_tl=zh-CN&_x_tr_hl=en&_x_tr_pto=wapp
