[코딩테스트 연습 _ 스택/큐] 탑

 

#include <string>
#include <vector>

using namespace std;

vector<int> solution(vector<int> heights) {
    int box=heights.size();
    vector<int> answer(box, 0);
    vector<int> list;

    for (int i = heights.size()-1; i >= 0; i--) {
        if (list.size() != 0) {
            while (1) {
                if (list.size() != 0) {
                    if (heights[i] > heights[list.back()]) {
                        answer[list.back()] = i + 1;
                        list.pop_back();
                    }
                    else
                        break;
                }
                else
                    break;
            }
        }
        list.push_back(i);
    }


    return answer;
}

 

 

https://programmers.co.kr/learn/courses/30/lessons/42588?language=cpp

프로그래머스