t0xa/algos_and_structures
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Add solution for unique elements in arrays

Browse source
This commit is contained in:
t0xa 2026-02-07 17:34:39 +03:00
parent a5169c9b85
commit b349644272
1 changed files with 24 additions and 25 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

47
algocode/two_pointers/unique_elements_in_two_arrays.py
View file

@ -14,32 +14,31 @@
len(nums1) + len(nums2) >= 1 len(nums1) + len(nums2) >= 1
""" """
def solve(nums1, nums2): def solve_1(nums1, nums2):
res = [] res = []
if len(nums1) > len(nums2): i = 0
short = nums2 j = 0
long = nums1 while i < len(nums1):
else: if j >= len(nums2):
short = nums1 res = res + nums1[i:]
long = nums2 return res
s, l = 0, 0 if nums1[i] == nums2[j]:
while s < len(short): j += 1
if short[s] == long[l]: i += 1
l+=1 elif nums1[i] < nums2[j]:
s+=1 res.append(nums1[i])
elif short[s] < long[l]: i += 1
res.append(short[s]) elif nums1[i] > nums2[j]:
s+=1 res.append(nums2[j])
elif short[s] > long[l]: j += 1
res = res + nums2[j:]
return res return res
s print(solve_1(nums1 = [1,5,7,9], nums2 = [2,3,5,6,7,8]))
1,5,7,9 print([1,2,3,6,8,9])
l
2,3,5,6,7,8
print(solve_1(nums1 = [2,3], nums2 = [1]))
print([1,2,3])
[1,2,3,6,8,9] print(solve_1(nums1 = [1], nums2 = [1,2]))
print([1,2])