leetcodeDSAProblems/LongestPalindromicSubstring.java at main · mihson95/leetcodeDSAProblems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// Longest Palindromic Substring


class Solution {
    public String longestPalindrome(String s) {
        int n = s.length();
        int max_len = 1;
        int start = 0, end = 0;
        for(int i = 0; i < n; i++) {
            int l = i, r = i;
            while(l>=0 && r<n){
                if(s.charAt(l) == s.charAt(r)){
                    l--;r++;
                }
                else break;
            }
            if(max_len < r-l-1) {
                max_len = r-l-1;
                start = l+1;
                end = r-1;
            }
            l = i; r = i+1;
            while(l>=0 && r<n){
                if(s.charAt(l) == s.charAt(r)){
                    l--;r++;
                }
                else break;
            }
            if(max_len < r-l-1) {
                max_len = r-l-1;
                start = l+1;
                end = r-1;
            }
        }
        return s.substring(start, end+1);
    }
}