微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

错误:不兼容的类型:ArrayList<Item> 无法转换为 Item[]

如何解决错误:不兼容的类型:ArrayList<Item> 无法转换为 Item[]

我是 Java 新手,并试图在没有比较器可比选项的情况下完成排序,但是收到错误错误:不兼容的类型:ArrayList 无法转换为 Item[],谁能告诉我我要做什么不正确。还是我必须创建一个多维数组,然后使用我目前正在使用的方法导入到数组列表中。

private int serialNumber;
private String name;
private double unitPrice;

public Item(int sn,String n,double p) {
    serialNumber = sn;
    name = n;
    unitPrice = p;
}

public int getSerialNumber(){
    return serialNumber;
}

public String getName(){
    return name;
}

public double getUnitPrice(){
    return unitPrice;
}

公共类ManageItems {//开始主

public static void main(String[] args) {

    ArrayList<Item> iT = new ArrayList<Item>();

    Item i1 = new Item (1234,"Saw",153.75);//create item and add to array list
    iT.add(i1);
    iT.add(new Item(9876,"Hammer",47.50));
    iT.add(new Item(6432,"Drill",272.99));
    iT.add(new Item(4682,"I-Beam Level",240.00));
    iT.add(new Item(2909,"Shovel",75.00));

    sortSerialNumberAsc(iT);

}//end main

public static void sortSerialNumberAsc (Item[] arr){ //sort ascending order
    int n = arr.length;
    for (int i = 1; i < n; ++i) {//serialnumber loop start
        Item key = arr[i];
        int j = i - 1;

        while (j >= 0 && arr[j].getSerialNumber() > key.getSerialNumber()) {//serialnumber outer loop start
            arr[j + 1] = arr[j];
            j = j - 1;
        }//outer loop end

        arr[j + 1] = key;
    }//serialnumber loop end
}//end

 public static void sortSerialNumberDesc (Item[] arr){ //sort decending
    int n = arr.length;
    for (int i = 1; i < n; ++i) {//serialnumber loop start
        Item key = arr[i];
        int j = i - 1;

        while (j >= 0 && arr[j].getSerialNumber() < key.getSerialNumber()) {//serialnumber outer loop start
            arr[j + 1] = arr[j];
            j = j - 1;
        }//outer loop end

        arr[j + 1] = key;
    }//serialnumber loop end
}//end

public static void sortUnitPriceAsc (Item[] arr){ //sort unit price ascending
    int n = arr.length;

    for (int i = 1; i < n; i++){//start unit price loop

    Item key = arr[i];
    int j = i - 1;

        while (j >= 0 && arr[j].getUnitPrice() > key.getUnitPrice()) {//outer loop
            arr[j + 1] = arr[j];
            j = j - 1;
    }//outer loop end
        arr[j + 1] = key;
}//end unit price loop
}//end

public static void sortUnitPriceDesc (Item[] arr){//sort unit price descending
    int n = arr.length;

    for (int i = 1; i < n; i++){//start loop

    Item key = arr[i];
    int j = i - 1;

        while (j >= 0 && arr[j].getUnitPrice() < key.getUnitPrice()) {//outer loop
            arr[j + 1] = arr[j];
            j = j - 1;
}//outer loop end
        arr[j + 1] = key;

    }//end loop

}//end

版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。