-
Notifications
You must be signed in to change notification settings - Fork 0
/
prefixString.java
63 lines (46 loc) · 1.67 KB
/
prefixString.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/**
Given a string s and an array of strings words, determine whether s is a prefix string of words.
A string s is a prefix string of words if s can be made by concatenating the first k strings in
words for some positive k no larger than words.length.
Return true if s is a prefix string of words, or false otherwise.
Example 1:
Input: s = "iloveleetcode", words = ["i","love","leetcode","apples"]
Output: true
Explanation:
s can be made by concatenating "i", "love", and "leetcode" together.
Example 2:
Input: s = "iloveleetcode", words = ["apples","i","love","leetcode"]
Output: false
Explanation:
It is impossible to make s using a prefix of arr.
Constraints:
1 <= words.length <= 100
1 <= words[i].length <= 20
1 <= s.length <= 1000
words[i] and s consist of only lowercase English letters.
*/
/***************************************************************
1961. Check If String Is a Prefix of Array
***************************************************************/
public class prefixString {
public static void main(String[] args) {
// Sample Input
String s = "iloveleetcode";
String[] words = {"i","love","leetcode","apples"};
int arrLength = words.length;
int strLength = s.length();
String checkString = "";
boolean result = false;
for(int i=0; i<arrLength; i++) {
checkString += words[i];
if(s.equals(checkString)) {
result = true;
break;
}
if(checkString.length() > strLength && !result) {
break;
}
}
System.out.println("result = " + result); // return result
}
}