2025年1月4日
[LeetCode] 3325. Count Substrings With K-Frequency Characters I
摘要： Given a string s and an integer k, return the total number of substrings of s where at least one character appears at least k times. Example 1: Input: 阅读全文
posted @ 2025-01-04 06:20 CNoodle 阅读(39) 评论(0) 推荐(0)