[Leetcode] 2586. 统计范围内的元音字符串数

高冷的渣渣博

于 2024-12-02 16:01:19 发布

阅读量139

点赞数 2

文章标签： leetcode 算法职场和发展

本文链接：https://blog.youkuaiyun.com/zb199566/article/details/144190546

版权

2586. 统计范围内的元音字符串数

在这里插入图片描述这道题目就是遍历一下字符串数组中的每个元素，然后统计元素是不是"a",“e”,“i”,“o”,"u"开头和结尾
，如果是统计其个数，如果不是则跳过。

func vowelStrings(words []string, left int, right int) int {
	var sum int = 0
	for i := left; i <= right; i++ {
		if (strings.HasPrefix(words[i], "a") || strings.HasPrefix(words[i], "e") || strings.HasPrefix(words[i], "i") ||
			strings.HasPrefix(words[i], "o") || strings.HasPrefix(words[i], "u")) && (strings.HasSuffix(words[i], "a") || strings.HasSuffix(words[i], "e") ||
			strings.HasSuffix(words[i], "i") || strings.HasSuffix(words[i], "o") || strings.HasSuffix(words[i], "u")) {
			sum++
		}
	}
	return sum
}