Java Beginner BruteForce Approach
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 maxDivScore(int[] nums, int[] divisors) {\n        \n       \n        int a=0;\n        int aa=Integer.MAX_VALUE;\n        for(int i=divisors.length-1;i>=0;i--){\n            int d=divisors[i];\n             int c=0;\n            for(int j=0;j<nums.length;j++){\n                if(nums[j]%d==0)\n                c++;\n            }\n            if(c==a){\n                aa=Math.min(aa,d);\n\n            }\n            if(c>a){\n                a=c;\n                aa=d;\n\n            }\n        }\n        return aa;\n    }\n}\n```
['Java']