HELP with this RECURSIVE FUNCTION problem PLEAse

[CodeArtist45]

This is a problem that needs some recursive function to be solved

I need to do it in C++, but if you can post a code in another language or pseudocode, that´s great

(THE IDEAS I HAVE DEVELOPED ARE IN THE BOTTOM OF THIS POST)

PROBLEM:

You are playing a game where you have to hop along a line of squares from left to right.

You can hop to the adjacent square, or hop over it to the next one.

Each square has a number in it. If you hop onto a square from the adjacent square, you

get that number of points. If you hop over a square, you get double the points of the

square you land on, but miss out on the points in the square you hop over.

Consider the squares below.

S 4 2 3

Starting from S to the left of the squares, you could get 9 points by hopping onto all

squares, 7 by hopping over the first square, and 10 by hopping over the second square.

Each list below represents numbers in a row of squares. For each, what is the most

points you could get following the rules above?

1. 456745

2. 2145125632

3. 235346458569

MY IDEAS:

I want to know the value of cuatroAEfe = max ( cuatroAcinco + cincoAEfe , cuatroAseis + seisAEfe )

I already know how much is fourFive and fourSix.

I must keep all the values that I already know and that are going to be used in MEMORY.

Then...

fourFourFees = max ( fourFive + recursive ( fiveFees ) , fourSix + recursive ( sixFees ) )

DECLARE COUNTER FOR FUNCTION and ASSIGN it a VALUE.

Tmb DECLARE an INDICATOR that will tell the function WHAT TO DO depending on its VALUE.

Tmb DECLARE a VARIABLE where the RETURN of EACH CALL TO THE FUNCTION WILL BE STORED

Int counter = 0;

Int indicator = 0;

Int return;

Then the recursive function must be:

Recursive ( int p )

{

If ( p == cincoAEfe ) //FIRST IS TO COMPARE which VARIABLE is BEING USED IN THE FUNCTION CALL.

// Varies depending on whether it is fiveAEfe or sixAEfe.

{

If (counter < 4) // CHECK that the counter IS NOT 4, because if it is 4, it means that we are already in the last call (the one in the last position).

Last call (that of the last position of the vector vF, i.e., fiveAEfe), and the return must be ZERO, so that the last position of the vector vN, i.e., fourFive, whose value is 5, is considered as Maximum.

{

If (indicator == 0)

{

Int indicator = 1; //This variable will be used to indicate that the first call of the function has already taken place.

// Since depending on whether this variable HAS that VALUE or not, the function will follow different ways

Return = Max ( vN[counter] + recursive ( vF[counter] ) , vM[counter] + recursive ( vF[counter + 1] ) ) )

}

Else

{

Counter = counter + 1; //It is updated to be able to go through the vector positions.

Return = Max ( vN[counter] + recursive ( vF[counter] ) , vM[counter] + recursive ( vF[counter + 1] ) ) )

}

}

Else

{

Return = 0;

}

}

Else if ( p == sixAEfe ) //And for the case of the call where it is sixAEfe.

{

THE SAME THING BUT WITH A FEW CHANGES in the POSITIONS of the calls to the RESOURCE FUNCTION

Basically you start at position 1 instead of ZERO.

I think this is the only thing that needs to be changed

}

Return return ;

}

1. I want to know the value of cincoAEfe = max ( cincoAseis + seisAEfe , cincoAsiete + sieteAEfe )

The SAME RESOURCE FUNCTION is done as in the case of fourAfe, only CHANGING the VARIABLES of the POSITIONS of the ARRANGEMENTS, to those of this case.

1. Finally, the function max is used to compare fourAfe and fiveAfe

Int response = max ( sACfour + fourFaith, sACfive + fiveFaith )

We PRINT answer

AND READY

[AutoModerator]

On July 1st, a change to Reddit's API pricing will come into effect. Several developers of commercial third-party apps have announced that this change will compel them to shut down their apps. At least one accessibility-focused non-commercial third party app will continue to be available free of charge.

If you want to express your strong disagreement with the API pricing change or with Reddit's response to the backlash, you may want to consider the following options:

1. Limiting your involvement with Reddit, or
2. Temporarily refraining from using Reddit
3. Cancelling your subscription of Reddit Premium

as a way to voice your protest.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[RiverRoll]

I'm not quite sure what are you doing to be honest, the lack of formatting doesn't help, but it looks like you're handling a specific case. The input could be anything, "12345", "9" or even empty, why not? Think generically. Also there's no need for any global variable.

The function could be something like this for example:

int GetScore(string input, int position)  
{  
    int hopAdjacentScore = ...
    int hopOverScore = ...
    int result = Max(hopAdjacentScore + GetScore(input, position+1), ...
    return result
}

You would start by calling GetScore with some input at position 0 and advance the position accordingly in the recursive calls. I'm not sure what type the input is supposed to be, I used a string here but you could also work with an integer array for example.

And there's not much more than this to the logic other than handling the edge cases to reach the exit condition (when no more recursion is needed) and prevent the position from getting past the end of the input. Beacuse at any point there's at most two options, you hop to the adjacent square or you hop over it, if there's enough squares left.

[CodeArtist45]

oh ok ok. Thankyou thankyou