zoukankan      html  css  js  c++  java
  • 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.
    求回文子串的数量,每一个子串拥有不同的star index 和不同的end index
    1. class Solution(object):
    2. def countSubstrings(self, s):
    3. """
    4. :type s: str
    5. :rtype: int
    6. """
    7. num = 0
    8. for i in range(0, len(s) + 1):
    9. for j in range(i + 1, len(s) + 1):
    10. sub = s[i:j]
    11. if(sub == sub[::-1]):
    12. num = num + 1
    13. return num






  • 相关阅读:
    CI控制器
    php+mysql新无线级分类
    php函数引用
    java数据类型
    进制装换
    java环境
    node.js
    移动端或者网页端下拉加载
    yii DAO操作总结
    yii中find()指定条件
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/7354950.html
Copyright © 2011-2022 走看看