Java 在矩阵中查找模式
在矩阵中查找模式
实例源码：
源代码：
执行
执行中...
x
1
2
public class Main{/**来 自 时代Java公众号 - nowjava.com**/3
4
public static void main(String[] args) {5
6
int[][] matrix = new int[][] { 7
8
{ 7, 2, 8, 3, 4, 5, 5, 8, 6, 4 }, 9
10
{ 6, 7, 3, 1, 1, 5, 8, 6, 1, 9 },11
12
{ 8, 9, 8, 8, 2, 4, 2, 6, 4, 3 }, 13
14
{ 3, 8, 3, 9, 5, 0, 5, 3, 2, 4 }, 15
16
{ 9, 5, 0, 9, 5, 1, 5, 8, 1, 3 },17
18
{ 3, 8, 4, 3, 8, 4, 5, 3, 8, 4 }, 19
20
{ 6, 4, 7, 3, 5, 3, 0, 2, 9, 3 }, 21
22
{ 7, 0, 5, 3, 1, 0, 6, 6, 0, 1 },23
24
{ 0, 8, 3, 4, 2, 8, 2, 9, 5, 6 }, 25
26
{ 4, 6, 0, 7, 9, 2, 4, 1, 3, 7 }, 27
28
{ 4, 6, 0, 7, 9, 2, 4, 1, 3, 7 } };29
30
int[][] pattern = new int[][] { 31
32
{ 9, 5, 0 }, // 来 自 NowJava.com - 时代Java33
34
{ 3, 8, 4 }, 35
36
{ 3, 5, 3 } };37
38
39
System.out.println(findPattern(matrix, pattern).toString());40
41
42
}43
44
45
public static class Result {46
47
int R;48
49
int C;50
51
52
public Result(int R, int C) {53
54
this.R = R;55
56
this.C = C;57
58
}59
60
61
@Override62
63
public String toString() {64
65
return R + "--" + C;66
67
}68
69
}70
71
public static Result findPattern(int[][] matrix, int[][] pattern) {72
73
if (matrix.length < pattern.length || matrix[0].length < pattern[0].length) {74
75
return new Result(-1, -1);76
77
}78
79
80
int count = 0;81
82
for (int i = 0; i < matrix[0].length - pattern[0].length + 1; i++) {83
84
for (int j = 0; j < matrix.length - pattern.length + 1; j++) {85
86
count++;87
88
int I = i;89
90
int J = j;91
92
if (match(matrix, I, J, pattern)) {93
94
return new Result(I, J);95
96
}97
98
}99
100
}101
102
return new Result(-1, -1);103
104
}105
106
public static boolean match(int[][] matrix, int i, int j, int[][] pattern) {107
108
int J = j;109
110
for (int m = 0; m < pattern[0].length; m++) {111
112
for (int n = 0; n < pattern.length; n++) {113
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java