2017#新年快乐#2017

矩形覆盖 

 调整调整回文 

def maxLcs(s): &nbsp; &nbsp; &nbsp; &nbsp; s2=s[::-1] &nbsp; &nbsp; m=len(s) &nbsp; &nbsp; dp=[[0 for i in range(m+1)] for j in range(m+1)] &nbsp; &nbsp; for i in range(1,m+1): &nbsp; &nbsp; &nbsp; &nbsp; for j in range(1,m+1): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if s[i-1]==s2[j-1]: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; dp[i][j]=dp[i-1][j-1]+1 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; elif dp[i-1][j]&gt;=dp[i][j-1]: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; dp[i][j]=dp[i-1][j] &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; dp[i][j]=dp[i][j-1] &nbsp; &nbsp; return dp[-1][-1] print(len(s)-maxLcs(s))

字符串长度-最长回文子序列长度就是删除的字符个数

s1=input() s2=s1[::-1] list1=list(s1) list2=list(s2) sum=0 len(s1) for i in range(len(s1)) : if s1[i]!=s2[i]: list1.pop(len(s1)-i-1) list2.pop(i) s1=&quot;&quot;.join(list1) s2 = &quot;&quot;.join(list2) sum+=1 i=0 elif s1 == s2: break print(sum)

第158题：调整调整回文

完美数II

地板覆盖

滑雪比赛

数数II

第158题： 调整调整回文

完美数II

地板覆盖

滑雪比赛

数数II

第158题：调整调整回文