description : In the Learning algorithm introduction, need to write a nested small program, the title is:
Consider a three-parameter recursive function w (A, B, c):
If a <= 0 or b <= 0 or C <= 0, then W (A, B, c) returns:1
If a > B > C >, then W (A, B, c) returns:w (20, 20, 20)
If a < b and B < C, then W (A, B, c) Returns:w (A, B, c-1) + W (A, b-1, C-1)-W (A, b-1, c)
Otherwise it returns:w (A-1, B, c) + W (A-1, B-1, C) + W (A-1, B, C-1)-W (A-1, B-1, C-1).
Directly on the code I wrote:
int function_recursion::implement_recursion (int, int,int) {int I, j;for (i = 0; i < Sample_num; i++) {if (triplssries[i][ 0] <= 0 | | Triplssries[i][1] <= 0 | | triplssries[i][2]<=0) implement_recursion (triplssries[i][0], triplssries[i][1], triplssries[i][2]) = 1;}}
Description: Triplssries is the input (A,B,C) sample set stored in the two-tuple array triplssries[i][j], but the title bug appears: "Implement_recursion (triplssries[i][0), TRIPLSSRIES[I][1], triplssries[i][2]) = 1; " The error for this line is: the expression must be a modifiable left-hand value.
Dear God, Where did you come wrong? (Finish the complete program first, then give my own solution, O (∩_∩) o)
Bug resolution in C + + that "IntelliSense: expression must be modifiable Lvalue" appears