leetcode wiggle-sort-ii(未完成)

public class Solution {
public void wiggleSort(int[] nums) {
int i=0;
for(i=0;i<=nums.length-3;i+=2)
{
int a=nums[i],b=nums[i+1],c=nums[i+2];
int temp=a;
if(a>b)
{
temp=a;
a=b;
b=temp;
}

if(b<c)
{
temp=c;
c=b;
b=temp;
}

nums[i]=a;
nums[i+1]=b;
nums[i+2]=c;

}

if(i+2==nums.length)//结尾有两个元素
{
int a=nums[i],b=nums[i+1];
int temp;
if(a>b)
{
temp=a;
a=b;
b=temp;
}
nums[i]=a;
nums[i+1]=b;
}
}
}

Input:
[1,2,2,1,2,1,1,1,1,2,2,2]
Output:
[1,2,1,2,1,2,1,1,1,2,2,2]