easy solution with 50%beats java 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)$$ -->\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       ArrayList<Integer> list = new ArrayList<>();\n       ArrayList<Integer> finalList = new ArrayList<>();\n\n       int j = 0;\n       while(j<divisors.length){\n           int i = 0;\n           int count = 0;\n           while(i<nums.length){\n           if(nums[i]%divisors[j] == 0){\n               count++;\n           }\n           i++;\n        }\n        list.add(count);\n           j++;\n        }\n\n        int a = Collections.max(list);\n        for(int m =0 ; m<list.size(); m++){\n            if(a == list.get(m)){\n                finalList.add(divisors[m]);\n            }\n        }\n\n\n\n        return Collections.min(finalList);\n    }\n}\n```
['Java']