[백준] 12933. 오리 (Python)

백준 문제 풀이 - 구현

📰 문제

---

문제 확인 🏃

💡 입출력 예제

---

quqacukqauackck

>> 2

kcauq

>> -1

quackquackquackquackquackquackquackquackquackquack

>> 1

qqqqqqqqqquuuuuuuuuuaaaaaaaaaacccccccccckkkkkkkkkk

>> 10

quqaquuacakcqckkuaquckqauckack

>> 3

힌트. 녹음: quqaquuacakcqckkuaquckqauckack
오리 1: ____q_u__a___ck_______________
오리 2: __q__u_ac_k_q___ua__ckq_u__ack
오리 3: qu_a_______c___k__qu___a_ck___

quackqauckquack 

>> -1

💬 풀이

---

🎵 첫번째 풀이

word = input()         # 영선이가 녹음한 소리 quack

def solution():
    word_index = ['q', 'u', 'a', 'c', 'k']
    temp = []

    if word[0] != 'q':
        return -1

    for w in word:
        flag = True

        if w == 'q':
            for idx in range(len(temp)):
                if temp[idx] == 0:
                    temp[idx] += 1
                    flag = False
                    break
            if flag:
                temp.append(1)
                flag = False
        
        elif w == 'k':
            for idx in range(len(temp)):
                if temp[idx] == 4:
                    temp[idx] = 0
                    flag = False
                    break

        else:
            for idx in range(len(temp)):
                if word_index[temp[idx]] == w:
                    temp[idx] += 1
                    flag = False
                    break

        if flag:
            return -1

    for t in temp:
        if t > 0:
            return -1

    return len(temp)


print(solution())

✒️ 생각

---