题目要求是将一颗树修剪成满二叉树,当时没做出来,后续自己想到这种方法不知道可行否。
class Solution1 {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
* 你需要返回一个指针,指向root,表示删减去若干个点后,剩下的树
*
* @param root TreeNode类 指向二叉树的根
* @return TreeNode类
*/
public TreeNode solve(TreeNode root) {
if (root == null || (root.left == null && root.right == null)) return root;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
int level = 0;
while (queue.size() != 0) {
int size = queue.size();
List<TreeNode> currentLevel = new ArrayList<>();
for (int i = 0; i < size; i++) {
TreeNode cur = queue.remove();
if (cur.left != null) {
queue.offer(cur.left);
currentLevel.add(cur.left);
}
if (cur.right != null) {
queue.offer(cur.right);
currentLevel.add(cur.right);
}
}
level++;
if (currentLevel.size() != Math.pow(2, level)) { //说明此层不满,保留以上所有层
dfs(root, level - 1, 0);
break;
}
}
return root;
}
public void dfs(TreeNode root, int level, int layer) {
if (layer == level) {
root.left = null;
root.right = null;
return;
}
layer++;
dfs(root.left, level, layer);
dfs(root.right, level, layer);
}
}