[Python3] brute-force
Please pull this commit for solutions of weekly 395. \n\n\nclass Solution:\n    def minimumAddedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n     
Please pull this [commit](https://github.com/gaosanyong/leetcode/commit/23b93c6ca2db7f3d4b14edd23ad6680fd529bf3d) for solutions of weekly 395. \n\n```\nclass Solution:\n    def minimumAddedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n        nums1.sort()\n        nums2.sort()\n        ans = inf \n        m = len(nums1)\n        for x in range(m): \n            for y in range(x+1, m): \n                j = 0\n                seen = None\n                for i in range(m): \n                    if i not in (x, y): \n                        diff = nums2[j] - nums1[i]\n                        if seen is None: seen = diff\n                        elif seen != diff: break \n                        j += 1\n                else: ans = min(ans, seen)\n        return ans \n```
['Python3']