From eca5b346fe83ef7cc6a0bd20779b2c04bcb3e599 Mon Sep 17 00:00:00 2001
From: monsileI <hansaem900d@kakao.com>
Date: Fri, 27 May 2022 22:08:24 +0900
Subject: [PATCH] =?UTF-8?q?=ED=97=B7=EA=B0=88=EB=A6=AC=EB=8A=94=20?=
 =?UTF-8?q?=EC=97=AC=EB=9F=AC=EA=B0=80=EC=A7=80=20binarySearch?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../src/Today22_05_27/binarySearchNo01.java   | 73 ++++++++++++++++
 .../src/Today22_05_27/binarySearchNo2.java    | 86 +++++++++++++++++++
 .../src/Today22_05_27/binarySearchNo3.java    | 61 +++++++++++++
 .../src/Today22_05_27/binarySearchNo4.java    | 62 +++++++++++++
 .../src/Today22_05_27/bracket.java            | 52 +++++++++++
 .../src/Today22_05_27/catchAndHide.java       | 62 +++++++++++++
 .../Today22_05_27/programmers_lv_2_no1.java   | 62 +++++++++++++
 .../Today22_05_27/programmers_lv_2_no2.java   | 50 +++++++++++
 .../src/Today22_05_27/rightBigNumber.java     | 43 ++++++++++
 .../Today_22_05_26/backJoon_number_card2.java | 71 +++++++++++++++
 10 files changed, 622 insertions(+)
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/bracket.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java
 create mode 100644 Basic_Of_Algorithm/src/Today_22_05_26/backJoon_number_card2.java

diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java
new file mode 100644
index 0000000..6a02db3
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java
@@ -0,0 +1,73 @@
+package Today22_05_27;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class binarySearchNo01 {
+
+	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<n;i++)arr[i] = scan.nextInt();
+        
+        int m = scan.nextInt();
+      
+        int[]find = new int[m];
+        
+        
+        for(int i=0;i<m;i++)find[i] = scan.nextInt();
+		
+		int [] answer = new int[find.length];
+		
+		
+		
+		Arrays.sort(arr);
+		
+		for(int i=0;i<find.length;i++) {
+			
+			int num = find[i];
+			
+			answer[i] = binary(num,arr);
+			
+			if(answer[i]>1) answer[i] = 1;
+			
+		}
+		
+		for(int i : answer)System.out.println(i);
+		
+		
+	}
+	
+	static int binary(int num,int[] arr) {
+		
+		
+		int start = 0;
+		int end = arr.length-1;
+		int count = 0;
+		
+		while(start<=end) {
+			
+			int mid = (start+end) / 2;
+			
+			if(num>=arr[mid]) start = mid+1;
+			else if(start==end)break;
+			else if(num<arr[mid]) end = mid - 1;
+			
+			if(arr[mid]==num) count++;
+			
+			
+		}
+		
+		
+		
+		return count;
+		
+		
+		
+	}
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java
new file mode 100644
index 0000000..c24629d
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java
@@ -0,0 +1,86 @@
+package Today22_05_27;
+
+import java.util.Scanner;
+import java.util.Arrays;
+
+public class binarySearchNo2 {
+	
+	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<n;i++) arr[i] = scan.nextInt();
+
+		Arrays.sort(arr);
+		
+		int m = scan.nextInt();
+		
+		int [] find = new int[m];
+		
+		for(int i=0;i<m;i++) find[i] = scan.nextInt();
+		
+		int []answer = new int[m];
+		
+		for(int i=0;i<find.length;i++) {
+			
+			int num = find[i];
+			
+			answer[i] = upperSearch(num, arr)-lowerSearch(num,arr);
+			
+		}
+		
+		for(int i : answer)System.out.println(i);
+	}
+	
+		static int upperSearch(int num, int []arr) {
+			
+			int start = 0;
+			int end = arr.length-1;
+		
+			
+			while(start<=end) {
+				
+				
+				
+				int mid = (start+end)/2;
+				
+
+				
+				if(num>=arr[mid]) start = mid+1;
+				else end = mid-1;
+				
+			}
+			
+			return start;
+			
+		}
+		
+		static int lowerSearch(int num, int []arr) {
+			
+			int start = 0;
+			int end = arr.length-1;
+	
+			while(start<=end) {
+				
+				
+
+				int mid = (start+end)/2;
+				
+
+				
+				if(num>arr[mid]) start = mid+1;
+				else end = mid-1;
+				
+				
+				
+				
+			}
+			
+			return start;
+			
+		}
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java
new file mode 100644
index 0000000..fa7ef11
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java
@@ -0,0 +1,61 @@
+package Today22_05_27;
+
+import java.util.Scanner;
+import java.util.Arrays;
+
+public class binarySearchNo3 {
+
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		int k = scan.nextInt();
+		int n = scan.nextInt();
+		
+		int[]arr = new int[k];
+		
+		for(int i =0;i<k;i++) arr[i] = scan.nextInt();
+		
+		Arrays.sort(arr);
+		
+		
+		long max = arr[arr.length-1]+1;
+		
+		long min = 0;
+		long mid = 0;
+		
+	
+		while(min<max) {
+			
+			
+			mid = (max+min)/2;
+			
+			long count = 0;
+			
+			for(int i=0;i<arr.length;i++) {
+				
+				count += (arr[i]/mid);
+			}
+			
+			
+			if(count<n) {
+				max = mid;
+			}else {
+				min = mid+1;
+				
+			}
+			
+			
+			
+			
+			
+		}
+		
+		
+		
+		
+		System.out.println(min - 1);
+	}
+	
+
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java
new file mode 100644
index 0000000..1b8c8c3
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java
@@ -0,0 +1,62 @@
+package Today22_05_27;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class binarySearchNo4 {
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		int n = scan.nextInt();
+
+		int m = scan.nextInt();
+		
+		int []arr = new int[n];
+		
+		for(int i=0;i<n;i++) arr[i] = scan.nextInt();
+		
+		Arrays.sort(arr);
+		
+		long min = 0;
+		long max = arr[arr.length-1] + 1;
+		long total = 0;
+		
+		while(min<max) {
+			
+			
+			long mid = (min+max)/2;
+			
+			long temp = 0;
+			
+			for(int i=0;i<arr.length;i++) {
+				
+				if(arr[i]- mid > 0) {
+					temp += (arr[i]-mid);
+				}
+			}
+			
+			
+			if(temp<m) {
+				max = mid;
+			}else {
+				min = mid+1;
+			}
+			
+			
+			
+			
+			
+			
+		}
+		
+		
+		
+		System.out.println(min-1);
+		
+		
+		
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/bracket.java b/Basic_Of_Algorithm/src/Today22_05_27/bracket.java
new file mode 100644
index 0000000..75d7d6c
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/bracket.java
@@ -0,0 +1,52 @@
+package Today22_05_27;
+
+import java.util.Stack;
+
+public class bracket {
+	
+	public static void main(String[] args) {
+		
+		String s = "[)(]";
+		int answer = 0;
+		
+		for(int i=0;i<s.length();i++) {
+			
+			String temp = s.substring(i);
+			
+			temp += s.substring(0,i);
+		
+			Stack<Character> stack = new Stack<>();
+			
+			for(int j=0;j<temp.length();j++) {
+				
+				char ch = temp.charAt(j);
+				
+				if(stack.isEmpty()) stack.add(ch);
+				else {
+					
+					if(stack.peek()=='(' ) {
+						if(ch==')')stack.pop();
+						else stack.add(ch);
+					}else if(stack.peek()=='[' ) {
+						if(ch==']')stack.pop();
+						else stack.add(ch);
+					}else if(stack.peek()=='{' ) {
+						if(ch=='}')stack.pop();
+						else stack.add(ch);
+					}
+					
+				}
+				
+			}
+			
+			
+			if(stack.isEmpty()) answer++;
+			
+
+		}
+		
+		System.out.println(answer);
+			
+	}
+
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java b/Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java
new file mode 100644
index 0000000..668bcd2
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java
@@ -0,0 +1,62 @@
+package Today22_05_27;
+
+import java.util.*;
+
+public class catchAndHide {
+
+	
+	public static void main(String[] args) {
+		
+		
+		int n = 17; // +1 +1 +1
+		
+		int m = 5; //+1 -1 *2
+		
+		int[]check = new int[100002];
+		
+		check[m] = 0;
+		
+		Queue<int[]>q = new LinkedList<>();
+		
+		
+		q.add(new int[] {n,m,0});
+		
+		
+		while(!q.isEmpty()) {
+			
+			int[]cur = q.poll();
+			
+			int cn = cur[0];
+			int cm = cur[1];
+		
+			
+			if(cn==cm) break;
+			
+			if(cn>100000) break;
+			
+			
+			if(cm+1<10000 && check[cm+1]==0) {
+				check[cm+1] = check[cm] +1;
+				q.add(new int[] {cn,cm+1});
+			}
+			
+			if(cm-1>0 && check[cm-1]==0) {
+				check[cm-1] = check[cm] +1;
+				q.add(new int[] {cn,cm-1});
+			}
+			
+			if(cm*2<10000 && check[cm*2]==0) {
+				check[cm*2] = check[cm] +1;
+				q.add(new int[] {cn,cm*2});
+			}
+			
+		}
+		
+		
+	System.out.println(check[n]);
+		
+		
+		
+		
+	}
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java b/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java
new file mode 100644
index 0000000..d9fece7
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java
@@ -0,0 +1,62 @@
+package Today22_05_27;
+
+public class programmers_lv_2_no1 {
+
+	static int[]answer;
+	static int[]num = new int[2];
+	
+	public static void main(String[] args) {
+		
+		
+		int[][]arr = {{1,1,1,1,1,1,1,1},{0,1,1,1,1,1,1,1},{0,0,0,0,1,1,1,1},{0,1,0,0,1,1,1,1},{0,0,0,0,0,0,1,1},{0,0,0,0,0,0,0,1},{0,0,0,0,1,0,0,1},{0,0,0,0,1,1,1,1}};
+		
+		answer = new int[2];
+		
+		
+		change(0,0,arr, arr.length);
+				
+		
+				
+		answer = num.clone();
+		
+		System.out.println(answer[0]);
+		System.out.println(answer[1]);
+	}
+	
+	
+	static void change(int x,int y,int[][]arr,int size) {
+		
+		
+		if(check(x,y,arr,size)) {
+			num[arr[x][y]]++;
+			return;
+		}
+		
+		
+		
+		change(x, y,arr,size/2);
+		change(x+size/2, y,arr,size/2);
+		change(x, y+size/2,arr,size/2);
+		change(x+size/2, y+size/2,arr,size/2);
+		
+		
+	}
+	
+	static boolean check(int x,int y,int[][]arr,int size) {
+		
+		for(int i=x;i<x+size;i++) {
+			for(int j=y;j<y+size;j++) {
+				if(arr[i][j]!=arr[x][y]) return false;
+			}
+		}
+		
+		
+		
+		return true;
+		
+	}
+	
+	
+	
+	
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java b/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java
new file mode 100644
index 0000000..b85744e
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java
@@ -0,0 +1,50 @@
+package Today22_05_27;
+
+import java.util.Queue;
+import java.util.LinkedList;
+import java.util.PriorityQueue;
+public class programmers_lv_2_no2 {
+
+
+	
+	public static void main(String[] args) {
+		
+		
+		int [] scoville = {1, 2, 3, 9, 10, 12};
+		int k = 7;
+		int answer = 0;
+		
+		
+		PriorityQueue<Integer> q = new PriorityQueue<>();
+		
+		
+		for(int i : scoville) q.offer(i);
+		
+		
+		while(k>q.peek()) {
+			
+			if(q.size()<2)break;
+			
+			
+			int first = q.poll();
+			int second = q.poll();
+			
+			int newOne = first + (second*2);
+			
+			q.offer(newOne);
+			answer++;
+			
+			
+		}
+		
+		
+		System.out.println(answer);
+		
+		
+		
+	}
+	
+	
+	
+	
+}
diff --git a/Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java b/Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java
new file mode 100644
index 0000000..35bf413
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java
@@ -0,0 +1,43 @@
+package Today22_05_27;
+
+import java.util.*;
+
+public class rightBigNumber {
+
+	public static void main(String[] args) {
+		
+		int arr[] = {3,5,2,7};
+		int []answer = new int[arr.length];
+		
+		Stack<Integer> tmp = new Stack<>();
+		Stack<Integer> ans = new Stack<>();
+		
+		for(int i=arr.length-1;i>-1;i--) {
+			
+			int num = arr[i];
+			
+			
+			while(!tmp.isEmpty() && num>=tmp.peek()) {
+				tmp.pop();
+			}
+			
+			if(tmp.isEmpty()) {
+				ans.add(-1);
+			}else {
+				ans.add(tmp.peek());
+			}
+			
+			tmp.add(num);
+			
+			
+			
+			
+		}
+		System.out.println(ans);
+		
+		for(int i=0;i<answer.length;i++) answer[i] = ans.pop();
+		
+		for(int i : answer)System.out.println(i);
+		
+	}
+}
diff --git a/Basic_Of_Algorithm/src/Today_22_05_26/backJoon_number_card2.java b/Basic_Of_Algorithm/src/Today_22_05_26/backJoon_number_card2.java
new file mode 100644
index 0000000..0888145
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today_22_05_26/backJoon_number_card2.java
@@ -0,0 +1,71 @@
+package Today_22_05_26;
+
+import java.util.Arrays;
+
+public class backJoon_number_card2 {
+	
+	public static void main(String[] args) {
+		
+		int [] arr1 = {6,3,2,10,10,10,-10,7,3};
+		int [] arr2 = {10,9,-5,2,3,4,5,-10};
+		
+		int []answer = new int[arr2.length];
+		
+		
+		Arrays.sort(arr1);
+		
+		
+		for(int i=0;i<arr2.length;i++) {
+			
+			answer[i] = upperBound(arr2[i],arr1) - lowerBound(arr2[i],arr1);
+		}
+		
+		
+		for(int i : answer)System.out.println(i);
+		
+		
+	}
+	static int lowerBound(int num,int []arr) {
+		
+		
+		int start = 0;
+		int end = arr.length;
+		
+		
+		while(start<end) {
+			
+			int mid = (start+end)/2;
+			
+			if(arr[mid]>=num) {
+				end = mid;
+			}else {
+				start = mid+1;
+			}
+			
+		}
+		
+		return start;
+	}
+	static int upperBound(int num,int []arr) {
+		
+		
+		int start = 0;
+		int end = arr.length;
+		
+		
+		while(start<end) {
+			
+			int mid = (start+end)/2;
+			
+			if(arr[mid]>num) {
+				end = mid;
+			}else {
+				start = mid+1;
+			}
+			
+		}
+		
+		return start;
+	}
+
+}