알고리즘/[문제풀이] 프로그래머스

[프로그래머스/고득점 Kit/해시] 전화번호 목록

be-lgreen 2021. 10. 7. 00:08
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

// 10^7

bool comp(const string p1, const string p2){
    if(p1.size() < p2.size()){
        return true;
    }else{
        return false;
    }
}


bool solution(vector<string> phone_book) {
    bool answer = true;
    
    sort(phone_book.begin(), phone_book.end());
    
    int pattern_size;
    for(int i=0; i< phone_book.size() - 1; i++){
        if(phone_book[i] <= phone_book[i+1]){
            pattern_size = phone_book[i].size();
            if(phone_book[i+1].substr(0, pattern_size) == phone_book[i])
            return false;    
        }else{
            pattern_size = phone_book[i+1].size();
            if(phone_book[i].substr(0, pattern_size) == phone_book[i+1])
            return false;
        }
            
    }
    
    
    return answer;
}

 

https://codingwell.tistory.com/34