FilesExpand file tree

 master

/

Solution.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

47 lines (45 loc) · 1.58 KB

 master

/

Solution.java

Top

File metadata and controls

• Code
• Blame

47 lines (45 loc) · 1.58 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import java.io.*;

import java.util.*;

import java.text.*;

import java.math.*;

import java.util.regex.*;

public class Solution {

public static void main(String[] args) {

/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */

Scanner sc = new Scanner(System.in);

int N = sc.nextInt();

sc.nextLine();

String []strings = new String[N];

for (int i = 0; i < N; i++) {

strings[i] = sc.next();

}

int Q = sc.nextInt();

sc.nextLine();

String []queries = new String[Q];

for (int j = 0; j < Q; j++) {

queries[j] = sc.next();

}

sc.close();

//System.out.println("N=" + N + " " + "Q=" + Q);

//System.out.println("Strings=" + Arrays.toString(strings));

//System.out.println("Queries=" + Arrays.toString(queries));

int [][]results = new int[Q][1];

int count = 0;

//results[0][0] = 1;

for (int k = 0; k < N; k++) {

for (int l = 0; l < Q; l++) {

//System.out.println("Query=" + queries[l]);

Pattern pattern = Pattern.compile("\\b" + queries[l] + "\\b");

//System.out.println("Pattern=" + strings[k]);

Matcher matcher = pattern.matcher(strings[k]);

while (matcher.find()) {

count++;

results[l][0] = count;

}

}

}

for (int m = 0; m < Q; m++) {

System.out.println(results[m][0]);

}

}

}