Basic of algorithm

Basic_Of_Algorithm/src/Today22_05_27/bracket.java

@@ -2,51 +2,53 @@
 
 import java.util.Stack;
 
+
 public class bracket {
 
 	public static void main(String[] args) {
 
-		String s = "[)(]";
+		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<>();
+			
+			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();
+					if(stack.peek()=='(') {
+						if(ch==')') stack.pop();
 						else stack.add(ch);
-					}else if(stack.peek()=='[' ) {
-						if(ch==']')stack.pop();
+					}else if(stack.peek()=='[') {
+						if(ch==']') stack.pop();
 						else stack.add(ch);
-					}else if(stack.peek()=='{' ) {
-						if(ch=='}')stack.pop();
+					}else if(stack.peek()=='{') {
+						if(ch=='}') stack.pop();
 						else stack.add(ch);
 					}
 
+
+
 				}
 
+
+
 			}
+			if(stack.isEmpty())answer++;
 
-
-			if(stack.isEmpty()) answer++;
-
-
 		}
 
-		System.out.println(answer);
-
+
+			System.out.println(answer);
 	}
 
 }

Basic_Of_Algorithm/src/Today22_05_27/disk.java

@@ -0,0 +1,67 @@
+package Today22_05_27;
+
+import java.util.Arrays;
+import java.util.Comparator;
+import java.util.PriorityQueue;
+
+public class disk {
+
+	public static void main(String[] args) {
+
+	int[][]jobs = {{0, 3}, {1, 9}, {2, 6}};	
+	int answer = 0;
+
+	Arrays.sort(jobs,(int[]o1,int[]o2)->{
+		if(o1[0]==o2[0]) return o1[1] - o2[1];
+
+		return o1[0] - o2[0];
+	});
+
+	for(int i=0;i<jobs.length;i++) {
+		System.out.println(jobs[i][0]+":"+jobs[i][1]);
+	}
+
+	PriorityQueue<int[]> q = new PriorityQueue<>(new Comparator<int[]>() {
+
+		@Override
+		public int compare(int[] o1, int[] o2) {
+
+			return o1[1]-o2[1];
+		}
+
+
+	});
+
+	q.offer(jobs[0]);
+	int end = jobs[0][0];
+	int sum = 0;
+	int idx = 1;
+
+	while(!q.isEmpty()) {
+		int [] cur = q.poll();
+		end += cur[1];
+		sum += end - cur[0];
+		System.out.println(end + " end");
+		System.out.println(sum);
+
+		while(idx < jobs.length && jobs[idx][0] <= end) {
+			q.offer(jobs[idx++]);
+		}
+
+
+
+		if(idx<jobs.length && q.isEmpty()) {
+			end = jobs[idx][0];
+			q.offer(jobs[idx++]);
+
+		}
+
+	}
+
+	System.out.println(sum/jobs.length);
+
+
+
+	}
+
+}

Basic_Of_Algorithm/src/Today22_05_27/test.java

@@ -0,0 +1,41 @@
+package Today22_05_27;
+
+import java.util.Queue;
+import java.util.LinkedList;
+
+public class test {
+
+	public static void main(String[] args) {
+
+
+		int a = 7;
+
+		int [] tree = {20,15,10,17};
+
+
+		int min = 0;
+		int max = 0;
+
+
+		for(int i : tree) if(max<i) max = i;
+
+		while(min<max) {
+
+			int mid = (min + max) / 2;
+			int sum = 0;
+
+			for(int i : tree) if(i-mid > 0) sum += i-mid;
+
+			if(sum<a) max = mid;
+			else min = mid+1;
+		}
+
+		System.out.println(min-1);
+
+
+
+
+
+	}
+
+}

Basic_Of_Algorithm/src/Today22_05_27/test2.java

@@ -0,0 +1,30 @@
+package Today22_05_27;
+
+public interface test2 {
+
+	public static void main(String[] args) {
+
+		int [] arr = {802,743,457,539};
+		int a = 11;
+
+		int min = 0;
+		int max = 0;
+
+		for(int i : arr) if(max<i)max=i;
+
+		while(min<max) {
+
+			int mid = (min+max)/2;
+			int count = 0;
+
+			for(int i : arr) count += i/mid;
+
+			if(count<a) max = mid;
+			else min = mid+1;
+
+		}
+
+		System.out.println(min-1);
+
+	}
+}