제목 설명

제목 해독

코드

class Solution {
public:
    int movingCountCore(int *giftMatrix, int rows, int cols, int row, int col){
        int xia = 0, you = 0;
        int result = 0;

        //  
        if(row < rows-1){
            xia = movingCountCore(giftMatrix, rows, cols, row+1, col);
        }

        //  
        if(col < cols-1){
            you = movingCountCore(giftMatrix, rows, cols, row, col+1);
        }
        
        result = xia > you ? xia : you;
        return result + giftMatrix[row * cols + col];
    }

    int movingCount(int *giftMatrix, int rows, int cols){
        if(rows <= 0 || cols <= 0){
            return 0;
        }
        return movingCountCore(giftMatrix, rows, cols, 0, 0);
    }
};

int main(){
    int giftMatrix[] = {1, 10, 3, 8, 12 , 2, 9, 6, 5, 7, 4, 11, 3, 7, 16, 5};
    int rows = 4; 
    int cols = 4;
    Solution ss;
    cout<

#include
using namespace std;

class Solution {
public:

    int max_gift(int *present, int rows, int cols){
        
        if (present == NULL || rows < 1 || cols < 1){
            return 0;
        }

        int* maxValues = new int[cols]; //  0

        for (int i = 0; i < rows; ++i){
            for (int j = 0; j < cols; ++j){
                int up = 0;
                int left = 0;

                if (i > 0){
                    up = maxValues[j];
                }

                if (j > 0){
                    left = maxValues[j-1];
                }

                maxValues[j] = max(up, left) + present[i * cols + j];
            }
        }

        int max_value = maxValues[cols-1];
        delete[] maxValues;

        return max_value;
    }
};

int main()
{
    Solution ss;
    int rows = 4; 
    int cols = 4;
    int present[16] = {1, 10,  3,  8, 
                      12,  2,  9,  6, 
                       5,  7,  4, 11, 
                       3,  7, 16,  5};

    cout<

총결산 전망

나는 분할선, 나는 분할선, 나는 분할선

#include
using namespace std;

class Solution {
public:

    int max_gift_core(int *present, int rows, int cols, int row, int col){
        int you = 0;
        int xia = 0;
        int result = 0;

        //  
        if (col < cols-1){
            you =  present[row * cols + col+1];   
        }

        //  
        if (row < rows-1){
            xia = present[(row+1) * cols + col];
        }

        if (you > xia){
            result = max_gift_core(present, rows, cols, row, col+1);
        }
        else if(xia > you){
            result = max_gift_core(present, rows, cols, row+1, col);
        }
        else{ // you = xia， 
            if (you != 0){ //  0， ， 
                result = max_gift_core(present, rows, cols, row, col+1);
            }
            else{ //  you=xia=0， 
                result = 0;
            }
        }

        return present[row * cols + col] + result;
    }

    int max_gift(int *present, int rows, int cols){
        
        if (present == NULL || rows < 1 || cols < 1){
            return 0;
        }

        return max_gift_core(present, rows, cols, 0, 0);
    }
};

int main()
{
    Solution ss;
    int rows = 4; 
    int cols = 4;
    int present[16] = {1, 10,  3,  8, 
                      12,  2,  9,  6, 
                       5,  7,  4, 11, 
                       3,  7, 16,  5};

    cout<