StackMatrix.java
4.47 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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
package com.huaheng.api.wcs.domain;
import java.util.*;
import java.util.function.Function;
/***
* @author tongzonghao
*
*/
public class StackMatrix {
private int[][] matr;
private int row;
private int column;
public int getRow() {
return row;
}
public int getColumn() {
return column;
}
public StackMatrix(int row, int column) {
this.row = row;
this.column = column;
matr = new int[row][column];
}
public StackMatrix(Integer stackType) {
int rowFlag = 3;
int columnFlag = 0;
switch (stackType){
case 1:
case 3:
columnFlag = 3;
break;
case 2:
columnFlag = 4;
break;
default:
}
this.row = rowFlag;
this.column = columnFlag;
matr = new int[row][column];
}
public void setForEach(Function<Integer, Integer> funtion) {
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
matr[i][j] = funtion.apply(matr[i][j]);
}
}
}
/**
* 从高位向下取 位置号
*
* @param columnIdx
* @param rowIdx
* @return
*/
public List<Integer> getColumnValue(int rowIdx, int columnIdx) {
Set<Integer> columnValues = new HashSet<>();
if (columnIdx < 0 || columnIdx > this.column) {
return null;
}
for (int i = this.row - 1; i >= rowIdx; i--) {
columnValues.add(matr[i][columnIdx]);
}
columnValues.remove(new Integer(0));
return new ArrayList<>(columnValues);
}
/**
* 水平取位置
*
* @param columnIdx
* @param rowIdx
* @return
*/
public List<Integer> getLayerValue(int columnIdx, int rowIdx) {
Set<Integer> layerValues = new HashSet<>();
if (rowIdx < 0 || rowIdx > this.row) {
return null;
}
for (int i = this.column - 1; i >= columnIdx; i--) {
layerValues.add(matr[rowIdx][i]);
}
return new ArrayList<>(layerValues);
}
public Map<String, Integer> searchValueByFullMatr(int target) {
Map<String, Integer> map = new HashMap<>();
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
if (target == matr[i][j]) {
map.put("row", i);
map.put("column", j);
return map;
}
}
}
return null;
}
public int getMaxValueRow() {
int maxValue = matr[0][0];
int maxRow = 0;
for (int j = 0; j < matr.length; j++) {
for (int i = 0; i < matr[j].length; i++) {
if (matr[j][i] > maxValue) {
maxValue = matr[j][i];
maxRow = j;
}
}
}
return maxRow;
}
public int getMinValueRow() {
int minValue = matr[0][0];
int minValueRow = 0;
for (int j = 0; j < matr.length; j++) {
for (int i = 0; i < matr[j].length; i++) {
if (matr[j][i] < minValue ) {
minValue = matr[j][i];
minValueRow = j;
}
}
}
return minValueRow ;
}
public int getMaxValue() {
int maxValue = matr[0][0];
for (int j = 0; j < matr.length; j++) {
for (int i = 0; i < matr[j].length; i++) {
if (matr[j][i] > maxValue) {
maxValue = matr[j][i];
}
}
}
return maxValue;
}
public int getMinValue() {
int minValue = matr[0][0];
for (int j = 0; j < matr.length; j++) {
for (int i = 0; i < matr[j].length; i++) {
if (matr[j][i] < minValue ) {
minValue = matr[j][i];
}
}
}
return minValue ;
}
public StackMatrix setMatr(int[][] matr) {
this.matr = matr;
return this;
}
public int[][] getMatr() {
return matr;
}
public int getEmptyPosition() {
int minPosition = 0;
int num = 0;
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
num++;
if (matr[i][j] == 0) {
return num;
}
}
}
return minPosition;
}
}