摘要：
public class ListNode { //删除链表中的节点*********************************************************************************************************** int val; 阅读全文
posted @ 2021-11-03 19:25
HelelLucifer
阅读(47)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { prinYangHuiTriangle(10); } static void prinYangHuiTriangle(int n) { int[] line = {1}; System.out.println(Arra 阅读全文
posted @ 2021-10-20 14:49
HelelLucifer
阅读(229)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { int[] arr1 = {1, 2, 3, 4, 5, 6}; int[] arr2 = {6, 7, 8, 9, 10, 11}; System.out.println(Arrays.toString(concat 阅读全文
posted @ 2021-10-20 11:15
HelelLucifer
阅读(176)
评论(0)
推荐(0)
摘要：
static int[] monthDay = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; public static void main(String[] args) { int[] arr = new int[9]; long timeSt 阅读全文
posted @ 2021-10-19 16:23
HelelLucifer
阅读(27)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { Long timestamp = System.currentTimeMillis(); timestamp += 1000 * 60 * 60 * 8; long dayCounts = (long) (Math.c 阅读全文
posted @ 2021-10-19 16:17
HelelLucifer
阅读(69)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { int[] arr = {1, 2, 3, 4, 6, 7, 8, 9, 9, 10, 10, 11, 11}; System.out.println(Arrays.toString(subArray(arr, 4, 阅读全文
posted @ 2021-10-19 16:14
HelelLucifer
阅读(33)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { int[] arr1 = {1, 2, 3, 4, 5}; int[] arr2 = {10, 9, 8, 7, 6}; System.out.println(Arrays.toString(concat(arr1, 阅读全文
posted @ 2021-10-19 15:43
HelelLucifer
阅读(543)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { int[] arr1 = {1, 2, 3, 4, 5, 6}; int[] arr2 = {6, 7, 8, 9, 10, 11}; System.out.println(Arrays.toString(concat 阅读全文
posted @ 2021-10-19 15:15
HelelLucifer
阅读(89)
评论(0)
推荐(0)
摘要：
public class lianxi02 { public static void main(String[] args) { int[] arr = {45, 7, 5, 15, 1, 23, 8, 70, 6, 96, 2, 6, 51}; breakArray(arr); System.ou 阅读全文
posted @ 2021-10-19 11:26
HelelLucifer
阅读(32)
评论(0)
推荐(0)
摘要：
public class lianxi02 { public static void main(String[] args) { int[] arr = {45, 7, 5, 15, 1, 23, 8, 70, 6, 96, 2, 6, 51}; System.out.println(isOrder 阅读全文
posted @ 2021-10-19 11:05
HelelLucifer
阅读(300)
评论(0)
推荐(0)
浙公网安备 33010602011771号