题目:原题链接(中等)
标签:二分查找、哈希表、数组、动态规划
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
Ans 1 (Python) | O ( ( N 1 + N 2 ) × N 1 × l o g ( m i n ( N 1 , N 2 ) ) ) | O ( N 1 2 ) | 5964ms (28%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一(二分查找):
class Solution:
def findLength(self, A: List[int], B: List[int]) -> int:
def check(v):
hashmap = set()
for i in range(len(A) - v + 1):
hashmap.add("".join(str(a) for a in A[i:i + v]))
for i in range(len(B) - v + 1):
if "".join(str(b) for b in B[i:i + v]) in hashmap:
return True
return False
ans = 0
left, right = 0, min(len(A), len(B)) + 1
while left < right:
mid = (left + right) // 2
if check(mid):
ans = mid
left = mid + 1
else:
right = mid
return ans