[문제링크 - 프로그래머스 - 전화번호 목록] https://school.programmers.co.kr/learn/courses/30/lessons/42577
import java.util.HashSet;
class Solution {
public boolean solution(String[] phone_book) {
HashSet<String> set = new HashSet<>();
for(String str : phone_book){
set.add(str);
}
for (int i = 0; i < phone_book.length; i++)
for (int j = 0; j < phone_book[i].length(); j++)
if (set.contains(phone_book[i].substring(0, j)))
return false;
return true;
}
}