Sort an Array: Add

Author: sofkyle

LeetCodePrj/Java/leetcode/medium/page10/SortAnArray.java

@@ -0,0 +1,41 @@
+package leetcode.medium.page10;
+
+public class SortAnArray {
+    public int[] sortArray(int[] nums) {
+        int min = Integer.MAX_VALUE;
+        int max = Integer.MIN_VALUE;
+        for (int num : nums) {
+            if (num < min) {
+                min = num;
+            }
+            if (num > max) {
+                max = num;
+            }
+        }
+
+        int length = nums.length;
+        int bucketSize = (max - min) / length;
+        int bucketNum = (max - min) / bucketSize + 1;
+        int[][] bucket = new int[bucketNum][bucketSize];
+        boolean[][] store = new boolean[bucketNum][bucketSize];
+
+        for (int num : nums) {
+            int i = (num - min) / bucketSize;
+            int j = (num - min) % bucketSize;
+            bucket[i][j] = num;
+            store[i][j] = true;
+        }
+
+        int[] sortedArray = new int[length];
+        int k = 0;
+        for (int i = 0; i < bucketNum; i++) {
+            for (int j = 0; j < bucketSize; j++) {
+                if (store[i][j]) {
+                    sortedArray[k++] = bucket[i][j];
+                }
+            }
+        }
+
+        return sortedArray;
+    }
+}