CODEWITHSUNDEEP
c++
Toad
Toad

Reputation: 11

2-D Array C++ Triangle

I am trying to create a program in c++ that takes in triangle pattern of numbers into a 2-D array.

Example: 

    1

   3 4

  5 9 2

 9 4 6 1

The top row is one number(integer) and each row of the triangle has one more number than the row above it.

Once the triangle has been entered and/or examined via for loops, the program needs to traverse the triangle from top to bottom and record all possible sums of each path;

The path taken down the triangle must always be adjacent to the number in the row above it.

While traversing down the triangle each "path" should be stored in a new array so the path can be displayed. After recording the sum for each path down the triangle the program should compare them and display the path with the smallest sum.

With the changes i made so far thanks to @Beta i have this so far:

int main()
{   
 int row = 0;
 int col = 0;

 int A[4][4] = {{2},{8,9},{3,4,5},{6,2,9,1}};

for (row = 0; row < 4; row++)
{
    for (col = 0; col <= row; col++)
    {
        cout << A[row][col] << " ";
    }
    cout << endl;

My Output is so far is:

2

8 9

3 4 5

6 2 9 1

Upvotes: 1

Views: 4188

Answers (1)

Beta
Beta

Reputation: 99094

I think the trick you're looking for is this:

for (col = 0; col <= row; col ++)

I couldn't parse the last part of your question ("After that...").

EDIT:

The problem of making the triangle look symmetrical is a problem of printing spaces at the beginning of each line. With the trick above, you should be able to figure than one out.

As for considering all paths and displaying the one with the smallest sum, what have you tried? If you are not familiar with Breadth-First Search and Depth-First Search, copying arrays and arrays of pointers, you're probably not ready for this exercise.

Upvotes: 1

Related Questions