-
Notifications
You must be signed in to change notification settings - Fork 111
/
solution.java
81 lines (60 loc) · 2.15 KB
/
solution.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
// String algorithms--> Weighted Uniform Strings
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class solution {
static String[] weightedUniformStrings(String s, int[] queries) {
Set<Integer> set=new HashSet<>(); //set for frequency of each uniform substring of s
for(int i=0;i<s.length();){
char c=s.charAt(i);
int j=i;
int count=0;
while(j<s.length()&&s.charAt(j)==c){
count++;
j++;
}
int val=c-96; //weight of each character
int temp=val;
while(count-->0){
set.add(temp);
temp+=val;
}
i=j;
}
String res[]=new String[queries.length]; //result array
for(int j=0;j<res.length;j++){
if(set.contains(queries[j])) //check if the set contains the query value
res[j]="Yes";
else
res[j]="No";
}
return res;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String s = scanner.nextLine();
int queriesCount = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] queries = new int[queriesCount];
for (int i = 0; i < queriesCount; i++) {
int queriesItem = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
queries[i] = queriesItem;
}
String[] result = weightedUniformStrings(s, queries);
for (int i = 0; i < result.length; i++) {
bufferedWriter.write(result[i]);
if (i != result.length - 1) {
bufferedWriter.write("\n");
}
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}