목록비트 연산 (2)
넘치게 채우기
https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/description/?envType=daily-question&envId=2024-09-15leetcode - Fine the Longest Substring Containing Vowels in Even Counts문제 유형 : 비트마스크, 비트 연산, 슬라이딩 윈도우문제 난이도 : Medium 문제Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', a..
https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/description/?envType=daily-question&envId=2024-09-14leetcode - Longest Subarray With Maximum Bitwise AND문제 유형 : 비트 연산, 비트마스킹, 슬라이딩 윈도우문제 난이도 : Medium 문제You are given an integer array nums of size n.Consider a non-empty subarray from nums that has the maximum possible bitwise AND.In other words, let k be the maximum value of ..