A10:摆动排序

1 import java.util.Arrays;
2
3 /**
4 * Created by Tutotu on 2017/2/25.
5 *

6 * Realname:yangmingzhu
7 *

8 * Tel:18511400217
9 *

10 * Email:yangmingzhu921025&＃64;hotmail.com
11 */
12
13 public class Solution10 {
14 /**
15 * &＃64;param nums a list of integer
16 * &＃64;return void
17 */
18 public void wiggleSort(int[] nums) {
19 // Write your code here
20 Arrays.sort(nums);
21 int refer &＃61; nums.length/2&＃43;1;
22 crossArray(nums,refer);
23 }
24
25
26 public void crossArray(int[] nums, int media){
27 int i &＃61; 1;
28 while(media < nums.length){
29 int temp &＃61; nums[media];
30 for(int j&＃61;media-1; j>i; j--){
31 nums[j&＃43;1] &＃61; nums[j];
32 }
33 nums[i] &＃61; temp;
34 i &＃61; i&＃43;2;
35 }
36
37 }
38
39 }