[프로그래머스(Programmers)][Java,Python] (Lv2) 롤케이크 자르기

 

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

프로그래머스

 

1. Java

import java.util.*;
class Solution {
    public int solution(int[] topping) {
        int answer = 0;
        int n = topping.length;
        Map<Integer,Integer> map1 = new HashMap<>();
        Map<Integer,Integer> map2 = new HashMap<>();
        for ( int i = 0; i < 1; ++i ) {
            int t = topping[i];
            map1.put( t, map1.getOrDefault(t, 0) + 1 );
        }
        for ( int i = 1; i < n; ++i ) {
            int t = topping[i];
            map2.put( t, map2.getOrDefault(t, 0) + 1 );
        }
        for ( int i = 1; i < n; ++i ) {
            if ( map1.size() == map2.size() ) {
                answer++;
            }
            int t = topping[i];
            map1.put( t, map1.getOrDefault(t, 0) + 1 );
            map2.put( t, map2.getOrDefault(t, 0) - 1 );
            if ( map2.get(t) <= 0 ) {
                map2.remove(t);
            }
        }
        return answer;
    }
}

import java.util.*;
class Solution {
    public int solution(int[] topping) {
        int answer = 0;
        int n = topping.length;
        for ( int i = 1; i < n - 1; ++i ) {
            Set<Integer> set1 = new HashSet<>();
            for ( int j = 0; j < i; ++j ) {
                set1.add(topping[j]);
            }
            Set<Integer> set2 = new HashSet<>();
            for ( int j = i; j < n; ++j ) {
                set2.add(topping[j]);
            }
            if ( set1.size() == set2.size() ) {
                answer++;
            }
        }
        return answer;
    }
}

 

2. Python

def solution(topping):
    answer = 0
    n = len(topping)
    dic1 = {}
    dic2 = {}
    dic1[topping[0]] = 1
    for i in range(1, n) :
        t = topping[i]
        dic2[t] = dic2.get(t, 0) + 1
    for i in range(1, n) :
        if len(dic1) == len(dic2) :
            answer += 1
        t = topping[i]
        dic1[t] = dic1.get(t, 0) + 1
        dic2[t] = dic2.get(t, 0) - 1
        if dic2[t] <= 0 :
            dic2.pop(t)
    return answer