๊ธฐ๋ก๋ฐฉ

Lv.1 : ๋‹ฌ๋ฆฌ๊ธฐ ๊ฒฝ์ฃผ ๋ณธ๋ฌธ

CodingTest/Java

Lv.1 : ๋‹ฌ๋ฆฌ๊ธฐ ๊ฒฝ์ฃผ

Soom_1n 2023. 4. 25. 17:31

๐Ÿ‘‰ ๋ฌธ์ œ๋งํฌ

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr



๐Ÿ”ธ ๋ฌธ์ œ ๋ถ„์„ ๐Ÿ”ธ

  •  

๐Ÿ”ธ ์ฝ”๋“œ ๐Ÿ”ธ

import java.util.HashMap;

class Solution {
    public String[] solution(String[] players, String[] callings) {
        
        HashMap<String, Integer> map = new HashMap<>();
        
        for(int i = 0; i < players.length; i++) {
            map.put(players[i], i);
        }
        
        for(int i = 0; i < callings.length; i++) {
            int idx = map.get(callings[i]);
            String temp = players[idx-1];
            players[idx-1] = players[idx];
            players[idx] = temp;
            
            map.put(callings[i], idx-1);
            map.put(temp, idx);
        }
        
        return players;
    }
}

๐Ÿ”ธ ์ฝ”๋“œ ํ•ด์„ ๐Ÿ”ธ

  •  

๐Ÿ”ธ end ๐Ÿ”ธ

  •  

728x90

'CodingTest > Java' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€

Lv.1 : ๊ณต์› ์‚ฐ์ฑ…  (0) 2023.04.26
Lv.1 : ์ถ”์–ต ์ ์ˆ˜  (0) 2023.04.25
BOJ_2252 : ์ค„ ์„ธ์šฐ๊ธฐ  (0) 2023.04.22
Lv.1 : ๋‘˜๋งŒ์˜ ์•”ํ˜ธ  (0) 2023.04.20
BOJ_2110 : ๊ณต์œ ๊ธฐ ์„ค์น˜  (0) 2023.04.18