我的开发规则

代码编写规范

💡 代码编写规范用于提升代码质量、增加代码可读性、可维护性

1. idea 安装 Alibaba Java Coding GuideLines规范化插件
2. 判断true or false的时候必须关注 类型是Boolean类型还是boolean类型
3. 
   

代码review规范

💡 Tips：代码review可以减少代码的逻辑错误

代码自测规范

💡 Tips：输入/代码块或点击上方工具栏点击上方工具栏，选择「代码块」、插入代码卡片。

代码块同时支持多种颜色主题：

export default class QuickSort extends Sort {
  sort(originalArray) {
    const array = [...originalArray];
    if (array.length <= 1) {
      return array;
    }
    // Init left and right arrays.
    const leftArray = [];
    const rightArray = [];
    // Take the first element of array as a pivot.
    const pivotElement = array.shift();
    const centerArray = [pivotElement];
    // Split all array elements between left, center and right arrays.
    while (array.length) {
      const currentElement = array.shift();
      // Call visiting callback.
      this.callbacks.visitingCallback(currentElement);
      if (this.comparator.equal(currentElement, pivotElement)) {
        centerArray.push(currentElement);
      } else if (this.comparator.lessThan(currentElement, pivotElement)) {
        leftArray.push(currentElement);
      } else {
        rightArray.push(currentElement);
      }
    }
    // Sort left and right arrays.
    const leftArraySorted = this.sort(leftArray);
    const rightArraySorted = this.sort(rightArray);
    return leftArraySorted.concat(centerArray, rightArraySorted);
  }
}

export default class QuickSort extends Sort {
  sort(originalArray) {
    const array = [...originalArray];
    if (array.length <= 1) {
      return array;
    }
    // Init left and right arrays.
    const leftArray = [];
    const rightArray = [];
    // Take the first element of array as a pivot.
    const pivotElement = array.shift();
    const centerArray = [pivotElement];
    // Split all array elements between left, center and right arrays.
    while (array.length) {
      const currentElement = array.shift();
      // Call visiting callback.
      this.callbacks.visitingCallback(currentElement);
      if (this.comparator.equal(currentElement, pivotElement)) {
        centerArray.push(currentElement);
      } else if (this.comparator.lessThan(currentElement, pivotElement)) {
        leftArray.push(currentElement);
      } else {
        rightArray.push(currentElement);
      }
    }
    // Sort left and right arrays.
    const leftArraySorted = this.sort(leftArray);
    const rightArraySorted = this.sort(rightArray);
    return leftArraySorted.concat(centerArray, rightArraySorted);
  }
}

export default class QuickSort extends Sort {
  sort(originalArray) {
    const array = [...originalArray];
    if (array.length <= 1) {
      return array;
    }
    // Init left and right arrays.
    const leftArray = [];
    const rightArray = [];
    // Take the first element of array as a pivot.
    const pivotElement = array.shift();
    const centerArray = [pivotElement];
    // Split all array elements between left, center and right arrays.
    while (array.length) {
      const currentElement = array.shift();
      // Call visiting callback.
      this.callbacks.visitingCallback(currentElement);
      if (this.comparator.equal(currentElement, pivotElement)) {
        centerArray.push(currentElement);
      } else if (this.comparator.lessThan(currentElement, pivotElement)) {
        leftArray.push(currentElement);
      } else {
        rightArray.push(currentElement);
      }
    }
    // Sort left and right arrays.
    const leftArraySorted = this.sort(leftArray);
    const rightArraySorted = this.sort(rightArray);
    return leftArraySorted.concat(centerArray, rightArraySorted);
  }
}