Created
November 1, 2019 14:43
-
-
Save zeeshanaslam78/6c8c0f27a9f9a7f809ae7c16a29c1242 to your computer and use it in GitHub Desktop.
question2 solution
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public int solution(int N, String S) { | |
| TreeSet<String> sortSet = new TreeSet<>(); | |
| String[] reservedSeats = S.split(" "); | |
| for (String reservedSeat : reservedSeats) { | |
| sortSet.add(reservedSeat); | |
| } | |
| int counterFourFamilySeats = 0; | |
| for (int i = 1; i <= N; i++) { | |
| if ( !sortSet.contains(i+"B") && !sortSet.contains(i+"C") && !sortSet.contains(i+"D") && !sortSet.contains(i+"E") | |
| && !sortSet.contains(i+"F") && !sortSet.contains(i+"G") && !sortSet.contains(i+"H") && !sortSet.contains(i+"J")) { | |
| counterFourFamilySeats = counterFourFamilySeats + 2; | |
| continue; | |
| } | |
| if ( !sortSet.contains(i+"D") && !sortSet.contains(i+"E") && !sortSet.contains(i+"F") && !sortSet.contains(i+"G") ) { | |
| counterFourFamilySeats++; | |
| } else { | |
| if ( !sortSet.contains(i+"B") && !sortSet.contains(i+"C") && !sortSet.contains(i+"D") && !sortSet.contains(i+"E") ) { | |
| counterFourFamilySeats++; | |
| } | |
| if ( !sortSet.contains(i+"F") && !sortSet.contains(i+"G") && !sortSet.contains(i+"H") && !sortSet.contains(i+"J") ) { | |
| counterFourFamilySeats++; | |
| } | |
| } | |
| } | |
| return counterFourFamilySeats; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment