华为OD机试真题 - 最大矩阵和
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[][] matrix = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
matrix[i][j] = sc.nextInt();
}
}
getResult(matrix);
}
public static int getResult(int[][] map) {
int max = Integer.MIN_VALUE;
for (int i = 0; i < map.length; i++) {
max = Math.max(getSubMax(map[i]), max);
for (int j = 1; j < map.length; j++) {
max = Math.max(max, getSubMax(getMatixMax(map, i, j)));
}
}
return max;
}
public static int getSubMax(int[] sub) {
int res = sub[0];
int max = sub[0];
for (int i = 1; i < sub.length; i++) {
max = Math.max(sub[i] + max, sub[i]);
res = Math.max(res, max);
}
return res;
}
public static int[] getMatixMax(int[][] map, int begin, int end) {
int line = map[begin].length;
int[] zip = new int[line];
for (int i = 0; i < line; i++) {
for (int j = begin; j <= end; j++) {
zip[i] += map[j][i];
}
}
return zip;
}
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[][] matrix = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
matrix[i][j] = sc.nextInt();
}
}
getResult(matrix);
}
public static int getResult(int[][] map) {
int max = Integer.MIN_VALUE;
for (int i = 0; i < map.length; i++) {
max = Math.max(getSubMax(map[i]), max);
for (int j = 1; j < map.length; j++) {
max = Math.max(max, getSubMax(getMatixMax(map, i, j)));
}
}
return max;
}
public static int getSubMax(int[] sub) {
int res = sub[0];
int max = sub[0];
for (int i = 1; i < sub.length; i++) {
max = Math.max(sub[i] + max, sub[i]);
res = Math.max(res, max);
}
return res;
}
public static int[] getMatixMax(int[][] map, int begin, int end) {
int line = map[begin].length;
int[] zip = new int[line];
for (int i = 0; i < line; i++) {
for (int j = begin; j <= end; j++) {
zip[i] += map[j][i];
}
}
return zip;
}
全部评论
相关推荐
投递拼多多集团-PDD等公司10个岗位 >
点赞 评论 收藏
分享