Leetcode Problem 1947. Maximum Compatibility Score Sum

1947. Maximum Compatibility Score Sum

Leetcode Solutions

Define a recursive function dfs that takes the current index i, the total number of questions n, the total number of students and mentors m, the students array, the mentors array, and a reference to the maximum score ans.
If the current index i is equal to n, calculate the compatibility score for the current permutation and update ans if the score is higher than the current ans.
Iterate over the students from the current index i to n and swap the i-th student with the j-th student.
Call dfs recursively with the next index i + 1.
After the recursive call, swap the students back to maintain the original order.
In the main function, initialize ans to 0 and call dfs starting from index 0.
Return the value of ans.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen