提交214 最短回文串

yllg · yllg · commit 942d2944d378 · 2019-11-24T20:53:25.000+08:00
diff --git a/214.最短回文串/solution.html b/214.最短回文串/solution.html
@@ -0,0 +1,67 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <meta http-equiv="X-UA-Compatible" content="ie=edge">
+    <title>Document</title>
+</head>
+<body>
+<script>
+// Source : https://leetcode.com/problems/shortest-palindrome/
+// Author : 悬笔e绝
+// Date   : 2019-11-24
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+
+function Manacher(s) {
+  var str = '*#'
+    , dp = []
+    , maxn = 0
+    , idx = 0;
+
+  for (var i = 0, len = s.length; i < len; i++)
+    str += s[i] + '#';
+
+  for (var i = 1, len = str.length; i < len; i++) {
+    if (maxn > i) dp[i] = Math.min(dp[2 * idx - i], maxn - i);
+    else dp[i] = 1;
+
+    while (str[i - dp[i]] === str[i + dp[i]]) dp[i]++;
+
+    if (dp[i] + i > maxn)
+      maxn = dp[i] + i, idx = i;
+  }
+
+  var ans = 0
+    , pos;
+
+  var pos;
+  for (var i = 1; i < len; i++) {
+    if (i === dp[i])
+      pos = i;
+  }
+
+  var tmp = str[pos] === '#' ? '' : str[pos];
+  for (var i = pos + 1; i < len; i++) {
+    var res = str[i] === '#' ? '' : str[i];
+    tmp = res + tmp + res;
+  }
+
+  return tmp;
+}
+
+var shortestPalindrome = function(s) {
+  var str = Manacher(s);
+  return str;
+};
+
+//测试
+var s = "aacecaaa";
+console.log('shortestPalindrome', shortestPalindrome(s));
+</script>
+</body>
+</html>
