GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/DynamicProgramming/LongestPalindromicSubstring.java at master · foresightyj/Java Expand file tree/ Copy pathLongestPalindromicSubstring.javaMore file actions 56 lines (47 loc) · 1.14 KB / Copy pathLongestPalindromicSubstring.javaFile metadata and controls56 lines (47 loc) · 1.14 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 package test; import java.io.*; import java.util.*; /* * 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); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |