Merge remote-tracking branch 'origin/added_java_soln_for_2501_Longest_Square_Streak_in_an_Array' into added_java_soln_for_2501_Longest_Square_Streak_in_an_Array

Author: nikhilchikate

solution/2500-2599/2501.Longest Square Streak in an Array/README_EN.md

@@ -308,8 +308,8 @@ is $\max(\textit{dfs}(x))$, where $x$ is an element in the array $\textit{nums}$
 
 The calculation process of the function $\textit{dfs}(x)$ is as follows:
 
-- If $x$ is not in the hash table, return $0$.
-- Otherwise, return $1 + \textit{dfs}(x^2)$.
+-   If $x$ is not in the hash table, return $0$.
+-   Otherwise, return $1 + \textit{dfs}(x^2)$.
 
 During the process, we can use memoization, i.e., use a hash table to record the value of the function $\textit{dfs}(x)$
 to avoid redundant calculations.