【LeetCode】280.Wiggle Sort (Medium)(带锁题)解题报告
2018-02-27 19:44
609 查看
【LeetCode】280.Wiggle Sort (Medium)(带锁题)解题报告
题目地址: https://leetcode.com/problems/wiggle-sort/
题目描述:
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]….
For example, given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4].
摇摆序列。奇数位在波峰。
Solution:
Date:2018年2月27日
题目地址: https://leetcode.com/problems/wiggle-sort/
题目描述:
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]….
For example, given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4].
摇摆序列。奇数位在波峰。
Solution:
//time : O(n) //space : O(1) class Solution { public void wiggleSort(int[] nums) { for(int i=1 ; i<nums.length ; i++){ if(i%2==0 && nums[i]<nums[i-1] ||i%2==0 && nums[i]>nums[i-1]){ int temp = nums[i-1]; nums[i-1] = nums[i]; nums[i] = temp; } }
Date:2018年2月27日
相关文章推荐
- 【LeetCode】324.Wiggle Sort II(Medium)解题报告
- 【LeetCode】75.Sort Colors(Medium)解题报告
- Leetcode Insertion Sort List 解题报告
- 【LeetCode】Sort Colors 解题报告
- LeetCode解题报告 413. Arithmetic Slices [medium]
- 【LeetCode】144. Binary Tree Preorder Traversal(Medium)解题报告
- 【LeetCode】103. Binary Tree Zigzag Level Order Traversal(Medium)解题报告
- LeetCode解题报告 53. Maximum Subarray [medium]
- 【LeetCode】449.Serialize and Deserialize BST(Medium)解题报告
- 【LeetCode】648.Replace Words(Medium)解题报告
- [Leetcode] 75. Sort Colors 解题报告
- 【LeetCode】117.Populating Next Right Pointers in Each Node II(Medium)解题报告
- 【LeetCode】56.Merge Intervals(Medium)解题报告
- 【LeetCode】78.Subsets(Medium)解题报告
- LeetCode解题报告 96. Unique Binary Search Trees [medium]
- 【LeetCode】320.Generalized Abbreviation(Medium)解题报告
- LeetCode解题报告 108. Convert Sorted Array to Binary Search Tree [medium]
- 【LeetCode】11.Container With Most Water(Medium)解题报告
- 【LeetCode】94.Binary Tree Inorder Traversal(Medium)解题报告
- Leetcode Insertion Sort List 解题报告