From ec6d7fe14a60ff4a44377972df604a40d2009da5 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Tue, 11 May 2021 18:41:03 +0300 Subject: [PATCH 01/10] 1057-Initial --- .../campusbikes/CampusBikesBucketSort.java | 57 ++++++++++++++++++ .../campusbikes/CampusBikesPriorityQueue.java | 59 +++++++++++++++++++ 2 files changed, 116 insertions(+) create mode 100644 src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java create mode 100644 src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java new file mode 100644 index 00000000..411bfc7c --- /dev/null +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -0,0 +1,57 @@ +package algorithms.curated170.medium; + +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; + +public class CampusBikesBucketSort { + + int w; + List[] buckets = new List[2001]; + + public int[] assignBikes(int[][] workers, int[][] bikes) { + + w = workers.length; + + assignToBuckets(workers, bikes); + + return assignFromBuckets(); + } + + private void assignToBuckets(int[][] workers, int[][] bikes) { + for (int i = 0; i < w; i++) { + for (int j = 0; j < w; j++) { + int dis = Math.abs(bikes[j][0] - workers[i][0]) + Math.abs(bikes[j][1] - workers[i][1]); + if (buckets[dis] == null) { + buckets[dis] = new ArrayList<>(); + } + buckets[dis].add(new int[] { i, j }); + } + } + } + + private int[] assignFromBuckets() + { + int[] res = new int[w]; + boolean[] bikeAssigned = new boolean[w]; + Arrays.fill(res, -1); + short assigned = 0; + + for (int i = 0; i < buckets.length && assigned < w; i++) { + if (buckets[i] != null) { + for (int[] pair : buckets[i]) { + if (res[pair[0]] < 0 && !bikeAssigned[pair[1]]) { + res[pair[0]] = pair[1]; + bikeAssigned[pair[1]] = true; + assigned++; + } + } + } + } + return res; + } + + public static void main(String[] args) { + + } +} \ No newline at end of file diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java new file mode 100644 index 00000000..b94d8b23 --- /dev/null +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java @@ -0,0 +1,59 @@ +package algorithms.curated170.medium; + +import java.util.Arrays; +import java.util.Comparator; +import java.util.PriorityQueue; + +public class CampusBikesPriorityQueue { + + int w; + PriorityQueue pq = new PriorityQueue<>(new Comparator() { + @Override + public int compare(int[] a, int[] b) { + return a[0] != b[0] ? a[0] - b[0] : (a[1] != b[1] ? a[1] - b[1] : (a[2] - b[2])); + } + }); + + public int[] assignBikes(int[][] workers, int[][] bikes) { + + w = workers.length; + + createHeap(workers, bikes); + + return assignFromHeap(); + } + + private void createHeap(int[][] workers, int[][] bikes) + { + for (int i = 0; i < w; i++) { + for (int j = 0; j < w; j++) { + int[] worker = workers[i], bike = bikes[j]; + int dist = Math.abs(worker[0] - bike[0]) + Math.abs(worker[1] - bike[1]); + pq.offer(new int[] { dist, i, j }); + } + } + } + private int[] assignFromHeap() { + + int[] wo = new int[w]; + int[] bi = new int[w]; + Arrays.fill(wo, -1); + Arrays.fill(bi, -1); + + int assigned = 0; + while (!pq.isEmpty() && assigned < w) { + int[] entry = pq.poll(); + if (wo[entry[1]] == -1 && bi[entry[2]] == -1) { + wo[entry[1]] = entry[2]; + bi[entry[2]] = entry[1]; + assigned++; + } + } + + return wo; + } + + public static void main(String[] args) { + + } +} \ No newline at end of file From 7e887ff6a41c9e0fb37fafbf3ab23e2ea2e691f3 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Tue, 11 May 2021 19:30:43 +0300 Subject: [PATCH 02/10] 1057-Assignment check refactorings --- .../medium/campusbikes/CampusBikesBucketSort.java | 5 +++-- .../medium/campusbikes/CampusBikesPriorityQueue.java | 12 +++++++----- 2 files changed, 10 insertions(+), 7 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index 411bfc7c..132a8754 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -34,15 +34,16 @@ private int[] assignFromBuckets() { int[] res = new int[w]; boolean[] bikeAssigned = new boolean[w]; - Arrays.fill(res, -1); + boolean[] workerAssigned = new boolean[w]; short assigned = 0; for (int i = 0; i < buckets.length && assigned < w; i++) { if (buckets[i] != null) { for (int[] pair : buckets[i]) { - if (res[pair[0]] < 0 && !bikeAssigned[pair[1]]) { + if (!workerAssigned[pair[0]] && !bikeAssigned[pair[1]]) { res[pair[0]] = pair[1]; bikeAssigned[pair[1]] = true; + workerAssigned[pair[0]] = true; assigned++; } } diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java index b94d8b23..098b138f 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java @@ -36,16 +36,18 @@ private void createHeap(int[][] workers, int[][] bikes) private int[] assignFromHeap() { int[] wo = new int[w]; - int[] bi = new int[w]; - Arrays.fill(wo, -1); - Arrays.fill(bi, -1); + + boolean[] bikeAssigned = new boolean[w]; + boolean[] workerAssigned = new boolean[w]; int assigned = 0; while (!pq.isEmpty() && assigned < w) { int[] entry = pq.poll(); - if (wo[entry[1]] == -1 && bi[entry[2]] == -1) { + if (!workerAssigned[entry[1]] && !bikeAssigned[entry[2]]) { wo[entry[1]] = entry[2]; - bi[entry[2]] = entry[1]; + + workerAssigned[entry[1]] = true; + bikeAssigned[entry[2]] = true; assigned++; } } From 046f39cdd152c9533e79b59be1f28c3360d72942 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Wed, 12 May 2021 21:12:11 +0300 Subject: [PATCH 03/10] 1057-Refactorings --- .../campusbikes/CampusBikesBucketSort.java | 37 +++++++++++-------- .../campusbikes/CampusBikesPriorityQueue.java | 26 ++++++++----- 2 files changed, 39 insertions(+), 24 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index 132a8754..8e6f50ee 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -1,7 +1,6 @@ package algorithms.curated170.medium; import java.util.ArrayList; -import java.util.Arrays; import java.util.List; public class CampusBikesBucketSort { @@ -10,7 +9,7 @@ public class CampusBikesBucketSort { List[] buckets = new List[2001]; public int[] assignBikes(int[][] workers, int[][] bikes) { - + w = workers.length; assignToBuckets(workers, bikes); @@ -20,19 +19,18 @@ public int[] assignBikes(int[][] workers, int[][] bikes) { private void assignToBuckets(int[][] workers, int[][] bikes) { for (int i = 0; i < w; i++) { - for (int j = 0; j < w; j++) { - int dis = Math.abs(bikes[j][0] - workers[i][0]) + Math.abs(bikes[j][1] - workers[i][1]); - if (buckets[dis] == null) { - buckets[dis] = new ArrayList<>(); + for (int j = 0; j < bikes.length; j++) { + int dist = dist(workers[i], bikes[j]); + if (buckets[dist] == null) { + buckets[dist] = new ArrayList<>(); } - buckets[dis].add(new int[] { i, j }); + buckets[dist].add(new int[] { i, j }); } } } - private int[] assignFromBuckets() - { - int[] res = new int[w]; + private int[] assignFromBuckets() { + int[] wo = new int[w]; boolean[] bikeAssigned = new boolean[w]; boolean[] workerAssigned = new boolean[w]; short assigned = 0; @@ -40,16 +38,25 @@ private int[] assignFromBuckets() for (int i = 0; i < buckets.length && assigned < w; i++) { if (buckets[i] != null) { for (int[] pair : buckets[i]) { - if (!workerAssigned[pair[0]] && !bikeAssigned[pair[1]]) { - res[pair[0]] = pair[1]; - bikeAssigned[pair[1]] = true; - workerAssigned[pair[0]] = true; + + int w = pair[0]; + int b = pair[1]; + + if (!workerAssigned[w] && !bikeAssigned[b]) { + wo[w] = pair[b]; + + bikeAssigned[b] = true; + workerAssigned[w] = true; assigned++; } } } } - return res; + return wo; + } + + private int dist(int[] w, int[] b) { + return Math.abs(w[0] - b[0]) + Math.abs(w[1] - b[1]); } public static void main(String[] args) { diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java index 098b138f..d3d8cfa9 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java @@ -23,16 +23,16 @@ public int[] assignBikes(int[][] workers, int[][] bikes) { return assignFromHeap(); } - private void createHeap(int[][] workers, int[][] bikes) - { + private void createHeap(int[][] workers, int[][] bikes) { for (int i = 0; i < w; i++) { - for (int j = 0; j < w; j++) { - int[] worker = workers[i], bike = bikes[j]; - int dist = Math.abs(worker[0] - bike[0]) + Math.abs(worker[1] - bike[1]); + for (int j = 0; j < bikes.length; j++) { + + int dist = dist(workers[i], bikes[j]); pq.offer(new int[] { dist, i, j }); } } } + private int[] assignFromHeap() { int[] wo = new int[w]; @@ -43,11 +43,15 @@ private int[] assignFromHeap() { int assigned = 0; while (!pq.isEmpty() && assigned < w) { int[] entry = pq.poll(); - if (!workerAssigned[entry[1]] && !bikeAssigned[entry[2]]) { - wo[entry[1]] = entry[2]; - workerAssigned[entry[1]] = true; - bikeAssigned[entry[2]] = true; + int w = entry[1]; + int b = entry[2]; + + if (!workerAssigned[w] && !bikeAssigned[b]) { + wo[w] = b; + + workerAssigned[w] = true; + bikeAssigned[b] = true; assigned++; } } @@ -55,6 +59,10 @@ private int[] assignFromHeap() { return wo; } + private int dist(int[] w, int[] b) { + return Math.abs(w[0] - b[0]) + Math.abs(w[1] - b[1]); + } + public static void main(String[] args) { } From 543cff1bb6cf8ee5b030ebed038b03be8f04271d Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 15:50:22 +0300 Subject: [PATCH 04/10] 1057-More fixes --- .../campusbikes/CampusBikesBucketSort.java | 21 ++++++++++--------- 1 file changed, 11 insertions(+), 10 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index 8e6f50ee..ae8fff41 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -5,12 +5,13 @@ public class CampusBikesBucketSort { - int w; + int w, b; List[] buckets = new List[2001]; public int[] assignBikes(int[][] workers, int[][] bikes) { w = workers.length; + b = workers.length; assignToBuckets(workers, bikes); @@ -19,7 +20,7 @@ public int[] assignBikes(int[][] workers, int[][] bikes) { private void assignToBuckets(int[][] workers, int[][] bikes) { for (int i = 0; i < w; i++) { - for (int j = 0; j < bikes.length; j++) { + for (int j = 0; j < b; j++) { int dist = dist(workers[i], bikes[j]); if (buckets[dist] == null) { buckets[dist] = new ArrayList<>(); @@ -32,21 +33,21 @@ private void assignToBuckets(int[][] workers, int[][] bikes) { private int[] assignFromBuckets() { int[] wo = new int[w]; boolean[] bikeAssigned = new boolean[w]; - boolean[] workerAssigned = new boolean[w]; + boolean[] workerAssigned = new boolean[b]; short assigned = 0; - for (int i = 0; i < buckets.length && assigned < w; i++) { + for (int i = 0; i < buckets.length && assigned <= w; i++) { if (buckets[i] != null) { for (int[] pair : buckets[i]) { - int w = pair[0]; - int b = pair[1]; + int w_ = pair[0]; + int b_ = pair[1]; - if (!workerAssigned[w] && !bikeAssigned[b]) { - wo[w] = pair[b]; + if (!workerAssigned[w_] && !bikeAssigned[b_]) { + wo[w_] = pair[b_]; - bikeAssigned[b] = true; - workerAssigned[w] = true; + bikeAssigned[b_] = true; + workerAssigned[w_] = true; assigned++; } } From feacd11c433212f0a2b69e83827d27132cfc7304 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 15:51:50 +0300 Subject: [PATCH 05/10] 1057-More fixes 1 --- .../curated170/medium/campusbikes/CampusBikesBucketSort.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index ae8fff41..0200bb2a 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -36,7 +36,7 @@ private int[] assignFromBuckets() { boolean[] workerAssigned = new boolean[b]; short assigned = 0; - for (int i = 0; i < buckets.length && assigned <= w; i++) { + for (int i = 0; i < buckets.length && assigned < w; i++) { if (buckets[i] != null) { for (int[] pair : buckets[i]) { From 56778a44fadb7b97053f65125d4e94ea186eed47 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 16:02:09 +0300 Subject: [PATCH 06/10] 1057-More fixes 2 --- .../campusbikes/CampusBikesBucketSort.java | 32 ++++++++++++++++++- 1 file changed, 31 insertions(+), 1 deletion(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index 0200bb2a..38ed0bff 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -1,6 +1,7 @@ package algorithms.curated170.medium; import java.util.ArrayList; +import java.util.Arrays; import java.util.List; public class CampusBikesBucketSort { @@ -44,7 +45,7 @@ private int[] assignFromBuckets() { int b_ = pair[1]; if (!workerAssigned[w_] && !bikeAssigned[b_]) { - wo[w_] = pair[b_]; + wo[w_] = b_; bikeAssigned[b_] = true; workerAssigned[w_] = true; @@ -61,6 +62,35 @@ private int dist(int[] w, int[] b) { } public static void main(String[] args) { + int[][] workers0 = { + {0, 0}, + {2, 1} + }; + int[][] bikes0 = { + {1, 2}, + {3, 3} + }; + + var solution = new CampusBikesBucketSort(); + System.out.println(Arrays.toString(solution.assignBikes(workers0, bikes0))); + solution.printBuckets(); + } + void printBuckets() + { + StringBuilder sb = new StringBuilder(); + for(List k : buckets) + { + if(k==null) + { + continue; + } + for(int[] j : k) + { + sb.append(Arrays.toString(j)); + } + sb.append("/"); + } + System.out.println(sb.toString()); } } \ No newline at end of file From ae29b37598bd1550dec1f25c69e7c6092caef7e2 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 16:05:36 +0300 Subject: [PATCH 07/10] 1057-More fixes 3 --- .../campusbikes/CampusBikesPriorityQueue.java | 19 ++++++++++--------- 1 file changed, 10 insertions(+), 9 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java index d3d8cfa9..f422bde6 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java @@ -6,7 +6,7 @@ public class CampusBikesPriorityQueue { - int w; + int w, b; PriorityQueue pq = new PriorityQueue<>(new Comparator() { @Override public int compare(int[] a, int[] b) { @@ -17,6 +17,7 @@ public int compare(int[] a, int[] b) { public int[] assignBikes(int[][] workers, int[][] bikes) { w = workers.length; + b = bikes.length; createHeap(workers, bikes); @@ -25,7 +26,7 @@ public int[] assignBikes(int[][] workers, int[][] bikes) { private void createHeap(int[][] workers, int[][] bikes) { for (int i = 0; i < w; i++) { - for (int j = 0; j < bikes.length; j++) { + for (int j = 0; j < b; j++) { int dist = dist(workers[i], bikes[j]); pq.offer(new int[] { dist, i, j }); @@ -38,20 +39,20 @@ private int[] assignFromHeap() { int[] wo = new int[w]; boolean[] bikeAssigned = new boolean[w]; - boolean[] workerAssigned = new boolean[w]; + boolean[] workerAssigned = new boolean[b]; int assigned = 0; while (!pq.isEmpty() && assigned < w) { int[] entry = pq.poll(); - int w = entry[1]; - int b = entry[2]; + int w_ = entry[1]; + int b_ = entry[2]; - if (!workerAssigned[w] && !bikeAssigned[b]) { - wo[w] = b; + if (!workerAssigned[w_] && !bikeAssigned[b_]) { + wo[w_] = b_; - workerAssigned[w] = true; - bikeAssigned[b] = true; + workerAssigned[w_] = true; + bikeAssigned[b_] = true; assigned++; } } From 7df51fc2e6993963e3c1535b3337a92c2c83e1c2 Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 16:29:47 +0300 Subject: [PATCH 08/10] 1057-More fixes 5 --- .../medium/campusbikes/CampusBikesBucketSort.java | 15 ++++++--------- 1 file changed, 6 insertions(+), 9 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index 38ed0bff..3e746ea1 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -12,7 +12,7 @@ public class CampusBikesBucketSort { public int[] assignBikes(int[][] workers, int[][] bikes) { w = workers.length; - b = workers.length; + b = bikes.length; assignToBuckets(workers, bikes); @@ -26,6 +26,7 @@ private void assignToBuckets(int[][] workers, int[][] bikes) { if (buckets[dist] == null) { buckets[dist] = new ArrayList<>(); } + buckets[dist].add(new int[] { i, j }); } } @@ -62,14 +63,10 @@ private int dist(int[] w, int[] b) { } public static void main(String[] args) { - int[][] workers0 = { - {0, 0}, - {2, 1} - }; - int[][] bikes0 = { - {1, 2}, - {3, 3} - }; + int[][] workers0 = {{664,994},{3,425},{599,913},{220,352},{145,348},{604,428},{519,183},{732,148}}; + + int[][] bikes0 = {{611,698},{113,338},{579,770},{276,588},{948,679},{731,525},{925,877},{182,281},{39,299}}; + var solution = new CampusBikesBucketSort(); System.out.println(Arrays.toString(solution.assignBikes(workers0, bikes0))); From 8e3a4ef2cbf0850dd272155a53d1a85b8293488e Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 17:46:16 +0300 Subject: [PATCH 09/10] 1057-More fixes 6 This should work. --- .../medium/campusbikes/CampusBikesBucketSort.java | 6 ++++-- .../medium/campusbikes/CampusBikesPriorityQueue.java | 10 ++++++++-- 2 files changed, 12 insertions(+), 4 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index 3e746ea1..c9e5dd34 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -33,9 +33,11 @@ private void assignToBuckets(int[][] workers, int[][] bikes) { } private int[] assignFromBuckets() { + + printBuckets(); int[] wo = new int[w]; - boolean[] bikeAssigned = new boolean[w]; - boolean[] workerAssigned = new boolean[b]; + boolean[] bikeAssigned = new boolean[b]; + boolean[] workerAssigned = new boolean[w]; short assigned = 0; for (int i = 0; i < buckets.length && assigned < w; i++) { diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java index f422bde6..9c047be8 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesPriorityQueue.java @@ -38,8 +38,8 @@ private int[] assignFromHeap() { int[] wo = new int[w]; - boolean[] bikeAssigned = new boolean[w]; - boolean[] workerAssigned = new boolean[b]; + boolean[] bikeAssigned = new boolean[b]; + boolean[] workerAssigned = new boolean[w]; int assigned = 0; while (!pq.isEmpty() && assigned < w) { @@ -65,6 +65,12 @@ private int dist(int[] w, int[] b) { } public static void main(String[] args) { + int[][] workers0 = {{664,994},{3,425},{599,913},{220,352},{145,348},{604,428},{519,183},{732,148}}; + int[][] bikes0 = {{611,698},{113,338},{579,770},{276,588},{948,679},{731,525},{925,877},{182,281},{39,299}}; + + + var solution = new CampusBikesPriorityQueue(); + System.out.println(Arrays.toString(solution.assignBikes(workers0, bikes0))); } } \ No newline at end of file From 772029cdeb0f6401a6efe6c24d07ed3e20cb552b Mon Sep 17 00:00:00 2001 From: ErdemT09 Date: Fri, 14 May 2021 17:48:55 +0300 Subject: [PATCH 10/10] 1057-Removed unnecessary print --- .../curated170/medium/campusbikes/CampusBikesBucketSort.java | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java index c9e5dd34..7ae5e445 100644 --- a/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java +++ b/src/main/java/algorithms/curated170/medium/campusbikes/CampusBikesBucketSort.java @@ -33,8 +33,7 @@ private void assignToBuckets(int[][] workers, int[][] bikes) { } private int[] assignFromBuckets() { - - printBuckets(); + int[] wo = new int[w]; boolean[] bikeAssigned = new boolean[b]; boolean[] workerAssigned = new boolean[w];