座位是否可坐的情况用一个二维数组布尔存储,记为seats,行列固定为20*5。输出座位编号的时候需要转化下,如seats[i][j]的号码应该是5*i + j + 1。座位找到后要及时break,提高时间效率
奉上java满分代码
import java.util.*;
public class Main{
private static final int rows = 20, cols = 5;
private static boolean[][] seats = new boolean[rows][cols];
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n = Integer.parseInt(scanner.nextLine());
int[] numbers = new int[n];
String[] line = scanner.nextLine().split(" ");
for(int i = 0; i < n; i++){
numbers[i] = Integer.parseInt(line[i]);
}
scanner.close();
for(int number : numbers){
boolean isSeated = false;
for(int i = 0; i < rows; i++){
int j = 0;
int count = 0;
while (j < cols && seats[i][j])
j++;
int k = j;
while (k < cols && count < number){
count++;
k++;
}
if(count == number){
while (j < k){
printSeatNo(i, j++);
}
System.out.println();
isSeated = true;
break;
}
}
if(!isSeated){
int count = 0;
for(int i = 0; i < rows && count < number; i++){
for(int j = 0; j < cols; j++){
if(!seats[i][j]){
count++;
printSeatNo(i, j);
if(count == number)
break;
}
}
}
System.out.println();
}
}
}
private static void printSeatNo(int i, int j){
seats[i][j] = true;
System.out.print((i * cols + j + 1) + " ");
}
}