헷갈리는 여러가지 binarySearch

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;
+
+
+
+	}
+}

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;
+
+		}
+}

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);
+	}
+
+
+}

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);
+
+
+
+	}
+
+}

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);
+
+	}
+
+}