25. K Smallest In Unsorted Array

Find the K smallest numbers in an unsorted integer array A. The returned numbers should be in ascending order.

Assumptions

• A is not null
• K is >= 0 and smaller than or equal to size of A

Return

• an array with size K containing the K smallest numbers in ascending order

Examples

• A = {3, 4, 1, 2, 5}, K = 3, the 3 smallest numbers are {1, 2, 3}

这题有两个方法，方法一：quick select，方法二：用priority queue的maxHeap。

暂时先写方法一，和quick sort非常相似，需要用到recursion。将array全排列之后，选择前k项最小值，时间复杂度较高。TC average = O(n)，the worst = O(n^2)；SC = O(1)

public class Solution {
  public int[] kSmallest(int[] array, int k) {
    if(array.length == 0 || k == 0) {
      return new int[0];
    }
    quickSelect(array, 0, array.length - 1, k - 1);
    int[] result = Arrays.copyOf(array, k);
    Arrays.sort(result);
    return result;
  }

  private void quickSelect(int[] array, int left, int right, int target) {
    int mid = partition(array, left, right);
    if(mid == target) {
      return;
    } else if (target < mid) {
      quickSelect(array, left, mid - 1, target);
    } else {
      quickSelect(array, mid + 1, right, target);
    }
  }

  private int partition(int[] array, int left, int right) {
    int pivot = array[right];
    int start = left;
    int end = right - 1;
    while(start <= end) {
      if(array[start] < pivot) {
        start++;
      } else {
        swap(array, start, end);
        end--;
      }
    }
    swap(array, start, right);
    return start;
  }

  private void swap(int[] array, int left, int right) {
    int temp = array[left];
    array[left] = array[right];
    array[right] = temp;
  }
}