Codewars练习

记录一下比较聪明的codewars练习题解决方案,不得转载。

2017/12/19

You will be given a string and you task is to check if it is possible to convert that string into a palindrome by removing a single character. If the string is already a palindrome, return "OK". If it is not, and we can convert it to a palindrome by removing one character, then return "remove one", otherwise return "not possible". The order of the characters should not be changed.

best practice

 def solve(s):
     isOK = lambda x: x == x[::-1]

     return ("OK" if isOK(s)  else
             "remove one" if any( isOK(s[:i]+s[i+1:]) for i in range(len(s)) ) else
             "not possible")

主要是s[:i]+s[i+1:]提取字符串，any()思路很好啊，我写的就复杂很多了。