JAVA import java.util.ArrayList; import java.util.Collections; import java.util.
ID: 3887460 • Letter: J
Question
JAVA
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class Cost {
Map<String, Item> items = new HashMap<String, Cost.Item>();
public void addItem(String name, int cost){
items.put(name, new Item(name, cost));
}
public void printCost(){
List<Item> itemList = new ArrayList<Cost.Item>();
items.forEach((k,v) -> itemList.add(v));
Collections.sort(itemList);
itemList.forEach(item -> System.out.println(item.toString()));
}
//inner class
public class Item implements Comparable<Item> {
String name;
int cost; // in cents
public Item(String n, int c) {
name = n;
cost = c;
}
public String toString() {
return name + " " + cost;
}
@Override
public int compareTo(Item o) {
int intCompare = Integer.compare(this.cost, o.cost);
if(intCompare == 0)
intCompare = this.name.compareTo(o.name);
return intCompare;
}
}
}
Explanation / Answer
import java.util.Arraylist;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class Cost
{
Map<String,item>items=new HashMap<String,Cost.item>();
public void additem(String name,intcost)
{
items.put(name,new item(name,cost));
}
public void printCost()
{
List<item>itemList = new ArrayList<cost.item>();
items.forEach((k,v)->itemList.add(v));
Collections.sort(itemList);
itemList.forEach(item->System.out.println(item.toString()));
}
//inner class
public class item implements Comparable<itam>
{
String name;
int cost;//in cents
public item(String n,int c)
{
name = n;
cost = c;
}
public String toString()
{
return name+""+cost;
}
@Override
public int compareTo(item 0)
int intCompare = integer.compare(this .cost,0.cost);
if(intCompare ==0)
intCompare = this.name.compareTo(0,name);
return intCompare;
}
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.