오랜만에 코테 폭발 ㅋㅋㅋㅋ

Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java → Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo01.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Arrays;
 import java.util.Scanner;

Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java → Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo2.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Scanner;
 import java.util.Arrays;

Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java → Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo3.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Scanner;
 import java.util.Arrays;

Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java → Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo4.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Arrays;
 import java.util.Scanner;

Basic_Of_Algorithm/src/Today22_05_27/bracket.java → Basic_Of_Algorithm/src/Today_22_05_27/bracket.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Stack;
 

Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java → Basic_Of_Algorithm/src/Today_22_05_27/catchAndHide.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.*;
 

Basic_Of_Algorithm/src/Today22_05_27/disk.java → Basic_Of_Algorithm/src/Today_22_05_27/disk.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Arrays;
 import java.util.Comparator;

Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java → Basic_Of_Algorithm/src/Today_22_05_27/programmers_lv_2_no1.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 public class programmers_lv_2_no1 {
 

Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java → Basic_Of_Algorithm/src/Today_22_05_27/programmers_lv_2_no2.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Queue;
 import java.util.LinkedList;

Basic_Of_Algorithm/src/Today22_05_27/quate.java → Basic_Of_Algorithm/src/Today_22_05_27/quate.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 public class quate {
 

Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java → Basic_Of_Algorithm/src/Today_22_05_27/rightBigNumber.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.*;
 

Basic_Of_Algorithm/src/Today22_05_27/test.java → Basic_Of_Algorithm/src/Today_22_05_27/test.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 import java.util.Queue;
 import java.util.LinkedList;

Basic_Of_Algorithm/src/Today22_05_27/test2.java → Basic_Of_Algorithm/src/Today_22_05_27/test2.java

@@ -1,4 +1,4 @@
-package Today22_05_27;
+package Today_22_05_27;
 
 public interface test2 {
 

Basic_Of_Algorithm/src/Today_22_05_31/HowToLine.java

@@ -0,0 +1,58 @@
+package Today_22_05_31;
+
+public class HowToLine {
+
+	static int check;
+	static String answer = "";
+	public static void main(String[] args) {
+
+
+		int n = 3;
+		int k = 5;
+
+		check = k;
+
+		int[]arr = new int[n];
+
+		int num = 1;
+
+		for(int i=0;i<n;i++)arr[i] = num++;
+
+		boolean[]visited = new boolean[n];
+
+		dfs(arr,visited,0,"");
+
+		int[]result = new int[n];
+
+		for(int i=0;i<result.length;i++) {
+			result[i] = Integer.parseInt(""+answer.charAt(i));
+		}
+
+
+		for(int i : result)System.out.print(i+",");
+	}
+
+	static void dfs(int[]arr,boolean[]visited,int count,String now) {
+
+		if(count==arr.length) {
+
+			check--;
+
+			if(check==0) {
+				answer = now;
+				return;
+			}
+
+		}
+
+
+		for(int i=0;i<arr.length;i++) {
+			if(!visited[i]) {
+				visited[i] = true;
+				String next = now + arr[i];
+				dfs(arr,visited,count+1,next);
+				visited[i] = false;
+			}
+		}
+	}
+}

Basic_Of_Algorithm/src/Today_22_05_31/Yangong.java

@@ -0,0 +1,87 @@
+package Today_22_05_31;
+
+import java.util.ArrayList;
+import java.util.Collections;
+
+public class Yangong {
+
+	static int[]ryan;
+	static int[]apeach;
+	static int arrow;
+	static ArrayList<int[]> answerList = new ArrayList<>();
+	static int maxValue = Integer.MIN_VALUE;
+
+	public static void main(String[] args) {
+
+
+	int n = 10;
+	int[]info = {0,0,0,0,0,0,0,0,3,4,3};
+
+	apeach = info.clone();
+	ryan = new int[apeach.length];
+
+
+	arrow = n;
+
+	dfs(0,0);
+
+
+	if(answerList.isEmpty()) answerList.add(new int[] {-1});
+	else {
+
+		Collections.sort(answerList,(o1,o2)-> {
+
+			for(int i=o1.length-1;i>-1;i--) {
+				if(o1[i]!=o2[i]) return o2[i] - o1[i];
+			}
+
+			return 0;
+
+		});
+
+
+	}
+
+	for(int i : answerList.get(0)) System.out.print(i+",");
+
+	}
+
+	static void dfs(int start,int goal) {
+
+		if(goal==arrow) {
+			int r = 0;
+			int a = 0;
+
+			for(int i=0;i<apeach.length;i++) {
+
+				if(apeach[i]==0 && ryan[i]==0)continue;
+
+				if(apeach[i]>=ryan[i]) a += 10 - i;
+				else r += 10-i;
+
+			}
+
+			if(r>a) {
+				int diff = r-a;
+				if(maxValue<diff) {
+					maxValue = diff;
+					answerList.clear();
+					answerList.add(ryan.clone());
+				}else if(maxValue==diff) {
+					answerList.add(ryan.clone());
+				}
+			}
+
+		}else {
+
+			for(int i=0;i<apeach.length;i++) {
+				ryan[i]++;
+				dfs(i,goal+1);
+				ryan[i]--;
+			}
+
+		}
+
+
+	}
+}

Basic_Of_Algorithm/src/Today_22_05_31/apchuck.java

@@ -0,0 +1,56 @@
+package Today_22_05_31;
+
+import java.util.ArrayList;
+
+public class apchuck {
+
+	public static void main(String[] args) {
+
+
+		String msg = "KAKAO";
+
+		String alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+
+		ArrayList<String> dic = new ArrayList<>();
+		ArrayList<Integer>ans = new ArrayList<>();
+
+		dic.add("^&#(");
+
+		for(int i=0;i<alpha.length();i++) dic.add(""+alpha.charAt(i));
+
+		int idx = 0;
+
+		String now = "";
+		String next = "";
+
+		while(idx<msg.length()) {
+
+			next = ""+msg.charAt(idx);
+
+			String newOne = now + next;
+
+			if(dic.contains(newOne)) {
+				now = newOne;
+				idx++;
+
+
+			}else {
+
+				dic.add(newOne);
+				ans.add(dic.indexOf(now));
+				idx++;
+				now = next;
+			}
+
+
+
+
+		}
+
+		ans.add(dic.indexOf(now));
+
+		System.out.println(ans);
+
+	}
+
+}

Basic_Of_Algorithm/src/Today_22_05_31/changeBracket.java

@@ -0,0 +1,88 @@
+package Today_22_05_31;
+
+import java.util.Stack;
+
+public class changeBracket {
+
+	public static void main(String[] args) {
+
+
+		String p = "()))((()";
+
+		String result = change(p);
+
+		System.out.println(result);
+
+
+
+	}
+	static String change(String w) {
+
+		if(w.isEmpty()) return "";
+
+		String u = "";
+		String v = "";
+
+		int i;
+		int left =0;
+		int right = 0;
+
+		for(i=0;i<w.length();i++) {
+
+			char ch = w.charAt(i);
+
+			if(ch==')') right++;
+			else left++;
+
+			if(right==left) break;
+
+		}
+
+		u = w.substring(0,i+1);
+		v = w.substring(i+1,w.length());
+
+		String result = "";
+
+		if(right(u)) {
+
+			result = u + change(v);
+		}else {
+
+			result = "(" + change(v) + ")";
+			u = u.substring(1,u.length()-1);
+			u = u.replaceAll("\\(", "\\.");
+			u = u.replaceAll("\\)", "\\(");
+			u = u.replaceAll("\\.", "\\)");
+			result += u;
+
+
+		}
+
+		return result;
+
+
+
+	}
+
+	static boolean right(String u) {
+
+		Stack<Character>st = new Stack<>();
+
+		for(int i=0;i<u.length();i++) {
+			char ch = u.charAt(i);
+			if(st.isEmpty()) st.add(ch);
+			else {
+
+				if(st.peek()=='(') {
+					if(ch==')') st.pop();
+					else st.add(ch);
+
+				}
+			}
+
+		}
+
+		if(st.isEmpty())return true;
+		else return false;
+	}
+}