回答編集履歴
1
確認コード追加
test
CHANGED
|
@@ -29,3 +29,85 @@
|
|
|
29
29
|
});
|
|
30
30
|
|
|
31
31
|
```
|
|
32
|
+
|
|
33
|
+
※ちなみに下記コードの(1)(2)は問題なく理解できますか?
|
|
34
|
+
|
|
35
|
+
```Java
|
|
36
|
+
|
|
37
|
+
private static TreeSet<String> set = new TreeSet<>();
|
|
38
|
+
|
|
39
|
+
|
|
40
|
+
|
|
41
|
+
private static Map<Integer,TreeSet<String>> setMap = new HashMap<>();
|
|
42
|
+
|
|
43
|
+
static {
|
|
44
|
+
|
|
45
|
+
setMap.put(1, new TreeSet<>());
|
|
46
|
+
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
|
|
50
|
+
|
|
51
|
+
public static void main(String[] args) {
|
|
52
|
+
|
|
53
|
+
//(1)
|
|
54
|
+
|
|
55
|
+
set.add("A");
|
|
56
|
+
|
|
57
|
+
set.add("B");
|
|
58
|
+
|
|
59
|
+
TypeA a= new TypeA();
|
|
60
|
+
|
|
61
|
+
a.print();//A,Bが出力
|
|
62
|
+
|
|
63
|
+
//(2)
|
|
64
|
+
|
|
65
|
+
TreeSet<String> hs = setMap.get(1);
|
|
66
|
+
|
|
67
|
+
hs.add("C");
|
|
68
|
+
|
|
69
|
+
hs.add("D");
|
|
70
|
+
|
|
71
|
+
TypeB b= new TypeB();
|
|
72
|
+
|
|
73
|
+
b.print();//C,Dが出力
|
|
74
|
+
|
|
75
|
+
|
|
76
|
+
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
|
|
80
|
+
|
|
81
|
+
static class TypeA {
|
|
82
|
+
|
|
83
|
+
void print(){
|
|
84
|
+
|
|
85
|
+
set.forEach(val->{
|
|
86
|
+
|
|
87
|
+
System.out.println(val);
|
|
88
|
+
|
|
89
|
+
});
|
|
90
|
+
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
|
|
96
|
+
|
|
97
|
+
static class TypeB {
|
|
98
|
+
|
|
99
|
+
void print(){
|
|
100
|
+
|
|
101
|
+
TreeSet<String> set2 = setMap.get(1);
|
|
102
|
+
|
|
103
|
+
set2.forEach(val->{
|
|
104
|
+
|
|
105
|
+
System.out.println(val);
|
|
106
|
+
|
|
107
|
+
});
|
|
108
|
+
|
|
109
|
+
}
|
|
110
|
+
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
```
|