最近挺忙的,先是体测,他喵的又是73,差两分75,奖学金啥的,大学无望了。又参加了网上编程小比赛,菜的跟鬼一样。下周又要考试,体测这个鬼样子,也是学不进去了。重心直接放在了考研上面了......班里有个女生,家里人出了车祸,我作为班长,也是向老师反映,在群里转发等,大家也都捐了不少钱,最近看着状态也挺好,生活不容易...无论如何,都要一点一滴,努力向前走。十月份也算是有件开心事吧,挺有好感的一个女生,及时提醒了我一件事(一个单元测试作业),嘿嘿...也就这点出息了。
官方答案:作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/binary-tree-level-order-traversal/solution/er-cha-shu-de-ceng-xu-bian-li-by-leetcode-solution/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
个人微改:
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
class Traversal{
public List<List<Integer>> levelOrder(TreeNode root){
List<List<Integer>> ret = new ArrayList<List<Integer>>();
if(root == null) {
return ret;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.offer(root);
while(!queue.isEmpty()) {
List<Integer> level = new ArrayList<Integer>();
int currentSize = queue.size();
for(int i = 1;i<=currentSize;i++) {
TreeNode node = queue.poll();
level.add(node.val);
if(node.left!=null) {
queue.offer(node.left);
}
if(node.right!=null) {
queue.offer(node.right);
}
}
ret.add(level);
}
return ret;
}
}
public class BinaryTreeLevelOrderTraversal {
public static TreeNode stringToTreeNode(String input) {
input = input.trim();
input = input.substring(1,input.length()-1);
if(input.length()==0) {
return null;
}
String[] parts = input.split(",");
String item = parts[0];
TreeNode root = new TreeNode(Integer.parseInt(item));
Queue<TreeNode> nodeQueue = new LinkedList<>();
nodeQueue.add(root);
int index = 1;
while(!nodeQueue.isEmpty()) {
TreeNode node = nodeQueue.remove();
if(index == parts.length) {
break;
}
item = parts[index++];
item = item.trim();
if(!item.equals("null")) {
int leftNumber = Integer.parseInt(item);
node.left = new TreeNode(leftNumber);
nodeQueue.add(node.left);
}
if(index == parts.length) {
break;
}
item = parts[index++];
item = item.trim();
if(!item.equals("null")) {
int rightNumber = Integer.parseInt(item);
node.right = new TreeNode(rightNumber);
nodeQueue.add(node.right);
}
}
return root;
}
public static String integerArrayListToString(List<Integer> nums,int length) {
if(length == 0) {
return "[]";
}
String result = "";
for(int index = 0;index < length;index++) {
Integer number = nums.get(index);
result += Integer.toString(number) + ", ";
}
return "[" + result.substring(0,result.length()-2) + "]";
}
public static String integerArrayListToString(List<Integer> nums) {
return integerArrayListToString(nums,nums.size());
}
public static String int2dListToString(List<List<Integer>> nums) {
StringBuilder sb = new StringBuilder("[");
for(List<Integer> list: nums) {
sb.append(integerArrayListToString(list));
sb.append(",");
}
sb.setCharAt(sb.length()-1, ']');
return sb.toString();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
String line = "[3,9,20,null,null,15,7]";
TreeNode root = stringToTreeNode(line);
List<List<Integer>> ret = new Traversal().levelOrder(root);
String out = int2dListToString(ret);
System.out.println(out);
}
}