[프로그래머스] level.3 - 정수 삼각형(C++)

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

내 풀이

#include <string>
#include <vector>

using namespace std;

int solution(vector<vector<int>> triangle) {
    int answer = 0;
    
    // bottom-up 방식
    for(int i = triangle.size()-2; i >= 0; --i)
    {
        for(int j = 0; j < triangle[i].size(); ++j)
        {
            triangle[i][j] += max(triangle[i+1][j], triangle[i+1][j+1]);
        }
    }
    
    answer = triangle[0][0];
    return answer;
}