leetcode1367

 1 class Solution:
 2     def __init__(self):
 3         self.l = []
 4 
 5     def preOrder(self,node,temp):
 6         if node != None:
 7             temp.append(str(node.val))
 8             if node.left != None:
 9                 self.preOrder(node.left,temp)
10             if node.right != None:
11                 self.preOrder(node.right,temp)
12             if node.left == None and node.right == None:
13                 s = ‘|‘.join(temp)
14                 self.l.append(s)
15             temp.pop(-1)
16 
17 
18     def isSubPath(self, head: ‘ListNode‘, root: ‘TreeNode‘) -> bool:
19         self.preOrder(root,[])
20         #print(self.l)
21         comp = []
22         while head != None:
23             comp.append(str(head.val))
24             head = head.next
25         target = ‘|‘.join(comp)
26         for l in self.l:
27             if l.find(target) >= 0:
28                 return True
29         return False