[프로그래머스] level.2 - 땅따먹기(C++)

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

프로그래머스

내 해답

#include <iostream>
#include <vector>
using namespace std;

int find_max(const vector<int>& vec, int idx)
{
    int max = 0;
    for(int i = 0; i < 4; ++i)
    {
        if(i == idx)
            continue;
        
        if(max <= vec[i])
            max = vec[i];
    }
    
    return max;
}

int solution(vector<vector<int>> land)
{
    int answer = 0;
    
    for(int i = 1; i < land.size(); ++i)
        for(int j = 0; j < 4; ++j)
        {
            int max = find_max(land[i-1], j);
            land[i][j] += max;
            answer =  answer <= land[i][j] ? land[i][j] : answer;
        }

    return answer;
}