[Swift]LeetCode280. 擺動排序 $ Wiggle Sort
阿新 • • 發佈:2019-04-10
gles spa out wap [1] swap in-place urn leetcode
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].
給定一個未排序的數組nums,將其重新排序,使nums[0]<=nums[1]>=nums[2]<=nums[3]…
例如,給定nums=[3,5,2,1,6,4],一個可能的答案是[1,6,2,5,3,4]。
Solution
1 class Solution { 2 func wiggleSort(_ nums:inout [Int]) { 3 if nums.count <= 1 {return } 4 for i in 1..<nums.count 5 { 6 if (i % 2 == 1 && nums[i] < nums[i - 1]) || (i % 2 == 0 && nums[i] > nums[i - 1])7 { 8 nums.swapAt(i,i - 1) 9 } 10 } 11 } 12 }
點擊:Playground測試
1 var sol = Solution() 2 var arr:[Int] = [3,5,2,1,6,4] 3 sol.wiggleSort(&arr) 4 print(arr) 5 //Print [3, 5, 1, 6, 2, 4]
[Swift]LeetCode280. 擺動排序 $ Wiggle Sort