数据结构

排序一、十大排序算法分析 二、排序算法代码2.1 冒泡排序 123456789101112131415161718192021222324// 冒泡排序class BubbleSort{ /** * 时间复杂度 O(n^2) <br/> * 空间复杂度 O(1) <br/> * @param arr 待排序数组 */ public static void bubbleSort(int[] arr){ System.out.println("before bubbleSort \t ==> " + Arrays.stream(arr).boxed().toList()); int length = arr.length; for (int i = 0; i < length; i++) { for (int j = i + 1; j < length; j++) { ...

二叉树1234567891011121314151617181920212223public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} TreeNode(int val) { this.val = val; } TreeNode(int val, TreeNode left, TreeNode right) { this.val = val; this.left = left; this.right = right; } public static TreeNode createTree(){ TreeNode root = new TreeNode(1); root.left = new TreeNode(2); root.left.left ...