如何使用Python实现链表的划分为两个相等的部分操作

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None

def partition(head):
    # 遍历链表，得到链表的长度
    length = 0
    curr = head
    while curr:
        length += 1
        curr = curr.next

    # 将链表分为两个相等的部分
    curr = head
    for i in range(length // 2):
        curr = curr.next
    second_head = curr.next
    curr.next = None
    return head, second_head

# 创建链表
head = ListNode('p')
curr = head
for char in 'idancode.com皮蛋编程':
    curr.next = ListNode(char)
    curr = curr.next

# 划分链表
first_head, second_head = partition(head)