Update longest_common_substring.py

- Combined the ans_index and ans_length into a single tuple to track the best match (position + length) more cleanly.

- Early exit for empty strings.

Author: Alfredoxrock

dynamic_programming/longest_common_substring.py

@@ -43,22 +43,21 @@ def longest_common_substring(text1: str, text2: str) -> str:
     if not (isinstance(text1, str) and isinstance(text2, str)):
         raise ValueError("longest_common_substring() takes two strings for inputs")
 
-    text1_length = len(text1)
-    text2_length = len(text2)
+    if not text1 or not text2:
+        return ''
 
-    dp = [[0] * (text2_length + 1) for _ in range(text1_length + 1)]
-    ans_index = 0
-    ans_length = 0
+    dp = [[0] * (len(text2) + 1) for _ in range(len(text1) + 1)]
+    max_length, end_pos = 0, 0
 
-    for i in range(1, text1_length + 1):
-        for j in range(1, text2_length + 1):
+    for i in range(1, len(text1) + 1):
+        for j in range(1, len(text2) + 1):
             if text1[i - 1] == text2[j - 1]:
-                dp[i][j] = 1 + dp[i - 1][j - 1]
-                if dp[i][j] > ans_length:
-                    ans_index = i
-                    ans_length = dp[i][j]
+                dp[i][j] = dp[i - 1][j - 1] + 1
+                if dp[i][j] > max_length:
+                    max_length = dp[i][j]
+                    end_pos = i
 
-    return text1[ans_index - ans_length : ans_index]
+    return text1[end_pos - max_length:end_pos]
 
 
 if __name__ == "__main__":