본 블로그는 비상업적, 비영리적 용도의 학업만을 위해 글을 게시합니다.
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
bool solution(vector<string> phone_book) {
bool answer = true;
int head_length = 0;
sort(phone_book.begin(), phone_book.end());
for(int j = 0; j < phone_book.size() - 1; j++)
if(phone_book[j].length() <= phone_book[j+1].length())
if(phone_book[j] == phone_book[j+1].substr(0, phone_book[j].length()))
return false;
return answer;
}
bool solution(vector<string> phoneBook) {
bool answer = true;
sort(phoneBook.begin(), phoneBook.end());
for ( int i = 0 ; i < phoneBook.size() - 1 ; i++ )
{
if ( phoneBook[i] == phoneBook[i+1].substr(0, phoneBook[i].size()) )
{
answer = false;
break;
}
}
return answer;
}