17年的蓝桥杯真题,难度较低,直接遍历查找就可以解决
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i] = sc.nextInt();
}
int count = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] != 0) {
System.out.print(arr[i]+" ");
count++;
}
}
System.out.println("\n"+count);
}
}
19年蓝桥杯国赛的一道中等难度的题型
import java.util.Scanner;
public class Main09 {
public static int[][] arr;
public static int[] num;
public static int n;
public static boolean check(int x,int y) {
//左
for (int i = y+1; i <n ; i++) {
if(arr[x][i]==2) {
return false;
}else if(arr[x][i]==0) {
break;
}
}
//右
for (int i = y-1; i >=0 ; i--) {
if(arr[x][i]==2) {
return false;
}else if(arr[x][i]==0) {
break;
}
}
//下
for (int i = x+1; i <n; i++) {
if(arr[i][y]==2) {
return false;
}else if(arr[i][y]==0) {
break;
}
}
//上
for (int i = x-1; i >=0; i--) {
if(arr[i][y]==2) {
return false;
}else if(arr[i][y]==0) {
break;
}
}
return true;
}
public static void dfs(int x,int y,int k) {
if(k<=n*n) {
num[k]++;
}
for (int i = x; i <n; i++) {
int j;
if(i==x) {
j=y;
}else {
j=0;
}
for (;j<n; j++) {
if(arr[i][j]!=0&&arr[i][j]!=2&&check(i,j)==true) {
arr[i][j]=2;
dfs(i,j,k+1);
arr[i][j]=1;
}
}
}
}
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
n=in.nextInt();
arr=new int[n][n];
num=new int[n*n+1];
for (int i = 0; i <n; i++) {
for (int j = 0; j <n; j++) {
arr[i][j]=in.nextInt();
}
}
dfs(0,0,1);
for (int i = 2; i <=n*n; i++) {
if(num[i]!=0) {
System.out.println(num[i]);
}
}
}
}