Re: [閒聊] 每日leetcode

作者: Meaverzt (Meaverzt)   2025-01-02 19:57:50
題目:
有一個叫words的array每一項都是一個字串
每個query會有l r兩個數字
要算words[l]到words[r]有幾個字串頭尾都是母音
答案要全部存進一個array
思路:
遍歷words每一項判斷頭尾是不是母音
如果是就設成1不是就設成0
判斷完對words做前綴和
每次query就只要words[r]-word[l-1]
python code:
Class Solution(object):
def vowelstrings(self,words,queries):
vowel={'a','e','i','o','u'}
words=[int(word[0] in vowel and word[-1] in vowel) for w in words]
ans=[]
for i in range(1,len(words)):
words[i]+=words[i-1]
return [words[r] if l==0 else words[r]-words[l-1] for l,r in queries]
剩肥肥只會用python了
作者: DJYOMIYAHINA (通通打死)   2025-01-02 19:58:00
別卷了

Links booklink

Contact Us: admin [ a t ] ucptt.com