力扣刷题记录154.1-----100. 相同的树

最新推荐文章于 2024-08-26 22:22:22 发布

@白圭

最新推荐文章于 2024-08-26 22:22:22 发布

阅读量51

点赞数

分类专栏： # 力扣习题记录册__C++__代码随想录

本文链接：https://blog.csdn.net/taiyuezyh/article/details/128107885

版权

leetcode 算法数据结构

力扣习题记录册__C++__代码随想录专栏收录该内容

174 篇文章 0 订阅

订阅专栏

一、题目

在这里插入图片描述

二、代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution 
{
public:
    vector<int> record_p;
    vector<int> record_q;  
    void recursion(TreeNode* process_node, vector<int> & process_vector)
    {
        if(process_node==nullptr)  return;


        process_vector.push_back(process_node->val);
        
        // if(process_node->left)  recursion(process_node->left,process_vector);   
        // else process_vector.push_back(10001); 

        // if(process_node->right)   recursion(process_node->right,process_vector);
        // else process_vector.push_back(10001); 

        if(process_node->left&&!process_node->right)  // 完善版本
        {
            recursion(process_node->left,process_vector);
            process_vector.push_back(10001); 
        }
         else if(!process_node->left&&process_node->right)
        {
            process_vector.push_back(10001);
            recursion(process_node->right,process_vector);        
        }
        else if(process_node->left&&process_node->right)
        {
            recursion(process_node->left,process_vector);
            recursion(process_node->right,process_vector);  
        }
        else if(!process_node->left&&process_node->right)
        {

        }

    }
    bool isSameTree(TreeNode* p, TreeNode* q) 
    {
        int i,j;
        bool return_bool=1;

        recursion(p,record_p);
        // for(i=0;i<record_p.size();i++) std::cout<<"  "<<record_p[i];
        // std::cout<<std::endl;

        recursion(q,record_q);
        // for(i=0;i<record_q.size();i++) std::cout<<"  "<<record_q[i];
        // std::cout<<std::endl;

        if(record_p.size()!=record_q.size()) return_bool=0;
        else
        {
           for(i=0;i<record_p.size();i++)
           {
               if(record_p[i]!=record_q[i])
               {
                   return_bool=0;
                   break;
               }
           }
        } 

        return return_bool;
    }
};