Given two strings `text1` and `text2`, return the length of their longest common subsequence. A subsequence keeps relative order but need not be contiguous. If there is none, return `0`.
Example 1
Input:text1 = "abcde", text2 = "ace"
Output:3
Explanation:"ace" is the LCS.
Example 2
Input:text1 = "abc", text2 = "def"
Output:0
Explanation:No common subsequence.
Constraints
- 1 <= text1.length, text2.length <= 1000
- The strings consist of lowercase English letters