<p>Given a string <code>s</code>, return <em>the longest</em> <span data-keyword="palindromic-string"><em>palindromic</em></span> <span data-keyword="substring-nonempty"><em>substring</em></span> in <code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;babad&quot;
<strong>Output:</strong> &quot;bab&quot;
<strong>Explanation:</strong> &quot;aba&quot; is also a valid answer.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;cbbd&quot;
<strong>Output:</strong> &quot;bb&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consist of only digits and English letters.</li>
</ul>

class Solution {
public:
    string longestPalindrome(string s) {
        int left = 0;
        int right = 0; 
        string max = "";
        string temp = "";

        for (int i = 0; i < s.length(); i++) {
            left = i - 1;
            right = i + 1;
            temp = s[i];
            if (left >= 0 && right <= (s.length() - 1) && s[left] == s[right]) {
                while (left >= 0 && right <= (s.length() - 1) && s[left] == s[right]) {
                    temp = s[left] + temp + s[right];
                    left--;
                    right++;
                }
            } else if (right <= (s.length() - 1) && s[right] == s[i]) {

                while (right <= (s.length() - 1) && s[right] == s[i]) {
                    temp = temp + s[right];
                    right++;
                }
                if (left >= 0 && right <= (s.length() - 1)) {
                    if (s[left] == s[right]) {
                        while (left >= 0 && right <= (s.length() - 1) && s[left] == s[right]) {
                            temp = s[left] + temp + s[right];
                            left--;
                            right++;
                        }
                    }
                }

            }
            if (temp.length() > max.length()) {
                max = temp;
            }
            temp = "";
        }
        return max;
    }
};
440306