![](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbWipEs%2FbtsJek2JcMx%2FKFiNWJ40euKmcixxZiphUk%2Fimg.png)
[프로그래머스] 실패율 - JAVA
·
알고리즘
풀이import java.util.*;class Solution { public int[] solution(int N, int[] stages) { int[] answer = new int[N]; double[] noClearUser = new double[N]; double[] reachUser = new double[N]; HashMap map = new HashMap(); for (int i = 0; i = i+1) { reachUser[i]++; } } if (noClearUser[i] == 0.0 || reachUser[i] ==..