计蒜客 T1725 国王的魔镜

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/tobe_numberone/article/details/89057960

题目链接：https://nanti.jisuanke.com/t/T1725
算法特工队QQ群：979618872 (伸手党绕边，欢迎有良好基础的人加入)

//
// Created by Leo Lee on 2019/4/5.
//

#include <iostream>
#include <string>
using namespace std;
unsigned long minLong(string str);
int main(){
    string str;
    cin>>str;
    cout<<minLong(str)<<endl;
    return 0;
}

unsigned long minLong(string str){
    unsigned long L=0,R=str.size()-1;
    unsigned long minlen = R-L+1;
    while(minlen!=1){
        while(L<R){
            if(str[L]!=str[R])
                return minlen;
            L++;R--;
        }
        L = 0;R=R;
        minlen = R-L+1;
    }
    return minlen;
}