☆打卡算法☆LeetCode 5、最长回文子串 算法解析

public class Solution 
{
    //暴力解法:
    public string LongestPalindrome(string s) 
    {
        int maxLen = 0;
        int begin = 0;
        for (int left = 0; left < s.Length; left++)
        {
            for (int right = s.Length - 1; right >= 0; right--)
            {
                if (((right - left + 1) > maxLen) &amp;&amp; VerifyPalindrome(s, left, right))
                {
                    maxLen = right - left + 1;
                    begin = left;
                }
            }
        }
        return s.Substring(begin, maxLen);
    }

    // 验证回文子串
    public bool VerifyPalindrome(string s, int left, int right)
    {
        while (left < right)
        {
            if (s[left] != s[right])
            {
                return false;
            }
            left++;
            right--;
        }
        return true;
    }
}