bfs && dfs

Basic_Of_Algorithm/src/Today_22_06_28/bfs.java

@@ -0,0 +1,51 @@
+package Today_22_06_28;
+
+import java.util.Queue;
+import java.util.LinkedList;
+
+public class bfs {
+
+	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 [][] temp = new int[maps.length][maps[0].length];
+
+		int answer;
+
+		temp[0][0] = 1;
+
+		Queue<int[]> bfs = new LinkedList<>();
+
+		bfs.add(new int[] {0,0});
+
+		int [][]move = {{1,0},{0,1},{-1,0},{0,-1}};
+
+		while(!bfs.isEmpty()) {
+
+			int[]cur = bfs.poll();
+
+			int i = cur[0];
+			int j = cur[1];
+
+			for(int d=0;d<4;d++) {
+				int newI = i + move[d][0];
+				int newJ = j + move[d][1];
+
+				if(newI<0||newJ<0||maps.length-1<newI||maps[0].length-1<newJ) continue;
+
+				if(maps[newI][newJ]==1 && temp[newI][newJ] ==0) {
+					temp[newI][newJ] = temp[i][j] + 1;
+					bfs.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_28/dfs.java

@@ -0,0 +1,68 @@
+package Today_22_06_28;
+
+public class dfs {
+
+	static int answer = 0;
+	static char [] member = {'A', 'C', 'F', 'J', 'M', 'N', 'R', 'T'};
+	static boolean[] visited = new boolean[member.length];
+	static String[]dataSample;
+
+	public static void main(String[] args) {
+
+		int n = 2;
+		String []data = {"N~F=0", "R~T>2"};
+
+		dataSample = data.clone();
+
+		dfs("");
+
+		System.out.println(answer);
+
+	}
+	static boolean check(String now) {
+
+		for(String d : dataSample) {
+
+			int pos1 = now.indexOf(d.charAt(0));
+			int pos2 = now.indexOf(d.charAt(2));
+			char op = d.charAt(3);
+			int idx = (d.charAt(4) - '0') +  1;
+
+			if(op=='=') {
+				if(!(Math.abs(pos1-pos2)==idx)) return false;
+			}else 	if(op=='>') {
+				if(!(Math.abs(pos1-pos2)>idx)) return false;
+			}else 	if(op=='<') {
+				if(!(Math.abs(pos1-pos2)<idx)) return false;
+			}
+
+
+		}
+
+
+
+		return true;
+
+
+	}
+
+	static void dfs(String now) {
+
+		if(now.length()==member.length) {
+			if(check(now)) answer++;
+		}
+
+		for(int i=0;i<visited.length;i++) {
+			if(!visited[i]) {
+				visited[i] = true;
+				String newOne = now + member[i];
+				dfs(newOne);
+				visited[i] = false;
+			}
+		}
+
+
+	}
+
+
+}