Package g1901_2000.s1947_maximum_compatibility_score_sum

Class Solution

java.lang.Object
g1901_2000.s1947_maximum_compatibility_score_sum.Solution
public class Solution extends Object
1947 - Maximum Compatibility Score Sum.<p>Medium</p> <p>There is a survey that consists of <code>n</code> questions where each question&rsquo;s answer is either <code>0</code> (no) or <code>1</code> (yes).</p> <p>The survey was given to <code>m</code> students numbered from <code>0</code> to <code>m - 1</code> and <code>m</code> mentors numbered from <code>0</code> to <code>m - 1</code>. The answers of the students are represented by a 2D integer array <code>students</code> where <code>students[i]</code> is an integer array that contains the answers of the <code>i<sup>th</sup></code> student ( <strong>0-indexed</strong> ). The answers of the mentors are represented by a 2D integer array <code>mentors</code> where <code>mentors[j]</code> is an integer array that contains the answers of the <code>j<sup>th</sup></code> mentor ( <strong>0-indexed</strong> ).</p> <p>Each student will be assigned to <strong>one</strong> mentor, and each mentor will have <strong>one</strong> student assigned to them. The <strong>compatibility score</strong> of a student-mentor pair is the number of answers that are the same for both the student and the mentor.</p> <ul> <li>For example, if the student&rsquo;s answers were <code>[1, 0, 1]</code> and the mentor&rsquo;s answers were <code>[0, 0, 1]</code>, then their compatibility score is 2 because only the second and the third answers are the same.</li> </ul> <p>You are tasked with finding the optimal student-mentor pairings to <strong>maximize</strong> the <strong>sum of the compatibility scores</strong>.</p> <p>Given <code>students</code> and <code>mentors</code>, return <em>the <strong>maximum compatibility score sum</strong> that can be achieved.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> students = [[1,1,0],[1,0,1],[0,0,1]], mentors = [[1,0,0],[0,0,1],[1,1,0]]</p> <p><strong>Output:</strong> 8</p> <p><strong>Explanation:</strong> We assign students to mentors in the following way:</p> <ul> <li> <p>student 0 to mentor 2 with a compatibility score of 3.</p> </li> <li> <p>student 1 to mentor 0 with a compatibility score of 2.</p> </li> </ul> <p>student 2 to mentor 1 with a compatibility score of 3.</p> <p>The compatibility score sum is 3 + 2 + 3 = 8.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> students = [[0,0],[0,0],[0,0]], mentors = [[1,1],[1,1],[1,1]]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> The compatibility score of any student-mentor pair is 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == students.length == mentors.length</code></li> <li><code>n == students[i].length == mentors[j].length</code></li> <li><code>1 <= m, n <= 8</code></li> <li><code>students[i][k]</code> is either <code>0</code> or <code>1</code>.</li> <li><code>mentors[j][k]</code> is either <code>0</code> or <code>1</code>.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxCompatibilitySum

      public int maxCompatibilitySum(int[][] students, int[][] mentors)