Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
19 lines (14 loc) · 587 Bytes

File metadata and controls

19 lines (14 loc) · 587 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
/* You are given a string array words and a string s, where words[i] and s comprise only of lowercase English letters.
Return the number of strings in words that are a prefix of s.
A prefix of a string is a substring that occurs at the beginning of the string. A substring is a contiguous sequence of characters within a string. */
class Solution {
public int countPrefixes(String[] words, String s) {
int count = 0;
for (String word : words) {
if (s.startsWith(word)) {
count++;
}
}
return count;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.