摘要：快速排序 public static void quickSort(int[] nums, int l, int r) { if (l == r) return; int i = l - 1, j = r + 1, mid = nums[l + r >> 1]; while (i < j) { wh 阅读全文