class Solution:
def findMedianSortedArrays(self, s) :
for length in range(len(s), -1, -1):
for index in range(0, len(s) - length + 1):
sub_string = s[index:length + index]
if sub_string == sub_string[::-1]:
return sub_string
leetcode 第五题
最新推荐文章于 2024-09-14 18:52:56 发布