[leetcode]1328. 破坏回文串

class Solution {
public:
    string breakPalindrome(string palindrome) {
        bool flag = false;
        int len = palindrome.size();
        if(len  <= 1) return "";
        int left = 0, right = len - 1;
        int idx = 0;
        while(left < right)
        {
            if(palindrome[left] != 'a')
            {
                palindrome[left] = 'a';
                return palindrome;
            }
            else if(!flag)
            {
                idx = right;
                flag = true;
            }
            left++;
            right--;
        }
        if(flag)
        {
            palindrome[idx] = 'b';
            return palindrome;
        }
        else
        {
            return "";
        }
    }
};