takeU

const solution = (data, col, row_begin, row_end) => { return data .sort((a, b) => { const [x, y] = [a[col - 1], b[col - 1]]; return x !== y ? x - y : b[0] - a[0]; }) .slice(row_begin - 1, row_end) .map((row, i) => row.reduce((acc, cur) => acc + (cur % (row_begin + i)), 0)) .reduce((res, cur) => res ^ cur, 0);}배열 단순 가공

const solution = (k, ranges) => { const dp = [0], res = [] while (k > 1) { let next = k next = k % 2 ? 3 * next + 1 : k / 2 dp.push((dp.at(-1) ?? 0) + (k + next) / 2) k = next } const len = dp.length - 1 for (let range of ranges) { let [start, end] = range res.push(len + end 구간합 문제

const check = (hash, start, n) => { let count = 0 const queue = [start] const visited = Array(n).fill(0) visited[start] = 1 while (queue.length) { count += 1 const cur = queue.shift() for (let num of hash[cur]) { if (!visited[num]) { queue.push(num) visited[num] = 1 } } } return count}const solut..

const solution = (sequence, k) => { let [left, right, acc] = [0, 0, sequence[0]] const res = [] while (right a[0] - b[0] || a[1] - b[1])[0].slice(1)}투포인터

배포 설정.github/workflows/deploy.ymlname: Deploy on Pushon: push: branches: - main # main 브랜치에 푸시될 때 실행jobs: deploy: runs-on: ubuntu-latest steps: # 1. 리포지토리 체크아웃 / 저장소 코드를 워크플로 실행 환경에 복사하는 GitHub에서 제공하는 공식 액션 - name: Checkout repository uses: actions/checkout@v3 # 2. SSH 키 설정 및 서버에 접속하여 빌드 실행 - name: Deploy to server env: SSH_PRIVATE_KEY:..

bfsstart - [x, y, time]end - [x, y]board - 이차원 배열 (O - 이동 가능 / X - 불가능)visited - 방문 기록 (방문 확인 1 / 미방문 0)start에서 end까지 가는 시간 계산시작시간은 start의 세번째 인자 기준으로 도달하지 못하는 경우 -1const bfs = (start, end, board) => { const dx = [-1, 1, 0, 0] const dy = [0, 0, -1, 1] const visited = Array.from({ length: board.length }, () => Array(board[0].length).fill(0)) visited[start[0]][start[1]] = 1 const qu..

const bfs = (start, end, maps) => { const dx = [-1, 1, 0, 0] const dy = [0, 0, -1, 1] const visited = Array.from({ length: maps.length }, () => Array(maps[0].length).fill(0)) visited[start[0]][start[1]] = 1 const queue = [start] while (queue.length) { const [x, y, time] = queue.shift() for (let i = 0; i { let s, l, e for (let i = 0; i bfs -ㅠ-

const solution = (numbers) => { const stack = [[0, numbers[0]]], res = Array(numbers.length).fill(-1) for (let i = 1; i 스택

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..