参考博客:https://blog.csdn.net/whm114336793/article/details/79996943
思想:使用快慢指针,当快指针走的终点的时候,慢指针在中间的位置,把中间到最后的位置开始倒序链表。其中要分奇偶考虑,如果是奇数,slow = slow—>next。然后将前半部分和后半部分分别从两头开始比较元素是否相等。此算法时间复杂度O(N),空间复杂度O(1)。
代码如下:
'''
参考的博客:https://blog.csdn.net/whm114336793/article/details/79996943
'''
class Node(object):
def __init__(self, data, next=None):
"Instantiates a Node with a default next of None."
self.data = data
self.next = next
# 得到的是逆序的:不过此问题中没有影响
def getLinkedList(str):
head = None
# Add nodes to the linked structure
for item in str:
# print(item)
head = Node(item, head)
# print("head.data:", head.data)
# print("before:", head.next)
return head
def isPalindrome(node, isEven):
if (node == None):
return True
elif (node.next == None):
return True
else:
fast = node
slow = node
# 偶数
while ((fast.next.next != None) & (isEven == True)):
# print("fast.data", fast.data)
# print("slow.data", slow.data)
fast = fast.next.next
slow = slow.next
# 奇数
while ((fast.next != None) & (isEven == False)):
# print("fast.data", fast.data)
# print("slow.data", slow.data)
fast = fast.next.next
slow = slow.next
# 如果节点个数是奇数,跳过中间的节点
if (fast != None):
slow = slow.next
print("slow.data:", slow.data)
# 记录中间节点的下一个节点
high = slow.next
# 中间位置上的节点的下一个节点指向null
slow.next = None
temp = None
# 跟头插法还不太一样
while (high != None):
temp = high.next
high.next = slow
slow = high
high = temp
# 记录开始的头节点
temp = node
# 记录后半部分的头节点
high = slow
flag = True
while ((temp != None) & (high != None)):
if (temp.data != high.data):
flag = False
break
temp = temp.next
high = high.next
return flag
def main():
if __name__ == '__main__':
# 判断是否为偶数
isEven = False
str = "abcdeffdcba"
length = len(str)
if (length % 2) == 0:
isEven = True
else:
isEven = False
node = getLinkedList(str)
print("isEven:", isEven)
flag = isPalindrome(node, isEven)
print("result:", flag)
main()
注意:分奇偶讨论还有一个地方需要考虑,就是如果参考博客中的写法:
while ((fast.next != None) & (fast.next.next != None))
这种情况对于包含偶数个元素的字符串没有问题,但是当字符串包含偶数个元素时while条件所在行就会报错如下:
原因如下:
上面的蓝色箭头代表fast节点,下面的红色箭头代表slow节点,当fast指向元素c所在的节点时,fast.next.next 指向元素a所在的节点,满足while条件,故执行下面的语句:fast = fast.next.next slow = slow.next 此时fast指向元素a所在的节点,再去判断是否满足while循环,但是此时a—>next = null,所以a—>next没有next属性了,就会报错!!!!