C++ (코딩테스트) - [1차]캐시(프로그래머스)

문제

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

프로그래머스

 

내가 푼 풀이

 

#include <string>
#include <vector>

using namespace std;

int solution(int cacheSize, vector<string> cities) {
    int answer = 0;
    if (cacheSize == 0) return cities.size() * 5;
    vector<string> cache;

    for (int i = 0; i < cities.size(); i++)
    {
        for (int k = 0; k < cities[i].size(); k++) cities[i][k] = tolower(cities[i][k]);

        bool Is_hit = false;
        for (int j = 0; (j < cache.size() && j < cacheSize); j++)
        {
            if (cache[j] == cities[i])
            {
                cache.erase(cache.begin() + j);
                cache.push_back( cities[i]);
                Is_hit = true;
                break;
            }
        }

        if (Is_hit) answer++;
        else
        {
            answer += 5;        
            if (cache.size() == cacheSize)cache.erase(cache.begin());
            cache.push_back(cities[i]);
        }       
    }
    return answer;
}