英文:
counting amount of true statements in a 2d boolean array
问题
以下是翻译好的部分：
要计算真值语句的数量，我已经有了一段适合的代码
public static int countTrueStatement(int posX, int posY, boolean[][] arr){
int count = 0;
for (int i = posX - 1; i <= posX + 1; i++) {
for (int j = posY - 1; j <= posY + 1; j++) {
if (i >= 0 && i < arr.length && j >= 0 && j < arr[i].length && arr[i][j]) {
count++;
}
}
}
return count;
}
现在我不想计算整个数组，而只想计算相邻部分。例如，如果我的数组大小为7x7，我只想计算我可以决定的位置处的3x3数组中的真值语句数量。我考虑过创建子数组，但我不确定这是否是解决我的问题的最佳方法。
英文:
To count the amount of true statements I already have a fitting code
public static int countTrueStatement(int posX, int posY, boolean [][]arr){
int count=0;
for(int i=0; i < arr.length; i++){
for (int j = 0; j < arr.length; j++) {
if(arr[i][j]){
count++;
}
}
}
return count;
}
}
Now I don't want to count all of the array, but only the neighbouring. E.g. if my array has a size of 7x7 I only want to count the amount of true statement from a 3x3 array from a postion I can decide. I thought abouut creating a subarray, but I'm not sure if that is the best solution for my problem.
答案1
得分: 0
try:
public static int countTrueStatement(int posX, int posY, int lenX, int lenY, boolean [][]arr){
int count=0;
for(int i=posY; i < posY + lenY; i++){
for (int j = posX; j < posX + lenX; j++) {
if(arr[i][j]){
count++;
}
}
}
return count;
}
Instead of starting to iterate from the beginning of the array (index 0) we start from posY, posX. Similarly, we stop after lenY, lenX and not when we reach the end of the array.
英文:
try:
public static int countTrueStatement(int posX, int posY, int lenX, int lenY, boolean [][]arr){
int count=0;
for(int i=posY; i < posY + lenY; i++){
for (int j = posX; j < posX + lenX; j++) {
if(arr[i][j]){
count++;
}
}
}
return count;
}
Instead of starting to iterate from the beggining of the array (index 0) we start from posY,posX. similarly, we stop after lenY,lenX and not when we reach the end of the array.
专注分享java语言的经验与见解，让所有开发者获益！
评论