Given two integer arrays nums1 and nums2, return the maximum length of a subarray that appears in both arrays.
Example 1:
Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
Output: 3
Explanation: The repeated subarray with maximum length is [3,2,1].
Example 2:
Input: nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
Output: 5
Explanation: The repeated subarray with maximum length is [0,0,0,0,0].
Constraints:
- 1 <= nums1.length, nums2.length <= 1000
- 0 <= nums1[i], nums2[i] <= 100
class Solution:
def findLength(self, nums1: List[int], nums2: List[int]) -> int:
strnum2 = ''.join([chr(x) for x in nums2])
strmax = ''
ans = 0
for num in nums1:
strmax += chr(num)
if strmax in strnum2:
ans = max(ans,len(strmax))
else:
strmax = strmax[1:]
return ans'알고리즘 문제 > Leetcode' 카테고리의 다른 글
| 61. Rotate List (0) | 2023.01.11 |
|---|---|
| 80. Remove Duplicates from Sorted Array II (0) | 2023.01.11 |
| 706. Design HashMap (0) | 2023.01.10 |
| 463. Island Perimeter (0) | 2023.01.10 |
| 283. Move Zeroes (0) | 2023.01.10 |