本文整理汇总了Python中MyLibrary.LinkedLists.SinglyLinkedLists.SinglyLinkedList.SinglyLinkedList.populateNewListStartingFromALinkedListNode方法的典型用法代码示例。如果您正苦于以下问题：Python SinglyLinkedList.populateNewListStartingFromALinkedListNode方法的具体用法？Python SinglyLinkedList.populateNewListStartingFromALinkedListNode怎么用？Python SinglyLinkedList.populateNewListStartingFromALinkedListNode使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类MyLibrary.LinkedLists.SinglyLinkedLists.SinglyLinkedList.SinglyLinkedList的用法示例。
在下文中一共展示了SinglyLinkedList.populateNewListStartingFromALinkedListNode方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: method1
# 需要导入模块: from MyLibrary.LinkedLists.SinglyLinkedLists.SinglyLinkedList import SinglyLinkedList [as 别名]
# 或者: from MyLibrary.LinkedLists.SinglyLinkedLists.SinglyLinkedList.SinglyLinkedList import populateNewListStartingFromALinkedListNode [as 别名]
def method1(self):
'''
1. Go to the centre of the list using the slow and fast pointer approach
2. Create another reversed list starting from the second half
3. Compare this new list with the original list head and stop when the new list hits None
:return: Boolean
'''
centreOfLinkedList = self.singlyLinkedListObject.returnCentreOfTheLinkedList()
if centreOfLinkedList is None:
# print "Empty List is a palindrome"
return True
newHalfList = SinglyLinkedList()
newHalfList.populateNewListStartingFromALinkedListNode(centreOfLinkedList.nextPointer)
#Reversing
ReverseASinglyLinkedList.Solution().reverseOriginalList_Iterative(newHalfList)
originalListCurrentNode = self.singlyLinkedListObject.head
for dataFromSecondHalf in newHalfList:
if originalListCurrentNode.data != dataFromSecondHalf:
# print "Not a palindrome"
return False
originalListCurrentNode = originalListCurrentNode.nextPointer
# print "Linked List is a palindrome"
return True