Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for The Longest Palindromic by szneqz
def longest_palindromic(text, m = 0):
if m == 0:
m = len(text) - 1
end = 0
start = -1
es = 0
em = 0
isBad = False
result = ""
for letter in text:
start = start + 1
end = m + 1
datlen = 0
for lerrer2 in text:
end = end - 1
if (end - start) > (em - es):
datlen2 = (end - start + 1) / 2
datlen2 = int(datlen2)
isBad = False
while datlen2 >= 0:
if text[start + datlen2] != text[end - datlen2]:
isBad = True
break
datlen2 = datlen2 - 1
if isBad == False:
es = start
em = end
i = 0
while i < em - es + 1:
result = result + text[i + es]
i = i + 1
print(result, es, em)
return result
if __name__ == '__main__':
assert longest_palindromic("artrartrt") == "rtrartr", "The Longest"
assert longest_palindromic("abacada") == "aba", "The First"
assert longest_palindromic("aaaa") == "aaaa", "The A"
Jan. 22, 2018
