Java求解约瑟夫环问题：求问下列做法怎么简化

emmm我写的太复杂诡异了，求问如何修改：

public class Josephus {
void su(int []a) {
int start=0;
int distance=5;
int kill=0;
int s=a.length;
kill=(start+distance-1)%s;
int count=0;
int []re=new int[a.length-1];
while(s>1){
re[count]=a[kill];
for(int j=kill;j<s-1;j++) {
a[j]=a[j+1];
}
kill=(kill+distance-1)%(s-1);
s=s-1;
count++;
}
for(int i=0;i<re.length;i++) {
System.out.print(re[i]+" ");
}
}
public static void main(String[] args) {
Josephus JO=new Josephus();
int[]s=new int[] {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17};
JO.su(s);
}
}