Leetcode 3084. Count Substrings Starting and Ending with Given Character

  • [Leetcode 3084. Count Substrings Starting and Ending with Given Character](#Leetcode 3084. Count Substrings Starting and Ending with Given Character)
    • [1. 解题思路](#1. 解题思路)
    • [2. 代码实现](#2. 代码实现)

1. 解题思路

这一题其实挺简单的,只要看一下目标的character在string当中出现了几次即可,然后就是一个 C n 2 C_n^2 Cn2的头尾选择问题即可。

2. 代码实现

给出python代码实现如下:

python 复制代码
class Solution:
    def countSubstrings(self, s: str, c: str) -> int:
        cnt = Counter(s)[c]
        return cnt * (cnt+1) // 2

提交代码评测得到:耗时52ms,占用内存17.5MB。

相关推荐
Espresso Macchiato1 个月前
Leetcode 3255. Find the Power of K-Size Subarrays II
leetcode·leetcode medium·leetcode 3255·leetcode 3254·leetcode周赛137
Espresso Macchiato2 个月前
Leetcode 3240. Minimum Number of Flips to Make Binary Grid Palindromic II
leetcode·leetcode medium·回文·leetcode 3240·leetcode双周赛136
Espresso Macchiato2 个月前
Leetcode 3234. Count the Number of Substrings With Dominant Ones
排列组合·leetcode medium·容斥原理·leetcode 3234·leetcode周赛408
AI棒棒牛2 个月前
YOLOv10全网最新创新点改进系列:一文学会排列组合(“炼丹神器”)!手把手教学,保姆级教程!!!
sci·排列组合·创新·yolo模型创新·模型改进·炼丹·模块缝合
Espresso Macchiato3 个月前
Leetcode 3201. Find the Maximum Length of Valid Subsequence I
leetcode medium·leetcode题解·leetcode 3201·leetcode周赛404
Espresso Macchiato3 个月前
Leetcode 3196. Maximize Total Cost of Alternating Subarrays
leetcode·动态规划·leetcode medium·leetcode周赛403·leetcode 3196
Espresso Macchiato3 个月前
Leetcode 3195. Find the Minimum Area to Cover All Ones I
leetcode·leetcode medium·leetcode题解·leetcode 3195·leetcode周赛403
Espresso Macchiato3 个月前
Leetcode 3186. Maximum Total Damage With Spell Casting
动态规划·leetcode medium·leetcode题解·leetcode 3186·leetcode周赛402
Espresso Macchiato3 个月前
Leetcode 3175. Find The First Player to win K Games in a Row
leetcode medium·leetcode题解·leetcode 3175·leetcode双周赛132
Espresso Macchiato4 个月前
Leetcode 3143. Maximum Points Inside the Square
leetcode medium·leetcode题解·leetcode双周赛130·leetcode 3143