Leetcode 324.摆动排序II

摆动 排序II

给定一个无序的数组 nums，将它重新排列成 nums[0] < nums[1] > nums[2] < nums[3]... 的顺序。

示例 1:

输入: nums = [1, 5, 1, 1, 6, 4]

输出: 一个可能的答案是 [1, 4, 1, 5, 1, 6]

示例 2:

输入: nums = [1, 3, 2, 2, 3, 1]

输出: 一个可能的答案是 [2, 3, 1, 3, 1, 2]

说明:
你可以假设所有输入都会得到有效的结果。

进阶:
你能用 O(n) 时间复杂度和 / 或原地 O(1) 额外空间来实现吗？

先对nums排序，copy为nums的拷贝。
将copy的右半部分放入nums中以1开始，间隔为2的位置
将copy的左半部分放入nums中以0开始，间隔为2的位置
注意，两次操作都为逆序。否则，由于nums中间的元素相等会出错

 import java.util.Arrays;

 class Solution {

     public void wiggleSort(int[] nums) {

         Arrays.sort(nums);

         int[] copy = nums.clone();

         int index = 1;

         for (int i = nums.length - 1; i > (nums.length - 1) / 2; i--) {

             nums[index] = copy[i];

             index += 2;

         }

         index = 0;

         for (int i = (nums.length - 1) / 2; i >= 0; i--) {

             nums[index] = copy[i];

             index += 2;

         }

     }

 }

Leetcode 324.摆动排序II的相关教程结束。

《Leetcode 324.摆动排序II.doc》

下载本文的Word格式文档，以方便收藏与打印。

相关推荐

【LeetCode OJ】Recover Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/recover-binary-search-tree/ We know that the inorder traversal of a binary search tree should be a sorted array. Therefore, we can compare each node w...
2023-08-01编程代码leetcode,oj,recover
【LeetCode OJ】Validate Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/validate-binary-search-tree/ We inorder-traverse the tree, and for each node we check if current_node.val > prev_node.val. The code is as follows. ...
2023-08-01编程代码leetcode,oj,validate
【LeetCode OJ】Binary Tree Level Order Traversal

Problem Link: https://oj.leetcode.com/problems/binary-tree-level-order-traversal/ Traverse the tree level by level using BFS method. # Definition for a binary tree node # class TreeNode: # def...
2023-08-01编程代码Binary,leetcode,oj
【LeetCode OJ】Symmetric Tree

Problem Link: https://oj.leetcode.com/problems/symmetric-tree/ To solve the problem, we can traverse the tree level by level. For each level, we construct an array of values of the length 2^depth, ...
2023-08-01编程代码leetcode,oj,tree
【LeetCode OJ】Same Tree

Problem Link: https://oj.leetcode.com/problems/same-tree/ The following recursive version is accepted but the iterative one is not accepted... # Definition for a binary tree node # class TreeNode:...
2023-08-01编程代码leetcode,oj,tree
[LeetCode] 242. 有效的字母异位词 valid-anagram(排序）

注意这里字母异位词的定义是：字母类别及个数都要一样，只是排列顺序不同。 class Solution(object): def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: ...
2023-08-01编程代码字母,异位,排序
Leetcode 242.有效的字母异位词(Python3)

题目：给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s =...
2023-08-01编程代码leetcode,字母,异位
Leetcode 242.有效的字母异位词 By Python

给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s = "rat", t = "car&...
2023-08-01编程代码leetcode,字母,异位