Archive
Archive
프로그래머스_전화번호부_C++
#include #include #include using namespace std; bool solution(vector 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] == phone_book[i+1].substr(0, phone_book[i].length())) answer = false; } return answer; }
Archive
프로그래머스_탑_C++
#include #include using namespace std; vector solution(vector heights) { vector answer; answer.resize(heights.size(), 0); // 제일 오른쪽에 있는 타워부터 탐색 for (int curr = heights.size() - 1; curr >= 0; --curr) { int currHeight = heights[curr]; for (int compare = curr - 1; compare >= 0; --compare) { if (heights[compare] > currHeight) { answer[curr] = compare + 1; break; } } } return answer; }
