程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
您现在的位置: 程式師世界 >> 編程語言 >  >> 更多編程語言 >> Python

[Huawei machine trial Python implementation] hj85 longest palindrome substring (simple)

編輯:Python

List of articles

  • Title Description
  • Example 1
  • explain :
  • Reference code


Title Description

Given a string containing only lowercase letters , Find the length of its longest palindrome substring .

The so-called palindrome string , Refers to a left-right symmetrical string .

So called substring , Refers to the deletion of some prefixes and suffixes from a string ( It's also possible to delete ) String

Data range :
String length 1≤s≤350

Input description :
Enter a string containing only lowercase letters

Output description :
Returns the length of the longest palindrome substring

Example 1

Input :
cdabbacc
Output :
4

explain :

abba For the longest palindrome substring

Reference code

while True:
try:
s 

  1. 上一篇文章:
  2. 下一篇文章:
Copyright © 程式師世界 All Rights Reserved