From 25aeb74240db39beb5048eec9853381900f4fc2d Mon Sep 17 00:00:00 2001
From: jonghoonpark <dev@jonghoonpark.com>
Date: Mon, 1 Jul 2024 19:40:20 +0900
Subject: [PATCH] update post

---
 _posts/2024-07-01-leetcode-5.md | 52 ++++++++++++++++-----------------
 1 file changed, 26 insertions(+), 26 deletions(-)

diff --git a/_posts/2024-07-01-leetcode-5.md b/_posts/2024-07-01-leetcode-5.md
index ce20c94..5651bb5 100644
--- a/_posts/2024-07-01-leetcode-5.md
+++ b/_posts/2024-07-01-leetcode-5.md
@@ -89,7 +89,7 @@ start = start + 1;
 end = start + max.length();
 ```
 
-end 를 `start + max.length()` 로 두어 연산을 많이 줄일 수 있었고 꽤 큰 차이가 발생된다.
+다음 end 값을 `start + max.length()` 로 두어 연산을 많이 줄일 수 있었고 꽤 큰 차이가 발생된다.
 
 ```java
 class Solution {
@@ -170,31 +170,31 @@ class Solution {
 ```java
 class Solution {
     public String longestPalindrome(String s) {
-		String max = "";
-
-		char[] charArray = s.toCharArray();
-		for (int i = 0; i < s.length(); i++) {
-			char currentChar = charArray[i];
-			int left = i;
-			int right = i;
-
-			while (right < s.length() - 1 && currentChar == charArray[right + 1]) {
-				right++;
-			}
-
-			while (left > 0 && right < s.length() - 1 && charArray[left - 1] == charArray[right + 1]) {
-				left--;
-				right++;
-			}
-
-			String temp = s.substring(left, right + 1);
-			if (temp.length() > max.length()) {
-				max = temp;
-			}
-		}
-
-		return max;
-	}
+        String max = "";
+
+        char[] charArray = s.toCharArray();
+        for (int i = 0; i < s.length(); i++) {
+            char currentChar = charArray[i];
+            int left = i;
+            int right = i;
+
+            while (right < s.length() - 1 && currentChar == charArray[right + 1]) {
+                right++;
+            }
+
+            while (left > 0 && right < s.length() - 1 && charArray[left - 1] == charArray[right + 1]) {
+                left--;
+                right++;
+            }
+
+            String temp = s.substring(left, right + 1);
+            if (temp.length() > max.length()) {
+                max = temp;
+            }
+        }
+
+        return max;
+    }
 }
 ```