From c196a9f0d3aeca07be94f5a1df8802e6749e699d Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Tue, 24 Jan 2023 21:32:29 +0900
Subject: [PATCH] =?UTF-8?q?updated=20at=202023.=201.=2024.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=209:32:30?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/아이템 줍기/solution.java | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/programmers/아이템 줍기/solution.java b/programmers/아이템 줍기/solution.java
index 75a82d5..3affac3 100644
--- a/programmers/아이템 줍기/solution.java	
+++ b/programmers/아이템 줍기/solution.java	
@@ -3,22 +3,22 @@
 import java.util.*;
 class Solution {
     public int solution(int[][] rectangle, int characterX, int characterY, int itemX, int itemY) {
-        int sX=characterX*2, sY=characterY*2, eX=itemX*2, eY=itemY*2, cnt = 0;
+        int sX=(characterX-1)*2, sY=(characterY-1)*2, eX=(itemX-1)*2, eY=(itemY-1)*2, cnt = 0;
         int[][] d = {{-1,0},{1,0},{0,-1},{0,1}};
-        boolean[][] map= new boolean[103][103];
+        boolean[][] map= new boolean[100][100];
         ArrayList<Integer> arrayList =new ArrayList<>();
         Stack<Integer[]> st = new Stack<>();
         
         for(int[] square:rectangle){
-            for(int i=square[0]*2;i<=square[2]*2;i++){
-                for(int j=square[1]*2;j<=square[3]*2;j++){
+            for(int i=(square[0]-1)*2;i<=(square[2]-1)*2;i++){
+                for(int j=(square[1]-1)*2;j<=(square[3]-1)*2;j++){
                     map[i][j]=true;
                 }  
             }
         }
         for(int[] square:rectangle){
-            for(int i=square[0]*2+1;i<square[2]*2;i++){
-                for(int j=square[1]*2+1;j<square[3]*2;j++){
+            for(int i=(square[0]-1)*2+1;i<(square[2]-1)*2;i++){
+                for(int j=(square[1]-1)*2+1;j<(square[3]-1)*2;j++){
                     map[i][j]=false;
                 }  
             }
@@ -31,7 +31,7 @@ class Solution {
             int x=pop[0], y=pop[1];
             if(x==eX&&y==eY) arrayList.add(cnt);   
             map[x][y]=false;
-            for(int f = 0; f < 4; f++) if(map[x+d[f][0]][y+d[f][1]]==true) st.add(new Integer[] {x+d[f][0],y+d[f][1]});
+            for(int f = 0; f < 4; f++) if(x+d[f][0] >= 0 && y+d[f][1] >= 0 && y+d[f][1] < map[0].length && x+d[f][0] < map.length && map[x+d[f][0]][y+d[f][1]]==true) st.add(new Integer[] {x+d[f][0],y+d[f][1]});
             cnt++;
         }
         arrayList.add(cnt);