modify code

Author: algorithmzuo

src/class044/Code03_TrieTree.java

@@ -25,6 +25,10 @@ public class Code03_TrieTree {
 
 	public static int cnt;
 
+	public static void build() {
+		cnt = 1;
+	}
+
 	public static void insert(String word) {
 		int cur = 1;
 		pass[cur]++;
@@ -78,6 +82,14 @@ public static int prefixNumber(String pre) {
 		return pass[cur];
 	}
 
+	public static void clear() {
+		for (int i = 1; i <= cnt; i++) {
+			Arrays.fill(tree[i], 0);
+			end[i] = 0;
+			pass[i] = 0;
+		}
+	}
+
 	public static int m, op;
 
 	public static String[] splits;
@@ -87,7 +99,7 @@ public static void main(String[] args) throws IOException {
 		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
 		String line = null;
 		while ((line = in.readLine()) != null) {
-			cnt = 1;
+			build();
 			m = Integer.valueOf(line);
 			for (int i = 1; i <= m; i++) {
 				splits = in.readLine().split(" ");
@@ -102,11 +114,7 @@ public static void main(String[] args) throws IOException {
 					out.println(prefixNumber(splits[1]));
 				}
 			}
-			for (int i = 1; i <= cnt; i++) {
-				Arrays.fill(tree[i], 0);
-				end[i] = 0;
-				pass[i] = 0;
-			}
+			clear();
 		}
 		out.flush();
 		in.close();

src/class045/Code01_CountConsistentKeys.java

@@ -20,6 +20,10 @@ public class Code01_CountConsistentKeys {
 
 	public static int cnt;
 
+	public static void build() {
+		cnt = 1;
+	}
+
 	public static int path(char cha) {
 		if (cha == '#') {
 			return 10;
@@ -55,8 +59,15 @@ public static int count(String pre) {
 		return pass[cur];
 	}
 
+	public static void clear() {
+		for (int i = 1; i <= cnt; i++) {
+			Arrays.fill(tree[i], 0);
+			pass[i] = 0;
+		}
+	}
+
 	public static int[] countConsistentKeys(int[][] b, int[][] a) {
-		cnt = 1;
+		build();
 		StringBuilder builder = new StringBuilder();
 		for (int[] nums : a) {
 			builder.setLength(0);
@@ -74,10 +85,7 @@ public static int[] countConsistentKeys(int[][] b, int[][] a) {
 			}
 			ans[i] = count(builder.toString());
 		}
-		for (int i = 1; i <= cnt; i++) {
-			Arrays.fill(tree[i], 0);
-			pass[i] = 0;
-		}
+		clear();
 		return ans;
 	}