def main():
head = ListNode.array2list([1, 2, 2, 1, 1])
print Solution().isPalindrome(head)
head.trace()
print Solution()._find_middle(head)
h = Solution._reverse(ListNode.array2list([1, 2, 3, 4, 5]))
h.trace()
def main():
head = ListNode.array2list([1,2,2,1,1])
print Solution().isPalindrome(head)
head.trace()
print Solution()._find_middle(head)
h = Solution._reverse(ListNode.array2list([1,2,3,4,5]))
h.trace()
def test_partition_list():
head = ListNode.array2list([1,4,3,2,5,2])
head.trace()
s = Solution()
ret = s.partition(None, 0)
if ret:
ret.trace()
def test_partition_list():
head = ListNode.array2list([1, 4, 3, 2, 5, 2])
head.trace()
s = Solution()
ret = s.partition(None, 0)
if ret:
ret.trace()
def test_reverse_list():
head = ListNode.array2list([
1,
2,
3,
])
head.trace()
head = Solution().reverseList(None)
if head:
head.trace()
def test_circle_detect():
head = ListNode.array2list([1,2,3,4])
node = head
while node:
if not node.next:
break
node = node.next
node.next = head
ret = Solution().detectCycle(head)
if ret:
print ret.val
def test_circle_detect():
head = ListNode.array2list([1, 2, 3, 4])
node = head
while node:
if not node.next:
break
node = node.next
node.next = head
ret = Solution().detectCycle(head)
if ret:
print ret.val
def test_reverse_list():
head = ListNode.array2list([1,2,3,])
head.trace()
head = Solution().reverseList(None)
if head:
head.trace()
def test_rotate_right():
head = ListNode.array2list([1, 2, 3, 4])
head.trace()
head = Solution().rotateRight(head, 5)
if head:
head.trace()
def main():
head = ListNode.array2list([1,2,3,4])
t = head.next
Solution().deleteNode(t)
head.trace()
def main():
head = ListNode.array2list([1, 2, 3, 4])
t = head.next
Solution().deleteNode(t)
head.trace()
def test_rotate_right():
head = ListNode.array2list([1,2,3,4])
head.trace()
head = Solution().rotateRight(head, 5)
if head:
head.trace()
