Class Solution
-
- All Implemented Interfaces:
public final class Solution2828 - Check if a String Is an Acronym of Words\.
Easy
Given an array of strings
wordsand a strings, determine ifsis an acronym of words.The string
sis considered an acronym ofwordsif it can be formed by concatenating the first character of each string inwordsin order. For example,"ab"can be formed from["apple", "banana"], but it can't be formed from["bear", "aardvark"].Return
trueifsis an acronym ofwords, andfalseotherwise.Example 1:
Input: words = "alice","bob","charlie", s = "abc"
Output: true
Explanation: The first character in the words "alice", "bob", and "charlie" are 'a', 'b', and 'c', respectively. Hence, s = "abc" is the acronym.
Example 2:
Input: words = "an","apple", s = "a"
Output: false
Explanation: The first character in the words "an" and "apple" are 'a' and 'a', respectively. The acronym formed by concatenating these characters is "aa". Hence, s = "a" is not the acronym.
Example 3:
Input: words = "never","gonna","give","up","on","you", s = "ngguoy"
Output: true
Explanation: By concatenating the first character of the words in the array, we get the string "ngguoy". Hence, s = "ngguoy" is the acronym.
Constraints:
1 <= words.length <= 1001 <= words[i].length <= 101 <= s.length <= 100words[i]andsconsist of lowercase English letters.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-