Created
October 13, 2016 09:04
-
-
Save mahya8585/ba7436d4726d49d943d0354aae91f3fb to your computer and use it in GitHub Desktop.
LT順決めるときに便利なツール
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.ArrayList; | |
| import java.util.Collections; | |
| import java.util.List; | |
| /** | |
| * Created by user on 2016/09/01. | |
| */ | |
| public class SortLt { | |
| public static void main (String...args) { | |
| //発表者リスト作成 | |
| List<String> names = makeNameList(); | |
| //2回目以降はこちらを実行すること(値も設定してね) | |
| //List<Integer> numbsers = makeLtNum(); | |
| //1回目はこちら | |
| List<Integer> numbers = makeAllNum(10); | |
| execFillInTheBlank(names, numbers); | |
| } | |
| /** | |
| * 登壇者リスト | |
| * @return | |
| */ | |
| private static List<String> makeNameList() { | |
| List<String> names = new ArrayList<>(); | |
| names.add("nameA"); | |
| names.add("nameB"); | |
| names.add("nameC"); | |
| names.add("nameD"); | |
| names.add("nameE"); | |
| return names; | |
| } | |
| /** | |
| * 2回目以降穴埋めしたい場合に使います | |
| * @return | |
| */ | |
| private static List<Integer> makeLtNum() { | |
| List<Integer> numbers = new ArrayList<>(); | |
| numbers.add(2); | |
| numbers.add(3); | |
| numbers.add(5); | |
| numbers.add(6); | |
| numbers.add(10); | |
| return numbers; | |
| } | |
| /** | |
| * 最初の一回目 | |
| * @param max | |
| * @return | |
| */ | |
| private static List<Integer> makeAllNum(int max) { | |
| List<Integer> numbers = new ArrayList<>(); | |
| for (int i = 1; i <= max; i++) { | |
| numbers.add(i); | |
| } | |
| return numbers; | |
| } | |
| private static void execFillInTheBlank(List<String> names, List<Integer> numbsers) { | |
| for (String name : names) { | |
| Collections.shuffle(numbsers); | |
| System.out.println(name + " : " + numbsers.get(0)); | |
| numbsers.remove(0); | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment