add 1367

Author: luliyucoordinate

Diff for: README.md

@@ -657,4 +657,5 @@ LeetCode
 |1362|[Closest Divisors](https://leetcode.com/problems/closest-divisors/)|c|[c++](./src/1362-Closest-Divisors/1362.cpp)|[python](./src/1362-Closest-Divisors/1362.py)|[go](./src/1362-Closest-Divisors/1362.go)|[js](./src/1362-Closest-Divisors/1362.js)|[java](./src/1362-Closest-Divisors/1362.java)|Medium|
 |1363|[Largest Multiple of Three](https://leetcode.com/problems/largest-multiple-of-three/)|c|[c++](./src/1363-Largest-Multiple-of-Three/1363.cpp)|[python](./src/1363-Largest-Multiple-of-Three/1363.py)|[go](./src/1363-Largest-Multiple-of-Three/1363.go)|[js](./src/1363-Largest-Multiple-of-Three/1363.js)|[java](./src/1363-Largest-Multiple-of-Three/1363.java)|Hard|
 |1365|[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)|c|[c++](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.cpp)|[python](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.py)|[go](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.go)|[js](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.js)|[java](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.java)|Easy|
-|1366|[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)|c|[c++](./src/1366-Rank-Teams-by-Votes/1366.cpp)|[python](./src/1366-Rank-Teams-by-Votes/1366.py)|[go](./src/1366-Rank-Teams-by-Votes/1366.go)|[js](./src/1366-Rank-Teams-by-Votes/1366.js)|[java](./src/1366-Rank-Teams-by-Votes/1366.java)|Medium|
+|1366|[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)|c|[c++](./src/1366-Rank-Teams-by-Votes/1366.cpp)|[python](./src/1366-Rank-Teams-by-Votes/1366.py)|[go](./src/1366-Rank-Teams-by-Votes/1366.go)|[js](./src/1366-Rank-Teams-by-Votes/1366.js)|[java](./src/1366-Rank-Teams-by-Votes/1366.java)|Medium|
+|1367|[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/)|c|[c++](./src/1367-Linked-List-in-Binary-Tree/1367.cpp)|[python](./src/1367-Linked-List-in-Binary-Tree/1367.py)|[go](./src/1367-Linked-List-in-Binary-Tree/1367.go)|[js](./src/1367-Linked-List-in-Binary-Tree/1367.js)|[java](./src/1367-Linked-List-in-Binary-Tree/1367.java)|Medium|

Diff for: src/1367-Linked-List-in-Binary-Tree/1367.cpp

@@ -0,0 +1,34 @@
+class Solution 
+{
+public:
+    bool isSubPath(ListNode* head, TreeNode* root) 
+    {
+        f.emplace_back(-1);
+        int i = -1;
+        ListNode* node = head;
+        
+        while (node != nullptr) 
+        {
+            while (i != -1 && node != nullptr && node->val != arr[i]) i = f[i];
+            i++;
+            f.emplace_back(i);
+            arr.emplace_back(node->val);
+            node = node->next;
+        }
+        
+        return dfs(root, 0);
+    }
+private:
+    vector<int> arr, f;
+    
+    bool dfs(TreeNode* node, int u) 
+    {
+        if (node == nullptr) return false;
+
+        while (u != -1 && node->val != arr[u]) u = f[u];
+        u++;
+
+        if (u == arr.size()) return true;
+        return dfs(node->left, u) || dfs(node->right, u);
+    }
+};

Diff for: src/1367-Linked-List-in-Binary-Tree/1367.go

@@ -0,0 +1,35 @@
+var arr, f []int
+
+func isSubPath(head *ListNode, root *TreeNode) bool {
+    arr, f = []int{}, []int{-1}
+    i, node := -1, head
+    
+    for node != nil {
+        for i != -1 && node != nil && node.Val != arr[i] {
+            i = f[i]
+        }
+        i++
+        
+        arr = append(arr, node.Val)
+        f = append(f, i)
+        node = node.Next
+    }
+    
+    return dfs(root, 0)
+}
+
+func dfs(root *TreeNode, u int) bool {
+    if root == nil {
+        return false
+    }
+    
+    for u != -1 && arr[u] != root.Val {
+        u = f[u]
+    }
+    u++
+    
+    if u == len(arr) {
+        return true
+    }
+    return dfs(root.Left, u) || dfs(root.Right, u)
+}

Diff for: src/1367-Linked-List-in-Binary-Tree/1367.java

@@ -0,0 +1,32 @@
+class Solution {
+    public boolean isSubPath(ListNode head, TreeNode root) {
+        arr = new ArrayList();
+        f = new ArrayList();
+        f.add(-1);
+        int i = -1;
+        ListNode node = head;
+        
+        while (node != null) {
+            while (i != -1 && node != null && node.val != arr.get(i)) i = f.get(i);
+            i++;
+            f.add(i);
+            arr.add(node.val);
+            node = node.next;
+        }
+        return dfs(root, 0);
+    }
+    
+    private List<Integer> arr, f;
+    
+    private boolean dfs(TreeNode node, int u) {
+        if (node == null) return false;
+        
+        while (u != -1 && node.val != arr.get(u)) {
+            u = f.get(u);
+        }
+        u++;
+            
+        if (u == arr.size()) return true;
+        return dfs(node.left, u) || dfs(node.right, u);
+    }
+}

Diff for: src/1367-Linked-List-in-Binary-Tree/1367.js

@@ -0,0 +1,25 @@
+var isSubPath = function(head, root) {
+    let arr = [], f = [-1];
+    let node = head, i = -1;
+    
+    while (node != null) {
+        while (i != -1 && node != null && node.val != arr[i]) i = f[i];
+        i++;
+        
+        arr.push(node.val);
+        f.push(i);
+        node = node.next;
+    }
+    
+    let dfs = function(cur, u) {
+        if (cur == null) return false;
+        
+        while (u != -1 && cur.val != arr[u]) u = f[u];
+        u++;
+        
+        if (u == arr.length) return true;
+        return dfs(cur.left, u) || dfs(cur.right, u);
+    }
+    
+    return dfs(root, 0);
+};

Diff for: src/1367-Linked-List-in-Binary-Tree/1367.py

@@ -0,0 +1,20 @@
+class Solution:
+    def isSubPath(self, head: ListNode, root: TreeNode) -> bool:
+        arr, f = [], [-1]
+        i, node = -1, head
+        while node: # 计算next数组
+            while i != -1 and node and node.val != arr[i]:
+                i = f[i]
+            i += 1
+            f.append(i)
+            arr.append(node.val)
+            node = node.next
+
+        def dfs(root, u):
+            if not root: return False
+            while u != -1 and root.val != arr[u]:
+                u = f[u]
+            u += 1
+            if u == len(arr): return True
+            return dfs(root.left, u) or dfs(root.right, u)
+        return dfs(root, 0)

Diff for: src/addProb.py

@@ -2,9 +2,9 @@
 import os, bisect
 
 # 题目名称
-name = "Rank Teams by Votes"
-ID = 1366
-url = "https://leetcode.com/problems/rank-teams-by-votes/"
+name = "Linked List in Binary Tree"
+ID = 1367
+url = "https://leetcode.com/problems/linked-list-in-binary-tree/"
 difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']