qq_38522268的博客

class Test{ public static int re(){ return new Random().nextInt(7)+1; } public static int re1(){ int i=re()-1; int j=re()-1; i=i*7+j;//i的范围0-48 /...

第一种，通过 Integer.bitCount(index) 方法public int[] countBits(int num) { int[] memo = new int[num + 1]; int index = 0; while (index <= num) { memo[index] = Integer.bitCount(index);...

最简单的递归便宜方程为LCS(m,n)：求s1[0...m] 和s2[0...n]的最长公共子序列changdu偏移状态：s1[m] ==s2[n]?1+LCS(m-1,n-1):max(LCS(m-1,n),LCS(m,n-1))详细代码： public class Wigglemaxlength { private char[] s1; p...

public class MaxHeap<E extends Comparable<E>> { private ArrayList<E> data; private MaxHeap(int capacity) { data = new ArrayList<>(capacity); } privat...

下面的方法是将nums里的元素频率最高的前k个元素存放到List里返回public List<Integer> top(int[] nums, int k) { HashMap<Integer, Integer> map = new HashMap<>(); for (int i : nums) { int count = m...

二叉树类public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; }}前序：public class Solution { public List<Integer> preorde...

二叉树类public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; }}前序：public class Solution { private List<Integer> list=n...

public class TreeTraversal { public int intree(String preTree, String postTree) { if(preTree.length()==1){ return 1; } int count=0; for (int i = 0; ...

现有5个取值区间[1,2],[4,6],[3,6],[9,10],[8,17]将这5个取值区间去掉重复的部分，合并起来为[1,2],[3,6],[8,17]创建区间类@Datapublic class Interval { private Integer left; private Integer right; public Interva...

第一种public class Sum { public static int summ(int[] input) { if (input.length == 0 || input == null) { throw new IndexOutOfBoundsException("IndexOutOfBoundsException "); ...

public class TreeUnionFindPathCompressionRecur { //使用数组构建一棵指向父亲点的树 private int[] parent; //此时的rank并不反映节点的实际深度值 //路径压缩后不需要再维护rank private int[] rank; public TreeUnionFindPath...

int[] ints = new int[]{1, 9, 4, 6, 2, 5};int i=0;int a = ints[i];while (a!=4&&i<ints.length-1){ System.out.println(a); a=ints[i++];}System.out.println(a);ints 是一组不按顺序排列的整数数组...

for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { if(i==j){ continue; } System.out.println("i="+i+" j="+j); }}使用continue，当i==j时跳出执行j++...

使用递归的创建class ListNode { int val; ListNode next; ListNode(int x) { val = x; } ListNode(int[] input) { if (input == null || input.length == 0) { ...