From 83023ab0ae85629768e374ef23a7284ae3b95327 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Fri, 16 Dec 2022 00:39:13 +0900
Subject: [PATCH] =?UTF-8?q?updated=20at=202022.=2012.=2016.=20=EC=98=A4?=
 =?UTF-8?q?=EC=A0=84=2012:39:12?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/체육복/solution.java | 16 +++-------------
 1 file changed, 3 insertions(+), 13 deletions(-)

diff --git a/programmers/체육복/solution.java b/programmers/체육복/solution.java
index 83c8cb1..75c3071 100644
--- a/programmers/체육복/solution.java
+++ b/programmers/체육복/solution.java
@@ -1,4 +1,4 @@
-// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/42862#
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/42862
 
 import java.util.HashMap;
 import java.util.ArrayList;
@@ -7,14 +7,11 @@ class Solution {
         for(int i : list){
             int c = ha.get(i);
             if(c == 0) {
-                System.out.println("00"+i+" : "+c);
                 if (i < n && ha.get(i+1) == 2){
                     ha.put(i+1,1);
-                    System.out.println(i+1+" : "+1);
                     ha.put(i, 1);
                 } else if(i > 1 && ha.get(i-1) == 2) {
                     ha.put(i-1,1);
-                    System.out.println(i-1+" : "+1);
                     ha.put(i, 1);
                 }
             }
@@ -27,7 +24,6 @@ class Solution {
         ArrayList<Integer> lab = new ArrayList<>();
         for(int i = 1; i <= n; i++){
             ha.put(i,1);
-            System.out.println(i);
         }
         for(int i : lost){
             ha.put(i, ha.get(i)-1);
@@ -37,30 +33,24 @@ class Solution {
             ha.put(i, c+1);
         }
         for(int i : lost){
-            System.out.println("TestOn");
             if(ha.get(i) == 1) {
-                System.out.println("breaked by 1 and i = "+i);
                 continue;
             }
             int count = 0;
             for(int j : reserve){
                 if(Math.abs(i-j)==1) count += ha.get(j);
             }
-            System.out.println(i+" cou"+count);
             if(count >= 4) {
                 lab.add(i);
             } else if(count >= 1){
                 laa.add(i);
             }
         }
-        System.out.println(lab);
-        System.out.println(laa);
         rl(laa, ha, n);
         rl(lab, ha, n);
         for(int i = 1; i <= n; i++){
-            answer += (ha.get(i) > 0) ? 0 : 1;
-            System.out.println(i+" : "+ha.get(i));
+            answer += (ha.get(i) > 0) ? 1 : 0;
         }
-        return n - answer;
+        return answer;
     }
 }
\ No newline at end of file