algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-20 18:24:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubsequence.java
View File

@ -30,15 +30,18 @@ public class LongestPalindromicSubsequence {
if (original.length() == 0 || reverse.length() == 0) {
bestResult = "";
} else {
// if the last chars match, then remove it from both strings and recur
if (original.charAt(original.length() - 1) == reverse.charAt(reverse.length() - 1)) {
String bestSubResult
= recursiveLPS(
original.substring(0, original.length() - 1),
reverse.substring(0, reverse.length() - 1));
if (
original.charAt(original.length() - 1) ==
reverse.charAt(reverse.length() - 1)
) {
String bestSubResult = recursiveLPS(
original.substring(0, original.length() - 1),
reverse.substring(0, reverse.length() - 1)
);
bestResult = reverse.charAt(reverse.length() - 1) + bestSubResult;
bestResult =
reverse.charAt(reverse.length() - 1) + bestSubResult;
} else {
// otherwise (1) ignore the last character of reverse, and recur on original and updated
// reverse again
@ -46,8 +49,14 @@ public class LongestPalindromicSubsequence {
// again
// then select the best result from these two subproblems.
String bestSubResult1 = recursiveLPS(original, reverse.substring(0, reverse.length() - 1));
String bestSubResult2 = recursiveLPS(original.substring(0, original.length() - 1), reverse);
String bestSubResult1 = recursiveLPS(
original,
reverse.substring(0, reverse.length() - 1)
);
String bestSubResult2 = recursiveLPS(
original.substring(0, original.length() - 1),
reverse
);
if (bestSubResult1.length() > bestSubResult2.length()) {
bestResult = bestSubResult1;
} else {