Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Time Complexity: O(n)
- Space Complexity: O(1)
- */
- 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 == 0 && nums[i-1] < nums[i]) || (i % 2 == 1 && nums[i-1] > nums[i])) {
- // swap(nums, i-1, i);
- int temp = nums[i-1];
- nums[i-1] = nums[i];
- nums[i] = temp;
- // } else if (i % 2 == 1 && nums[i-1] > nums[i]) {
- // swap(nums, i-1, i);
- }
- }
- }
- // private void swap(int[] nums, int a, int b) {
- // int temp = nums[a];
- // nums[a] = nums[b];
- // nums[b] = temp;
- // }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement