Qgfzzzzzz

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-2-28 * @Version 1.0 * * This Algorithm is bubblesort. * comfirm one maximum every time * * time : o(n * n) * space : o(1) * */ ...

前序遍历 递归版 /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.val = val; * ...

合并K个排序链表 合并k个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。 输入: [ 1->4->5, 1->3->4, 2->6 ] 输出: 1->1->2->3->4->4->5->6 时间复杂度是O(N * log K) N是结点总数，K是链表总数 /** * Definitio...

package class_07; /** * @Author qgfzzzzzz * @Date 19-3-8 * @Version 1.0 */ public class Code_01_TrieTree { public static class TrieNode { public int path; public int end; ...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-3-1 * @Version 1.0 */ public class Code_08_NetherlandsFlag { public static int[] partition(int[] arr, int l, int r, int p){ ...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-3-1 * @Version 1.0 * * This Algorithm is bucket sort * time : o(n) * space : o(n) */ public class Code_06_BucketSort { public ...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-3-1 * @Version 1.0 * * This is merge sort * T(N) = 2 * T(N /2) + O(N) * * master : T(N) = a * T(N / b) + o(N ^ d) * 1) log(b, a) &...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-3-1 * @Version 1.0 * * The time : o(n * n) and the space is : o(n) in the worst case; * The random quick sort' time : 0(n * logn) and...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-3-1 * @Version 1.0 * * This is heap sort * time : o(n * logn) * space : o(1) */ public class Code_03_HeapSort { public static...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-2-28 * @Version 1.0 * * This Algorithm is selectionsort */ public class Code_02_SelectionSort { public static void selectionSort...

package basic_class_01; /** * @Author qgfzzzzzz * @Date 19-2-28 * @Version 1.0 * * This Algorithm is insertionsort * * time : o(n * n) * space : o(1) */ public class Code_01_InsertionSort {...

最小调整代价 描述 给一个整数数组，调整每个数的大小，使得相邻的两个数的差不大于一个给定的整数target，调整每个数的代价为调整前后的差的绝对值，求调整代价之和最小是多少。 样例 样例 1: 输入: [1,4,2,3], target=1 输出: 2 样例 2: 输入: [3,5,4,7], target=2 输出: 1 代码 public class Sol...