如何在不破坏原始数组的情况下对数组进行排序? [英] How to sort an array without destroying the original array?

查看:80
本文介绍了如何在不破坏原始数组的情况下对数组进行排序?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我有

public static void main (String[] arg) {
  int[] array = {1,5,6,8,4,2}

  for (int i = 0; i < array.length; i++) {
    System.out.print("List 1 = " + array[i] + ",");
  }
  swap(array);
  for (int i = 0; i < array.length; i++) {
    System.out.print("List 2 = "+array[i] + ",");
  }
}
private static int swap (int[] list){
   Arrays.sort(list);
}

输出为

 List 1 = 1,5,6,8,4,2
 List 2 = 1,2,4,5,6,8

我想要的答案是

List 1 = 1,5,6,8,4,2
List 2 = 1,5,6,8,4,2

即使在排序之后.我该怎么办?

even after sorting. How can I do it?

推荐答案

int[] originalArray = {1,5,6,8,4,2};
int[] backup = Arrays.copyOf(originalArray,originalArray.length);
Arrays.sort(backup);

执行完以上代码后, backup 进行排序,并且 originalArray 保持不变.

After the execution of the code above, backup becomes sorted and originalArray stays same.

这篇关于如何在不破坏原始数组的情况下对数组进行排序?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
相关文章
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆