-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram48.java
More file actions
65 lines (39 loc) · 1.51 KB
/
program48.java
File metadata and controls
65 lines (39 loc) · 1.51 KB
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
64
65
/*
1160. Find Words That Can Be Formed by Characters
Easy
1.3K
144
Companies
You are given an array of strings words and a string chars.
A string is good if it can be formed by characters from chars (each character can only be used once).
Return the sum of lengths of all good strings in words.
Example 1:
Input: words = ["cat","bt","hat","tree"], chars = "atach"
Output: 6
Explanation: The strings that can be formed are "cat" and "hat" so the answer is 3 + 3 = 6.
Example 2:
Input: words = ["hello","world","leetcode"], chars = "welldonehoneyr"
Output: 10
Explanation: The strings that can be formed are "hello" and "world" so the answer is 5 + 5 = 10.
*/
package LeetCode;
public class program48 {
static int countCharacters(String[] words, String chars) {
int sum=0;
char ch[] = chars.toCharArray();
for(int i=0;i<words.length;i++){
String str= words[i];
for(int j=0;j<str.length();j++){
for(int k=0;k<ch.length;k++){
if(str.charAt(j)==ch[i]);
}
}
}
return sum;
}
public static void main(String[] args) {
String[] words = {"cat","bt","hat","tree"};
String chars = "atach";
System.out.println(countCharacters(words, chars));
}
}