my_leetcode_solutions/longest_palindromic_substring.cpp at main · Maksud627/my_leetcode_solutions · 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
38
class Solution {
public:
    string longestPalindrome(string s) {
        string result;
        int resLength=0;
        int left, right;

        for(int i=0; i<s.length(); i++){

            // for even length
            left = i;
            right = i+1;
            while(left >= 0 && right < s.length() && s[left] == s[right]){
                if((right-left+1) > resLength){
                    resLength = right-left+1;
                    result = s.substr(left, resLength);
                }
                left--;
                right++;
            }

            // for odd length
            left = i;
            right = i;
            while(left >= 0 && right < s.length() && s[left] == s[right]){
                if((right-left+1) > resLength){
                    resLength = right-left+1;
                    result = s.substr(left, resLength);
                }
                left--;
                right++;
            }

        }

        return result;
    }
};