用C++实现特定算法的回文查找

bool isPalindrome(string str) {
    int left = 0;
    int right = str.length() - 1;
    
    while (left < right) {
        if (str[left] != str[right]) {
            return false;
        }
        
        left++;
        right--;
    }
    
    return true;
}

int main() {
    string str = "example";
    
    for (int i = 0; i < str.length(); i++) {
        for (int j = i; j < str.length(); j++) {
            string subStr = str.substr(i, j - i + 1);
            
            if (isPalindrome(subStr)) {
                cout << subStr << " is a palindrome." << endl;
            }
        }
    }
    
    return 0;
}