Find the Maximum Divisibility Score
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int maxDivScore(int[] nums, int[] divisors) {
         int min = 0, ans = Integer.MAX_VALUE;

        for (int i = 0; i < divisors.length; i++) {
            int count = 0;
            for (int j = 0; j < nums.length; j++) {
                if (nums[j] % divisors[i] == 0) {
                    count++;
                }
            }
            if (count > min || ( count == min && ans > divisors[i]) ) {
                ans = divisors[i];
                min = count;
            }
        }

        return ans;
    }
}
```
['Java']