-
Notifications
You must be signed in to change notification settings - Fork 81
/
StringDeletion.java
52 lines (45 loc) · 1.53 KB
/
StringDeletion.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
/*
* Title: String deletion
*
* Given a string and a dictionary HashSet, write a function to determine the
* minimum number of characters to delete to make a word.
*
* Execution: javac StringDeletion.java && java StringDeletion
*
* For more details, check out http://www.byte-by-byte.com/stringdeletion
*/
import java.util.*;
public class StringDeletion {
public static int delete(String query, HashSet<String> dictionary) {
Queue<String> queue = new LinkedList<String>();
Set<String> queueElements = new HashSet<String>();
queue.add(query);
queueElements.add(query);
while (!queue.isEmpty()) {
String s = queue.remove();
queueElements.remove(s);
if (dictionary.contains(s)) {
return query.length() - s.length();
}
for (int i = 0; i < s.length(); i++) {
String sub = s.substring(0, i) + s.substring(i+1, s.length());
if (sub.length() > 0 && !queueElements.contains(sub)) {
queue.add(sub);
queueElements.add(sub);
}
}
}
return -1;
}
// Sample test cases
public static void main(String[] args) {
String query = "abc";
HashSet<String> hset = new HashSet<String>();
hset.add("a");
hset.add("aa");
hset.add("aaa");
assert delete(query, hset) == 2:
"Successfully determines 2 strings.";
System.out.println("Passed all test cases");
}
}