cxy_jzli的博客

package class07;import java.util.ArrayList;import java.util.List;public class Code04_PathSumII { //路径为特定值且保存到list中 // 测试链接：https://leetcode.com/problems/path-sum-ii public static class TreeNode { public int val; public TreeNode lef...

package class05;import java.util.HashSet;// 这个类的实现是错误的// 请问为什么？public class Code01_BitMap1 { public static class BitMap { private long[] bits; public BitMap(int max) { bits = new long[(max + 64) >> 6]; } public void add(int num.

package class04;import java.util.ArrayList;import java.util.List;public class Code01_ReverseList { public static class Node { public int value; public Node next; public Node(int data) { value = data; } } public static class DoubleNod.

package class02;public class Code01_PreSum { public static class RangeSum1 { private int[] arr; public RangeSum1(int[] array) { arr = array; } public int rangeSum(int L, int R) { int sum = 0; for (int i = L; i <= R; i++) { s.

package class02;public class Code01_PreSum { public static class RangeSum1 { private int[] arr; public RangeSum1(int[] array) { arr = array; } public int rangeSum(int L, int R) { int sum = 0; for (int i = L; i <= R; i++) { s.

package class01;public class Code01_PrintBinary { public static void print(int num) { for (int i = 31; i >= 0; i--) { System.out.print((num & (1 << i)) == 0 ? "0" : "1"); } System.out.println(); } publi.

//选择排序public class SelectionSort { public static void main(String[] args) { int[] arr={1,3,2,45,65,33,12}; //选择排序的优化 for(int i = 0; i < arr.length - 1; i++) {// 做第i趟排序 int k = i; for(int j = k .