프로그래머스 / 월간 코드 챌린지 시즌1 / 삼각 달팽이도움말

#include <string>
#include <vector>
 
using namespace std;
 
enum Direction
{
    DOWN,
    RIGHT,
    UP
};
 
vector<int> solution(int n) {
    vector<int> answer;
 
    int array[1001][1001] = { 0, };
    int number = 0;
    int roofNumber = n;
    int index = 0;
    int floor = -1;
    int direction = DOWN;
 
    while (roofNumber != 0)
    {
        for (int i = 0; i < roofNumber; i++)
        {
            switch (direction)
            {
            case DOWN:
                floor++;
                break;
            case RIGHT:
                index++;
                break;
            case UP:
                floor--;
                index--;
                break;
            }
            number++;
 
            array[floor][index] = number;
        }
 
        roofNumber--;
 
        if (direction == UP)
            direction = DOWN;
        else
            direction++;
    }
 
    floor = 1;
    index = 1;
 
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
            answer.push_back(array[i][j]);
    }
    
    return answer;
}