No self-introduction
Loading
Profile
Follow
codes (2)
Longest common subsequence
no vote
Nanyou algorithm experiment, dynamic programming method to solve the longest common subsequence problem, also realized the memo method to solve the longest common subsequence problem. It can output a set of solutions and all possible longest common subsequences. All the thinking questions required by the experiment are realized
叶慕尘 0 0
1
Ship loading problem solving code
4.0
Nanyou algorithm experiment, backtracking method experiment ship loading problem, to achieve a recursive and iterative two methods, code writing, Notes detailed, easy to understand
叶慕尘 0 0
1
No more~
Follows0
Fans0