diff --git a/interview/最长回文子串.md b/interview/最长回文子串.md
index 104d422..2204e80 100644
--- a/interview/最长回文子串.md
+++ b/interview/最长回文子串.md
@@ -4,7 +4,7 @@ Translator: [Lrc123](https://github.com/Lrc123)
 
 # How to find **The Longest Palindromic Substring**
 
-Palindromic questions are very common in the interview, this article provides some insights about palindromic problem.
+Palindrome questions are very common in the interview, this article provides some insights about palindromic problem.
 
 To specific :
 > A palindrome is a word, number, phrase, or other sequence of characters which reads the same backward as forward, such as madam, racecar. 
@@ -103,7 +103,9 @@ string longestPalindrome(string s) {
 
 
 Thus, this leetcode problem is solved. Now, we get:
+
 Time complexity: O(N^2) 
+
 Space complexity: O(1)