rockettttman

BFS (breadth first search) Input: root = [3,9,20,null,null,15,7] Output: [[3],[20,9],[15,7]] /** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right===undefined ? null : right) * } */ /** * @param {TreeNode} root * @return {number[][]} */ var zigzagLevelOrder = f..

JS heap priority queue - javascript 로 heap 우선순위 큐 알고리즘 풀이 /** * @param {number[]} nums * @param {number} k * @return {number} */ var findKthLargest = function(nums, k) { if(nums.length == 1) { return nums[0]; } //k가 1일 때 nums Array에서 바로 max값 return if(k === 1) { var maxNum = 0; return nums.reduce((bef, cur) => { console.log(bef + ", " + cur) return max = Math.max(maxNum, bef, cur) }); } var queu..