字符串----hiho字符串(尺取法)

 1 import java.util.Scanner;
 2 
 3 public class HihoStr {
 4     public static void main(String[] args) {
 5         Scanner scanner = new Scanner(System.in);
 6         String str = scanner.nextLine();
 7         char[]w = str.toCharArray();
 8         sovel(w);
 9     }
10 
11     private static void sovel(char[] w) {
12         int min = Integer.MAX_VALUE;
13         int j = -1;
14         for (int i = 0; i < w.length; i++) {
15             char c = w[i];
16             if(check(c)){ //i停下
17                 if (j==-1) {  // j的第一次定位
18                     j = i+1;
19                 }
20                 while(j<w.length){
21                     char c2 = w[j];
22                     if (check(c2)&&containsAll(w,i,j)) {  // 全部囊括
23                         if (check(w,i,j)&&j-i+1<min) { // 更新min
24                             min = j-i+1;
25                         }
26                         break;  // j停下
27                     }
28                     j++;
29                 }
30             }
31         }
32         System.out.println(min==Integer.MAX_VALUE?-1:min);
33     }
34 
35     private static boolean containsAll(char[] w, int i, int j) {
36         int c1=0,c2=0,c3=0;
37         for (int k = i; k <= j; k++) {
38             if(w[k]==‘h‘) c1++;
39             if(w[k]==‘i‘) c2++;
40             if(w[k]==‘o‘) c3++;
41         }
42         return c1>=2&&c2>=1&&c3>=1;
43     }
44 
45     /**
46      * 检查字符序列是否恰好包含2个h，一个i，一个o
47      * @param w
48      * @param i
49      * @param j
50      * @return
51      */
52     private static boolean check(char[] w, int i, int j) {
53         int c1=0,c2=0,c3=0;
54         for (int k = i; k <= j; k++) {
55             if(w[k]==‘h‘) c1++;
56             if(w[k]==‘i‘) c2++;
57             if(w[k]==‘o‘) c3++;
58         }
59         return c1==2&&c2==1&&c3==1;
60     }
61 
62     private static boolean check(char c) {
63         return c==‘h‘||c==‘i‘||c==‘o‘;
64     }
65     
66 }