leetcode : subtree of another tree
来源:互联网 发布:网络实体店怎么开 编辑:程序博客网 时间:2024/06/07 21:58
题:给出两棵二叉树,判断一颗是不是另一颗的子树
代码:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */#include <sstream>using namespace std;class Solution {private: stringstream ss1,ss2; void preorderedTree(TreeNode* node,stringstream& s){ if(node==nullptr)s<<" n"; else{ s<<' '<<(node->val); preorderedTree(node->left,s); preorderedTree(node->right,s); } }public: bool isSubtree(TreeNode* s, TreeNode* t) { preorderedTree(s,ss1); ss1<<' e'; preorderedTree(t,ss2); return ss1.str().find(ss2.str())!=ss1.str().npos; }};
注意点:
①每次往stringsream里塞入结点value时要用空格隔开,否则若输入[12],[2]会返回true。
②null结点也要输入stringstream,否则若输入[4,1,2,0],[4,1,2]会返回true。
③string.find(str)!=string.npos才能判定str是否在string中。
阅读全文
0 0
- LeetCode: Subtree of Another Tree
- leetcode : subtree of another tree
- LeetCode Subtree of Another Tree
- [LeetCode] Subtree of Another Tree
- 【LeetCode】Subtree of Another Tree 解题报告
- [LeetCode]572. Subtree of Another Tree
- [leetcode]: 572. Subtree of Another Tree
- leetcode 572. Subtree of Another Tree
- [leetcode: Python]572. Subtree of Another Tree
- [leetcode]572. Subtree of Another Tree
- LeetCode 572. Subtree of Another Tree
- [LeetCode] 572. Subtree of Another Tree
- LeetCode-572. Subtree of Another Tree (Java)
- Leetcode-572. Subtree of Another Tree
- LeetCode 572 Subtree of Another Tree
- leetcode 572. Subtree of Another Tree
- LeetCode 572. Subtree of Another Tree
- [LeetCode]572. Subtree of Another Tree
- python中mysql基本操作
- MongoDB C++开发环境搭建
- 分布式消息系统:Kafka
- 使用Maven运行Java main的3种方式
- 数据控制、定义、操作
- leetcode : subtree of another tree
- 问题寻找之表格内标签定位行数
- Safari浏览器无法播放视频资源(Java后台SSM架构)的解决方法
- Apache ZooKeeper简介
- UVA 1401 Remember the Word(DP+字典树Trie)
- android LayoutAnimation
- 编写简单的连接MongoDB数据库C++程序 && 解决编译C++程序时链接MongoDB动态库失败的问题
- 分布式dubbo + zookeeper
- BAT内部级别与薪资待遇