[Programmers/C++] 탑

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> solution(vector<int> heights) 
{
    vector<int> 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());
    return answer;
}

 

 

출처

https://programmers.co.kr/learn/courses/30/lessons/42588