在一个N*N的数组中寻找所有横,竖,左上到右下,右上到左下,四种方向的直线连续D个数字的和里面最大的值
输入描述:
每个测试输入包含1个测试用例,第一行包括两个整数 N 和 D :
3 <= N <= 100
1 <= D <= N
接下来有N行,每行N个数字d:
0 <= d <= 100
输出描述:
输出一个整数,表示找到的和的最大值
输入例子1:
4 2
87 98 79 61
10 27 95 70
20 64 73 29
71 65 15 0
输出例子1:
193
解题思路
循环遍历所有数字,以其作为起点,进行横,竖,左上到右下,右上到左下四种遍历,当个数等于D时或者到达数组边界时退出。
其实代码可以进行剪枝,循环遍历所有数字可以判断出某些数字为起点进行横,竖,左上到右下,右上到左下四种遍历到达数组边界时凑不够D个数字的。不判断优化也可以AC。
import java.util.Scanner;
public class Main {
private static int fromLeftToRight(int[][] data, int row, int col, int M) {
int count = 0, sum = 0;
for (int j = col; count < M && j < data[0].length; j++) {
count++;
sum += data[row][j];
}
return count == M ? sum : -1;
}
private static int fromUpToLow(int[][] data, int row, int col, int M) {
int count = 0, sum = 0;
for (int i = row; count < M && i < data.length; i++) {
count++;
sum += data[i][col];
}
return count == M ? sum : -1;
}
private static int fromLeftUpToRightLow(int[][] data, int row, int col, int M) {
int count = 0, sum = 0;
for (int i = row, j = col; count < M && i < data.length && j < data[0].length; i++, j++) {
count++;
sum += data[i][j];
}
return count == M ? sum : -1;
}
private static int fromRightUpToLeftLow(int[][] data, int row, int col, int M) {
int count = 0, sum = 0;
for (int i = row, j = col; count < M && i >= 0 && j < data[0].length; i--, j++) {
count++;
sum += data[i][j];
}
return count == M ? sum : -1;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int[][] data = new int[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
data[i][j] = sc.nextInt();
}
}
int max = Integer.MIN_VALUE;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
max = Math.max(max, Math.max(fromLeftToRight(data, i, j, M), fromRightUpToLeftLow(data, i, j, M)));
max = Math.max(max, Math.max(fromLeftUpToRightLow(data, i, j, M), fromUpToLow(data, i, j, M)));
}
}
System.out.println(max);
}
}