链表的节点长度

#参数head是链表的头部
#返回值是链表的长度
class ListNode(object):
def init(self, val, next=None):
self.val = val
self.next = next
class Solution:
def countNodes(self, head):
cnt = 0
while head is not None:
cnt += 1
head = head.next
return cnt
#主函数
if name == ‘main’:
node1 = ListNode(1)
node2 = ListNode(2)
node3 = ListNode(3)
node4 = ListNode(4)
node1.next = node2
node2.next = node3
node3.next = node4
solution = Solution()
print("输入: ", node1.val,node2.val,node3.val,node4.val)
print("输出: ", solution. countNodes(node1))