๐ท๐ผ๋ชจ์ฌ๋ด์ ๊ฐ๋ฐ์์ฒ๐ท๐ผ
[ํ๋ก๊ทธ๋๋จธ์ค ์ฐ์ต๋ฌธ์ /JAVA] ์์ด ๋๋ง์๊ธฐ ๋ณธ๋ฌธ
๊ฐ๋ฐ/์๊ณ ๋ฆฌ์ฆ ๋ฌธ์ ํ์ด JAVA
[ํ๋ก๊ทธ๋๋จธ์ค ์ฐ์ต๋ฌธ์ /JAVA] ์์ด ๋๋ง์๊ธฐ
์์ผ์ด 2022. 9. 21. 23:49๋ฐ์ํ
๋ฌธ์
https://school.programmers.co.kr/learn/courses/30/lessons/12981
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;
}
}
'๊ฐ๋ฐ > ์๊ณ ๋ฆฌ์ฆ ๋ฌธ์ ํ์ด JAVA' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[java/์ฝ๋ฉํ ์คํธ] ์ ์ ์์น ๊ตฌํ๊ธฐ (0) | 2022.12.29 |
---|---|
[ํ๋ก๊ทธ๋๋จธ์ค ์ฐ์ต๋ฌธ์ /JAVA] ๊ตฌ๋ช ๋ณดํธ (0) | 2022.09.26 |
[ํ๋ก๊ทธ๋๋จธ์ค ์ฐ์ต๋ฌธ์ /JAVA] ์ฌ๋ฐ๋ฅธ ๊ดํธ (0) | 2022.09.20 |
[ํ๋ก๊ทธ๋๋จธ์ค ์ฐ์ต๋ฌธ์ /JAVA] JadenCase ๋ฌธ์์ด ๋ง๋ค๊ธฐ (0) | 2022.09.18 |
[ํ๋ก๊ทธ๋๋จธ์ค ์ฐ์ต๋ฌธ์ /JAVA] ์ต๋๊ฐ๊ณผ ์ต์๊ฐ (0) | 2022.09.18 |
Comments