lgz0921的博客

非常简单不解释，不会的博友，请关注评论哪儿里不理解即可~~~上代码：public class Main { static void swap(int a[],int x,int y){ int tmp = a[x]; a[x]=a[y]; a[y]=tmp; } static void fullPermutation(int a[],int len,int index){ if(index == len-1

package Algorithm;class Node{ int val; Node next; public Node(int val){ this.val=val; }}public class ReverseList { private static Node creatList(){ Node head = new Node(1); Node p = head; for (int .

package Algorithm;import java.util.PriorityQueue;public class MaxK { private static int priorityQueue(int[] a,int k){ PriorityQueue<Integer> queue = new PriorityQueue<>(); for (int i = 0;i < a.length;i++){ .

package Tree;import java.util.*;class TreeNode { public int val; public TreeNode leftChild; public TreeNode rightChild; public TreeNode(int val) { this.val = val; }}public class Ergodic { private static TreeNode cr.

1.快速排序package dataStructure;import java.util.Arrays;public class QuickSort { private static int adjust(int[] a, int l, int r) { int x = a[l]; while (l < r) { while (l<r && a[r] >= x){ .