takeU

function solution(line) { const spot = [] let [minX, maxX, minY, maxY] = [Infinity, -Infinity, Infinity, -Infinity] for (let i = 0; i maxX) maxX = x if (y maxY) maxY = y } } } } const res = Array.from({ length: maxY - minY + 1 }, () => Array(maxX - minX + 1).fill('.')) for (let [x, y] of spot) { res[y - minY][x - min..

const dx = [-1, 0, 1, 0]const dy = [0, -1, 0, 1] const dfs = (maps, visited, x, y, sum) => { visited[x][y] = 1 for (let i = 0; i { const res = [] const [x, y] = [maps.length, maps[0].length] const visited = Array.from({ length: x }, () => Array(y).fill(0)) for (let i = 0; i a - b) : [-1]}dfs

class MaxHeap { constructor() { this.heap = []; } getParentIndex(index) { return Math.floor((index - 1) / 2); } getLeftChildIndex(index) { return 2 * index + 1; } getRightChildIndex(index) { return 2 * index + 2; } swap(index1, index2) { [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]]; } insert(value) { this.heap.push(value); this.h..

const checkSquare = (board, x, y) => { const block = board[x][y] if (board[x + 1][y] === block && board[x][y + 1] === block && board[x + 1][y + 1] === block) return true return false}const checkTargetBlocks = (m, n, board) => { const targetBlocks = [] for (let i = 0; i { let count = 0 targetBlocks.forEach(([x, y]) => { board[x][y] = 'Xcur' board[..

const bfs = (land, visited, cur, i, j) => { const dx = [-1, 0, 1, 0] const dy = [0, -1, 0, 1] const queue = [[i, j]] let count = 0; while (queue.length) { const [x, y] = queue.shift() visited[x][y] = 1 land[x][y] = cur for (let k = 0; k { const visited = Array.from({ length: land.length }, () => Array(land[0].length).fill(0)); const amount = {} ..

const solution = (diffs, times, limit) => { let [left, right] = [1, diffs.reduce((acc, cur) => Math.max(acc, cur), 1)] while (left = diffs[i]) cur += times[i] else cur += (diffs[i] - check) * (times[i] + times[i - 1]) + times[i] } if (cur > limit) left = check + 1 else right = check } return left}이분탐색30만에서 Math.max는 런타임 에러유발 -ㅠ-

const timeToSeconds = (time) => { const [minutes, seconds] = time.split(':').map(Number); return minutes * 60 + seconds;}const secondsToTime = (seconds) => { const minutes = Math.floor(seconds / 60); const remainingSeconds = seconds % 60; return `${String(minutes).padStart(2, '0')}:${String(remainingSeconds).padStart(2, '0')}`;};const solution = (video_len, pos, op_start, op_end, ..

def dfs(cards, cur, visited, count): if not visited[cur]: visited[cur] = count return dfs(cards, cards[cur] - 1, visited, count) return def solution(cards): visited = [0] * len(cards) count = 1 for c in cards: if not visited[c - 1]: dfs(cards, c - 1, visited, count) count += 1 check = {} for v in visited: check[v] = check.get(v, 0) + 1 ans = sorted(list(check.values()), reverse=True) return ans[..

def solution(k, d): ans = 0 for i in range(0, d + 1, k): ans += int((d ** 2 - i ** 2) ** 0.5) // k + 1 return ans 수학

괄호 회전하기 ( Level 2 ) Programmers 월간 코드 챌린지 시즌2 ( JavaScript ) 문제 링크 나의 풀이 function solution(s) { let res = 0; for ( let i = 0; i < s.length; i++ ) { const arr = []; let str = s.slice(i) + s.slice(0,i) for ( let j = 0; j < str.length; j++ ) { switch ( str[j] ) { case '(': case '[': case '{': arr.push(str[j]) break; case ')': arr.slice(-1)[0] === '(' ? arr.pop() : arr.push(str[j]) break; case ']': ..