2018 KAKAO BLIND RECRUITMENT : 캐시(c++)

설명 추가 예정

 

#include <string>
#include <vector>
#include <climits>
 
using namespace std;
 
string toLower(string s){
    string temp = "";
    for(int i=0; i<s.size(); i++){
        temp += tolower(s[i]);
    }
    
    return temp;
}
 
int solution(int cacheSize, vector<string> cities) {
    int answer = 0;
    
    if(cacheSize==0){
        return (5*cities.size());
    }
    
    int idx = 0;
    int num = 0; // 캐시의 크기
    vector<string> cache;
    
    while(idx<cities.size()){
        
        // cass hit
        string temp = "";
        bool check = false;
        for(int i=0; i<cache.size(); i++){
            if(toLower(cache[i])==toLower(cities[idx])){
                temp = cache[i];
                cache.erase(cache.begin()+i);
                cache.push_back(temp);
                idx++;
                check = true;
                break;
            }
        }
        if(check==true){
            answer += 1;
            continue;
        }
        
        // cass miss
        if(num<cacheSize){
            cache.push_back(cities[idx]);
            idx++;
        }else{
            cache.erase(cache.begin()+0);
            cache.push_back(cities[idx]);
            idx++;
        }
        answer += 5;
        num++;
    }
    
    return answer;
}