Generation

generate functionWed, 25 Jan 2023

The number that has the maximum number of divisors inside an array

int solution(vector<int> &A) { int answer = 0; int max_cnt = 0; vector<int>::size_type i = 0; vector<int>::size_type len = A.size(); while(i < len) { int num = A[i]; vector<int>::size_type j = i + 1; int cnt = 1; while(j < len) { if (A[j] == num) { cnt += 1; A.erase(A.begin() + j); len = A.size(); } else { j++; } } if(max_cnt < cnt) { max_cnt = cnt; answer = num; } i++; } return answer; }

Questions about programming?Chat with your personal AI assistant