新建 文本文档 (2).txt

来自「约瑟夫圈问题」· 文本 代码 · 共 35 行

package day03.tarena.com;

public class WhoolTest {
        public static void main(String[] args) {
                int []a=new int [12];
                for (int i = 0; i < a.length; i++) {
                        a=i+1;
                }
                int s=3;
                int count=0;
                int count1=0;
         loop:for (int j = 0; j < a.length; j++) {
                        for (int i = 0; i < a.length; i++) {
                                if (i==a.length) {
                                        i=-1;
                                }
                                if (a!=0) {
                                        count++;
                                }
                                if (count==s) {
                                        System.out.println(a);
                                        count1++;
                                        a=0;
                                        count=0;
                                }
                                if (count1==a.length) {
                                        break loop;
//                                        break;
                                }
                        }
                }
        }
        

}