Refactor longestPalindrome method for clarity

Author: jumpman-cmd

PingMe/LongestPalindromeSubstring.java

@@ -1,18 +1,23 @@
-class Solution {
-    public String longestPalindrome(String s) {
-        if (s == null || s.length() < 1) {
+class Solution 
+{
+    public String longestPalindrome(String s) 
+    {
+        if (s == null || s.length() < 1) 
+        {
             return "";
         }
 
         int start = 0;
         int end = 0;
 
-        for (int i = 0; i < s.length(); i++) {
+        for (int i = 0; i < s.length(); i++) 
+        {
             int len1 = expandAroundCenter(s, i, i);
             int len2 = expandAroundCenter(s, i, i + 1);
 
             int maxLen = Math.max(len1, len2);
-            if (maxLen > end - start) {
+            if (maxLen > end - start) 
+            {
                 start = i - (maxLen - 1) / 2;
                 end = i + maxLen / 2;
             }
@@ -21,11 +26,14 @@ public String longestPalindrome(String s) {
         return s.substring(start, end + 1);
     }
 
-    private int expandAroundCenter(String s, int left, int right) {
-        while (left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
+    private int expandAroundCenter(String s, int left, int right) 
+    {
+        while (left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) 
+        {
             left--;
             right++;
         }
+        
         return right - left - 1;
     }
 }