Re: [閒聊] 每日leetcode

[dont (dont)]

2559. Count Vowel Strings in Ranges

## 思路

prefix sum

寫了一年的Python
今年來寫C++

## Code

```cpp
class Solution {
public:
    vector<int> vowelStrings(vector<string>& words, vector<vector<int>>&
queries) {
        unordered_set<char> vowels = {'a', 'e', 'i', 'o', 'u'};

        vector<int> prefix = {0};
        int count = 0;
        for (string& word: words) {
            if (vowels.count(word.front()) &&
                vowels.count(word.back()))
                count++;
            prefix.push_back(count);
        }

        vector<int> res;
        for (auto& q: queries) {
            res.push_back(prefix[q[1]+1] - prefix[q[0]]);
        }
        return res;
    }
};
```

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 94.156.205.61 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1735826386.A.21A.html
推 sustainer123: 大師 進大廠內推我
推 Meaverzt: 大師