백준 [ALGORITHM] - 뒤집기 (1439)

def find_divided_parts(s):
    divided_parts = []
    current_part = s[0]
    
    for char in s[1:]:
        if char == current_part[-1]:
            current_part += char
        else:
            divided_parts.append(current_part)
            current_part = char
    
    divided_parts.append(current_part) 
    
    return [part for part in divided_parts if part] 

def ans_counter(a, b):
    count = 0
    for part in result_set:
        if part[0] == a:
            count += 1
    
    ans_count.append(count)

input_str = input()
result = find_divided_parts(input_str)
ans_count = []
result_set = [list(set(part)) for part in result]

print(result_set)
ans_counter('1', '0')
ans_counter('0', '1')

print(min(ans_count))