easy java, c++
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    public int minimumAddedInteger(int[] nums1, int[] nums2) {\n        int n1=nums1.length;\n        int n2=nums2.length;\n        Arrays.sort(nums1);\n        Arrays.sort(nums2);\n        int min=Integer.MAX_VALUE;\n        for(int i=0;i<n1;i++){\n            for(int j=i+1;j<n1;j++){\n                int diff=Integer.MAX_VALUE;\n                \n                int k=0;\n                boolean valid=false;\n                for(int m=0;m<n1;m++){\n                    if(m==i || m==j ){\n                        continue;\n                    }\n                    if(diff==Integer.MAX_VALUE){\n                        diff=nums2[k++]-nums1[m];\n                        valid=true;\n                    }\n                    else if((nums2[k++]-nums1[m])!=diff){\n                        valid=false ;\n                        break;\n                    }\n                }\n                if(valid==true){\n                    min=Math.min(min,diff);\n                }\n            }\n        }\n        return min;\n    }\n}\n```
['Array', 'Two Pointers', 'Sorting', 'Enumeration', 'C++', 'Java', 'Python3']