Package g1301_1400.s1349_maximum_students_taking_exam

Class Solution

java.lang.Object
g1301_1400.s1349_maximum_students_taking_exam.Solution
public class Solution extends java.lang.Object
1349 - Maximum Students Taking Exam.

Hard

Given a m * n matrix seats that represent seats distributions in a classroom. If a seat is broken, it is denoted by '#' character otherwise it is denoted by a '.' character.

Students can see the answers of those sitting next to the left, right, upper left and upper right, but he cannot see the answers of the student sitting directly in front or behind him. Return the maximum number of students that can take the exam together without any cheating being possible..

Students must be placed in seats in good condition.

Example 1:

Input: seats = [[“#”,“.”,“#”,“#”,“.”,“#”], [“.”,“#”,“#”,“#”,“#”,“.”], [“#”,“.”,“#”,“#”,“.”,“#”]]

Output: 4

Explanation: Teacher can place 4 students in available seats so they don’t cheat on the exam.

Example 2:

Input: seats = [[“.”,“#”], [“#”,“#”], [“#”,“.”], [“#”,“#”], [“.”,“#”]]

Output: 3

Explanation: Place all students in available seats.

Example 3:

Input: seats = [[“#”,“.”,“.”,“.”,“#”], [“.”,“#”,“.”,“#”,“.”], [“.”,“.”,“#”,“.”,“.”], [“.”,“#”,“.”,“#”,“.”], [“#”,“.”,“.”,“.”,“#”]]

Output: 10

Explanation: Place students in available seats in column 1, 3 and 5.

Constraints:

  • seats contains only characters '.' and``'#'.
  • m == seats.length
  • n == seats[i].length
  • 1 <= m <= 8
  • 1 <= n <= 8

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    maxStudents(char[][] seats)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxStudents

      public int maxStudents(char[][] seats)