From 2ab6e77c4e92062e9ec5f6247865e7db44ab7cdb Mon Sep 17 00:00:00 2001 From: monsileI Date: Tue, 31 May 2022 18:20:07 +0900 Subject: [PATCH] =?UTF-8?q?=EC=98=A4=EB=9E=9C=EB=A7=8C=EC=97=90=20?= =?UTF-8?q?=EC=BD=94=ED=85=8C=20=ED=8F=AD=EB=B0=9C=20=E3=85=8B=E3=85=8B?= =?UTF-8?q?=E3=85=8B=E3=85=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../binarySearchNo01.java | 2 +- .../binarySearchNo2.java | 2 +- .../binarySearchNo3.java | 2 +- .../binarySearchNo4.java | 2 +- .../bracket.java | 2 +- .../catchAndHide.java | 2 +- .../disk.java | 2 +- .../programmers_lv_2_no1.java | 2 +- .../programmers_lv_2_no2.java | 2 +- .../quate.java | 2 +- .../rightBigNumber.java | 2 +- .../test.java | 2 +- .../test2.java | 2 +- .../src/Today_22_05_31/HowToLine.java | 58 ++++++++++ .../src/Today_22_05_31/Yangong.java | 87 +++++++++++++++ .../src/Today_22_05_31/apchuck.java | 56 ++++++++++ .../src/Today_22_05_31/changeBracket.java | 88 +++++++++++++++ .../src/Today_22_05_31/dungeon.java | 37 +++++++ .../src/Today_22_05_31/gameMap.java | 55 ++++++++++ .../src/Today_22_05_31/groupPicture.java | 66 ++++++++++++ .../src/Today_22_05_31/groupPicture2_BFS.java | 100 ++++++++++++++++++ .../src/Today_22_05_31/hanoi.java | 31 ++++++ .../src/Today_22_05_31/lastWordLinked.java | 52 +++++++++ .../src/Today_22_05_31/menuRenewal.java | 66 ++++++++++++ .../src/Today_22_05_31/parkingFee.java | 86 +++++++++++++++ .../src/Today_22_05_31/quad.java | 71 +++++++++++++ .../src/Today_22_05_31/soosick.java | 86 +++++++++++++++ .../src/Today_22_05_31/targetNumber.java | 36 +++++++ .../src/Today_22_05_31/treeCut.java | 37 +++++++ .../src/Today_22_05_31/tuple.java | 51 +++++++++ 30 files changed, 1076 insertions(+), 13 deletions(-) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/binarySearchNo01.java (97%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/binarySearchNo2.java (98%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/binarySearchNo3.java (96%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/binarySearchNo4.java (96%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/bracket.java (97%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/catchAndHide.java (97%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/disk.java (97%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/programmers_lv_2_no1.java (97%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/programmers_lv_2_no2.java (96%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/quate.java (97%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/rightBigNumber.java (96%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/test.java (95%) rename Basic_Of_Algorithm/src/{Today22_05_27 => Today_22_05_27}/test2.java (94%) create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/HowToLine.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/Yangong.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/apchuck.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/changeBracket.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/dungeon.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/gameMap.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/groupPicture.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/groupPicture2_BFS.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/hanoi.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/lastWordLinked.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/menuRenewal.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/parkingFee.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/quad.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/soosick.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/targetNumber.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/treeCut.java create mode 100644 Basic_Of_Algorithm/src/Today_22_05_31/tuple.java diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java b/Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo01.java similarity index 97% rename from Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java rename to Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo01.java index 6a02db3..542f282 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo01.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java b/Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo2.java similarity index 98% rename from Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java rename to Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo2.java index c24629d..71237ec 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo2.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java b/Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo3.java similarity index 96% rename from Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java rename to Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo3.java index fa7ef11..fee42cc 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo3.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java b/Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo4.java similarity index 96% rename from Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java rename to Basic_Of_Algorithm/src/Today_22_05_27/binarySearchNo4.java index 1b8c8c3..e7a74c1 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/binarySearchNo4.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/bracket.java b/Basic_Of_Algorithm/src/Today_22_05_27/bracket.java similarity index 97% rename from Basic_Of_Algorithm/src/Today22_05_27/bracket.java rename to Basic_Of_Algorithm/src/Today_22_05_27/bracket.java index bf8cfdf..9cfa93a 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/bracket.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java b/Basic_Of_Algorithm/src/Today_22_05_27/catchAndHide.java similarity index 97% rename from Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java rename to Basic_Of_Algorithm/src/Today_22_05_27/catchAndHide.java index 668bcd2..d22088c 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/catchAndHide.java +++ b/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.*; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/disk.java b/Basic_Of_Algorithm/src/Today_22_05_27/disk.java similarity index 97% rename from Basic_Of_Algorithm/src/Today22_05_27/disk.java rename to Basic_Of_Algorithm/src/Today_22_05_27/disk.java index 15b16ce..3c1a0e1 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/disk.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java b/Basic_Of_Algorithm/src/Today_22_05_27/programmers_lv_2_no1.java similarity index 97% rename from Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java rename to Basic_Of_Algorithm/src/Today_22_05_27/programmers_lv_2_no1.java index d9fece7..51f7b7f 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no1.java +++ b/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 { diff --git a/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java b/Basic_Of_Algorithm/src/Today_22_05_27/programmers_lv_2_no2.java similarity index 96% rename from Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java rename to Basic_Of_Algorithm/src/Today_22_05_27/programmers_lv_2_no2.java index b85744e..a333810 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/programmers_lv_2_no2.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/quate.java b/Basic_Of_Algorithm/src/Today_22_05_27/quate.java similarity index 97% rename from Basic_Of_Algorithm/src/Today22_05_27/quate.java rename to Basic_Of_Algorithm/src/Today_22_05_27/quate.java index 756557c..1b48737 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/quate.java +++ b/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 { diff --git a/Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java b/Basic_Of_Algorithm/src/Today_22_05_27/rightBigNumber.java similarity index 96% rename from Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java rename to Basic_Of_Algorithm/src/Today_22_05_27/rightBigNumber.java index 35bf413..b373088 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/rightBigNumber.java +++ b/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.*; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/test.java b/Basic_Of_Algorithm/src/Today_22_05_27/test.java similarity index 95% rename from Basic_Of_Algorithm/src/Today22_05_27/test.java rename to Basic_Of_Algorithm/src/Today_22_05_27/test.java index 013e93f..4f69622 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/test.java +++ b/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; diff --git a/Basic_Of_Algorithm/src/Today22_05_27/test2.java b/Basic_Of_Algorithm/src/Today_22_05_27/test2.java similarity index 94% rename from Basic_Of_Algorithm/src/Today22_05_27/test2.java rename to Basic_Of_Algorithm/src/Today_22_05_27/test2.java index dc990b4..8b39087 100644 --- a/Basic_Of_Algorithm/src/Today22_05_27/test2.java +++ b/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 { diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/HowToLine.java b/Basic_Of_Algorithm/src/Today_22_05_31/HowToLine.java new file mode 100644 index 0000000..a52bcaa --- /dev/null +++ b/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 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=ryan[i]) a += 10 - i; + else r += 10-i; + + } + + if(r>a) { + int diff = r-a; + if(maxValue dic = new ArrayList<>(); + ArrayListans = new ArrayList<>(); + + dic.add("^&#("); + + for(int i=0;ist = new Stack<>(); + + for(int i=0;iq = 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 i = cur[0]; + int j = cur[1]; + + for(int d = 0 ; d< 4; d++) { + + int newI = i + move[d][0]; + int newJ = j + move[d][1]; + + if(newI<0||newJ<0||maps.length-12"}; + dt = data; + dfs(0,""); + + System.out.println(answer); + + } + static boolean check(String now) { + + for(String str : dt) { + + int pos1 = now.indexOf(str.charAt(0)); + int pos2 = now.indexOf(str.charAt(2)); + int op = str.charAt(3); + int idx = str.charAt(4) - '0'; + + if(op=='=') { + if(!(Math.abs(pos1-pos2)==idx+1)) return false; + }else if(op=='>') { + if(!(Math.abs(pos1-pos2)>idx+1)) return false; + }else if(op=='<') { + if(!(Math.abs(pos1-pos2) " + to); + return; + } + + hanoi(n-1,start,to,mid); + + System.out.println(start+" -> " +to); + + hanoi(n-1,mid,start,to); + } +} \ No newline at end of file diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/lastWordLinked.java b/Basic_Of_Algorithm/src/Today_22_05_31/lastWordLinked.java new file mode 100644 index 0000000..dd2b1cc --- /dev/null +++ b/Basic_Of_Algorithm/src/Today_22_05_31/lastWordLinked.java @@ -0,0 +1,52 @@ +package Today_22_05_31; + +import java.util.ArrayList; + +public class lastWordLinked { + + public static void main(String[] args) { + + int n = 3; + + String [] words = {"tank", "kick", "know", "wheel", "land", "dream", "mother", "robot", "tank"}; + + int []answer = new int[2]; + + char last = words[0].charAt(words[0].length()-1); + + int person = 2; + int round = 1; + + ArrayListwordsList = new ArrayList<>(); + + wordsList.add(words[0]); + + for(int i=1;in) { + round++; + person = 1; + } + + } + + System.out.println(answer[0]+" : "+answer[1]); + + + } +} diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/menuRenewal.java b/Basic_Of_Algorithm/src/Today_22_05_31/menuRenewal.java new file mode 100644 index 0000000..4981387 --- /dev/null +++ b/Basic_Of_Algorithm/src/Today_22_05_31/menuRenewal.java @@ -0,0 +1,66 @@ +package Today_22_05_31; + +import java.util.HashMap; +import java.util.ArrayList; +import java.util.Arrays; +import java.util.Collections; + +public class menuRenewal { + + static HashMap map = new HashMap<>(); + static ArrayListanswerList = new ArrayList<>(); + + public static void main(String[] args) { + + String[]orders = {"ABCFG", "AC", "CDE", "ACDE", "BCFG", "ACDEH"}; + int[]course = {2,3,4}; + + for(int i=0;imaxList = new ArrayList<>(map.values()); + int max = Collections.max(maxList); + if(max>1) { + for(String key : map.keySet()) { + if(max==map.get(key)) { + answerList.add(key); + } + } + } + } + + map.clear(); + } + + Collections.sort(answerList); + + System.out.println(answerList); + + } + static void dfs(int count,String order,String now) { + + if(count==0) { + map.put(now, map.getOrDefault(now, 0)+1); + return; + } + + for(int i=0;i map = new HashMap<>(); + static TreeMap tree = new TreeMap<>(); + + public static void main(String[] args) { + + int[]fees = {180,5000,10,600}; + String []records = {"05:34 5961 IN", "06:00 0000 IN", "06:34 0000 OUT", "07:59 5961 OUT", "07:59 0148 IN", "18:59 0000 IN", "19:09 0148 OUT", "22:59 5961 IN", "23:00 5961 OUT"}; + + + for(String str : records) { + + String [] temp = str.split(" "); + + int time = change(temp[0]); + String num = temp[1]; + String action = temp[2]; + + if(action.equals("IN")) map.put(num, time); + else { + + if(!tree.containsKey(num)) tree.put(num, 0); + + tree.put(num, tree.get(num) + (time - map.get(num))); + map.remove(num); + + } + } + + if(!map.isEmpty()) { + for(String key : map.keySet()) { + if(!tree.containsKey(key)) tree.put(key, 0); + + tree.put(key, tree.get(key) + ((23 * 60) + 59 - map.get(key))); + + } + } + + System.out.println(tree); + + ArrayList answerList = new ArrayList<>(); + + + + for(String key : tree.keySet()) { + + int time = tree.get(key); + + if(time<=fees[0]) { + answerList.add(fees[1]); + continue; + } + time -= fees[0]; + double result = fees[1]; + double check = (double)time/fees[2]; + + check = Math.ceil(check); + + result += fees[3] * check; + answerList.add((int)result); + + + } + + System.out.println(answerList); + + + } + static int change(String time) { + + String [] temp = time.split(":"); + + int hour = Integer.parseInt(temp[0]) * 60; + int min = Integer.parseInt(temp[1]) + hour; + + return min; + + } +} diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/quad.java b/Basic_Of_Algorithm/src/Today_22_05_31/quad.java new file mode 100644 index 0000000..2a70cb0 --- /dev/null +++ b/Basic_Of_Algorithm/src/Today_22_05_31/quad.java @@ -0,0 +1,71 @@ +package Today_22_05_31; + +public class quad { + + + public static void main(String[] args) { + + solution solution = new solution(); + + int[][]arr1 = {{1,1,0,0},{1,0,0,0},{1,0,0,1},{1,1,1,1}}; + int[][]arr2 = {{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}}; + int[]result1 = solution.solution(arr1); + int[]result2 = solution.solution(arr2); + + System.out.print(result1[0]+" , "); + System.out.println(result1[1]); + System.out.print(result2[0]+" , "); + System.out.println(result2[1]); + + } +} + +class solution{ + + + int[]answer; + + public int[]solution(int[][]arr) { + + answer= new int[2]; + + + + change(arr,0,0,arr.length); + + + + + + + return answer; + } + + boolean check(int[][]arr,int x,int y,int size) { + + for(int i=x;iopList = new ArrayList<>(); + static ArrayListnumList = new ArrayList<>(); + static long answer = 0; + + public static void main(String[] args) { + + + String expression = "100-200*300-500+20"; + + check(expression); + + boolean[]visited = new boolean[3]; + + dfs(new char[3],0,visited); + + System.out.println(answer); + + } + static long change(long a,long b,char ch) { + if(ch=='+')return a+b; + else if(ch=='-')return a-b; + else if(ch=='*')return a*b; + return 0; + } + static void dfs(char[]p,int num,boolean[]visited) { + + if(num==3) { + + ArrayList numArr = new ArrayList<>(numList); + ArrayList opArr = new ArrayList<>(opList); + + for(int i=0;i='0' && ch<='9') num += ch; + else { + numList.add(Long.parseLong(num)); + num=""; + opList.add(ch); + } + + } + + numList.add(Long.parseLong(num)); + + } +} diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/targetNumber.java b/Basic_Of_Algorithm/src/Today_22_05_31/targetNumber.java new file mode 100644 index 0000000..1d0edf6 --- /dev/null +++ b/Basic_Of_Algorithm/src/Today_22_05_31/targetNumber.java @@ -0,0 +1,36 @@ +package Today_22_05_31; + +public class targetNumber { + + static int answer= 0; + static int tar; + public static void main(String[] args) { + + int[]numbers = {1,1,1,1,1}; + int target = 3; + tar = target; + dfs(numbers,0,0); + + System.out.println(answer); + + } + + static void dfs(int[]numbers,int now,int count) { + + if(count==numbers.length) { + + if(tar==now) answer++; + + + return; + } + + + dfs(numbers,now + numbers[count],count+1); + dfs(numbers,now - numbers[count],count+1); + + + + } + +} diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/treeCut.java b/Basic_Of_Algorithm/src/Today_22_05_31/treeCut.java new file mode 100644 index 0000000..d112dfc --- /dev/null +++ b/Basic_Of_Algorithm/src/Today_22_05_31/treeCut.java @@ -0,0 +1,37 @@ +package Today_22_05_31; + +import java.util.Collections; + +public class treeCut { + + public static void main(String[] args) { + + int[]arr = {20,15,10,17}; + int cut = 7; + + int min = 0; + int max = 0; + + for(int i : arr) if(max0) count += i-mid; + + if(count>cut) min = mid+1; + else max = mid; + + + + } + + System.out.println(min); + + + + } +} diff --git a/Basic_Of_Algorithm/src/Today_22_05_31/tuple.java b/Basic_Of_Algorithm/src/Today_22_05_31/tuple.java new file mode 100644 index 0000000..ae995ca --- /dev/null +++ b/Basic_Of_Algorithm/src/Today_22_05_31/tuple.java @@ -0,0 +1,51 @@ +package Today_22_05_31; + +import java.util.ArrayList; +import java.util.Collections; +import java.util.Comparator; +import java.util.HashMap; + +public class tuple { + + public static void main(String[] args) { + + String s = "{{4,2,3},{3},{2,3,4,1},{2,3}}"; + + s = s.replaceAll("\\{", ""); + s = s.replaceAll("\\}", ""); + + + HashMap map = new HashMap<>(); + + String []temp = s.split(","); + + for(String str : temp) { + int num = Integer.parseInt(str); + map.put(num,map.getOrDefault(num, 0)+1); + } + + + ArrayList answerList = new ArrayList<>(map.keySet()); + + + Collections.sort(answerList, new Comparator() { + + @Override + public int compare(Integer o1, Integer o2) { + if(map.get(o1)==map.get(o2)) return map.get(o1)- map.get(o2); + else return map.get(o2)- map.get(o1); + } + + }); + + + + int[]answer= new int[answerList.size()]; + + for(int i=0;i