How do we calculate the the basic solution time complexity? In solution, it’s O(3^(m + n)). how to get this result?
Why do we need three-dimensional array in Top-down solution? i1 and i2 are changing values and count is the result we want. We can just use two-dimensional array for i1 and i2.
Why can’t we pass count instead of 0 as the argument in c1 and c2 in basic solution just like we pass the sum in Maximum Sum Increasing Subsequence basic solution?
This problem basic solution:
int c1 = findLCSLengthRecursive(s1, s2, i1, i2+1, 0);
int c2 = findLCSLengthRecursive(s1, s2, i1+1, i2, 0);
Maximum Sum Increasing Subsequence basic solution:
int s2 = findMSISRecursive(nums, currentIndex+1, previousIndex, sum);
Can we not use count as parameter in basic solution just like the solution of Longest Common Subsequence? If so, how to change the code?
Do you guys have any ideas? Thanks!