约瑟夫环算法Java实现代码
发布时间:2020-12-15 00:18:21 所属栏目:Java 来源:网络整理
导读:今天PHP站长网 52php.cn把收集自互联网的代码分享给大家,仅供参考。 private void myJosf(int teamLength,int baoshu) { int[] team = new int[teamLength]; for (int n = 1; n teamLength + 1; n++) { team[n - 1] = n;
以下代码由PHP站长网 52php.cn收集自互联网 现在PHP站长网小编把它分享给大家,仅供参考 private void myJosf(int teamLength,int baoshu) { int[] team = new int[teamLength]; for (int n = 1; n < teamLength + 1; n++) { team[n - 1] = n; } int index = 0; for (int n = 0; n < teamLength; n++) { for (int k = 0; k < baoshu;) { if (index > teamLength - 1) { index = 0; } if (team[index] > 0) { if ((k + 1) % baoshu == 0) { System.out.println(index + 1); team[index] = 0; } k++; } index++; } } } 文艺求解: public void josephCircle(int n,int k) { int flag = 0; boolean[] kick = new boolean[n]; // set kick flag to False; for (int i = 0; i < n - 1; i++) { kick[flag] = false; } int counter = 0; int accumulate = 0; while (true) { if (!kick[flag]) { accumulate++; if (counter == n - 1) { System.out.println("kick last person====" + (flag + 1)); break; } if (accumulate == k) { kick[flag] = true; System.out.println("kick person====" + (flag + 1)); accumulate = 0; counter++; } } flag = (flag + 1) % n; } } 以上内容由PHP站长网【52php.cn】收集整理供大家参考研究 如果以上内容对您有帮助,欢迎收藏、点赞、推荐、分享。 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |