목록탑 (1)
Try
[Programmers/C++] 탑
#include #include #include using namespace std; vector solution(vector heights) { vector answer; for(int i = heights.size()-1; i>=0; i--) { for(int j = i-1; j>=0; j--) { if(i == 0) { answer.push_back(0); break; } else if(heights[j] > heights[i] && i != j) { answer.push_back(j+1); break; } else if (j==0) { answer.push_back(0); break; } } } answer.push_back(0); reverse(answer.begin(), answer.end()..
Algorithm/Programmers
2019. 4. 16. 15:26