摘要:
public static int[] slice(int[] arr, int start, int end) { int len = end - start + 1; int[] ts = new int[len]; int offset = 0; while (offset < len) { 阅读全文
摘要:
package leetcode; public class Tree { private Integer[] treeArr; private int treeDep; private int wordLen = 1; private int gap = 3; // gap >= 3 public 阅读全文
摘要:
public class ListNode { public int val; public ListNode next; public ListNode() {} public ListNode(int val) { this.val = val; } public ListNode(int va 阅读全文
摘要:
public static int[] insertSort(int[] nums) { for (int i = 1, len = nums.length; i < len; i++) { int current = nums[i]; int j = i - 1; for (; j >= 0 && 阅读全文