@@ -0,0 +1,1366 @@
+%22%22%22Leetcode 1143. Longest Common Subsequence%0AMedium%0A%0AURL: https://leetcode.com/problems/longest-common-subsequence/%0A%0AGiven two strings text1 and text2, return the length of their longest common subsequence.%0A%0AA subsequence of a string is a new string generated from the original string with %0Asome characters(can be none) deleted without changing the relative order of the %0Aremaining characters. (eg, %22ace%22 is a subsequence of %22abcde%22 while %22aec%22 is not).%0AA common subsequence of two strings is a subsequence that is common to both strings.%0A%0AIf there is no common subsequence, return 0.%0A%0AExample 1:%0AInput: text1 = %22abcde%22, text2 = %22ace%22 %0AOutput: 3  %0AExplanation: The longest common subsequence is %22ace%22 and its length is 3.%0A%0AExample 2:%0AInput: text1 = %22abc%22, text2 = %22abc%22%0AOutput: 3%0AExplanation: The longest common subsequence is %22abc%22 and its length is 3.%0A%0AExample 3:%0AInput: text1 = %22abc%22, text2 = %22def%22%0AOutput: 0%0AExplanation: There is no such common subsequence, so the result is 0.%0A%0AConstraints:%0A- 1 %3C= text1.length %3C= 1000%0A- 1 %3C= text2.length %3C= 1000%0A- The input strings consist of lowercase English characters only.%0A%22%22%22%0A%0A%0Aclass Solution(object):%0A    def longestCommonSubsequence(self, text1, text2):%0A        %22%22%22%0A        :type text1: str%0A        :type text2: str%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A%09pass%0A%0A%0Aif __name__ == '__main__':%0A%09main()%0A

Add lc1143_longest_common_subsequence.py