题解 | #字符串分隔#
密码截取
http://www.nowcoder.com/practice/3cd4621963e8454594f00199f4536bb1
接近双百；用中心扩展算法
动态规划推出状态转移链 leecode第5题
#include<iostream>
using namespace std;#include<string>
pair<int, int> expandAroundCenter(const string& s, int left, int right)
{
while (left >= 0 && right < s.size() && s[left] == s[right]) {
--left;
++right;
}
return {left + 1, right - 1};
}
int main() {
string str;
while (cin >> str)
{
int start = 0, end = 0;
for (int i = 0; i < str.size(); ++i)
{
auto [left1, right1] = expandAroundCenter(str, i, i);
auto [left2, right2] = expandAroundCenter(str, i, i + 1);
if (right1 - left1 > end - start) {
start = left1;
end = right1;
}
if (right2 - left2 > end - start) {
start = left2;
end = right2;
}
}
cout<<end-start+1<<endl;
}
}
