class Solution { public void wiggleSort(int[] nums) { int[] temp = Arrays.copyOfRange(nums, 0, nums.length); Arrays.sort(temp); int large = temp.length / 2 + (temp.length % 2 == 0 ? -1 : 0); int small = temp.length - 1; for (int i = 0, j = 1; i < temp.length; i+=2, j+=2) { if(j < temp.length) nums[j] = temp[small--]; nums[i] = temp[large--]; } } }
leetcode324
猜你喜欢
转载自www.cnblogs.com/asenyang/p/9812876.html
今日推荐
周排行