비트교육_단기과정
알고리즘 3번 : 마기창
ELpsy
2022. 7. 12. 13:10
package week_4; import java.util.*; public class ThirdExam { public static void main(String[] args) { Scanner sc = new Scanner(System.in); input(sc); } public static void input(Scanner sc) { List<Integer> list = new ArrayList<>(); while (list.size() < 6) {// 값 입력 list.add(sc.nextInt()); } filter(list); } public static void filter(List<Integer> list) { Collections.sort(list); int runCount = 0; for (int i = 0; i < list.size(); i++) { loop: for (int j = i + 1; j < list.size(); j++) { if (list.get(i) + 1 == list.get(j)) { // 뒤의 숫자가 더 클경유 for (int k = j + 1; k < list.size(); k++) { if (list.get(j) + 1 == list.get(k)) { list.remove(k); list.remove(j); list.remove(i); i = -1; runCount++; break loop; } } } } } int[] arr = new int[10]; // 0~9 중에서 겹치는 숫자를 카운트 한 값을 넣을 배열 선언 int tripleCount = 0; for (int i = 0; i < arr.length; i++) {// 10 for (int j = 0; j < list.size(); j++) {// 6 if (i == list.get(j)) { arr[i]++; if (arr[i] == 3 || arr[i] == 6) { tripleCount++; } } } } if (tripleCount == 2 || runCount + tripleCount == 2 || runCount == 2) System.out.println("baby-gin"); else if (tripleCount == 1) { System.out.println("triplete"); } else if (runCount == 1) { System.out.println("run"); } else { System.out.println("해당없음"); } } } | cs |