Skip to content

Commit 3a771f7

Browse files
solve #2942: Find Words Containing Character in java
1 parent a9b0a83 commit 3a771f7

File tree

2 files changed

+29
-1
lines changed

2 files changed

+29
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -870,7 +870,7 @@
870870
| 2928 | [Distribute Candies Among Children I](https://leetcode.com/problems/distribute-candies-among-children-i) | [![Java](assets/java.png)](src/DistributeCandiesAmongChildrenI.java) | |
871871
| 2932 | [Maximum Strong Pair XOR I](https://leetcode.com/problems/maximum-strong-pair-xor-i) | [![Java](assets/java.png)](src/MaximumStrongPairXORI.java) | |
872872
| 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal) | [![Java](assets/java.png)](src/MakeThreeStringsEqual.java) | |
873-
| 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character) | | |
873+
| 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character) | [![Java](assets/java.png)](src/FindWordsContainingCharacter.java) | |
874874
| 2946 | [Matrix Similarity After Cyclic Shifts](https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts) | | |
875875
| 2951 | [Find the Peaks](https://leetcode.com/problems/find-the-peaks) | | |
876876
| 2956 | [Find Common Elements Between Two Arrays](https://leetcode.com/problems/find-common-elements-between-two-arrays) | | |

src/FindWordsContainingCharacter.java

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
// https://leetcode.com/problems/find-words-containing-character
2+
// T: O(|words| * |words[i].length|)
3+
// S: O(1)
4+
5+
import java.util.ArrayList;
6+
import java.util.List;
7+
8+
public class FindWordsContainingCharacter {
9+
public List<Integer> findWordsContaining(String[] words, char x) {
10+
final List<Integer> result = new ArrayList<>();
11+
for (int i = 0 ; i < words.length ; i++) {
12+
if (containsCharacter(words[i], x)) {
13+
result.add(i);
14+
}
15+
}
16+
17+
return result;
18+
}
19+
20+
private static boolean containsCharacter(String s, char c) {
21+
for (int i = 0 ; i < s.length() ; i++) {
22+
if (s.charAt(i) == c) {
23+
return true;
24+
}
25+
}
26+
return false;
27+
}
28+
}

0 commit comments

Comments
 (0)