1 链表的实现
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
链表的节点相同是指链表里的值相同,即self.val相等
链表的操作是通过头结点进行操作的,例如一个链表的头结点head,下一个节点就是head.next,头结点的值head.val
例子:输入两个链表,找出它们的第一个公共结点。
# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def FindFirstCommonNode(self, pHead1, pHead2):
# write code here
list1 = []
while pHead1:
list1.append(pHead1.val)
pHead1 = pHead1.next
while pHead2:
if pHead2.val in list1:
return pHead2
else:
pHead2 = pHead2.next