第七天——搜索与回溯算法
第一题:剑指 Offer 26. 树的子结构
文章描述
思路
B为A的子结构有三种情况
- B为A的左子树
- B为A的右子树
- B跟A相等
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSubStructure(TreeNode A, TreeNode B) {
return (A != null && B != null) && (DFS(A,B) || isSubStructure(A.left,B) || isSubStructure(A.right,B));
}
public boolean DFS(TreeNode A,TreeNode B){
if(B == null) return true;
if(A == null || A.val != B.val) return false;
return DFS(A.left, B.left) && DFS(A.right,B.right);
}
}
第二题:剑指 Offer 27. 二叉树的镜像
文章描述
思路
思路一:
利用辅助栈,层次遍历一层后装入栈中,然后交换左右两边的值
思路二:
新建一个节点存放左子树的节点,然后递归将右子树节点值递归到左节点值中,这样左节点的值都是右节点值,然后存放左节点的新节点的值放到右节中;这样左右两节点就交换了;题目要求就达到了。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode mirrorTree(TreeNode root) {
Stack<TreeNode> stack = new Stack<>();
if(root != null) stack.add(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
if(node.left != null) stack.add(node.left);
if(node.right != null) stack.add(node.right);
TreeNode tmp = node.left;
node.left = node.right;
node.right = tmp;
}
return root;
}
}
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if(root == null) return null;
TreeNode node = root.left;
root.left=mirrorTree(root.right);
root.right=mirrorTree(node);
return root;
}
}
第三题:剑指 Offer 28. 对称的二叉树
文章描述
思路
递归思想;先判断树是否存在,若不存在则是,然后开始递归后面的值,也就是把左子树的节点值跟右子树节点值比较,若相等则为对称二叉树;
赋值一个大佬的思路(题目评论的解题思路)思路链接
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
if(root == null) return true;
return def(root.left,root.right);
}
public boolean def(TreeNode left,TreeNode right){
if(left == null && right == null) return true;
if(left == null || right == null || left.val != right.val) return false;
return def(left.left , right.right) && def(left.right , right.left);
}
}