From e28db6f1c19deab84544c727fa50c1606c0bbdf2 Mon Sep 17 00:00:00 2001
From: monsileI <hansaem900d@kakao.com>
Date: Fri, 20 May 2022 19:34:44 +0900
Subject: [PATCH] =?UTF-8?q?=EB=B0=B1=EC=A4=80=20=EA=B7=B8=EB=A6=AC?=
 =?UTF-8?q?=EB=94=94=20=EC=95=8C=EA=B3=A0=EB=A6=AC=EC=A6=98=20=EC=9C=84?=
 =?UTF-8?q?=EC=A3=BC=EB=A1=9C=20=EA=B3=B5=EB=B6=80!?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../src/Today_22_05_20/bfs.java               | 52 +++++++++++++++++++
 .../src/Today_22_05_20/dungeons.java          | 36 +++++++++++++
 .../Today_22_05_20/greddy_changeMoney.java    | 37 +++++++++++++
 .../src/Today_22_05_20/greedy_atm.java        | 33 ++++++++++++
 .../src/Today_22_05_20/greedy_bracket.java    | 39 ++++++++++++++
 .../src/Today_22_05_20/greedy_coin.java       | 43 +++++++++++++++
 .../src/Today_22_05_20/greedy_coin2.java      | 35 +++++++++++++
 .../src/Today_22_05_20/greedy_sugar.java      | 40 ++++++++++++++
 .../src/Today_22_05_20/greedy_wordsMath.java  | 42 +++++++++++++++
 .../src/Today_22_05_20/room.java              | 48 +++++++++++++++++
 .../src/Today_22_05_20/tuple.java             | 33 ++++++++++++
 11 files changed, 438 insertions(+)
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/bfs.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/dungeons.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greddy_changeMoney.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greedy_atm.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greedy_bracket.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin2.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greedy_sugar.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/greedy_wordsMath.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/room.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_20/tuple.java

diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/bfs.java b/Basic_Of_Algorithm/src/Today_22_05_20/bfs.java
new file mode 100644
index 0000000..2868715
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/bfs.java
@@ -0,0 +1,52 @@
+package Today_22_05_20;
+
+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 answer = 0;
+		
+		Queue<int[]> q = new LinkedList<>();
+		
+		int[][]temp = new int[maps.length][maps[0].length];
+		
+		temp[0][0] = 1;
+		
+		q.add(new int[] {0,0});
+		
+		int[][]move = {{0,1},{1,0},{0,-1},{-1,0}};
+		
+		while(!q.isEmpty()) {
+			
+			int [] cur = q.poll();
+			
+			int ni = cur[0];
+			int nj = cur[1];
+			
+			for(int d=0;d<4;d++) {
+				
+				int newI = ni + move[d][0];
+				int newJ = nj + 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[ni][nj]+1;
+					q.add(new int[] {newI,newJ});
+				}
+				
+			}
+			
+			
+		}
+		
+		answer = temp[maps.length-1][maps[0].length-1];
+		
+		System.out.println(answer);
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/dungeons.java b/Basic_Of_Algorithm/src/Today_22_05_20/dungeons.java
new file mode 100644
index 0000000..5f88439
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/dungeons.java
@@ -0,0 +1,36 @@
+package Today_22_05_20;
+
+public class dungeons {
+
+	static int answer = 0;
+	
+	public static void main(String[] args) {
+		
+	int k = 80;
+	int[][]dungeons = {{80,20},{50,40},{30,10}};
+	
+	boolean[]visited = new boolean[dungeons.length];
+	
+	dfs(dungeons,visited,k,0);
+	
+	System.out.println(answer);
+	}
+	static void dfs(int[][]dungeons,boolean[]visited,int k,int count) {
+		
+		for(int i=0;i<dungeons.length;i++) {
+			if(!visited[i]&&dungeons[i][0]<=k) {
+				visited[i] = true;
+				int newK = k - dungeons[i][1];
+				dfs(dungeons,visited,newK,count+1);
+				visited[i] = false;
+			}
+			
+		}
+		
+		
+		answer = Math.max(answer, count);
+		
+		
+	}
+	
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greddy_changeMoney.java b/Basic_Of_Algorithm/src/Today_22_05_20/greddy_changeMoney.java
new file mode 100644
index 0000000..4462f15
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greddy_changeMoney.java
@@ -0,0 +1,37 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+
+public class greddy_changeMoney {
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		int cash = scan.nextInt();
+		
+		//500 100 50 10 5 1
+		
+		int[]arr = {500,100,50,10,5,1};
+		
+		cash = 1000-cash;
+		
+		int answer = 0;
+		
+		for(int i=0;i<arr.length;i++) {
+			
+			if(cash>=arr[i]) {
+			
+				answer += cash/arr[i];
+				cash = cash%arr[i];
+			}
+			if(cash==0)break;
+		}
+		
+		
+		System.out.println(answer);
+		
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greedy_atm.java b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_atm.java
new file mode 100644
index 0000000..50be8e6
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_atm.java
@@ -0,0 +1,33 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+import java.util.Arrays;
+
+public class greedy_atm {
+	
+	public static void main(String[] args) {
+		
+	Scanner scan = new Scanner(System.in);
+	
+	int answer = 0;
+	
+	int n = scan.nextInt();
+	
+	int[]man = new int[n];
+	
+	for(int i=0;i<n;i++) man[i] = scan.nextInt();
+	
+	Arrays.sort(man);
+	int temp = 0;
+	for(int i=0;i<man.length;i++) {
+		temp += man[i];
+		answer += temp;
+	}
+	
+	System.out.println(answer);
+		
+		
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greedy_bracket.java b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_bracket.java
new file mode 100644
index 0000000..1584131
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_bracket.java
@@ -0,0 +1,39 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+
+public class greedy_bracket {
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		String temp = scan.next();
+		
+		String[]str = temp.split("\\-");
+		
+		int answer = 0;
+		
+		for(int i=0;i<str.length;i++) {
+			
+			String[]subStr = str[i].split("\\+");
+			
+			int calc = 0;
+			for(String item : subStr) {
+				calc += Integer.parseInt(item);
+			}
+			
+			if(i==0) {
+				answer += calc;
+				
+			}else {
+				answer -= calc;
+			}
+		}
+	
+		
+		System.out.println(answer);
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin.java b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin.java
new file mode 100644
index 0000000..78f5cc6
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin.java
@@ -0,0 +1,43 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+import java.util.Arrays;
+import java.util.Collections;
+public class greedy_coin {
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		
+		int n = scan.nextInt();
+		int k = scan.nextInt();
+		
+		int answer = 0;
+
+		Integer[]arr = new Integer[n];
+		
+		
+		for(int i=0;i<n;i++) arr[i] = scan.nextInt();
+		
+		Arrays.sort(arr, Collections.reverseOrder());
+		
+		for(int i=0;i<arr.length;i++) {
+			
+			int coin = arr[i];
+			
+			
+			while(k>=coin) {
+				System.out.println(coin);
+				answer++;
+				k -= coin;
+			}
+			
+			
+		}
+		
+		System.out.println(answer);
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin2.java b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin2.java
new file mode 100644
index 0000000..11d3b15
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_coin2.java
@@ -0,0 +1,35 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+import java.util.Arrays;
+import java.util.Collections;
+public class greedy_coin2 {
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		
+		int n = scan.nextInt();
+		int k = scan.nextInt();
+		
+		int answer = 0;
+
+		Integer[]arr = new Integer[n];
+		
+		
+		for(int i=0;i<n;i++) arr[i] = scan.nextInt();
+		
+		for(int i=arr.length-1;i>-1;i--) {
+			
+			if(arr[i]<=k) {
+				answer += k/arr[i];
+				k = k%arr[i];
+			}
+			
+		}
+		
+		System.out.println(answer);
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greedy_sugar.java b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_sugar.java
new file mode 100644
index 0000000..8afced0
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_sugar.java
@@ -0,0 +1,40 @@
+package Today_22_05_20;
+
+import java.io.InputStreamReader;
+import java.io.BufferedReader;
+public class greedy_sugar {
+	
+	public static void main(String[] args) throws Exception {
+	
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		
+		int n = Integer.parseInt(br.readLine());
+		
+		//3 //5
+		int answer = 0;
+		
+		//5의 배수도 3의 배수도 아닌 경우에도 나눠 떨어지는 애들이 있음!
+		
+		
+		while(true) {
+			
+			if(n%5==0) {
+				answer += n/5;
+				break;
+			}else {
+				answer ++;
+				n -= 3;
+			}
+			
+			if(n<0) {
+				answer = -1;
+				break;
+			}
+			
+		}
+		
+		System.out.println(answer);
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/greedy_wordsMath.java b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_wordsMath.java
new file mode 100644
index 0000000..1cd2aa4
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/greedy_wordsMath.java
@@ -0,0 +1,42 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+
+public class greedy_wordsMath {
+
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		int n = scan.nextInt();
+		
+		int[]arr = new int[n];
+		
+		for(int i=0;i<arr.length;i++) arr[i] = scan.nextInt();
+		
+		int answer = 0;
+		
+		int nPoint = arr[arr.length-1];
+		
+		
+		
+		for(int i=arr.length-2;i>-1;i--) {
+			
+			int pre = arr[i];
+			while(nPoint<=pre) {
+				
+				answer++;
+				pre--;
+				
+			}
+			
+			nPoint = pre;
+			
+			
+		}
+		
+		
+		System.out.println(answer);
+		
+	}
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/room.java b/Basic_Of_Algorithm/src/Today_22_05_20/room.java
new file mode 100644
index 0000000..279c1db
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/room.java
@@ -0,0 +1,48 @@
+package Today_22_05_20;
+
+import java.util.Scanner;
+import java.util.Arrays;
+import java.util.Comparator;
+
+public class room {
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+	
+		int n = scan.nextInt();
+		
+		int[][]arr = new int[n][2];
+		
+		int answer = 0 ;
+		
+		for(int i=0;i<n;i++) {
+			arr[i][0] = scan.nextInt();
+			arr[i][1] = scan.nextInt();
+		}
+		
+		Arrays.sort(arr, new Comparator<int[]>() {
+
+			@Override
+			public int compare(int[] o1, int[] o2) {
+				if(o1[1]==o2[1]) return o1[0] - o2[0];
+				else return o1[1] - o2[1];
+			}
+		});
+		
+		int end_time = 0;
+		
+		for(int i=0;i<arr.length;i++) {
+			
+			if(end_time<=arr[i][0]) {
+				end_time = arr[i][1];
+				answer++;
+			}
+			
+			
+		}
+		System.out.println(answer);
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_20/tuple.java b/Basic_Of_Algorithm/src/Today_22_05_20/tuple.java
new file mode 100644
index 0000000..3dd835a
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_20/tuple.java
@@ -0,0 +1,33 @@
+package Today_22_05_20;
+
+import java.util.HashMap;
+import java.util.List;
+import java.util.ArrayList;
+import java.util.Collections;
+
+public class tuple {
+
+	
+	public static void main(String[] args) {
+		
+		String s = "{{2},{2,1},{2,1,3},{2,1,3,4}}";
+		
+		s = s.replaceAll("\\{", "");
+		s = s.replaceAll("\\}", "");
+		
+		HashMap<Integer,Integer> map = new HashMap<>();
+		
+		String [] splitString = s.split(",");
+		
+		for(int i=0;i<splitString.length;i++) {
+			int num = Integer.parseInt(splitString[i]);
+			map.put(num, map.getOrDefault(num, 0)+1);
+		}
+		
+		List<Integer> keySet = new ArrayList<>(map.keySet());
+		Collections.sort(keySet, (o1,o2)-> map.get(o2).compareTo(map.get(o1)));
+		
+		System.out.println(keySet);
+		
+	}
+}