2D数组求每行除了对角线索引以外的所有数字之和。

huangapple
go评论97阅读模式
英文:

2D Array sum all numbers in a row except for the diagonal index

问题

  1. public class TwoDArray {
  3.     public static void SquareNum(final int[][] arr) {
  4.         for (int i = 0; i < arr.length; i++) {
  5.             int squareSum = 0;
  6.             int diagonalValue = arr[i][i];
  7.             
  8.             for (int j = 0; j < arr[i].length; j++) {
  9.                 if (j != i) {
  10.                     squareSum += arr[i][j];
  11.                 }
  12.             }
  13.             
  14.             int calculatedSquare = squareSum * squareSum;
  15.             
  16.             if (calculatedSquare == diagonalValue) {
  17.                 System.out.println(diagonalValue + " is valid.");
  18.             } else {
  19.                 System.out.println(diagonalValue + " is not valid.");
  20.             }
  21.         }
  22.     }
  23.     
  24.     public static void main(final String[] args) {
  25.         final int[][] arr =   {{ 144, 2, 3, 2, 5},
  26.                             {2, 36, 1, 2, 1},
  27.                             {0, 0, 9, 0, 3},
  28.                             {4, 4, 4, 225, 3},
  29.                             {1, 1, 1, 1, 16}};
  30.         SquareNum(arr);
  31.     }
  32. }
英文:

I was wrecking my brain for a while now and finally gave up.

Say, this is my array:

  1.    int[][] arr =   {{ 144, 2, 3, 2, 5},
  2.                     {2, 36, 1, 2, 1},
  3.                     {0, 0, 9, 0, 3},
  4.                     {4, 4, 4, 225, 3},
  5.                     {1, 1, 1, 1, 16}};

I need to calculate the sum of all of the numbers except for the arr[i][i] and then compare it's power of two to the said number.

For example, 144 is the arr[0][0] in the first loop. I need to take (2 + 3 + 2 + 5)^2 and check if it's equal to 144 (it is). I was happy when I did it with the first row, but then got stuck on idea of taking every now except the arr[i][i] number, which in the second row is 36.

I got nothing until now, only wrong assumptions. I'm still learning 2D arrays but the subject doesn't sit well.

  1. public class TwoDArray {
  3.     public static void SquareNum(final int[][] arr) {
  4.     double sqaureSum = 0;
  5.     int total = 0;
  6.     for (int i = 0; i &lt; arr[i].length - 1; i++) {
  7.         total = 0;
  8.         for (int j = 0; j &lt; arr[i].length; j++) {
  9.             }
  10.             ???
  11.         }
  12.     }
  13.     public static void main(final String[] args) {
  14.         final int[][] arr =   {{ 144, 2, 3, 2, 5},
  15.                             {2, 36, 1, 2, 1},
  16.                             {0, 0, 9, 0, 3},
  17.                             {4, 4, 4, 225, 3},
  18.                             {1, 1, 1, 1, 16}};
  19.     SquareNum(arr);
  20.     }
  21. }

Any leads on how I can achieve this?

Thanks 2D数组求每行除了对角线索引以外的所有数字之和。

答案1

得分: 1

以下是已经翻译好的代码部分：

  1. class TwoDArray {
  3.     public static void SquareNum(final int[][] arr) {
  4.         String output = "满足条件的行数为：";
  5.         int total = 0;
  6.         for (int i = 0; i < arr[i].length; i++) {
  7.             total = 0;
  8.             for (int j = 0; j < arr[i].length; j++) {
  9.                 total += arr[i][j];
  10.             }
  11.             double squareSum = Math.pow(total - arr[i][i], 2);
  12.             if (squareSum == arr[i][i]) {
  13.                 output += i + " ";
  14.             }
  15.         }
  16.         System.out.println(output);
  17.     }
  18.     
  19.     public static void main(final String[] args) {
  20.         final int[][] arr = {{ 144, 2, 3, 2, 5},
  21.                              {2, 36, 1, 2, 1},
  22.                              {0, 0, 9, 0, 3},
  23.                              {4, 4, 4, 225, 3},
  24.                              {1, 1, 1, 1, 16}};
  25.         SquareNum(arr);
  26.     }
  27. }
英文:

Here's the code with my suggestions in the comments above added. I've also shown how I'd do the output as you described.

  1. class TwoDArray {
  3.     public static void SquareNum(final int[][] arr) {
  4.         String output = &quot;The row numbers where the condition is true are: &quot;;
  5.         int total = 0;
  6.         for (int i = 0; i &lt; arr[i].length; i++) {
  7.             total = 0;
  8.             for (int j = 0; j &lt; arr[i].length; j++) {
  9.                 total += arr[i][j];
  10.             }
  11.             double squareSum = Math.pow(total - arr[i][i], 2);
  12.             if (squareSum == arr[i][i])
  13.             {
  14.                 output += i + &quot; &quot;;
  15.             }
  16.         }
  17.         System.out.println(output);
  18.     }
  19.     public static void main(final String[] args) {
  20.         final int[][] arr =   {{ 144, 2, 3, 2, 5},
  21.                 {2, 36, 1, 2, 1},
  22.                 {0, 0, 9, 0, 3},
  23.                 {4, 4, 4, 225, 3},
  24.                 {1, 1, 1, 1, 16}};
  25.         SquareNum(arr);
  26.     }
  27. }

huangapple
  • 本文由 发表于 2020年4月8日 01:49:52
  • 转载请务必保留本文链接：https://go.coder-hub.com/61086249.html
  • arrays
  • java
匿名

发表评论

匿名网友

:?: :razz: :sad: :evil: :!: :smile: :oops: :grin: :eek: :shock: :???: :cool: :lol: :mad: :twisted: :roll: :wink: :idea: :arrow: :neutral: :cry: :mrgreen:

确定