Repository navigation
Expand file tree
/
Copy pathProblem1160.java
More file actions
71 lines (65 loc) · 2.35 KB
/
Copy pathProblem1160.java
File metadata and controls
71 lines (65 loc) · 2.35 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
66
67
68
69
70
71
/*
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 Problem1160 {
public static void main(String[] args) {
String[] words = { "cat", "bt", "hat", "tree" };
String chars = "atach";
System.out.println(countCharacters(words, chars));
}
/**
* Counts the total number of characters in the given array of words that can be
* formed using the characters in the given string.
*
* @param words the array of words to count characters from
* @param chars the string containing the characters to form the words
* @return the total number of characters that can be formed
*/
public static int countCharacters(String[] words, final String chars) {
int count = 0;
int[] charsArray = new int[26];
for (int i = 0; i < chars.length(); i++) {
charsArray[chars.charAt(i) - 'a']++;
}
for (int i = 0; i < words.length; i++) {
String word = words[i];
if (canBeFormed(word, charsArray)) {
count += words[i].length();
}
}
return count;
}
/**
* Determines whether a given word can be formed using a given array of
* characters.
*
* @param word the word to be formed
* @param charsArray the array of characters
* @return true if the word can be formed using the characters in the array,
* false otherwise
*/
public static boolean canBeFormed(String word, final int[] charsArray) {
int[] wordsCharsArray = new int[26];
for (int i = 0; i < word.length(); i++) {
wordsCharsArray[word.charAt(i) - 'a']++;
if (wordsCharsArray[word.charAt(i) - 'a'] > charsArray[word.charAt(i) - 'a']) {
return false;
}
}
return true;
}
}