每周LeetCode算法题（十二）: 647. Palindromic Substrings

最新推荐文章于 2022-09-24 11:45:08 发布

JacKnights

最新推荐文章于 2022-09-24 11:45:08 发布

阅读量275

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/JacKnights/article/details/78637754

版权

leetcode 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

每周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”

解法分析

本题leetcode上归为动态规划一类，但一口气做完并不觉得相关。只是求回文子串数量，分两种情况：子串长度是奇数以及子串长度是偶数即可。

C++代码

class Solution {
public:
    int countSubstrings(string s) {
        int len = s.size();
        int ans = 0;
        for (int i = 0; i < len; i++) {
            int j = 0;
            while (i - j >= 0 && i + j < len) {
                if (s[i - j] == s[i + j]) {
                    ans++;
                    j++;
                } else {
                    break;
                }
            }
        }
        for (int i = 0; i < len - 1; i++) {
            int j = 0;
            if (s[i] != s[i + 1]) {
                continue;
            }
            while (i - j >= 0 && i + 1 + j < len) {
                if (s[i - j] == s[i + 1 + j]) {
                    ans++;
                    j++;
                } else {
                    break;
                }
            }
        }
        return ans;
    }
};