Maximum Gap: AC

sofkyle · sofkyle · commit dee9cc463293 · 2019-06-26T09:00:27.000+08:00
diff --git a/LeetCodePrj/Java/leetcode/hard/page1/MaximumGap.java b/LeetCodePrj/Java/leetcode/hard/page1/MaximumGap.java
@@ -17,19 +17,21 @@ public int maximumGap(int[] nums) {
         int bucketSize = Math.max(1, (maxi - mini) / ((int) nums.length - 1));
         int bucketNum = (maxi - mini) / bucketSize + 1;
 
-        Vector<Bucket> buckets = new Vector<>(bucketSize);
+        Vector<Bucket> buckets = new Vector<>();
+        buckets.setSize(bucketNum);
 
         for (int num : nums) {
             int bukcetIdx = (num - mini) / bucketSize;
-            Bucket bucket = new Bucket();
-            bucket.used = true;
+            Bucket bucket = buckets.get(bukcetIdx);
+            if (bucket == null) bucket = new Bucket();
             bucket.minVal = Math.min(num, bucket.minVal);
             bucket.maxVal = Math.max(num, bucket.maxVal);
+            buckets.set(bukcetIdx, bucket);
         }
 
         int prevBuceketMax = mini, maxGap = 0;
         for (Bucket bucket : buckets) {
-            if (!bucket.used) {
+            if (bucket == null) {
                 continue;
             }
 
@@ -41,7 +43,6 @@ public int maximumGap(int[] nums) {
     }
 
     class Bucket {
-        boolean used = false;
         int minVal = Integer.MAX_VALUE;
         int maxVal = Integer.MIN_VALUE;
     }
