完成912

Author: diguage

README.adoc

@@ -6402,14 +6402,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0911-online-election.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/sort-an-array/[912. Sort an Array]
-//|{source_base_url}/_0912_SortAnArray.java[Java]
-//|{doc_base_url}/0912-sort-an-array.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/sort-an-array/[912. Sort an Array]
+|{source_base_url}/_0912_SortAnArray.java[Java]
+|{doc_base_url}/0912-sort-an-array.adoc[题解]
+|Medium
+|归并，快排
+
 //|{counter:codes}
 //|{leetcode_base_url}/cat-and-mouse/[913. Cat and Mouse]
 //|{source_base_url}/_0913_CatAndMouse.java[Java]

docs/0000-00-note.adoc

@@ -12,7 +12,7 @@
 . 树的 Morris 遍历
 .. TODO: 基于 Morris 遍历的中序排列已经掌握，前序，尤其是后续还需要加强。
 
-image::images/quicksort.gif[{image_attr}]
+image::images/quick-sort-01.gif[{image_attr}]
 
 == 未知
 

docs/0912-sort-an-array.adoc

@@ -28,12 +28,31 @@ Given an array of integers `nums`, sort the array in ascending order.
 * `1 <= nums.length <= 50000`
 * `-50000 <= nums[i] <= 50000`
 
+== 思路分析
 
+归并排序
 
+image::images/merge-sort-02.gif[{image_attr}]
+
+image::images/merge-sort-01.gif[{image_attr}]
+
+image::images/meger-sort-03.png[{image_attr}]
+
+image::images/quick-sort-01.gif[{image_attr}]
+
+image::images/quick-sort-02.gif[{image_attr}]
+
+image::images/quick-sort-03.png[{image_attr}]
 
 [[src-0912]]
 [{java_src_attr}]
 ----
-include::{sourcedir}/_0912_SortAnArray.java[]
+include::{sourcedir}/_0912_SortAnArray.java[tag=answer]
 ----
 
+== 参考资料
+
+. https://leetcode.cn/problems/sort-an-array/solutions/178305/pai-xu-shu-zu-by-leetcode-solution/[912. 排序数组 - 官方题解^]
+. https://leetcode.cn/problems/sort-an-array/solutions/179489/fu-xi-ji-chu-pai-xu-suan-fa-java-by-liweiwei1419/[912. 排序数组 - 复习基础排序算法^]
+. https://leetcode.cn/problems/sort-an-array/solutions/1311934/duo-chong-pai-xu-yi-wang-da-jin-kuai-pai-wgz4/[912. 排序数组 - 『 3种排序一网打尽 』 快速排序、归并排序、堆排序详解^]
+

docs/images/bubble-sort-02.gif

@@ -272,6 +272,11 @@
 |{doc_base_url}/0114-flatten-binary-tree-to-linked-list.adoc[题解]
 |遍历+递归，两套解决方案
 
+|{counter:codes}
+|{leetcode_base_url}/sort-an-array/[912. Sort an Array]
+|{doc_base_url}/0912-sort-an-array.adoc[题解]
+|归并，快排都可以
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

docs/images/insertion-sort-02.gif

@@ -0,0 +1,48 @@
+package com.diguage.algorithm.leetcode;
+
+public class _0912_SortAnArray {
+  // tag::answer[]
+  /**
+   * 归并排序
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-07-06 17:47:27
+   */
+  public int[] sortArray(int[] nums) {
+    mergeSort(nums, 0, nums.length - 1);
+    return nums;
+  }
+
+  private void mergeSort(int[] nums, int left, int right) {
+    if (right == left) {
+      return;
+    }
+    int mid = left + (right - left) / 2;
+    mergeSort(nums, left, mid);
+    mergeSort(nums, mid + 1, right);
+    merge(nums, left, mid, right);
+  }
+
+  private void merge(int[] nums, int left, int mid, int right) {
+    int[] temp = new int[right - left + 1];
+    int l = left, r = mid + 1;
+    int i = 0;
+    while (l <= mid && r <= right) {
+      if (nums[l] <= nums[r]) {
+        temp[i++] = nums[l++];
+      } else {
+        temp[i++] = nums[r++];
+      }
+    }
+    while (l <= mid) {
+      temp[i++] = nums[l++];
+    }
+    while (r <= right) {
+      temp[i++] = nums[r++];
+    }
+    for (int j = left; j <= right; j++) {
+      nums[j] = temp[j - left];
+    }
+  }
+  // end::answer[]
+}