๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

๐Ÿ“œ ์ž๋ฐ” Java

HashMap๊ณผ TreeMap

by Meteora_ 2021. 2. 3.
728x90

HashMap์€ Map์ธํ„ฐํŽ˜์ด์Šค์˜ ํ•œ์ข…๋ฅ˜๋กœ์จ Key์™€ Value ๊ฐ’์œผ๋กœ ๋ฐ์ดํ„ฐ๋ฅผ ์ €์žฅํ•˜๋Š” ํ˜•ํƒœ๋ฅผ ๊ฐ€์ง€๊ณ  ์žˆ๋‹ค.

 

TreeMap์€ ์ด์ง„ํŠธ๋ฆฌ ๊ตฌ์กฐ๋‹ค.

 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
package main;
 
import java.util.HashMap;
import java.util.Iterator;
import java.util.TreeMap;
 
public class MainClass {
    public static void main(String[] args) {
        /*
          Hashmap : ์‚ฌ์ „
                  ("์‚ฌ๊ณผ" : "apple")
                  key   : value - >  json
              TreeMap : HashMap + sorting
         */
 
        HashMap<Integer,String> hMap = new HashMap<Integer,String>();
 
        //2 -> Map<Integer,String> hMap = new HaspMAp<Integer,String>();
 
        //์ถ”๊ฐ€  key value + ์›ํ•˜๋Š” ์œ„์น˜์— ์ถ”๊ฐ€๋Š” ใ…„๋‹ค.
        hMap.put(11,"์‚ฝ์ž…");
        hMap.put(22"์ด์‹ญ์ด");
        hMap.put(33"์‚ผ์‹ญ์‚ฝ");
 
        String value = hMap.get(22);// ์ค‘๊ฐ„ ๋ฐธ๋ฅ˜ ํ‚ค๊ฐ’์œผ๋กœ ๊บผ๋‚ด๊ธฐ
        System.out.println(value);//์ด์‹ญ์ด
 
 
        //์‚ญ์ œ
        String del = hMap.remove(11);
        System.out.println("์‚ญ์ œ๋œ ๋ฐ์ดํ„ฐ=" + del); //์‚ญ์ œ๋œ ๋ฐ์ดํ„ฐ๋ฅผ ์‚ฝ์ž…์ถœ๋ ฅ
        System.out.println("map์˜ ํฌ๊ธฐ=" + hMap.size());
 
        //๊ฒ€์ƒ‰
 
        //์žˆ๋‹ค/์—†๋‹ค
        boolean b = hMap.containsKey(22);
        if(b == true) {
            String s = hMap.get(22);
            System.out.println("value = " + s);
        }
 
 
        //์ˆ˜์ •
        hMap.replace(22"์ด์‹ญ + ์ด");
        System.out.println(hMap.get(22));
 
        hMap.put(22"์ด์‹ญํ”Œ๋Ÿฌ์Šค์ด");//์ค‘๋ณต ๋ฏธํ—ˆ์šฉ
        System.out.println(hMap.get(22));
 
 
 
        //๋ชจ๋“  ํ‚ค ๊ฐ’์„ ์ทจ๋“ํ•œ๋‹ค
        Iterator<Integer> it = hMap.keySet().iterator();
        while(it.hasNext()) {
            Integer k = it.next();
            System.out.println("key" + k);
        }
 
 
        //์ข‹์•„ํ•˜๋Š” ๊ณผ์ผ
        //key:value -> String
 
        HashMap<StringString> fruit = new HashMap<StringString>();
        fruit.put("apple""์‚ฌ๊ณผ");
        fruit.put("strawberry""๋”ธ๊ธฐ");
        fruit.put("melon""๋ฉ”๋ก ");        
        fruit.put("lemon""๋ ˆ๋ชฌ");
        fruit.put("pear""๋ณต์ˆญ์•„");
 
 
        //๋ชจ๋“  ํ‚ค๊ฐ’์„ ์ทจ๋“
        Iterator<String> it1 = fruit.keySet().iterator();
        while(it1.hasNext()) {
            String k = it1.next();
            String v = fruit.get(k);
            System.out.println("key (๊ณผ์ผ์˜์–ด๋กœ)" + k + v);
 
 
        }
        //TreeMap
        //sorting
        TreeMap<String,String> tMap = new TreeMap<String,String>(fruit);
 
        //์˜ค๋ฆ„ 
        //Iterator<String> itkey = tMap.KeySet().iterator();
        //์œ„๋Š” ์˜ค๋ฆ„ ์ฐจ์ˆœ
        //TreeMap์€ Sorting์ด ํฌํ•จ๋จ
        //๋‚ด๋ฆผ
        Iterator<String> itkey = tMap.descendingKeySet().iterator();
        System.out.println("=====================");
        while(itkey.hasNext()) {
            String k = itkey.next();
            String v = tMap.get(k);
            System.out.println("key" + k + "value " + v);
        }
 
 
 
    }
}        
cs

๋Œ“๊ธ€