-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathRowWiseSum.java
More file actions
84 lines (75 loc) · 2.2 KB
/
RowWiseSum.java
File metadata and controls
84 lines (75 loc) · 2.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
package twoDimensionalArray;
import java.util.Scanner;
/*For a given two-dimensional integer array/list of size (N x M), find and print the sum of each of the row elements in a single line, separated by a single space.
Input Format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
First line of each test case or query contains two integer values, 'N' and 'M', separated by a single space. They represent the 'rows' and 'columns' respectively, for the two-dimensional array/list.
Second line onwards, the next 'N' lines or rows represent the ith row values.
Each of the ith row constitutes 'M' column values separated by a single space.
Output Format :
For each test case, print the sum of every ith row elements in a single line separated by a single space.
Output for every test case will be printed in a separate line.
Constraints :
1 <= t <= 10^2
0 <= N <= 10^3
0 <= M <= 10^3
Time Limit: 1sec
Sample Input 1:
1
4 2
1 2
3 4
5 6
7 8
Sample Output 1:
3 7 11 15
Sample Input 2:
2
2 5
4 5 3 2 6
7 5 3 8 9
4 4
1 2 3 4
9 8 7 6
3 4 5 6
-1 1 -10 5
Sample Output 2:
20 32
10 30 18 -5 */
public class RowWiseSum {
public static void rowWiseSum(int[][] arr) {
if (arr.length == 0) {
return;
}
int sum = 0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[0].length; j++) {
sum = sum + arr[i][j];
}
System.out.print(sum + "\t");
sum = 0;
}
System.out.println();
}
public static int[][] takeInput() {
Scanner scan = new Scanner(System.in);
int row = scan.nextInt();
int column = scan.nextInt();
int[][] arr = new int[row][column];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
arr[i][j] = scan.nextInt();
}
}
return arr;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int testCases = scan.nextInt();
while (testCases != 0) {
int[][] arr = takeInput();
rowWiseSum(arr);
testCases--;
}
}
}