From df0fe8d4e4309ab8c080723cd7ba2ca7bc5c52ab Mon Sep 17 00:00:00 2001 From: jungmyunggi Date: Thu, 26 Dec 2024 22:36:59 +0900 Subject: [PATCH 1/2] [Leetcode - Easy] Maximum Average Subarray I --- jungmyunggi/Maximum Average Subarray i.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 jungmyunggi/Maximum Average Subarray i.js diff --git a/jungmyunggi/Maximum Average Subarray i.js b/jungmyunggi/Maximum Average Subarray i.js new file mode 100644 index 0000000..52b0967 --- /dev/null +++ b/jungmyunggi/Maximum Average Subarray i.js @@ -0,0 +1,16 @@ +function findMaxAverage(nums, k) { + let max = -Infinity; + let temp = 0; + + for (let i = 0; i < k; i++) { + temp += nums[i]; + } + max = temp; + + for (let i = k; i < nums.length; i++) { + temp = temp - nums[i-k] + nums[i]; + max = Math.max(max,temp) + } + + return max/k; +} \ No newline at end of file From afe702313ae5d2c563b2969df46fbcff66c59557 Mon Sep 17 00:00:00 2001 From: jungmyunggi Date: Fri, 27 Dec 2024 23:27:43 +0900 Subject: [PATCH 2/2] [Leetcode - Easy] Path sum --- jungmyunggi/Path Sum.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 jungmyunggi/Path Sum.js diff --git a/jungmyunggi/Path Sum.js b/jungmyunggi/Path Sum.js new file mode 100644 index 0000000..3af5132 --- /dev/null +++ b/jungmyunggi/Path Sum.js @@ -0,0 +1,21 @@ +/** + * 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 + * @param {number} targetSum + * @return {boolean} + */ +var hasPathSum = function(root, targetSum) { + if(!root) return false; + if(!root.left && !root.right){ + return root.val === targetSum; + } + return hasPathSum(root.left, targetSum-root.val)||hasPathSum(root.right, targetSum-root.val); + +}; \ No newline at end of file