프로그래머스 LV.2 뒤에 있는 큰 수 찾기

GitHub https://github.com/kwon1232/CodingTest/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/2/154539.%E2%80%85%EB%92%A4%EC%97%90%E2%80%85%EC%9E%88%EB%8A%94%E2%80%85%ED%81%B0%E2%80%85%EC%88%98%E2%80%85%EC%B0%BE%EA%B8%B0

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

using namespace std;

vector<int> solution(vector<int> numbers) {
    vector<int> answer(numbers.size(), -1);

    for (int i = numbers.size() - 2; i >= 0; i--)
    {
        for(int j = i + 1; j < numbers.size(); j++)
        {
            if(numbers[i] < numbers[j])
            {
                answer[i] = numbers[j];
                break;
            }
            else if (numbers[i] >= numbers[j])
            {
                if(answer[j] == -1)
                {
                    break;
                }
                else if (numbers[i] < answer[j])
                {
                    answer[i] = answer[j];
                    break;
                }
            }
        }
    }

    return answer;
}

 

 

 

문제 링크

https://school.programmers.co.kr/learn/courses/30/lessons/154539

프로그래머스