AcWing 785. 快速排序

注意处理输入时要用 trim 去除两边空格

function quicksort(nums, L, R) {
    if(L < R) {
        let i = L-1;
        let j = R+1;
        let x = nums[L+R >> 1];
        while(i<j) {
            do i++; while(nums[i]<x);
            do j--; while(nums[j]>x);
            if(i<j) swap(nums, i, j);
        }
        quicksort(nums, L, j);
        quicksort(nums, j+1, R);
    }
}

function swap(nums, i, j) {
    let tmp = nums[i];
    nums[i] = nums[j];
    nums[j] = tmp;
}

const readline = require("readline");
const R = readline.createInterface({
    input: process.stdin,
    output: process.stdout
});
const LOG = console.log;

let cnt = 0;
let n = 0;
R.on("line", function(line) {
   line = line.trim();
   cnt++;
   if(cnt === 1) n = parseInt(line);
   if(cnt === 2) {
       let nums = line.split(" ");
       for(let i=0;i<nums.length;i++) nums[i] -= "0";
       quicksort(nums, 0, n-1);
       let res = nums.join(" ");
       LOG(res);
   }
});