1367. Linked List in Binary Tree

必须是连续的，所以单独需要一个dfs，不能断开查找。
测试不同的root，也需要一个dfs

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */


class Solution {
public:
    
    vector<int> list2vec(ListNode*& head){
        vector<int> res;
        while(head!=NULL){
            res.push_back(head->val);
            head = head->next;
        }
        return res;
    }
    
    // judge this line is right or not
    bool dp(TreeNode*& root, vector<int>& nums, int pos){
        if (pos==nums.size()){
            return true;
        }
        if (root==NULL){
            return false;
        }
        
        if (nums[pos]==root->val){
            bool res1 = dp(root->left, nums, pos+1);
            bool res2 = dp(root->right, nums, pos+1);
            if (res1||res2){
                return true;
            }
            else{
                return false;
            }
        }
        else{
            return false;
        }
    }
    
    bool func(vector<int>& nums, TreeNode*& root){
        if (root==NULL){return false;}
        bool res1 = dp(root, nums, 0);
        bool res2 = func(nums, root->left);
        bool res3 = func(nums, root->right);
        return (res1||res2||res3);
    }
    
    
    bool isSubPath(ListNode* head, TreeNode* root) {
        vector<int> nums = list2vec(head);
        bool res = func(nums, root);
        return res;
    }
};