Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
Tags
- 릿코드 풀기
- 알고리즘풀기
- LeetCode
- python xor
- 릿코드 파이썬
- python zip_longest
- python 릿코드
- 릿코드풀기
- python Leetcode
- 파이썬릿코드
- leetcode풀이
- 코틀린기초
- python sorted
- 파이썬 알고리즘
- 릿코드
- 상가수익률계산기
- 파이썬알고리즘
- 파이썬 알고리즘 풀기
- leetcode 풀기
- python 알고리즘
- 잇츠디모
- 알고리즘풀이
- binary search
- leetcode풀기
- 파이썬 프로그래머스
- 릿코드풀이
- python priority queue
- 파이썬릿코드풀기
- 파이썬알고리즘풀기
- 파이썬 릿코드
Archives
- Today
- Total
소프트웨어에 대한 모든 것
1704. Determine if String Halves Are Alike 본문
반응형
문제)
1704. Determine if String Halves Are Alike
You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half.
Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'). Notice that s contains uppercase and lowercase letters.
Return true if a and b are alike. Otherwise, return false.
Example 1:
Input: s = "book"
Output: true
Explanation: a = "bo" and b = "ok". a has 1 vowel and b has 1 vowel. Therefore, they are alike.
Example 2:
Input: s = "textbook"
Output: false
Explanation: a = "text" and b = "book". a has 1 vowel whereas b has 2. Therefore, they are not alike.
Notice that the vowel o is counted twice.
Constraints:
- 2 <= s.length <= 1000
- s.length is even.
- s consists of uppercase and lowercase letters.
솔루션1)
class Solution:
def halvesAreAlike(self, s: str) -> bool:
s = s.lower()
a = s[:len(s)//2]
b = s[len(s)//2:]
return self.get_vowel_count(a) == self.get_vowel_count(b)
def get_vowel_count(self, s):
vowels = ['a', 'e', 'i', 'o', 'u']
c = Counter(s)
count = 0
for v in vowels:
count += c.get(v, 0)
return count
솔루션2)
class Solution:
def halvesAreAlike(self, s: str) -> bool:
s = s.lower()
vowels = set('aeiou')
c1 = 0
c2 = 0
for i in range(len(s)//2):
if s[i] in vowels:
c1 += 1
if s[-i-1] in vowels:
c2 += 1
return c1 == c2
반응형
'알고리즘 > LeetCode' 카테고리의 다른 글
2225. Find Players With Zero or One Losses (0) | 2022.12.15 |
---|---|
451. Sort Characters By Frequency (0) | 2022.12.14 |
931. Minimum Falling Path Sum (0) | 2022.12.13 |
2432. The Employee That Worked on the Longest Task (0) | 2022.12.09 |
1026. Maximum Difference Between Node and Ancestor (0) | 2022.12.09 |
Comments