ARST打卡第263周

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22

class Solution {
public:
    int maxDivScore(vector<int>& nums, vector<int>& divisors) {
        sort(nums.begin(), nums.end());
        sort(divisors.begin(), divisors.end());
        int ans = divisors[0];
        int max_cnt = 0;
        for (auto div : divisors) {
            int cnt = 0;
            for (auto num : nums) {
                if (num % div == 0) {
                    cnt ++;
                }
            }
            if (cnt > max_cnt) {
                max_cnt = cnt;
                ans = div;
            }
        }
        return ans;
    }
};