| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/codingOnGithub/interviews/master/leetcode/array/WiggleSort.java | [Back] [Original] |
// Given an unsorted array nums, reorder it in-place such that nums[0] = nums[2] nums[i])) {
nums[i - 1] = nums[i];
nums[i] = current;
}
}
}
}
| Web Proxy Viewer | New URL | Original Page |