FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/DynamicProgramming/LongestCommonSubsequence.java at master · maxiaoli/Java · GitHub
maxiaoli
/
Java
Public
forked from
TheAlgorithms/Java
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
DynamicProgramming
/
LongestCommonSubsequence.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
68 lines (58 loc) · 2.21 KB
Breadcrumbs
Java
/
DynamicProgramming
/
LongestCommonSubsequence.java
Copy path
File metadata and controls
68 lines (58 loc) · 2.21 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
DynamicProgramming
;
class
LongestCommonSubsequence
{
public
static
String
getLCS
(
String
str1
,
String
str2
) {
//At least one string is null
if
(
str1
==
null
||
str2
==
null
)
return
null
;
//At least one string is empty
if
(
str1
.
length
() ==
0
||
str2
.
length
() ==
0
)
return
""
;
String
[]
arr1
=
str1
.
split
(
""
);
String
[]
arr2
=
str2
.
split
(
""
);
//lcsMatrix[i][j] = LCS of first i elements of arr1 and first j characters of arr2
int
[][]
lcsMatrix
=
new
int
[
arr1
.
length
+
1
][
arr2
.
length
+
1
];
for
(
int
i
=
0
;
i
<
arr1
.
length
+
1
;
i
++)
lcsMatrix
[
i
][
0
] =
0
;
for
(
int
j
=
1
;
j
<
arr2
.
length
+
1
;
j
++)
lcsMatrix
[
0
][
j
] =
0
;
for
(
int
i
=
1
;
i
<
arr1
.
length
+
1
;
i
++) {
for
(
int
j
=
1
;
j
<
arr2
.
length
+
1
;
j
++) {
if
(
arr1
[
i
-
1
].
equals
(
arr2
[
j
-
1
])) {
lcsMatrix
[
i
][
j
] =
lcsMatrix
[
i
-
1
][
j
-
1
] +
1
;
}
else
{
lcsMatrix
[
i
][
j
] =
lcsMatrix
[
i
-
1
][
j
] >
lcsMatrix
[
i
][
j
-
1
] ?
lcsMatrix
[
i
-
1
][
j
] :
lcsMatrix
[
i
][
j
-
1
];
}
}
}
return
lcsString
(
str1
,
str2
,
lcsMatrix
);
}
public
static
String
lcsString
(
String
str1
,
String
str2
,
int
[][]
lcsMatrix
) {
StringBuilder
lcs
=
new
StringBuilder
();
int
i
=
str1
.
length
(),
j
=
str2
.
length
();
while
(
i
>
0
&&
j
>
0
) {
if
(
str1
.
charAt
(
i
-
1
) ==
str2
.
charAt
(
j
-
1
)) {
lcs
.
append
(
str1
.
charAt
(
i
-
1
));
i
--;
j
--;
}
else
if
(
lcsMatrix
[
i
-
1
][
j
] >
lcsMatrix
[
i
][
j
-
1
]) {
i
--;
}
else
{
j
--;
}
}
return
lcs
.
reverse
().
toString
();
}
public
static
void
main
(
String
[]
args
) {
String
str1
=
"DSGSHSRGSRHTRD"
;
String
str2
=
"DATRGAGTSHS"
;
String
lcs
=
getLCS
(
str1
,
str2
);
//Print LCS
if
(
lcs
!=
null
) {
System
.
out
.
println
(
"String 1: "
+
str1
);
System
.
out
.
println
(
"String 2: "
+
str2
);
System
.
out
.
println
(
"LCS: "
+
lcs
);
System
.
out
.
println
(
"LCS length: "
+
lcs
.
length
());
}
}
}
Back
|
FazBrowse Home
|
New Git URL