From a887caa8e00ec8e66ec5c1135c13f90107e1c824 Mon Sep 17 00:00:00 2001
From: "huangge1199@hotmail.com" <huangge1199>
Date: Wed, 8 Sep 2021 21:30:11 +0800
Subject: [PATCH] =?UTF-8?q?324:=E6=91=86=E5=8A=A8=E6=8E=92=E5=BA=8F=20II?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../java/leetcode/editor/cn/WiggleSortIi.java | 68 +++++++++++++++++++
 .../editor/cn/doc/content/WiggleSortIi.md     | 35 ++++++++++
 2 files changed, 103 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/WiggleSortIi.java
 create mode 100644 src/main/java/leetcode/editor/cn/doc/content/WiggleSortIi.md

diff --git a/src/main/java/leetcode/editor/cn/WiggleSortIi.java b/src/main/java/leetcode/editor/cn/WiggleSortIi.java
new file mode 100644
index 0000000..9d9886d
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/WiggleSortIi.java
@@ -0,0 +1,68 @@
+//给你一个整数数组 nums，将它重新排列成 nums[0] < nums[1] > nums[2] < nums[3]... 的顺序。 
+//
+// 你可以假设所有输入数组都可以得到满足题目要求的结果。 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：nums = [1,5,1,1,6,4]
+//输出：[1,6,1,5,1,4]
+//解释：[1,4,1,5,1,6] 同样是符合题目要求的结果，可以被判题程序接受。
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：nums = [1,3,2,2,3,1]
+//输出：[2,3,1,3,1,2]
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= nums.length <= 5 * 10⁴ 
+// 0 <= nums[i] <= 5000 
+// 题目数据保证，对于给定的输入 nums ，总能产生满足题目要求的结果 
+// 
+//
+// 
+//
+// 进阶：你能用 O(n) 时间复杂度和 / 或原地 O(1) 额外空间来实现吗？ 
+// Related Topics 数组 分治 快速选择 排序 👍 276 👎 0
+
+package leetcode.editor.cn;
+
+import java.util.Arrays;
+
+//324:摆动排序 II
+class WiggleSortIi {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new WiggleSortIi().new Solution();
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public void wiggleSort(int[] nums) {
+            int[] temp = nums.clone();
+            Arrays.sort(temp);
+            int index = nums.length;
+            for (int i = 1; i < nums.length; i += 2) {
+                index--;
+                nums[i] = temp[index];
+            }
+            for (int i = 0; i < nums.length; i += 2) {
+                index--;
+                nums[i] = temp[index];
+            }
+        }
+    }
+
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/WiggleSortIi.md b/src/main/java/leetcode/editor/cn/doc/content/WiggleSortIi.md
new file mode 100644
index 0000000..3dc9514
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/WiggleSortIi.md
@@ -0,0 +1,35 @@
+<p>给你一个整数数组 <code>nums</code>，将它重新排列成 <code>nums[0] < nums[1] > nums[2] < nums[3]...</code> 的顺序。</p>
+
+<p>你可以假设所有输入数组都可以得到满足题目要求的结果。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,5,1,1,6,4]
+<strong>输出：</strong>[1,6,1,5,1,4]
+<strong>解释：</strong>[1,4,1,5,1,6] 同样是符合题目要求的结果，可以被判题程序接受。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,3,2,2,3,1]
+<strong>输出：</strong>[2,3,1,3,1,2]
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= nums.length <= 5 * 10<sup>4</sup></code></li>
+	<li><code>0 <= nums[i] <= 5000</code></li>
+	<li>题目数据保证，对于给定的输入 <code>nums</code> ，总能产生满足题目要求的结果</li>
+</ul>
+
+<p> </p>
+
+<p><strong>进阶：</strong>你能用 O(n) 时间复杂度和 / 或原地 O(1) 额外空间来实现吗？</p>
+<div><div>Related Topics</div><div><li>数组</li><li>分治</li><li>快速选择</li><li>排序</li></div></div><br><div><li>👍 276</li><li>👎 0</li></div>
\ No newline at end of file