leetcode 280: Wiggle Sort
来源:互联网 发布:淘宝进货网一件代发 编辑:程序博客网 时间:2024/05/06 12:16
Wiggle Sort
Total Accepted: 1291 Total Submissions: 3008 Difficulty: Medium
Given an unsorted array nums
, reorder it in-place such thatnums[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]
.
[思路]
greedy即可.
public class Solution {public void wiggleSort(int[] nums) { if(nums==null || nums.length<2) return; for(int i=1; i<nums.length; i++) { if( (i%2==1 && (nums[i] < nums[i-1])) || (i%2==0) && (nums[i] > nums[i-1])) { int temp = nums[i]; nums[i] = nums[i-1]; nums[i-1] = temp; } } }}
0 0
- leetcode 280: Wiggle Sort
- Leetcode 280: Wiggle Sort
- [leetcode 280] Wiggle Sort
- leetcode 280: Wiggle Sort
- Leetcode 280 Wiggle Sort
- Leetcode Wiggle Sort and Wiggle Sort II
- Leetcode: Wiggle Sort
- [Leetcode]Wiggle Sort
- *LeetCode-Wiggle Sort
- [LeetCode] Wiggle Sort
- leetcode Wiggle Sort II
- LeetCode Wiggle Sort II
- leetcode Wiggle Sort II
- Leetcode Wiggle Sort II
- Leetcode Wiggle Sort
- leetcode笔记:Wiggle Sort
- LeetCode 280. Wiggle Sort
- leetcode Wiggle Sort
- C++拷贝构造函数详解
- 挂掉的行程
- C++ 的构造/析构/赋值/拷贝函数比较
- 看图知“财经热点”,和讯“词云新闻”上线内测!
- map 泛型
- leetcode 280: Wiggle Sort
- swift语言基础:UIView视图,CGRect,UIColor
- Cocos2d-x学习(一) Cocos2d-x2.2.6安装前准备
- Openstack swift对象存储
- hdu1713-相遇周期
- C++学习篇——构造函数与析构函数
- 算法 练习1.3
- frame框架
- 技术面试(C++)