Friday, March 8, 2019

Case study: Leetcode 1000. Minimum Cost to Merge Stones (dynamic programming)

March 8, 2019

Introduction


It is a hard level algorithm, and also it is the algorithm in weekly contest 126. I like to study those top 100 players and their code on this algorithm.

Case study


It is hard for me to work on the dynamic programming solution. One of ideas is to work on top 100 players's code on this algorithm.

I like to review the code and then write C# code for at least more than three ideas.


No comments:

Post a Comment