2021年10月19日
时间戳Plus版
摘要： 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)
取子数组 [start,end]
摘要： 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)
判断数组是否有序 0 无序 1 升序 2 降序 3 全相等
摘要： 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 阅读(301) 评论(0) 推荐(0)
随机选餐
摘要： public class Test02 { public static void main(String[] args) { String[] launchList ={ "米线","盖饭","面","麻辣烫","饺子","汉堡" }; //[0.0-1.0] int r=(int) (Math.r 阅读全文
posted @ 2021-10-19 10:30 HelelLucifer 阅读(96) 评论(0) 推荐(0)
穷举法与二分法
摘要： public class Test01 { public static void main(String[] args) { System.out.println(square(10)); System.out.println(square2(10)); }​ //开放 //穷举法 static d 阅读全文
posted @ 2021-10-19 09:58 HelelLucifer 阅读(205) 评论(0) 推荐(0)
插入排序
摘要： blic static void main(String[] args) { int[]arr={2,3,4,5,6,7,8,9,1}; insertionSort(arr); System.out.println(Arrays.toString(arr)); }//插入排序 static void 阅读全文
posted @ 2021-10-19 09:37 HelelLucifer 阅读(32) 评论(0) 推荐(0)