๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[JAVA/ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์ฒด์œก๋ณต ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[JAVA/ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์ฒด์œก๋ณต

์š”์ผ์ด 2023. 3. 14. 16:42
๋ฐ˜์‘ํ˜•

๋ฌธ์ œ

https://school.programmers.co.kr/learn/courses/30/lessons/42862

 

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

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

programmers.co.kr

 

 

ํ’€์ด

 

- ํ…Œ์ŠคํŠธ์ผ€์ด์Šค 2๋ฒˆ 5๋ฒˆ 7๋ฒˆ ๋“ฑ๋“ฑ๋“ฑ ์ž๊พธ ํ‹€๋ ค์„œ ์•„์˜ˆ ์ƒˆ๋กœ ์งฏ๋‹ค

๋ชจ๋“  ํ…Œ์ŠคํŠธ ์ผ€์ด์Šค๋ฅผ ์ฐพ๊ณ , ๋งŒ๋“ค์–ด์„œ ๋„์ „ํ•ด๋ด๋„ 7๋ฒˆ์—์„œ ๋ง‰ํžˆ๋Š” ๊ฒƒ์ด๋‹ค.

์•„๋งˆ๋„ 7๋ฒˆ์€ ํ…Œ์ŠคํŠธ ์ผ€์ด์Šค๋ผ๊ณ  ์จ๋†“๊ณ ์„  ํšจ์œจ์„ฑ ํ…Œ์ŠคํŠธ ์˜€์„๊ฒƒ ๊ฐ™๋‹ค.

 

import java.util.*;


class Solution {
      public int solution(int n, int[] lost, int[] reserve) {

        int answer = n;

        ArrayList<Integer> list = new ArrayList<>();

        Arrays.sort(lost);
        Arrays.sort(reserve);

        for(int i=0; i< lost.length; i++){
            list.add(lost[i]);
        }

        for(int i=0; i< reserve.length; i++){
            if(list.contains(reserve[i])){
                list.remove(list.indexOf(reserve[i]));
                reserve[i] = -1;
            }
        }

        if(list.size()>0){

            for(int i=0; i< reserve.length; i++){
                int o = reserve[i]-1;
                int h = reserve[i]+1;
                if(list.contains(o)){
                    list.remove(list.indexOf(o));
                }else if(list.contains(h)){
                    list.remove(list.indexOf(h));
                }
                
            }

            answer = answer - list.size();
        }

        return answer;
    }
}
Comments