Merge pull request #528 from dongmin115/main

[임동민] 65차 라이브코테 제출

Author: github-actions[bot]

live6/test65/문제1/임동민.js

@@ -0,0 +1,64 @@
+const input = require('fs')
+    .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+    .toString()
+    .trim()
+    .split('\n')
+    .map(e => e.split(''));
+
+function solution() {
+    const board = input.slice(1);
+    let result= 0;
+
+    function getMaxCandy(){
+        let max = 0;
+
+        for(let i=0; i<board.length;i++){
+            let count = 1;
+            for(let j=0; j<board.length -1; j++){
+                if(board[i][j] === board[i][j+1]){
+                    count++;
+                } else {
+                    max = Math.max(max, count);
+                    count = 1;
+                }
+            }
+            max = Math.max(max, count);
+        }
+
+        for(let i=0; i<board.length;i++){
+            let count = 1;
+            for(let j=0; j<board.length -1; j++){
+                if(board[j][i] === board[j+1][i]){
+                    count++;
+                } else {
+                    max = Math.max(max, count);
+                    count = 1;
+                }
+            }
+            max = Math.max(max, count);
+        }
+
+        return max;
+    }
+
+    for(let i=0; i<board.length; i++){
+        for(let j=0; j<board.length; j++){
+            if(j+1 < board.length){
+                [board[i][j], board[i][j+1]] = [board[i][j+1], board[i][j]];
+                result = Math.max(result, getMaxCandy());
+                [board[i][j], board[i][j+1]] = [board[i][j+1], board[i][j]];
+            }
+
+            if(i+1 < board.length){
+                [board[i][j], board[i+1][j]] = [board[i+1][j], board[i][j]];
+                result = Math.max(result, getMaxCandy());
+                [board[i][j], board[i+1][j]] = [board[i+1][j], board[i][j]];
+            }
+        }
+    }
+
+    console.log(result);
+
+}
+
+solution();

live6/test65/문제2/임동민.js

@@ -0,0 +1,31 @@
+const input = require('fs')
+    .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+    .toString()
+    .trim()
+    .split('\n')
+    .map(e => e.split(' ').map(Number));
+
+function solution() {
+    const N = input[0][0];
+    const calendar = input.slice(1);
+    let max = 0;
+
+    function recursive(day,pay){
+        if(day > N){
+            max = Math.max(max, pay);
+            return;
+        }
+
+        recursive(day + 1, pay);
+
+        if(day + calendar[day-1][0] -1 <= N){
+            recursive(day + calendar[day-1][0], pay + calendar[day-1][1]);
+        }
+    }
+
+    recursive(1,0);
+
+    console.log(max);
+}
+
+solution();

live6/test65/문제3/임동민.js

@@ -0,0 +1,14 @@
+function solution(s)
+{
+    const stack = [];
+
+    for(let i=0; i<s.length; i++){
+        if(s[i] === stack[stack.length -1]){
+            stack.pop();
+        } else {
+            stack.push(s[i]);
+        }
+    }
+
+    return stack.length === 0 ? 1 : 0;
+}