展開全部

import?java.util.ArrayList;

import?java.util.Iterator;

import?java.util.List;

import?java.util.Map;

import?java.util.TreeMap;

import?java.util.Map.Entry;public?class?Test?{

public?static?void?main(String[]?args)?{

HardDiskAction?action?=?new?HardDiskAction();

HardDisk?hardDisk;

for?(int?i?=?0;?i?

hardDisk?=?new?HardDisk();

hardDisk.setName("name"?+?i);

hardDisk.setPrice(100?+?i);

hardDisk.setCapacity(200?+?i);

hardDisk.setDetail("this?is?name"?+?i?+?"?detail");

action.add(hardDisk);

}

for?(int?i?=?5;?i?

hardDisk?=?new?HardDisk();

hardDisk.setName("name"?+?i);

hardDisk.setPrice(100?-?i);

hardDisk.setCapacity(200?-?i);

hardDisk.setDetail("this?is?name"?+?i?+?"?detail");

action.add(hardDisk);

}

action.printAllDiskDetail();

}

}class?HardDiskAction?{

private?Map?hardDisks?=?new?TreeMap();public?void?add(HardDisk?HardDisk)?{

hardDisks.put(HardDisk.getName(),?HardDisk);

}public?void?remove(String?name)?{

hardDisks.remove(name);

}public?void?printAllDiskDetail()?{

List?list?=?new?ArrayList();

Iterator?it?=?hardDisks.entrySet().iterator();

while?(it.hasNext())?{

list.add((HardDisk)?((Entry)?it.next()).getValue());

}

int?length?=?list.size();

HardDisk?hardDisk;

for?(int?i?=?0;?i?

for?(int?j?=?i?+?1;?j?

double?previousPrice?=?list.get(i).getPrice();

double?nextPrice?=?list.get(j).getPrice();

int?previousSize?=?list.get(i).getCapacity();

int?nextSize?=?list.get(j).getCapacity();

if?(previousPrice?

|62616964757a686964616fe4b893e5b19e31333332623334|?(previousPrice?==?nextPrice?&&?previousSize?

hardDisk?=?list.get(i);

list.set(i,?list.get(j));

list.set(j,?hardDisk);

}

}

}

for?(HardDisk?disk?:?list)?{

System.out.println("name:"?+?disk.getName()?+?",price:"

+?disk.getPrice()?+?",Capacity:"?+?disk.getCapacity()

+?"G,detail:"?+?disk.getDetail());

}

}

}class?HardDisk?{

private?String?name;

private?double?price;

private?int?capacity;

private?String?detail;public?String?getName()?{

return?name;

}public?void?setName(String?name)?{

this.name?=?name;

}public?double?getPrice()?{

return?price;

}public?void?setPrice(double?price)?{

this.price?=?price;

}public?int?getCapacity()?{

return?capacity;

}public?void?setCapacity(int?capacity)?{

this.capacity?=?capacity;

}public?String?getDetail()?{

return?detail;

}public?void?setDetail(String?detail)?{

this.detail?=?detail;

}

}

總結(jié)

以上是生活随笔為你收集整理的java treemap用法_JAVA作业，使用TreeMapK,V类的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。