zoukankan      html  css  js  c++  java
  • Leetcode 647. Palindromic Substrings

    Given a string, your task is to count how many palindromic substrings in this string.

    The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.

    Example 1:

    Input: "abc"
    Output: 3
    Explanation: Three palindromic strings: "a", "b", "c".

    Example 2:

    Input: "aaa"
    Output: 6
    Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".

    Note:

    1. The input string length won't exceed 1000.

    Similar Questions: Longest Palindromic Substring Longest Palindromic Subsequence Palindromic Substrings 

    Next challenges: Longest Palindromic Subsequence

    方法一:O(n^2)的时间复杂度。

    思路:回文字符串有奇数个字符时,当前i位置字母作为回文字符串的中心;有偶数个字符的时候当前i和i+1位置字母作为回文字符串的中心。

    代码:

     1 public class Solution {
     2     public int countSubstrings(String s) {
     3         if(s == null) return 0;
     4         int count = 0;
     5         for(int i = 0; i < s.length(); i++) {
     6             count += countPalindromicSubstrings(s, i, i);
     7             count += countPalindromicSubstrings(s, i, i + 1);
     8         }
     9         return count;
    10     }
    11     
    12     public int countPalindromicSubstrings(String s, int begin, int end) {
    13         int count = 0;
    14         while(begin >= 0 && end < s.length() && s.charAt(begin) == s.charAt(end)) {
    15             count++;
    16             begin--;
    17             end++;
    18         }
    19         return count;
    20     }
    21 }

    方法二:O(n)的时间复杂度。

    思路:先对字符串进行改造(例如原字符串是"bab",改造后是"#b#a#b#"),接着对改造后的字符串运行Manacher's Algorithm(“马拉车”算法),得到以s[i]为中心的回文串的半径RL[i](不包括中心。例如"a"的半径就是0;"bab"以"a"为中心,半径就是1),显然,以s[i]为中心,RL[i]为半径的回文串中含有的字回文串数目是(RL[i] + 1) / 2个。最后只要将每个(RL[i] + 1) / 2加和就是结果。

    关于Manacher's Algorithm的学习资料:

    https://segmentfault.com/a/1190000003914228

    http://www.cnblogs.com/grandyang/p/4475985.html

    代码:

     1 public class Solution {
     2     public int countSubstrings(String s) {
     3         String rs = "#";
     4         //改造
     5         for(int i = 0; i < s.length(); i++) rs = rs + s.charAt(i) + "#";
     6         int[] RL = new int[rs.length()];//半径
     7         int pos = 0, maxRight = 0, count = 0;
     8         for(int i = 0; i < rs.length(); i++) {
     9             if(i < maxRight) {
    10                 RL[i] = Math.min(maxRight - i, RL[2 * pos - i]);
    11             }
    12             while(i - RL[i] - 1 >= 0 && i + RL[i] + 1< rs.length() && rs.charAt(i - RL[i] - 1) == rs.charAt(i + RL[i] + 1)) {
    13                 RL[i]++;
    14             }
    15             if(i + RL[i] > maxRight) {
    16                 pos = i;
    17                 maxRight = i + RL[i];
    18             }
    19             count += (RL[i] + 1) / 2;
    20         }
    21         return count;
    22     }
    23 }
  • 相关阅读:
    选择
    git使用笔记
    “子查询返回的值不止一个。当子查询跟随在 =、!=、<、<=、>、>= 之后,或子查询用作表达式时,这种情况是不允许的。”SQL查询错误解析
    sql学习笔记
    python爬虫
    线性代数知识点
    centos7 安装git
    感知机——学习笔记
    Logistic Regression学习笔记
    朴素贝叶斯分类--笔记
  • 原文地址:https://www.cnblogs.com/Deribs4/p/7228768.html
Copyright © 2011-2022 走看看