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

Change project structure to a Maven Java project + Refactor (#2816)

Browse Source
This commit is contained in:
Aitor Fidalgo Sánchez
2021-11-12 07:59:36 +01:00
committed by GitHub
parent 8e533d2617
commit 9fb3364ccc
642 changed files with 26570 additions and 25488 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubstring.java Normal file
View File

@ -0,0 +1,54 @@
package com.thealgorithms.dynamicprogramming;
/*
* Algorithm explanation https://leetcode.com/problems/longest-palindromic-substring/
*/
public class LongestPalindromicSubstring {
public static void main(String[] args) {
String a = "babad";
String b = "cbbd";
String aLPS = LPS(a);
String bLPS = LPS(b);
System.out.println(a + " => " + aLPS);
System.out.println(b + " => " + bLPS);
}
private static String LPS(String input) {
if (input == null || input.length() == 0) {
return input;
}
boolean arr[][] = new boolean[input.length()][input.length()];
int start = 0, end = 0;
for (int g = 0; g < input.length(); g++) {
for (int i = 0, j = g; j < input.length(); i++, j++) {
if (g == 0) {
arr[i][j] = true;
} else if (g == 1) {
if (input.charAt(i) == input.charAt(j)) {
arr[i][j] = true;
} else {
arr[i][j] = false;
}
} else {
if (input.charAt(i) == input.charAt(j) && arr[i + 1][j - 1]) {
arr[i][j] = true;
} else {
arr[i][j] = false;
}
}
if (arr[i][j]) {
start = i;
end = j;
}
}
}
return input.substring(start, end + 1);
}
}