您会得到两个字符串,一个序列和一个键。编写一个函数,该函数确定键的字符是否按顺序(尽管不一定连续)出现。
def sequence_search(word, key)
arr = []
i = 0
while i < word.length
word[i].include?(key)
arr >> word[i]
end
i+= 1
end
if arr.join == key
return true
else false
end
end
puts sequence_search("arcata", "cat") #=> true
puts sequence_search("c1a2t3", "cat") #=> true
puts sequence_search("cta", "cat") #=> false
puts sequence_search("coat", "cat")#=> true