java两个数组合并排序,在Java中合并和排序两个不同长度的数组

I am looking for a solution for my 'problem', that isn't an ugly hack.

In my Java code I have two arrays, both of an unknown length (so they will probably be of different length).

I would like to sort them like this:

Array A: {1, 2, 3, 4, 5}

Array B: {6, 7, 8}

New Array: {1, 6, 2, 7, 3, 8, 4, 5}

Is there a nice way to accomplish this?

Thanks

解决方案

If it is likely that there are many more in one array than the other, it should be faster to zip the first part and then bulk copy the rest using System.arrayCopy. It also simplifies dasblinkenlight's for loop by removing the ifs.

int[] res = new int[a.length + b.length];

int p = 0;

//zip what we can

int last = Math.min(a.length, b.length);

for (int i = 0; i != last; i++) {

res[p++] = a[i];

res[p++] = b[i];

}

//now add the remaining

int aRemain = a.length - last;

if(aRemain > 0) {

System.arrayCopy(a, last, res, p, aRemain);

}

else

{

int bRemain = b.length - last;

if(bRemain > 0) {

System.arrayCopy(b, last, res, p, bRemain);

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值