BFS, 문자열

Basic_Of_Algorithm/src/Today_22_06_08/gameMapQueue.java

@@ -0,0 +1,52 @@
+package Today_22_06_08;
+
+import java.util.Queue;
+import java.util.LinkedList;
+
+public class gameMapQueue {
+
+	public static void main(String[] args) {
+
+		int[][]maps = {{1,0,1,1,1},{1,0,1,0,1},{1,0,1,1,1},{1,1,1,0,1},{0,0,0,0,1}};
+
+		int[][]move = {{0,1},{1,0},{0,-1},{-1,0}};
+
+		int answer = 0;
+
+		int[][]temp = new int[maps.length][maps.length];
+
+		temp[0][0] = 1;
+
+		Queue<int []> q = new LinkedList<>();
+
+		q.add(new int[] {0,0});
+
+		while(!q.isEmpty()) {
+
+			int[]cur = q.poll();
+
+			int i = cur[0];
+			int j = cur[1];
+
+			for(int d=0;d<4;d++) {
+
+				int newI = move[d][0] + i;
+				int newJ = move[d][1] + j;
+
+				if(newI<0||newJ<0||maps.length-1<newI||maps[0].length-1<newJ) continue;
+
+				if(temp[newI][newJ]==0 && maps[newI][newJ]==1) {
+					temp[newI][newJ] = temp[i][j] +1;
+					q.add(new int[] {newI,newJ});
+
+				}
+
+			}
+		}
+
+		answer = temp[maps.length-1][maps[0].length-1];
+
+		System.out.println(answer);
+
+	}
+}

Basic_Of_Algorithm/src/Today_22_06_08/menuRenewal.java

@@ -0,0 +1,73 @@
+package Today_22_06_08;
+
+import java.util.HashMap;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Arrays;
+
+public class menuRenewal {
+
+	static HashMap<String,Integer> map = new HashMap<>();
+	static ArrayList<String> answerList = new ArrayList<>();
+	public static void main(String[] args) {
+
+		String []orders = {"ABCFG", "AC", "CDE", "ACDE", "BCFG", "ACDEH"};
+		int []course = {2,3,4};
+
+		for(int i=0;i<orders.length;i++) {
+
+			char[]temp = orders[i].toCharArray();
+			Arrays.sort(temp);
+			orders[i] = String.valueOf(temp);
+
+		}
+
+		for(int c : course) {
+			for(String order : orders) {
+
+				dfs(c,order,"");
+			}
+
+
+			if(!map.isEmpty()) {
+				ArrayList<Integer> maxList = new ArrayList<>(map.values());
+				int max = Collections.max(maxList);
+				if(max>1) {
+					for(String key : map.keySet()) {
+						if(map.get(key)==max) {
+							answerList.add(key);
+						}
+					}
+				}
+			}
+
+			map.clear();
+		}
+
+
+		String[]answer = new String[answerList.size()];
+
+		Collections.sort(answerList);
+
+		for(int i=0;i<answerList.size();i++) answer[i] = answerList.get(i);
+
+		for(String str : answer) System.out.print(str +", ");
+
+
+
+	}
+
+	static void dfs(int c,String order,String now) {
+
+		if(c==0) {
+			if(!map.containsKey(now)) {
+				map.put(now, 0);
+			}
+			map.put(now,map.get(now)+1);
+			return;
+		}
+
+		for(int i=0;i<order.length();i++) dfs(c-1,order.substring(i+1),now+order.charAt(i));
+
+	}
+}

Basic_Of_Algorithm/src/Today_22_06_08/stringApchuck.java

@@ -0,0 +1,56 @@
+package Today_22_06_08;
+
+public class stringApchuck {
+
+	public static void main(String[] args) {
+
+		String s = "xababcdcdababcdcd";
+
+		int answer = Integer.MAX_VALUE ;
+
+		for(int i=1;i<=s.length()/2;i++) {
+
+			String result = "";
+			String now = "";
+			String next = "";
+			int hit = 1;
+
+			for(int j=0;j<=s.length()/i;j++) {
+
+				int start = i * j;
+				int end = i * (j+1) < s.length() ? i * (j+1) : s.length();
+
+				next = s.substring(start,end);
+
+				if(now.equals(next)) {
+					hit++;
+				}else {
+					result += hitProess(hit) + now;
+					hit = 1;
+				}
+
+
+				now = next;
+
+			}
+
+			result += hitProess(hit) + now;
+
+			answer = Math.min(answer, result.length());
+
+			System.out.println(result+" -> " +result.length());
+
+
+		}
+
+		if(answer==Integer.MAX_VALUE) answer=1;
+
+		System.out.println(answer);
+
+
+
+	}
+	static String hitProess(int hit) {
+		return hit>1 ? String.valueOf(hit) : "";
+	}
+}