首先特别注意二维数组如果从下标0,0开始需要注意的是分情况讨论。
先求sum矩阵,每一个点的前缀和
static int arr[][] = new int[][]{{1, 5, 6, 8},
{9, 6, 7, 3},
{5, 3, 2, 4}};
static int sum[][]=new int[3][4];
//求前缀和矩阵sum的值,当边界为(0,0)时
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
if(i==0&&j==0){
sum[i][j]=arr[0][0];
}
else if(i==0&&j!=0){
sum[i][j]=sum[0][j-1]+arr[0][j];
}
else if(i!=0&&j==0){
sum[i][j]=sum[i-1][0]+arr[i][0];
}
else{
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+arr[i][j];
}
}
}
求某两个点之间的(区间和)前缀和
public static int qian(int x1,int y1,int x2,int y2){
if(x1==0&&y1==0)//x1为0且y1为0的情况
return sum[x2][y2];
else if(x1==0&&y1!=0)
return sum[x2][y2]-sum[x2][y1-1];
else if(x1!=0&&y1==0)
return sum[x2][y2]-sum[x1-1][y2];
else return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
}
import java.util.*;
public class Main {
static int arr[][] = new int[][]{
{1, 5, 6, 8},
{9, 6, 7, 3},
{5, 3, 2, 4}};
static int sum[][]=new int[3][4];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//求前缀和矩阵sum的值,当边界为(0,0)时
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
if(i==0&&j==0){
sum[i][j]=arr[0][0];
}
else if(i==0&&j!=0){
sum[i][j]=sum[0][j-1]+arr[0][j];
}
else if(i!=0&&j==0){
sum[i][j]=sum[i-1][0]+arr[i][0];
}
else{
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+arr[i][j];
}
}
}
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
System.out.print(sum[i][j]+" ");
}
System.out.println();
}
System.out.println(qian(0,0,2,2));
}
public static int qian(int x1,int y1,int x2,int y2){
if(x1==0&&y1==0)//x1为0且y1为0的情况
return sum[x2][y2];
else if(x1==0&&y1!=0)
return sum[x2][y2]-sum[x2][y1-1];
else if(x1!=0&&y1==0)
return sum[x2][y2]-sum[x1-1][y2];
else return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
}
}
二维数组有边界且下标从1,1开始
此种情况不需要考虑太多关于0,0的情况
import java.util.*;
public class Main {
static int arr[][] = new int[][]{{0,0,0,0,0},
{0,1, 5, 6, 8},
{0,9, 6, 7, 3},
{0,5, 3, 2, 4}};
static int sum[][]=new int[4][5];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//求前缀和矩阵sum的值,当边界为(0,0)时
for(int i=1;i<4;i++){
for(int j=1;j<5;j++){
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+arr[i][j];
}
}
for(int i=1;i<4;i++){
for(int j=1;j<5;j++){
System.out.print(sum[i][j]+" ");
}
System.out.println();
}
System.out.println(qian(1,1,3,2));
}
public static int qian(int x1,int y1,int x2,int y2){
return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
}
}