代码随想录day15
数组
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
if(root == null){
return new ArrayList<List<Integer>>();
}
queue.add(root);
while(queue.size() > 0){
int size = queue.size();
ArrayList<Integer> tmp = new ArrayList<Integer>();
for(int i = 0; i < size; i++){
TreeNode t = queue.remove();
tmp.add(t.val);
if(t.left != null){
queue.add(t.left);
}
if(t.right != null){
queue.add(t.right);
}
}
list.add(tmp);
}
return list;
}
}
队列
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
if (root == null) return List.of();
List<List<Integer>> list = new ArrayList<>();
Queue<TreeNode> q = new ArrayDeque<>();
q.add(root);
while (!q.isEmpty()) {
int n = q.size();
List<Integer> vals = new ArrayList<>(n);
while (n-- > 0) {
TreeNode node = q.poll();
vals.add(node.val);
if (node.left != null){
q.add(node.left);
}
if (node.right != null){
q.add(node.right);
}
}
list.add(vals);
}
return list;
}
}
在层序遍历的结果添加一个反转
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
if(root == null){
return new ArrayList<List<Integer>>();
}
queue.add(root);
while(queue.size() > 0){
int size = queue.size();
ArrayList<Integer> tmp = new ArrayList<Integer>();
for(int i = 0; i < size; i++){
TreeNode t = queue.remove();
tmp.add(t.val);
if(t.left != null){
queue.add(t.left);
}
if(t.right != null){
queue.add(t.right);
}
}
list.add(tmp);
}
Collections.reverse(list);
return list;
}
}
在层序遍历的基础上加一个list中每次放入的是我们每层的最后一个元素
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> list = new ArrayList<>();
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
if(root == null){
return list;
}
queue.add(root);
while(queue.size() > 0){
int size = queue.size();
for(int i = 0; i < size; i++){
TreeNode t = queue.remove();
if(t.left != null){
queue.add(t.left);
}
if(t.right != null){
queue.add(t.right);
}
if(i == size-1){
list.add(t.val);
}
}
}
return list;
}
}
class Solution {
public List<Double> averageOfLevels(TreeNode root) {
List<Double> list = new ArrayList<>();
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
if(root == null){
return list;
}
queue.add(root);
while(queue.size() > 0){
int size = queue.size();
double sum = 0;
for(int i = 0; i < size; i++){
TreeNode t = queue.remove();
sum += t.val;
if(t.left != null){
queue.add(t.left);
}
if(t.right != null){
queue.add(t.right);
}
}
list.add(sum / size);
}
return list;
}
}
把访问左右子树改成遍历孩子节点列表。
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
LinkedList<Node> queue = new LinkedList<Node>();
if(root == null){
return new ArrayList<List<Integer>>();
}
queue.add(root);
while(queue.size() > 0){
int size = queue.size();
ArrayList<Integer> tmp = new ArrayList<Integer>();
for(int i = 0; i < size; i++){
Node t = queue.remove();
tmp.add(t.val);
List<Node> children = t.children;
if(children == null || children.size() == 0){
continue;
}
for(Node child : children){
if(chile != null){
queue.add(child);
}
}
}
list.add(tmp);
}
return list;
}
}
在层序遍历的基础上,给每层返回时添加一个判断最大值
class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> list = new ArrayList<>();
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
if(root == null){
return list;
}
queue.add(root);
while(queue.size() > 0){
int max= Integer.MIN_VALUE;
int size = queue.size();
for(int i = 0; i < size; i++){
TreeNode t = queue.remove();
max = Math.max(t.val,max);
if(t.left != null){
queue.add(t.left);
}
if(t.right != null){
queue.add(t.right);
}
}
list.add(max);
}
return list;
}
}
在层序遍历的基础上添加一个在一层链接下一个的指针
class Solution {
public Node connect(Node root) {
List<Node> pre = new ArrayList<>();
pre.add(root);
if(root == null){
return null;
}
while(!pre.isEmpty()){
List<Node> tmp = pre;
pre = new ArrayList<>();
for(int i=0 ; i<tmp.size() ; i++){
Node node = tmp.get(i);
if(i > 0){
tmp.get(i-1).next = node;
}
if(node.left != null){
pre.add(node.left);
}
if(node.right != null){
pre.add(node.right);
}
}
}
return root;
}
}
class Solution {
public Node connect(Node root) {
List<Node> pre = new ArrayList<>();
pre.add(root);
if(root == null){
return null;
}
while(!pre.isEmpty()){
List<Node> tmp = pre;
pre = new ArrayList<>();
for(int i=0 ; i<tmp.size() ; i++){
Node node = tmp.get(i);
if(i > 0){
tmp.get(i-1).next = node;
}
if(node.left != null){
pre.add(node.left);
}
if(node.right != null){
pre.add(node.right);
}
}
}
return root;
}
}
在层序遍历的基础上添加一个记录遍历了几层的计数器
class Solution {
public int maxDepth(TreeNode root) {
List<TreeNode> pre = new ArrayList<>();
pre.add(root);
if(root == null){
return 0;
}
int num = 0;
while(!pre.isEmpty()){
List<TreeNode> tmp = pre;
pre = new ArrayList<>();
for(int i=0 ; i<tmp.size() ; i++){
TreeNode node = tmp.get(i);
if(node.left != null){
pre.add(node.left);
}
if(node.right != null){
pre.add(node.right);
}
}
num++;
}
return num;
}
}
在上一题的基础上添加一个判断条件:
若有一个节点的左右孩子节点均为空时
直接返回此时记录的深度
class Solution {
public int minDepth(TreeNode root) {
List<TreeNode> pre = new ArrayList<>();
pre.add(root);
if(root == null){
return 0;
}
int num = 0;
while(!pre.isEmpty()){
num++;
List<TreeNode> tmp = pre;
pre = new ArrayList<>();
for(int i=0 ; i<tmp.size() ; i++){
TreeNode node = tmp.get(i);
if(node.left == null && node.right == null){
return num;
}
if(node.left != null){
pre.add(node.left);
}
if(node.right != null){
pre.add(node.right);
}
}
}
return num;
}
}
在层序遍历的基础上增加一个反转的部分
class Solution {
public TreeNode invertTree(TreeNode root) {
List<TreeNode> pre = new ArrayList<>();
pre.add(root);
if(root == null){
return null;
}
while(!pre.isEmpty()){
List<TreeNode> tmp = pre;
pre = new ArrayList<>();
for(int i=0 ; i<tmp.size() ; i++){
TreeNode node = tmp.get(i);
if(node.left != null){
pre.add(node.left);
}
if(node.right != null){
pre.add(node.right);
}
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
}
}
return root;
}
}
在判断二叉树是否对称我们比对的是外侧与外侧,内侧与内侧
class Solution {
public boolean isSymmetric(TreeNode root) {
LinkedList<TreeNode> pre = new LinkedList<TreeNode>();
pre.add(root.left);
pre.add(root.right);
if(root == null){
return true;
}
while(!pre.isEmpty()){
TreeNode leftNode = pre.removeFirst();
TreeNode rightNode = pre.removeFirst();
if(leftNode == null && rightNode == null){
continue;
}
if (leftNode == null || rightNode == null || leftNode.val != rightNode.val) {
return false;
}
pre.add(leftNode.left);
pre.add(rightNode.right);
pre.add(leftNode.right);
pre.add(rightNode.left);
}
return true;
}
}