题解 | #牛群Z字型排列#
牛群Z字型排列
https://www.nowcoder.com/practice/50ddaf50c6954600a9f1dbb099d6f388?tpId=354&tqId=10591743&ru=/exam/oj&qru=/ta/interview-202-top/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D354
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return int整型二维数组
*/
public int[][] ZLevelOrder (TreeNode root) {
if (root == null) {
return new int [0][0];
}
LinkedList<TreeNode> linkedList = new LinkedList<>();
ArrayList<ArrayList<Integer>> arrayLists = new ArrayList<>();
linkedList.add(root);
int flag = 1;
while (!linkedList.isEmpty()) {
ArrayList<Integer> arrayList = new ArrayList<>();
for (TreeNode treeNode : linkedList) {
arrayList.add(treeNode.val);
}
if (flag % 2 == 0) {
Collections.reverse(arrayList);
arrayLists.add(arrayList);
} else {
arrayLists.add(arrayList);
}
flag++;
int size = linkedList.size();
while (size-- > 0) {
TreeNode node = linkedList.poll();
if (node.left != null) {
linkedList.add(node.left);
}
if (node.right != null) {
linkedList.add(node.right);
}
}
}
// 将列表转换为二维数组
int[][] array = new int[arrayLists.size()][];
for (int i = 0; i < arrayLists.size(); i++) {
List<Integer> sublist = arrayLists.get(i);
int [] temp = new int[sublist.size()];
for (int j = 0; j < sublist.size(); j++) {
temp[j] = sublist.get(j);
}
array[i] = temp;
}
return array;
}
}
本题知识点分析:
1.二叉树层序遍历
2.集合的存取
3.集合转二维数组(Stream流会极大增加用时,不如手写)
本题解题思路分析:
1.在二叉树遍历的同时,将每一层的数值取出
2.根据单双层判断是否需要翻转,双层翻转,单层不翻转
3.最后将集合转二维数组返回即可
关键点:如果是null,返回空数组即可(测试用例)
本题使用编程语言: Java
如果本篇文章对您有帮助的话,可以点个赞支持一下,感谢~

查看19道真题和解析