Huawei machine test question -- deformation of hj53 Yang Hui triangle

describe

The number matrix of the above triangle , The first line has only one number 1, Each number in each of the following lines , Is exactly the number above it 、 The number in the upper left corner and the number in the upper right corner ,3 Sum of numbers （ If there is no number , Think this number is 0）.

Please n Where the first even number of the line appears . If there is no even number , The output -1. For example, the input 3, The output 2, Input 4 The output 3, Input 2 The output -1.

Data range ： 1 \le n \le 10^9 \1≤n≤109 

Input description ：

Enter a int Integers

Output description ：

Output returned int value

Example 1

Input ：

4

Copy output ：

3

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <iostream>
#include <string.h>
#include <malloc.h>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <list>


int Triangle(int num)
{
    if(num == 1 || num == 2)
    {
        return -1;
    }
    int colume = (2 * num -1) / 2 + 2;
    int row = num;
    // int (*arr)[row] = new int[row][colume];
    int **arr = new int*[row];
    for(int j = 0; j < row; ++j)
    {
        arr[j] = new int[colume];
    }

    
    int jleft = 0;              // Left to right column subscript 
    int jright = colume - 2;             // The right subscript column is left 
    int i = 0;                  // Row coordinates 
    int j = 0;
    for(i = row -1; i >= 0; --i)
    {
        for(j = jleft; j <= jright; ++j)
        {
            arr[i][j] = 0;
        }
        jleft++;
        jright--;
    }

    arr[0][row - 1] = 1;

    // for(int i = 0; i < row; ++i)
    // {
    //     for(int j = 0; j < colume; ++j)
    //     {
    //         std::cout << arr[i][j] << " ";
    //     }
    //     std::cout << std::endl;
    // }


    for(int i = 0; i < row; ++i)
    {
        for(int j = 0; j < colume; ++j)
        {
            int tempi = i;
            int tempj = j;
            if(tempi == 0 && tempj == colume / 2)
            {
                break;
            }
            int leftup = 0;         // Upper left digit 
            int up = 0;             // Number directly above 
            int rightup = 0;        // The number in the upper right corner 

            if((tempi - 1 >= 0) && (tempj - 1 >= 0))
            {
                leftup = arr[tempi - 1][tempj - 1];
            }
            if(tempi - 1 >= 0)
            {
                up = arr[tempi - 1][tempj];
            }
            if((tempi - 1 >= 0) && (tempj + 1 <= colume))
            {
                rightup = arr[tempi - 1][tempj + 1];
            }
            arr[i][j] = leftup + up + rightup;
        }
    }


    // for(int i = 0; i < row; ++i)
    // {
    //     for(int j = 0; j < colume; ++j)
    //     {
    //         std::cout << arr[i][j] << " ";
    //     }
    //     std::cout << std::endl;
    // }

    // The first 4
    for(int j = 0; j < colume; ++j)
    {
        int find = arr[row - 1][j];
        if(find != 0 && find % 2 == 0)
        {
            for (int i = 0; i < row; i++) {
                delete[] arr[i];              //  First release the one-dimensional array  
            }
            delete[] arr;
            return j + 1;
        }
    }

    for (int i = 0; i < row; i++) {
        delete[] arr[i];              //  First release the one-dimensional array  
    }
    delete[] arr;
    return -1;

}

int main()
{
	int n;
    std::cin >> n;
    int index = Triangle(n);
    std::cout << index << std::endl;
    

    return 0;
}