SOLUTION INFO
C++ · main.cpp
class Solution {
public:
vector<string> stringMatching(vector<string>& words) {
sort(words.begin(), words.end(), [&](const string &a, const string &b) -> bool {
return a.size() < b.size();
});
int N = words.size();
vector<string> answer;
for(int i = 0; i < N; ++i) {
for(int j = i + 1; j < N; ++j) {
if(words[j].find(words[i]) != string::npos) {
answer.push_back(words[i]);
break;
}
}
}
return answer;
}
};
SOLUTION DESCRIPTION
풀이 설명
등록된 풀이 설명이 없습니다.