728x90
https://school.programmers.co.kr/learn/courses/30/lessons/42577
(1) C++
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
bool solution(vector<string> phone_book) {
bool answer = true;
sort(phone_book.begin(), phone_book.end());
for(int i = 0;i <phone_book.size() - 1; i++){
if(phone_book[i + 1].find(phone_book[i]) == 0){
return false;
}
}
return true;
}
(2) Python
def solution(phone_book):
answer = True
phone_book.sort()
for i in range(len(phone_book) - 1):
if len(phone_book[i]) < len(phone_book[i + 1]):
if phone_book[i + 1][:len(phone_book[i])] == phone_book[i]:
return False
return answer
728x90