zumun/Coding-Practice
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

updated at 2023. 1. 24. 오후 9:32:30

Browse Source
This commit is contained in:
rl544
2023-01-24 21:32:29 +09:00
parent decf1b376c
commit c196a9f0d3
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
programmers/아이템 줍기/solution.java
+7 -7
View File
@@ -3,22 +3,22 @@
import java.util.*; import java.util.*;
class Solution { class Solution {
public int solution(int[][] rectangle, int characterX, int characterY, int itemX, int itemY) { 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}}; 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<>(); ArrayList<Integer> arrayList =new ArrayList<>();
Stack<Integer[]> st = new Stack<>(); Stack<Integer[]> st = new Stack<>();
for(int[] square:rectangle){ for(int[] square:rectangle){
for(int i=square[0]*2;i<=square[2]*2;i++){ for(int i=(square[0]-1)*2;i<=(square[2]-1)*2;i++){
for(int j=square[1]*2;j<=square[3]*2;j++){ for(int j=(square[1]-1)*2;j<=(square[3]-1)*2;j++){
map[i][j]=true; map[i][j]=true;
} }
} }
} }
for(int[] square:rectangle){ for(int[] square:rectangle){
for(int i=square[0]*2+1;i<square[2]*2;i++){ for(int i=(square[0]-1)*2+1;i<(square[2]-1)*2;i++){
for(int j=square[1]*2+1;j<square[3]*2;j++){ for(int j=(square[1]-1)*2+1;j<(square[3]-1)*2;j++){
map[i][j]=false; map[i][j]=false;
} }
} }
@@ -31,7 +31,7 @@ class Solution {
int x=pop[0], y=pop[1]; int x=pop[0], y=pop[1];
if(x==eX&&y==eY) arrayList.add(cnt); if(x==eX&&y==eY) arrayList.add(cnt);
map[x][y]=false; 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++; cnt++;
} }
arrayList.add(cnt); arrayList.add(cnt);