-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExamDemo.java
More file actions
70 lines (51 loc) · 1.43 KB
/
ExamDemo.java
File metadata and controls
70 lines (51 loc) · 1.43 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
package examination;
import java.util.Scanner;
/**
* @author zhongshanhuang
* @company caih
* @email [email protected]
* @create 2019-11-13 9:13
*/
public class ExamDemo {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
int target = sc.nextInt();
Solution solution = new Solution();
System.out.println(solution.splitAndSearchString2(s, target));
}
}
class Solution{
public String splitAndSearchString(String s, int target){
int len = s.length();
if(len > 1000){
return "";
}
String[] words = s.split(";");
return words[target];
}
public String splitAndSearchString2(String s, int target){
int len = s.length();
if(len > 1000){
return "";
}
StringBuilder sb = new StringBuilder(s).append(";");
int[] pArr = new int[] {0, 0};
int count = -1;
for (int i = 0; i < sb.length(); i++) {
if(sb.charAt(i) == ';'){
count++;
pArr[count%2] = i;
}
if (count == target){
break;
}
}
int start = pArr[0] < pArr[1] ? pArr[0] : pArr[1];
int end = pArr[0] > pArr[1] ? pArr[0] : pArr[1];
if(start != 0){
start++;
}
return sb.substring(start, end).toString();
}
}