-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIntArrayWorker.java
More file actions
118 lines (109 loc) · 2.37 KB
/
IntArrayWorker.java
File metadata and controls
118 lines (109 loc) · 2.37 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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
public class IntArrayWorker {
/** two dimensional matrix */
private int[][] matrix = null;
/**
* set the matrix to the passed one
*
* @param theMatrix the one to use
*/
public void setMatrix(int[][] theMatrix) {
matrix = theMatrix;
}
/**
* Method to return the total
*
* @return the total of the values in the array
*/
public int getTotal() {
int total = 0;
for (int row = 0; row < matrix.length; row++) {
for (int col = 0; col < matrix[0].length; col++) {
total = total + matrix[row][col];
}
}
return total;
}
/**
* Method to return the total using a nested for-each loop
*
* @return the total of the values in the array
*/
public int getTotalNested() {
int total = 0;
for (int[] rowArray : matrix) {
for (int item : rowArray) {
total = total + item;
}
}
return total;
}
/**
* Method to fill with an increasing count
*/
public void fillCount() {
int numCols = matrix[0].length;
int count = 1;
for (int row = 0; row < matrix.length; row++) {
for (int col = 0; col < numCols; col++) {
matrix[row][col] = count;
count++;
}
}
}
/**
* print the values in the array in rows and columns
*/
public void print() {
for (int row = 0; row < matrix.length; row++) {
for (int col = 0; col < matrix[0].length; col++) {
System.out.print(matrix[row][col] + " ");
}
System.out.println();
}
System.out.println();
}
/**
* fill the array with a pattern
*/
public void fillPattern1() {
for (int row = 0; row < matrix.length; row++) {
for (int col = 0; col < matrix[0].length; col++) {
if (row < col)
matrix[row][col] = 1;
else if (row == col)
matrix[row][col] = 2;
else
matrix[row][col] = 3;
}
}
}
public int getCount(int i) {
int count = 0;
for (int row = 0; row < matrix.length; row++) {
for (int col = 0; col < matrix[0].length; col++) {
if (matrix[row][col] == i) {
count++;
}
}
}
return count;
}
public int getLargest() {
int highest = matrix[0][0];
for (int row = 0; row < matrix.length; row++) {
for (int col = 0; col < matrix[0].length; col++) {
if (matrix[row][col] >= highest) {
highest = matrix[row][col];
}
}
}
return highest;
}
public int getColTotal(int col) {
int total = 0;
for (int row = 0; row < matrix.length; row++) {
total = total + matrix[row][col];
}
return total;
}
}