Java Reference
In-Depth Information
13 Coin coin2 =
new
Coin(
0.25
,
ÐquarterÑ
);
14 Coin coin3 =
new
Coin(
0.01
,
ÐpennyÑ
);
15 Coin coin4 =
new
Coin(
0.05
,
ÐnickelÑ
);
16
17
class
CoinComparator
implements
Comparator<Coin>
18 {
19
public int
compare(Coin first, Coin
second)
20 {
21
if
(first.getValue() <
second.getValue())
return
Ċ1
;
22
if
(first.getValue() ==
second.getValue())
return
0
;
23
return
1;
24 }
25 }
26
27 Comparator<Coin> comp =
new
CoinComparator();
28 Set<Coin> coins =
new
TreeSet<Coin>(comp);
29 coins.add(coin1);
30 coins.add(coin2);
31 coins.add(coin3);
32 coins.add(coin4);
33
34
for
(Coin c : coins)
35 System.out.print(c.getValue() +
Ð Ñ
);
36 System.out.println(
ÐExpected: 0.01 0.05
0.25Ñ
);
37 }
38 }
736
737
Output
0.01 0.05 0.25
Expected: 0.01 0.05 0.25
S
ELF
C
HECK
13.
When would you choose a tree set over a hash set?
