Python || simple and clean solution
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)$$ -->\no(n^2)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\no(n)\n\n# Code\n```\nclass Solution:\n    def minimumAddedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n        nums1.sort()\n        nums2.sort()\n        s1, s2 = sum(nums1), sum(nums2)\n\n        def check(i, j, m):\n            x = nums2[0] - m\n            if (x * len(nums2)) + (s1 - nums1[i] - nums1[j]) != s2:return False\n            m, n = 0, 0\n            while m < len(nums1) and n < len(nums2):\n                if m == i or m == j:\n                    m += 1\n                    continue\n                if nums1[m] + x != nums2[n]:return False\n                m += 1\n                n += 1\n            return True\n        \n        if check(0, 1, nums1[2]):return nums2[0] - nums1[2]\n        for i in range(2, len(nums1)):\n            if check(0, i, nums1[1]):return nums2[0] - nums1[1]\n        return nums2[0] - nums1[0]\n\n\n            \n\n\n```
['Python3']