solve(n진수게임, 파일명정렬, 압축, 프렌즈4블록): jio_230904

jio/week26/n진수게임.java

@@ -0,0 +1,36 @@
+package week26;
+
+import java.util.*;
+
+class n진수게임 {
+    public String solution(int n, int t, int m, int p) {
+        StringBuilder answer = new StringBuilder();
+
+        char[] nums = makeTotalNums(n, t, m).toCharArray();
+
+        int cnt = 0;
+        int idx = 0;
+
+        for(int i=0; i<nums.length; i+=m) {
+            if(cnt == t) {
+                break;
+            }
+
+            idx = i + p - 1;
+            answer.append(Character.toUpperCase(nums[idx]));
+            cnt++;
+        }
+
+        return answer.toString();
+    }
+
+    private static String makeTotalNums(int n, int t, int m) {
+        StringBuilder totalNums = new StringBuilder();
+
+        for(int i = 0; i <= m*t; i++) {
+            totalNums.append(Integer.toString(i, n));
+        }
+
+        return totalNums.toString();
+    }
+}

jio/week26/파일명정렬.java

@@ -0,0 +1,93 @@
+package week26;
+
+import java.util.*;
+
+class 파일명정렬 {
+    static int numberStartIdx;
+
+    static class Word {
+        String str;
+        int idx;
+
+        public Word(String str, int idx) {
+            this.str = str;
+            this.idx = idx;
+        }
+    }
+
+    public String[] solution(String[] files) {
+        PriorityQueue<Word> pque = new PriorityQueue<Word>((firstWord, secondWord) -> {
+            String first = firstWord.str;
+            String second = secondWord.str;
+
+            String firstHead = findHead(first);
+            int firstNumber = Integer.parseInt(findNumber(first));
+
+            String secondHead = findHead(second);
+            int secondNumber = Integer.parseInt(findNumber(second));
+
+            if(!firstHead.equals(secondHead)) {
+                return firstHead.compareTo(secondHead);
+            }
+
+            if(firstNumber != secondNumber) {
+                return Integer.compare(firstNumber, secondNumber);
+            }
+
+            return Integer.compare(firstWord.idx, secondWord.idx);
+        });
+
+        for(int i=0; i<files.length; i++) {
+            pque.offer(new Word(files[i], i));
+        }
+
+        String[] answer = new String[files.length];
+        int idx = 0;
+
+        while(!pque.isEmpty()) {
+            answer[idx++] = pque.poll().str;
+        }
+
+        return answer;
+    }
+
+    private static String findHead(String str) {
+        StringBuilder sb = new StringBuilder();
+
+        for(int i=0; i<str.length(); i++) {
+            Character cur = str.charAt(i);
+
+            if(isNum(cur)) {
+                numberStartIdx = i;
+                break;
+            }
+
+            sb.append(Character.toUpperCase(cur));
+        }
+
+        return sb.toString();
+    }
+
+    private static String findNumber(String str) {
+        StringBuilder sb = new StringBuilder();
+        int cnt = 0;
+
+        for(int i=numberStartIdx; i<str.length(); i++) {
+            Character cur = str.charAt(i);
+
+            if(!isNum(cur) || cnt == 5) { // 숫자가 아니거나 5개 초과일 경우
+                break;
+            }
+
+            sb.append(cur);
+            cnt++;
+        }
+
+        return sb.toString();
+    }
+
+    private static boolean isNum(Character c) {
+        return c >= '0' && c <= '9';
+    }
+
+}

jio/week27/압축.java

@@ -0,0 +1,68 @@
+package week27;
+
+import java.io.*;
+import java.util.*;
+
+class 압축 {
+    static Map<String, Integer> words;
+    static List<Integer> answer;
+
+    public int[] solution(String msg) {
+        words = new HashMap<>();
+        answer = new ArrayList<>();
+
+        makeDict();
+
+        char[] msgArr = msg.toCharArray();
+        boolean isLast = false;
+
+        for(int i=0; i<msgArr.length; i++) {
+            StringBuilder sb = new StringBuilder();
+            sb.append(msgArr[i]);
+
+            if(i == msgArr.length - 1) { // 시작 위치가 마지막 인덱스에 도달한 경우
+                answer.add(words.get(String.valueOf(msgArr[i])));
+                break;
+            }
+
+            int cnt = 0; // 늘린 글자 수
+            for(int j=i+1; j<msgArr.length; j++) { // 한 글자씩 늘려가며 사전에 있는 단어인지 확인
+                sb.append(msgArr[j]);
+                String now = sb.toString();
+
+                if(!words.containsKey(now)) { // 사전에 없는 단어인 경우
+                    words.put(now, words.size() + 1);
+                    answer.add(words.get(now.substring(0, now.length() - 1)));
+                    break;
+                }
+
+                if(j == msgArr.length - 1) { // 한 글자씩 늘려가다 마지막 문자에 도달한 경우
+                    isLast = true;
+                }
+
+                cnt++;
+            }
+
+            if(isLast) { // 한 글자씩 늘려가다 마지막 문자에 도달한 경우 "시작 지점 ~ 마지막 글자"를 answer에 추가
+                answer.add(words.get(sb.toString()));
+            }
+
+            i += cnt; // 늘린 글자 수 만큼 다음 탐색 시작 위치 조정
+        }
+
+        return answer.stream().mapToInt(i -> i).toArray();
+    }
+
+    private static void makeDict() { // 사전 초기화
+        char cur = 'A';
+        int idx = 1;
+        while(true) {
+            words.put(String.valueOf(cur), idx);
+            if(cur == 'Z') {
+                break;
+            }
+            cur++;
+            idx++;
+        }
+    }
+}

jio/week27/프렌즈4블록.java

@@ -0,0 +1,112 @@
+package week27;
+
+import java.util.*;
+
+class 프렌즈4블록 {
+
+    static char[][] grid;
+    static boolean[][] bombGrid;
+    static int[] dx = {0, 0, 1, 1};
+    static int[] dy = {0, 1, 1, 0};
+    static int m, n;
+
+    public int solution(int M, int N, String[] board) {
+        m = M;
+        n = N;
+
+        grid = new char[m][n];
+
+        for(int x=0; x < board.length; x++) {
+            for(int y=0; y < board[x].length(); y++) {
+                grid[x][y] = board[x].charAt(y);
+            }
+        }
+
+        int totalBomb = 0;
+        int cnt = 0;
+
+        while(true) {
+            bombGrid = new boolean[m][n];
+            int bombCnt = checkBomb();
+
+            if(bombCnt == 0) { // 더 이상 폭탄이 존재 하지 않는 경우
+                break;
+            }
+
+            totalBomb += bombCnt;
+
+            bomb();
+
+            cnt++;
+        }
+
+
+        return totalBomb;
+    }
+
+    private static int checkBomb() { // 폭탄 체크
+        for(int x=0; x<m-1; x++) {
+            for(int y=0; y<n-1; y++) {
+                char cur = grid[x][y];
+
+                if(cur < 'A' || cur > 'Z') {
+                    continue;
+                }
+
+                int cnt = 1;
+
+                for(int dir=1; dir < 4; dir++) {
+                    int nx = x + dx[dir];
+                    int ny = y + dy[dir];
+
+                    if(grid[nx][ny] == cur) {
+                        cnt++;
+                    }
+                }
+
+                if(cnt == 4) {
+                    for(int dir=0; dir < 4; dir++) {
+                        int nx = x + dx[dir];
+                        int ny = y + dy[dir];
+
+                        bombGrid[nx][ny] = true;
+                    }
+                }
+            }
+        }
+
+        return countBomb();
+    }
+
+    private static int countBomb() { // 폭탄 개수 확인
+        int count = 0;
+
+        for(int x=0; x<m; x++) {
+            for(int y=0; y<n; y++) {
+                if(bombGrid[x][y]) {
+                    count++;
+                }
+            }
+        }
+
+        return count;
+    }
+
+    private static void bomb() { // 폭탄을 터뜨리고 중력 작용
+        char[][] newGrid = new char[m][n];
+
+        for(int y=0; y<n; y++) {
+            int idx = m-1;
+            for(int x=m-1; x>-1; x--) {
+                if(bombGrid[x][y]) {
+                    continue;
+                }
+
+                newGrid[idx][y] = grid[x][y];
+                idx--;
+            }
+        }
+
+        grid = newGrid;
+    }
+}