AlphaCat的博客

public abstract class ThreadPoolInitPolicy { protected static volatile ThreadPoolExecutor executor; protected static final int DEFAULT_QUEUE_CAPACITY = 10000; protected static final long DEFAULT_KEEP_ALIVE_TIME = 1L; protected static final Strin

public class MergeSort { void sort(List<Integer> list) { sort(list, 0, list.size() - 1); } List<Integer> sort(List<Integer> list, int l, int r) { List<Integer> res = new ArrayList<>(); if (l == r) { I

int[][] matrixMultiply(int[][] matrix1, int[][] matrix2) { if (matrix1 == null || matrix2 == null) { return null; } if (matrix1[0].length != matrix2.length) { return null; } int m = matrix1.length; int n = matrix2[0].l..

public class Temp { private static int CHESS = 1; private static int EMPTY = 0; void test() { Scanner scanner = new Scanner(System.in); //初始化 int n = 6; int[][] chessBoard = new int[n][n]; List<I

public class BinaryToHex { public String binaryToHex(String s) { s = formatString(s); String[] splitBinaryString = splitBinaryString(s); String hexString = getHex(splitBinaryString); return hexString; } String

双闭区间写法，需要取high private int max_bound(int[][] matrix, int column, int target) { int m = matrix.length; int l = 0; int h = m - 1; while (l <= h) { int mid = l + ((h - l) >> 1); if (matrix[m

private void quickSort(int[] nums, int begin, int end) { if(end>=begin){ return; } int part = partition(nums, begin, end); quickSort(nums, begin, part - 1); quickSort(nums, part + 1, end); } ...