zerorains的刷题记录
杂题记录
部分解题思路源自好友:therainisme
2021.4.25 dfs
判断是否为相同的树
解题思路:采用dfs,对这两棵树同时遍历,直到,这两棵树不同或完成为止
12345678910111213141516171819202122232425/** * 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) {& ...