[Python 🐍] Sets Unique in nums1 PLUS Unique in nums2 PLUS Shared nums1 nums2
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n        N = len(nums1)\n\n        s1 = set(nums1)\n        s2 = set(nums2)\n        \n        u1 = s1  -s2\n        u2 = s2 - s1\n\n        shared = s1 & s2\n\n        return min( min(len(u1), N//2) + min(len(u2), N//2) + len(shared), N )\n\n\n```
['Python3']