奋斗吧010

代码实现：TreeNode 实体类public class TreeNode implements Serializable { public int val = 0; public TreeNode left = null; public TreeNode right = null; public TreeNode(int val) { this.val = val; }}测试类 @Test public void test(.

public static class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } public static void main(String[] args) { TreeNode

01.选择排序 public static void main(String[] args) { int[] s = {3, 2, 1, 4, 5}; for (int i = 0; i < s.length - 1; i++) { for (int j = i + 1; j < s.length - 1; j++) { if (s[i] > s[j]) {

例如：给定的二叉树是{3,9,20,#,#,15,7},该二叉树层序遍历的结果是[[3],[9,20],[15,7]]代码：public class BinaryTreeLevelOrder { public static class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int v

public class Tesss { public static class ListNode { int val; ListNode next = null; public ListNode(int val) { this.val = val; } } public static void main(String[] args) { ListNode listNode