leetcode 5 最长回文子串std::pair 和 make_pair运用

LeetCode 5

https://leetcode-cn.com/problems/longest-palindromic-substring/

给你一个字符串 s，找到 s 中最长的回文子串。
输入：s = “babad”
输出：“bab”
解释：“aba” 同样是符合题意的答案。

class Solution {
    
public:
    std::pair<int, int> Palindrome(const string& s, int left, int right, const int& length){
    
        int last_left = left, last_right = left;
        while(left >= 0 && right < length)
        {
    
            if ( s[left] != s[right] )break;
            last_left = left, last_right = right;
            left--, right++;
        }
        return make_pair(last_left, last_right);
    }
    string longestPalindrome(string s) {
    

        int length = s.size();
        if (length == 1)return s;
        int maxn = 0;
        std::pair<int, int> maxStr;
        for(int i = 0;i < length-1;i++){
    
            auto [i1, j1] = Palindrome(s, i, i, length);
            auto [i2, j2] = Palindrome(s, i, i+1, length);
            if ( maxn < j2-i2 ){
    
                maxn = j2-i2;
                maxStr = make_pair(i2, j2);
            }
            if ( maxn < j1-i1 ){
    
                maxn = j1-i1;
                maxStr = make_pair(i1, j1);
            }
        }
        return s.substr(maxStr.first, maxStr.second-maxStr.first+1);
    }
};