Longest Palindromic Substring LeetCode solution in Java

1
class Solution {
2
  String max = "";
3

4
  private void checkPalindrome(String s, int l, int r) {
5
    while (l >= 0 && r < s.length() && s.charAt(l) == s.charAt(r)) {
6
      if (r - l >= max.length()) {
7
        max = s.substring(l, r + 1);
8
      }
9

10
      l--;
11
      r++;
12
    }
13
  }
14

15
  public String longestPalindrome(String s) {
16
    for (int i = 0; i < s.length(); i++) {
17
      checkPalindrome(s, i, i);
18
      checkPalindrome(s, i, i + 1);
19
    }
20

21
    return max;
22
  }
23
}