목록2024/04/30 (1)

넘치게 채우기

[LeetCode] 1915. Number of Wonderful Substrings

https://leetcode.com/problems/number-of-wonderful-substrings/description/leetcode - Number of Wonderful Substrings문제 유형 : 비트마스킹, 비트 조작문제 난이도 : Medium  문제A wonderful string is a string where at most one letter appears an odd number of times.For example, "ccjjc" and "abab" are wonderful, but "ab" is not.Given a string word that consists of the first ten lowercase English letters ('a' through 'j'),..
PS/LeetCode 2024. 4. 30. 14:36
이전 Prev 1 Next 다음