[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
核心思想:归并排序
一般做法:将两个数组合并,在按照一般排序的排序方法(如:冒泡排序)进行排序。
常用做法:将因为数组都是有序的,将第二个数组从倒数第一个数与第一个数组的最后一个数开始比较,按照大小插入。两个数组的指针各自移动。
public static void main(String[] args) { int[] a = {0, 3, 4, 6, 9, 12}; int[]
b = {1, 2, 5, 7, 8, 10, 11}; int[] c = marge(a, b);
System.out.println(Arrays.toString(c)); } /** * 合并连个有序数组 * 算法: * 1.
设置两个指针i,j,分别指向a数组和b数组,一个执行合并后数组的指针index; * 2.
比较指针i,j指向的值,小的值存入指针index指向的结果数组中,当有一个指针(i或j)先到达数组末尾时,比较结束; * 3.
将指针(i或j)没有到达数组末尾的数组复制到指针index指向的结果数组中 * @param a * @param b * @return */
private static int[] marge(int[] a, int[] b) { int[] c = new int[a.length +
b.length]; int i = 0, j = 0; int index = 0;
//比较指针i,j指向的值,小的值存入指针index指向的结果数组中,当有一个指针(i或j)先到达数组末尾时,比较结束; while (i <
a.length && j < b.length) { if (a[i] < b[j]) { c[index++] = a[i++]; } else {
c[index++] = b[j++]; } } int l; //将指针(i或j)没有到达数组末尾的数组复制到指针index指向的结果数组中 if (i <
a.length) { for (l = i; l < a.length; l++) { c[index++] = a[l]; } }
//将指针(i或j)没有到达数组末尾的数组复制到指针index指向的结果数组中 if (j < b.length) { for (l = j; l <
b.length; l++) { c[index++] = b[l]; } } return c; }