Easy Java Solution || Beginner Friendly
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 findMaxK(int[] nums) {\n        int n= nums.length;\n        Arrays.sort(nums);\n        for(int i=n-1; i>=0; i--)\n        { \n            for(int j=0; j<n; j++)\n            {\n                if(nums[i]==-nums[j])\n                return (nums[i]);\n            }\n        }\n        return -1;\n    }\n}\n```
['Java']