Leetcode # 1704. Determine if String Halves Are Alike

https://leetcode.com/problems/determine-if-string-halves-are-alike/

Solution

注意:
s[:len(s) // 2]
 s[:len(s) / 2] ( len(s) / 2 不是整數,不能作為 index )

Time Complexity: O(len(s))
Space Complexity: O(1)
(The input and output generally do not count towards the space complexity.)

class Solution:
  def halvesAreAlike(self, s: str) -> bool:
    vowels = {"A", "E", "I", "O", "U", "a", "e", "i", "o", "u"}
    difference = 0
    for c in s[:len(s) // 2]:
      difference += 1 if c in vowels else 0
    for c in s[len(s) // 2:]:
      difference -= 1 if c in vowels else 0
    return True if difference == 0 else False

 

Last Updated on 2023/08/16 by A1go

目錄

目錄
Bitnami