I want to know which is the best way to find the longest common subsequence of two strings
You know the recipe for dynamic programming: define some subproblems, then show how to use solutions to smaller subproblems to help you solve larger subproblems. So, what you have tried as candidate subproblems?
Hint: When you have a dynamic programming problem that takes a string as input, what are some candidate ways to define subproblems? (Prefixes, suffices, substrings...) Now, how might you apply that general advice here?
I'm not going to spell out the full answer, as this sounds like homework, and to learn from homework, you need to struggle with it yourself.