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

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์—ฐ์Šต๋ฌธ์ œ/JAVA] ์˜์–ด ๋๋ง์ž‡๊ธฐ ๋ณธ๋ฌธ

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

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์—ฐ์Šต๋ฌธ์ œ/JAVA] ์˜์–ด ๋๋ง์ž‡๊ธฐ

์š”์ผ์ด 2022. 9. 21. 23:49
๋ฐ˜์‘ํ˜•

๋ฌธ์ œ

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

 

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

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

programmers.co.kr

 

 

import java.util.*;

class Solution {
   public int[] solution(int n, String[] words) {

        int[] answer = {0, 0};
        int cnt = 1;
        int people = 0;

        List<String> wordList = new ArrayList<>();

        char last = words[0].charAt(0);

        for(int i=0; i< words.length; i++){
            if(wordList.contains(words[i]) || last != words[i].charAt(0)){
                return new int[]{people+1, cnt};
            }else{
                wordList.add(words[i]);
                last = words[i].charAt(words[i].length()-1);
            }

            if((i+1) % n == 0){
                people = 0;
                cnt ++;
            }else{
                people++;
            }

        }

        return answer;
    }
}
Comments