From 28b2ead3ddbf76125467bc9e969e21844e7528a0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Apr 2021 09:21:27 +0800 Subject: [PATCH 0001/2039] Update 60-permutation-sequence.js --- 60-permutation-sequence.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/60-permutation-sequence.js b/60-permutation-sequence.js index 5cd3a8fe..a39e485e 100644 --- a/60-permutation-sequence.js +++ b/60-permutation-sequence.js @@ -19,3 +19,37 @@ const getPermutation = function (n, k) { } return sb } + +// another + +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +const getPermutation = function(n, k) { + let pos = 0 + const numbers = [] + const factorial = Array(n + 1).fill(0) + let str = '' + + let sum = 1 + factorial[0] = 1 + + for(let i = 1; i <= n; i++) { + sum *= i + factorial[i] = sum + } + for(let i = 1; i <= n; i++) { + numbers.push(i) + } + k-- + for(let i = 1; i <= n; i++) { + const idx = ~~(k / factorial[n - i]) + str += numbers[idx] + numbers.splice(idx, 1) + k -= idx * factorial[n - i] + } + + return str +}; From b16c8f51add89e77bdb8ad4b867861c82bb7d3d6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Apr 2021 09:53:47 +0800 Subject: [PATCH 0002/2039] Update 60-permutation-sequence.js --- 60-permutation-sequence.js | 22 +++++++++------------- 1 file changed, 9 insertions(+), 13 deletions(-) diff --git a/60-permutation-sequence.js b/60-permutation-sequence.js index a39e485e..9711d3d2 100644 --- a/60-permutation-sequence.js +++ b/60-permutation-sequence.js @@ -28,28 +28,24 @@ const getPermutation = function (n, k) { * @return {string} */ const getPermutation = function(n, k) { - let pos = 0 - const numbers = [] - const factorial = Array(n + 1).fill(0) - let str = '' - - let sum = 1 + const factorial = [] + const nums = [] + let res = '' factorial[0] = 1 - - for(let i = 1; i <= n; i++) { + for(let i = 1, sum = 1; i <= n; i++) { sum *= i factorial[i] = sum } for(let i = 1; i <= n; i++) { - numbers.push(i) + nums.push(i) } k-- - for(let i = 1; i <= n; i++) { + for(let i = 0; i <= n; i++) { const idx = ~~(k / factorial[n - i]) - str += numbers[idx] - numbers.splice(idx, 1) + res += nums[idx] + nums.splice(idx, 1) k -= idx * factorial[n - i] } - return str + return res }; From 7e5b79b857e3bd0bd653dca65e738fb93df02e68 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Apr 2021 14:04:03 +0800 Subject: [PATCH 0003/2039] Update 226-invert-binary-tree.js --- 226-invert-binary-tree.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/226-invert-binary-tree.js b/226-invert-binary-tree.js index 311f4a05..60a57563 100644 --- a/226-invert-binary-tree.js +++ b/226-invert-binary-tree.js @@ -48,3 +48,25 @@ const invertTree = function (root) { } return root } + +// anoother + +/** + * 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 {TreeNode} + */ +const invertTree = function(root) { + if(root == null) return root + let tmp = root.left + root.left = invertTree(root.right) + root.right = invertTree(tmp) + return root +}; From 5b3180c62090753da8b6a1a29c3350fec38bdda7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Apr 2021 11:33:34 +0800 Subject: [PATCH 0004/2039] Create 1830-minimum-number-of-operations-to-make-string-sorted.js --- ...ber-of-operations-to-make-string-sorted.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 1830-minimum-number-of-operations-to-make-string-sorted.js diff --git a/1830-minimum-number-of-operations-to-make-string-sorted.js b/1830-minimum-number-of-operations-to-make-string-sorted.js new file mode 100644 index 00000000..e7808cbd --- /dev/null +++ b/1830-minimum-number-of-operations-to-make-string-sorted.js @@ -0,0 +1,40 @@ +/** + * @param {string} s + * @return {number} + */ +const makeStringSorted = function (s) { + const mod = BigInt(10 ** 9 + 7), + n = s.length + const a = 'a'.charCodeAt(0) + let ans = 0n + const freq = Array(26).fill(0n) + for (let c of s) { + freq[c.charCodeAt(0) - a]++ + } + const fact = Array(n + 1).fill(1n) + for (let i = 1n; i <= n; i++) { + fact[i] = (fact[i - 1n] * i) % mod + } + let l = n + for (let c of s) { + l-- + let t = 0n, + rev = 1n + for (let i = 0; i < 26; i++) { + if (i < c.charCodeAt(0) - a) t += freq[i] + rev = (rev * fact[freq[i]]) % mod + } + ans += ((t * fact[l]) % mod) * modpow(rev, mod - 2n) + ans %= mod + freq[c.charCodeAt(0) - a]-- + } + return Number(ans) + function modpow(b, p) { + let ans = 1n + for (; p; p >>= 1n) { + if (p & 1n) ans = (ans * b) % mod + b = (b * b) % mod + } + return ans + } +} From 5b5c64ac452ad325ba6c1d3dd47b816c42c752ae Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Apr 2021 12:19:49 +0800 Subject: [PATCH 0005/2039] Update 139-word-break.js --- 139-word-break.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/139-word-break.js b/139-word-break.js index c87a8af9..98a84d48 100644 --- a/139-word-break.js +++ b/139-word-break.js @@ -51,3 +51,28 @@ const wordBreak = function(s, wordDict) { return f[len]; }; + + +// another + +/** + * @param {string} s + * @param {string[]} wordDict + * @return {boolean} + */ +const wordBreak = function(s, wordDict) { + const set = new Set(wordDict) + const dp = Array(s.length + 1).fill(false) + dp[0] = true + for(let i = 1; i <= s.length; i++) { + for(let j = 0; j < i; j++) { + if(dp[j] && set.has(s.slice(j, i))) { + dp[i] = true + break + } + } + } + + return dp[s.length] +}; + From 03ccae90835ca70185bc38be48bba0c686b695dd Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Apr 2021 15:23:41 +0800 Subject: [PATCH 0006/2039] Update 140-word-break-ii.js --- 140-word-break-ii.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/140-word-break-ii.js b/140-word-break-ii.js index e1c6adc3..06f39ff2 100644 --- a/140-word-break-ii.js +++ b/140-word-break-ii.js @@ -57,3 +57,35 @@ const wordBreak = function (s, wordDict) { const res = dfs(0) return res.filter((a) => a.join('') === s).map((a) => a.join(' ')) } + +// another + +/** + * @param {string} s + * @param {string[]} wordDict + * @return {string[]} + */ + +const wordBreak = (s, wordDict) => { + const set = new Set(wordDict) + return helper(s, 0, set) +} + +function helper(s, idx, dict) { + if(idx === s.length) return [] + const res = [] + for(let i = idx; i < s.length; i++) { + const tmp = s.slice(idx, i + 1) + if(dict.has(tmp)) { + const arr = helper(s, i + 1, dict) + if(i + 1 >= s.length) { + res.push(tmp) + } else if(arr.length) { + for(let e of arr) { + res.push(tmp + ' ' + e) + } + } + } + } + return res +} From b11a4f90c77d548c5b884749d33742695269195b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Apr 2021 17:13:31 +0800 Subject: [PATCH 0007/2039] Update 410-split-array-largest-sum.js --- 410-split-array-largest-sum.js | 41 ++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/410-split-array-largest-sum.js b/410-split-array-largest-sum.js index 668279b9..a48f3f1e 100644 --- a/410-split-array-largest-sum.js +++ b/410-split-array-largest-sum.js @@ -98,3 +98,44 @@ When Largest sum of sub-arrays is in range [6, 15], we can always find a way to However, when Largest sum of sub-arrays is in range [5, 5], there is no way to do this. This mapped this problem into the second sub-problem. Bool array B here is [5:false, 6:true, 7:true, 8:true, ..., 15:true]. We want to find the index i of the first true in B, which is the answer of this entire question, and by solving the first sub-problem, we have an API that can tell us given an i (Largest sum of sub-arrays), whether B[i] is true (whether we can find a way to cut A to satisfy the constraint). */ + + +// another + +/** + * @param {number[]} nums + * @param {number} m + * @return {number} + */ +const splitArray = (nums, m) => { + let max = -Infinity, sum = 0 + for(let num of nums) { + sum += num + max = Math.max(max, num) + } + if (m === 1) return sum + let l = max, r = sum + while(l < r) { + let mid = l + ((r - l) >> 1) + if(valid(mid, nums, m)) { + r = mid + } else { + l = mid + 1 + } + } + return l +} + +function valid(target, nums, m) { + let cnt = 1, sum = 0 + for(let num of nums) { + sum += num + if(sum > target) { + cnt++ + sum = num + if(cnt > m) return false + } + } + + return true +} From faec736f775dedded92ea8df1ea4762cbfc6e228 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Apr 2021 21:57:27 +0800 Subject: [PATCH 0008/2039] Update 1041-robot-bounded-in-circle.js --- 1041-robot-bounded-in-circle.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1041-robot-bounded-in-circle.js b/1041-robot-bounded-in-circle.js index 59b27fb2..65146881 100644 --- a/1041-robot-bounded-in-circle.js +++ b/1041-robot-bounded-in-circle.js @@ -34,3 +34,26 @@ const isRobotBounded = function(instructions) { } return x === 0 && y === 0 || i > 0 }; + +// another + +/** + * @param {string} instructions + * @return {boolean} + */ +const isRobotBounded = function(instructions) { + const dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]] + let x = 0, y = 0, i = 0 + for(let ins of instructions) { + if(ins === 'G') { + const dir = dirs[i] + x += dir[0] + y += dir[1] + } else if(ins === 'L') { + i = i - 1 < 0 ? 3 : i - 1 + } else if(ins === 'R') { + i = i + 1 > 3 ? 0 : i + 1 + } + } + return x === 0 && y === 0 || i !== 0 +}; From c3e4c76de14b64ba7175ac0b3e8a1593b2be0cb5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Apr 2021 10:03:38 +0800 Subject: [PATCH 0009/2039] Update 1834-single-threaded-cpu.js --- 1834-single-threaded-cpu.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1834-single-threaded-cpu.js b/1834-single-threaded-cpu.js index ddf36092..4a394db0 100644 --- a/1834-single-threaded-cpu.js +++ b/1834-single-threaded-cpu.js @@ -209,3 +209,33 @@ class PriorityQueue { } } } + +// another +/** + * @param {number[][]} tasks + * @return {number[]} + */ +const getOrder = function(tasks) { + const n = tasks.length + const pq = new PriorityQueue((a, b) => a[0] === b[0] ? a[1] < b[1] : a[0] < b[0]) + tasks.forEach((e, i) => e.push(i)) + tasks.sort((a, b) => a[0] - b[0]) + let idx = 0, time = 0 + const res = [] + + while(idx < n || !pq.isEmpty()) { + while(idx < n && tasks[idx][0] <= time) { + pq.push([tasks[idx][1], task[idx][2]]) + idx++ + } + if(!pq.isEmpty()) { + const tmp = pq.pop() + time += tmp[0] + res.push(tmp[1]) + } else if(idx < n) { + time = tasks[idx][0] + } + } + return res + +}; From 9db2621bba8d5faf64980288d033be42b8f928f2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Apr 2021 22:10:44 +0800 Subject: [PATCH 0010/2039] Update 445-add-two-numbers-II.js --- 445-add-two-numbers-II.js | 52 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/445-add-two-numbers-II.js b/445-add-two-numbers-II.js index 65a246ed..ef5c15e6 100755 --- a/445-add-two-numbers-II.js +++ b/445-add-two-numbers-II.js @@ -40,3 +40,55 @@ const addTwoNumbers = function(l1, l2) { return list.val === 0 ? list.next : list; }; + +// another + +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} l1 + * @param {ListNode} l2 + * @return {ListNode} + */ +const addTwoNumbers = function(l1, l2) { + const s1 = [], s2 = [] + let h1 = l1, h2 = l2 + while(h1) { + s1.push(h1.val) + h1 = h1.next + } + while(h2) { + s2.push(h2.val) + h2 = h2.next + } + let inc = false + let tail = null + while(s1.length || s2.length) { + let tmp = 0 + if(s1.length) tmp += s1.pop() + if(s2.length) tmp += s2.pop() + if(inc) tmp++ + if(tmp > 9) { + inc = true + } else { + inc = false + } + tmp = tmp % 10 + const cur = new ListNode(tmp) + if(tail) cur.next = tail + tail = cur + } + + if(inc) { + const head = new ListNode(1) + head.next = tail + return head + } + return tail + +}; From ff75ccd843c01bedfe5376fd505f4d7627209cd3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 24 Apr 2021 12:11:57 +0800 Subject: [PATCH 0011/2039] Update 1835-find-xor-sum-of-all-pairs-bitwise-and.js --- 1835-find-xor-sum-of-all-pairs-bitwise-and.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) diff --git a/1835-find-xor-sum-of-all-pairs-bitwise-and.js b/1835-find-xor-sum-of-all-pairs-bitwise-and.js index bab1cf9a..8ada2371 100644 --- a/1835-find-xor-sum-of-all-pairs-bitwise-and.js +++ b/1835-find-xor-sum-of-all-pairs-bitwise-and.js @@ -40,3 +40,16 @@ const getXORSum = function(arr1, arr2) { return res; }; +// another + +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @return {number} + */ +const getXORSum = function(arr1, arr2) { + let x1 = arr1[0], x2 = arr2[0] + for(let i = 1; i < arr1.length; i++) x1 ^= arr1[i] + for(let i = 1; i < arr2.length; i++) x2 ^= arr2[i] + return x1 & x2 +}; From 54e8c900a27d09164b0c40053e43afe79963f404 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 24 Apr 2021 17:35:30 +0800 Subject: [PATCH 0012/2039] Update 295-find-median-from-data-stream.js --- 295-find-median-from-data-stream.js | 104 ++++++++++++++++++++++++++++ 1 file changed, 104 insertions(+) diff --git a/295-find-median-from-data-stream.js b/295-find-median-from-data-stream.js index 86c11b55..99487161 100644 --- a/295-find-median-from-data-stream.js +++ b/295-find-median-from-data-stream.js @@ -38,3 +38,107 @@ MedianFinder.prototype.findMedian = function() { * obj.addNum(num) * var param_2 = obj.findMedian() */ + +// another + +/** + * initialize your data structure here. + */ +const MedianFinder = function() { + this.minPQ = new PriorityQueue() + this.maxPQ = new PriorityQueue((a, b) => a < b) +}; + +/** + * @param {number} num + * @return {void} + */ +MedianFinder.prototype.addNum = function(num) { + this.minPQ.push(num) + this.maxPQ.push(this.minPQ.pop()) + if(this.minPQ.size() < this.maxPQ.size()) { + this.minPQ.push(this.maxPQ.pop()) + } +}; + +/** + * @return {number} + */ +MedianFinder.prototype.findMedian = function() { + if(this.minPQ.size() > this.maxPQ.size()) return this.minPQ.peek() + else return (this.minPQ.peek() + this.maxPQ.peek()) / 2 +}; + +/** + * Your MedianFinder object will be instantiated and called as such: + * var obj = new MedianFinder() + * obj.addNum(num) + * var param_2 = obj.findMedian() + */ +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From f29a417bdb04fbf2117f249cb6e7c957a95b9531 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 10:28:48 +0800 Subject: [PATCH 0013/2039] Update 227-basic-calculator-ii.js --- 227-basic-calculator-ii.js | 40 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/227-basic-calculator-ii.js b/227-basic-calculator-ii.js index 1aecde43..57be3ffd 100644 --- a/227-basic-calculator-ii.js +++ b/227-basic-calculator-ii.js @@ -20,3 +20,43 @@ const calculate = function(s) { return stack.reduce((ac, e) => ac + e, 0) }; + +// another + +/** + * @param {string} s + * @return {number} + */ +const calculate = function(s) { + if(s == null || s.length === 0) return 0 + let sum = 0, num = 0, op = '+', tmp = 0 + const stack = [] + for(let i = 0; i < s.length; i++) { + const ch = s[i] + const isInt = ch => ch >= '0' && ch <= '9' + if(isInt(ch)) { + num = num * 10 + (+ch) + } + if((!isInt(ch) && ch !== ' ') || i === s.length - 1) { + if(op === '+') { + sum += tmp + tmp = num + } + else if(op === '-') { + sum += tmp + tmp = - num + } + else if(op === '*') { + tmp *= num + } + else if(op === '/') { + tmp = ~~(tmp / num) + } + op = ch + num = 0 + } + + } + + return sum + tmp +} From 6334a70e42e080767bf55ab224d58058f8623905 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 12:37:36 +0800 Subject: [PATCH 0014/2039] Create 1838-frequency-of-the-most-frequent-element.js --- ...-frequency-of-the-most-frequent-element.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1838-frequency-of-the-most-frequent-element.js diff --git a/1838-frequency-of-the-most-frequent-element.js b/1838-frequency-of-the-most-frequent-element.js new file mode 100644 index 00000000..d61b472a --- /dev/null +++ b/1838-frequency-of-the-most-frequent-element.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maxFrequency = function(nums, k) { + let res = 1, i = 0, j; + let sum = 0; + nums.sort((a, b) => a - b) + for (j = 0; j < nums.length; ++j) { + sum += nums[j]; + while (sum + k < nums[j] * (j - i + 1)) { + sum -= nums[i]; + i += 1; + } + res = Math.max(res, j - i + 1); + } + return res; +}; From 9f49240b64802ad67a612fb668df7b3c1e13b545 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 13:01:07 +0800 Subject: [PATCH 0015/2039] Create 1837-sum-of-digits-in-base-k.js --- 1837-sum-of-digits-in-base-k.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1837-sum-of-digits-in-base-k.js diff --git a/1837-sum-of-digits-in-base-k.js b/1837-sum-of-digits-in-base-k.js new file mode 100644 index 00000000..403174c6 --- /dev/null +++ b/1837-sum-of-digits-in-base-k.js @@ -0,0 +1,12 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const sumBase = function(n, k) { + let str = n.toString(k) + let res = 0 + for(let ch of str) res += +ch + + return res +}; From 2f41916a59c01142a496962c541845e735e3d8c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 13:05:00 +0800 Subject: [PATCH 0016/2039] Create 1839-longest-substring-of-all-vowels-in-order.js --- ...ongest-substring-of-all-vowels-in-order.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1839-longest-substring-of-all-vowels-in-order.js diff --git a/1839-longest-substring-of-all-vowels-in-order.js b/1839-longest-substring-of-all-vowels-in-order.js new file mode 100644 index 00000000..d33253ff --- /dev/null +++ b/1839-longest-substring-of-all-vowels-in-order.js @@ -0,0 +1,25 @@ +/** + * @param {string} word + * @return {number} + */ +function longestBeautifulSubstring(word) { + let result = 0, + current = 0 + let currentVowel = "a" + const set = new Set() + for (let i = 0; i < word.length; i++) + if (word.charAt(i) < currentVowel) { + set.clear() + if (word.charAt(i) == "a") { + set.add("a") + current = 1 + } else current = 0 + currentVowel = "a" + } else { + current++ + currentVowel = word.charAt(i) + set.add(currentVowel) + if (set.size == 5) result = Math.max(result, current) + } + return result +} From 0b35db47d344523e9f82b54ed099c5beac826d1c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 13:21:42 +0800 Subject: [PATCH 0017/2039] Create 1840-maximum-building-height.js --- 1840-maximum-building-height.js | 46 +++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 1840-maximum-building-height.js diff --git a/1840-maximum-building-height.js b/1840-maximum-building-height.js new file mode 100644 index 00000000..f88b1e2f --- /dev/null +++ b/1840-maximum-building-height.js @@ -0,0 +1,46 @@ +/** + * @param {number} n + * @param {number[][]} restrictions + * @return {number} + */ +var maxBuilding = function (n, restrictions) { + restrictions.sort((a, b) => a[0] - b[0]); + let prevInd = 1, + prevH = 0; + for (let i = 0; i < restrictions.length; i++) { + restrictions[i][1] = Math.min( + restrictions[i][1], + prevH + (restrictions[i][0] - prevInd) + ); + prevInd = restrictions[i][0]; + prevH = restrictions[i][1]; + } + + for (let i = restrictions.length - 2; i >= 0; i--) { + restrictions[i][1] = Math.min( + restrictions[i][1], + restrictions[i + 1][1] + (restrictions[i + 1][0] - restrictions[i][0]) + ); + } + + let ph = 0, + pInd = 1, + highest = 0; + for (let i = 0; i < restrictions.length; i++) { + let ind = restrictions[i][0]; + let h = restrictions[i][1]; + if (ph < h) { + h = Math.min(h, ph + (ind - pInd)); + + let remains = Math.max(0, ind - pInd - (h - ph)); + highest = Math.max(highest, h + ~~(remains / 2)); + } else { + let remains = ind - pInd - (ph - h); + highest = Math.max(highest, ph + ~~(remains / 2)); + } + ph = h; + pInd = ind; + } + highest = Math.max(highest, ph + (n - pInd)); + return highest; +}; From 0631ed7785981f5c685221cb3c3b641c0e2af08a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 14:01:54 +0800 Subject: [PATCH 0018/2039] Update 1838-frequency-of-the-most-frequent-element.js --- ...-frequency-of-the-most-frequent-element.js | 24 +++++++++---------- 1 file changed, 12 insertions(+), 12 deletions(-) diff --git a/1838-frequency-of-the-most-frequent-element.js b/1838-frequency-of-the-most-frequent-element.js index d61b472a..de7a8a6c 100644 --- a/1838-frequency-of-the-most-frequent-element.js +++ b/1838-frequency-of-the-most-frequent-element.js @@ -3,17 +3,17 @@ * @param {number} k * @return {number} */ -var maxFrequency = function(nums, k) { - let res = 1, i = 0, j; - let sum = 0; - nums.sort((a, b) => a - b) - for (j = 0; j < nums.length; ++j) { - sum += nums[j]; - while (sum + k < nums[j] * (j - i + 1)) { - sum -= nums[i]; - i += 1; - } - res = Math.max(res, j - i + 1); +const maxFrequency = function(nums, k) { + let res = 1, i = 0, j = 0, sum = 0 + const n = nums.length + nums.sort((a, b) => a - b) + for(j = 0; j < n; j++) { + sum += nums[j] + while(sum + k < (j - i + 1) * nums[j]) { + sum -= nums[i] + i++ } - return res; + res = Math.max(res, j - i + 1) + } + return res }; From 6fd5ea7daed988999762984ec17e943a9a540f45 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Apr 2021 14:44:58 +0800 Subject: [PATCH 0019/2039] Update 1839-longest-substring-of-all-vowels-in-order.js --- ...ongest-substring-of-all-vowels-in-order.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1839-longest-substring-of-all-vowels-in-order.js b/1839-longest-substring-of-all-vowels-in-order.js index d33253ff..38cc6578 100644 --- a/1839-longest-substring-of-all-vowels-in-order.js +++ b/1839-longest-substring-of-all-vowels-in-order.js @@ -1,3 +1,32 @@ +/** + * @param {string} word + * @return {number} + */ +function longestBeautifulSubstring(word) { + let res = 0, cur = 'a', cnt = 0 + const set = new Set() + for(let ch of word) { + if(ch < cur) { + set.clear() + cnt = 0 + cur = 'a' + if(ch === cur) { + cnt++ + set.add(cur) + } + } else { + cnt++ + set.add(ch) + cur = ch + if(set.size === 5) res = Math.max(res, cnt) + } + } + return res +} + + +// another + /** * @param {string} word * @return {number} From 95965ef936aeedad28893cc700d08dab6b9da773 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Apr 2021 19:55:03 +0800 Subject: [PATCH 0020/2039] Update 140-word-break-ii.js --- 140-word-break-ii.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/140-word-break-ii.js b/140-word-break-ii.js index 06f39ff2..168e398f 100644 --- a/140-word-break-ii.js +++ b/140-word-break-ii.js @@ -1,3 +1,32 @@ +/** + * @param {string} s + * @param {string[]} wordDict + * @return {string[]} + */ +const wordBreak = function(s, wordDict) { + const set = new Set(wordDict) + return helper(s, 0, set) +}; + +function helper(str, idx, set) { + if(idx === str.length) return [] + const res = [] + for(let i = idx; i < str.length; i++) { + const tmp = str.slice(idx, i + 1) + if(set.has(tmp)) { + const arr = helper(str, i + 1, set) + if(i === str.length - 1) res.push(tmp) + for(let item of arr) { + res.push(`${tmp} ${item}`) + } + } + } + return res +} + +// another + + /** * @param {string} s * @param {string[]} wordDict From 951ccc148575879c22255fb26578eaa28905ac36 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Apr 2021 21:22:35 +0800 Subject: [PATCH 0021/2039] Update 140-word-break-ii.js --- 140-word-break-ii.js | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/140-word-break-ii.js b/140-word-break-ii.js index 168e398f..36070c6a 100644 --- a/140-word-break-ii.js +++ b/140-word-break-ii.js @@ -5,25 +5,27 @@ */ const wordBreak = function(s, wordDict) { const set = new Set(wordDict) - return helper(s, 0, set) + const map = new Map() + return helper(s, 0, set, map) }; -function helper(str, idx, set) { +function helper(str, idx, set, map) { if(idx === str.length) return [] + if(map.has(idx)) return map.get(idx) const res = [] for(let i = idx; i < str.length; i++) { const tmp = str.slice(idx, i + 1) if(set.has(tmp)) { - const arr = helper(str, i + 1, set) + const arr = helper(str, i + 1, set, map) if(i === str.length - 1) res.push(tmp) for(let item of arr) { res.push(`${tmp} ${item}`) } } } + map.set(idx, res) return res } - // another From f1d5e7ddd776c0aa89cb8f9940cc58e88cfc0afe Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Apr 2021 22:08:51 +0800 Subject: [PATCH 0022/2039] Update 139-word-break.js --- 139-word-break.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/139-word-break.js b/139-word-break.js index 98a84d48..ad37fdf0 100644 --- a/139-word-break.js +++ b/139-word-break.js @@ -1,3 +1,34 @@ +/** + * @param {string} s + * @param {string[]} wordDict + * @return {boolean} + */ +const wordBreak = function(s, wordDict) { + const map = new Map() + return helper(s, 0, new Set(wordDict), map) +}; + +function helper(str, idx, set, map) { + if(idx === str.length) return true + if(map.has(idx)) return map.get(idx) + let res = false + for(let i = idx; i < str.length; i++) { + const tmp = str.slice(idx, i + 1) + if(set.has(tmp)) { + const bool = helper(str, i + 1, set, map) + if(bool) { + res = true + break + } + } + } + map.set(idx, res) + return res +} + +// another + + /** * @param {string} s * @param {string[]} wordDict From 3daa3fcec4d7c9d305f749c0387fdbe093fe3485 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Apr 2021 10:36:12 +0800 Subject: [PATCH 0023/2039] Update 1838-frequency-of-the-most-frequent-element.js --- ...-frequency-of-the-most-frequent-element.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1838-frequency-of-the-most-frequent-element.js b/1838-frequency-of-the-most-frequent-element.js index de7a8a6c..b57a76f9 100644 --- a/1838-frequency-of-the-most-frequent-element.js +++ b/1838-frequency-of-the-most-frequent-element.js @@ -17,3 +17,24 @@ const maxFrequency = function(nums, k) { } return res }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maxFrequency = function(nums, k) { + nums.sort((a, b) => a - b) + let i = 0, sum = 0, res = 1 + for(let j = 0; j < nums.length; j++) { + sum += nums[j] + while(sum + k < (j - i + 1) * nums[j]) { + sum -= nums[i] + i++ + } + res = Math.max(res, j - i + 1) + } + return res +}; From 723884085ab6126ef0ffbea55dc364f07ceca298 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Apr 2021 17:17:28 +0800 Subject: [PATCH 0024/2039] Create 1382-balance-a-binary-search-tree.js --- 1382-balance-a-binary-search-tree.js | 33 ++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 1382-balance-a-binary-search-tree.js diff --git a/1382-balance-a-binary-search-tree.js b/1382-balance-a-binary-search-tree.js new file mode 100644 index 00000000..5aab1b35 --- /dev/null +++ b/1382-balance-a-binary-search-tree.js @@ -0,0 +1,33 @@ +/** + * 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 {TreeNode} + */ +const balanceBST = function(root) { + const arr = [] + inOrder(root, arr) + return constructBST(arr, 0, arr.length - 1) +}; + +function inOrder(node, arr) { + if(node == null) return + inOrder(node.left, arr) + arr.push(node.val) + inOrder(node.right, arr) +} + +function constructBST(arr, start, end) { + if(start > end) return null + const mid = start + ((end - start) >> 1) + const node = new TreeNode(arr[mid]) + node.left = constructBST(arr, start, mid - 1) + node.right = constructBST(arr, mid + 1, end) + return node +} From d2abe01c0529179d81485ceb0fd1227360250821 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Apr 2021 17:42:57 +0800 Subject: [PATCH 0025/2039] Create 1290-convert-binary-number-in-a-linked-list-to-integer.js --- ...nary-number-in-a-linked-list-to-integer.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1290-convert-binary-number-in-a-linked-list-to-integer.js diff --git a/1290-convert-binary-number-in-a-linked-list-to-integer.js b/1290-convert-binary-number-in-a-linked-list-to-integer.js new file mode 100644 index 00000000..f057f346 --- /dev/null +++ b/1290-convert-binary-number-in-a-linked-list-to-integer.js @@ -0,0 +1,20 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {number} + */ +const getDecimalValue = function(head) { + let res = 0 + + while(head) { + res = res * 2 + head.val + head = head.next + } + return res +}; From ba609f6cd03100fac70e1ddf53ea0744a1a43db9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Apr 2021 10:07:30 +0800 Subject: [PATCH 0026/2039] Create 1366-rank-teams-by-votes.js --- 1366-rank-teams-by-votes.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1366-rank-teams-by-votes.js diff --git a/1366-rank-teams-by-votes.js b/1366-rank-teams-by-votes.js new file mode 100644 index 00000000..0181a888 --- /dev/null +++ b/1366-rank-teams-by-votes.js @@ -0,0 +1,20 @@ +/** + * @param {string[]} votes + * @return {string} + */ +const rankTeams = function(votes) { + if (votes.length === 1) return votes[0]; + const score = new Map(votes[0].split('').map(c => [c, new Array(votes[0].length).fill(0)])); + for (s of votes) { + for (let i = 0; i < s.length; i++) { + score.get(s[i])[i]++; + } + } + return votes[0].split('').sort((a,b) => { + for (let i = 0; i < votes[0].length; i++) { + if (score.get(a)[i] > score.get(b)[i]) return -1; + if (score.get(a)[i] < score.get(b)[i]) return 1; + } + return a < b ? -1 : 1; + }).join(''); +}; From c7798efa92e41299cf256ae1d16d24092ac27fa3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Apr 2021 11:09:58 +0800 Subject: [PATCH 0027/2039] Update 1366-rank-teams-by-votes.js --- 1366-rank-teams-by-votes.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1366-rank-teams-by-votes.js b/1366-rank-teams-by-votes.js index 0181a888..ef253262 100644 --- a/1366-rank-teams-by-votes.js +++ b/1366-rank-teams-by-votes.js @@ -1,3 +1,32 @@ +/** + * @param {string[]} votes + * @return {string} + */ +const rankTeams = function(votes) { + const hash = {} + const l = votes[0].length + for(let vote of votes) { + for(let i = 0; i < l; i++) { + const ch = vote[i] + if(hash[ch] == null) hash[ch] = Array(l).fill(0) + hash[ch][i]++ + } + } + const keys = Object.keys(hash) + keys.sort((a, b) => { + for(let i = 0; i < l; i++) { + if(hash[a][i] !== hash[b][i]) { + return hash[b][i] - hash[a][i] + } + } + return a === b ? 0 : (a < b ? -1 : 1) + }) + + return keys.join('') +}; + +// another + /** * @param {string[]} votes * @return {string} From 87d3fdee4807b2f0e3c51f7b40f179d09ff75b37 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Apr 2021 21:09:54 +0800 Subject: [PATCH 0028/2039] Update 472-concatenated-words.js --- 472-concatenated-words.js | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/472-concatenated-words.js b/472-concatenated-words.js index 31cf5996..049b4a97 100644 --- a/472-concatenated-words.js +++ b/472-concatenated-words.js @@ -1,3 +1,40 @@ +/** + * @param {string[]} words + * @return {string[]} + */ + +const findAllConcatenatedWordsInADict = function (words) { + const set = new Set(words) + const res = [] + const map = new Map() + for (let w of words) { + if (w.length < 2) continue + if (dfs(w, set, map, 0)) res.push(w) + } + return res + + function dfs(word, set, map, pos) { + if (pos > 0 && map.get(word)) return map.get(word) + if (pos > 0 && set.has(word)) { + map.set(word, true) + return map.get(word) + } + for (let i = 1; i < word.length; i++) { + const left = word.slice(0, i) + const right = word.slice(i) + if (set.has(right) && dfs(left, set, map, pos + 1)) { + map.set(word, true) + return map.get(word) + } + } + + map.set(word, false) + return false + } +} + +// another + /** * @param {string[]} words * @return {string[]} From a2524c2db74a35f50b1b015e8661d82652ff2ecd Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Apr 2021 21:23:02 +0800 Subject: [PATCH 0029/2039] Update 472-concatenated-words.js --- 472-concatenated-words.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/472-concatenated-words.js b/472-concatenated-words.js index 049b4a97..eda86b85 100644 --- a/472-concatenated-words.js +++ b/472-concatenated-words.js @@ -33,6 +33,44 @@ const findAllConcatenatedWordsInADict = function (words) { } } +// another + +/** + * @param {string[]} words + * @return {string[]} + */ + +const findAllConcatenatedWordsInADict = function (words) { + const set = new Set(words) + const res = [] + const map = new Map() + + for(let word of words) { + if(dfs(word, 0)) res.push(word) + } + return res + function dfs(word, idx) { + if(map.has(word)) return map.get(word) + if(idx > 0 && set.has(word)) return true + let tmp = false + for(let i = 1; i < word.length; i++) { + const prefix = word.slice(0, i), suffix = word.slice(i) + if(set.has(prefix) && set.has(suffix)) { + tmp = true + break + } + if(set.has(prefix) && dfs(suffix, idx + 1)) { + tmp = true + break + } + } + + map.set(word, tmp) + return tmp + } +} + + // another /** From 07718d5f8d065712fb87b8af78f9633d6df91e11 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Apr 2021 22:24:46 +0800 Subject: [PATCH 0030/2039] Update 472-concatenated-words.js --- 472-concatenated-words.js | 41 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/472-concatenated-words.js b/472-concatenated-words.js index eda86b85..096a4693 100644 --- a/472-concatenated-words.js +++ b/472-concatenated-words.js @@ -1,3 +1,44 @@ +/** + * @param {string[]} words + * @return {string[]} + */ + +const findAllConcatenatedWordsInADict = function (words) { + const pre = new Set() + words.sort((a, b) => a.length - b.length) + const res = [] + for(let i = 0; i < words.length; i++) { + if(valid(words[i], pre)) { + res.push(words[i]) + } + pre.add(words[i]) + } + + return res + + function valid(str, set) { + if(set.size === 0) return false + const dp = Array(str.length + 1).fill(false) + dp[0] = true + for(let i = 1; i <= str.length; i++) { + for(let j = 0; j < i; j++) { + if(!dp[j]) continue + if(set.has(str.slice(j, i))) { + dp[i] = true + break + } + } + } + + return dp[str.length] + } +} + + + + +// another + /** * @param {string[]} words * @return {string[]} From 5c00e0c366a678fc623bb86d93c488ccfa47364c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 30 Apr 2021 15:10:56 +0800 Subject: [PATCH 0031/2039] Update 1839-longest-substring-of-all-vowels-in-order.js --- ...ongest-substring-of-all-vowels-in-order.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1839-longest-substring-of-all-vowels-in-order.js b/1839-longest-substring-of-all-vowels-in-order.js index 38cc6578..d5d78f94 100644 --- a/1839-longest-substring-of-all-vowels-in-order.js +++ b/1839-longest-substring-of-all-vowels-in-order.js @@ -24,6 +24,36 @@ function longestBeautifulSubstring(word) { return res } +// another + +/** + * @param {string} word + * @return {number} + */ +function longestBeautifulSubstring(word) { + let res = 0, cur = 'a', cnt = 0 + const set = new Set() + for (let ch of word) { + if (ch >= cur) { + cnt++ + cur = ch + set.add(ch) + } else { + set.clear() + cnt = 0 + cur = 'a' + if(ch === cur) { + set.add(ch) + cnt++ + } + } + if (set.size === 5) { + res = Math.max(res, cnt) + } + } + + return res +} // another From 2cd6af7438378a31933c30e878514a844abfafeb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 May 2021 20:15:02 +0800 Subject: [PATCH 0032/2039] Create 1539-kth-missing-positive-number.js --- 1539-kth-missing-positive-number.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1539-kth-missing-positive-number.js diff --git a/1539-kth-missing-positive-number.js b/1539-kth-missing-positive-number.js new file mode 100644 index 00000000..6a0c0184 --- /dev/null +++ b/1539-kth-missing-positive-number.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +const findKthPositive = function(arr, k) { + let l = 0, r = arr.length, m; + while (l < r) { + m = (l + r) >> 1; + if (arr[m] - 1 - m < k) l = m + 1; + else r = m; + } + return l + k; +}; From 865b5655a87f8fe03fcf1b5e355a7d8ae784ac3f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 May 2021 13:52:18 +0800 Subject: [PATCH 0033/2039] Create 1848-minimum-distance-to-the-target-element.js --- ...-minimum-distance-to-the-target-element.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1848-minimum-distance-to-the-target-element.js diff --git a/1848-minimum-distance-to-the-target-element.js b/1848-minimum-distance-to-the-target-element.js new file mode 100644 index 00000000..440d4340 --- /dev/null +++ b/1848-minimum-distance-to-the-target-element.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} target + * @param {number} start + * @return {number} + */ +const getMinDistance = function(nums, target, start) { + let min = Infinity, res = -1 + for(let i = 0; i < nums.length; i++) { + if(nums[i] === target) { + if(min > Math.abs(i - start)) { + res = i + min = Math.abs(i - start) + } + } + } + + return min + +}; From 048d239e62200ac5808b2f2fb7ccead1af5631a1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 May 2021 13:52:47 +0800 Subject: [PATCH 0034/2039] Create 1849-splitting-a-string-into-descending-consecutive-values.js --- ...ring-into-descending-consecutive-values.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1849-splitting-a-string-into-descending-consecutive-values.js diff --git a/1849-splitting-a-string-into-descending-consecutive-values.js b/1849-splitting-a-string-into-descending-consecutive-values.js new file mode 100644 index 00000000..ef29c79f --- /dev/null +++ b/1849-splitting-a-string-into-descending-consecutive-values.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @return {boolean} + */ +const splitString = function(s) { + return dfs(s, 0, [Infinity]) +}; + +function dfs(str, idx, arr) { + if(idx >= str.length && arr.length > 2) return true + for(let i = idx; i < str.length; i++) { + const tmp = str.slice(idx, i + 1) + const num = parseInt(tmp, 10) + const pre = arr[arr.length - 1] + if(num < pre && (pre === Infinity || pre - num === 1)) { + arr.push(num) + if(dfs(str, i + 1, arr)) return true + arr.pop() + } + } + return false +} From b6c7eb35c1927113f00850f52fb5fc2c041232a7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 May 2021 14:29:38 +0800 Subject: [PATCH 0035/2039] Create 1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js --- ...-swaps-to-reach-the-kth-smallest-number.js | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js diff --git a/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js b/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js new file mode 100644 index 00000000..e12293b6 --- /dev/null +++ b/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js @@ -0,0 +1,60 @@ +/** + * @param {string} num + * @param {number} k + * @return {number} + */ +const getMinSwaps = function (num, k) { + const temp = num.split('') + for (let i = 0; i < k; i++) nextPermutation(temp) + return count(num.split(''), temp, temp.length) +} + +function nextPermutation(a) { + let i = a.length - 2 + //Find the first element which isn't in increasing order fom behind + while (i >= 0 && a[i] >= a[i + 1]) i-- + //If we found an element + if (i >= 0) { + // Find the rightmost element such that a[j] > a[i] + let j = bSearch(a, i + 1, a.length - 1, a[i]) + // swap a[i] and a[j] + a[i] = a[i] ^ a[j] ^ (a[j] = a[i]) + } + //reverse array from i + 1 till end + reverse(a, i + 1, a.length - 1) +} + +function bSearch(a, i, j, key) { + while (i <= j) { + let mid = (i + j) >>> 1 + + if (key < a[mid]) i = mid + 1 + else j = mid - 1 + } + return i - 1 +} + +function reverse(a, i, j) { + while (i < j) a[i] = a[i] ^ a[j] ^ (a[j--] = a[i++]) +} + +function count(s1, s2, n) { + let i = 0, + j = 0, + res = 0 + + while (i < n) { + j = i + + while (s1[j] != s2[i]) j++ + + while (i < j) { + let temp = s1[j] + s1[j] = s1[j - 1] + s1[j-- - 1] = temp + ++res + } + ++i + } + return res +} From 3642b0a27efb9e98b10fed3831be4136d4ea7bc1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 May 2021 16:03:09 +0800 Subject: [PATCH 0036/2039] Create 1851-minimum-interval-to-include-each-query.js --- ...-minimum-interval-to-include-each-query.js | 302 ++++++++++++++++++ 1 file changed, 302 insertions(+) create mode 100644 1851-minimum-interval-to-include-each-query.js diff --git a/1851-minimum-interval-to-include-each-query.js b/1851-minimum-interval-to-include-each-query.js new file mode 100644 index 00000000..3bcf0adf --- /dev/null +++ b/1851-minimum-interval-to-include-each-query.js @@ -0,0 +1,302 @@ +/** + * @param {number[][]} intervals + * @param {number[]} queries + * @return {number[]} + */ +const minInterval = function (A, Q) { + const QQ = [] + for (let idx = 0; idx < Q.length; idx++) QQ.push([Q[idx], idx]) + QQ.sort((a, b) => a[0] - b[0]) + A.sort((a, b) => a[0] - b[0]) + let i = 0, + N = A.length + const ans = Array(Q.length).fill(-1) + const m = new TreeMap() + const pq = new PriorityQueue((a, b) => a[0] < b[0]) + for (let [q, index] of QQ) { + for (; i < N && A[i][0] <= q; i++) { + let len = A[i][1] - A[i][0] + 1 + if (m.get(len) == null) m.set(len, 0) + m.set(len, m.get(len) + 1) + pq.push([A[i][1], len]) + } + while (pq.size() > 0 && pq.peek()[0] < q) { + let [right, len] = pq.peek() + m.set(len, m.get(len) - 1) + if (m.get(len) === 0) m.remove(len) + pq.pop() + } + const first = m.getMinKey() + if (m.getLength()) ans[index] = first + } + return ans +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +function TreeMap() { + var root = null + var keyType = void 0 + var length = 0 + + return { + each: each, + set: set, + get: get, + getTree: getTree, + getLength: getLength, + getMaxKey: getMaxKey, + getMinKey: getMinKey, + remove: remove, + } + + function checkKey(key, checkKeyType) { + var localKeyType = typeof key + + if ( + localKeyType !== 'number' && + localKeyType !== 'string' && + localKeyType !== 'boolean' + ) { + throw new Error("'key' must be a number, a string or a boolean") + } + + if (checkKeyType === true && localKeyType !== keyType) { + throw new Error('All keys must be of the same type') + } + + return localKeyType + } + + function call(callback) { + var args = Array.prototype.slice.call(arguments, 1) + + if (typeof callback === 'function') { + callback.apply(void 0, args) + } + } + + function getTree() { + return root + } + + function getLength() { + return length + } + + function each(callback) { + internalEach(root, callback) + } + + function internalEach(node, callback, internalCallback) { + if (node === null) { + return call(internalCallback) + } + + internalEach(node.left, callback, function () { + call(callback, node.value, node.key) + + internalEach(node.right, callback, function () { + call(internalCallback) + }) + }) + } + + function get(key) { + checkKey(key) + + return internalGet(key, root) + } + + function internalGet(key, node) { + if (node === null) { + return void 0 + } + + if (key < node.key) { + return internalGet(key, node.left) + } else if (key > node.key) { + return internalGet(key, node.right) + } else { + return node.value + } + } + + function set(key, value) { + if (root === null) { + keyType = checkKey(key) + } else { + checkKey(key, true) + } + + root = internalSet(key, value, root) + } + + function internalSet(key, value, node) { + if (node === null) { + length++ + + return { + key: key, + value: value, + left: null, + right: null, + } + } + + if (key < node.key) { + node.left = internalSet(key, value, node.left) + } else if (key > node.key) { + node.right = internalSet(key, value, node.right) + } else { + node.value = value + } + + return node + } + + function getMaxKey() { + var maxNode = getMaxNode(root) + + if (maxNode !== null) { + return maxNode.key + } + + return maxNode + } + + function getMinKey() { + var minNode = getMinNode(root) + + if (minNode !== null) { + return minNode.key + } + + return minNode + } + + function getMaxNode(node) { + while (node !== null && node.right !== null) { + node = node.right + } + + return node + } + + function getMinNode(node) { + while (node !== null && node.left !== null) { + node = node.left + } + + return node + } + + function remove(key) { + checkKey(key) + + root = internalRemove(key, root) + } + + function internalRemove(key, node) { + if (node === null) { + return null + } + + if (key < node.key) { + node.left = internalRemove(key, node.left) + } else if (key > node.key) { + node.right = internalRemove(key, node.right) + } else { + if (node.left !== null && node.right !== null) { + var maxNode = getMaxNode(node.left) + + var maxNodeKey = maxNode.key + var maxNodeValue = maxNode.value + + maxNode.key = node.key + maxNode.value = node.value + node.key = maxNodeKey + node.value = maxNodeValue + + node.left = internalRemove(key, node.left) + } else if (node.left !== null) { + length-- + return node.left + } else if (node.right !== null) { + length-- + return node.right + } else { + length-- + return null + } + } + + return node + } +} From a5432df97a2d4e602e9058c821b234f581a22198 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 May 2021 23:08:50 +0800 Subject: [PATCH 0037/2039] Create 1846-maximum-element-after-decreasing-and-rearranging.js --- ...imum-element-after-decreasing-and-rearranging.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1846-maximum-element-after-decreasing-and-rearranging.js diff --git a/1846-maximum-element-after-decreasing-and-rearranging.js b/1846-maximum-element-after-decreasing-and-rearranging.js new file mode 100644 index 00000000..70d6be66 --- /dev/null +++ b/1846-maximum-element-after-decreasing-and-rearranging.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const maximumElementAfterDecrementingAndRearranging = function(arr) { + arr.sort((a, b) => a - b); + arr[0] = 1; + for(let i = 1; i < arr.length; i++) { + if(arr[i] <= arr[i - 1] + 1) continue; + arr[i] = arr[i - 1] + 1; + } + return arr[arr.length - 1]; +}; From f8893a0a7db6528efc342ceaca9274601bde7fef Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 May 2021 20:04:11 +0800 Subject: [PATCH 0038/2039] Update 1697-checking-existence-of-edge-length-limited-paths.js --- 1697-checking-existence-of-edge-length-limited-paths.js | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/1697-checking-existence-of-edge-length-limited-paths.js b/1697-checking-existence-of-edge-length-limited-paths.js index 12928026..cf678002 100644 --- a/1697-checking-existence-of-edge-length-limited-paths.js +++ b/1697-checking-existence-of-edge-length-limited-paths.js @@ -16,13 +16,11 @@ const distanceLimitedPathsExist = function (n, edgeList, queries) { for (let i of order) { const limit = queries[i][2] while (idx < edgeList.length && edgeList[idx][2] < limit) { - const u = edgeList[idx][0], - v = edgeList[idx][1] + const [u, v] = edgeList[idx] uf.union(u, v) idx++ } - const u0 = queries[i][0], - v0 = queries[i][1] + const [u0, v0] = queries[i] if (uf.find(u0) === uf.find(v0)) ans[i] = true } return ans From e7e7931b31edeace24a8ffab105f08b5024b6db6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 5 May 2021 21:56:25 +0800 Subject: [PATCH 0039/2039] Update 1707-maximum-xor-with-an-element-from-array.js --- 1707-maximum-xor-with-an-element-from-array.js | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/1707-maximum-xor-with-an-element-from-array.js b/1707-maximum-xor-with-an-element-from-array.js index e63749e0..7aa24804 100644 --- a/1707-maximum-xor-with-an-element-from-array.js +++ b/1707-maximum-xor-with-an-element-from-array.js @@ -17,10 +17,10 @@ const maximizeXor = function (nums, queries) { if (m < nums[mid])r = mid else l = mid + 1 } - r -= 1 + r-- l = 0 let ans = x & ~maxMask - for (let bit = numOfBits - 1; bit >= 0; bit -= 1) { + for (let bit = numOfBits - 1; bit >= 0; bit--) { const mask = 1 << bit if (x & mask) { if ((nums[l] & mask) === 0) { @@ -46,6 +46,7 @@ const maximizeXor = function (nums, queries) { } } + // another /** From fc9b1efa68cf2e4eb0e65c3a96733ec577d68769 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 6 May 2021 15:44:52 +0800 Subject: [PATCH 0040/2039] Create 1847-closest-room.js --- 1847-closest-room.js | 71 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 71 insertions(+) create mode 100644 1847-closest-room.js diff --git a/1847-closest-room.js b/1847-closest-room.js new file mode 100644 index 00000000..f2c7aa85 --- /dev/null +++ b/1847-closest-room.js @@ -0,0 +1,71 @@ + +/** + * @param {number[][]} rooms + * @param {number[][]} queries + * @return {number[]} + */ + const closestRoom = function (rooms, queries) { + rooms.sort((a, b) => b[1] - a[1]) + const n = queries.length + const minSize = Array(n).fill(0).map((_, i) => i) + .sort((a, b) => queries[b][1] - queries[a][1]) + + const res = new Array(queries.length).fill(-1) + const bst = new BinarySearchTree() + let currentRoom = 0 + + minSize.forEach((query) => { + const [preferredRoom, minimumSize] = queries[query] + if (rooms[0][1] < minimumSize) return + + while (currentRoom < rooms.length && rooms[currentRoom][1] >= minimumSize) { + bst.add(rooms[currentRoom][0]) + currentRoom++ + } + + res[query] = bst.search(preferredRoom) + }) + + return res +} + +class BinarySearchTree { + constructor() { + this.root = null + } + + add(val) { + this.root = this.insert(this.root, val) + } + + insert(node, val) { + if (!node) return new TreeNode(val) + if (node.val < val) { + node.right = this.insert(node.right, val) + } else { + node.left = this.insert(node.left, val) + } + return node + } + + search(val, node = this.root) { + if (node.val === val) return val + const currentDistance = Math.abs(node.val - val) + const nextChild = node.val < val ? node.right : node.left + if (!nextChild) return node.val + const closestChild = this.search(val, nextChild) + const childDistance = Math.abs(closestChild - val) + if (childDistance < currentDistance) return closestChild + if (childDistance === currentDistance) + return Math.min(closestChild, node.val) + return node.val + } +} + +class TreeNode { + constructor(val) { + this.val = val + this.left = null + this.right = null + } +} From 290f7511185399b232171850b008548092933f23 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 7 May 2021 13:30:04 +0800 Subject: [PATCH 0041/2039] Update 1851-minimum-interval-to-include-each-query.js --- ...-minimum-interval-to-include-each-query.js | 145 ++++++++++++++++++ 1 file changed, 145 insertions(+) diff --git a/1851-minimum-interval-to-include-each-query.js b/1851-minimum-interval-to-include-each-query.js index 3bcf0adf..b2a0f7f3 100644 --- a/1851-minimum-interval-to-include-each-query.js +++ b/1851-minimum-interval-to-include-each-query.js @@ -1,3 +1,148 @@ +/** + * @param {number[][]} intervals + * @param {number[]} queries + * @return {number[]} + */ +const minInterval = function (intervals, queries) { + const n = intervals.length + const m = queries.length + const sortedQueryIdx = [...Array(m).keys()].sort( + (a, b) => queries[a] - queries[b] + ) + intervals.sort((a, b) => a[0] - b[0]) // sort by start & ascending + const minHeap = new BinaryHeap((c, p) => c.size >= p.size) + const res = Array(m).fill(0) + let i = 0 + for (const idx of sortedQueryIdx) { + const query = queries[idx] + while (i < n && intervals[i][0] <= query) { + minHeap.push({ + size: intervals[i][1] - intervals[i][0] + 1, + start: intervals[i][0], + end: intervals[i][1], + }) + i++ + } + while (!minHeap.isEmpty() && minHeap.peek().end < query) { + minHeap.pop() + } + res[idx] = minHeap.isEmpty() ? -1 : minHeap.peek().size + } + return res +} + +class BinaryHeap { + /** + * @param {compareFunction} compareFn + */ + constructor(compareFn) { + this.content = [] + this.compareFn = compareFn // Min-Heap: (c, p) => c > p + } + + /** + * @return {number} - Current heap size. + */ + size() { + return this.content.length + } + + /** + * @return {boolean} - True if heap size is empty. + */ + isEmpty() { + return this.size() === 0 + } + + /** + * @return {*} - Root node of the heap. + */ + peek() { + return this.size() > 0 ? this.content[0] : null + } + + /** + * @param {*} node - New node to add. + */ + push(node) { + this.content.push(node) + this._bubbleUp(this.content.length - 1) + } + + /** + * @return {*} - Root node of the heap. + */ + pop() { + if (this.content.length === 0) return null + const root = this.content[0] + const last = this.content.pop() + if (this.content.length > 0) { + this.content[0] = last + this._sinkDown(0) + } + return root + } + + /** + * @param {*} node - Node to delete. + */ + remove(node) { + const length = this.content.length + for (let i = 0; i < length; i++) { + if (this.content[i] !== node) continue + const last = this.content.pop() + if (i === length - 1) break + this.content[i] = last + this._bubbleUp(i) + this._sinkDown(i) + break + } + } + + /** + * @param {number} idx - Index of the node to bubble up + */ + _bubbleUp(idx) { + const node = this.content[idx] + while (idx > 0) { + const parentIdx = Math.floor((idx + 1) / 2) - 1 + const parent = this.content[parentIdx] + if (this.compareFn(node, parent)) break + this.content[parentIdx] = node + this.content[idx] = parent + idx = parentIdx + } + } + + /** + * @param {number} idx - Index of the node to sink down + */ + _sinkDown(idx) { + const node = this.content[idx] + while (true) { + const child2Idx = (idx + 1) * 2 + const child1Idx = child2Idx - 1 + let swapIdx = -1 + if (child1Idx < this.content.length) { + const child1 = this.content[child1Idx] + if (!this.compareFn(child1, node)) swapIdx = child1Idx + } + if (child2Idx < this.content.length) { + const child2 = this.content[child2Idx] + const compareNode = swapIdx === -1 ? node : this.content[child1Idx] + if (!this.compareFn(child2, compareNode)) swapIdx = child2Idx + } + if (swapIdx === -1) break + this.content[idx] = this.content[swapIdx] + this.content[swapIdx] = node + idx = swapIdx + } + } +} + + +// another + /** * @param {number[][]} intervals * @param {number[]} queries From b06e016adbcd2208c203614a9d9b3580396510a4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 May 2021 12:05:15 +0800 Subject: [PATCH 0042/2039] Update 1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js --- ...adjacent-swaps-to-reach-the-kth-smallest-number.js | 11 ++++------- 1 file changed, 4 insertions(+), 7 deletions(-) diff --git a/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js b/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js index e12293b6..4fa860fe 100644 --- a/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js +++ b/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.js @@ -3,7 +3,7 @@ * @param {number} k * @return {number} */ -const getMinSwaps = function (num, k) { + const getMinSwaps = function (num, k) { const temp = num.split('') for (let i = 0; i < k; i++) nextPermutation(temp) return count(num.split(''), temp, temp.length) @@ -16,7 +16,7 @@ function nextPermutation(a) { //If we found an element if (i >= 0) { // Find the rightmost element such that a[j] > a[i] - let j = bSearch(a, i + 1, a.length - 1, a[i]) + const j = bSearch(a, i + 1, a.length - 1, a[i]) // swap a[i] and a[j] a[i] = a[i] ^ a[j] ^ (a[j] = a[i]) } @@ -26,8 +26,7 @@ function nextPermutation(a) { function bSearch(a, i, j, key) { while (i <= j) { - let mid = (i + j) >>> 1 - + const mid = (i + j) >>> 1 if (key < a[mid]) i = mid + 1 else j = mid - 1 } @@ -45,11 +44,9 @@ function count(s1, s2, n) { while (i < n) { j = i - while (s1[j] != s2[i]) j++ - while (i < j) { - let temp = s1[j] + const temp = s1[j] s1[j] = s1[j - 1] s1[j-- - 1] = temp ++res From 83179dee578c83768a86f88feea94c987bf0c51f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 May 2021 17:45:28 +0800 Subject: [PATCH 0043/2039] Create 1325-delete-leaves-with-a-given-value.js --- 1325-delete-leaves-with-a-given-value.js | 29 ++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 1325-delete-leaves-with-a-given-value.js diff --git a/1325-delete-leaves-with-a-given-value.js b/1325-delete-leaves-with-a-given-value.js new file mode 100644 index 00000000..7d41bbff --- /dev/null +++ b/1325-delete-leaves-with-a-given-value.js @@ -0,0 +1,29 @@ +/** + * 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} target + * @return {TreeNode} + */ +const removeLeafNodes = function(root, target) { + return dfs(root, target) + +}; + +function dfs(node, target) { + if(node == null) return node + if(node.left == null && node.right == null) { + if(node.val === target) return null + else return node + } + node.right = dfs(node.right, target) + node.left = dfs(node.left, target) + if(node.right == null && node.left == null) return dfs(node, target) + return node +} From a8118d1bb71501e64f88fe3ba57b0417b00b7a02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 May 2021 20:18:11 +0800 Subject: [PATCH 0044/2039] Update 1325-delete-leaves-with-a-given-value.js --- 1325-delete-leaves-with-a-given-value.js | 22 +++++++++++++++++++++- 1 file changed, 21 insertions(+), 1 deletion(-) diff --git a/1325-delete-leaves-with-a-given-value.js b/1325-delete-leaves-with-a-given-value.js index 7d41bbff..33e8a0d9 100644 --- a/1325-delete-leaves-with-a-given-value.js +++ b/1325-delete-leaves-with-a-given-value.js @@ -13,7 +13,6 @@ */ const removeLeafNodes = function(root, target) { return dfs(root, target) - }; function dfs(node, target) { @@ -27,3 +26,24 @@ function dfs(node, target) { if(node.right == null && node.left == null) return dfs(node, target) return node } + +// another + +/** + * 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} target + * @return {TreeNode} + */ +const removeLeafNodes = function(root, target) { + if(root.left) root.left = removeLeafNodes(root.left, target) + if(root.right) root.right = removeLeafNodes(root.right, target) + return root.left == root.right && root.val === target ? null : root +}; From e4b213e47ff9be89af97ecefc0d21f901585ca20 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 14:14:53 +0800 Subject: [PATCH 0045/2039] Create 1856-maximum-subarray-min-product.js --- 1856-maximum-subarray-min-product.js | 46 ++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 1856-maximum-subarray-min-product.js diff --git a/1856-maximum-subarray-min-product.js b/1856-maximum-subarray-min-product.js new file mode 100644 index 00000000..439b0d94 --- /dev/null +++ b/1856-maximum-subarray-min-product.js @@ -0,0 +1,46 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxSumMinProduct = function (nums) { + const n = nums.length + const mod = BigInt(10 ** 9 + 7) + const preSum = Array(n + 1).fill(0n) + for (let i = 0; i < n; i++) { + preSum[i + 1] = preSum[i] + BigInt(nums[i]) + } + const l = Array(n).fill(0) // l[i] stores index of farthest element greater or equal to nums[i] + const r = Array(n).fill(0) // r[i] stores index of farthest element greater or equal to nums[i] + let st = [] + + for (let i = 0; i < n; i++) { + while (st.length && nums[st[st.length - 1]] >= nums[i]) st.pop() + if (st.length) l[i] = st[st.length - 1] + 1 + else l[i] = 0 + st.push(i) + } + + st = [] + for (let i = n - 1; i >= 0; i--) { + while (st.length && nums[st[st.length - 1]] >= nums[i]) st.pop() + if (st.length) r[i] = st[st.length - 1] - 1 + else r[i] = n - 1 + st.push(i) + } + function getSum(left, right) { + // inclusive + return preSum[right + 1] - preSum[left] + } + + let maxProduct = 0n + for (let i = 0; i < n; i++) { + maxProduct = bigint_max(maxProduct, BigInt(nums[i]) * getSum(l[i], r[i])) + } + return maxProduct % mod +} +function bigint_max(...args){ + if (args.length < 1){ throw 'Max of empty list'; } + m = args[0]; + args.forEach(a=>{if (a > m) {m = a}}); + return m; +} From 6875c091b083847b32b90e74e777bd89de2622e8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 18:05:22 +0800 Subject: [PATCH 0046/2039] Create 1854-maximum-population-year.js --- 1854-maximum-population-year.js | 59 +++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 1854-maximum-population-year.js diff --git a/1854-maximum-population-year.js b/1854-maximum-population-year.js new file mode 100644 index 00000000..628db32a --- /dev/null +++ b/1854-maximum-population-year.js @@ -0,0 +1,59 @@ +/** + * @param {number[][]} logs + * @return {number} + */ +const maximumPopulation = function(logs) { + logs.sort((a, b) => { + if(a[0] === b[0]) return a[1] - b[1] + return a[0] - b[0] + }) + const arr = Array(101).fill(0) + const bit = new FenwickTree(101) + for(let i = 0, len = logs.length; i < len; i++) { + const [start, end] = logs[i] + const idx = start - 1950 + bit.update(idx + 1, 1) + } + for(let i = 0, len = logs.length; i < len; i++) { + const [start, end] = logs[i] + const idx = end - 1950 + bit.update(idx + 1, -1) + } + let max = 0 + for(let i = 1; i <= 101; i++) { + max = Math.max(max, bit.query(i)) + } + let tmp + for(let i = 1; i <= 101; i++) { + if(bit.query(i) === max) { + tmp = i + break + } + } + + return 1950 + tmp - 1 +}; + +const lowBit = (x) => x & -x +class FenwickTree { + constructor(n) { + if (n < 1) return + this.sum = Array(n + 1).fill(0) + } + update(i, delta) { + if (i < 1) return + while (i < this.sum.length) { + this.sum[i] += delta + i += lowBit(i) + } + } + query(i) { + if (i < 1) return + let sum = 0 + while (i > 0) { + sum += this.sum[i] + i -= lowBit(i) + } + return sum + } +} From ea5025be569fda76a7d9b0d38f8cee96d050770b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 18:12:33 +0800 Subject: [PATCH 0047/2039] Update 1854-maximum-population-year.js --- 1854-maximum-population-year.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1854-maximum-population-year.js b/1854-maximum-population-year.js index 628db32a..c8a1f739 100644 --- a/1854-maximum-population-year.js +++ b/1854-maximum-population-year.js @@ -1,3 +1,33 @@ +/** + * @param {number[][]} logs + * @return {number} + */ +const maximumPopulation = function(logs) { + const n = logs.length + const arr = Array(101).fill(0) + const base = 1950 + for(let log of logs) { + const [start, end] = log + arr[start - base]++ + arr[end - base]-- + } + + let res = 0, tmp = -Infinity + for(let i = 1; i < 101; i++) { + arr[i] += arr[i - 1] + } + for(let i = 0; i < 101; i++) { + if(arr[i] > tmp) { + res = i + tmp = arr[i] + } + } + return res + base +}; + + +// another + /** * @param {number[][]} logs * @return {number} From fb5a72f8f3a65f3685456fadb61df6655583cf1c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 18:14:07 +0800 Subject: [PATCH 0048/2039] Create 1855-maximum-distance-between-a-pair-of-values.js --- ...ximum-distance-between-a-pair-of-values.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1855-maximum-distance-between-a-pair-of-values.js diff --git a/1855-maximum-distance-between-a-pair-of-values.js b/1855-maximum-distance-between-a-pair-of-values.js new file mode 100644 index 00000000..ff799df6 --- /dev/null +++ b/1855-maximum-distance-between-a-pair-of-values.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const maxDistance = function(nums1, nums2) { + let res = 0 + const m = nums1.length, n = nums2.length + for(let i = 0; i < m; i++) { + const idx = bSearch(nums2, i, n - 1, nums1[i]) + res = Math.max(res, idx - i) + } + return res +}; + +function bSearch(a, i, j, key) { + while (i <= j) { + let mid = (i + j) >>> 1 + if (key <= a[mid]) i = mid + 1 + else if(key > a[mid]) j = mid - 1 + } + return i - 1 +} From 23d7c3b237beeeb04fdff930d37a30bbad488dac Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 21:03:45 +0800 Subject: [PATCH 0049/2039] Update 1849-splitting-a-string-into-descending-consecutive-values.js --- ...ring-into-descending-consecutive-values.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1849-splitting-a-string-into-descending-consecutive-values.js b/1849-splitting-a-string-into-descending-consecutive-values.js index ef29c79f..48e25d46 100644 --- a/1849-splitting-a-string-into-descending-consecutive-values.js +++ b/1849-splitting-a-string-into-descending-consecutive-values.js @@ -1,3 +1,26 @@ +/** + * @param {string} s + * @return {boolean} + */ +const splitString = function(s) { + return helper(s, null) +}; + +function helper(str, previous) { + for(let i = 0, n = str.length; i < n; i++) { + const tmp = +(str.slice(0, i + 1)) + if(previous == null) { + if(helper(str.slice(i + 1), tmp)) return true + } else if(previous - tmp === 1 && (i === n - 1 || helper(str.slice(i + 1), tmp))) return true + } + + return false +} + + +// another + + /** * @param {string} s * @return {boolean} From d26f7e6f72b30a5ef8602bf96fb5a73f404157b9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 21:44:04 +0800 Subject: [PATCH 0050/2039] Create 1857-largest-color-value-in-a-directed-graph.js --- ...largest-color-value-in-a-directed-graph.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1857-largest-color-value-in-a-directed-graph.js diff --git a/1857-largest-color-value-in-a-directed-graph.js b/1857-largest-color-value-in-a-directed-graph.js new file mode 100644 index 00000000..4914fbfd --- /dev/null +++ b/1857-largest-color-value-in-a-directed-graph.js @@ -0,0 +1,41 @@ +/** + * @param {string} colors + * @param {number[][]} edges + * @return {number} + */ + const largestPathValue = function(colors, edges) { + const graph = {} + const n = colors.length, a = 'a'.charCodeAt(0) + const indegree = Array(colors.length).fill(0) + for(let e of edges) { + if(graph[e[0]] == null) graph[e[0]] = [] + graph[e[0]].push(e[1]) + indegree[e[1]]++ + } + const cnt = Array.from({ length: n }, () => Array(26).fill(0)) + const q = [] + for(let i = 0; i < n; i++) { + if(indegree[i] === 0) { + q.push(i) + cnt[i][colors.charCodeAt(i) - a] = 1 + } + } + let res = 0, seen = 0 + while(q.length) { + const u = q[0] + q.shift() + let val = Math.max(...cnt[u]) + res = Math.max(res, val) + seen++ + if(graph[u] == null) continue + for(let v of graph[u]) { + for(let i = 0; i < 26; i++) { + cnt[v][i] = Math.max(cnt[v][i], cnt[u][i] + (i === colors.charCodeAt(v) - a)) + } + if(--indegree[v] === 0) q.push(v) + } + } + return seen < colors.length ? -1 : res + }; + + From f8094d91b21e97dedb62b441c75fa8eacb912cba Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 May 2021 21:44:39 +0800 Subject: [PATCH 0051/2039] Update 1857-largest-color-value-in-a-directed-graph.js --- ...largest-color-value-in-a-directed-graph.js | 69 ++++++++++--------- 1 file changed, 36 insertions(+), 33 deletions(-) diff --git a/1857-largest-color-value-in-a-directed-graph.js b/1857-largest-color-value-in-a-directed-graph.js index 4914fbfd..47bd3060 100644 --- a/1857-largest-color-value-in-a-directed-graph.js +++ b/1857-largest-color-value-in-a-directed-graph.js @@ -3,39 +3,42 @@ * @param {number[][]} edges * @return {number} */ - const largestPathValue = function(colors, edges) { - const graph = {} - const n = colors.length, a = 'a'.charCodeAt(0) - const indegree = Array(colors.length).fill(0) - for(let e of edges) { - if(graph[e[0]] == null) graph[e[0]] = [] - graph[e[0]].push(e[1]) - indegree[e[1]]++ +const largestPathValue = function (colors, edges) { + const graph = {} + const n = colors.length, + a = 'a'.charCodeAt(0) + const indegree = Array(colors.length).fill(0) + for (let e of edges) { + if (graph[e[0]] == null) graph[e[0]] = [] + graph[e[0]].push(e[1]) + indegree[e[1]]++ + } + const cnt = Array.from({ length: n }, () => Array(26).fill(0)) + const q = [] + for (let i = 0; i < n; i++) { + if (indegree[i] === 0) { + q.push(i) + cnt[i][colors.charCodeAt(i) - a] = 1 } - const cnt = Array.from({ length: n }, () => Array(26).fill(0)) - const q = [] - for(let i = 0; i < n; i++) { - if(indegree[i] === 0) { - q.push(i) - cnt[i][colors.charCodeAt(i) - a] = 1 + } + let res = 0, + seen = 0 + while (q.length) { + const u = q[0] + q.shift() + let val = Math.max(...cnt[u]) + res = Math.max(res, val) + seen++ + if (graph[u] == null) continue + for (let v of graph[u]) { + for (let i = 0; i < 26; i++) { + cnt[v][i] = Math.max( + cnt[v][i], + cnt[u][i] + (i === colors.charCodeAt(v) - a) + ) } + if (--indegree[v] === 0) q.push(v) } - let res = 0, seen = 0 - while(q.length) { - const u = q[0] - q.shift() - let val = Math.max(...cnt[u]) - res = Math.max(res, val) - seen++ - if(graph[u] == null) continue - for(let v of graph[u]) { - for(let i = 0; i < 26; i++) { - cnt[v][i] = Math.max(cnt[v][i], cnt[u][i] + (i === colors.charCodeAt(v) - a)) - } - if(--indegree[v] === 0) q.push(v) - } - } - return seen < colors.length ? -1 : res - }; - - + } + return seen < colors.length ? -1 : res +} From 13614982df99caf5d0c6e1c1d3085f72fc0e6e7c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 May 2021 12:06:46 +0800 Subject: [PATCH 0052/2039] Update 131-palindrome-partitioning.js --- 131-palindrome-partitioning.js | 37 ++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/131-palindrome-partitioning.js b/131-palindrome-partitioning.js index c528343b..56ebb6cb 100644 --- a/131-palindrome-partitioning.js +++ b/131-palindrome-partitioning.js @@ -31,3 +31,40 @@ function isPalindrome(str, start, i) { } return true } + +// another + +/** + * @param {string} s + * @return {string[][]} + */ +const partition = function(s) { + const res = [] + helper(s, 0, [], res) + return res +}; + +function helper(str, idx, cur, res) { + if(idx >= str.length) { + res.push(cur.slice()) + return + } + for(let i = idx, len = str.length; i < len; i++) { + const tmp = str.slice(idx, i + 1) + if(chk(tmp)) { + cur.push(tmp) + helper(str, i + 1, cur, res) + cur.pop() + } + } +} +function chk(str) { + const n = str.length + let l = 0, r = n - 1 + while(l < r) { + if(str[l] !== str[r]) return false + l++ + r-- + } + return true +} From 521b1b67f92a15c726d05a7a2ab5bfa7d5d40bd5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 May 2021 17:10:02 +0800 Subject: [PATCH 0053/2039] Update 291-word-pattern-ii.js --- 291-word-pattern-ii.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/291-word-pattern-ii.js b/291-word-pattern-ii.js index c0243b91..91f77ac2 100644 --- a/291-word-pattern-ii.js +++ b/291-word-pattern-ii.js @@ -28,3 +28,41 @@ function isMatch(str, i, pat, j, map, set) { } return false } + +// another + +/** + * @param {string} pattern + * @param {string} s + * @return {boolean} + */ +const wordPatternMatch = function(pattern, s) { + const obj = { res: false } + const hash = {} + helper(pattern, s, 0, 0, hash, obj) + return obj.res +}; + +function helper(p, s, i, j, hash, obj) { + if(obj.res) return + if(i === p.length && j === s.length) { + obj.res = true + return + } + if(i >= p.length || j >= s.length) return + for(let m = j; m < s.length && obj.res === false; m++) { + const tmp = s.slice(j, m + 1) + if(hash[p[i]]) { + if(tmp === hash[p[i]]) { + helper(p, s, i + 1, m + 1, hash, obj) + } + } else { + const set = new Set(Object.values(hash)) + if (!set.has(tmp)) { + hash[p[i]] = tmp + helper(p, s, i + 1, m + 1, hash, obj) + delete hash[p[i]] + } + } + } +} From 216822059bd2537b8d962c5630b96bd99a1d7e12 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 May 2021 20:37:24 +0800 Subject: [PATCH 0054/2039] Update 907-sum-of-subarray-minimums.js --- 907-sum-of-subarray-minimums.js | 39 +++++++++++++++++---------------- 1 file changed, 20 insertions(+), 19 deletions(-) diff --git a/907-sum-of-subarray-minimums.js b/907-sum-of-subarray-minimums.js index 9268882a..e41a04d9 100644 --- a/907-sum-of-subarray-minimums.js +++ b/907-sum-of-subarray-minimums.js @@ -2,35 +2,36 @@ * @param {number[]} A * @return {number} */ -const sumSubarrayMins = function(A) { - let n = A.length; - let s1 = []; - let s2 = []; - let left = new Array(n); - let right = new Array(n); +const sumSubarrayMins = function (A) { + const n = A.length + const s1 = [] + const s2 = [] + const left = new Array(n) + const right = new Array(n) for (let i = 0; i < n; i++) { - let count = 1; + let count = 1 while (s1.length && s1[s1.length - 1][0] > A[i]) { - count += s1.pop()[1]; + count += s1.pop()[1] } - left[i] = count; - s1.push([A[i], count]); + left[i] = count + s1.push([A[i], count]) } for (let i = n - 1; i >= 0; i--) { - let count = 1; + let count = 1 + // use ">=" to deal with duplicate elements while (s2.length && s2[s2.length - 1][0] >= A[i]) { - count += s2.pop()[1]; + count += s2.pop()[1] } - right[i] = count; - s2.push([A[i], count]); + right[i] = count + s2.push([A[i], count]) } - let res = 0; - let mod = 1e9 + 7; + let res = 0 + const mod = 1e9 + 7 for (let i = 0; i < n; i++) { - res = (res + left[i] * A[i] * right[i]) % mod; + res = (res + left[i] * A[i] * right[i]) % mod } - return res; -}; + return res +} From 6550b7e2dccd2c5905fc77ff33885b16119a506a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 May 2021 22:17:18 +0800 Subject: [PATCH 0055/2039] Update 907-sum-of-subarray-minimums.js --- 907-sum-of-subarray-minimums.js | 48 +++++++++++++++------------------ 1 file changed, 22 insertions(+), 26 deletions(-) diff --git a/907-sum-of-subarray-minimums.js b/907-sum-of-subarray-minimums.js index e41a04d9..5a503f9f 100644 --- a/907-sum-of-subarray-minimums.js +++ b/907-sum-of-subarray-minimums.js @@ -1,37 +1,33 @@ /** - * @param {number[]} A + * @param {number[]} arr * @return {number} */ -const sumSubarrayMins = function (A) { - const n = A.length - const s1 = [] - const s2 = [] - const left = new Array(n) - const right = new Array(n) - - for (let i = 0; i < n; i++) { - let count = 1 - while (s1.length && s1[s1.length - 1][0] > A[i]) { - count += s1.pop()[1] +const sumSubarrayMins = function(arr) { + const n = arr.length, s1 = [], s2 = [], left = Array(n), right = Array(n) + for(let i = 0; i < n; i++) { + let cnt = 1 + while(s1.length && s1[s1.length - 1][0] > arr[i]) { + cnt += s1.pop()[1] } - left[i] = count - s1.push([A[i], count]) + left[i] = cnt + s1.push([arr[i], cnt]) } - - for (let i = n - 1; i >= 0; i--) { - let count = 1 - // use ">=" to deal with duplicate elements - while (s2.length && s2[s2.length - 1][0] >= A[i]) { - count += s2.pop()[1] + + for(let i = n - 1; i >= 0; i--) { + let cnt = 1 + while(s2.length && s2[s2.length - 1][0] >= arr[i]) { + cnt += s2.pop()[1] } - right[i] = count - s2.push([A[i], count]) + right[i] = cnt + s2.push([arr[i], cnt]) } - let res = 0 const mod = 1e9 + 7 - for (let i = 0; i < n; i++) { - res = (res + left[i] * A[i] * right[i]) % mod + for(let i = 0; i < n; i++) { + // left[i] number of starting positions + // right[i] number of ending positions + res = (res + arr[i] * left[i] * right[i]) % mod } + return res -} +}; From a010bd29583c025d040ca64b525e272f1343ee83 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 May 2021 22:18:02 +0800 Subject: [PATCH 0056/2039] Update 907-sum-of-subarray-minimums.js --- 907-sum-of-subarray-minimums.js | 1 + 1 file changed, 1 insertion(+) diff --git a/907-sum-of-subarray-minimums.js b/907-sum-of-subarray-minimums.js index 5a503f9f..b9cf6459 100644 --- a/907-sum-of-subarray-minimums.js +++ b/907-sum-of-subarray-minimums.js @@ -15,6 +15,7 @@ const sumSubarrayMins = function(arr) { for(let i = n - 1; i >= 0; i--) { let cnt = 1 + // use ">=" to deal with duplicate elements while(s2.length && s2[s2.length - 1][0] >= arr[i]) { cnt += s2.pop()[1] } From 33ffa9af2a2bb1af0b6cd9eb43bd4d7b2e63c225 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 13 May 2021 20:50:17 +0800 Subject: [PATCH 0057/2039] Update 1856-maximum-subarray-min-product.js --- 1856-maximum-subarray-min-product.js | 47 ++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1856-maximum-subarray-min-product.js b/1856-maximum-subarray-min-product.js index 439b0d94..163784e3 100644 --- a/1856-maximum-subarray-min-product.js +++ b/1856-maximum-subarray-min-product.js @@ -44,3 +44,50 @@ function bigint_max(...args){ args.forEach(a=>{if (a > m) {m = a}}); return m; } + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const maxSumMinProduct = function(nums) { + const n = nums.length, s1 = [], s2 = [], + left = Array(n), right = Array(n), mod = BigInt(1e9 + 7) + for(let i = 0; i < n; i++) { + while(s1.length && nums[s1[s1.length - 1]] >= nums[i]) s1.pop() + if(s1.length) left[i] = s1[s1.length - 1] + 1 + else left[i] = 0 + s1.push(i) + } + + for(let i = n - 1; i >= 0; i--) { + while(s2.length && nums[s2[s2.length - 1]] >= nums[i]) s2.pop() + if(s2.length) right[i] = s2[s2.length - 1] - 1 + else right[i] = n - 1 + s2.push(i) + } + + const preSum = Array(n) + for(let i = 0; i < n; i++) { + preSum[i] = (i === 0 ? 0n : preSum[i - 1]) + BigInt(nums[i]) + } + let res = 0n + for(let i = 0; i < n; i++) { + res = max(res, getSum(preSum, left[i], right[i]) * BigInt(nums[i])) + } + return res % mod + +}; + +function getSum(arr, l, r) { + return arr[r] - (l === 0 ? 0n : arr[l - 1]) +} + +function max(...args) { + let res = -Infinity + for(let e of args) { + if(e > res) res = e + } + return res +} From 0b6acaeb389ee0cfb9f38f6af19d52d61a423f53 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 14 May 2021 22:49:28 +0800 Subject: [PATCH 0058/2039] Update 1857-largest-color-value-in-a-directed-graph.js --- 1857-largest-color-value-in-a-directed-graph.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/1857-largest-color-value-in-a-directed-graph.js b/1857-largest-color-value-in-a-directed-graph.js index 47bd3060..be5c8ba3 100644 --- a/1857-largest-color-value-in-a-directed-graph.js +++ b/1857-largest-color-value-in-a-directed-graph.js @@ -26,7 +26,7 @@ const largestPathValue = function (colors, edges) { while (q.length) { const u = q[0] q.shift() - let val = Math.max(...cnt[u]) + const val = Math.max(...cnt[u]) res = Math.max(res, val) seen++ if (graph[u] == null) continue From d5a7ab056894b39a944d5e36d790655bf57ea90d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 May 2021 21:39:32 +0800 Subject: [PATCH 0059/2039] Update 1591-strange-printer-ii.js --- 1591-strange-printer-ii.js | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/1591-strange-printer-ii.js b/1591-strange-printer-ii.js index c5a48fd6..5e9be1d4 100644 --- a/1591-strange-printer-ii.js +++ b/1591-strange-printer-ii.js @@ -13,13 +13,13 @@ const isPrintable = function (targetGrid) { for (let j = 0; j < n; j++) { let c = targetGrid[i][j] colorSet.add(c) - posMin[c][0] = Math.min(posMin[c][0], i) // Up - posMin[c][1] = Math.min(posMin[c][1], j) // Left - posMax[c][0] = Math.max(posMax[c][0], i) // Down - posMax[c][1] = Math.max(posMax[c][1], j) // Right + posMin[c][0] = Math.min(posMin[c][0], i) //Up + posMin[c][1] = Math.min(posMin[c][1], j) //Left + posMax[c][0] = Math.max(posMax[c][0], i) //Down + posMax[c][1] = Math.max(posMax[c][1], j) //Right } } - while (colorSet.size > 0) { + while (colorSet.size) { const tmp = new Set() for (let color of colorSet) { if (!isRect(targetGrid, color)) { @@ -45,6 +45,7 @@ const isPrintable = function (targetGrid) { A[i][j] = 0 } } + return true } } From b8cc0d1c51b2b3bc2b60d2acb4ab04dead3a7702 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 May 2021 16:52:13 +0800 Subject: [PATCH 0060/2039] Create 1863-sum-of-all-subset-xor-totals.js --- 1863-sum-of-all-subset-xor-totals.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1863-sum-of-all-subset-xor-totals.js diff --git a/1863-sum-of-all-subset-xor-totals.js b/1863-sum-of-all-subset-xor-totals.js new file mode 100644 index 00000000..1597b8b1 --- /dev/null +++ b/1863-sum-of-all-subset-xor-totals.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const subsetXORSum = function(nums) { + let res = {sum: 0} + + helper(nums, 0, [], res) + return res.sum +}; + +function helper(arr, idx, cur, res) { + if(idx === arr.length) { + res.sum += calc(cur) + return + } + const clone = cur.slice() + helper(arr, idx + 1, clone, res) + const c2 = cur.slice() + c2.push(arr[idx]) + helper(arr, idx + 1, c2, res) +} + +function calc(arr) { + let res = 0 + for(let e of arr) res ^= e + return res +} From 7489b958c0d92da37823a446d4431d90a120a2b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 May 2021 16:54:02 +0800 Subject: [PATCH 0061/2039] Create 1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.js --- ...s-to-make-the-binary-string-alternating.js | 53 +++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.js diff --git a/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.js b/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.js new file mode 100644 index 00000000..86d29d67 --- /dev/null +++ b/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.js @@ -0,0 +1,53 @@ +/** + * @param {string} s + * @return {number} + */ +const minSwaps = function(s) { + const valid = chk(s) + if(valid === -1) return -1 + const [zeroNum, oneNum] = valid + let res = Infinity + if(zeroNum === oneNum) { + // zero start + let tmpZero = 0 + let cur = '0' + for(let i = 0; i < s.length; i++) { + if(i % 2 === 0 && s[i] !== '0') tmpZero++ + } + + res = Math.min(tmpZero, res) + // one start + let tmpOne = 0 + cur = '1' + for(let i = 0; i < s.length; i++) { + if(i % 2 === 0 && s[i] !== '1') tmpOne++ + } + res = Math.min(tmpOne, res) + } else if(zeroNum > oneNum) { + let tmpZero = 0 + let cur = '0' + for(let i = 0; i < s.length; i++) { + if(i % 2 === 0 && s[i] !== '0') tmpZero++ + } + + res = Math.min(tmpZero, res) + } else { + let tmpOne = 0 + cur = '1' + for(let i = 0; i < s.length; i++) { + if(i % 2 === 0 && s[i] !== '1') tmpOne++ + } + res = Math.min(tmpOne, res) + } + return res +}; + +function chk(str) { + let oneNum = 0, zeroNum = 0 + for(let ch of str) { + if(ch === '0') zeroNum++ + else oneNum++ + } + return Math.abs(zeroNum - oneNum) <= 1 ? [zeroNum, oneNum] : -1 +} + From 9cb36a08c19d0548e81fe7b6723e5da05740f09a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 May 2021 16:54:34 +0800 Subject: [PATCH 0062/2039] Create 1865-finding-pairs-with-a-certain-sum.js --- 1865-finding-pairs-with-a-certain-sum.js | 50 ++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 1865-finding-pairs-with-a-certain-sum.js diff --git a/1865-finding-pairs-with-a-certain-sum.js b/1865-finding-pairs-with-a-certain-sum.js new file mode 100644 index 00000000..984fd296 --- /dev/null +++ b/1865-finding-pairs-with-a-certain-sum.js @@ -0,0 +1,50 @@ + +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + */ +const FindSumPairs = function(nums1, nums2) { + this.nums1 = nums1 + this.nums2 = nums2 + const m = nums1.length, n = nums2.length + this.mp = {} + for(let x of nums2) { + if(this.mp[x] == null) this.mp[x] = 0 + this.mp[x]++ + } +}; + +/** + * @param {number} index + * @param {number} val + * @return {void} + */ +FindSumPairs.prototype.add = function(index, val) { + if(val !== 0) { + if(!(--this.mp[this.nums2[index]])) delete this.mp[this.nums2[index]] + } + this.nums2[index] += val + if(this.mp[this.nums2[index]] == null) this.mp[this.nums2[index]] = 0 + if(val !== 0)this.mp[this.nums2[index]]++ +}; + +/** + * @param {number} tot + * @return {number} + */ +FindSumPairs.prototype.count = function(tot) { + let ans = 0; + for (let x of this.nums1) { + let res = tot - x; + if (!this.mp[res]) continue; + ans += this.mp[res]; + } + return ans; +}; + +/** + * Your FindSumPairs object will be instantiated and called as such: + * var obj = new FindSumPairs(nums1, nums2) + * obj.add(index,val) + * var param_2 = obj.count(tot) + */ From 1ad83f5781f525280907899aa8fe31c67e9998e2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 May 2021 16:55:07 +0800 Subject: [PATCH 0063/2039] Create 1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js --- ...-to-rearrange-sticks-with-k-sticks-visible.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js diff --git a/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js b/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js new file mode 100644 index 00000000..4ff4a255 --- /dev/null +++ b/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js @@ -0,0 +1,16 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const rearrangeSticks = function(n, k) { + const mod = BigInt(1e9 + 7) + const g = Array.from({ length: 1001 }, () => Array(1001).fill(0n)) + g[1][1] = 1n + for(let i = 2; i <= 1000; i++) { + for(let j = 1; j <= i; j++ ) { + g[i][j] = (g[i - 1][j - 1] + BigInt(i - 1) * g[i - 1][j] % mod) % mod + } + } + return g[n][k] +}; From 2f842ea60ca320ebfab3e614684381652d358a57 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 May 2021 19:55:12 +0800 Subject: [PATCH 0064/2039] Create 1462-course-schedule-iv.js --- 1462-course-schedule-iv.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1462-course-schedule-iv.js diff --git a/1462-course-schedule-iv.js b/1462-course-schedule-iv.js new file mode 100644 index 00000000..7faaa98d --- /dev/null +++ b/1462-course-schedule-iv.js @@ -0,0 +1,21 @@ +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @param {number[][]} queries + * @return {boolean[]} + */ +const checkIfPrerequisite = function(numCourses, prerequisites, queries) { + const n = numCourses + const connected = Array.from({ length: n }, () => Array(n).fill(false)) + for(let p of prerequisites) connected[p[0]][p[1]] = true + for(let k = 0; k < n; k++) { + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + connected[i][j] = connected[i][j] || (connected[i][k] && connected[k][j]); + } + } + } + const res = [] + for(let q of queries) res.push(connected[q[0]][q[1]]) + return res +}; From 4b7fd933c957a66645ca6da9e8334d3375082d1f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 May 2021 20:08:43 +0800 Subject: [PATCH 0065/2039] Update 1462-course-schedule-iv.js --- 1462-course-schedule-iv.js | 1 + 1 file changed, 1 insertion(+) diff --git a/1462-course-schedule-iv.js b/1462-course-schedule-iv.js index 7faaa98d..33ec5f9c 100644 --- a/1462-course-schedule-iv.js +++ b/1462-course-schedule-iv.js @@ -5,6 +5,7 @@ * @return {boolean[]} */ const checkIfPrerequisite = function(numCourses, prerequisites, queries) { + // https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm const n = numCourses const connected = Array.from({ length: n }, () => Array(n).fill(false)) for(let p of prerequisites) connected[p[0]][p[1]] = true From b16714220e995264b85f7a2d0fbec60082377604 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 May 2021 19:50:40 +0800 Subject: [PATCH 0066/2039] Create 802-find-eventual-safe-states.js --- 802-find-eventual-safe-states.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 802-find-eventual-safe-states.js diff --git a/802-find-eventual-safe-states.js b/802-find-eventual-safe-states.js new file mode 100644 index 00000000..44a5d8b4 --- /dev/null +++ b/802-find-eventual-safe-states.js @@ -0,0 +1,26 @@ +/** + * @param {number[][]} graph + * @return {number[]} + */ +const eventualSafeNodes = function(graph) { + const n = graph.length, memo = {}, visited = new Set(), res = [] + for(let i = 0; i < n; i++) { + if(!dfs(graph, i, memo, visited)) res.push(i) + } + return res +}; + +function dfs(graph, node, memo, visited) { + if(memo[node] != null) return memo[node] + let hasCycle = false + visited.add(node) + for(let e of graph[node]) { + if(visited.has(e) || dfs(graph, e, memo, visited)) { + hasCycle = true + break + } + } + visited.delete(node) + memo[node] = hasCycle + return hasCycle +} From 55dbfa6b8e120b1bcfa5b34f43f4db35eb85b43f Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 May 2021 20:32:24 +0800 Subject: [PATCH 0067/2039] Create 1867-orders-with-maximum-quantity-above-average.sql --- 1867-orders-with-maximum-quantity-above-average.sql | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 1867-orders-with-maximum-quantity-above-average.sql diff --git a/1867-orders-with-maximum-quantity-above-average.sql b/1867-orders-with-maximum-quantity-above-average.sql new file mode 100644 index 00000000..744035ce --- /dev/null +++ b/1867-orders-with-maximum-quantity-above-average.sql @@ -0,0 +1,10 @@ +# Write your MySQL query statement below +select order_id from OrdersDetails +group by order_id +having max(quantity) > ( + select max(avg_quantity) from + (select order_id, sum(quantity) / count(product_id) as avg_quantity + from OrdersDetails + group by order_id + ) t +); From c8493e0646e9941922023dbfe658427d66c8eda4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 May 2021 20:55:04 +0800 Subject: [PATCH 0068/2039] Create 1859-sorting-the-sentence.js --- 1859-sorting-the-sentence.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1859-sorting-the-sentence.js diff --git a/1859-sorting-the-sentence.js b/1859-sorting-the-sentence.js new file mode 100644 index 00000000..8da3d884 --- /dev/null +++ b/1859-sorting-the-sentence.js @@ -0,0 +1,13 @@ +/** + * @param {string} s + * @return {string} + */ +const sortSentence = function(s) { + const arr = s.split(' ') + const n = arr.length, res = Array(n) + for(let e of arr) { + const idx = +e[e.length - 1] + res[idx - 1] = e.slice(0, e.length - 1) + } + return res.join(' ') +}; From 79d92cafc820512ef4717023ecb74ade52d87fd9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 May 2021 21:42:00 +0800 Subject: [PATCH 0069/2039] Create 1860-incremental-memory-leak.js --- 1860-incremental-memory-leak.js | 34 +++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1860-incremental-memory-leak.js diff --git a/1860-incremental-memory-leak.js b/1860-incremental-memory-leak.js new file mode 100644 index 00000000..2eaf5bbd --- /dev/null +++ b/1860-incremental-memory-leak.js @@ -0,0 +1,34 @@ +/** + * @param {number} memory1 + * @param {number} memory2 + * @return {number[]} + */ +const memLeak = function(memory1, memory2) { + let i = 1 + const res = Array(3).fill(0) + res[0] = 1 + res[1] = memory1 + res[2] = memory2 + while(true) { + if(res[1] >= i || res[2] >= i) { + if(res[1] >= i && res[2] >= i) { + if(res[1] === res[2]) { + res[1] -= i + } else if(res[1] > res[2]) { + res[1] -= i + } else { + res[2] -= i + } + } else if(res[1] >= i) { + res[1] -= i + } else if(res[2] >= i){ + res[2] -= i + } + } else { + res[0] = i + return res + } + + i++ + } +}; From 9f2a4d917c07e457a9599c6286577dc5369cfbd8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 May 2021 21:31:21 +0800 Subject: [PATCH 0070/2039] Update 48-rotate-image.js --- 48-rotate-image.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/48-rotate-image.js b/48-rotate-image.js index 7274fa2d..ba36f95b 100644 --- a/48-rotate-image.js +++ b/48-rotate-image.js @@ -21,3 +21,22 @@ const rotate = function(matrix) { } } } + +// another + +/** + * @param {number[][]} matrix + * @return {void} Do not return anything, modify matrix in-place instead. + */ +const rotate = function (matrix) { + matrix.reverse() + for (let i = 0; i < matrix.length; ++i) { + for (let j = i + 1; j < matrix[i].length; ++j) swap(matrix, i, j) + } +} + +function swap(matrix, i, j) { + const tmp = matrix[j][i] + matrix[j][i] = matrix[i][j] + matrix[i][j] = tmp +} From 23285ac43dd10faba985d5fdd90713282aa0aa4f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 May 2021 19:33:22 +0800 Subject: [PATCH 0071/2039] Create 1861-rotating-the-box.js --- 1861-rotating-the-box.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1861-rotating-the-box.js diff --git a/1861-rotating-the-box.js b/1861-rotating-the-box.js new file mode 100644 index 00000000..dd5c683e --- /dev/null +++ b/1861-rotating-the-box.js @@ -0,0 +1,26 @@ +/** + * @param {character[][]} box + * @return {character[][]} + */ +const rotateTheBox = function(box) { + const m = box.length, n = box[0].length + const res = Array.from({ length: n }, () => Array(m).fill('.')) + for(let i = 0; i < m; i++) { + let j = n - 1 + let pos = j + while(j >= 0) { + if(box[i][j] === '*') { + pos = j - 1 + } else if(box[i][j] === '#') { + box[i][j] = '.' + box[i][pos] = '#' + res[pos][m - 1 - i] = '#' + pos-- + } + res[j][m - 1 - i] = box[i][j] + j-- + } + + } + return res +}; From c855c194bfa88f42bdded4a7e3839dcb51076eee Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 May 2021 22:09:46 +0800 Subject: [PATCH 0072/2039] Update 1861-rotating-the-box.js --- 1861-rotating-the-box.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1861-rotating-the-box.js b/1861-rotating-the-box.js index dd5c683e..dcd137ee 100644 --- a/1861-rotating-the-box.js +++ b/1861-rotating-the-box.js @@ -1,3 +1,27 @@ +/** + * @param {character[][]} box + * @return {character[][]} + */ +const rotateTheBox = function(box) { + const m = box.length, n = box[0].length + const res = Array.from({ length: n }, () => Array(m).fill('.')) + for(let i = 0; i < m; i++) { + for(let j = n - 1, pos = n - 1; j >= 0; j--) { + if(box[i][j] === '.') continue + if(box[i][j] === '#') { + res[pos][m - 1 - i] = '#' + pos-- + } else { + res[j][m - 1 - i] = '*' + pos = j - 1 + } + } + } + return res +}; + +// another + /** * @param {character[][]} box * @return {character[][]} From 519e72e1a6ce5b585910e0daee1ae3db3471d234 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 20 May 2021 19:28:25 +0800 Subject: [PATCH 0073/2039] Create 1862-sum-of-floored-pairs.js --- 1862-sum-of-floored-pairs.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 1862-sum-of-floored-pairs.js diff --git a/1862-sum-of-floored-pairs.js b/1862-sum-of-floored-pairs.js new file mode 100644 index 00000000..bd6ac4f7 --- /dev/null +++ b/1862-sum-of-floored-pairs.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const sumOfFlooredPairs = function (nums) { + const MAX = Math.max(...nums) + const countsGreaterOrEqualTo = new Array(MAX + 1).fill(0) + const numCounts = new Map() + const MOD = 1e9 + 7 + nums.forEach((num) => { + countsGreaterOrEqualTo[num]++ + numCounts.set(num, (numCounts.get(num) || 0) + 1) + }) + + for (let num = MAX - 1; num >= 0; num--) { + countsGreaterOrEqualTo[num] += countsGreaterOrEqualTo[num + 1] + } + + let totalCount = 0 + numCounts.forEach((count, num) => { + let current = num + while (current <= MAX) { + totalCount = (totalCount + countsGreaterOrEqualTo[current] * count) % MOD + current += num + } + }) + + return totalCount +} From db3653cb9d9d6c7e1e2f672bf4535df1389454c5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 May 2021 14:00:11 +0800 Subject: [PATCH 0074/2039] Update 470-implement-rand10-using-rand7.js --- 470-implement-rand10-using-rand7.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/470-implement-rand10-using-rand7.js b/470-implement-rand10-using-rand7.js index 9ea03193..eef7543c 100644 --- a/470-implement-rand10-using-rand7.js +++ b/470-implement-rand10-using-rand7.js @@ -10,3 +10,17 @@ const rand10 = function() { } return (result % 10) + 1 } + +// another + +/** + * The rand7() API is already defined for you. + * var rand7 = function() {} + * @return {number} a random integer in the range 1 to 7 + */ +const rand10 = function() { + let tmp = 40 + while(tmp >= 40) tmp = 7 * (rand7() - 1) + (rand7() - 1) + + return tmp % 10 + 1 +}; From e882167372ee999aa0f5d56342d8d5be963876f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 May 2021 22:41:32 +0800 Subject: [PATCH 0075/2039] Update 1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js --- ...-rearrange-sticks-with-k-sticks-visible.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js b/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js index 4ff4a255..e652838e 100644 --- a/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js +++ b/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.js @@ -14,3 +14,28 @@ const rearrangeSticks = function(n, k) { } return g[n][k] }; + +// another + +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const rearrangeSticks = function(n, k) { + const MOD = 1e9 + 7; + // first # can be smallest # in which case we recurse for (n - 1, k - 1) + // or it can not be and smallest can be in any of n - 1 otehr positions for recursed(n - 1, k) + const dp = new Array(n + 1).fill().map( _ => new Array(k + 1).fill(0) ); + for (let i = 1; i <= n; ++i) { + for (let j = 1; j <= k; ++j) { + if (j === i) { + dp[i][j] = 1; + } else if (j < i) { + dp[i][j] = (dp[i - 1][j - 1] + (i - 1) * dp[i - 1][j]) % MOD; + } + } + } + return dp[n][k] % MOD; + +}; From e939e0ad082171877d5b3e5afb9f4bd1d4efe923 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 22 May 2021 13:56:11 +0800 Subject: [PATCH 0076/2039] Update 903-valid-permutations-for-di-sequence.js --- 903-valid-permutations-for-di-sequence.js | 31 +++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/903-valid-permutations-for-di-sequence.js b/903-valid-permutations-for-di-sequence.js index a46b3fbd..8e5aaa60 100644 --- a/903-valid-permutations-for-di-sequence.js +++ b/903-valid-permutations-for-di-sequence.js @@ -1,3 +1,34 @@ +/** + * @param {string} s + * @return {number} + */ +const numPermsDISequence = function(s) { + const n = s.length, mod = 1e9 + 7 + const dp = Array.from({ length: n + 1}, () => Array(n + 1).fill(0)) + dp[0][0] = 1 + for(let i = 1; i <= n; i++) { + for(let j = 0; j <= i; j++) { + if(s[i - 1] === 'D') { + for(let k = j; k <= i - 1; k++) { + dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod + } + } else { + for(let k = 0; k < j; k++) { + dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod + } + } + } + } + let res = 0 + for(let i = 0; i <= n; i++) { + res = (res + dp[n][i]) % mod + } + + return res +}; + +// another + /** * @param {string} S * @return {number} From 57f65ceac86b1bcd96be4d8f14ba0a8cbfa9b770 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 May 2021 12:41:21 +0800 Subject: [PATCH 0077/2039] Create 1870-minimum-speed-to-arrive-on-time.js --- 1870-minimum-speed-to-arrive-on-time.js | 27 +++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 1870-minimum-speed-to-arrive-on-time.js diff --git a/1870-minimum-speed-to-arrive-on-time.js b/1870-minimum-speed-to-arrive-on-time.js new file mode 100644 index 00000000..975e6fa5 --- /dev/null +++ b/1870-minimum-speed-to-arrive-on-time.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} dist + * @param {number} hour + * @return {number} + */ +const minSpeedOnTime = function(dist, hour) { + const sum = dist.reduce((ac, e) => ac + e, 0) + let l = 1, r = 10 ** 7 + while(l < r) { + let mid = l + ((r - l) >> 1) + if(chk(mid)) r = mid + else l = mid + 1 + } + + return chk(l) ? l : -1 + + function chk(speed) { + let res = 0 + for(let i = 0, len = dist.length; i < len - 1; i++) { + res += Math.ceil(dist[i] / speed) + } + if (dist.length) res += dist[dist.length - 1] / speed + return res <= hour + } + +}; + From 55f98275f156e388e96e5c7cfd81051901b4aa3d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 May 2021 12:42:24 +0800 Subject: [PATCH 0078/2039] Create 1869-longer-contiguous-segments-of-ones-than-zeros.js --- ...-contiguous-segments-of-ones-than-zeros.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1869-longer-contiguous-segments-of-ones-than-zeros.js diff --git a/1869-longer-contiguous-segments-of-ones-than-zeros.js b/1869-longer-contiguous-segments-of-ones-than-zeros.js new file mode 100644 index 00000000..8fbceb89 --- /dev/null +++ b/1869-longer-contiguous-segments-of-ones-than-zeros.js @@ -0,0 +1,25 @@ +/** + * @param {string} s + * @return {boolean} + */ +const checkZeroOnes = function(s) { + const stack = [] + let zl = 0, ol = 0 + for(let e of s) { + let tmp = 0, zo = '' + while(stack.length && stack[stack.length - 1] !== e) { + if(zo === '') zo = stack[stack.length - 1] + tmp++ + stack.pop() + } + if(zo === '1') ol = Math.max(tmp, ol) + if(zo === '0') zl = Math.max(tmp, zl) + stack.push(e) + } + if(stack.length) { + let zo = stack[stack.length - 1] + if(zo === '1') ol = Math.max(stack.length, ol) + if(zo === '0') zl = Math.max(stack.length, zl) + } + return ol > zl +}; From ead91d2398453b72d7f3a524afbecbee79ade778 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 May 2021 12:43:44 +0800 Subject: [PATCH 0079/2039] Create 1872-stone-game-viii.js --- 1872-stone-game-viii.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1872-stone-game-viii.js diff --git a/1872-stone-game-viii.js b/1872-stone-game-viii.js new file mode 100644 index 00000000..e6067265 --- /dev/null +++ b/1872-stone-game-viii.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} stones + * @return {number} + */ +const stoneGameVIII = function (A) { + let N = A.length, + ans = -Infinity + for (let i = 1; i < N; ++i) A[i] += A[i - 1] // now A[i] becomes prefix[i] + let mx = A[N - 1] // dp[N - 1] = prefix[N - 1] + for (let i = N - 2; i >= 0; --i) { + ans = Math.max(ans, mx) // since dp[i] = mx, we try to use dp[i] to update ans. + mx = Math.max(mx, A[i] - mx) // try to update mx using prefix[i] - dp[i] + } + return ans +} From 3ad1e30a03cd6bee881713369f9bf23121063b1f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 May 2021 12:44:20 +0800 Subject: [PATCH 0080/2039] Create 1871-jump-game-vii.js --- 1871-jump-game-vii.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1871-jump-game-vii.js diff --git a/1871-jump-game-vii.js b/1871-jump-game-vii.js new file mode 100644 index 00000000..7913a351 --- /dev/null +++ b/1871-jump-game-vii.js @@ -0,0 +1,26 @@ +/** + * @param {string} s + * @param {number} minJump + * @param {number} maxJump + * @return {boolean} + */ +const canReach = function(s, minJump, maxJump) { + let n = s.length; + const {max, min} = Math + if (s[n - 1] != '0') return false; + const pre_sum = Array(n + 1).fill(0); + const check = Array(n + 1).fill(0); + check[1] = 1; + pre_sum[1] = 1; + for (let i = 1; i < n; i++) { + pre_sum[i + 1] = pre_sum[i]; + if (s[i] == '1') continue; + if (i < minJump) continue; + let r = i - minJump; + let l = max(0, i - maxJump); + if (pre_sum[r + 1] - pre_sum[l] == 0) continue; + check[i + 1] = true; + pre_sum[i + 1]++; + } + return check[n]; +}; From 31fcfc8a250c66890064cb86bc97aaf82b02ed52 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 May 2021 14:31:31 +0800 Subject: [PATCH 0081/2039] Update 1871-jump-game-vii.js --- 1871-jump-game-vii.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1871-jump-game-vii.js b/1871-jump-game-vii.js index 7913a351..c3950653 100644 --- a/1871-jump-game-vii.js +++ b/1871-jump-game-vii.js @@ -1,3 +1,31 @@ +/** + * @param {string} s + * @param {number} minJump + * @param {number} maxJump + * @return {boolean} + */ +const canReach = function(s, minJump, maxJump) { + const n = s.length + const queue = [0] + let mx = 0 + const { max, min } = Math + while(queue.length) { + const i = queue.shift() + for(let j = max(i + minJump, mx + 1); j < min(s.length, i + maxJump + 1); j++) { + if(s[j] === '0') { + if(j === n - 1) return true + queue.push(j) + } + } + mx = i + maxJump + } + + return false +}; + + +// another + /** * @param {string} s * @param {number} minJump From 29169117546797e43150f170b35fd3e387a9ac00 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 May 2021 21:05:50 +0800 Subject: [PATCH 0082/2039] Update 1094-car-pooling.js --- 1094-car-pooling.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1094-car-pooling.js b/1094-car-pooling.js index 9b82dc84..3d987e2d 100644 --- a/1094-car-pooling.js +++ b/1094-car-pooling.js @@ -12,3 +12,27 @@ const carPooling = function(trips, capacity) { for (let i = 0; capacity >= 0 && i < 1001; ++i) capacity -= stops[i] return capacity >= 0 } + +// another + +/** + * @param {number[][]} trips + * @param {number} capacity + * @return {boolean} + */ +const carPooling = function(trips, capacity) { + const arr = Array(1001).fill(0) + for(let el of trips) { + const [num, s, e] = el + arr[s] += num + arr[e] -= num + } + for(let i = 1; i < 1001; i++) { + if(arr[i] !== 0) arr[i] += arr[i - 1] + else arr[i] = arr[i - 1] + } + for(let e of arr) { + if(e > capacity) return false + } + return true +}; From 88accd7f6bd06737437d42f0b54c8c3fac708777 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 May 2021 13:22:27 +0800 Subject: [PATCH 0083/2039] Update 1109-corporate-flight-bookings.js --- 1109-corporate-flight-bookings.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/1109-corporate-flight-bookings.js b/1109-corporate-flight-bookings.js index d326526c..bb980cc8 100644 --- a/1109-corporate-flight-bookings.js +++ b/1109-corporate-flight-bookings.js @@ -12,3 +12,23 @@ const corpFlightBookings = function(bookings, n) { for (let i = 1; i < n; ++i) res[i] += res[i - 1] return res } + +// another + +/** + * @param {number[][]} bookings + * @param {number} n + * @return {number[]} + */ +const corpFlightBookings = function(bookings, n) { + const arr = Array(n + 2).fill(0) + for(let [s, e, num] of bookings) { + arr[s] += num + arr[e + 1] -= num + } + for(let i = 1; i <= n; i++) { + if(arr[i] !== 0) arr[i] += arr[i - 1] + else arr[i] = arr[i - 1] + } + return arr.slice(1, n + 1) +}; From b3de8abe3462511d6ba099b03df3ee418b3e4401 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 May 2021 21:04:46 +0800 Subject: [PATCH 0084/2039] Update 759-employee-free-time.js --- 759-employee-free-time.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/759-employee-free-time.js b/759-employee-free-time.js index 401a5d9f..ff19b672 100644 --- a/759-employee-free-time.js +++ b/759-employee-free-time.js @@ -113,3 +113,35 @@ const employeeFreeTime = function(schedule) { } return res } + +// another + +/** + * // Definition for an Interval. + * function Interval(start, end) { + * this.start = start; + * this.end = end; + * }; + */ + +/** + * @param {Interval[][]} schedule + * @return {Interval[]} + */ +const employeeFreeTime = function (schedule) { + const res = [], timeLine = [] + schedule.forEach(e => timeLine.push(...e)) + timeLine.sort((a, b) => a.start - b.start) + let tmp = timeLine[0] + for(let i = 1, n = timeLine.length; i < n; i++) { + const el = timeLine[i] + if(el.start > tmp.end) { + res.push(new Interval(tmp.end, el.start)) + tmp = el + } else { + tmp = el.end > tmp.end ? el : tmp + } + } + return res +} + From 0e77faebddc32b773407f547bc1452736d9ded57 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 May 2021 21:59:12 +0800 Subject: [PATCH 0085/2039] Update 5-longest-palindromic-substring.js --- 5-longest-palindromic-substring.js | 37 ++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/5-longest-palindromic-substring.js b/5-longest-palindromic-substring.js index 1c460a1f..76afe7f4 100755 --- a/5-longest-palindromic-substring.js +++ b/5-longest-palindromic-substring.js @@ -70,3 +70,40 @@ function preProcess(s) { ret += "#$"; return ret; } + +// another + +/** + * @param {string} s + * @return {string} + */ +const longestPalindrome = function(s) { + const n = s.length + let res = '' + for(let i = 0; i < n; i++) { + const first = chk(s, i, i, n) + if(first.length > res.length) res = first + const second = chk(s, i, i + 1, n) + if(second.length > res.length) res = second + } + return res +}; + +function chk(str, i, j, n) { + if(j >= n) return str[i] + let l = i, r = j + while(l >= 0 && r < n) { + if(str[l] === str[r]) { + l-- + r++ + } else { + return str.slice(l + 1, r) + } + } + if(l < 0) { + return str.slice(0, r) + } else { + return str.slice(l + 1, n) + } +} + From 23a0f022c98a057fd0e42ec7b52b3b742c47abd7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 May 2021 22:09:06 +0800 Subject: [PATCH 0086/2039] Update 1871-jump-game-vii.js --- 1871-jump-game-vii.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/1871-jump-game-vii.js b/1871-jump-game-vii.js index c3950653..ace67d12 100644 --- a/1871-jump-game-vii.js +++ b/1871-jump-game-vii.js @@ -52,3 +52,25 @@ const canReach = function(s, minJump, maxJump) { } return check[n]; }; + +// another + +/** + * @param {string} s + * @param {number} minJump + * @param {number} maxJump + * @return {boolean} + */ +const canReach = function(s, minJump, maxJump) { + const n = s.length, dp = Array(n).fill(0) + dp[0] = 1 + let pre = 0 + for(let i = 1; i < n; i++) { + if(i >= minJump) { + pre += dp[i - minJump] + } + if(i > maxJump) pre -= dp[i - maxJump - 1] + dp[i] = pre > 0 && s[i] === '0' ? 1 : 0 + } + return dp[n - 1] +}; From c5577654b39813bd9d72d2f6c5ab474d0ad96f1c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 May 2021 21:37:49 +0800 Subject: [PATCH 0087/2039] Update 995-minimum-number-of-k-consecutive-bit-flips.js --- ...nimum-number-of-k-consecutive-bit-flips.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/995-minimum-number-of-k-consecutive-bit-flips.js b/995-minimum-number-of-k-consecutive-bit-flips.js index ae3a47d1..4b26d18b 100644 --- a/995-minimum-number-of-k-consecutive-bit-flips.js +++ b/995-minimum-number-of-k-consecutive-bit-flips.js @@ -16,3 +16,31 @@ const minKBitFlips = function(A, K) { } return res; }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minKBitFlips = function(nums, k) { + const n = nums.length, q = [] + let res = 0 + for(let i = 0; i < n; i++) { + if(nums[i] === 0) { + if(q.length === 0 || q.length % 2 === 0) { + res++ + q.push(i + k - 1) + } + } else { + if(q.length % 2 === 1) { + res++ + q.push(i + k - 1) + } + } + if(q.length && i >= q[0]) q.shift() + } + return q.length ? -1 : res +}; + From bc23f401748f7e9777a1ebf7c257490275500ab6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 28 May 2021 20:53:40 +0800 Subject: [PATCH 0088/2039] Update 48-rotate-image.js --- 48-rotate-image.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/48-rotate-image.js b/48-rotate-image.js index ba36f95b..83583d57 100644 --- a/48-rotate-image.js +++ b/48-rotate-image.js @@ -40,3 +40,27 @@ function swap(matrix, i, j) { matrix[j][i] = matrix[i][j] matrix[i][j] = tmp } + +// another + +/** + * @param {number[][]} matrix + * @return {void} Do not return anything, modify matrix in-place instead. + */ +const rotate = function (matrix) { + matrix.reverse() + for (let i = 0; i < matrix.length; ++i) { + for (let j = matrix[i].length - 1; j > i; j--) swap(matrix, i, j) + } +} + +function swap(matrix, i, j) { + const tmp = matrix[j][i] + matrix[j][i] = matrix[i][j] + matrix[i][j] = tmp +} +/* +1 2 3 7 8 9 7 4 1 +4 5 6 ---> 4 5 6 --->8 5 2 +7 8 9 1 2 3 9 6 3 +*/ From e6342d176b745893c33ab320926cc96238f103cd Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 28 May 2021 22:12:28 +0800 Subject: [PATCH 0089/2039] Update 1870-minimum-speed-to-arrive-on-time.js --- 1870-minimum-speed-to-arrive-on-time.js | 28 +++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1870-minimum-speed-to-arrive-on-time.js b/1870-minimum-speed-to-arrive-on-time.js index 975e6fa5..0a59cb8b 100644 --- a/1870-minimum-speed-to-arrive-on-time.js +++ b/1870-minimum-speed-to-arrive-on-time.js @@ -1,3 +1,31 @@ +/** + * @param {number[]} dist + * @param {number} hour + * @return {number} + */ +const minSpeedOnTime = function(dist, hour) { + let l = 1, r = 1e7 + while(l <= r) { + let mid = (l + r) >> 1 + if(valid(mid)) r = mid -1 + else l = mid + 1 + } + return l > 1e7 ? -1 : l + + function valid(speed) { + let sum = 0 + for(let e of dist) { + sum = Math.ceil(sum) + sum += e / speed + if(sum > hour) return + } + + return true + } +}; + +// another + /** * @param {number[]} dist * @param {number} hour From 2c061119b8222bb34fc6180d2f41d4886333e4b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 May 2021 10:23:30 +0800 Subject: [PATCH 0090/2039] Update 664-strange-printer.js --- 664-strange-printer.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/664-strange-printer.js b/664-strange-printer.js index 2cfa9a33..deb5a1fe 100644 --- a/664-strange-printer.js +++ b/664-strange-printer.js @@ -29,3 +29,26 @@ const strangePrinter = function(s) { return help(s, 0, n - 1) } + +// another + +/** + * @param {string} s + * @return {number} + */ +const strangePrinter = function(s) { + const n = s.length + const dp = Array.from({ length: n }, () => Array(n).fill(n)) + for(let i = 0; i < n; i++) dp[i][i] = 1 + for(let len = 2; len <= n; len++) { + for(let i = 0; i < n - len + 1; i++) { + let j = i + len - 1 + dp[i][j] = 1 + dp[i + 1][j] + for(let k = i + 1; k < j; k++) { + if(s[i] === s[k]) dp[i][j] = Math.min(dp[i][j], dp[i][k - 1] + dp[k + 1][j]) + } + if(s[i] === s[j]) dp[i][j] = Math.min(dp[i][j - 1], dp[i][j]) + } + } + return dp[0][n - 1] +}; From 09d636bbe3548d5ec3cffec27cfac159e7329030 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 May 2021 12:19:41 +0800 Subject: [PATCH 0091/2039] Create 1882-process-tasks-using-servers.js --- 1882-process-tasks-using-servers.js | 118 ++++++++++++++++++++++++++++ 1 file changed, 118 insertions(+) create mode 100644 1882-process-tasks-using-servers.js diff --git a/1882-process-tasks-using-servers.js b/1882-process-tasks-using-servers.js new file mode 100644 index 00000000..0ea0dc15 --- /dev/null +++ b/1882-process-tasks-using-servers.js @@ -0,0 +1,118 @@ +/** + * @param {number[]} servers + * @param {number[]} tasks + * @return {number[]} + */ +const assignTasks = function(servers, tasks) { + let i = 0 + const freePQ = new PriorityQueue((a, b) => { + if(a.w < b.w) return true + else if(a.w > b.w) return false + else { + if(a.idx < b.idx) return true + return false + } + }) + const runningPQ = new PriorityQueue((a, b) => { + return a.end < b.end + }) + const res = [] + for(let i = 0; i < servers.length; i++) { + freePQ.push({ + w: servers[i], + idx: i + }) + } + let taskIdx = 0 + while(taskIdx < tasks.length) { + while(!runningPQ.isEmpty() && runningPQ.peek().end <= i) { + let server = runningPQ.pop() + freePQ.push({ + w: server.w, + idx: server.idx + }) + } + + while(taskIdx <= i && !freePQ.isEmpty() && taskIdx < tasks.length) { + const server = freePQ.pop() + res[taskIdx] = server.idx + runningPQ.push({ + end: i + tasks[taskIdx], + w: server.w, + idx: server.idx + }) + taskIdx++ + } + if(i < tasks.length || !freePQ.isEmpty()) i++ + else i = Math.max(i + 1, runningPQ.peek().end) + } + return res +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 1abb8c58aa4a64622b5217773af811e8d002328a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 May 2021 20:40:42 +0800 Subject: [PATCH 0092/2039] Create 1880-check-if-word-equals-summation-of-two-words.js --- ...k-if-word-equals-summation-of-two-words.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 1880-check-if-word-equals-summation-of-two-words.js diff --git a/1880-check-if-word-equals-summation-of-two-words.js b/1880-check-if-word-equals-summation-of-two-words.js new file mode 100644 index 00000000..54703af5 --- /dev/null +++ b/1880-check-if-word-equals-summation-of-two-words.js @@ -0,0 +1,44 @@ +/** + * @param {string} firstWord + * @param {string} secondWord + * @param {string} targetWord + * @return {boolean} + */ +const isSumEqual = function(firstWord, secondWord, targetWord) { + let str = 'abcdefghij' + const hash = {}, reverse = {} + for(let i = 0; i < str.length; i++) { + hash[str[i]] = i + reverse[i] = str[i] + } + let len1 = firstWord.length, len2 = secondWord.length + if (len1 < len2) return isSumEqual(secondWord, firstWord, targetWord) + // len1 >= len2 + if (len1 > len2) { + for(let i = len1 - len2; i > 0; i--) { + secondWord = 'a' + secondWord + } + } + let res = '', inc = 0 + for(let i = len1 - 1; i >= 0; i--) { + const tmp = hash[firstWord[i]] + hash[secondWord[i]] + inc + if (tmp > 9) { + inc = 1 + } else { + inc = 0 + } + const cur = tmp % 10 + res = reverse[cur] + res + } + + if(inc) res = 'b' + res + // console.log(res) + let r1 = '', r2 = '' + for(let i = 0; i < targetWord.length; i++) { + r1 = r1 + hash[targetWord[i]] + } + for(let i = 0; i < res.length; i++) { + r2 = r2 + hash[res[i]] + } + return (+r1) === (+r2) +}; From c3d0f93af71f299fce1b2da3c1e9121df7eb9878 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 May 2021 20:41:16 +0800 Subject: [PATCH 0093/2039] Create 1881-maximum-value-after-insertion.js --- 1881-maximum-value-after-insertion.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1881-maximum-value-after-insertion.js diff --git a/1881-maximum-value-after-insertion.js b/1881-maximum-value-after-insertion.js new file mode 100644 index 00000000..fe1983f1 --- /dev/null +++ b/1881-maximum-value-after-insertion.js @@ -0,0 +1,24 @@ +/** + * @param {string} n + * @param {number} x + * @return {string} + */ +const maxValue = function(n, x) { + const neg = n[0] === '-' + if (neg) { + for(let i = 1; i < n.length; i++) { + if(+n[i] > x) { + return n.slice(0, i) + x + n.slice(i) + } + } + return n + x + } else { + for(let i = 0; i < n.length; i++) { + if(+n[i] < x) { + + return n.slice(0, i) + x + n.slice(i) + } + } + return n + x + } +}; From 857ab8a0c20e003f397c54ec59a90188995c7aaf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 May 2021 20:48:25 +0800 Subject: [PATCH 0094/2039] Create 1883-minimum-skips-to-arrive-at-meeting-on-time.js --- ...imum-skips-to-arrive-at-meeting-on-time.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1883-minimum-skips-to-arrive-at-meeting-on-time.js diff --git a/1883-minimum-skips-to-arrive-at-meeting-on-time.js b/1883-minimum-skips-to-arrive-at-meeting-on-time.js new file mode 100644 index 00000000..5349fc76 --- /dev/null +++ b/1883-minimum-skips-to-arrive-at-meeting-on-time.js @@ -0,0 +1,41 @@ +/** + * @param {number[]} dist + * @param {number} speed + * @param {number} hoursBefore + * @return {number} + */ +const minSkips = function (dist, speed, hoursBefore) { + let left = 0 + let right = dist.length + + while (left < right) { + let mid = ~~(left + (right - left) / 2) + if (dfs(dist, speed, mid) > 1.0 * hoursBefore) { + left = mid + 1 + } else { + right = mid + } + } + return dfs(dist, speed, left) <= 1.0 * hoursBefore ? left : -1 + function dfs(dist, speed, skips) { + const dp = Array.from({ length: dist.length }, () => + Array(skips + 1).fill(0) + ) + let eps = 1e-9 + for (let i = 0; i <= skips; i++) { + dp[0][i] = (dist[0] * 1.0) / speed - eps + } + + for (let i = 1; i < dist.length; i++) { + dp[i][0] = Math.ceil(dp[i - 1][0]) + (dist[i] * 1.0) / speed - eps + for (let j = 1; j <= skips; j++) { + let time = dp[i - 1][j - 1] + (dist[i] * 1.0) / speed - eps + dp[i][j] = Math.min( + time, + Math.ceil(dp[i - 1][j]) + (dist[i] * 1.0) / speed - eps + ) + } + } + return dp[dist.length - 1][skips] + } +} From 90ab4700ddab4b3d2f64d9e4302a595e20a3dd60 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 31 May 2021 10:37:59 +0800 Subject: [PATCH 0095/2039] Update 1589-maximum-sum-obtained-of-any-permutation.js --- ...maximum-sum-obtained-of-any-permutation.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1589-maximum-sum-obtained-of-any-permutation.js b/1589-maximum-sum-obtained-of-any-permutation.js index f101a480..0baa6812 100644 --- a/1589-maximum-sum-obtained-of-any-permutation.js +++ b/1589-maximum-sum-obtained-of-any-permutation.js @@ -18,3 +18,31 @@ const maxSumRangeQuery = function (nums, requests) { for (let i = 0; i < n; ++i) res = (res + nums[i] * count[i]) % mod return res } + +// another + +/** + * @param {number[]} nums + * @param {number[][]} requests + * @return {number} + */ +const maxSumRangeQuery = function (nums, requests) { + const n = nums.length, arr = Array(n + 1).fill(0) + for(let [s, e] of requests) { + arr[s] += 1 + arr[e + 1] -= 1 + } + for(let i = 0, cur = 0; i < n; i++) { + cur += arr[i] + arr[i] = cur + } + nums.sort((a, b) => b - a) + arr.sort((a, b) => b - a) + const mod = 1e9 + 7 + let res = 0 + for(let i = 0; i < n; i++) { + if (arr[i] <= 0) break + res = (res + nums[i] * arr[i]) % mod + } + return res +} From 476801b7e1cf9ea4295ad2bbbebae2880de4f1cd Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Jun 2021 21:54:58 +0800 Subject: [PATCH 0096/2039] Update 1674-minimum-moves-to-make-array-complementary.js --- ...nimum-moves-to-make-array-complementary.js | 45 +++++++++---------- 1 file changed, 21 insertions(+), 24 deletions(-) diff --git a/1674-minimum-moves-to-make-array-complementary.js b/1674-minimum-moves-to-make-array-complementary.js index 99f147c9..7e72432f 100644 --- a/1674-minimum-moves-to-make-array-complementary.js +++ b/1674-minimum-moves-to-make-array-complementary.js @@ -3,27 +3,24 @@ * @param {number} limit * @return {number} */ -const minMoves = function(nums, limit) { - const min = Math.min, max = Math.max - const n = nums.length; - const delta = Array(limit * 2 + 2).fill(0); - for (let i = 0; i < n / 2; ++i) { - let lo = 1 + min(nums[i], nums[n - i - 1]); - let hi = limit + max(nums[i], nums[n - i - 1]); - let sum = nums[i] + nums[n - i - 1]; - delta[lo]--; - delta[sum]--; - delta[sum + 1]++; - delta[hi + 1]++; - } - let now = n; - let ans = n; - for (let i = 2; i <= limit * 2; ++i) { - now += delta[i]; - ans = min(ans, now); - } - return ans; -}; - - - +const minMoves = function (nums, limit) { + const { min, max } = Math + const n = nums.length + const delta = Array(limit * 2 + 2).fill(0) + for (let i = 0; i < n / 2; i++) { + const lo = 1 + min(nums[i], nums[n - i - 1]) + const hi = limit + max(nums[i], nums[n - i - 1]) + const sum = nums[i] + nums[n - i - 1] + delta[lo]-- + delta[sum]-- + delta[sum + 1]++ + delta[hi + 1]++ + } + let now = n + let ans = n + for (let i = 2; i <= limit * 2; i++) { + now += delta[i] + ans = min(ans, now) + } + return ans +} From fda25f0e7ea9fe337add55934697b5259235f69b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Jun 2021 23:13:58 +0800 Subject: [PATCH 0097/2039] Update 1674-minimum-moves-to-make-array-complementary.js --- ...nimum-moves-to-make-array-complementary.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1674-minimum-moves-to-make-array-complementary.js b/1674-minimum-moves-to-make-array-complementary.js index 7e72432f..2fbf8c14 100644 --- a/1674-minimum-moves-to-make-array-complementary.js +++ b/1674-minimum-moves-to-make-array-complementary.js @@ -24,3 +24,35 @@ const minMoves = function (nums, limit) { } return ans } + +// another + +/** + * @param {number[]} nums + * @param {number} limit + * @return {number} + */ +const minMoves = function (nums, limit) { + const n = nums.length, { max, min } = Math + const delta = Array(2 * limit + 2).fill(0) + for(let i = 0; i < n / 2; i++) { + const a = nums[i], b = nums[n - 1 - i] + // [2, min(a, b) + 1) + delta[2] += 2 + // [min(a, b) + 1, a + b) + delta[min(a, b) + 1] -= 1 + delta[a + b]-- + // [a + b + 1, max(a, b) + limit] + delta[a + b + 1] += 1 + // (max(a, b) + limit, 2 * limit] + delta[max(a, b) + limit + 1] +=1 + } + + let res = n, cur = 0 + for(let i = 2; i <= limit * 2; i++) { + cur += delta[i] + res = min(cur, res) + } + + return res +} From 3de38f15d54afe307b737555e5ffe0ea1f763215 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 3 Jun 2021 19:48:01 +0800 Subject: [PATCH 0098/2039] Create 1878-get-biggest-three-rhombus-sums-in-a-grid.js --- ...et-biggest-three-rhombus-sums-in-a-grid.js | 53 +++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 1878-get-biggest-three-rhombus-sums-in-a-grid.js diff --git a/1878-get-biggest-three-rhombus-sums-in-a-grid.js b/1878-get-biggest-three-rhombus-sums-in-a-grid.js new file mode 100644 index 00000000..07449480 --- /dev/null +++ b/1878-get-biggest-three-rhombus-sums-in-a-grid.js @@ -0,0 +1,53 @@ +/** + * @param {number[][]} grid + * @return {number[]} + */ +const getBiggestThree = function (grid) { + const rows = grid.length + const cols = grid[0].length + const maxSide = Math.ceil(Math.min(rows, cols) / 2) + let max1 = 0 + let max2 = 0 + let max3 = 0 + let sum, lastColIndex + + const calcSums = function (row, col) { + for (let i = 0; i < maxSide; ++i) { + if (row + i < rows && row - i >= 0 && col + i * 2 < cols) { + sum = grid[row][col] + if (i > 0) { + for (let j = 1; j <= i; ++j) { + sum += grid[row + j][col + j] + grid[row - j][col + j] + } + lastColIndex = col + i * 2 + for (let j = 1; j < i; ++j) { + sum += + grid[row + j][lastColIndex - j] + grid[row - j][lastColIndex - j] + } + sum += grid[row][lastColIndex] + } + + if (sum > max1) { + max3 = max2 + max2 = max1 + max1 = sum + } else if (sum > max2 && sum !== max1) { + max3 = max2 + max2 = sum + } else if (sum > max3 && sum !== max1 && sum !== max2) { + max3 = sum + } + } else { + break + } + } + } + + for (let i = 0; i < rows; ++i) { + for (let j = 0; j < cols; ++j) { + calcSums(i, j) + } + } + + return [max1, max2, max3].filter((x) => x) +} From 96b9e3fe35942bc1293e5a4540043643ed105d14 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 4 Jun 2021 12:51:58 +0800 Subject: [PATCH 0099/2039] Update 1878-get-biggest-three-rhombus-sums-in-a-grid.js --- ...et-biggest-three-rhombus-sums-in-a-grid.js | 56 ++++++------------- 1 file changed, 16 insertions(+), 40 deletions(-) diff --git a/1878-get-biggest-three-rhombus-sums-in-a-grid.js b/1878-get-biggest-three-rhombus-sums-in-a-grid.js index 07449480..357876ca 100644 --- a/1878-get-biggest-three-rhombus-sums-in-a-grid.js +++ b/1878-get-biggest-three-rhombus-sums-in-a-grid.js @@ -5,49 +5,25 @@ const getBiggestThree = function (grid) { const rows = grid.length const cols = grid[0].length - const maxSide = Math.ceil(Math.min(rows, cols) / 2) - let max1 = 0 - let max2 = 0 - let max3 = 0 - let sum, lastColIndex - - const calcSums = function (row, col) { - for (let i = 0; i < maxSide; ++i) { - if (row + i < rows && row - i >= 0 && col + i * 2 < cols) { - sum = grid[row][col] - if (i > 0) { - for (let j = 1; j <= i; ++j) { - sum += grid[row + j][col + j] + grid[row - j][col + j] - } - lastColIndex = col + i * 2 - for (let j = 1; j < i; ++j) { - sum += - grid[row + j][lastColIndex - j] + grid[row - j][lastColIndex - j] - } - sum += grid[row][lastColIndex] + const res = [] + for(let i = 0; i < rows; i++) { + for(let j = 0; j < cols; j++) { + for(let size = 0; i - size >= 0 && i + size < rows && j + size * 2 < cols; size++) { + let tmp = 0, r = i, c = j + do {tmp += grid[r++][c++]} while(r < rows && c < cols && r < i + size) + if(size > 0) { + do {tmp += grid[r--][c++]} while(c < cols && c < j + 2 * size) + do {tmp += grid[r--][c--]} while(r > 0 && r > i - size) + do {tmp += grid[r++][c--]} while(c > 0 && r < i) } - - if (sum > max1) { - max3 = max2 - max2 = max1 - max1 = sum - } else if (sum > max2 && sum !== max1) { - max3 = max2 - max2 = sum - } else if (sum > max3 && sum !== max1 && sum !== max2) { - max3 = sum + if(res.indexOf(tmp) === -1) res.push(tmp) + if(res.length > 3) { + res.sort((a, b) => b - a) + res.splice(3) } - } else { - break } } } - - for (let i = 0; i < rows; ++i) { - for (let j = 0; j < cols; ++j) { - calcSums(i, j) - } - } - - return [max1, max2, max3].filter((x) => x) + res.sort((a, b) => b - a) + return res } From 3728d6d697b3fd76a1497c0f3f5e57f81b92dbd2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 4 Jun 2021 19:01:26 +0800 Subject: [PATCH 0100/2039] Create 1879-minimum-xor-sum-of-two-arrays.js --- 1879-minimum-xor-sum-of-two-arrays.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1879-minimum-xor-sum-of-two-arrays.js diff --git a/1879-minimum-xor-sum-of-two-arrays.js b/1879-minimum-xor-sum-of-two-arrays.js new file mode 100644 index 00000000..31790237 --- /dev/null +++ b/1879-minimum-xor-sum-of-two-arrays.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const minimumXORSum = function(nums1, nums2) { + const dp = Array(1 << nums2.length).fill(Infinity) + return dfs(dp, nums1, nums2, 0, 0) +}; + +function dfs(dp, a, b, i, mask) { + if(i >= a.length) return 0 + if(dp[mask] === Infinity) { + for(let j = 0; j < b.length; j++) { + if((mask & (1 << j)) === 0) { + dp[mask] = Math.min(dp[mask], (a[i] ^ b[j]) + dfs(dp, a, b, i + 1, mask + (1 << j))) + } + } + } + return dp[mask] +} From 65e65b3faee663915fd7ead195f37f1832bc1194 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 4 Jun 2021 21:45:50 +0800 Subject: [PATCH 0101/2039] Update 1879-minimum-xor-sum-of-two-arrays.js --- 1879-minimum-xor-sum-of-two-arrays.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1879-minimum-xor-sum-of-two-arrays.js b/1879-minimum-xor-sum-of-two-arrays.js index 31790237..7c6232f3 100644 --- a/1879-minimum-xor-sum-of-two-arrays.js +++ b/1879-minimum-xor-sum-of-two-arrays.js @@ -19,3 +19,27 @@ function dfs(dp, a, b, i, mask) { } return dp[mask] } + +// another + +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const minimumXORSum = function (nums1, nums2) { + const dp = Array(1 << nums2.length).fill(Infinity) + return dfs(0, 0) + + function dfs(i, mask) { + if(i >= nums2.length) return 0 + if(dp[mask] != Infinity) return dp[mask] + for(let j = 0; j < nums2.length; j++) { + if((mask & (1 << j)) === 0) { + dp[mask] = Math.min(dp[mask], (nums1[i] ^ nums2[j]) + dfs(i + 1, mask + (1 << j)) ) + } + } + return dp[mask] + } +} + From da05f4f9f55f832994fc6aea9343887be2ac6513 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 5 Jun 2021 12:00:28 +0800 Subject: [PATCH 0102/2039] Update 1066-campus-bikes-ii.js --- 1066-campus-bikes-ii.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1066-campus-bikes-ii.js b/1066-campus-bikes-ii.js index e7b365ce..d3d96ed1 100644 --- a/1066-campus-bikes-ii.js +++ b/1066-campus-bikes-ii.js @@ -1,3 +1,32 @@ +/** + * @param {number[][]} workers + * @param {number[][]} bikes + * @return {number} + */ +const assignBikes = function(workers, bikes) { + const n = workers.length, m = bikes.length + const dp = Array(1 << m).fill(Infinity) + return dfs(0, 0) + + function dfs(i, mask) { + if(i >= workers.length) return 0 + if(dp[mask] !== Infinity) return dp[mask] + for(let j = 0; j < bikes.length; j++) { + if((mask & (1 << j)) === 0) { + dp[mask] = Math.min(dp[mask], dist(i, j) + dfs(i + 1, mask + (1 << j))) + } + } + + return dp[mask] + } + + function dist(j, i) { + return Math.abs(bikes[i][0] - workers[j][0]) + Math.abs(bikes[i][1] - workers[j][1]) + } +}; + +// another + /** * @param {number[][]} workers * @param {number[][]} bikes From 64960726671ce845744af2c8fee8706522a27e9e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Jun 2021 13:32:24 +0800 Subject: [PATCH 0103/2039] Create 1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js --- ...s-to-make-the-binary-string-alternating.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js diff --git a/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js b/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js new file mode 100644 index 00000000..fabf8ae1 --- /dev/null +++ b/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js @@ -0,0 +1,48 @@ +/** + * @param {string} s + * @return {number} + */ +const minFlips = function (s) { + let n = s.length + let t = s + s + let a0 = 0 + let a1 = 0 + let b0 = 0 + let b1 = 0 + let ans = Infinity + for (let i = 0; i < t.length; i++) { + if (t[i] == '0') { + if (i % 2 == 0) { + a0++ + } else { + b0++ + } + } else { + if (i % 2 == 0) { + a1++ + } else { + b1++ + } + } + + if (i >= n) { + if (t[i - n] == '0') { + if ((i - n) % 2 == 0) { + a0-- + } else { + b0-- + } + } else { + if ((i - n) % 2 == 0) { + a1-- + } else { + b1-- + } + } + } + ans = Math.min(ans, Math.min(n - a0 - b1, n - a1 - b0)) + } + + return ans +} + From e8f664c3db5b3be1bcf508544a94c613874d92d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Jun 2021 19:52:42 +0800 Subject: [PATCH 0104/2039] Update 1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js --- ...s-to-make-the-binary-string-alternating.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js b/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js index fabf8ae1..da32124d 100644 --- a/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js +++ b/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js @@ -46,3 +46,35 @@ const minFlips = function (s) { return ans } +// another + +/** + * @param {string} s + * @return {number} + */ +const minFlips = function (s) { + const n = s.length + s += s + let s1 = '', s2 = '' + for(let i = 0;i < s.length; i++) { + s1 += i % 2 === 0 ? '0' : '1' + s2 += i % 2 === 0 ? '1' : '0' + } + let res1 = 0, res2 = 0, res = Infinity + for(let i = 0; i < s.length; i++) { + if(s1[i] !== s[i]) res1++ + if(s2[i] !== s[i]) res2++ + if(i >= n) { + if(s1[i - n] !== s[i - n]) res1-- + if(s2[i - n] !== s[i - n]) res2-- + } + if(i >= n - 1) { + res = Math.min(res, res1, res2) + } + } + + return res +} + + + From 5acdbbf7ec3559ea5b25c036fe073cee04dba4b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Jun 2021 20:58:56 +0800 Subject: [PATCH 0105/2039] Create 1886-determine-whether-matrix-can-be-obtained-by-rotation.js --- ...ther-matrix-can-be-obtained-by-rotation.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 1886-determine-whether-matrix-can-be-obtained-by-rotation.js diff --git a/1886-determine-whether-matrix-can-be-obtained-by-rotation.js b/1886-determine-whether-matrix-can-be-obtained-by-rotation.js new file mode 100644 index 00000000..785367a5 --- /dev/null +++ b/1886-determine-whether-matrix-can-be-obtained-by-rotation.js @@ -0,0 +1,35 @@ +/** + * @param {number[][]} mat + * @param {number[][]} target + * @return {boolean} + */ +const findRotation = function(mat, target) { + if(chk(mat, target)) return true + for(let i = 0; i < 3; i++) { + rotate(mat) + if(chk(mat, target)) return true + } + return false +}; + +function chk(m1, m2) { + for(let i = 0; i < m1.length; i++) { + for(let j = 0; j < m1.length; j++) { + if(m1[i][j] !== m2[i][j]) return false + } + } + return true +} + +function rotate(matrix) { + matrix.reverse() + for (let i = 0; i < matrix.length; ++i) { + for (let j = matrix[i].length - 1; j > i; j--) swap(matrix, i, j) + } +} + +function swap(matrix, i, j) { + const tmp = matrix[j][i] + matrix[j][i] = matrix[i][j] + matrix[i][j] = tmp +} From 8fa0755692e62416e29cf4e6cb8d2c49e73841ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Jun 2021 21:23:30 +0800 Subject: [PATCH 0106/2039] Create 1887-reduction-operations-to-make-the-array-elements-equal.js --- ...ations-to-make-the-array-elements-equal.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1887-reduction-operations-to-make-the-array-elements-equal.js diff --git a/1887-reduction-operations-to-make-the-array-elements-equal.js b/1887-reduction-operations-to-make-the-array-elements-equal.js new file mode 100644 index 00000000..63db3c46 --- /dev/null +++ b/1887-reduction-operations-to-make-the-array-elements-equal.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const reductionOperations = function(nums) { + nums.sort((a, b) => a - b) + const n = nums.length + const arr = Array(n).fill(0) + for(let i = 1; i < n; i++) { + if(nums[i] > nums[i - 1]) arr[i] = 1 + } + let res = 0, pre = 0 + + for(let i = 1; i < n; i++) { + if(arr[i] === 0) arr[i] = arr[i - 1] + else arr[i] += arr[i - 1] + } + + for(let e of arr) { + res += e + } + return res +}; From b4aa0b3edbdc66e261e91156efdeb15bf2f553d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Jun 2021 21:24:21 +0800 Subject: [PATCH 0107/2039] Create 1889-minimum-space-wasted-from-packaging.js --- 1889-minimum-space-wasted-from-packaging.js | 49 +++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 1889-minimum-space-wasted-from-packaging.js diff --git a/1889-minimum-space-wasted-from-packaging.js b/1889-minimum-space-wasted-from-packaging.js new file mode 100644 index 00000000..14caabbb --- /dev/null +++ b/1889-minimum-space-wasted-from-packaging.js @@ -0,0 +1,49 @@ +/** + * @param {number[]} packages + * @param {number[][]} boxes + * @return {number} + */ +var minWastedSpace = function (packages, boxes) { + packages.sort(function (a, b) { + return a - b + }) + let count = 0, + b, + wastage, + minWastage = Number.MAX_SAFE_INTEGER, + flag = false + for (let i = 0; i < boxes.length; i++) { + boxes[i].sort(function (a, b) { + return a - b + }) + b = 0 + wastage = 0 + count = 0 + if (boxes[i][boxes[i].length - 1] < packages[packages.length - 1]) { + //This supplier's largest box is smaller than our larget package, this supplier can't be used + continue + } + while (count < packages.length && b < boxes[i].length) { + if (packages[count] <= boxes[i][b]) { + wastage += boxes[i][b] - packages[count] + if (wastage > minWastage) { + //Need not to porcess this supplier if wastage has already been more than minWastage + break + } + count++ + } else { + b++ + } + } + if (count === packages.length) { + flag = true //We have found atleas 1 answer + if (wastage < minWastage) { + minWastage = wastage + } + } + } + if (flag === false) { + return -1 + } + return minWastage % 1000000007 +} From 92cf1f67ad9d1618bf1d5702c48fdcd3768af10d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Jun 2021 10:06:50 +0800 Subject: [PATCH 0108/2039] Create 1876-substrings-of-size-three-with-distinct-characters.js --- ...s-of-size-three-with-distinct-characters.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1876-substrings-of-size-three-with-distinct-characters.js diff --git a/1876-substrings-of-size-three-with-distinct-characters.js b/1876-substrings-of-size-three-with-distinct-characters.js new file mode 100644 index 00000000..fb8d6fb0 --- /dev/null +++ b/1876-substrings-of-size-three-with-distinct-characters.js @@ -0,0 +1,18 @@ +/** + * @param {string} s + * @return {number} + */ + const countGoodSubstrings = function(s) { + let res = 0 + for(let i = 2; i < s.length; i++) { + if(chk(s, i)) res++ + } + + return res +}; + +function chk(s, i) { + return s[i - 2] !== s[i - 1] && + s[i - 2] !== s[i] && + s[i - 1] !== s[i] +} From e7e446dcda4a45ed58b691378f1e69477da471bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Jun 2021 20:39:40 +0800 Subject: [PATCH 0109/2039] Update 1882-process-tasks-using-servers.js --- 1882-process-tasks-using-servers.js | 53 +++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) diff --git a/1882-process-tasks-using-servers.js b/1882-process-tasks-using-servers.js index 0ea0dc15..2f3a3dfd 100644 --- a/1882-process-tasks-using-servers.js +++ b/1882-process-tasks-using-servers.js @@ -116,3 +116,56 @@ class PriorityQueue { } } } + +// another + +/** + * @param {number[]} servers + * @param {number[]} tasks + * @return {number[]} + */ +const assignTasks = function(servers, tasks) { + const freePQ = new PriorityQueue((a, b) => { + if(a.w < b.w) return true + else if(a.w > b.w) return false + else { + if(a.idx < b.idx) return true + return false + } + }) + const runningPQ = new PriorityQueue((a, b) => { + return a.end === b.end ? (a.w === b.w ? a.idx < b.idx : a.w < b.w) : a.end < b.end + }) + const res = [] + for(let i = 0; i < servers.length; i++) { + freePQ.push({ + w: servers[i], + idx: i + }) + } + for(let i = 0, n = tasks.length; i < n; i++) { + const cur = tasks[i] + while(runningPQ.size() && runningPQ.peek().end <= i) { + const el = runningPQ.pop() + freePQ.push({ + w: el.w, + idx: el.idx, + }) + } + + if(freePQ.isEmpty()) { + const el = runningPQ.pop() + res[i] = el.idx + el.end += cur + runningPQ.push(el) + } else { + const el = freePQ.pop() + res[i] = el.idx + el.end = i + cur + runningPQ.push(el) + } + } + + return res +}; + From 78b951ee408b3727cbf015d595133ae4b6c60c3f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Jun 2021 21:20:04 +0800 Subject: [PATCH 0110/2039] Update 53-maximum-subarray.js --- 53-maximum-subarray.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/53-maximum-subarray.js b/53-maximum-subarray.js index 15725003..60de46f4 100755 --- a/53-maximum-subarray.js +++ b/53-maximum-subarray.js @@ -11,3 +11,33 @@ const maxSubArray = function(nums) { } return maxSum; }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const maxSubArray = function(nums) { + return helper(nums, 0, nums.length - 1) +}; + +function helper(arr, l, r) { + if(l > r) return -Infinity + const mid = l + ((r - l) >> 1) + let cur = 0, leftMax = 0, rightMax = 0 + for(let i = mid - 1; i >= l; i--) { + cur += arr[i] + leftMax = Math.max(leftMax, cur) + } + cur = 0 + for(let i = mid + 1; i <= r; i++) { + cur += arr[i] + rightMax = Math.max(rightMax, cur) + } + const res = arr[mid] + leftMax + rightMax + const leftRes = helper(arr, l, mid - 1) + const rightRes = helper(arr, mid + 1, r) + + return Math.max(res, leftRes, rightRes) +} From 21df4eee3b3379e3f1bb83e182521a719275cadb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 9 Jun 2021 20:18:33 +0800 Subject: [PATCH 0111/2039] Update 1167-minimum-cost-to-connect-sticks.js --- 1167-minimum-cost-to-connect-sticks.js | 86 ++++++++++++++++++++++++++ 1 file changed, 86 insertions(+) diff --git a/1167-minimum-cost-to-connect-sticks.js b/1167-minimum-cost-to-connect-sticks.js index ff6d7fa1..6eeb60c6 100644 --- a/1167-minimum-cost-to-connect-sticks.js +++ b/1167-minimum-cost-to-connect-sticks.js @@ -124,4 +124,90 @@ const connectSticks = function(sticks) { return result } +// another + +/** + * @param {number[]} sticks + * @return {number} + */ +const connectSticks = function(sticks) { + const pq = new PriorityQueue((a, b) => a < b) + for(let e of sticks) pq.push(e) + let res = 0 + while(pq.size() > 1) { + const e1 = pq.pop() + const e2 = pq.pop() + pq.push(e1 + e2) + res += e1 + e2 + } + + return res +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 056e513ee3a0d2f26bd19581a9e3778e87a699eb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 9 Jun 2021 21:21:56 +0800 Subject: [PATCH 0112/2039] Update 25-reverse-nodes-in-k-group.js --- 25-reverse-nodes-in-k-group.js | 85 ++++++++++++++++++++++++++++++++++ 1 file changed, 85 insertions(+) diff --git a/25-reverse-nodes-in-k-group.js b/25-reverse-nodes-in-k-group.js index 40e0d8a1..d7f9a36c 100644 --- a/25-reverse-nodes-in-k-group.js +++ b/25-reverse-nodes-in-k-group.js @@ -28,3 +28,88 @@ const reverseKGroup = function(head, k) { } return dmy.next } + +// another + +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @param {number} k + * @return {ListNode} + */ +const reverseKGroup = function (head, k) { + let ptr = head + let ktail = null + + // Head of the final, moified linked list + let new_head = null + + // Keep going until there are nodes in the list + while (ptr != null) { + let count = 0 + + // Start counting nodes from the head + ptr = head + + // Find the head of the next k nodes + while (count < k && ptr != null) { + ptr = ptr.next + count += 1 + } + + // If we counted k nodes, reverse them + if (count == k) { + // Reverse k nodes and get the new head + let revHead = reverseLinkedList(head, k) + + // new_head is the head of the final linked list + if (new_head == null) new_head = revHead + + // ktail is the tail of the previous block of + // reversed k nodes + if (ktail != null) ktail.next = revHead + + ktail = head + head = ptr + } + } + + // attach the final, possibly un-reversed portion + if (ktail != null) ktail.next = head + + return new_head == null ? head : new_head +} + +function reverseLinkedList(head, k) { + // Reverse k nodes of the given linked list. + // This function assumes that the list contains + // atleast k nodes. + let new_head = null + let ptr = head + + while (k > 0) { + // Keep track of the next node to process in the + // original list + let next_node = ptr.next + + // Insert the node pointed to by "ptr" + // at the beginning of the reversed list + ptr.next = new_head + new_head = ptr + + // Move on to the next node + ptr = next_node + + // Decrement the count of nodes to be reversed by 1 + k-- + } + + // Return the head of the reversed list + return new_head +} From 6f7b7a0c8b3f72361e4512fa375ff342aa1b7314 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Jun 2021 20:15:11 +0800 Subject: [PATCH 0113/2039] Update 25-reverse-nodes-in-k-group.js --- 25-reverse-nodes-in-k-group.js | 42 ++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/25-reverse-nodes-in-k-group.js b/25-reverse-nodes-in-k-group.js index d7f9a36c..bf6a75e2 100644 --- a/25-reverse-nodes-in-k-group.js +++ b/25-reverse-nodes-in-k-group.js @@ -29,6 +29,48 @@ const reverseKGroup = function(head, k) { return dmy.next } +// another + +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @param {number} k + * @return {ListNode} + */ +const reverseKGroup = function (head, k) { + if(head == null) return head + const dummy = new ListNode() + dummy.next = head + let n = 0, cur = head + while(cur) { + n++ + cur = cur.next + } + if(n < k) return head + let pre = dummy, tail = head + + for(let i = 0; i + k <= n; i += k) { + for(let j = 1; j < k; j++) { + const tmp = pre.next + pre.next = tail.next + tail.next = tail.next.next + pre.next.next = tmp + } + pre = tail + tail = tail.next + } + + return dummy.next +} + + + // another /** From 25d9987bd72abc085534ca02afdf14ae5bc555ab Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Jun 2021 19:47:59 +0800 Subject: [PATCH 0114/2039] Update 1889-minimum-space-wasted-from-packaging.js --- 1889-minimum-space-wasted-from-packaging.js | 54 +++++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/1889-minimum-space-wasted-from-packaging.js b/1889-minimum-space-wasted-from-packaging.js index 14caabbb..1e733c58 100644 --- a/1889-minimum-space-wasted-from-packaging.js +++ b/1889-minimum-space-wasted-from-packaging.js @@ -1,3 +1,57 @@ +/** + * @param {number[]} packages + * @param {number[][]} boxes + * @return {number} + */ +const minWastedSpace = function (packages, boxes) { + const mod = 1e9 + 7 + const n = packages.length + packages.sort((a, b) => a - b) + const preSum = packages.reduce( + (acc, cur) => { + acc.push(acc[acc.length - 1] + cur) + return acc + }, + [0] + ) + + const upperBound = (target) => { + let lo = 0, + hi = n + while (lo < hi) { + const mi = (lo + hi) >> 1 + const val = packages[mi] + if (val <= target) { + lo = mi + 1 + } else { + hi = mi + } + } + return lo + } + + let res = Infinity + for (const bs of boxes) { + bs.sort((a, b) => b - a) + if (bs[0] < packages[n - 1]) continue + let wastes = bs[0] * n - preSum[n] + let last = bs[0] + for (let i = 1; i < bs.length; i++) { + const b = bs[i] + const j = upperBound(b) + if (j <= 0) { + break + } + wastes -= (last - b) * j + last = b + } + res = Math.min(res, wastes) + } + return res === Infinity ? -1 : res % mod +} + +// another + /** * @param {number[]} packages * @param {number[][]} boxes From 4aeb04acc18965e299c1a7d25ce447b5f0dd3926 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Jun 2021 20:11:49 +0800 Subject: [PATCH 0115/2039] Update 502-ipo.js --- 502-ipo.js | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/502-ipo.js b/502-ipo.js index 95219ee7..b00add48 100644 --- a/502-ipo.js +++ b/502-ipo.js @@ -6,9 +6,9 @@ * @return {number} */ const findMaximizedCapital = function(k, W, Profits, Capital) { - let idxArr = Profits.map((_, i) => i).sort((ia, ib) => Profits[ib] - Profits[ia]); + const idxArr = Profits.map((_, i) => i).sort((ia, ib) => Profits[ib] - Profits[ia]); while (k) { - let choose = idxArr.findIndex(i => Capital[i] <= W); + const choose = idxArr.findIndex(i => Capital[i] <= W); if (choose == -1) return W; W += Profits[idxArr[choose]]; idxArr.splice(choose, 1); From 0d1d9e4d5d9971872290c079bc300cd8b89ebb7d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Jun 2021 20:59:44 +0800 Subject: [PATCH 0116/2039] Update 502-ipo.js --- 502-ipo.js | 95 ++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 95 insertions(+) diff --git a/502-ipo.js b/502-ipo.js index b00add48..e095989d 100644 --- a/502-ipo.js +++ b/502-ipo.js @@ -1,3 +1,98 @@ +/** + * @param {number} k + * @param {number} W + * @param {number[]} Profits + * @param {number[]} Capital + * @return {number} + */ +const findMaximizedCapital = function(k, W, Profits, Capital) { + const capPQ = new PriorityQueue((a, b) => a.cap < b.cap) + const proPQ = new PriorityQueue((a, b) => a.pro > b.pro) + for(let i = 0, len = Profits.length; i < len; i++) { + capPQ.push({ cap: Capital[i], pro: Profits[i] }) + } + while(k) { + while(!capPQ.isEmpty() && capPQ.peek().cap <= W) { + proPQ.push(capPQ.pop()) + } + if(proPQ.isEmpty()) break + + W += proPQ.pop().pro + k-- + } + return W +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number} k * @param {number} W From 2a93e195b62c5760313e0b4670a69f4b779db6da Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Jun 2021 14:06:30 +0800 Subject: [PATCH 0117/2039] Create 1900-the-earliest-and-latest-rounds-where-players-compete.js --- ...and-latest-rounds-where-players-compete.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1900-the-earliest-and-latest-rounds-where-players-compete.js diff --git a/1900-the-earliest-and-latest-rounds-where-players-compete.js b/1900-the-earliest-and-latest-rounds-where-players-compete.js new file mode 100644 index 00000000..2836f4ee --- /dev/null +++ b/1900-the-earliest-and-latest-rounds-where-players-compete.js @@ -0,0 +1,34 @@ +/** + * @param {number} n + * @param {number} firstPlayer + * @param {number} secondPlayer + * @return {number[]} + */ +const earliestAndLatest = function (n, firstPlayer, secondPlayer) { + const { max, min } = Math + const hash = {} + function dp(l, r, m) { + const key = `${l}${r}${m}` + if (hash[key] != null) return hash[key] + if (l > r) return dp(r, l, m) + if (l === r) return [1, 1] + let nxt_m = (m + 1) >> 1 + let ans = [n, 0] + for (let i = 1; i < l + 1; i++) { + let l_win = i - 1, + l_lose = l - i + for ( + let j = max(r - ~~(m / 2) - 1, 0) + l_lose + 1; + j < min(r - 1 - l_win, nxt_m - i) + 1; + j++ + ) { + let tmp = dp(i, j, nxt_m) + ans = [min(ans[0], tmp[0]), max(ans[1], tmp[1])] + } + } + hash[key] = [ans[0] + 1, ans[1] + 1] + return hash[key] + } + + return dp(firstPlayer, n - secondPlayer + 1, n) +} From 3c924e154339247a40f1a91a94a89078eef3a906 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Jun 2021 14:07:08 +0800 Subject: [PATCH 0118/2039] Create 1899-merge-triplets-to-form-target-triplet.js --- 1899-merge-triplets-to-form-target-triplet.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1899-merge-triplets-to-form-target-triplet.js diff --git a/1899-merge-triplets-to-form-target-triplet.js b/1899-merge-triplets-to-form-target-triplet.js new file mode 100644 index 00000000..3b147614 --- /dev/null +++ b/1899-merge-triplets-to-form-target-triplet.js @@ -0,0 +1,22 @@ +/** + * @param {number[][]} triplets + * @param {number[]} target + * @return {boolean} + */ +const mergeTriplets = function (triplets, target) { + let n = triplets.length + const ans = Array(3).fill(0) + const { max } = Math + for (let i = 0; i < n; i++) { + if ( + triplets[i][0] <= target[0] && + triplets[i][1] <= target[1] && + triplets[i][2] <= target[2] + ) { + ans[0] = max(ans[0], triplets[i][0]) + ans[1] = max(ans[1], triplets[i][1]) + ans[2] = max(ans[2], triplets[i][2]) + } + } + return ans[0] == target[0] && ans[1] == target[1] && ans[2] == target[2] +} From 4b871cfc9b1c537afa278353218df598ed2d3e10 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Jun 2021 14:07:37 +0800 Subject: [PATCH 0119/2039] Create 1898-maximum-number-of-removable-characters.js --- ...-maximum-number-of-removable-characters.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1898-maximum-number-of-removable-characters.js diff --git a/1898-maximum-number-of-removable-characters.js b/1898-maximum-number-of-removable-characters.js new file mode 100644 index 00000000..77c297ac --- /dev/null +++ b/1898-maximum-number-of-removable-characters.js @@ -0,0 +1,34 @@ +/** + * @param {string} s + * @param {string} p + * @param {number[]} removable + * @return {number} + */ +const maximumRemovals = function (s, p, removable) { + const n = removable.length + let l = 0, + r = n + while (l < r) { + let mid = (l + r + 1) >> 1 + if (is_valid(s, p, removable, mid)) l = mid + else r = mid - 1 + } + return l +} + +function is_valid(s, p, removable, cnt) { + let len1 = s.length, + len2 = p.length + const check = Array(len1).fill(0) + for (let i = 0; i < cnt; i++) check[removable[i]] = 1 + let ind1 = 0, + ind2 = 0 + while (ind1 < len1 && ind2 < len2) { + if (s[ind1] != p[ind2] || check[ind1]) { + ind1++ + continue + } + ind1++, ind2++ + } + return ind2 == len2 +} From 10314910518f0b9405e964cff00fafcc14195ffe Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Jun 2021 14:08:07 +0800 Subject: [PATCH 0120/2039] Create 1897-redistribute-characters-to-make-all-strings-equal.js --- ...ute-characters-to-make-all-strings-equal.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1897-redistribute-characters-to-make-all-strings-equal.js diff --git a/1897-redistribute-characters-to-make-all-strings-equal.js b/1897-redistribute-characters-to-make-all-strings-equal.js new file mode 100644 index 00000000..9ca9a384 --- /dev/null +++ b/1897-redistribute-characters-to-make-all-strings-equal.js @@ -0,0 +1,18 @@ +/** + * @param {string[]} words + * @return {boolean} + */ +const makeEqual = function(words) { + const arr = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for(let w of words) { + for(let ch of w) { + arr[ch.charCodeAt(0) - a]++ + } + } + const n = words.length + for(let i = 0; i < 26; i++) { + if(arr[i] % n !== 0) return false + } + return true +}; From b0404f6a4f75e912ca6df87d971be68c205cc542 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Jun 2021 20:58:46 +0800 Subject: [PATCH 0121/2039] Update 857-minimum-cost-to-hire-k-workers.js --- 857-minimum-cost-to-hire-k-workers.js | 33 +++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/857-minimum-cost-to-hire-k-workers.js b/857-minimum-cost-to-hire-k-workers.js index 46394d91..028bcf65 100644 --- a/857-minimum-cost-to-hire-k-workers.js +++ b/857-minimum-cost-to-hire-k-workers.js @@ -1,3 +1,36 @@ +/** + * @param {number[]} quality + * @param {number[]} wage + * @param {number} K + * @return {number} + */ +const mincostToHireWorkers = function(quality, wage, K) { + const workers = [], n = quality.length; + for (let i = 0; i < n; i++) { + workers[i] = { ratio: wage[i] / quality[i], quality: quality[i] } + } + workers.sort((a, b) => a.ratio - b.ratio); + const heap = new MaxPriorityQueue({ priority: x => x.quality }); + let totalQuality = 0, res = Infinity; + while (workers.length) { + const curWorker = workers.shift(); + totalQuality += curWorker.quality; + heap.enqueue(curWorker); + + if (heap.size() > K) { + totalQuality -= heap.dequeue().element.quality; + } + if (heap.size() === K) { + res = Math.min(res, curWorker.ratio * totalQuality) + } + } + return res; +}; + + + +// another + /** * @param {number[]} quality * @param {number[]} wage From b4b6ff9c412bed815b443c62fbf1dfd0fa92c277 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 14 Jun 2021 22:19:55 +0800 Subject: [PATCH 0122/2039] Create 1893-check-if-all-the-integers-in-a-range-are-covered.js --- ...if-all-the-integers-in-a-range-are-covered.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1893-check-if-all-the-integers-in-a-range-are-covered.js diff --git a/1893-check-if-all-the-integers-in-a-range-are-covered.js b/1893-check-if-all-the-integers-in-a-range-are-covered.js new file mode 100644 index 00000000..bcd916b9 --- /dev/null +++ b/1893-check-if-all-the-integers-in-a-range-are-covered.js @@ -0,0 +1,16 @@ +/** + * @param {number[][]} ranges + * @param {number} left + * @param {number} right + * @return {boolean} + */ +const isCovered = function(ranges, left, right) { + for(let i = left; i <= right; i++) { + let seen = false; + for(let j = 0; j < ranges.length && !seen; j++) + if(i >= ranges[j][0] && i <= ranges[j][1]) + seen = true; + if(!seen) return false; + } + return true; +}; From 963053468fd30e41bb517a14bb5d35e305180f81 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 14 Jun 2021 22:26:58 +0800 Subject: [PATCH 0123/2039] Update 1893-check-if-all-the-integers-in-a-range-are-covered.js --- ...all-the-integers-in-a-range-are-covered.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1893-check-if-all-the-integers-in-a-range-are-covered.js b/1893-check-if-all-the-integers-in-a-range-are-covered.js index bcd916b9..1aff5dee 100644 --- a/1893-check-if-all-the-integers-in-a-range-are-covered.js +++ b/1893-check-if-all-the-integers-in-a-range-are-covered.js @@ -1,3 +1,27 @@ +/** + * @param {number[][]} ranges + * @param {number} left + * @param {number} right + * @return {boolean} + */ +const isCovered = function(ranges, left, right) { + const arr = Array(52).fill(0) + for(let [s, e] of ranges) { + arr[s]++ + arr[e + 1]-- + } + for(let i = 1; i < 52; i++) { + arr[i] += arr[i - 1] + } + for(let i = left; i <= right; i++) { + if(arr[i] === 0) return false + } + + return true +}; + +// another + /** * @param {number[][]} ranges * @param {number} left From 57c75b381f9a1e6310c78ef70cfbf6b8f14cadf9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 15 Jun 2021 14:44:33 +0800 Subject: [PATCH 0124/2039] Update 215-kth-largest-element-in-an-array.js --- 215-kth-largest-element-in-an-array.js | 48 ++++++++++++-------------- 1 file changed, 22 insertions(+), 26 deletions(-) diff --git a/215-kth-largest-element-in-an-array.js b/215-kth-largest-element-in-an-array.js index c0514eb2..f8544874 100755 --- a/215-kth-largest-element-in-an-array.js +++ b/215-kth-largest-element-in-an-array.js @@ -66,42 +66,38 @@ function quickselect(arr, lo, hi, k) { * @param {number} k * @return {number} */ -const findKthLargest = function(list, k) { - const len = list.length - let lo = 0 - let hi = len - 1 - let pivot = 0 - let t = len - k - while(lo < hi) { - pivot = partition(list, lo, hi) - if(pivot === t) { - break - } else if(pivot < t) { - lo = pivot + 1 - } else if(pivot > t) { - hi = pivot - 1 +const findKthLargest = function(nums, k) { + const n = nums.length + let l = 0, r = n - 1, t = n - k + while(l < r) { + const mid = partition(nums, l, r) + if(mid < t) { + l = mid + 1 + } else { + if(mid === t) break + else r = mid - 1 } } - - return list[t] -} + return nums[t] +}; -function partition(arr, s, e) { - let t = arr[e] - let i = s - for(let j = s; j <= e - 1; j++) { - if(arr[j] <= t) { +function partition(arr, left, right) { + let pivot = arr[right] + let l = left, r = right - 1, j = left + for(let i = left; i < right; i++) { + if(arr[i] <= pivot) { swap(arr, i, j) - i++ + j++ } } - swap(arr, i, e) - return i + swap(arr, j, right) + return j } function swap(arr, i, j) { - let tmp = arr[i] + const tmp = arr[i] arr[i] = arr[j] arr[j] = tmp } + From 3cff0f2adeb14a6936b18fb930289f48551eb59b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 15 Jun 2021 21:11:46 +0800 Subject: [PATCH 0125/2039] Create 1896-minimum-cost-to-change-the-final-value-of-expression.js --- ...to-change-the-final-value-of-expression.js | 89 +++++++++++++++++++ 1 file changed, 89 insertions(+) create mode 100644 1896-minimum-cost-to-change-the-final-value-of-expression.js diff --git a/1896-minimum-cost-to-change-the-final-value-of-expression.js b/1896-minimum-cost-to-change-the-final-value-of-expression.js new file mode 100644 index 00000000..a5600719 --- /dev/null +++ b/1896-minimum-cost-to-change-the-final-value-of-expression.js @@ -0,0 +1,89 @@ +/** + * @param {string} expression + * @return {number} + */ +function minOperationsToFlip (s) { + const nums = [] + const ops = [] + for (let i = 0; i < s.length; i++) { + if (s[i] === '0') nums.push([0, 0, 1]) + else if (s[i] === '1') nums.push([1, 1, 0]) + else if (s[i] === '(') ops.push('(') + else if (s[i] === ')') { + while (ops.length && ops[ops.length - 1] !== '(') { + const op = ops.pop() + calc(op) + } + if (ops.length) ops.pop() + } else { + while (ops.length && grade(ops[ops.length - 1]) >= grade(s[i])) { + const op = ops.pop() + calc(op) + } + ops.push(s[i]) + } + } + + while (ops.length && nums.length >= 2) { + const op = ops.pop() + calc(op) + } + const val = nums[0][0] + return nums[0][2 - val] + + function calc (op) { + const [x, y] = [nums.pop(), nums.pop()] + let [z, a0, a1] = [0, 0, 0] + switch (op) { + case '&': + z = x[0] & y[0] + if (x[0] === 0 && y[0] === 0) { + a0 = 0 + a1 = Math.min(x[2] + 1, y[2] + 1) + } + if (x[0] === 0 && y[0] === 1) { + a0 = 0 + a1 = 1 + } + if (x[0] === 1 && y[0] === 0) { + a0 = 0 + a1 = 1 + } + if (x[0] === 1 && y[0] === 1) { + a0 = Math.min(x[1], y[1]) + a1 = 0 + } + break + case '|': + z = x[0] | y[0] + if (x[0] === 0 && y[0] === 0) { + a0 = 0 + a1 = Math.min(x[2], y[2]) + } + if (x[0] === 0 && y[0] === 1) { + a0 = 1 + a1 = 0 + } + if (x[0] === 1 && y[0] === 0) { + a0 = 1 + a1 = 0 + } + if (x[0] === 1 && y[0] === 1) { + a0 = Math.min(x[1] + 1, y[1] + 1) + a1 = 0 + } + break + } + nums.push([z, a0, a1]) + } + function grade (op) { + switch (op) { + case '(': + return 1 + case '&': + case '|': + return 2 + } + return 0 + } +}; From 64c9108ca5301cd43ed8d58ce734c317cda264cf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Jun 2021 10:27:58 +0800 Subject: [PATCH 0126/2039] Create 1901-find-a-peak-element-ii.js --- 1901-find-a-peak-element-ii.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1901-find-a-peak-element-ii.js diff --git a/1901-find-a-peak-element-ii.js b/1901-find-a-peak-element-ii.js new file mode 100644 index 00000000..882df7c7 --- /dev/null +++ b/1901-find-a-peak-element-ii.js @@ -0,0 +1,28 @@ +/** + * @param {number[][]} mat + * @return {number[]} + */ +const findPeakGrid = function(mat) { + let lowCol = 0; + let highCol = mat[0].length - 1; + + while(lowCol <= highCol) { + let midCol = lowCol + ~~((highCol - lowCol) / 2); + let maxRow = 0; + for(let i = 0; i < mat.length; i++) { + maxRow = mat[i][midCol] > mat[maxRow][midCol] ? i : maxRow; + } + + let isLeftElementBig = midCol - 1 >= lowCol && mat[maxRow][midCol - 1] > mat[maxRow][midCol]; + let isRightElementBig = midCol + 1 <= highCol && mat[maxRow][midCol + 1] > mat[maxRow][midCol]; + + if(!isLeftElementBig && !isRightElementBig) { + return [maxRow, midCol]; + } else if(isRightElementBig) { + lowCol = midCol + 1; + } else { + highCol = midCol - 1; + } + } + return null; +}; From 444ada36b53dc843598eb18aaf0ac68d11e3200b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Jun 2021 12:06:33 +0800 Subject: [PATCH 0127/2039] Create 1903-largest-odd-number-in-string.js --- 1903-largest-odd-number-in-string.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 1903-largest-odd-number-in-string.js diff --git a/1903-largest-odd-number-in-string.js b/1903-largest-odd-number-in-string.js new file mode 100644 index 00000000..097f1cb7 --- /dev/null +++ b/1903-largest-odd-number-in-string.js @@ -0,0 +1,11 @@ +/** + * @param {string} num + * @return {string} + */ +const largestOddNumber = function(num) { + let idx= -1 + for(let i = 0, n = num.length; i < n; i++) { + if((+num[i]) % 2 === 1) idx = i + } + return num.slice(0, idx+1) +}; From f0f1ed351241134a057f2bb7f571ac9f4ed59ee5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Jun 2021 12:12:19 +0800 Subject: [PATCH 0128/2039] Create 1904-the-number-of-full-rounds-you-have-played.js --- 1904-the-number-of-full-rounds-you-have-played.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 1904-the-number-of-full-rounds-you-have-played.js diff --git a/1904-the-number-of-full-rounds-you-have-played.js b/1904-the-number-of-full-rounds-you-have-played.js new file mode 100644 index 00000000..6951e755 --- /dev/null +++ b/1904-the-number-of-full-rounds-you-have-played.js @@ -0,0 +1,11 @@ +/** + * @param {string} startTime + * @param {string} finishTime + * @return {number} + */ +const numberOfRounds = function(startTime, finishTime) { + let start = 60 * parseInt(startTime.slice(0, 2)) + parseInt(startTime.slice(3)) + let finish = 60 * parseInt(finishTime.slice(0, 2)) + parseInt(finishTime.slice(3)); + if (start > finish) finish += 60 * 24; // If `finishTime` is earlier than `startTime`, add 24 hours to `finishTime`. + return Math.floor(finish / 15) - Math.ceil(start / 15); // floor(finish / 15) - ceil(start / 15) +}; From 8e64eb474b5d06740e6ade748564d134a1a12dc3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Jun 2021 13:02:52 +0800 Subject: [PATCH 0129/2039] Create 1905-count-sub-islands.js --- 1905-count-sub-islands.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1905-count-sub-islands.js diff --git a/1905-count-sub-islands.js b/1905-count-sub-islands.js new file mode 100644 index 00000000..b89e0a5e --- /dev/null +++ b/1905-count-sub-islands.js @@ -0,0 +1,25 @@ +/** + * @param {number[][]} grid1 + * @param {number[][]} grid2 + * @return {number} + */ +const countSubIslands = function(grid1, grid2) { + let m = grid2.length, n = grid2[0].length, res = 0; + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (grid2[i][j] === 1) res += dfs(grid1, grid2, i, j); + } + } + return res; +}; + +function dfs(B, A, i, j) { + let m = A.length, n = A[0].length, res = 1; + if (i < 0 || i == m || j < 0 || j == n || A[i][j] == 0) return 1; + A[i][j] = 0; + res &= dfs(B, A, i - 1, j); + res &= dfs(B, A, i + 1, j); + res &= dfs(B, A, i, j - 1); + res &= dfs(B, A, i, j + 1); + return res & B[i][j]; +} From d3e5f08b0263548394404140c5211bff2869b9d3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Jun 2021 13:38:06 +0800 Subject: [PATCH 0130/2039] Create 1906-minimum-absolute-difference-queries.js --- 1906-minimum-absolute-difference-queries.js | 26 +++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1906-minimum-absolute-difference-queries.js diff --git a/1906-minimum-absolute-difference-queries.js b/1906-minimum-absolute-difference-queries.js new file mode 100644 index 00000000..837228ec --- /dev/null +++ b/1906-minimum-absolute-difference-queries.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +const minDifference = function(nums, queries) { + const res = [], cnt = Array.from({ length: nums.length + 1 }, () => Array(101).fill(0)) + + for (let i = 0; i < nums.length; ++i) { + for (let j = 1; j <= 100; ++j) { + cnt[i + 1][j] = cnt[i][j] + (nums[i] == j); + } + } + + + for (let i = 0; i < queries.length; ++i) { + let prev = 0, delta = Infinity; + for (let j = 1; j <= 100; ++j) + if (cnt[queries[i][1] + 1][j] - cnt[queries[i][0]][j]) { + delta = Math.min(delta, prev == 0 ? Infinity : j - prev); + prev = j; + } + res.push(delta == Infinity ? -1 : delta); + } + return res; +}; From 218ba2828f3cf52b00db8569ed20e1cc43b88137 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Jun 2021 21:18:44 +0800 Subject: [PATCH 0131/2039] Update 1834-single-threaded-cpu.js --- 1834-single-threaded-cpu.js | 43 +++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1834-single-threaded-cpu.js b/1834-single-threaded-cpu.js index 4a394db0..192aedec 100644 --- a/1834-single-threaded-cpu.js +++ b/1834-single-threaded-cpu.js @@ -239,3 +239,46 @@ const getOrder = function(tasks) { return res }; + +// another + +/** + * @param {number[][]} tasks + * @return {number[]} + */ +const getOrder = function (tasks) { + tasks = tasks.map((e, idx) => [e[0], e[1], idx]) + tasks.sort((a, b) => a[0] - b[0]) + const pq = new PriorityQueue(compare) + const res = [] + let i = 0, + t = 0 + while (i < tasks.length) { + while (i < tasks.length && tasks[i][0] <= t) { + let [ent, pt, ind] = tasks[i] + i += 1 + pq.push([pt, ind]) + } + if (pq.size() == 0) { + if (i < tasks.length) t = tasks[i][0] + continue + } + let [pt, ind] = pq.pop() + res.push(ind) + t += pt + } + while (pq.size()) { + let [pt, index] = pq.pop() + res.push(index) + } + return res +} + +function compare(a, b) { + if (a[0] < b[0]) return true + else if (a[0] > b[0]) return false + else { + return a[1] < b[1] + } +} + From e62044c4b6e1093333b0fd72f3c131691454761c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Jun 2021 19:57:43 +0800 Subject: [PATCH 0132/2039] Update 540-single-element-in-a-sorted-array.js --- 540-single-element-in-a-sorted-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/540-single-element-in-a-sorted-array.js b/540-single-element-in-a-sorted-array.js index 7c8518d9..461c52a2 100755 --- a/540-single-element-in-a-sorted-array.js +++ b/540-single-element-in-a-sorted-array.js @@ -15,6 +15,24 @@ const singleNonDuplicate = function(nums) { // another +/** + * @param {number[]} nums + * @return {number} + */ +const singleNonDuplicate = function(nums) { + const n = nums.length + let left = 0, right = n - 1 + while(left < right) { + const mid = ~~((left + right) / 2) + if((mid % 2 === 0 && nums[mid] === nums[mid + 1]) || (mid % 2 === 1 && nums[mid] === nums[mid - 1])) left = mid + 1 + else right = mid + } + + return nums[left] +}; + +// another + /** * @param {number[]} nums * @return {number} From 20c82efbf7efc5118b4ec6b22fea60068f22bb62 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Jun 2021 20:00:43 +0800 Subject: [PATCH 0133/2039] Update 540-single-element-in-a-sorted-array.js --- 540-single-element-in-a-sorted-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/540-single-element-in-a-sorted-array.js b/540-single-element-in-a-sorted-array.js index 461c52a2..a840caa3 100755 --- a/540-single-element-in-a-sorted-array.js +++ b/540-single-element-in-a-sorted-array.js @@ -15,6 +15,24 @@ const singleNonDuplicate = function(nums) { // another +/** + * @param {number[]} nums + * @return {number} + */ +const singleNonDuplicate = function(nums) { + const n = nums.length + let left = 0, right = n - 1 + while(left < right) { + const mid = left + ((right - left) >> 1) + if(nums[mid] === nums[mid ^ 1]) left = mid + 1 + else right = mid + } + + return nums[left] +}; + +// another + /** * @param {number[]} nums * @return {number} From 2b0631a1cac4ab33924a26e4177b0ca467e471ca Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Jun 2021 16:12:31 +0800 Subject: [PATCH 0134/2039] Update 445-add-two-numbers-II.js --- 445-add-two-numbers-II.js | 60 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 60 insertions(+) diff --git a/445-add-two-numbers-II.js b/445-add-two-numbers-II.js index ef5c15e6..4800985a 100755 --- a/445-add-two-numbers-II.js +++ b/445-add-two-numbers-II.js @@ -1,3 +1,63 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} l1 + * @param {ListNode} l2 + * @return {ListNode} + */ +const addTwoNumbers = function(head1, head2) { + const r1 = reverse(head1), r2 = reverse(head2) + let l1 = r1, l2 = r2, inc = 0 + let dummy = new ListNode() + let pre = dummy + while(l1 || l2) { + let val = inc + if(l1) { + val += l1.val + l1 = l1.next + } + if(l2) { + val += l2.val + l2 = l2.next + } + if(val > 9) inc = 1 + else inc = 0 + const cur = new ListNode(val % 10) + pre.next = cur + pre = cur + } + if (inc) { + pre.next = new ListNode(1) + } + return reverse(dummy.next) +}; + +function reverse(head) { + const dummy = new ListNode() + dummy.next = head + let len = 0, cur = head + while(cur) { + len++ + cur = cur.next + } + let p = dummy, tail = head, tmp = null + for(let i = 0; i < len - 1; i++) { + tmp = p.next + p.next = tail.next + tail.next = tail.next.next + p.next.next = tmp + } + return dummy.next +} + + +// another + /** * Definition for singly-linked list. * function ListNode(val) { From 75df5ade870512ddaf71750a2535fbc6988dac73 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Jun 2021 20:10:29 +0800 Subject: [PATCH 0135/2039] Update 1904-the-number-of-full-rounds-you-have-played.js --- ...e-number-of-full-rounds-you-have-played.js | 28 ++++++++++++++++--- 1 file changed, 24 insertions(+), 4 deletions(-) diff --git a/1904-the-number-of-full-rounds-you-have-played.js b/1904-the-number-of-full-rounds-you-have-played.js index 6951e755..3aaafdf4 100644 --- a/1904-the-number-of-full-rounds-you-have-played.js +++ b/1904-the-number-of-full-rounds-you-have-played.js @@ -4,8 +4,28 @@ * @return {number} */ const numberOfRounds = function(startTime, finishTime) { - let start = 60 * parseInt(startTime.slice(0, 2)) + parseInt(startTime.slice(3)) - let finish = 60 * parseInt(finishTime.slice(0, 2)) + parseInt(finishTime.slice(3)); - if (start > finish) finish += 60 * 24; // If `finishTime` is earlier than `startTime`, add 24 hours to `finishTime`. - return Math.floor(finish / 15) - Math.ceil(start / 15); // floor(finish / 15) - ceil(start / 15) + const { ceil, floor } = Math + const start = new Node(startTime), finish = new Node(finishTime) + if(finish.compare(start)) finish.hour += 24 + let cnt = 0 + if(start.hour === finish.hour) { + const r = floor(finish.minute / 15) + const l = ceil(start.minute / 15) + if(l >= r) return 0 + return r - l + } + cnt += 4 - ceil(start.minute / 15) + floor(finish.minute / 15) + start.hour++ + cnt += (finish.hour - start.hour) * 4 + return cnt }; + +class Node { + constructor(str) { + this.hour = +str.slice(0, 2) + this.minute = +str.slice(3) + } + compare(node) { + return this.hour === node.hour ? this.minute < node.minute : this.hour < node.hour + } +} From dcb01b6638f355a9c3a2f5f4a912b78eb13f9343 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Jun 2021 20:13:38 +0800 Subject: [PATCH 0136/2039] Update 1904-the-number-of-full-rounds-you-have-played.js --- 1904-the-number-of-full-rounds-you-have-played.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/1904-the-number-of-full-rounds-you-have-played.js b/1904-the-number-of-full-rounds-you-have-played.js index 3aaafdf4..d53993e3 100644 --- a/1904-the-number-of-full-rounds-you-have-played.js +++ b/1904-the-number-of-full-rounds-you-have-played.js @@ -1,3 +1,17 @@ +/** + * @param {string} startTime + * @param {string} finishTime + * @return {number} + */ +const numberOfRounds = function(startTime, finishTime) { + let start = 60 * parseInt(startTime.slice(0, 2)) + parseInt(startTime.slice(3)) + let finish = 60 * parseInt(finishTime.slice(0, 2)) + parseInt(finishTime.slice(3)); + if (start > finish) finish += 60 * 24; // If `finishTime` is earlier than `startTime`, add 24 hours to `finishTime`. + return Math.max(0, Math.floor(finish / 15) - Math.ceil(start / 15)); // floor(finish / 15) - ceil(start / 15) +}; + +// another + /** * @param {string} startTime * @param {string} finishTime From fd3a613879c19b9fad7a500a8fccc9b35f17ec29 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 24 Jun 2021 19:23:15 +0800 Subject: [PATCH 0137/2039] Update 1906-minimum-absolute-difference-queries.js --- 1906-minimum-absolute-difference-queries.js | 39 +++++++++++---------- 1 file changed, 20 insertions(+), 19 deletions(-) diff --git a/1906-minimum-absolute-difference-queries.js b/1906-minimum-absolute-difference-queries.js index 837228ec..0b153a62 100644 --- a/1906-minimum-absolute-difference-queries.js +++ b/1906-minimum-absolute-difference-queries.js @@ -3,24 +3,25 @@ * @param {number[][]} queries * @return {number[]} */ -const minDifference = function(nums, queries) { - const res = [], cnt = Array.from({ length: nums.length + 1 }, () => Array(101).fill(0)) - - for (let i = 0; i < nums.length; ++i) { - for (let j = 1; j <= 100; ++j) { - cnt[i + 1][j] = cnt[i][j] + (nums[i] == j); - } - } - +const minDifference = function (nums, queries) { + const res = [], + cnt = Array.from({ length: nums.length + 1 }, () => Array(101).fill(0)) - for (let i = 0; i < queries.length; ++i) { - let prev = 0, delta = Infinity; - for (let j = 1; j <= 100; ++j) - if (cnt[queries[i][1] + 1][j] - cnt[queries[i][0]][j]) { - delta = Math.min(delta, prev == 0 ? Infinity : j - prev); - prev = j; - } - res.push(delta == Infinity ? -1 : delta); + for (let i = 0; i < nums.length; ++i) { + for (let j = 1; j <= 100; ++j) { + cnt[i + 1][j] = cnt[i][j] + (nums[i] == j) } - return res; -}; + } + + for (let i = 0; i < queries.length; ++i) { + let prev = 0, + delta = Infinity + for (let j = 1; j <= 100; ++j) + if (cnt[queries[i][1] + 1][j] - cnt[queries[i][0]][j]) { + delta = Math.min(delta, prev == 0 ? Infinity : j - prev) + prev = j + } + res.push(delta == Infinity ? -1 : delta) + } + return res +} From a48579eba6a5a3c13cf51429e39f9a281ca7f40e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 25 Jun 2021 22:14:37 +0800 Subject: [PATCH 0138/2039] Update 264-ugly-number-ii.js --- 264-ugly-number-ii.js | 22 +++++++++++++--------- 1 file changed, 13 insertions(+), 9 deletions(-) diff --git a/264-ugly-number-ii.js b/264-ugly-number-ii.js index b062b445..af94e904 100644 --- a/264-ugly-number-ii.js +++ b/264-ugly-number-ii.js @@ -2,15 +2,19 @@ * @param {number} n * @return {number} */ -const nthUglyNumber = function(n) { - const dp = [1] - let [a, b, c] = [0, 0, 0] +const nthUglyNumber = function (n) { + if (n <= 0) return false + if (n === 1) return true + let t2 = 0, + t3 = 0, + t5 = 0 + const k = Array(n).fill(1) + k[0] = 1 for (let i = 1; i < n; i++) { - let [ua, ub, uc] = [dp[a] * 2, dp[b] * 3, dp[c] * 5] - dp[i] = Math.min(ua, ub, uc) - if (dp[i] === ua) a++ - if (dp[i] === ub) b++ - if (dp[i] === uc) c++ + k[i] = Math.min(k[t2] * 2, k[t3] * 3, k[t5] * 5) + if (k[i] == k[t2] * 2) t2++ + if (k[i] == k[t3] * 3) t3++ + if (k[i] == k[t5] * 5) t5++ } - return dp[n - 1] + return k[n - 1] } From 8c54083ca57052c9bb0f31b28b369ab7d4f5ff74 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 26 Jun 2021 21:01:34 +0800 Subject: [PATCH 0139/2039] Update 313-super-ugly-number.js --- 313-super-ugly-number.js | 92 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 92 insertions(+) diff --git a/313-super-ugly-number.js b/313-super-ugly-number.js index 4de633c8..598944b8 100644 --- a/313-super-ugly-number.js +++ b/313-super-ugly-number.js @@ -20,3 +20,95 @@ const nthSuperUglyNumber = function(n, primes) { } return arr[n - 1] } + +// another + +/** + * @param {number} n + * @param {number[]} primes + * @return {number} + */ +const nthSuperUglyNumber = function(n, primes) { + const ugly = Array(n).fill(0) + const pq = new PriorityQueue((a, b) => a[0] < b[0]) + + for(let i = 0; i < primes.length; i++) pq.push([primes[i], 1, primes[i]]) + ugly[0] = 1 + for(let i = 1; i < n; i++) { + ugly[i] = pq.peek()[0] + while(pq.peek()[0] === ugly[i]) { + const next = pq.pop() + pq.push([next[2] * ugly[next[1]], next[1] + 1, next[2]]) + } + } + + return ugly[n - 1] +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 067586bede3a03241fe2f7830fe55c97600056e4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Jun 2021 21:16:18 +0800 Subject: [PATCH 0140/2039] Create 1915-number-of-wonderful-substrings.js --- 1915-number-of-wonderful-substrings.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1915-number-of-wonderful-substrings.js diff --git a/1915-number-of-wonderful-substrings.js b/1915-number-of-wonderful-substrings.js new file mode 100644 index 00000000..91de957c --- /dev/null +++ b/1915-number-of-wonderful-substrings.js @@ -0,0 +1,20 @@ +/** + * @param {string} word + * @return {number} + */ +const asi = (c) => c.charCodeAt(); +const wonderfulSubstrings = (s) => { + let res = 0; + let f = Array(2 ** 10).fill(0); + f[0] = 1; // count array + let cur = res = 0; + for (const c of s) { + cur ^= 1 << asi(c) - 97; // get Hash (the set bit for a character.), update prefix parity + res += f[cur]; + for (let i = 0; i < 10; i++) { // a ~ j + res += f[cur ^ 1 << i]; // 1 << i get Hash + } + f[cur]++; + } + return res; +}; From b01cade35f60636ea9e07b6363c07888382d8af1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Jun 2021 21:19:52 +0800 Subject: [PATCH 0141/2039] Create 1913-maximum-product-difference-between-two-pairs.js --- 1913-maximum-product-difference-between-two-pairs.js | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 1913-maximum-product-difference-between-two-pairs.js diff --git a/1913-maximum-product-difference-between-two-pairs.js b/1913-maximum-product-difference-between-two-pairs.js new file mode 100644 index 00000000..1786d953 --- /dev/null +++ b/1913-maximum-product-difference-between-two-pairs.js @@ -0,0 +1,9 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxProductDifference = function(nums) { + nums.sort((a, b) => a - b) + const n = nums.length + return nums[n - 1] * nums[n - 2] - nums[0] * nums[1] +}; From 38124f40b946df05e9aed71e8c13c15928100097 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Jun 2021 21:22:02 +0800 Subject: [PATCH 0142/2039] Create 1914-cyclically-rotating-a-gridsubmissions.js --- 1914-cyclically-rotating-a-gridsubmissions.js | 65 +++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 1914-cyclically-rotating-a-gridsubmissions.js diff --git a/1914-cyclically-rotating-a-gridsubmissions.js b/1914-cyclically-rotating-a-gridsubmissions.js new file mode 100644 index 00000000..8d950c18 --- /dev/null +++ b/1914-cyclically-rotating-a-gridsubmissions.js @@ -0,0 +1,65 @@ +/** + * @param {number[][]} grid + * @param {number} k + * @return {number[][]} + */ +var rotateGrid = function(grid, k) { + var m = grid.length; + var n = grid[0].length; + + // step1: loop each layer + var layer = Math.min(n/2, m/2); + for(l = 0; l=l; j--) + { + cur.push(grid[m-l-1][j]); + } + // left + for(var i = m-l-2; i>l; i--) + { + cur.push(grid[i][l]); + } + + // step3: rotation (k%len) on one-dimension array + var d = cur.length; + var offset = k % d; + cur = [...cur.slice(offset, d), ...cur.slice(0, offset)]; + + // step4: refill rotated array back to 2D array at current layer + var index = 0; + // top + for(var j = l; j=l; j--) + { + grid[m-l-1][j] = cur[index++]; + } + // left + for(var i = m-l-2; i>l; i--) + { + grid[i][l] = cur[index++]; + } + } + return grid; +}; From 6380a7ab401f3b1075cabd293d5201e71fcf2951 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Jun 2021 14:53:16 +0800 Subject: [PATCH 0143/2039] Update 1914-cyclically-rotating-a-gridsubmissions.js --- 1914-cyclically-rotating-a-gridsubmissions.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/1914-cyclically-rotating-a-gridsubmissions.js b/1914-cyclically-rotating-a-gridsubmissions.js index 8d950c18..056a22c3 100644 --- a/1914-cyclically-rotating-a-gridsubmissions.js +++ b/1914-cyclically-rotating-a-gridsubmissions.js @@ -1,3 +1,45 @@ +/** + * @param {number[][]} grid + * @param {number} k + * @return {number[][]} + */ +const rotateGrid = function(grid, k) { + const m = grid.length, n = grid[0].length + let top = 0, left = 0, right = n - 1, bottom = m - 1 + while(top < bottom && left < right) { + const num = (right - left + 1) * 2 + (bottom - top + 1) * 2 - 4 + let rem = k % num + while(rem) { + const tmp = grid[top][left] + // top + for(let i = left; i < right; i++) { + grid[top][i] = grid[top][i + 1] + } + // right + for(let i = top; i < bottom; i++) { + grid[i][right] = grid[i + 1][right] + } + // bottom + for(let i = right; i > left; i--) { + grid[bottom][i] = grid[bottom][i - 1] + } + // left + for(let i = bottom; i > top; i--) { + grid[i][left] = grid[i - 1][left] + } + grid[top + 1][left] = tmp + rem-- + } + left++ + top++ + right-- + bottom-- + } + return grid +}; + +// another + /** * @param {number[][]} grid * @param {number} k From 41cd8bab244fb21d5185cd8ecabb5495f3c97347 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Jun 2021 16:14:58 +0800 Subject: [PATCH 0144/2039] Update 328-odd-even-linked-list.js --- 328-odd-even-linked-list.js | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/328-odd-even-linked-list.js b/328-odd-even-linked-list.js index f3615535..068e799b 100755 --- a/328-odd-even-linked-list.js +++ b/328-odd-even-linked-list.js @@ -23,3 +23,40 @@ const oddEvenList = function(head) { odd.next = evenHead; return head; }; + +// another + +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +function oddEvenList(head) { + if(head == null) return head + const dummyOdd = new ListNode() + const dummyEven = new ListNode() + + dummyOdd.next = head + let odd = head, even = dummyEven + let idx = 2, cur = head.next + while(cur) { + if (idx % 2 === 1) { + odd.next = cur + odd = odd.next + } else { + even.next = cur + even = even.next + } + cur = cur.next + idx++ + } + odd.next = dummyEven.next + even.next = null + return dummyOdd.next +} From be83f821b2b1e5f3203e922821e9e58159d71b9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 30 Jun 2021 22:04:29 +0800 Subject: [PATCH 0145/2039] Create 1911-maximum-alternating-subsequence-sum.js --- 1911-maximum-alternating-subsequence-sum.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1911-maximum-alternating-subsequence-sum.js diff --git a/1911-maximum-alternating-subsequence-sum.js b/1911-maximum-alternating-subsequence-sum.js new file mode 100644 index 00000000..fbcfcabb --- /dev/null +++ b/1911-maximum-alternating-subsequence-sum.js @@ -0,0 +1,12 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxAlternatingSum = function(nums) { + let odd = 0, even = 0; + for (let a of nums) { + even = Math.max(even, odd + a); + odd = even - a; + } + return even; +}; From e18ae1d53d26652d8d68b0f760cce2965d15248f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 30 Jun 2021 23:04:12 +0800 Subject: [PATCH 0146/2039] Update 1911-maximum-alternating-subsequence-sum.js --- 1911-maximum-alternating-subsequence-sum.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/1911-maximum-alternating-subsequence-sum.js b/1911-maximum-alternating-subsequence-sum.js index fbcfcabb..555eefb8 100644 --- a/1911-maximum-alternating-subsequence-sum.js +++ b/1911-maximum-alternating-subsequence-sum.js @@ -10,3 +10,17 @@ const maxAlternatingSum = function(nums) { } return even; }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const maxAlternatingSum = function(nums) { + let res = nums[0] + for(let i = 1; i < nums.length; i++) { + res += Math.max(nums[i] - nums[i - 1], 0) + } + return res +}; From 581a790832e92872d6d75a9abb6321cc5f0e6fff Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Jul 2021 19:44:40 +0800 Subject: [PATCH 0147/2039] Create 1916-count-ways-to-build-rooms-in-an-ant-colony.js --- ...nt-ways-to-build-rooms-in-an-ant-colony.js | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 1916-count-ways-to-build-rooms-in-an-ant-colony.js diff --git a/1916-count-ways-to-build-rooms-in-an-ant-colony.js b/1916-count-ways-to-build-rooms-in-an-ant-colony.js new file mode 100644 index 00000000..4c4a6d4f --- /dev/null +++ b/1916-count-ways-to-build-rooms-in-an-ant-colony.js @@ -0,0 +1,60 @@ +/** + * @param {number[]} prevRoom + * @return {number} + */ +const waysToBuildRooms = function (prevRoom) { + return brute(prevRoom); +}; +function brute(prevRoom) { + const power = function (a, b, n) { + a = a % n; + let result = 1n; + let x = a; + while (b > 0) { + let leastSignificantBit = b % 2n; + b = b / 2n; + if (leastSignificantBit == 1n) { + result = result * x; + result = result % n; + } + x = x * x; + x = x % n; + } + return result; + }; + const modInverse = function (aa, mm) { + return power(BigInt(aa), BigInt(mm - 2), BigInt(mm)); + }; + const mod = Math.pow(10, 9) + 7; + let nodes = {}; + for (let i = 0; i < prevRoom.length; i++) { + nodes[i] = { val: i, edges: {} }; + } + for (let i = 1; i < prevRoom.length; i++) { + nodes[prevRoom[i]].edges[i] = true; + } + let memo = {}; + const numNodes = function (root) { + var key = root.val; + if (memo[key] !== undefined) { + return memo[key]; + } + var res = 1; + for (var x in root.edges) { + res += numNodes(nodes[x]); + } + memo[key] = res; + return res; + }; + let den = 1; + for (let x in nodes) { + let size = numNodes(nodes[x]); + den = (den * size) % mod; + } + let numerator = 1; + for (let i = 1; i < prevRoom.length; i++) { + numerator = (numerator * (i + 1)) % mod; + } + let denInverse = modInverse(den, mod); + return (BigInt(numerator) * denInverse) % BigInt(mod); +} From df2704dc754a5d636bcaacd977332e14097a09ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Jul 2021 10:43:59 +0800 Subject: [PATCH 0148/2039] Create tmp.js --- tmp.js | 86 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 86 insertions(+) create mode 100644 tmp.js diff --git a/tmp.js b/tmp.js new file mode 100644 index 00000000..0479fb6d --- /dev/null +++ b/tmp.js @@ -0,0 +1,86 @@ +/** + * @param {string} s + * @return {boolean} + */ +var isDecomposable = function(s) { + let hasTwo = false + let i = 0 + let j = 0 + + while(j < s.length) { + while(j + 1 < s.length && s[j + 1] === s[i]) { + j += 1 + } + + if (((j - i + 1) % 3) === 2) { + if (!hasTwo) { + hasTwo = true + } else { + return false + } + } else if (((j - i + 1) % 3) === 1) { + return false + } + j++ + i = j + } + + return hasTwo +}; + + +class Solution { +public: + vector longestCommomSubsequence(vector>& arrays) { + int n = arrays.size(); + vector nums = vector(100); // 100 possible numbers as stated in the question + for (int i = 0; i < n; i++) { + for (int j = 0; j < arrays[i].size(); j++) { + nums[arrays[i][j] - 1]++; // count occurrences + } + } + vector ans; + for (int i = 0; i < 100; i++) { + if (nums[i] == n) ans.push_back(i + 1); // save it if it appears in every array + } + return ans; + } +}; + +class Solution { + public int[] findMaximums(int[] nums) { + if(nums == null || nums.length == 0) return nums; + // calc the [l, r] for each ele where in [l, r]: ele is the min value + int len = nums.length; + TreeSet idx = new TreeSet<>(); + Integer[] indices = new Integer[len]; + for(int i = 0; i < len; i++) indices[i] = i; + Arrays.sort(indices, (l, r) -> nums[l] - nums[r]); + int prev = -1; + int[] ranges = new int[len]; + Queue sameLevel = new LinkedList<>(); + int[] ans = new int[len]; + for(int i = 0; i < len; i++) { + if(nums[indices[i]] > prev) { + while(!sameLevel.isEmpty()) { + idx.add(sameLevel.poll()); + } + } + Integer l = idx.lower(indices[i]); + Integer r = idx.higher(indices[i]); + ranges[indices[i]] = (r == null?len - 1:r - 1) - (l == null?0:l + 1) + 1; + prev = nums[indices[i]]; + sameLevel.add(indices[i]); + } + // we iterate ranges from maximum to minimum to construct the ans array + int j = len - 1; + for(int i = len - 1; i >= 0; i--) { + while(j >= 0 && ranges[indices[j]] < len - i) { + j--; + } + ans[len - 1 - i] = nums[indices[j]]; + } + return ans; + } +} + From 20b14d2e6eac58734564dcebcac17dc592f8c116 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Jul 2021 10:45:09 +0800 Subject: [PATCH 0149/2039] Update tmp.js --- tmp.js | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/tmp.js b/tmp.js index 0479fb6d..23f8f619 100644 --- a/tmp.js +++ b/tmp.js @@ -84,3 +84,11 @@ class Solution { } } +/** + * @param {number[][]} points + * @param {number} k + * @return {number} + */ +var minDayskVariants = function(points, k) { + +}; From a149b67e1ab0dc53275964091c6f5d1745695ba7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Jul 2021 11:34:05 +0800 Subject: [PATCH 0150/2039] Update tmp.js --- tmp.js | 63 ++++++++++++++++++++++++++++++++++++++++++++++++++-------- 1 file changed, 55 insertions(+), 8 deletions(-) diff --git a/tmp.js b/tmp.js index 23f8f619..4e53563a 100644 --- a/tmp.js +++ b/tmp.js @@ -84,11 +84,58 @@ class Solution { } } -/** - * @param {number[][]} points - * @param {number} k - * @return {number} - */ -var minDayskVariants = function(points, k) { - -}; +class Solution: + def minDayskVariants(self, points: List[List[int]], k: int) -> int: + lo = 0 + hi = int(1e9) + + # binary search check helper function + def check(day): + lines = collections.defaultdict(collections.Counter) + + # 2d sweep line + for x, y in points: + lbx, lby = (x, y - day) # left point + ubx, uby = (x - day, y) # bottom point + + # lbx + lby == ubx + uby == new x axis's open line + lines[lbx+lby][lby-lbx] += 1 + lines[ubx+uby][uby-ubx+1] -= 1 # + + # lbx + lby == ubx + uby == new x axis's close line + lbx, lby = (x + day, y) # right point + ubx, uby = (x, y + day) # upper point + lines[lbx+lby+1][lby-lbx] -= 1 + lines[ubx+uby+1][uby-ubx+1] += 1 + + # hold a new ranges to sweep all lines from left to right on new x axis + ranges = collections.Counter() + + # for every critical points on new x axis (it's a diag on the original axis), + # add the sweep lines on new y axis + for diag in sorted(lines): + for num in sorted(lines[diag]): + cnt = lines[diag][num] + ranges[num] += cnt + + # for every critical points, check whether there is an area having + # overlapping points >= k + cur = 0 + for num in sorted(ranges): + cnt = ranges[num] + cur += cnt + + if cur >= k: + return True + + return False + + # binary search + while lo < hi: + mid = (lo + hi) // 2 + if check(mid): + hi = mid + else: + lo = mid + 1 + + return lo From 71f6c586f514180b8d40bb4a5f8b7ade1913cb3f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Jul 2021 19:10:20 +0800 Subject: [PATCH 0151/2039] Update 1915-number-of-wonderful-substrings.js --- 1915-number-of-wonderful-substrings.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1915-number-of-wonderful-substrings.js b/1915-number-of-wonderful-substrings.js index 91de957c..8402c87d 100644 --- a/1915-number-of-wonderful-substrings.js +++ b/1915-number-of-wonderful-substrings.js @@ -1,3 +1,27 @@ +/** + * @param {string} word + * @return {number} + */ +const wonderfulSubstrings = (word) => { + let res = 0, count = Array(1024).fill(0); + let cur = 0; + count[0] = 1; + for (let i = 0; i < word.length; ++i) { + const num = word[i].charCodeAt() - 97; + cur ^= 1 << (num); + res += count[cur]; + ++count[cur]; + + for (let j = 0; j < 10; ++j) { + res += count[cur ^ (1 << j)]; + } + } + + return res; +}; + +// another + /** * @param {string} word * @return {number} From 24b3960faa4823425bfecf769b4ba7fb29cf2115 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Jul 2021 22:24:46 +0800 Subject: [PATCH 0152/2039] Create 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1371-find-the-longest-substring-containing-vowels-in-even-counts.js diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js new file mode 100644 index 00000000..2617178c --- /dev/null +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -0,0 +1,20 @@ +/** + * @param {string} s + * @return {number} + */ +var findTheLongestSubstring = function (s, V = 'aeiou', max = 0) { + let encode = (c) => { + let i = V.indexOf(c) + return i == -1 ? 0 : 1 << i + } + let N = s.length + let A = Array(N + 1).fill(0) + let seen = new Map([[0, 0]]) + for (let i = 1; i <= N; ++i) { + A[i] = A[i - 1] ^ encode(s[i - 1]) + let first = seen.has(A[i]) ? seen.get(A[i]) : i + if (first == i) seen.set(A[i], i) // first seen A[i] index + max = Math.max(max, i - first) // max of i-th index minus first seen A[i] index + } + return max +} From de6b2cb187eee04d1053cab947c1e6f423909d0c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Jul 2021 22:25:19 +0800 Subject: [PATCH 0153/2039] Create 1920-build-array-from-permutation.js --- 1920-build-array-from-permutation.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 1920-build-array-from-permutation.js diff --git a/1920-build-array-from-permutation.js b/1920-build-array-from-permutation.js new file mode 100644 index 00000000..50dda790 --- /dev/null +++ b/1920-build-array-from-permutation.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const buildArray = function(nums) { + const res = [] + for(let i = 0, n = nums.length; i < n; i++) { + res[i] = nums[nums[i]] + } + return res +}; From d33202213a761a267ba2dfee16a5f379cd8f0211 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Jul 2021 22:25:53 +0800 Subject: [PATCH 0154/2039] Create 1921-eliminate-maximum-number-of-monsters.js --- 1921-eliminate-maximum-number-of-monsters.js | 90 ++++++++++++++++++++ 1 file changed, 90 insertions(+) create mode 100644 1921-eliminate-maximum-number-of-monsters.js diff --git a/1921-eliminate-maximum-number-of-monsters.js b/1921-eliminate-maximum-number-of-monsters.js new file mode 100644 index 00000000..e21fbe7b --- /dev/null +++ b/1921-eliminate-maximum-number-of-monsters.js @@ -0,0 +1,90 @@ +/** + * @param {number[]} dist + * @param {number[]} speed + * @return {number} + */ +const eliminateMaximum = function(dist, speed) { + const pq = new PriorityQueue((a, b) => a[0] / a[1] < b[0] / b[1]) + const n = dist.length + for(let i = 0; i < n; i++) { + pq.push([dist[i], speed[i]]) + } + let res = 0 + while(true) { + if(pq.isEmpty()) break + if(pq.peek()[0] < 0) break + const tmp = pq.pop() + if(tmp[0] <= res * tmp[1]) break + res++ + } + + return res +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From f8a08d45202da8603df63c5cf4e9145f73b88dc7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Jul 2021 22:26:21 +0800 Subject: [PATCH 0155/2039] Create 1922-count-good-numbers.js --- 1922-count-good-numbers.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1922-count-good-numbers.js diff --git a/1922-count-good-numbers.js b/1922-count-good-numbers.js new file mode 100644 index 00000000..28813aaa --- /dev/null +++ b/1922-count-good-numbers.js @@ -0,0 +1,23 @@ +/** + * @param {number} n + * @return {number} + */ +const countGoodNumbers = function (n) { + n = BigInt(n) + const MOD = BigInt(10 ** 9 + 7) + let res = + quick_pow(5n, (n + 1n) / 2n ) * quick_pow(4n, n / 2n) + res %= MOD + return res + + function quick_pow(b, m) { + let ans = 1n + while (m) { + if (m % 2n === 1n) ans = (ans * b) % MOD + m = m / 2n + b = (b * b) % MOD + } + return ans + } +} + From f103c1d369def980b94c77663ea44c34906890d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 5 Jul 2021 20:16:09 +0800 Subject: [PATCH 0156/2039] Create 1909-remove-one-element-to-make-the-array-strictly-increasing.js --- ...ment-to-make-the-array-strictly-increasing.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1909-remove-one-element-to-make-the-array-strictly-increasing.js diff --git a/1909-remove-one-element-to-make-the-array-strictly-increasing.js b/1909-remove-one-element-to-make-the-array-strictly-increasing.js new file mode 100644 index 00000000..9446fc73 --- /dev/null +++ b/1909-remove-one-element-to-make-the-array-strictly-increasing.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +const canBeIncreasing = function(nums) { + let previous = nums[0]; + let used = false; + for (let i = 1; i < nums.length; i++){ + if (nums[i] <= previous) { + if (used) return false; + used = true; + if (i === 1 || nums[i] > nums[i - 2]) previous = nums[i]; + } else previous = nums[i]; + } + return true; +}; From 162c1fc470efdd93b2103396b659597adbd20910 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Jul 2021 19:45:41 +0800 Subject: [PATCH 0157/2039] Create 1062-longest-repeating-substring.js --- 1062-longest-repeating-substring.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1062-longest-repeating-substring.js diff --git a/1062-longest-repeating-substring.js b/1062-longest-repeating-substring.js new file mode 100644 index 00000000..605af3ed --- /dev/null +++ b/1062-longest-repeating-substring.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @return {number} + */ +const longestRepeatingSubstring = function(s) { + const n = s.length; + // dp[i][j] means # of repeated chars for substrings ending at i and j + const dp = Array.from({ length: n + 1 }, () => Array(n + 1).fill(0)); + let res = 0; + for (let i = 1; i <= n; i++) { + for (let j = i + 1; j <= n; j++) { + if (s.charAt(i - 1) === s.charAt(j - 1)) { + dp[i][j] = dp[i - 1][j - 1] + 1; + res = Math.max(res, dp[i][j]); + } + } + } + return res; +}; From 62ef8fb36232f64f370f57d168d03b51b075c44c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Jul 2021 19:59:00 +0800 Subject: [PATCH 0158/2039] Update 1062-longest-repeating-substring.js --- 1062-longest-repeating-substring.js | 32 +++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1062-longest-repeating-substring.js b/1062-longest-repeating-substring.js index 605af3ed..9238e218 100644 --- a/1062-longest-repeating-substring.js +++ b/1062-longest-repeating-substring.js @@ -1,3 +1,35 @@ +/** + * @param {string} s + * @return {number} + */ +const longestRepeatingSubstring = function(s) { + let left = 0; + let right = s.length - 1; + while(left < right) { + let pivot = Math.floor((left + right + 1) / 2); + if (hasRepeat(s, pivot)) { + left = pivot; + } else { + right = pivot - 1; + } + } + return left; +}; + +const hasRepeat = (s, l) => { + const strings = new Set(); + for (let i = 0; i < s.length - l + 1; i++) { + const sub = s.substr(i, l); + if (strings.has(sub)) { + return true; + } + strings.add(sub); + } + return false; +} + +// another + /** * @param {string} s * @return {number} From 83c62cb4a71bc6613363e889b2da06dad704f67a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Jul 2021 21:44:57 +0800 Subject: [PATCH 0159/2039] Update 1062-longest-repeating-substring.js --- 1062-longest-repeating-substring.js | 3 +++ 1 file changed, 3 insertions(+) diff --git a/1062-longest-repeating-substring.js b/1062-longest-repeating-substring.js index 9238e218..9016c72c 100644 --- a/1062-longest-repeating-substring.js +++ b/1062-longest-repeating-substring.js @@ -49,3 +49,6 @@ const longestRepeatingSubstring = function(s) { } return res; }; + +// non-overlap version +// http://nriverwang.blogspot.com/2013/04/longest-repeated-substring.html From a4286175ebb89aa015c1f25043acd741d62c79a2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Jul 2021 21:52:35 +0800 Subject: [PATCH 0160/2039] Update 1062-longest-repeating-substring.js --- 1062-longest-repeating-substring.js | 62 +++++++++++++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/1062-longest-repeating-substring.js b/1062-longest-repeating-substring.js index 9016c72c..ee57fe13 100644 --- a/1062-longest-repeating-substring.js +++ b/1062-longest-repeating-substring.js @@ -52,3 +52,65 @@ const longestRepeatingSubstring = function(s) { // non-overlap version // http://nriverwang.blogspot.com/2013/04/longest-repeated-substring.html + +/* +You are to find the longest repeated substring in a given text. +Repeated substrings may not overlap. If more than one substring is +repeated with the same length, print the first one you find.(starting +from the beginning of the text). NOTE: The substrings can't be all spaces. + +Input Sample: +Your program should accept as its first argument a path to a filename. +The input file contains several lines. Each line is one test case. +Each line contains a test string. eg. + +banana +abc + +Output Sample: +For each set of input produce a single line of output which is the +longest repeated substring. If there is none, print out the string NONE. eg. +an +NONE + +std::string repeated_substring(std::string &str) { + int len = str.length(); + + int **c = new int*[len + 1]; + for (int i = 0; i <= len; ++i) + c[i] = new int[len + 1]; + for (int i = 0; i <= len; ++i) { + c[i][0] = 0; + c[0][i] = 0; + } + + int max_len = 0, index = len + 1; + for (int i = 1; i <= len; ++i) { + for (int j = 1; j <= len; ++j) { + if (str[i-1] == str[j-1] && abs(i-j) > c[i-1][j-1]) { + c[i][j] = c[i-1][j-1] + 1; + if (c[i][j] > max_len) { + max_len = c[i][j]; + index = std::min(i, j); + } + } else { + c[i][j] = 0; + } + } + } + + for (int i = 0; i <= len; ++i) + delete[] c[i]; + delete[] c; + + if (max_len > 0) { + std::string ret = str.substr(index - max_len, max_len); + for (int i = 0; i < max_len; ++i) + if(ret[i] != ' ') + return ret; + } + + return "NONE"; +} + +*/ From b1155a8772f666932f0d0adf0cbe1320f80f8c7a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Jul 2021 20:58:53 +0800 Subject: [PATCH 0161/2039] Update 1044-longest-duplicate-substring.js --- 1044-longest-duplicate-substring.js | 33 +++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/1044-longest-duplicate-substring.js b/1044-longest-duplicate-substring.js index 48291448..9403a04b 100644 --- a/1044-longest-duplicate-substring.js +++ b/1044-longest-duplicate-substring.js @@ -1,3 +1,36 @@ +/** + * @param {string} s + * @return {string} + */ +const longestDupSubstring = function(s) { + const n = s.length + let l = 0, r = n, res = '' + while(l < r) { + const mid = (l + r + 1) >> 1 + const [chk, str] = valid(s, mid) + if(chk) { + l = mid + res = str + } else { + r = mid - 1 + } + } + return res +}; + +function valid(s, len) { + const set = new Set() + for(let i = 0, n = s.length; i <= n - len; i++) { + const tmp = s.substr(i, len) + if(set.has(tmp)) return [true, tmp] + set.add(tmp) + } + + return [false, ''] +} + +// another + /** * @param {string} S * @return {string} From c58ad69fda63cdb49068515e698478ec1c7d3428 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 8 Jul 2021 11:58:55 +0800 Subject: [PATCH 0162/2039] Create 1554-strings-differ-by-one-character.js --- 1554-strings-differ-by-one-character.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1554-strings-differ-by-one-character.js diff --git a/1554-strings-differ-by-one-character.js b/1554-strings-differ-by-one-character.js new file mode 100644 index 00000000..2ad361e8 --- /dev/null +++ b/1554-strings-differ-by-one-character.js @@ -0,0 +1,17 @@ +/** + * @param {string[]} dict + * @return {boolean} + */ + const differByOne = function(dict) { + const n = dict.length, m = dict[0].length + for (let j = 0; j < m; j++) { + const seen = new Set() + for(let i = 0; i < n; i++) { + const newStr = dict[i].slice(0, j) + '*' + dict[i].slice(j + 1) + if(seen.has(newStr)) return true + seen.add(newStr) + } + } + + return false +}; From 434170a76041492af110b885a579b4c05ea1e399 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 8 Jul 2021 13:21:22 +0800 Subject: [PATCH 0163/2039] Update 1554-strings-differ-by-one-character.js --- 1554-strings-differ-by-one-character.js | 34 +++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/1554-strings-differ-by-one-character.js b/1554-strings-differ-by-one-character.js index 2ad361e8..23044537 100644 --- a/1554-strings-differ-by-one-character.js +++ b/1554-strings-differ-by-one-character.js @@ -15,3 +15,37 @@ return false }; + +// another + +/** + * @param {string[]} dict + * @return {boolean} + */ +const differByOne = function (dict) { + const M = dict.length, + N = dict[0].length + const hash = Array(M).fill(0), + ord = (c) => c.charCodeAt(0), + MOD = 1e13, seen = new Set() + // 1. generate each i-th rolling hash + for (let i = 0; i < M; ++i) { + let base = 1 + for (let j = 0; j < N; ++j) { + hash[i] = (hash[i] + base * ord(dict[i][j])) % MOD + base = (123 * base) % MOD + } + } + // 2. remove each j-th char from each i-th rolling hash to 🔍 find a diff collision 💥 + for (let i = 0; i < M; ++i) { + let base = 1 + for (let j = 0; j < N; ++j) { + const diff = (hash[i] - base * ord(dict[i][j])) % MOD + if (seen.has(diff)) return true // 🎯 found a diff collision 💥 + seen.add(diff) + base = (123 * base) % MOD + } + } + return false +} + From 4c2916c4392d37262c1e0ccbfa6ce5e5905a42d4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 8 Jul 2021 21:37:35 +0800 Subject: [PATCH 0164/2039] Update 1554-strings-differ-by-one-character.js --- 1554-strings-differ-by-one-character.js | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) diff --git a/1554-strings-differ-by-one-character.js b/1554-strings-differ-by-one-character.js index 23044537..642d2ad0 100644 --- a/1554-strings-differ-by-one-character.js +++ b/1554-strings-differ-by-one-character.js @@ -24,26 +24,27 @@ */ const differByOne = function (dict) { const M = dict.length, - N = dict[0].length - const hash = Array(M).fill(0), + N = dict[0].length, + hash = Array(M).fill(0), ord = (c) => c.charCodeAt(0), - MOD = 1e13, seen = new Set() + MOD = 1e13, seen = new Set(), + zPlusOne = 'z'.charCodeAt(0) // 1. generate each i-th rolling hash for (let i = 0; i < M; ++i) { let base = 1 for (let j = 0; j < N; ++j) { hash[i] = (hash[i] + base * ord(dict[i][j])) % MOD - base = (123 * base) % MOD + base = (zPlusOne * base) % MOD } } - // 2. remove each j-th char from each i-th rolling hash to 🔍 find a diff collision 💥 + // 2. remove each j-th char from each i-th rolling hash to find a diff collision for (let i = 0; i < M; ++i) { let base = 1 for (let j = 0; j < N; ++j) { const diff = (hash[i] - base * ord(dict[i][j])) % MOD - if (seen.has(diff)) return true // 🎯 found a diff collision 💥 + if (seen.has(diff)) return true seen.add(diff) - base = (123 * base) % MOD + base = (zPlusOne * base) % MOD } } return false From c1aaa80ce97ec60c757c4d1d574788a96c7716af Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 9 Jul 2021 20:30:21 +0800 Subject: [PATCH 0165/2039] Create 1923-longest-common-subpath.js --- 1923-longest-common-subpath.js | 98 ++++++++++++++++++++++++++++++++++ 1 file changed, 98 insertions(+) create mode 100644 1923-longest-common-subpath.js diff --git a/1923-longest-common-subpath.js b/1923-longest-common-subpath.js new file mode 100644 index 00000000..b87890ea --- /dev/null +++ b/1923-longest-common-subpath.js @@ -0,0 +1,98 @@ +/** + * @param {number} n + * @param {number[][]} paths + * @return {number} + */ +const longestCommonSubpath = function(n, paths) { + if (!paths.length) return 0 + let arr = paths[0] + for (const path of paths) if (path.length < arr.length) arr = path + return new Sam(arr).longestCommonSubpath(paths) +}; + +class State { + constructor(len, link, next) { + this.len = len + this.link = link + this.next = new Map(next) + this.ans = len + this.revLink = [] + this.max = 0 + } +} + +/** + * @param p {State} + * @return boolean + */ +function dfs(p) { + let hasNext = false + for (const q of p.revLink) { + hasNext = dfs(q) || hasNext + } + if (hasNext) p.max = p.len + return p.max > 0 +} + +class Sam { + newState(len, link, next) { + const state = new State(len, link, next) + this.container.push(state) + return state + } + + constructor(path) { + this.container = [] + const root = this.newState(0, null) + let last = root + for (const x of path) { + const cur = this.newState(last.len + 1, root) + for (let p = last; p; p = p.link) { + const q = p.next.get(x) + if (!q) { + p.next.set(x, cur) + continue + } + if (q.len === p.len + 1) { + cur.link = q + } else { + const clone = this.newState(p.len + 1, q.link, q.next) + for (; p && p.next.get(x) === q; p = p.link) p.next.set(x, clone) + cur.link = q.link = clone + } + break + } + last = cur + } + for (const state of this.container) + if (state.link) state.link.revLink.push(state) + } + + visit(path) { + for (const state of this.container) state.max = 0 + const root = this.container[0] + let p = root + let len = 0 + for (const x of path) { + for (; ; p = p.link, len = p.len) { + const q = p.next.get(x) + if (q) { + p = q + p.max = Math.max(p.max, ++len) + break + } + if (!p.link) break + } + } + dfs(root) + for (const state of this.container) + state.ans = Math.min(state.ans, state.max) + } + + longestCommonSubpath(paths) { + for (const path of paths) this.visit(path) + let ans = 0 + for (const state of this.container) ans = Math.max(ans, state.ans) + return ans + } +} From 4713a5e68fdd41ea2b44b8ab7da8d578da2fa667 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 10 Jul 2021 22:49:28 +0800 Subject: [PATCH 0166/2039] Update 1698-number-of-distinct-substrings-in-a-string.js --- ...mber-of-distinct-substrings-in-a-string.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1698-number-of-distinct-substrings-in-a-string.js b/1698-number-of-distinct-substrings-in-a-string.js index 595ec3f7..f67060eb 100644 --- a/1698-number-of-distinct-substrings-in-a-string.js +++ b/1698-number-of-distinct-substrings-in-a-string.js @@ -12,3 +12,31 @@ const countDistinct = function(s) { return set.size }; + +// another + +/** + * @param {string} s + * @return {number} + */ +const countDistinct = function (s, count = 0) { + const root = new Trie() + const N = s.length + for (let i = 0; i < N; i++) { + let node = root + for (let j = i; j < N; j++) { + const c = s[j] + if (!node.children.has(c)) { + node.children.set(c, new Trie()) + count++ + } + node = node.children.get(c) + } + } + return count +} +class Trie { + constructor() { + this.children = new Map() + } +} From 97937489616b84f398e36b13e2da70180f7d2925 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Jul 2021 13:39:41 +0800 Subject: [PATCH 0167/2039] Create 1929-concatenation-of-array.js --- 1929-concatenation-of-array.js | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 1929-concatenation-of-array.js diff --git a/1929-concatenation-of-array.js b/1929-concatenation-of-array.js new file mode 100644 index 00000000..58d03269 --- /dev/null +++ b/1929-concatenation-of-array.js @@ -0,0 +1,7 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const getConcatenation = function(nums) { + return nums.concat(nums) +}; From ea0451f4bf4d9dca10332bfcf540b036c05f26e2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Jul 2021 13:47:18 +0800 Subject: [PATCH 0168/2039] Create 1930-unique-length-3-palindromic-subsequences.js --- ...nique-length-3-palindromic-subsequences.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1930-unique-length-3-palindromic-subsequences.js diff --git a/1930-unique-length-3-palindromic-subsequences.js b/1930-unique-length-3-palindromic-subsequences.js new file mode 100644 index 00000000..e7365aa5 --- /dev/null +++ b/1930-unique-length-3-palindromic-subsequences.js @@ -0,0 +1,24 @@ +/** + * @param {string} s + * @return {number} + */ +const countPalindromicSubsequence = (s) => { + let res = 0; + for (let i = 0; i < 26; i++) { + for (let j = 0; j < 26; j++) { + let len = 0; + for (const c of s) { + if(len === 3) break + if (len == 0) { + if (c.charCodeAt() - 97 == i) len++; // first char + } else if (len == 1) { + if (c.charCodeAt() - 97 == j) len++; // second char + } else if (len == 2) { + if (c.charCodeAt() - 97 == i) len++; // third char + } + } + if (len == 3) res++; + } + } + return res; +}; From feae7bb96ef1925662cac6fa66abc02c6bb65733 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Jul 2021 14:16:25 +0800 Subject: [PATCH 0169/2039] Create 1931-painting-a-grid-with-three-different-colors.js --- ...ting-a-grid-with-three-different-colors.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 1931-painting-a-grid-with-three-different-colors.js diff --git a/1931-painting-a-grid-with-three-different-colors.js b/1931-painting-a-grid-with-three-different-colors.js new file mode 100644 index 00000000..f5d4e0bb --- /dev/null +++ b/1931-painting-a-grid-with-three-different-colors.js @@ -0,0 +1,51 @@ +/** + * @param {number} m + * @param {number} n + * @return {number} + */ +const colorTheGrid = function(m, n) { + // Get color of the `mask` at `pos`, 2 bit store 1 color + function getColor(mask, pos) { + return (mask >> (2 * pos)) & 3 + } + // Set `color` to the `mask` at `pos`, 2 bit store 1 color + function setColor(mask, pos, color) { + return mask | (color << (2 * pos)) + } + function dfs(r, curColMask, prevColMask, out) { + // Filled full color for a row + if(r === m) { + out.push(curColMask) + return + } + // Try colors i in [1=RED, 2=GREEN, 3=BLUE] + for(let i = 1; i <= 3; i++) { + if(getColor(prevColMask, r) !== i && (r === 0 || getColor(curColMask, r - 1) !== i)) { + dfs(r + 1, setColor(curColMask, r, i), prevColMask, out) + } + } + } + // Generate all possible columns we can draw, if the previous col is `prevColMask` + function neighbor(prevColMask) { + let out = [] + dfs(0, 0, prevColMask, out) + return out + } + const mod = 10 ** 9 + 7 + const memo = {} + function dp(c, prevColMask) { + // Found a valid way + if(c === n) return 1 + if(memo[`${c},${prevColMask}`] != null) return memo[`${c},${prevColMask}`] + let res = 0 + const arr = neighbor(prevColMask) + for(let e of arr) { + res = (res + dp(c + 1, e)) % mod + } + memo[`${c},${prevColMask}`] = res + return res + } + + return dp(0, 0) + +}; From bc34f30424794e40a7e1596c94aee37a6f5c1201 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Jul 2021 09:37:30 +0800 Subject: [PATCH 0170/2039] Update 792-number-of-matching-subsequences.js --- 792-number-of-matching-subsequences.js | 34 ++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/792-number-of-matching-subsequences.js b/792-number-of-matching-subsequences.js index d1ac1e88..bf440135 100644 --- a/792-number-of-matching-subsequences.js +++ b/792-number-of-matching-subsequences.js @@ -1,3 +1,36 @@ +/** + * @param {string} s + * @param {string[]} words + * @return {number} + */ +const numMatchingSubseq = function(s, words) { + const hash = {} + for(let w of words) { + if(hash[w[0]] == null) hash[w[0]] = [] + const it = w[Symbol.iterator]() + hash[w[0]].push( it ) + it.next() + } + let res = 0 + for(let ch of s) { + const advance = hash[ch] || [] + hash[ch] = [] + for(let it of advance) { + const obj = it.next() + if(obj.done === false) { + if(hash[obj.value] == null) hash[obj.value] = [] + hash[obj.value].push(it) + } else { + res++ + } + } + } + + return res +}; + +// another + /** * @param {string} S * @param {string[]} words @@ -20,3 +53,4 @@ const numMatchingSubseq = function(S, words) { } return res }; + From 0076ffaddd7bdf657bebb06be929c086a64e66c3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Jul 2021 10:29:18 +0800 Subject: [PATCH 0171/2039] Update 1930-unique-length-3-palindromic-subsequences.js --- ...nique-length-3-palindromic-subsequences.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1930-unique-length-3-palindromic-subsequences.js b/1930-unique-length-3-palindromic-subsequences.js index e7365aa5..d615b832 100644 --- a/1930-unique-length-3-palindromic-subsequences.js +++ b/1930-unique-length-3-palindromic-subsequences.js @@ -1,3 +1,32 @@ +/** + * @param {string} s + * @return {number} + */ +const countPalindromicSubsequence = function(s) { + const first = Array(26).fill(Infinity), last = Array(26).fill(0) + let res = 0 + const n = s.length, a = 'a'.charCodeAt(0) + for(let i = 0; i < n; i++) { + const code = s[i].charCodeAt(0) + first[code - a] = Math.min(i, first[code - a]) + last[code - a] = i + } + + for(let i = 0; i < 26; i++) { + if(last[i] - 1 > first[i]) { + const tmp = s.slice(first[i] + 1, last[i]) + const set = new Set() + for(let ch of tmp) set.add(ch) + res += set.size + } + } + + return res +}; + +// another + + /** * @param {string} s * @return {number} From 58a7fab23cfac781d161f47de7230089d3bcb1c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Jul 2021 20:17:45 +0800 Subject: [PATCH 0172/2039] Create 1055-shortest-way-to-form-string,js --- 1055-shortest-way-to-form-string,js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1055-shortest-way-to-form-string,js diff --git a/1055-shortest-way-to-form-string,js b/1055-shortest-way-to-form-string,js new file mode 100644 index 00000000..1628fb07 --- /dev/null +++ b/1055-shortest-way-to-form-string,js @@ -0,0 +1,26 @@ +/** + * @param {string} source + * @param {string} target + * @return {number} + */ +const shortestWay = function(source, target) { + const a = 'a'.charCodeAt(0), map = Array(26).fill(0) + for(let ch of source) { + map[ch.charCodeAt(0) - a] = 1 + } + let j = 0, res = 1 + for(let i = 0, n = target.length; i < n; i++, j++) { + const cur = target[i] + if(map[cur.charCodeAt(0) - a] === 0) return -1 + while(j < source.length && source[j] !== cur) { + j++ + } + if(j === source.length) { + res++ + j = -1 + i-- + } + } + + return res +}; From e4c370f67b5167732252a665d58b650d48731b25 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Jul 2021 11:35:36 +0800 Subject: [PATCH 0173/2039] Update 524-longest-word-in-dictionary-through-deleting.js --- ...est-word-in-dictionary-through-deleting.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/524-longest-word-in-dictionary-through-deleting.js b/524-longest-word-in-dictionary-through-deleting.js index 4e52aeaf..ee2326be 100644 --- a/524-longest-word-in-dictionary-through-deleting.js +++ b/524-longest-word-in-dictionary-through-deleting.js @@ -1,3 +1,31 @@ +/** + * @param {string} s + * @param {string[]} dictionary + * @return {string} + */ +const findLongestWord = function(s, dictionary) { + dictionary.sort((a, b) => a.length === b.length ? cmp(a, b) : b.length - a.length) + let res = '' + for(let d of dictionary) { + let j = 0 + for(let i = 0, n = s.length; i < n; i++) { + if(d[j] === s[i]) j++ + if(j === d.length) return d + } + } + return '' + function cmp(s1, s2) { + for(let i = 0, n = s1.length; i < n; i++) { + if(s1[i] < s2[i]) return -1 + else if(s1[i] > s2[i]) return 1 + } + return 0 + } +}; + +// another + + /** * @param {string} s * @param {string[]} d From 36979ae9c4e18592a8288da38451bca73fa86db9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Jul 2021 14:16:18 +0800 Subject: [PATCH 0174/2039] Update 524-longest-word-in-dictionary-through-deleting.js --- ...est-word-in-dictionary-through-deleting.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/524-longest-word-in-dictionary-through-deleting.js b/524-longest-word-in-dictionary-through-deleting.js index ee2326be..ffd815ae 100644 --- a/524-longest-word-in-dictionary-through-deleting.js +++ b/524-longest-word-in-dictionary-through-deleting.js @@ -1,3 +1,27 @@ +/** + * @param {string} s + * @param {string[]} dictionary + * @return {string} + */ +const findLongestWord = function(s, dictionary) { + let res = '' + for(let d of dictionary) { + let j = 0 + for(let i = 0, n = s.length; i < n; i++) { + if(d[j] === s[i]) j++ + if(j === d.length && j >= res.length) { + if(j > res.length || d < res) { + res = d + } + break + } + } + } + return res +}; + +// another + /** * @param {string} s * @param {string[]} dictionary From 2b3f204c2a6d43089f5d06d4cc602d96d9ebbe41 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Jul 2021 21:29:22 +0800 Subject: [PATCH 0175/2039] Create 788-rotated-digits.js --- 788-rotated-digits.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 788-rotated-digits.js diff --git a/788-rotated-digits.js b/788-rotated-digits.js new file mode 100644 index 00000000..6954f420 --- /dev/null +++ b/788-rotated-digits.js @@ -0,0 +1,25 @@ +/** + * @param {number} n + * @return {number} + */ +const rotatedDigits = function(n) { + const dp = new Array(n + 1).fill(0); + let count = 0; + for(let i = 0; i <= n; i++){ + if(i < 10){ + if(i == 0 || i == 1 || i == 8) dp[i] = 1; + else if(i == 2 || i == 5 || i == 6 || i == 9){ + dp[i] = 2; + count++; + } + } else { + let a = dp[~~(i / 10)], b = dp[i % 10]; + if(a == 1 && b == 1) dp[i] = 1; + else if(a >= 1 && b >= 1){ + dp[i] = 2; + count++; + } + } + } + return count; +}; From 8925502135874a65c872804a90acf9cc3c0c1c2c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Jul 2021 22:07:09 +0800 Subject: [PATCH 0176/2039] Create 1827-minimum-operations-to-make-the-array-increasing.js --- ...-operations-to-make-the-array-increasing.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1827-minimum-operations-to-make-the-array-increasing.js diff --git a/1827-minimum-operations-to-make-the-array-increasing.js b/1827-minimum-operations-to-make-the-array-increasing.js new file mode 100644 index 00000000..d5c31859 --- /dev/null +++ b/1827-minimum-operations-to-make-the-array-increasing.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minOperations = function(nums) { + let res = 0 + let pre = nums[0] + for(let i = 1, n = nums.length; i < n; i++) { + const e = nums[i] + if(e <= pre) { + res += pre - e + 1 + pre++ + } else { + pre = e + } + } + return res +}; From 85c9132cc783be5f55a9f6ef46ef8f7bee91c08d Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Jul 2021 22:13:41 +0800 Subject: [PATCH 0177/2039] Create 884-uncommon-words-from-two-sentences.js --- 884-uncommon-words-from-two-sentences.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 884-uncommon-words-from-two-sentences.js diff --git a/884-uncommon-words-from-two-sentences.js b/884-uncommon-words-from-two-sentences.js new file mode 100644 index 00000000..73b4f0f2 --- /dev/null +++ b/884-uncommon-words-from-two-sentences.js @@ -0,0 +1,23 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {string[]} + */ +const uncommonFromSentences = function(s1, s2) { + const hash = {} + const a1 = s1.split(' '), a2 = s2.split(' ') + for(let e of a1) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const res = [] + for(let e of a2) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + Object.keys(hash).forEach(k => { + if(hash[k] === 1) res.push(k) + }) + + return res +}; From 3fbb72cc90ff097156d899e71598665d2ecfc545 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Jul 2021 21:53:41 +0800 Subject: [PATCH 0178/2039] Update 727-minimum-window-subsequence.js --- 727-minimum-window-subsequence.js | 40 +++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/727-minimum-window-subsequence.js b/727-minimum-window-subsequence.js index 54599fdb..c75b04cc 100644 --- a/727-minimum-window-subsequence.js +++ b/727-minimum-window-subsequence.js @@ -1,3 +1,43 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {string} + */ +const minWindow = function(s1, s2) { + let res = '', n = s1.length, m = s2.length + if(s1 === '' || s2 === '') return res + let minLen = Infinity + let right = 0 + while(right < n) { + let tIndex = 0 + while(right < n) { + if(s1[right] === s2[tIndex]) tIndex++ + if(tIndex === m) break + right++ + } + if(right === n) break + let left = right + tIndex = m - 1 + while(left >= 0) { + if(s1[left] === s2[tIndex]) { + tIndex-- + } + if(tIndex < 0) break + left-- + } + + if(right - left + 1 < minLen) { + minLen = right - left + 1 + res = s1.slice(left, right + 1) + } + right = left + 1 + } + + return res +}; + +// another + /** * @param {string} S * @param {string} T From 482ce325773fb19cdc8a9fb6ed30854ddbdb9b69 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 15 Jul 2021 21:03:49 +0800 Subject: [PATCH 0179/2039] Create 1928-minimum-cost-to-reach-destination-in-time.js --- ...nimum-cost-to-reach-destination-in-time.js | 105 ++++++++++++++++++ 1 file changed, 105 insertions(+) create mode 100644 1928-minimum-cost-to-reach-destination-in-time.js diff --git a/1928-minimum-cost-to-reach-destination-in-time.js b/1928-minimum-cost-to-reach-destination-in-time.js new file mode 100644 index 00000000..db1a7339 --- /dev/null +++ b/1928-minimum-cost-to-reach-destination-in-time.js @@ -0,0 +1,105 @@ +/** + * @param {number} maxTime + * @param {number[][]} edges + * @param {number[]} passingFees + * @return {number} + */ +const minCost = function(maxTime, edges, passingFees) { + const n = passingFees.length + const pq = new PriorityQueue((a, b) => a[0] < b[0]) + const graph = {} + for(let [s, e, t] of edges) { + if(graph[s] == null) graph[s] = [] + if(graph[e] == null) graph[e] = [] + graph[s].push([e, t]) + graph[e].push([s, t]) + } + + const times = {} + + pq.push([passingFees[0], 0, 0]) + while(!pq.isEmpty()) { + const [cost, node, time] = pq.pop() + + if(time > maxTime) continue + if(node === n - 1) return cost + + if(times[node] == null || times[node] > time) { + times[node] = time + for(let [nxt, ext] of graph[node]) { + pq.push([cost + passingFees[nxt], nxt, time + ext]) + } + } + + } + + return -1 +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 020e1611e5fc883086e80af8e2611ea656179eb3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Jul 2021 17:05:13 +0800 Subject: [PATCH 0180/2039] Update 1931-painting-a-grid-with-three-different-colors.js --- ...ting-a-grid-with-three-different-colors.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/1931-painting-a-grid-with-three-different-colors.js b/1931-painting-a-grid-with-three-different-colors.js index f5d4e0bb..1433b0e4 100644 --- a/1931-painting-a-grid-with-three-different-colors.js +++ b/1931-painting-a-grid-with-three-different-colors.js @@ -49,3 +49,54 @@ const colorTheGrid = function(m, n) { return dp(0, 0) }; + +// another + +/** + * @param {number} m + * @param {number} n + * @return {number} + */ +const colorTheGrid = function(m, n) { + const mod = 10 ** 9 + 7 + const colors = [1, 2, 3] + const memoDp = {}, memoOpts = {} + function getColor(pos, preMask) { + return (preMask >> (pos * 2)) & 3 + } + function setColor(pos, color, curMask) { + return curMask | (color << (pos * 2)) + } + function dfs(pos, curMask, preMask, res) { + if(pos === m) { + res.push(curMask) + return + } + for(let c of colors) { + if(getColor(pos, preMask) !== c && (pos === 0 || getColor(pos - 1, curMask) !== c)) { + dfs(pos + 1, setColor(pos, c, curMask), preMask, res) + } + } + } + function curOpts(preMask) { + if (memoOpts[preMask]) return memoOpts[preMask] + const res = [] + dfs(0, 0, preMask, res) + memoOpts[preMask] = res + return res + } + function dp(col, preMask) { + const k = `${col},${preMask}` + if(col === n) return 1 + if(memoDp[k]) return memoDp[k] + let res = 0 + const cur = curOpts(preMask) + for(let mask of cur) { + res = (res + dp(col + 1, mask)) % mod + } + memoDp[k] = res + return res + } + + return dp(0, 0) +}; From 71d7f23f3abbd2c1c8c2fc4da70ff6a1d8fbd8d8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Jul 2021 20:32:52 +0800 Subject: [PATCH 0181/2039] Create 1207-unique-number-of-occurrences.js --- 1207-unique-number-of-occurrences.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1207-unique-number-of-occurrences.js diff --git a/1207-unique-number-of-occurrences.js b/1207-unique-number-of-occurrences.js new file mode 100644 index 00000000..d1621449 --- /dev/null +++ b/1207-unique-number-of-occurrences.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} arr + * @return {boolean} + */ +const uniqueOccurrences = function(arr) { + const hash = {} + for(let e of arr) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const ks = new Set(Object.keys(hash)), vs = new Set(Object.values(hash)) + return ks.size === vs.size +}; From b57dda7b727cb4945a79942e71fa2517134c7adf Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Jul 2021 21:52:12 +0800 Subject: [PATCH 0182/2039] Create 800-similar-rgb-color.js --- 800-similar-rgb-color.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 800-similar-rgb-color.js diff --git a/800-similar-rgb-color.js b/800-similar-rgb-color.js new file mode 100644 index 00000000..1b7974a8 --- /dev/null +++ b/800-similar-rgb-color.js @@ -0,0 +1,22 @@ +/** + * @param {string} color + * @return {string} + */ +const similarRGB = function(color) { + const candidates = ['00', '11', '22', '33', '44', '55', '66', '77', '88', '99', 'aa', 'bb', 'cc', 'dd', 'ee', 'ff'] + const r = color.slice(1, 3), g = color.slice(3, 5), b = color.slice(5, 7) + + return `#${min(r)}${min(g)}${min(b)}` + + function min(str) { + let res = '', max = Infinity + for(let s of candidates) { + const tmp = Math.abs(parseInt(s, 16) - parseInt(str, 16)) + if(tmp < max) { + max = tmp + res = s + } + } + return res + } +}; From 94a31a36422426ee40219a1b86047cb6170f35da Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Jul 2021 22:59:03 +0800 Subject: [PATCH 0183/2039] Create 824-goat-latin.js --- 824-goat-latin.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 824-goat-latin.js diff --git a/824-goat-latin.js b/824-goat-latin.js new file mode 100644 index 00000000..da271e6c --- /dev/null +++ b/824-goat-latin.js @@ -0,0 +1,16 @@ +/** + * @param {string} sentence + * @return {string} + */ +const toGoatLatin = function(sentence) { + const arr = sentence.split(' ') + const vowel = new Set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']) + for(let i = 0, n = arr.length; i < n; i++) { + const first = arr[i][0] + const ma = vowel.has(first) ? 'ma' : '' + const tmp = !vowel.has(first) ? `${arr[i].slice(1)}${first}ma` : arr[i] + const suffix = 'a'.repeat(i + 1) + arr[i] = `${tmp}${ma}${suffix}` + } + return arr.join(' ') +}; From 20127efbbcb75874b336e47861f4dff06348a27c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Jul 2021 23:15:48 +0800 Subject: [PATCH 0184/2039] Create 1214-two-sum-bsts.js --- 1214-two-sum-bsts.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1214-two-sum-bsts.js diff --git a/1214-two-sum-bsts.js b/1214-two-sum-bsts.js new file mode 100644 index 00000000..7b83717c --- /dev/null +++ b/1214-two-sum-bsts.js @@ -0,0 +1,25 @@ +/** + * 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} root1 + * @param {TreeNode} root2 + * @param {number} target + * @return {boolean} + */ +const twoSumBSTs = function(root1, root2, target) { + if(root1 == null && root2 == null) return false + if(root2 == null) return root1.val === target + if(root1 == null) return root2.val === target + if(root1.val + root2.val === target) return true + if(root1.val + root2.val < target) { + return twoSumBSTs(root1.right, root2, target) || twoSumBSTs(root1, root2.right, target) + } else { + return twoSumBSTs(root1.left, root2, target) || twoSumBSTs(root1, root2.left, target) + } +}; From 2255c916c2a089d0d37e1a22a757a7e017ab88b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 17 Jul 2021 11:33:00 +0800 Subject: [PATCH 0185/2039] Update 1214-two-sum-bsts.js --- 1214-two-sum-bsts.js | 43 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1214-two-sum-bsts.js b/1214-two-sum-bsts.js index 7b83717c..fb363a05 100644 --- a/1214-two-sum-bsts.js +++ b/1214-two-sum-bsts.js @@ -23,3 +23,46 @@ const twoSumBSTs = function(root1, root2, target) { return twoSumBSTs(root1.left, root2, target) || twoSumBSTs(root1, root2.left, target) } }; + +// another + +/** + * 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} root1 + * @param {TreeNode} root2 + * @param {number} target + * @return {boolean} + */ +const twoSumBSTs = function(root1, root2, target) { + if(root1 == null || root2 == null) return false + const s1 = [], s2 = [] + while(true) { + while(root1) { + s1.push(root1) + root1 = root1.left + } + while(root2) { + s2.push(root2) + root2 = root2.right + } + if(s1.length === 0 || s2.length === 0) return false + const t1 = s1[s1.length - 1], t2 = s2[s2.length - 1] + if(t1.val + t2.val === target) return true + if(t1.val + t2.val < target) { + root1 = t1.right + s1.pop() + } else { + root2 = t2.left + s2.pop() + } + + } + return false +}; From e69d6160ae9f7e0a8c4d2866c7608bf66e036793 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 17 Jul 2021 21:13:40 +0800 Subject: [PATCH 0186/2039] Create 1932-merge-bsts-to-create-single-bst.js --- 1932-merge-bsts-to-create-single-bst.js | 86 +++++++++++++++++++++++++ 1 file changed, 86 insertions(+) create mode 100644 1932-merge-bsts-to-create-single-bst.js diff --git a/1932-merge-bsts-to-create-single-bst.js b/1932-merge-bsts-to-create-single-bst.js new file mode 100644 index 00000000..9a3040db --- /dev/null +++ b/1932-merge-bsts-to-create-single-bst.js @@ -0,0 +1,86 @@ +/** + * 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[]} trees + * @return {TreeNode} + */ +const canMerge = function (trees) { + const mapRoots = {} + const mapLeaves = {} + let prev + + //check all trees and hashMap all available roots and leaves + for (let node of trees) { + mapRoots[node.val] = node + if (node.left != null) { + if (mapLeaves[node.left.val] != null) + //different nodes can't refer to the same node -> abnormal BST + return null + mapLeaves[node.left.val] = node.left + } + if (node.right != null) { + if (mapLeaves[node.right.val] != null) + //different nodes can't refer to the same node -> abnormal BST + return null + mapLeaves[node.right.val] = node.right + } + } + + let rootRes = null + let count = trees.length + + //find potential root-result of the merged entire tree + //that is node without any references from the parent leaf nodes + for (let node of trees) { + if (mapLeaves[node.val] == null) { + rootRes = node + break + } + } + + //if there are no nodes like that -> abnormal BST + if (rootRes == null) return rootRes + + const q = [] + + //put root-result leaves into queue + if (rootRes.left != null) q.push(rootRes.left) + if (rootRes.right != null) q.push(rootRes.right) + count-- + + while (q.length) { + //get leaf from the queue and check if there is correponding available root + let leaf = q.pop() + let root = mapRoots[leaf.val] + if (root != null) { + //there is root matched to leaf, so let's merge it + count-- + leaf.left = root.left + leaf.right = root.right + //add new leaves into the queue + if (root.left != null) q.push(root.left) + if (root.right != null) q.push(root.right) + } + } + + prev = 0 + //if we have merged all inputed trees and that is valid BST by values, then return rootRes + return count == 0 && recSanity(rootRes) ? rootRes : null + + function recSanity(node) { + if (node == null) return true + + if (!recSanity(node.left)) return false + + if (prev >= node.val) return false + prev = node.val + + return recSanity(node.right) + } +} From 963a280c6ad8d1d532be8ef67d205a7780ffda55 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Jul 2021 20:38:50 +0800 Subject: [PATCH 0187/2039] Create 1935-maximum-number-of-words-you-can-type.js --- 1935-maximum-number-of-words-you-can-type.js | 22 ++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1935-maximum-number-of-words-you-can-type.js diff --git a/1935-maximum-number-of-words-you-can-type.js b/1935-maximum-number-of-words-you-can-type.js new file mode 100644 index 00000000..ccbd27c8 --- /dev/null +++ b/1935-maximum-number-of-words-you-can-type.js @@ -0,0 +1,22 @@ +/** + * @param {string} text + * @param {string} brokenLetters + * @return {number} + */ +const canBeTypedWords = function(text, brokenLetters) { + const set = new Set(brokenLetters.split('')) + const arr = text.split(' ') + let res = 0 + for(let e of arr) { + let ok = true + for(let c of e) { + if(set.has(c)) { + ok = false + break + } + } + if(ok) res++ + } + + return res +}; From e9f2b6f7596a3899bc2139f2024843fae5369304 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Jul 2021 20:39:26 +0800 Subject: [PATCH 0188/2039] Create 1936-add-minimum-number-of-rungs.js --- 1936-add-minimum-number-of-rungs.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1936-add-minimum-number-of-rungs.js diff --git a/1936-add-minimum-number-of-rungs.js b/1936-add-minimum-number-of-rungs.js new file mode 100644 index 00000000..07eb14bc --- /dev/null +++ b/1936-add-minimum-number-of-rungs.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} rungs + * @param {number} dist + * @return {number} + */ +const addRungs = function(rungs, dist) { + let res = 0 + let pre = 0 + const { floor, ceil } = Math + for(let r of rungs) { + if(r - pre > dist) { + // console.log(r, pre) + res += ceil((r - pre) / dist) - 1 + } + pre = r + } + return res +}; From 6fab7f50b2d044e2b3091e6cf571934089926e71 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Jul 2021 20:40:09 +0800 Subject: [PATCH 0189/2039] Create 1937-maximum-number-of-points-with-cost.js --- 1937-maximum-number-of-points-with-cost.js | 38 ++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 1937-maximum-number-of-points-with-cost.js diff --git a/1937-maximum-number-of-points-with-cost.js b/1937-maximum-number-of-points-with-cost.js new file mode 100644 index 00000000..90cd8ab2 --- /dev/null +++ b/1937-maximum-number-of-points-with-cost.js @@ -0,0 +1,38 @@ +/** + * @param {number[][]} points + * @return {number} + */ +const maxPoints = function(points) { + let m = points.length, n = points[0].length; + let result = 0; + // dp + const dp = Array.from({ length: m }, () => Array(n).fill(0)); + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (i == 0) { + dp[i][j] = points[i][j]; + } else { + dp[i][j] = Math.max(points[i][j] + dp[i - 1][j], dp[i][j]); + } + } + for (let j = 0; j < n; j++) { + // right + for (let k = 1; k < n - j; k++) { + if (dp[i][j + k] >= dp[i][j] - k) { + break; + } + dp[i][j + k] = dp[i][j] - k; + } + for (let k = 1; k <= j; k++) { + if (dp[i][j - k] >= dp[i][j] - k) { + break; + } + dp[i][j - k] = dp[i][j] - k; + } + } + } + for (let j = 0; j < n; j++) { + result = Math.max(result, dp[m - 1][j]); + } + return result; +}; From a81ac651d12303773009f36997d7a8fa625541f6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Jul 2021 13:50:47 +0800 Subject: [PATCH 0190/2039] Update 1937-maximum-number-of-points-with-cost.js --- 1937-maximum-number-of-points-with-cost.js | 33 ++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/1937-maximum-number-of-points-with-cost.js b/1937-maximum-number-of-points-with-cost.js index 90cd8ab2..83e5caf7 100644 --- a/1937-maximum-number-of-points-with-cost.js +++ b/1937-maximum-number-of-points-with-cost.js @@ -1,3 +1,36 @@ +/** + * @param {number[][]} points + * @return {number} + */ +const maxPoints = function(points) { + const m = points.length, n = points[0].length + let prev = points[0].slice() + for(let i = 1; i < m; i++) { + const left = [] + left[0] = prev[0] + // left to right + for(let j = 1; j < n; j++) { + left[j] = Math.max(prev[j], left[j - 1] - 1) + } + const right = [] + right[n - 1] = prev[n - 1] + // right to left + for(let j = n - 2; j >= 0; j--) { + right[j] = Math.max(prev[j], right[j + 1] - 1) + } + + const cur = [] + for(let j = 0; j < n; j++) { + cur[j] = Math.max(left[j], right[j]) + points[i][j] + } + prev = cur + } + + return Math.max(...prev) +}; + +// another + /** * @param {number[][]} points * @return {number} From f4bb182f4069a55e214b8802f71b6276250ce0ab Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Jul 2021 16:29:21 +0800 Subject: [PATCH 0191/2039] Update 994-rotting-oranges.js --- 994-rotting-oranges.js | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/994-rotting-oranges.js b/994-rotting-oranges.js index e78c1ca8..2fa9a406 100644 --- a/994-rotting-oranges.js +++ b/994-rotting-oranges.js @@ -1,3 +1,42 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const orangesRotting = function(grid) { + const m = grid.length, n = grid[0].length + const dirs = [[-1, 0], [1, 0], [0, -1], [0, 1]] + const visited = new Set() + let q = [] + let num = 0 + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] === 2) q.push([i, j]), visited.add(`${i},${j}`) + if(grid[i][j] !== 0) num++ + } + } + let res = 0 + while(q.length) { + const size = q.length + const tmp = [] + for(let i = 0; i < size; i++) { + const [x, y] = q[i] + for(let [dx, dy] of dirs) { + const nx = x + dx, ny = y + dy + if(nx >= 0 && nx < m && ny >= 0 && ny < n && grid[nx][ny] === 1 && !visited.has(`${nx},${ny}`)) { + tmp.push([nx, ny]) + visited.add(`${nx},${ny}`) + } + } + } + q = tmp + if(q.length) res++ + } + return visited.size === num ? res : -1 +}; + +// another + + /** * @param {number[][]} grid * @return {number} From 907efbb7dc4c088415ac3f2e64363c1488abbb3a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Jul 2021 19:57:59 +0800 Subject: [PATCH 0192/2039] Update 795-number-of-subarrays-with-bounded-maximum.js --- ...umber-of-subarrays-with-bounded-maximum.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/795-number-of-subarrays-with-bounded-maximum.js b/795-number-of-subarrays-with-bounded-maximum.js index 3ade7405..beb84f9d 100644 --- a/795-number-of-subarrays-with-bounded-maximum.js +++ b/795-number-of-subarrays-with-bounded-maximum.js @@ -21,3 +21,27 @@ const numSubarrayBoundedMax = function(A, L, R) { } return res }; + +// another + +/** + * @param {number[]} nums + * @param {number} left + * @param {number} right + * @return {number} + */ +const numSubarrayBoundedMax = function(nums, left, right) { + let prev = -1, dp = 0, res = 0 + for(let i = 0, n = nums.length; i < n; i++) { + const cur = nums[i] + if(cur < left) res += dp + else if(cur > right) { + dp = 0 + prev = i + } else { + dp = i - prev + res += dp + } + } + return res +}; From a55f0fa13d51d4c02f10898b5cf979f79091ffb5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Jul 2021 08:31:27 +0800 Subject: [PATCH 0193/2039] Update 46-permutations.js --- 46-permutations.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/46-permutations.js b/46-permutations.js index 2a3486a0..82faf2f7 100755 --- a/46-permutations.js +++ b/46-permutations.js @@ -21,3 +21,28 @@ function backtrack(list, tempList, nums) { } } } + +// another + +/** + * @param {number[]} nums + * @return {number[][]} + */ +const permute = function(nums) { + const res = [] + bt(nums, 0, [], res) + return res +}; + +function bt(nums, idx, cur, res) { + if(idx === nums.length) { + res.push(cur.slice()) + return + } + for(let i = 0; i < nums.length; i++) { + if(cur.indexOf(nums[i]) !== -1) continue + cur.push(nums[i]) + bt(nums, idx + 1, cur, res) + cur.pop() + } +} From aef824c507eb985d6bc1e9cd504b5fbba266214e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Jul 2021 19:26:02 +0800 Subject: [PATCH 0194/2039] Create 1714-sum-of-special-evenly-spaced-elements-in-array.js --- ...special-evenly-spaced-elements-in-array.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 1714-sum-of-special-evenly-spaced-elements-in-array.js diff --git a/1714-sum-of-special-evenly-spaced-elements-in-array.js b/1714-sum-of-special-evenly-spaced-elements-in-array.js new file mode 100644 index 00000000..0d60e731 --- /dev/null +++ b/1714-sum-of-special-evenly-spaced-elements-in-array.js @@ -0,0 +1,48 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +const solve = function (nums, queries) { + const n = nums.length + const dividingPoint = Math.floor(Math.sqrt(n)) + const mod = 1e9 + 7 + const prefix = new Map() + + const res = new Array(queries.length) + for (let i = 0; i < queries.length; i++) { + let x = queries[i][0], + y = queries[i][1] + if (y > dividingPoint) { + let sm = 0 + while (x < n) { + sm += nums[x] + sm %= mod + x += y + } + res[i] = sm + } else { + let startingPoint = x % y + if (!prefix.has(y)) { + prefix.set(y, new Map()) + } + if (!prefix.get(y).has(startingPoint)) { + const curPrefix = [] + curPrefix.push(0) + let cur = startingPoint, + sm = 0 + while (cur < n) { + sm += nums[cur] + sm %= mod + curPrefix.push(sm) + cur += y + } + prefix.get(y).set(startingPoint, curPrefix) + } + const curPrefix = prefix.get(y).get(startingPoint) + res[i] = + (curPrefix[curPrefix.length - 1] - curPrefix[~~(x / y)] + mod) % mod + } + } + return res +} From ee9db09e3737d81849fb66db363722701f2edbc9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Jul 2021 22:17:52 +0800 Subject: [PATCH 0195/2039] Create 883-projection-area-of-3d-shapes.js --- 883-projection-area-of-3d-shapes.js | 30 +++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 883-projection-area-of-3d-shapes.js diff --git a/883-projection-area-of-3d-shapes.js b/883-projection-area-of-3d-shapes.js new file mode 100644 index 00000000..f4a914fc --- /dev/null +++ b/883-projection-area-of-3d-shapes.js @@ -0,0 +1,30 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const projectionArea = function(grid) { + let xy = 0, xz = 0, yz = 0 + const m = grid.length, n = grid[0].length + for (let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j]) xy++ + } + } + + for (let i = 0; i < m; i++) { + let tmp = 0 + for(let j = 0; j < n; j++) { + tmp = Math.max(tmp, grid[i][j]) + } + xz += tmp + } + for (let j = 0; j < n; j++) { + let tmp = 0 + for(let i = 0; i < m; i++) { + tmp = Math.max(tmp, grid[i][j]) + } + yz += tmp + } + + return xy + yz + xz +}; From 4f5ebfe03c18f1606661e33913777a093dfab61e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Jul 2021 10:40:03 +0800 Subject: [PATCH 0196/2039] Update 1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js --- ...ters-to-satisfy-one-of-three-conditions.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js index 3b29d69d..33672db3 100644 --- a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js +++ b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js @@ -28,3 +28,39 @@ const minCharacters = function (a, b) { } return res } + +// another + +/** + * @param {string} a + * @param {string} b + * @return {number} + */ +const minCharacters = function(a, b) { + return Math.min(method1(a, b), method1(b, a), method3(a, b)) +}; + +function method1(str1, str2) { + let res = Infinity, a = 'a'.charCodeAt(0) + for(let i = 1; i < 26; i++) { + let cnt1 = 0, cnt2 = 0, mid = String.fromCharCode(a + i) + for(let ch of str1) { + if(ch >= mid) cnt1++ + } + for(let ch of str2) { + if(ch < mid) cnt2++ + } + res = Math.min(res, cnt1 + cnt2) + } + return res +} + +function method3(str1, str2) { + const a = 'a'.charCodeAt(0) + const cnt1 = Array(26).fill(0), cnt2 = Array(26).fill(0) + for(let ch of str1) cnt1[ch.charCodeAt(0) - a]++ + for(let ch of str2) cnt2[ch.charCodeAt(0) - a]++ + let res = 0 + for(let i = 0; i < 26; i++) res = Math.max(res, cnt1[i] + cnt2[i]) + return str1.length + str2.length - res +} From 810ab27bde81dbe302bfa374031b437461b17e0b Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Jul 2021 10:43:41 +0800 Subject: [PATCH 0197/2039] Update 1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js --- ...-minimum-characters-to-satisfy-one-of-three-conditions.js | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js index 33672db3..8a9118f7 100644 --- a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js +++ b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js @@ -60,7 +60,6 @@ function method3(str1, str2) { const cnt1 = Array(26).fill(0), cnt2 = Array(26).fill(0) for(let ch of str1) cnt1[ch.charCodeAt(0) - a]++ for(let ch of str2) cnt2[ch.charCodeAt(0) - a]++ - let res = 0 - for(let i = 0; i < 26; i++) res = Math.max(res, cnt1[i] + cnt2[i]) - return str1.length + str2.length - res + return str1.length + str2.length - Math.max(...cnt1) - Math.max(...cnt2) } + From ae8f26b97b2d78ce8a492ce2e820f08abfe0617e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Jul 2021 19:25:44 +0800 Subject: [PATCH 0198/2039] Update 1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js --- ...ters-to-satisfy-one-of-three-conditions.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js index 8a9118f7..aa948052 100644 --- a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js +++ b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js @@ -63,3 +63,34 @@ function method3(str1, str2) { return str1.length + str2.length - Math.max(...cnt1) - Math.max(...cnt2) } +// another + +/** + * @param {string} a + * @param {string} b + * @return {number} + */ +const minCharacters = function (a, b) { + const m = a.length, n = b.length + let res = m + n + const cnt1 = Array(26).fill(0), cnt2 = Array(26).fill(0) + const ac = 'a'.charCodeAt(0) + for(let ch of a) cnt1[ch.charCodeAt(0) - ac]++ + for(let ch of b) cnt2[ch.charCodeAt(0) - ac]++ + const c3 = res - Math.max(...cnt1) - Math.max(...cnt2) + for(let i = 0; i < 26; i++) { + if(i > 0) { + cnt1[i] += cnt1[i - 1] + cnt2[i] += cnt2[i - 1] + } + + if(i < 25) { + res = Math.min(res, m - cnt1[i] + cnt2[i]) + res = Math.min(res, n - cnt2[i] + cnt1[i]) + } + } + + return Math.min(res, c3) +} + + From 02f63a785f89ba5c485bebc2262d8df3b286470f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Jul 2021 20:47:53 +0800 Subject: [PATCH 0199/2039] Create 892-surface-area-of-3d-shapes.js --- 892-surface-area-of-3d-shapes.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 892-surface-area-of-3d-shapes.js diff --git a/892-surface-area-of-3d-shapes.js b/892-surface-area-of-3d-shapes.js new file mode 100644 index 00000000..fca60f28 --- /dev/null +++ b/892-surface-area-of-3d-shapes.js @@ -0,0 +1,27 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const surfaceArea = function(grid) { + if(grid == null || grid.length === 0) return 0 + const m = grid.length, n = grid[0].length + let res = 0, adj = 0 + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + const h = grid[i][j] + if(h) res += h * 4 + 2 + if(j > 0) { + if(grid[i][j - 1]) adj += Math.min(h, grid[i][j - 1]) + } + if(i > 0) { + if(grid[i - 1][j]) adj += Math.min(h, grid[i - 1][j]) + } + // console.log(adj) + } + } + + return res - adj * 2 +}; + +// 2 * 4 + 2 +// 6 + 10 + 14 + 18 - (1 + 2 + 3 + 1) * 2 From eb274fe276fba0aa42b19631b3c3a6467be095bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 14:14:26 +0800 Subject: [PATCH 0200/2039] Create 897-increasing-order-search-tree.js --- 897-increasing-order-search-tree.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 897-increasing-order-search-tree.js diff --git a/897-increasing-order-search-tree.js b/897-increasing-order-search-tree.js new file mode 100644 index 00000000..afa41b35 --- /dev/null +++ b/897-increasing-order-search-tree.js @@ -0,0 +1,23 @@ +/** + * 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 {TreeNode} + */ +const increasingBST = function(root) { + return helper(root, null) +}; + +function helper(node, tail) { + if(node == null) return tail + const res = helper(node.left, node) + node.left = null + node.right = helper(node.right, tail) + return res +} From 2e67ffa6dfc49b4647328e621afc480fc0909859 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 15:55:00 +0800 Subject: [PATCH 0201/2039] Create 888-fair-candy-swap.js --- 888-fair-candy-swap.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 888-fair-candy-swap.js diff --git a/888-fair-candy-swap.js b/888-fair-candy-swap.js new file mode 100644 index 00000000..8764adaa --- /dev/null +++ b/888-fair-candy-swap.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} aliceSizes + * @param {number[]} bobSizes + * @return {number[]} + */ +const fairCandySwap = function(aliceSizes, bobSizes) { + let sum = 0 + for(let e of aliceSizes) sum += e + for(let e of bobSizes) sum -= e + // sum > 0, alice > bob + // sum < 0, alice < bob + sum /= 2 + const set = new Set() + for(let e of aliceSizes) set.add(e) + for(let e of bobSizes) { + if(set.has(e + sum)) return [e + sum, e] + } + return [0] +}; From 3c32c5726bd48cf4292ed22350f8b9d5e6768876 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 16:03:09 +0800 Subject: [PATCH 0202/2039] Create 896-monotonic-array.js --- 896-monotonic-array.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 896-monotonic-array.js diff --git a/896-monotonic-array.js b/896-monotonic-array.js new file mode 100644 index 00000000..8850288d --- /dev/null +++ b/896-monotonic-array.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +const isMonotonic = function(nums) { + return inc(nums) || dec(nums) +}; + +function inc(nums) { + if(nums == null || nums.length <= 1) return true + for(let i = 1, n = nums.length; i < n; i++) { + if(nums[i] < nums[i - 1]) return false + } + return true +} +function dec(nums) { + if(nums == null || nums.length <= 1) return true + for(let i = 1, n = nums.length; i < n; i++) { + if(nums[i] > nums[i - 1]) return false + } + return true +} From d2766b511d1344f5d298f7469fe72dc63e62ed4b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 16:08:45 +0800 Subject: [PATCH 0203/2039] Update 896-monotonic-array.js --- 896-monotonic-array.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/896-monotonic-array.js b/896-monotonic-array.js index 8850288d..03a547f6 100644 --- a/896-monotonic-array.js +++ b/896-monotonic-array.js @@ -20,3 +20,18 @@ function dec(nums) { } return true } + +// another + +/** + * @param {number[]} nums + * @return {boolean} + */ +const isMonotonic = function(nums) { + let inc = true, dec = true + for(let i = 1, n = nums.length; i < n; i++) { + inc &= nums[i] >= nums[i - 1] + dec &= nums[i] <= nums[i - 1] + } + return inc || dec +}; From 242261da9b804b6e53c4c38d69974d15a50bdba0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 17:42:21 +0800 Subject: [PATCH 0204/2039] Create 908-smallest-range-i.js --- 908-smallest-range-i.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 908-smallest-range-i.js diff --git a/908-smallest-range-i.js b/908-smallest-range-i.js new file mode 100644 index 00000000..8139e659 --- /dev/null +++ b/908-smallest-range-i.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const smallestRangeI = function(nums, k) { + let min = Infinity, max = -Infinity + for(let e of nums) { + min = Math.min(min, e) + max = Math.max(max, e) + } + return max - k >= min + k ? max - k - (min + k) : 0 +}; From 2b854316abf745d4e44510ea62b0a4b3f79a470f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 20:05:46 +0800 Subject: [PATCH 0205/2039] Create 914-x-of-a-kind-in-a-deck-of-cards.js --- 914-x-of-a-kind-in-a-deck-of-cards.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 914-x-of-a-kind-in-a-deck-of-cards.js diff --git a/914-x-of-a-kind-in-a-deck-of-cards.js b/914-x-of-a-kind-in-a-deck-of-cards.js new file mode 100644 index 00000000..04754e03 --- /dev/null +++ b/914-x-of-a-kind-in-a-deck-of-cards.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} deck + * @return {boolean} + */ +const hasGroupsSizeX = function(deck) { + if(deck == null || deck.length <= 1) return false + const hash = {} + for(let e of deck) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + let res = 0 + for(let k in hash) res = gcd(hash[k], res) + return res > 1 +}; + +function gcd(a, b) { + return b ? gcd(b, a % b) : a +} From 6d65568f03bf9e51932c3d8141d2c376aabf59b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 21:38:46 +0800 Subject: [PATCH 0206/2039] Create 1142-user-activity-for-the-past-30-days-ii.sql --- 1142-user-activity-for-the-past-30-days-ii.sql | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 1142-user-activity-for-the-past-30-days-ii.sql diff --git a/1142-user-activity-for-the-past-30-days-ii.sql b/1142-user-activity-for-the-past-30-days-ii.sql new file mode 100644 index 00000000..d2b3aad1 --- /dev/null +++ b/1142-user-activity-for-the-past-30-days-ii.sql @@ -0,0 +1,5 @@ +# Write your MySQL query statement below +SELECT ifnull(ROUND(COUNT(DISTINCT session_id)/COUNT(DISTINCT user_id), 2),0.00) +AS average_sessions_per_user +FROM Activity +WHERE activity_date >= '2019-06-28' and activity_date <= '2019-07-27'; From 62c3958c684017107ec4bfc1aadcfca8cc0c7e33 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 21:57:41 +0800 Subject: [PATCH 0207/2039] Create 874-walking-robot-simulation.js --- 874-walking-robot-simulation.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 874-walking-robot-simulation.js diff --git a/874-walking-robot-simulation.js b/874-walking-robot-simulation.js new file mode 100644 index 00000000..546f5da6 --- /dev/null +++ b/874-walking-robot-simulation.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} commands + * @param {number[][]} obstacles + * @return {number} + */ +const robotSim = function(commands, obstacles) { + const dirs = [[1, 0], [0, -1], [-1, 0], [0, 1]] // east, south, west, north + const set = new Set() + obstacles.forEach(([x, y]) => set.add(`${x},${y}`)) + let idx = 3, x = 0, y = 0, res = 0 + for(let e of commands) { + if(e === -2) idx = (3 + idx) % 4 + else if(e === -1) idx = (1 + idx) % 4 + else { + const [dx, dy] = dirs[idx] + let dis = 0 + while(dis < e) { + const nx = x + dx, ny = y + dy + const k = `${nx},${ny}` + if(set.has(k)) break + x = nx + y = ny + dis++ + res = Math.max(res, x * x + y * y) + } + } + } + + return res +}; From 7da1019c85520b3b9319e3c72fea7311bc309bb9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Jul 2021 22:08:39 +0800 Subject: [PATCH 0208/2039] Create 1304-find-n-unique-integers-sum-up-to-zero.js --- 1304-find-n-unique-integers-sum-up-to-zero.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1304-find-n-unique-integers-sum-up-to-zero.js diff --git a/1304-find-n-unique-integers-sum-up-to-zero.js b/1304-find-n-unique-integers-sum-up-to-zero.js new file mode 100644 index 00000000..ed551311 --- /dev/null +++ b/1304-find-n-unique-integers-sum-up-to-zero.js @@ -0,0 +1,18 @@ +/** + * @param {number} n + * @return {number[]} + */ +const sumZero = function(n) { + const num = ~~(n / 2) + const odd = n % 2 === 1 + const res = pair(num) + if(odd) res.push(0) + return res +}; + +function pair(num) { + const set = new Set() + const res = [] + for(let i = 1; i <= num; i++) res.push(i, -i) + return res +} From 07bd61894a91e2f50066092a0d4b42751a17f5c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 09:08:26 +0800 Subject: [PATCH 0209/2039] Update 421-maximum-xor-of-two-numbers-in-an-array.js --- 421-maximum-xor-of-two-numbers-in-an-array.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/421-maximum-xor-of-two-numbers-in-an-array.js b/421-maximum-xor-of-two-numbers-in-an-array.js index ed3ff2a3..1e71476c 100644 --- a/421-maximum-xor-of-two-numbers-in-an-array.js +++ b/421-maximum-xor-of-two-numbers-in-an-array.js @@ -21,6 +21,20 @@ const findMaximumXOR = function(nums) { // another +/* + +This algorithm's idea is: +to iteratively determine what would be each bit of the final result from left to right. +And it narrows down the candidate group iteration by iteration. e.g. assume input are a,b,c,d,...z, 26 integers in total. +In first iteration, if you found that a, d, e, h, u differs on the MSB(most significant bit), +so you are sure your final result's MSB is set. Now in second iteration, +you try to see if among a, d, e, h, u there are at least two numbers make the 2nd MSB differs, +if yes, then definitely, the 2nd MSB will be set in the final result. +And maybe at this point the candidate group shinks from a,d,e,h,u to a, e, h. +Implicitly, every iteration, you are narrowing down the candidate group, +but you don't need to track how the group is shrinking, you only cares about the final result. + +*/ /* * @lc app=leetcode id=421 lang=javascript * From 09defccfb49ea091e6b30b001944ea87bfd6ec02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 10:25:58 +0800 Subject: [PATCH 0210/2039] Create 925-long-pressed-name.js --- 925-long-pressed-name.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 925-long-pressed-name.js diff --git a/925-long-pressed-name.js b/925-long-pressed-name.js new file mode 100644 index 00000000..68f487ae --- /dev/null +++ b/925-long-pressed-name.js @@ -0,0 +1,13 @@ +/** + * @param {string} name + * @param {string} typed + * @return {boolean} + */ +const isLongPressedName = function(name, typed) { + let i = 0, m = name.length, n = typed.length + for(let j = 0; j < n; j++) { + if(i < m && name[i] === typed[j]) i++ + else if(j === 0 || typed[j] !== typed[j - 1]) return false + } + return i === m +}; From fa34677c1d2e04229fdf9b1b4b3d1aeea6ad3b75 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 10:38:39 +0800 Subject: [PATCH 0211/2039] Create 976-largest-perimeter-triangle.js --- 976-largest-perimeter-triangle.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 976-largest-perimeter-triangle.js diff --git a/976-largest-perimeter-triangle.js b/976-largest-perimeter-triangle.js new file mode 100644 index 00000000..6cae6005 --- /dev/null +++ b/976-largest-perimeter-triangle.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const largestPerimeter = function(nums) { + nums.sort((a, b) => a - b) + for(let i = nums.length - 1; i > 1; i--) { + if(nums[i] < nums[i - 1] + nums[i - 2]) return nums[i - 2] + nums[i - 1] + nums[i] + } + return 0 +}; From 98898d93bd65807ea02d9664835665f7d710de0d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 11:15:22 +0800 Subject: [PATCH 0212/2039] Create 989-add-to-array-form-of-integer.js --- 989-add-to-array-form-of-integer.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 989-add-to-array-form-of-integer.js diff --git a/989-add-to-array-form-of-integer.js b/989-add-to-array-form-of-integer.js new file mode 100644 index 00000000..9d43f139 --- /dev/null +++ b/989-add-to-array-form-of-integer.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} num + * @param {number} k + * @return {number[]} + */ +const addToArrayForm = function(num, k) { + const res = [] + for(let i = num.length - 1; i >= 0; i--) { + const tmp = num[i] + k + res.push(tmp % 10) + k = ~~(tmp / 10) + } + + while(k > 0) { + res.push(k % 10) + k = ~~(k / 10) + } + res.reverse() + return res +}; From 74846a457e19f730fb157b33762732eef9a76a58 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 13:42:54 +0800 Subject: [PATCH 0213/2039] Create 999-available-captures-for-rook.js --- 999-available-captures-for-rook.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 999-available-captures-for-rook.js diff --git a/999-available-captures-for-rook.js b/999-available-captures-for-rook.js new file mode 100644 index 00000000..d6fb8571 --- /dev/null +++ b/999-available-captures-for-rook.js @@ -0,0 +1,18 @@ +/** + * @param {character[][]} board + * @return {number} + */ +const numRookCaptures = function(board) { + for (let i = 0; i < board.length; ++i) + for (let j = 0; j < board[i].length; ++j) + if (board[i][j] == 'R') return cap(board,i,j,0,1)+cap(board,i,j,0,-1)+cap(board,i,j,1,0)+cap(board,i,j,-1,0); + return 0; +}; + +function cap(b, x, y, dx, dy) { + while (x >= 0 && x < b.length && y >= 0 && y < b[x].length && b[x][y] != 'B') { + if (b[x][y] == 'p') return 1; + x += dx; y += dy; + } + return 0; +} From 79fcc678ffb29d94ab3b7184b982b6f0f1380c13 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 13:50:10 +0800 Subject: [PATCH 0214/2039] Create 1050-actors-and-directors-who-cooperated-at-least-three-times.sql --- ...ors-and-directors-who-cooperated-at-least-three-times.sql | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 1050-actors-and-directors-who-cooperated-at-least-three-times.sql diff --git a/1050-actors-and-directors-who-cooperated-at-least-three-times.sql b/1050-actors-and-directors-who-cooperated-at-least-three-times.sql new file mode 100644 index 00000000..13ea8e07 --- /dev/null +++ b/1050-actors-and-directors-who-cooperated-at-least-three-times.sql @@ -0,0 +1,5 @@ +# Write your MySQL query statement below +SELECT actor_id, director_id +FROM ActorDirector +GROUP BY actor_id, director_id +HAVING COUNT(1) >= 3 From f868e22c38aa2a47b2a24cb34c2e5a3baf5a66df Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 14:23:23 +0800 Subject: [PATCH 0215/2039] Create 1056-confusing-number.js --- 1056-confusing-number.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1056-confusing-number.js diff --git a/1056-confusing-number.js b/1056-confusing-number.js new file mode 100644 index 00000000..66bb7319 --- /dev/null +++ b/1056-confusing-number.js @@ -0,0 +1,19 @@ +/** + * @param {number} n + * @return {boolean} + */ +const confusingNumber = function(n) { + // 0, 1, 6, 8, 9 + const invalid = new Set(['2', '3', '4', '5', '7']) + const valid = new Set(['6', '9']) + const arr = ('' + n).split('') + let num = 0 + for(let i = 0; i < arr.length; i++) { + const ch = arr[i] + if(invalid.has(ch)) return false + if(ch === '6') arr[i] = '9' + else if(ch === '9') arr[i] = '6' + } + arr.reverse() + return arr.join('') !== '' + n +}; From 5c385e22791d5003e5383cde56d06483fa1d5422 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 15:06:13 +0800 Subject: [PATCH 0216/2039] Create 1064-fixed-point.js --- 1064-fixed-point.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1064-fixed-point.js diff --git a/1064-fixed-point.js b/1064-fixed-point.js new file mode 100644 index 00000000..39a1113d --- /dev/null +++ b/1064-fixed-point.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const fixedPoint = function(arr) { + const n = arr.length + let l = 0, r = n - 1 + while(l < r) { + const mid = l + ((r - l) >> 1) + if(arr[mid] < mid) l = mid + 1 + else if(arr[mid] > mid) r = mid - 1 + else r = mid + } + return arr[l] === l ? l : -1 +}; From 53415dc40f67e2e4dfe113a46a3f399c5929c682 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 15:54:26 +0800 Subject: [PATCH 0217/2039] Create 1065-index-pairs-of-a-string.js --- 1065-index-pairs-of-a-string.js | 41 +++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1065-index-pairs-of-a-string.js diff --git a/1065-index-pairs-of-a-string.js b/1065-index-pairs-of-a-string.js new file mode 100644 index 00000000..90eca7b8 --- /dev/null +++ b/1065-index-pairs-of-a-string.js @@ -0,0 +1,41 @@ +/** + * @param {string} text + * @param {string[]} words + * @return {number[][]} + */ +const indexPairs = function(text, words) { + const res = [], trie = buildTrie(words) + const n = text.length + for(let i = 0; i < n; i++) { + let node = trie + for(let j = i; j < n; j++) { + if(node.children[text[j]] == null) break + node = node.children[text[j]] + if(node.isWord) res.push([i, j]) + } + } + + return res +}; + +function buildTrie(words) { + const root = new Trie() + + for(let word of words) { + let node = root + for(let c of word) { + if(node.children[c] == null) node.children[c] = new Trie() + node = node.children[c] + } + node.isWord = true + } + + return root +} + +class Trie { + constructor() { + this.children = {} + this.isWord = false + } +} From 9aaf634cc9768628c3b20f1472f0eebe5e82d8be Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 16:24:58 +0800 Subject: [PATCH 0218/2039] Create 1085-sum-of-digits-in-the-minimum-number.js --- 1085-sum-of-digits-in-the-minimum-number.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1085-sum-of-digits-in-the-minimum-number.js diff --git a/1085-sum-of-digits-in-the-minimum-number.js b/1085-sum-of-digits-in-the-minimum-number.js new file mode 100644 index 00000000..13032caf --- /dev/null +++ b/1085-sum-of-digits-in-the-minimum-number.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const sumOfDigits = function(nums) { + let min = Math.min(...nums); + let ans = 0; + while (min > 0) { + ans += min % 10; + min = ~~(min / 10); + } + return 1 - ans % 2; +}; From 423d2e19b2d13c14a35b907c907217953a57e9b7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jul 2021 16:34:41 +0800 Subject: [PATCH 0219/2039] Create 1550-three-consecutive-odds.js --- 1550-three-consecutive-odds.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 1550-three-consecutive-odds.js diff --git a/1550-three-consecutive-odds.js b/1550-three-consecutive-odds.js new file mode 100644 index 00000000..d67397a1 --- /dev/null +++ b/1550-three-consecutive-odds.js @@ -0,0 +1,10 @@ +/** + * @param {number[]} arr + * @return {boolean} + */ +const threeConsecutiveOdds = function(arr) { + for(let i = 1, n = arr.length; i < n - 1; i++) { + if(arr[i] & 1 === 1 && arr[i - 1] & 1 === 1 && arr[i + 1] & 1 === 1) return true + } + return false +}; From 2d52519aed4fd2589e8d772f3828226c00a5534f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Jul 2021 19:49:10 +0800 Subject: [PATCH 0220/2039] Create 1938-maximum-genetic-difference-query.js --- 1938-maximum-genetic-difference-query.js | 62 ++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 1938-maximum-genetic-difference-query.js diff --git a/1938-maximum-genetic-difference-query.js b/1938-maximum-genetic-difference-query.js new file mode 100644 index 00000000..f90fe783 --- /dev/null +++ b/1938-maximum-genetic-difference-query.js @@ -0,0 +1,62 @@ +/** + * @param {number[]} parents + * @param {number[][]} queries + * @return {number[]} + */ +const maxGeneticDifference = function (parents, queries) { + let pn = parents.length, + qn = queries.length + let root = parents.indexOf(-1) + let children = initializeGraph(pn) + for (let i = 0; i < pn; i++) { + if (i != root) { + children[parents[i]].push(i) + } + } + let freq = Array(1 << 20).fill(0) + let queriesByNode = initializeGraph(pn) + for (let i = 0; i < qn; i++) { + let query = queries[i] + queriesByNode[query[0]].push(new Query(i, query[1])) + } + + let res = Array(qn).fill(0) + const dfs = (idx) => { + let y = (1 << 19) + idx + while (y > 0) { + freq[y]++ + y >>= 1 + } + for (const qnode of queriesByNode[idx]) { + let j = qnode.index, + x = qnode.val + let cum = 0 + let bit = 1 << 18 + while (bit > 0) { + let ii = (((1 << 19) ^ cum ^ x ^ bit) / bit) >> 0 + if (freq[ii] > 0) cum += bit + bit >>= 1 + } + res[j] = cum + } + for (const child of children[idx]) dfs(child) + y = (1 << 19) + idx + while (y > 0) { + freq[y]-- + y >>= 1 + } + } + dfs(root) + return res +} + +const initializeGraph = (n) => { + let G = [] + for (let i = 0; i < n; i++) G.push([]) + return G +} + +function Query(index, val) { + this.index = index + this.val = val +} From b33939c70b3d9cc69aac7da2ed9a922a0d083096 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Jul 2021 13:42:28 +0800 Subject: [PATCH 0221/2039] Update 1882-process-tasks-using-servers.js --- 1882-process-tasks-using-servers.js | 35 +++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/1882-process-tasks-using-servers.js b/1882-process-tasks-using-servers.js index 2f3a3dfd..17b515bc 100644 --- a/1882-process-tasks-using-servers.js +++ b/1882-process-tasks-using-servers.js @@ -1,3 +1,38 @@ +/** + * @param {number[]} servers + * @param {number[]} tasks + * @return {number[]} + */ +const assignTasks = function(servers, tasks) { + const freePQ = new PriorityQueue((a, b) => a.w === b.w ? a.i < b.i : a.w < b.w) + const runningPQ = new PriorityQueue((a, b) => a.e === b.e ? (a.w === b.w ? a.i < b.i : a.w < b.w) : a.e < b.e) + const m = servers.length, n = tasks.length + for(let i = 0; i < m; i++) freePQ.push({w: servers[i], i, e: 0}) + const res = [] + for(let i = 0; i < n; i++) { + const cur = tasks[i] + while(!runningPQ.isEmpty() && runningPQ.peek().e <= i) { + const tmp = runningPQ.pop() + tmp.e = i + freePQ.push(tmp) + } + if(freePQ.isEmpty()) { + const tmp = runningPQ.pop() + res[i] = tmp.i + tmp.e += cur + runningPQ.push(tmp) + } else { + const tmp = freePQ.pop() + res[i] = tmp.i + tmp.e = i + cur + runningPQ.push(tmp) + } + } + return res +}; + +// another + /** * @param {number[]} servers * @param {number[]} tasks From a65c9086b4a7054b5404f3968db888d994ec4e86 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Jul 2021 13:45:37 +0800 Subject: [PATCH 0222/2039] Create 1947-maximum-compatibility-score-sum.js --- 1947-maximum-compatibility-score-sum.js | 40 +++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 1947-maximum-compatibility-score-sum.js diff --git a/1947-maximum-compatibility-score-sum.js b/1947-maximum-compatibility-score-sum.js new file mode 100644 index 00000000..543cc2dd --- /dev/null +++ b/1947-maximum-compatibility-score-sum.js @@ -0,0 +1,40 @@ +/** + * @param {number[][]} students + * @param {number[][]} mentors + * @return {number} + */ +const maxCompatibilitySum = function(students, mentors) { + const obj = { res: 0 }, hash = {} + for(let i = 0, n = students.length; i < n; i++) { + bt(students, mentors, 0, 0, obj, hash) + } + return obj.res +}; + +function bt(stu, men, i, score, obj, hash) { + + if(i === stu.length) { + if(score > obj.res) { + obj.res = score + // console.log(hash) + } + return + } + + for(let j = 0; j < men.length; j++) { + const k = `${j}` + if(hash[k] === 1) continue + hash[k] = 1 + bt(stu, men, i + 1, score + calc(stu[i], men[j]), obj, hash) + delete hash[k] + } +} + +function calc(a1, a2) { + const n = a1.length + let res = 0 + for(let i = 0; i < n; i++) { + if(a1[i] === a2[i]) res++ + } + return res +} From 6fb3bb5a39dc84cf81581cb102f5fe7a4fc047e7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Jul 2021 13:46:24 +0800 Subject: [PATCH 0223/2039] Create 1946-largest-number-after-mutating-substring.js --- ...largest-number-after-mutating-substring.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1946-largest-number-after-mutating-substring.js diff --git a/1946-largest-number-after-mutating-substring.js b/1946-largest-number-after-mutating-substring.js new file mode 100644 index 00000000..8c6ed631 --- /dev/null +++ b/1946-largest-number-after-mutating-substring.js @@ -0,0 +1,24 @@ +/** + * @param {string} num + * @param {number[]} change + * @return {string} + */ +const maximumNumber = function(num, change) { + let res = '' + const arr = num.split('') + let prev = false, cnt = 0 + for(let i = 0, n = num.length; i < n; i++) { + const cur = +num[i] + if(change[cur] > cur) { + cnt++ + prev = true + arr[i] = change[cur] + } + if(change[cur] < cur) { + if(cnt <= 0) continue + else break + } + } + + return arr.join('') +}; From 0851cade5219e3709bbdbd56ce56bee9a4d864bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Jul 2021 13:47:16 +0800 Subject: [PATCH 0224/2039] Create 1945-sum-of-digits-of-string-after-convert.js --- 1945-sum-of-digits-of-string-after-convert.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1945-sum-of-digits-of-string-after-convert.js diff --git a/1945-sum-of-digits-of-string-after-convert.js b/1945-sum-of-digits-of-string-after-convert.js new file mode 100644 index 00000000..138ea154 --- /dev/null +++ b/1945-sum-of-digits-of-string-after-convert.js @@ -0,0 +1,25 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const getLucky = function(s, k) { + let res = 0 + const a = 'a'.charCodeAt(0) + const arr = [] + for(let ch of s) { + arr.push(ch.charCodeAt(0) - a + 1) + } + let str = arr.join('').split('').map(e => +e) + let prev = str, sum = 0 + while(k > 0) { + // let tmp = 0 + let tmp = prev.reduce((ac, e) => ac + e, 0) + // console.log(tmp) + prev = `${tmp}`.split('').map(e => +e) + sum = tmp + k-- + } + + return sum +}; From 13403e13e44113399e6e574f73e2a3c3c3bdca92 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Jul 2021 22:23:52 +0800 Subject: [PATCH 0225/2039] Create 1179-reformat-department-table.js --- 1179-reformat-department-table.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1179-reformat-department-table.js diff --git a/1179-reformat-department-table.js b/1179-reformat-department-table.js new file mode 100644 index 00000000..a36706c3 --- /dev/null +++ b/1179-reformat-department-table.js @@ -0,0 +1,17 @@ +# Write your MySQL query statement below +select id, + sum(case when month = 'jan' then revenue else null end) as Jan_Revenue, + sum(case when month = 'feb' then revenue else null end) as Feb_Revenue, + sum(case when month = 'mar' then revenue else null end) as Mar_Revenue, + sum(case when month = 'apr' then revenue else null end) as Apr_Revenue, + sum(case when month = 'may' then revenue else null end) as May_Revenue, + sum(case when month = 'jun' then revenue else null end) as Jun_Revenue, + sum(case when month = 'jul' then revenue else null end) as Jul_Revenue, + sum(case when month = 'aug' then revenue else null end) as Aug_Revenue, + sum(case when month = 'sep' then revenue else null end) as Sep_Revenue, + sum(case when month = 'oct' then revenue else null end) as Oct_Revenue, + sum(case when month = 'nov' then revenue else null end) as Nov_Revenue, + sum(case when month = 'dec' then revenue else null end) as Dec_Revenue +from department +group by id +order by id From 4da5f24b339a588e2ab53e0232158e1fb5884314 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Jul 2021 22:24:18 +0800 Subject: [PATCH 0226/2039] Rename 1179-reformat-department-table.js to 1179-reformat-department-table.sql --- ...rmat-department-table.js => 1179-reformat-department-table.sql | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename 1179-reformat-department-table.js => 1179-reformat-department-table.sql (100%) diff --git a/1179-reformat-department-table.js b/1179-reformat-department-table.sql similarity index 100% rename from 1179-reformat-department-table.js rename to 1179-reformat-department-table.sql From 73f579fa07206b9a7e529d087c079b706f331876 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Jul 2021 20:54:43 +0800 Subject: [PATCH 0227/2039] Create 1942-the-number-of-the-smallest-unoccupied-chair.js --- ...number-of-the-smallest-unoccupied-chair.js | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 1942-the-number-of-the-smallest-unoccupied-chair.js diff --git a/1942-the-number-of-the-smallest-unoccupied-chair.js b/1942-the-number-of-the-smallest-unoccupied-chair.js new file mode 100644 index 00000000..4ad49cf1 --- /dev/null +++ b/1942-the-number-of-the-smallest-unoccupied-chair.js @@ -0,0 +1,45 @@ +/** + * @param {number[][]} times + * @param {number} targetFriend + * @return {number} + */ +var smallestChair = function (times, targetFriend) { + const [targetArrival] = times[targetFriend] + const arrivalQueue = times + const leavingQueue = [...times] + arrivalQueue.sort((a, b) => a[0] - b[0]) + leavingQueue.sort((a, b) => a[1] - b[1] || a[0] - b[0]) + const chairsByLeaveTime = new Map() + let chairsCount = 0 + let arriving = 0, + leaving = 0 + + while (arriving < arrivalQueue.length) { + let chairIdx + const arrival = arrivalQueue[arriving][0] + const leave = leavingQueue[leaving][1] + if (arrival < leave) { + chairIdx = chairsCount++ + } else { + let freeChairIdx = leaving + chairIdx = chairsByLeaveTime.get(leavingQueue[freeChairIdx++][0]) + while (arrival >= leavingQueue[freeChairIdx][1]) { + const nextChair = chairsByLeaveTime.get(leavingQueue[freeChairIdx][0]) + if (chairIdx > nextChair) { + ;[leavingQueue[leaving], leavingQueue[freeChairIdx]] = [ + leavingQueue[freeChairIdx], + leavingQueue[leaving], + ] + chairIdx = nextChair + } + ++freeChairIdx + } + ++leaving + } + if (targetArrival === arrival) { + return chairIdx + } + chairsByLeaveTime.set(arrival, chairIdx) + arriving++ + } +} From dc4c502b2b3535ace96aafe349ebd7ee14425ba7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Jul 2021 16:32:12 +0800 Subject: [PATCH 0228/2039] Create 1943-describe-the-painting.js --- 1943-describe-the-painting.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1943-describe-the-painting.js diff --git a/1943-describe-the-painting.js b/1943-describe-the-painting.js new file mode 100644 index 00000000..872b3bc2 --- /dev/null +++ b/1943-describe-the-painting.js @@ -0,0 +1,24 @@ +/** + * @param {number[][]} segments + * @return {number[][]} + */ +const splitPainting = function(segments) { + const hash = {} + for(let [s, e, c] of segments) { + if(hash[s] == null) hash[s] = 0 + if(hash[e] == null) hash[e] = 0 + hash[s] += c + hash[e] -= c + } + const keys = Object.keys(hash) + keys.sort((a, b) => a - b) + let prev, color = 0 + const res = [] + for(let k of keys) { + if(prev != null && color !== 0) res.push([prev,k,color]) + + prev = k + color += hash[k] + } + return res +}; From c085ba52ef510801712c460ff42654ace74d5469 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Jul 2021 21:49:21 +0800 Subject: [PATCH 0229/2039] Create 1103-distribute-candies-to-people.js --- 1103-distribute-candies-to-people.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1103-distribute-candies-to-people.js diff --git a/1103-distribute-candies-to-people.js b/1103-distribute-candies-to-people.js new file mode 100644 index 00000000..309ef1a2 --- /dev/null +++ b/1103-distribute-candies-to-people.js @@ -0,0 +1,18 @@ +/** + * @param {number} candies + * @param {number} num_people + * @return {number[]} + */ +const distributeCandies = function(candies, num_people) { + const n = num_people + const res = Array(n).fill(0) + let idx = 0, cur = 0 + while(candies > 0) { + cur++ + res[idx] += Math.min(cur, candies) + idx++ + candies -= cur + if(idx === n) idx = 0 + } + return res +}; From 2a60640f6b6407cb1b91eb1f9f54f3767332db6d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Jul 2021 19:36:35 +0800 Subject: [PATCH 0230/2039] Create 1944-number-of-visible-people-in-a-queue.js --- 1944-number-of-visible-people-in-a-queue.js | 23 +++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1944-number-of-visible-people-in-a-queue.js diff --git a/1944-number-of-visible-people-in-a-queue.js b/1944-number-of-visible-people-in-a-queue.js new file mode 100644 index 00000000..48cccf15 --- /dev/null +++ b/1944-number-of-visible-people-in-a-queue.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} heights + * @return {number[]} + */ +const canSeePersonsCount = function(heights) { + const ans = new Uint32Array(heights.length); + + const stack = []; + for (let i = heights.length - 1; i >= 0; i--) { + const h = heights[i]; + + let del = 0; + while (stack.length && stack[stack.length - 1] <= h) { + del++; + stack.pop(); + } + + ans[i] = del + (stack.length ? 1 : 0); + stack.push(h); + } + + return ans; +}; From 3a8e743f7678df371cfa8108c1a67fdacedaa73d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 30 Jul 2021 09:04:42 +0800 Subject: [PATCH 0231/2039] Update 1879-minimum-xor-sum-of-two-arrays.js --- 1879-minimum-xor-sum-of-two-arrays.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1879-minimum-xor-sum-of-two-arrays.js b/1879-minimum-xor-sum-of-two-arrays.js index 7c6232f3..d85100e7 100644 --- a/1879-minimum-xor-sum-of-two-arrays.js +++ b/1879-minimum-xor-sum-of-two-arrays.js @@ -43,3 +43,26 @@ const minimumXORSum = function (nums1, nums2) { } } +// another + +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const minimumXORSum = function (nums1, nums2) { + const n = nums1.length, dp = Array(1 << n).fill(Infinity) + return dfs(0, 0) + + function dfs(i, mask) { + if(i >= n) return 0 + if(dp[mask] !== Infinity) return dp[mask] + for(let j = 0; j < n; j++) { + if((mask & (1 << j)) === 0) { + dp[mask] = Math.min(dp[mask], (nums1[i] ^ nums2[j]) + dfs(i + 1, mask | (1 << j))) + } + } + return dp[mask] + } +} + From f24cc0a298d5179c505be4643abc039c4929661b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 30 Jul 2021 16:50:49 +0800 Subject: [PATCH 0232/2039] Update 503-next-greater-element-II.js --- 503-next-greater-element-II.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/503-next-greater-element-II.js b/503-next-greater-element-II.js index 6d180376..fc284214 100755 --- a/503-next-greater-element-II.js +++ b/503-next-greater-element-II.js @@ -20,3 +20,23 @@ function single(idx, arr) { } return -1; } + +// another + +/** + * @param {number[]} nums + * @return {number[]} + */ + const nextGreaterElements = function(nums) { + const res = [], n = nums.length + const stack = [] + for(let i = 2 * n - 1; i >= 0; i--) { + while(stack.length && nums[stack[stack.length - 1]] <= nums[i % n]) { + stack.pop() + } + res[i % n] = stack.length ? nums[stack[stack.length - 1]] : -1 + stack.push(i % n) + } + + return res +}; From 8371e63b00b956a4610de06d61d3bf27d89b71f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 31 Jul 2021 13:42:39 +0800 Subject: [PATCH 0233/2039] Update 1947-maximum-compatibility-score-sum.js --- 1947-maximum-compatibility-score-sum.js | 35 +++++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/1947-maximum-compatibility-score-sum.js b/1947-maximum-compatibility-score-sum.js index 543cc2dd..893623e4 100644 --- a/1947-maximum-compatibility-score-sum.js +++ b/1947-maximum-compatibility-score-sum.js @@ -1,3 +1,38 @@ +/** + * @param {number[][]} students + * @param {number[][]} mentors + * @return {number} + */ +const maxCompatibilitySum = function(students, mentors) { + const n = students.length, dp = Array(1 << n).fill(-Infinity) + const m = students[0].length + return dfs(0, 0) + + function dfs(i, mask) { + if(i === n) return 0 + if(dp[mask] !== -Infinity) return dp[mask] + for(let j = 0; j < n; j++) { + if((mask & (1 << j)) === 0) { + dp[mask] = Math.max(dp[mask], calc(i, j) + dfs(i + 1, mask | (1 << j))) + } + } + + return dp[mask] + } + + function calc(i, j) { + let res = 0 + const a = students[i], b = mentors[j] + for(let k = 0; k < m; k++) { + if(a[k] === b[k]) res++ + } + return res + } +}; + + +// another + /** * @param {number[][]} students * @param {number[][]} mentors From acf4175f84cc9cdc5a87d322760e2428e1f5a835 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Aug 2021 20:37:18 +0800 Subject: [PATCH 0234/2039] Create 1952-three-divisors.js --- 1952-three-divisors.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1952-three-divisors.js diff --git a/1952-three-divisors.js b/1952-three-divisors.js new file mode 100644 index 00000000..54dd076d --- /dev/null +++ b/1952-three-divisors.js @@ -0,0 +1,14 @@ +/** + * @param {number} n + * @return {boolean} + */ +const isThree = function(n) { + if(n == 1) return false; + let a = ~~Math.sqrt(n); + if(n != a * a) return false; + for(let i = 2; i < a; i++) { + if (n % i == 0) + return false; + } + return true; +}; From 501e66d9fe36da07715e3231d559ef2f577a26d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Aug 2021 20:38:09 +0800 Subject: [PATCH 0235/2039] Create 1953-maximum-number-of-weeks-for-which-you-can-work.js --- ...um-number-of-weeks-for-which-you-can-work.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1953-maximum-number-of-weeks-for-which-you-can-work.js diff --git a/1953-maximum-number-of-weeks-for-which-you-can-work.js b/1953-maximum-number-of-weeks-for-which-you-can-work.js new file mode 100644 index 00000000..17e1830d --- /dev/null +++ b/1953-maximum-number-of-weeks-for-which-you-can-work.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} milestones + * @return {number} + */ +const numberOfWeeks = function(milestones) { + let sum = 0; + for (let i = 0; i < milestones.length; i++) { + sum += milestones[i]; + } + + let cantWork = 0; + for (let i = 0; i < milestones.length; i++) { + cantWork = Math.max(cantWork, milestones[i] - (sum - milestones[i]) - 1); + } + + return sum - cantWork; +}; From b6d04040e1689ca7b0c09142279d37e17782dba6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Aug 2021 20:39:09 +0800 Subject: [PATCH 0236/2039] Create 1954-minimum-garden-perimeter-to-collect-enough-apples.js --- ...arden-perimeter-to-collect-enough-apples.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1954-minimum-garden-perimeter-to-collect-enough-apples.js diff --git a/1954-minimum-garden-perimeter-to-collect-enough-apples.js b/1954-minimum-garden-perimeter-to-collect-enough-apples.js new file mode 100644 index 00000000..13f18a9d --- /dev/null +++ b/1954-minimum-garden-perimeter-to-collect-enough-apples.js @@ -0,0 +1,18 @@ +/** + * @param {number} neededApples + * @return {number} + */ +var minimumPerimeter = function(neededApples) { + let l = 0, r = 100000; + while (l + 1 < r) { + let w = (l + r) >> 1; + let apples = 2 * w * (w + 1) * (2 * w + 1); + if (apples >= neededApples) { + r = w; + } else { + l = w; + } + } + + return r * 8; +}; From b0e85db1268accbbb6e4f7b9e3fd8b56227bc823 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Aug 2021 20:39:51 +0800 Subject: [PATCH 0237/2039] Create 1955-count-number-of-special-subsequences.js --- 1955-count-number-of-special-subsequences.js | 36 ++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 1955-count-number-of-special-subsequences.js diff --git a/1955-count-number-of-special-subsequences.js b/1955-count-number-of-special-subsequences.js new file mode 100644 index 00000000..f8c62b0d --- /dev/null +++ b/1955-count-number-of-special-subsequences.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countSpecialSubsequences = function(nums) { + const mod = 10 ** 9 + 7 + const dp = Array.from({length: 10 **5 + 1}, () => Array(4).fill(-1)) + let n = nums.length, a = nums + return f(0, 0) + function f(index, firstMandatory) { + if (index == n && firstMandatory == 3) { + return 1; + } + if (index == n) { + return 0; + } + if (dp[index][firstMandatory] >= 0) { + return dp[index][firstMandatory]; + } + let result = 0; + if (a[index] == firstMandatory) { + result = (result + + f(index + 1, firstMandatory) + + f(index + 1, firstMandatory + 1) + ) % mod; + } + result = (result + f(index + 1, firstMandatory)) % mod; + + return dp[index][firstMandatory] = result; + } +}; + + + + + From ced3ffdd022539c2e8a7ec97a6a1214bb88ac704 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 2 Aug 2021 20:07:39 +0800 Subject: [PATCH 0238/2039] Update 652-find-duplicate-subtrees.js --- 652-find-duplicate-subtrees.js | 29 ++++++++++++++--------------- 1 file changed, 14 insertions(+), 15 deletions(-) diff --git a/652-find-duplicate-subtrees.js b/652-find-duplicate-subtrees.js index 65949019..d67c62b1 100644 --- a/652-find-duplicate-subtrees.js +++ b/652-find-duplicate-subtrees.js @@ -1,27 +1,26 @@ /** * Definition for a binary tree node. - * function TreeNode(val) { - * this.val = val; - * this.left = this.right = null; + * 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 {TreeNode[]} */ -const findDuplicateSubtrees = function (root) { - const obj = {}, - res = [] - preOrder(root, obj, res) +const findDuplicateSubtrees = function(root) { + const hash = {}, res = [] + pre(root, hash, res) return res -} +}; -function preOrder(root, map, res) { - if (root === null) return '#' - const str = - root.val + preOrder(root.left, map, res) + preOrder(root.right, map, res) - if (!map[str]) map[str] = 0 - map[str]++ - if (map[str] === 2) res.push(root) +function pre(node, hash, res) { + if(node == null) return '#' + const str = `${node.val},${pre(node.left, hash, res)},${pre(node.right, hash, res)}` + if(hash[str] == null) hash[str] = 0 + hash[str]++ + if(hash[str] === 2) res.push(node) return str } From 0d2645e1f1da34f695704f914b4212f3187ef0ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 2 Aug 2021 20:49:02 +0800 Subject: [PATCH 0239/2039] Update 652-find-duplicate-subtrees.js --- 652-find-duplicate-subtrees.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/652-find-duplicate-subtrees.js b/652-find-duplicate-subtrees.js index d67c62b1..8a1a84da 100644 --- a/652-find-duplicate-subtrees.js +++ b/652-find-duplicate-subtrees.js @@ -24,3 +24,35 @@ function pre(node, hash, res) { if(hash[str] === 2) res.push(node) return str } + +// another + +/** + * 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 {TreeNode[]} + */ +const findDuplicateSubtrees = function(root) { + const serId = {}, cntId = {}, res = [] + let id = 1 + post(root) + return res + + function post(node) { + if(node == null) return 0 + const curId = `${post(node.left)},${node.val},${post(node.right)}` + serId[curId] = serId[curId] || id + if(serId[curId] === id) id++ + cntId[curId] = (cntId[curId] || 0) + 1 + if(cntId[curId] === 2) res.push(node) + return serId[curId] + } +}; + From 479720e8952451c9de43fa4a422339c9c736209e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 3 Aug 2021 20:22:17 +0800 Subject: [PATCH 0240/2039] Create 1948-delete-duplicate-folders-in-system.js --- 1948-delete-duplicate-folders-in-system.js | 134 +++++++++++++++++++++ 1 file changed, 134 insertions(+) create mode 100644 1948-delete-duplicate-folders-in-system.js diff --git a/1948-delete-duplicate-folders-in-system.js b/1948-delete-duplicate-folders-in-system.js new file mode 100644 index 00000000..e68d27a4 --- /dev/null +++ b/1948-delete-duplicate-folders-in-system.js @@ -0,0 +1,134 @@ +/** + * @param {string[][]} paths + * @return {string[][]} + */ +const deleteDuplicateFolder = function(paths) { + const trie = new Trie() + for (const path of paths) { + let cur = trie.trie + cur.countPrefix++ + for (const name of path) { + if(cur.children[name] == null) cur.children[name] = new TrieNode(name) + cur = cur.children[name] + cur.countPrefix++ + } + } + const folders = new Map() + dfs1(trie.trie) + for (const value of folders.values()) { + if (value.length > 1) { + // found the same dir, mark as to be deleted + for (const node of value) { + node.countPrefix = 0 + } + } + } + const ans = [] + // traverse un-deleted dir, put them to result + dfs2(trie.trie, []) + return ans + function dfs1 (node) { + if (Object.keys(node.children).length === 0) { + return `(${node.char})` + } + const childrenExp = [] + for (const key in node.children) { + childrenExp.push(dfs1(node.children[key])) + } + const exp = childrenExp.sort((a, b) => a.localeCompare(b)).join('') + if (!folders.has(exp)) { + folders.set(exp, []) + } + folders.get(exp).push(node) + return `(${node.char}${childrenExp.join('')})` + } + function dfs2 (node, path) { + // already deleted, no need go further + if (node.countPrefix === 0) { + return + } + if (node.char !== '/') { path.push(node.char) } + if (path.length) ans.push([...path]) + for (const key in node.children) { + dfs2(node.children[key], path) + } + path.pop() + } +}; +class TrieNode { + constructor (char) { + this.char = char + this.count = 0 + this.countPrefix = 0 + this.children = {} + } +}; +class Trie { + /** + * @description Initialize the trie + */ + constructor () { + this.trie = new TrieNode('/') + } + + /** + * @description Insert strings into the trie + * @param str the string to be inserted + * @param count number of `str` to be inserted, can be negative for deleting x from the trie + */ + insert (str, count = 1) { + let cur = this.trie + for (const char of str) { + cur.children[char] ??= new TrieNode(char) + cur = cur.children[char] + cur.countPrefix += count + } + cur.count += count + } + + /** + * Traverse the trie with a callback function + * @param str An input string + * @param callbackfn A callback function. traverse calls the callbackfn function one time for each char in `str`, however it may skip ending chars in str if the trie has no children to go deeper, the returned char from callbackfn will be used as the direction of traversing + * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value + */ + traverse (str, callbackfn, thisArg) { + let cur = this.trie + for (let i = 0; i < str.length; i++) { + const retChar = callbackfn.call(thisArg, str[i], i, cur) + const tmp = cur.children[retChar] + if (!tmp || tmp.countPrefix <= 0) return + cur = tmp + } + } + + /** + * @description Search a string in the trie + * @returns Number of `str` in the trie + */ + count (str) { + let ans = 0 + this.traverse(str, (char, idx, node) => { + const nextNode = node.children[char] + if (idx === str.length - 1 && nextNode) { + ans = nextNode.count + } + return char + }) + return ans + } + + /** + * @description Search a string in the trie + * @returns Number of prefix of `str` in the trie + */ + countPrefix (str) { + let ans = 0 + this.traverse(str, (char, idx, node) => { + const nextNode = node.children[char] + ans += nextNode?.countPrefix ?? 0 + return char + }) + return ans + } +}; From e5a95a458bab1d99b325bbea3d77a954d6d16df1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 4 Aug 2021 10:53:48 +0800 Subject: [PATCH 0241/2039] Update 1955-count-number-of-special-subsequences.js --- 1955-count-number-of-special-subsequences.js | 22 ++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/1955-count-number-of-special-subsequences.js b/1955-count-number-of-special-subsequences.js index f8c62b0d..8467f496 100644 --- a/1955-count-number-of-special-subsequences.js +++ b/1955-count-number-of-special-subsequences.js @@ -1,3 +1,25 @@ +/* + * @lc app=leetcode id=1955 lang=javascript + * + * [1955] Count Number of Special Subsequences + */ + +// @lc code=start +/** + * @param {number[]} nums + * @return {number} + */ +const countSpecialSubsequences = function (nums) { + const dp = Array(3).fill(0), + mod = 10 ** 9 + 7 + for (let e of nums) { + dp[e] = (((dp[e] + dp[e]) % mod) + (e > 0 ? dp[e - 1] : 1)) % mod + } + return dp[2] +} + +// another + /** * @param {number[]} nums * @return {number} From f3f9cbfe09295cdc8cb4466ed26cb267dff4dff9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 4 Aug 2021 21:10:13 +0800 Subject: [PATCH 0242/2039] Create 1515-best-position-for-a-service-centre.js --- 1515-best-position-for-a-service-centre.js | 39 ++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 1515-best-position-for-a-service-centre.js diff --git a/1515-best-position-for-a-service-centre.js b/1515-best-position-for-a-service-centre.js new file mode 100644 index 00000000..9d8958a2 --- /dev/null +++ b/1515-best-position-for-a-service-centre.js @@ -0,0 +1,39 @@ +/** + * @param {number[][]} positions + * @return {number} + */ +const getMinDistSum = function(positions) { + const n = positions.length + let x = positions.reduce((ac, e) => ac + e[0], 0) / n + let y = positions.reduce((ac, e) => ac + e[1], 0) / n + + const dirs = [[1,0],[-1,0],[0,1],[0,-1]] + let res = fn(x, y, positions) + let chg = 100 + while(chg > 1e-6) { + let zoom = true + for(let [dx, dy] of dirs) { + const nx = x + dx * chg + const ny = y + dy * chg + const nRes = fn(nx, ny, positions) + if(nRes < res) { + res = nRes + x = nx + y = ny + zoom = false + break + } + } + if(zoom) chg /= 2 + } + return res +}; + +function fn(x, y, arr) { + let res = 0 + const n = arr.length + for(let i = 0; i < n; i++) { + res += Math.sqrt((x - arr[i][0]) ** 2 + (y - arr[i][1]) ** 2) + } + return res +} From fc8c5b5892421a7ea020f335b3e6f97410a6147f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 5 Aug 2021 15:12:22 +0800 Subject: [PATCH 0243/2039] Update 1953-maximum-number-of-weeks-for-which-you-can-work.js --- ...um-number-of-weeks-for-which-you-can-work.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) diff --git a/1953-maximum-number-of-weeks-for-which-you-can-work.js b/1953-maximum-number-of-weeks-for-which-you-can-work.js index 17e1830d..fc834574 100644 --- a/1953-maximum-number-of-weeks-for-which-you-can-work.js +++ b/1953-maximum-number-of-weeks-for-which-you-can-work.js @@ -15,3 +15,20 @@ const numberOfWeeks = function(milestones) { return sum - cantWork; }; + +// another + +/** + * @param {number[]} milestones + * @return {number} + */ +const numberOfWeeks = function(milestones) { + const max = Math.max(...milestones) + let sum = 0 + for(let i = 0; i < milestones.length; i++) { + sum += milestones[i] + } + const res = sum - max + + return Math.min(sum, res * 2 + 1) +}; From 5340d727816d0506381d1260854e17c5a7e767d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 5 Aug 2021 21:21:30 +0800 Subject: [PATCH 0244/2039] Create 1483-kth-ancestor-of-a-tree-node.js --- 1483-kth-ancestor-of-a-tree-node.js | 41 +++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1483-kth-ancestor-of-a-tree-node.js diff --git a/1483-kth-ancestor-of-a-tree-node.js b/1483-kth-ancestor-of-a-tree-node.js new file mode 100644 index 00000000..207305f5 --- /dev/null +++ b/1483-kth-ancestor-of-a-tree-node.js @@ -0,0 +1,41 @@ +/** + * @param {number} n + * @param {number[]} parent + */ +var TreeAncestor = function(n, parent) { + // initialize + this.P = Array.from({length: 20}, () => Array(n).fill(-1)) + // 2^0 + for(let i = 0; i < parent.length; i++){ + this.P[0][i] = parent[i]; + } + + // 2^i + for(let i = 1; i < 20; i++){ + for(let node = 0; node < parent.length; node++){ + let nodep = this.P[i-1][node]; + if(nodep != -1) this.P[i][node] = this.P[i-1][nodep]; + } + } +}; + +/** + * @param {number} node + * @param {number} k + * @return {number} + */ +TreeAncestor.prototype.getKthAncestor = function(node, k) { + for(let i = 0; i < 20; i++){ + if(k & (1 << i)){ + node = this.P[i][node]; + if(node == -1) return -1; + } + } + return node; +}; + +/** + * Your TreeAncestor object will be instantiated and called as such: + * var obj = new TreeAncestor(n, parent) + * var param_1 = obj.getKthAncestor(node,k) + */ From 3fbc63eb0543ebb63112ba57ee9a204750c31e45 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 Aug 2021 11:37:18 +0800 Subject: [PATCH 0245/2039] Update 767-reorganize-string.js --- 767-reorganize-string.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/767-reorganize-string.js b/767-reorganize-string.js index 222a2e25..8cbc6901 100644 --- a/767-reorganize-string.js +++ b/767-reorganize-string.js @@ -36,3 +36,41 @@ const reorganizeString = function(S) { } return parts.join(''); }; + +// another + +/** + * @param {string} s + * @return {string} + */ +const reorganizeString = function(s) { + const arr = Array(26).fill(0), a = 'a'.charCodeAt(0) + for(let ch of s) arr[ch.charCodeAt(0) - a]++ + let max = 0, idx = -1 + for(let i = 0; i < 26; i++) { + if(arr[i] > max) { + max = arr[i] + idx = i + } + } + const n = s.length + const res = Array(n) + if(max > (n + 1) / 2) return '' + + let i = 0 + while(arr[idx] > 0) { + res[i] = String.fromCharCode(a + idx) + i += 2 + arr[idx]-- + } + + for(let j = 0; j < 26; j++) { + while(arr[j]) { + if(i >= n) i = 1 + res[i] = String.fromCharCode(a + j) + i += 2 + arr[j]-- + } + } + return res.join('') +}; From 849aeb1131f4190528cf9d69817806e7fb7b0d4b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 Aug 2021 12:11:29 +0800 Subject: [PATCH 0246/2039] Update 160-intersection-of-two-linked-lists.js --- 160-intersection-of-two-linked-lists.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/160-intersection-of-two-linked-lists.js b/160-intersection-of-two-linked-lists.js index a44ab1d5..21ae7fec 100644 --- a/160-intersection-of-two-linked-lists.js +++ b/160-intersection-of-two-linked-lists.js @@ -1,3 +1,27 @@ +/** + * Definition for singly-linked list. + * function ListNode(val) { + * this.val = val; + * this.next = null; + * } + */ + +/** + * @param {ListNode} headA + * @param {ListNode} headB + * @return {ListNode} + */ +const getIntersectionNode = function(headA, headB) { + let a = headA, b = headB + while(a !== b) { + a = a == null ? headB : a.next + b = b == null ? headA : b.next + } + return a +}; + +// another + /** * Definition for singly-linked list. * function ListNode(val) { From 2e4c9853af1718cff3bffe7ab2c09d1c092cad21 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 Aug 2021 17:15:27 +0800 Subject: [PATCH 0247/2039] Create 928-minimize-malware-spread-ii.js --- 928-minimize-malware-spread-ii.js | 45 +++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 928-minimize-malware-spread-ii.js diff --git a/928-minimize-malware-spread-ii.js b/928-minimize-malware-spread-ii.js new file mode 100644 index 00000000..c9597cb8 --- /dev/null +++ b/928-minimize-malware-spread-ii.js @@ -0,0 +1,45 @@ +/** + * @param {number[][]} graph + * @param {number[]} initial + * @return {number} + */ +var minMalwareSpread = function (graph, initial) { + const map = new Map() // node -> initial nodes infect this node + for (let i of initial) { + const visited = new Set(initial) + const q = [] + q.push(i) + while (q.length) { + let cur = q.shift() + for (let j = 0; j < graph[cur].length; j++) { + if (graph[cur][j] == 1) { + if (!visited.has(j)) { + visited.add(j) + q.push(j) + + if (map.get(j) == null) map.set(j, []) + map.get(j).push(i) + } + } + } + } + } + + const res = Array(graph.length).fill(0) // node -> safe nodes it infects + for (let node of map.keys()) { + if (map.get(node).length == 1) { + let i = map.get(node)[0] + res[i]++ + } + } + let max = 0 + let removed = -1 + for (let i = 0; i < res.length; i++) { + if (res[i] > max) { + max = res[i] + removed = i + } + } + initial.sort((a, b) => a - b) + return removed == -1 ? initial[0] : removed +} From 742d3b19affb361fc798de1fc7899801ea6c7461 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Aug 2021 11:32:44 +0800 Subject: [PATCH 0248/2039] Update 1054-distant-barcodes.js --- 1054-distant-barcodes.js | 45 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/1054-distant-barcodes.js b/1054-distant-barcodes.js index 452c9d04..f214d14a 100644 --- a/1054-distant-barcodes.js +++ b/1054-distant-barcodes.js @@ -20,3 +20,48 @@ const rearrangeBarcodes = function(barcodes) { return barcodes; }; + +// another + +/** + * @param {number[]} barcodes + * @return {number[]} + */ +const rearrangeBarcodes = function(barcodes) { + const hash = {}, n = barcodes.length + for(let e of barcodes) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const res = Array(n) + let max = 0, idx = -1 + for(let k in hash) { + if(hash[k] > max) { + max = hash[k] + idx = +k + } + } + let i = 0 + // max freq first + while(max > 0) { + res[i] = idx + max-- + i += 2 + } + // the rest + const keys = Object.keys(hash).map(e => +e) + for(let j = 0, len = keys.length; j < len; j++) { + if(keys[j] !== idx) { + const k = keys[j] + let freq = hash[k] + while(freq > 0) { + if(i >= n) i = 1 + res[i] = k + freq-- + i += 2 + } + } + } + + return res +}; From a9fc36bec47d288b34d4a38544aec1cf93d1e3a5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Aug 2021 19:20:29 +0800 Subject: [PATCH 0249/2039] Update 928-minimize-malware-spread-ii.js --- 928-minimize-malware-spread-ii.js | 51 +++++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/928-minimize-malware-spread-ii.js b/928-minimize-malware-spread-ii.js index c9597cb8..dbe1249e 100644 --- a/928-minimize-malware-spread-ii.js +++ b/928-minimize-malware-spread-ii.js @@ -43,3 +43,54 @@ var minMalwareSpread = function (graph, initial) { initial.sort((a, b) => a - b) return removed == -1 ? initial[0] : removed } + +// another + +/** + * @param {number[][]} graph + * @param {number[]} initial + * @return {number} + */ +const minMalwareSpread = function (graph, initial) { + const map = new Map(), n = graph.length + for(let init of initial) { + const visited = new Set(initial) + const q = [init] + while(q.length) { + const cur = q.pop() + for(let i = 0; i < n; i++) { + if(graph[cur][i] === 1 && !visited.has(i)) { + visited.add(i) + q.push(i) + if(map.get(i) == null) map.set(i, []) + map.get(i).push(init) + } + } + } + } + + let res = 0, max = -1 + const arr = Array(n) + for(let [k,v] of map) { + if(v.length === 1) { + if(arr[v[0]] == null) arr[v[0]] = 0 + arr[v[0]]++ + } + } + + for(let k = 0; k < n; k++) { + const v = arr[k] + if(v > max) { + max = v + res = +k + } + } + + let min = Infinity + for(let e of initial) { + if(e < min) min = e + } + return max === -1 ? min: res + +} + From e76ec4d9f93406d2fe84a0d4e4194740c0be4feb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Aug 2021 12:54:53 +0800 Subject: [PATCH 0250/2039] Create 1964-find-the-longest-valid-obstacle-course-at-each-position.js --- ...-valid-obstacle-course-at-each-position.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 1964-find-the-longest-valid-obstacle-course-at-each-position.js diff --git a/1964-find-the-longest-valid-obstacle-course-at-each-position.js b/1964-find-the-longest-valid-obstacle-course-at-each-position.js new file mode 100644 index 00000000..bb0f7e46 --- /dev/null +++ b/1964-find-the-longest-valid-obstacle-course-at-each-position.js @@ -0,0 +1,35 @@ +/** + * @param {number[]} obstacles + * @return {number[]} + */ +const longestObstacleCourseAtEachPosition = function(obstacles) { + const n = obstacles.length + const stack = [], res = Array(n).fill(0) + let m = 0 + let j = 0; + for (let x of obstacles) { + let i = chk(x); + if (i == m) { + ++m; + stack.push(x); + } else { + stack[i] = x; + } + res[j++] = i + 1; + } + return res; + function chk(x) { + if (m && stack[m - 1] <= x) return m; + let l = 0, r = m - 1; + while (l < r) { + let m = (l + r) >> 1; + if (stack[m] > x) { + r = m; + } else { + l = m + 1; + } + } + return l; + } +}; + From 07e56415316d49f83837ea0d63bc8e9c525d67ab Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Aug 2021 12:55:25 +0800 Subject: [PATCH 0251/2039] Create 1963-minimum-number-of-swaps-to-make-the-string-balanced.js --- ...er-of-swaps-to-make-the-string-balanced.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1963-minimum-number-of-swaps-to-make-the-string-balanced.js diff --git a/1963-minimum-number-of-swaps-to-make-the-string-balanced.js b/1963-minimum-number-of-swaps-to-make-the-string-balanced.js new file mode 100644 index 00000000..f2afa49f --- /dev/null +++ b/1963-minimum-number-of-swaps-to-make-the-string-balanced.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @return {number} + */ +const minSwaps = function(s) { + const stack = [] + let num = 0 + for(let e of s) { + if(e === '[') { + stack.push(e) + num++ + } + if(e === ']') { + if(stack[stack.length - 1] === '[') { + stack.pop() + num-- + } + } + } + // console.log(num) + return Math.ceil(num / 2) +}; From 6849085e1543f3d112d675cb8feb0255b0a3b4ad Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Aug 2021 16:44:35 +0800 Subject: [PATCH 0252/2039] Create 1962-remove-stones-to-minimize-the-total.js --- 1962-remove-stones-to-minimize-the-total.js | 87 +++++++++++++++++++++ 1 file changed, 87 insertions(+) create mode 100644 1962-remove-stones-to-minimize-the-total.js diff --git a/1962-remove-stones-to-minimize-the-total.js b/1962-remove-stones-to-minimize-the-total.js new file mode 100644 index 00000000..2821846c --- /dev/null +++ b/1962-remove-stones-to-minimize-the-total.js @@ -0,0 +1,87 @@ +/** + * @param {number[]} piles + * @param {number} k + * @return {number} + */ +const minStoneSum = function(piles, k) { + const pq = new PriorityQueue((a, b) => a > b) + for(let e of piles) pq.push(e) + while(k > 0) { + const tmp = pq.pop() + const e = tmp - (~~(tmp / 2)) + pq.push(e) + k-- + } + let res = 0 + while(!pq.isEmpty()) { + res += pq.pop() + } + return res +}; +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 85bc3a748e6b7b688452236d5254137e63fdbd12 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Aug 2021 16:45:08 +0800 Subject: [PATCH 0253/2039] Create 1961-check-if-string-is-a-prefix-of-array.js --- 1961-check-if-string-is-a-prefix-of-array.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1961-check-if-string-is-a-prefix-of-array.js diff --git a/1961-check-if-string-is-a-prefix-of-array.js b/1961-check-if-string-is-a-prefix-of-array.js new file mode 100644 index 00000000..861c5bec --- /dev/null +++ b/1961-check-if-string-is-a-prefix-of-array.js @@ -0,0 +1,13 @@ +/** + * @param {string} s + * @param {string[]} words + * @return {boolean} + */ +const isPrefixString = function(s, words) { + let tmp = '' + for(let w of words) { + tmp += w + if(tmp === s) return true + } + return false +}; From 791cabe45062ede9d032d0a90c4521bd3345a60d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Aug 2021 16:21:33 +0800 Subject: [PATCH 0254/2039] Update 621-task-scheduler.js --- 621-task-scheduler.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/621-task-scheduler.js b/621-task-scheduler.js index 079639a0..fc6cefe3 100755 --- a/621-task-scheduler.js +++ b/621-task-scheduler.js @@ -39,3 +39,32 @@ const leastInterval = function(tasks, n) { } return Math.max((max - 1) * (n + 1) + count, tasks.length) }; + +// another + +/** + * @param {character[]} tasks + * @param {number} n + * @return {number} + */ +const leastInterval = function(tasks, n) { + let max = 0, maxCnt = 0 + const len = tasks.length, cnt = Array(26).fill(0), A = 'A'.charCodeAt(0) + + for(let ch of tasks) { + const idx = ch.charCodeAt(0) - A + cnt[idx]++ + if(max === cnt[idx]) maxCnt++ + else if(max < cnt[idx]) { + max = cnt[idx] + maxCnt = 1 + } + } + + const maxSlots = max * maxCnt + const avaiSlots = (max - 1) * (n - (maxCnt - 1)) + const rem = len - maxSlots + const emptySlots = Math.max(0, avaiSlots - rem) + + return len + emptySlots +}; From a2b79698cf77a2b7085464a864304896daa82336 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 10 Aug 2021 20:30:08 +0800 Subject: [PATCH 0255/2039] Create 984-string-without-aaa-or-bbb.js --- 984-string-without-aaa-or-bbb.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 984-string-without-aaa-or-bbb.js diff --git a/984-string-without-aaa-or-bbb.js b/984-string-without-aaa-or-bbb.js new file mode 100644 index 00000000..bd4832b1 --- /dev/null +++ b/984-string-without-aaa-or-bbb.js @@ -0,0 +1,24 @@ +/** + * @param {number} a + * @param {number} b + * @return {string} + */ +const strWithout3a3b = function(a, b) { + let m = a, n = b, ch1 = 'a', ch2 = 'b' + if(b > a) { + m = b, n = a, ch1 = 'b', ch2 = 'a' + } + let res = '' + while(m-- > 0) { + res += ch1 + if(m > n) { + res += ch1 + m-- + } + if(n > 0) { + res += ch2 + n-- + } + } + return res +}; From 69b79623e0baa849bcc819ec18d428b1ddda5623 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 11 Aug 2021 19:45:54 +0800 Subject: [PATCH 0256/2039] Create 1405-longest-happy-string.js --- 1405-longest-happy-string.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1405-longest-happy-string.js diff --git a/1405-longest-happy-string.js b/1405-longest-happy-string.js new file mode 100644 index 00000000..68d46bef --- /dev/null +++ b/1405-longest-happy-string.js @@ -0,0 +1,23 @@ +/** + * @param {number} a + * @param {number} b + * @param {number} c + * @return {string} + */ +const longestDiverseString = function (a, b, c) { + return generate(a, b, c, "a", "b", "c"); +}; + +function generate(a, b, c, ac, bc, cc) { + if (a < b) return generate(b, a, c, bc, ac, cc); + if (b < c) return generate(a, c, b, ac, cc, bc); + if (b === 0) return ac.repeat(Math.min(2, a)); + let use_a = Math.min(2, a), + use_b = a - use_a >= b ? 1 : 0; + return ( + ac.repeat(use_a) + + bc.repeat(use_b) + + generate(a - use_a, b - use_b, c, ac, bc, cc) + ); +} + From 381afd1e6476cfb8168762585c7797def77c0d0d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 11 Aug 2021 21:35:06 +0800 Subject: [PATCH 0257/2039] Update 1405-longest-happy-string.js --- 1405-longest-happy-string.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1405-longest-happy-string.js b/1405-longest-happy-string.js index 68d46bef..9da22977 100644 --- a/1405-longest-happy-string.js +++ b/1405-longest-happy-string.js @@ -1,3 +1,35 @@ +/** + * @param {number} a + * @param {number} b + * @param {number} c + * @return {string} + */ +const longestDiverseString = function (a, b, c) { + const arr = [['a', a], ['b', b], ['c', c]] + + let res = '' + while(true) { + arr.sort((a, b) => b[1] - a[1]) + if(res.length >= 2 && arr[0][0] === res[res.length - 1] && arr[0][0] === res[res.length - 2]) { + if(arr[1][1] > 0) { + res += arr[1][0] + arr[1][1]-- + } else break + } else { + if(arr[0][1] > 0) { + res += arr[0][0] + arr[0][1]-- + } else break + } + } + + return res +}; + + +// another + + /** * @param {number} a * @param {number} b From af0809560fc7c963890decc2d4f77445cfddb156 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 12 Aug 2021 19:17:21 +0800 Subject: [PATCH 0258/2039] Update 1963-minimum-number-of-swaps-to-make-the-string-balanced.js --- ...er-of-swaps-to-make-the-string-balanced.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1963-minimum-number-of-swaps-to-make-the-string-balanced.js b/1963-minimum-number-of-swaps-to-make-the-string-balanced.js index f2afa49f..d54d75be 100644 --- a/1963-minimum-number-of-swaps-to-make-the-string-balanced.js +++ b/1963-minimum-number-of-swaps-to-make-the-string-balanced.js @@ -20,3 +20,24 @@ const minSwaps = function(s) { // console.log(num) return Math.ceil(num / 2) }; + +// another + +/** + * @param {string} s + * @return {number} + */ +const minSwaps = function(s) { + let num = 0 + for(let e of s) { + if(e === '[') { + num++ + } + if(e === ']') { + if(num > 0) { + num-- + } + } + } + return Math.ceil(num / 2) +}; From 1995cac0ccb5799f771ff0185460d50ab90ee99a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Aug 2021 11:29:24 +0800 Subject: [PATCH 0259/2039] Create 5745-last-day-where-you-can-still-cross.js --- 5745-last-day-where-you-can-still-cross.js | 76 ++++++++++++++++++++++ 1 file changed, 76 insertions(+) create mode 100644 5745-last-day-where-you-can-still-cross.js diff --git a/5745-last-day-where-you-can-still-cross.js b/5745-last-day-where-you-can-still-cross.js new file mode 100644 index 00000000..93911f4f --- /dev/null +++ b/5745-last-day-where-you-can-still-cross.js @@ -0,0 +1,76 @@ +/** + * @param {number} row + * @param {number} col + * @param {number[][]} cells + * @return {number} + */ +const latestDayToCross = function (row, col, cells) { + const d = [ + [-1, 0], + [1, 0], + [0, 1], + [0, -1], + ] + + let a = Array.from({ length: row }, () => Array(col).fill(0)) + let visited = Array.from({ length: row }, () => Array(col).fill(false)) + + for (let i = 0; i < cells.length; i++) { + a[cells[i][0] - 1][cells[i][1] - 1] = i + } + + let l = 0 + let r = row * col + while (l + 1 < r) { + let w = ~~((l + r) / 2) + if (canCross(w)) { + l = w + } else { + r = w + } + } + + return l + + function canReachBottom(i, j, day) { + if (i == row - 1) { + return true + } + visited[i][j] = true + + for (let diff of d) { + let newI = i + diff[0] + let newJ = j + diff[1] + + if (newI < 0 || newI >= row || newJ < 0 || newJ >= col) { + continue + } + + if (visited[newI][newJ] || a[newI][newJ] < day) { + continue + } + + if (canReachBottom(newI, newJ, day)) { + return true + } + } + + return false + } + + function canCross(day) { + for (let layer of visited) { + layer.forEach((e, idx) => (layer[idx] = false)) + } + + for (let j = 0; j < col; j++) { + if (a[0][j] >= day && canReachBottom(0, j, day)) { + return true + } + } + + return false + } +} + + From 8ee16a600afd486eeecbb4d0587c4701798d6d88 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Aug 2021 11:40:44 +0800 Subject: [PATCH 0260/2039] Create 5844-minimum-non-zero-product-of-the-array-elements.js --- ...-non-zero-product-of-the-array-elements.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 5844-minimum-non-zero-product-of-the-array-elements.js diff --git a/5844-minimum-non-zero-product-of-the-array-elements.js b/5844-minimum-non-zero-product-of-the-array-elements.js new file mode 100644 index 00000000..067d8260 --- /dev/null +++ b/5844-minimum-non-zero-product-of-the-array-elements.js @@ -0,0 +1,21 @@ +/** + * @param {number} p + * @return {number} + */ +const minNonZeroProduct = function(p) { + const b = BigInt(p) + const mod = BigInt(10 ** 9 + 7) + + return (BigInt(1n << b) - 1n) % mod * pow(BigInt(1n << b) - 2n, BigInt(1n << (b - 1n)) - 1n) % mod; + + function pow(a, n) { + let r = 1n; + a %= mod; + while (n > 0n) { + r = r * a % mod; + a = a * a % mod; + n /= 2n; + } + return r; + } +}; From f668bc9d13789f90aea00a4242c852de0002bab2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Aug 2021 11:41:42 +0800 Subject: [PATCH 0261/2039] Create 5832-array-with-elements-not-equal-to-average-of-neighbors.js --- ...ments-not-equal-to-average-of-neighbors.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 5832-array-with-elements-not-equal-to-average-of-neighbors.js diff --git a/5832-array-with-elements-not-equal-to-average-of-neighbors.js b/5832-array-with-elements-not-equal-to-average-of-neighbors.js new file mode 100644 index 00000000..ef33751a --- /dev/null +++ b/5832-array-with-elements-not-equal-to-average-of-neighbors.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const rearrangeArray = function(nums) { + nums.sort((a, b) => a - b) + const res = [] + let idx = 0, i = 0 + const n = ~~((nums.length + 1) / 2) + while(i < nums.length) { + if(idx >= nums.length) idx = 1 + // console.log(idx,i) + res[idx] = nums[i] + + idx += 2 + i++ + } + + return res +}; From 3041fb8313c9aeb7484120cb5723a262ff7c3db6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Aug 2021 11:42:13 +0800 Subject: [PATCH 0262/2039] Create 5843-number-of-strings-that-appear-as-substrings-in-word.js --- ...r-of-strings-that-appear-as-substrings-in-word.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 5843-number-of-strings-that-appear-as-substrings-in-word.js diff --git a/5843-number-of-strings-that-appear-as-substrings-in-word.js b/5843-number-of-strings-that-appear-as-substrings-in-word.js new file mode 100644 index 00000000..3c87e656 --- /dev/null +++ b/5843-number-of-strings-that-appear-as-substrings-in-word.js @@ -0,0 +1,12 @@ +/** + * @param {string[]} patterns + * @param {string} word + * @return {number} + */ +const numOfStrings = function(patterns, word) { + let res = 0 + for(let e of patterns) { + if(word.indexOf(e) !== -1) res++ + } + return res +}; From 38581beaca6debc09aa9ab91188fc829bbdd55c4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Aug 2021 23:12:25 +0800 Subject: [PATCH 0263/2039] Update 1249-minimum-remove-to-make-valid-parentheses.js --- ...inimum-remove-to-make-valid-parentheses.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1249-minimum-remove-to-make-valid-parentheses.js b/1249-minimum-remove-to-make-valid-parentheses.js index eb294a6e..8f6a909c 100644 --- a/1249-minimum-remove-to-make-valid-parentheses.js +++ b/1249-minimum-remove-to-make-valid-parentheses.js @@ -18,3 +18,34 @@ } return arr.join('') }; + +// another + +/** + * @param {string} s + * @return {string} + */ +const minRemoveToMakeValid = function(s) { + let cnt = 0 + let res = s.split('') + // console.log(res) + for(let i = 0; i < res.length; ) { + const ch = res[i] + if(ch === '(') cnt++ + if(ch === ')') cnt-- + if(cnt < 0) { + // console.log(res, i) + res.splice(i, 1) + cnt++ + } else i++ + } + // console.log(res) + let idx = res.length - 1 + while(cnt > 0) { + if(res[idx] === '(') { + res.splice(idx, 1) + cnt-- + } else idx-- + } + return res.join('') +}; From 397e9b30f5695197348850c49751f1a3ffe3cbe4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 16 Aug 2021 22:11:35 +0800 Subject: [PATCH 0264/2039] Create 1541-minimum-insertions-to-balance-a-parentheses-string.js --- ...ertions-to-balance-a-parentheses-string.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1541-minimum-insertions-to-balance-a-parentheses-string.js diff --git a/1541-minimum-insertions-to-balance-a-parentheses-string.js b/1541-minimum-insertions-to-balance-a-parentheses-string.js new file mode 100644 index 00000000..94c39484 --- /dev/null +++ b/1541-minimum-insertions-to-balance-a-parentheses-string.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @return {number} + */ +const minInsertions = function(s) { + let res = 0, right = 0; + for (let i = 0; i < s.length; ++i) { + if (s.charAt(i) == '(') { + if (right % 2 > 0) { + right--; + res++; + } + right += 2; + } else { + right--; + if (right < 0) { + right += 2; + res++; + } + } + } + return right + res; +}; From 7cd33e93e4c154bc5ff94f8ea718f740506cbc0b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 17 Aug 2021 09:48:17 +0800 Subject: [PATCH 0265/2039] Update 678-valid-parenthesis-string.js --- 678-valid-parenthesis-string.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/678-valid-parenthesis-string.js b/678-valid-parenthesis-string.js index bfac5df3..443a9a4d 100644 --- a/678-valid-parenthesis-string.js +++ b/678-valid-parenthesis-string.js @@ -12,3 +12,26 @@ const checkValidString = function(s) { } return lo === 0; }; + +// another + +/** + * @param {string} s + * @return {boolean} + */ + const checkValidString = function (s) { + let lo = 0, hi = 0 // 可能多余的‘(’ + for(let ch of s) { + if(ch === '(') lo++, hi++ + if(ch === ')') { + if(lo > 0) lo-- + hi-- + } + if(ch === '*') { + if(lo > 0) lo-- + hi++ + } + if(hi < 0) return false + } + return lo === 0 +} From 46a41a2959f74b26db0d1acd3f7d7a4b01fd8e56 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 17 Aug 2021 19:38:20 +0800 Subject: [PATCH 0266/2039] Update 715-range-module.js --- 715-range-module.js | 75 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 75 insertions(+) diff --git a/715-range-module.js b/715-range-module.js index 65f77cd2..3b9e4b9f 100644 --- a/715-range-module.js +++ b/715-range-module.js @@ -123,3 +123,78 @@ RangeModule.prototype.removeRange = function(left, right) { * var param_2 = obj.queryRange(left,right) * obj.removeRange(left,right) */ + + +// another + +const RangeModule = function () { + this.intervals = [] +} + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.addRange = function (left, right) { + const n = this.intervals.length + const tmp = [] + for (let i = 0; i <= n; i++) { + const cur = this.intervals[i] + + if (i == n || cur[0] > right) { + tmp.push([left, right]) + while (i < n) tmp.push(this.intervals[i++]) + } else if (cur[1] < left) tmp.push(cur) + else { + left = Math.min(left, cur[0]) + right = Math.max(right, cur[1]) + } + } + this.intervals = tmp +} + +/** + * @param {number} left + * @param {number} right + * @return {boolean} + */ +RangeModule.prototype.queryRange = function (left, right) { + const n = this.intervals.length + let l = 0, + r = n - 1 + while (l <= r) { + let m = ~~(l + (r - l) / 2) + if (this.intervals[m][0] >= right) r = m - 1 + else if (this.intervals[m][1] <= left) l = m + 1 + else return this.intervals[m][0] <= left && this.intervals[m][1] >= right + } + return false +} + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.removeRange = function (left, right) { + const n = this.intervals.length + const tmp = [] + for (let i = 0; i < n; i++) { + const cur = this.intervals[i] + if (cur[1] <= left || cur[0] >= right) tmp.push(cur) + else { + if (cur[0] < left) tmp.push([cur[0], left]) + if (cur[1] > right) tmp.push([right, cur[1]]) + } + } + this.intervals = tmp +} + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = new RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */ From c2123becaf5a8dd57c9f58853b29e5fb2498d93c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 17 Aug 2021 21:58:53 +0800 Subject: [PATCH 0267/2039] Update 1541-minimum-insertions-to-balance-a-parentheses-string.js --- ...ertions-to-balance-a-parentheses-string.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1541-minimum-insertions-to-balance-a-parentheses-string.js b/1541-minimum-insertions-to-balance-a-parentheses-string.js index 94c39484..30fa00fa 100644 --- a/1541-minimum-insertions-to-balance-a-parentheses-string.js +++ b/1541-minimum-insertions-to-balance-a-parentheses-string.js @@ -21,3 +21,32 @@ const minInsertions = function(s) { } return right + res; }; + +// another + +/** + * @param {string} s + * @return {number} + */ +const minInsertions = function(s) { + let add = 0, req = 0 // number of parentheses added, number of closing parentheses required + for(let ch of s) { + if(ch === '(') { + req += 2 + if(req % 2 === 1) { + add++ + req-- + } + } else { + if(req === 0) { + add++ + req++ + }else { + req-- + } + } + } + + return add + req +}; + From ceee2627d61baaaeee378c654397599c45a94986 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 Aug 2021 19:36:20 +0800 Subject: [PATCH 0268/2039] Create 1959-minimum-total-space-wasted-with-k-resizing-operations.js --- ...space-wasted-with-k-resizing-operations.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1959-minimum-total-space-wasted-with-k-resizing-operations.js diff --git a/1959-minimum-total-space-wasted-with-k-resizing-operations.js b/1959-minimum-total-space-wasted-with-k-resizing-operations.js new file mode 100644 index 00000000..b20a1d77 --- /dev/null +++ b/1959-minimum-total-space-wasted-with-k-resizing-operations.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minSpaceWastedKResizing = function(nums, k) { + const n = nums.length, INF = 200 * 1e6; + const memo = Array.from({ length: 200 }, () => Array(200)); + return dp(nums, 0, k); + function dp(nums, i, k) { + if (i === n) return 0; + if (k === -1) return INF; + if (memo[i][k] != null) return memo[i][k]; + let ans = INF, maxNum = nums[i], totalSum = 0; + for (let j = i; j < n; j++) { + maxNum = Math.max(maxNum, nums[j]); + totalSum += nums[j]; + const wasted = maxNum * (j - i + 1) - totalSum; + ans = Math.min(ans, dp(nums, j + 1, k - 1) + wasted); + } + return memo[i][k] = ans; + } +}; + From 7b2e52e3a14cf516c1706ed0ee2da2c85913e3b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 Aug 2021 22:13:56 +0800 Subject: [PATCH 0269/2039] Update 1959-minimum-total-space-wasted-with-k-resizing-operations.js --- ...space-wasted-with-k-resizing-operations.js | 30 +++++++++---------- 1 file changed, 15 insertions(+), 15 deletions(-) diff --git a/1959-minimum-total-space-wasted-with-k-resizing-operations.js b/1959-minimum-total-space-wasted-with-k-resizing-operations.js index b20a1d77..3529ed15 100644 --- a/1959-minimum-total-space-wasted-with-k-resizing-operations.js +++ b/1959-minimum-total-space-wasted-with-k-resizing-operations.js @@ -4,21 +4,21 @@ * @return {number} */ const minSpaceWastedKResizing = function(nums, k) { - const n = nums.length, INF = 200 * 1e6; - const memo = Array.from({ length: 200 }, () => Array(200)); - return dp(nums, 0, k); - function dp(nums, i, k) { - if (i === n) return 0; - if (k === -1) return INF; - if (memo[i][k] != null) return memo[i][k]; - let ans = INF, maxNum = nums[i], totalSum = 0; - for (let j = i; j < n; j++) { - maxNum = Math.max(maxNum, nums[j]); - totalSum += nums[j]; - const wasted = maxNum * (j - i + 1) - totalSum; - ans = Math.min(ans, dp(nums, j + 1, k - 1) + wasted); + const n = nums.length, INF = 200 * 1e6 + const memo = Array.from({length: n}, () => Array(k)) + return dp(0, k) + + function dp(i, k) { + if(i === n) return 0 + if(k < 0) return INF + if(memo[i][k] != null) return memo[i][k] + let res = INF, max = nums[i], sum = 0 + for(let j = i; j < n; j++) { + max = Math.max(max, nums[j]) + sum += nums[j] + const waste = max * (j - i + 1) - sum + res = Math.min(res, dp(j + 1, k - 1) + waste) } - return memo[i][k] = ans; + return memo[i][k] = res } }; - From c6cb30e9ebfa635130a79138ddd82c478e114ef9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 19 Aug 2021 16:22:37 +0800 Subject: [PATCH 0270/2039] Update 1105-filling-bookcase-shelves.js --- 1105-filling-bookcase-shelves.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1105-filling-bookcase-shelves.js b/1105-filling-bookcase-shelves.js index 712581f4..aaa4d034 100644 --- a/1105-filling-bookcase-shelves.js +++ b/1105-filling-bookcase-shelves.js @@ -18,3 +18,24 @@ const minHeightShelves = function(books, shelf_width) { } return dp[books.length] }; + +// another + +/** + * @param {number[][]} books + * @param {number} shelf_width + * @return {number} + */ +const minHeightShelves = function(books, shelf_width) { + const n = books.length, dp = Array(1001).fill(Infinity) + dp[0] = 0 + for(let i = 0; i < n; i++) { + let sum = 0, mx = 0 + for(let j = i; j >= 0 && sum + books[j][0] <= shelf_width; j--) { + sum += books[j][0] + mx = Math.max(mx, books[j][1]) + dp[i + 1] = Math.min(dp[i + 1], dp[j] + mx) + } + } + return dp[n] +}; From 4196f6290b37610ae0dff0a74a06a83841224e96 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 19 Aug 2021 17:34:40 +0800 Subject: [PATCH 0271/2039] Update 1105-filling-bookcase-shelves.js --- 1105-filling-bookcase-shelves.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1105-filling-bookcase-shelves.js b/1105-filling-bookcase-shelves.js index aaa4d034..26f71c83 100644 --- a/1105-filling-bookcase-shelves.js +++ b/1105-filling-bookcase-shelves.js @@ -39,3 +39,27 @@ const minHeightShelves = function(books, shelf_width) { } return dp[n] }; + +// another + +/** + * @param {number[][]} books + * @param {number} shelf_width + * @return {number} + */ + const minHeightShelves = function(books, shelf_width) { + const n = books.length, dp = Array(1001) + dp[0] = 0 + + for(let i = 0; i < n; i++) { + let [w, h] = books[i] + dp[i + 1] = dp[i] + h + for(let j = i - 1; j >= 0 && w + books[j][0] <= shelf_width; j--) { + h = Math.max(h, books[j][1]) + w += books[j][0] + dp[i + 1] = Math.min(dp[i + 1], dp[j] + h) + } + } + + return dp[n] +}; From 77c53e9f1ad30aa7089f64164531245b2bfc7fd4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 19 Aug 2021 22:50:26 +0800 Subject: [PATCH 0272/2039] Create 1114-print-in-order.cpp --- 1114-print-in-order.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 1114-print-in-order.cpp diff --git a/1114-print-in-order.cpp b/1114-print-in-order.cpp new file mode 100644 index 00000000..48110120 --- /dev/null +++ b/1114-print-in-order.cpp @@ -0,0 +1,33 @@ +class Foo { +public: + int count = 0; + mutex mtx; + condition_variable cv; + Foo() { + count = 1; + } + + void first(function printFirst) { + unique_lock lck(mtx); + // printFirst() outputs "first". Do not change or remove this line. + printFirst(); + count = 2; + cv.notify_all(); + } + + void second(function printSecond) { + unique_lock lck(mtx); + cv.wait(lck, [this]() { return count == 2;}); + // printSecond() outputs "second". Do not change or remove this line. + printSecond(); + count = 3; + cv.notify_all(); + } + + void third(function printThird) { + unique_lock lck(mtx); + cv.wait(lck, [this]() { return count == 3;}); + // printThird() outputs "third". Do not change or remove this line. + printThird(); + } +}; From 62f6696875959701ccbc73a4a5ca154e15e05fe1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 19 Aug 2021 23:07:12 +0800 Subject: [PATCH 0273/2039] Create 1588-sum-of-all-odd-length-subarrays.js --- 1588-sum-of-all-odd-length-subarrays.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1588-sum-of-all-odd-length-subarrays.js diff --git a/1588-sum-of-all-odd-length-subarrays.js b/1588-sum-of-all-odd-length-subarrays.js new file mode 100644 index 00000000..3306288b --- /dev/null +++ b/1588-sum-of-all-odd-length-subarrays.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const sumOddLengthSubarrays = function(arr) { + const n = arr.length, pre = Array(n + 1).fill(0) + for(let i = 0; i < n; i++) pre[i + 1] = pre[i] + arr[i] + + let res = 0 + let len = 1 + while(len <= n) { + for(let i = 0; i <= n - len; i++) { + res += pre[i + len] - pre[i] // len === 1: 1 - 0, 2 - 1 + // len === 3: 3 - 0, 6 - 3 + } + + len += 2 + } + + return res + +}; From 63aed9dbe943d6e8240ae19b4c421ba596be380a Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 20 Aug 2021 11:13:50 +0800 Subject: [PATCH 0274/2039] Update 1043-partition-array-for-maximum-sum.js --- 1043-partition-array-for-maximum-sum.js | 26 +++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1043-partition-array-for-maximum-sum.js b/1043-partition-array-for-maximum-sum.js index c98797e8..adec52a9 100644 --- a/1043-partition-array-for-maximum-sum.js +++ b/1043-partition-array-for-maximum-sum.js @@ -15,3 +15,29 @@ const maxSumAfterPartitioning = function(A, K) { } return dp[N - 1]; }; + +// another + +/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +const maxSumAfterPartitioning = function(arr, k) { + const n = arr.length, memo = Array(n + 1) + memo[0] = 0 + return dp(n) + + function dp(i) { + if(i === 0) return 0 + if(memo[i] != null) return memo[i] + + let sum = 0, max = 0, res = 0 + for(let j = i; j > 0 && i - j < k; j--) { + max = Math.max(max, arr[j - 1]) + sum = (i - j + 1) * max + res = Math.max(res, dp(j - 1) + sum) + } + return memo[i] = res + } +}; From 5f0f2d9ce014a6109115a63f401b612a40a802e4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 21 Aug 2021 11:01:39 +0800 Subject: [PATCH 0275/2039] Update 300-longest-increasing-subsequence.js --- 300-longest-increasing-subsequence.js | 31 +++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/300-longest-increasing-subsequence.js b/300-longest-increasing-subsequence.js index 196f7ba3..3d79c6ec 100644 --- a/300-longest-increasing-subsequence.js +++ b/300-longest-increasing-subsequence.js @@ -68,3 +68,34 @@ const lengthOfLIS = function(nums) { } return res }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const lengthOfLIS = function(nums) { + const n = nums.length, stack = [] + let res = 0 + stack.push(nums[0]) + for(let i = 1; i < n; i++) { + const cur = nums[i] + if(cur > stack[stack.length - 1]) { + stack.push(cur) + } else { + let l = 0, r = stack.length - 1 + while(l < r) { + let mid = ~~((l + r) / 2) + if(stack[mid] < cur) { + l = mid + 1 + } else { + r = mid + } + } + stack[l] = cur + } + } + + return stack.length +}; From b62e13e547ce72277b1c6d38384ca763e27da7d0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 21 Aug 2021 19:43:26 +0800 Subject: [PATCH 0276/2039] Create 1351-count-negative-numbers-in-a-sorted-matrix.js --- ...-count-negative-numbers-in-a-sorted-matrix.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1351-count-negative-numbers-in-a-sorted-matrix.js diff --git a/1351-count-negative-numbers-in-a-sorted-matrix.js b/1351-count-negative-numbers-in-a-sorted-matrix.js new file mode 100644 index 00000000..3564969e --- /dev/null +++ b/1351-count-negative-numbers-in-a-sorted-matrix.js @@ -0,0 +1,16 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const countNegatives = function(grid) { + const m = grid.length, n = grid[0].length + let res = 0, r = m - 1, c = 0 + while(r >= 0 && c < n) { + if(grid[r][c] < 0) { + res += n - c + r-- + } else c++ + } + + return res +}; From 85da8858a58c7b83b68bae0e6e14840cafff9191 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Aug 2021 20:04:18 +0800 Subject: [PATCH 0277/2039] Update 1964-find-the-longest-valid-obstacle-course-at-each-position.js --- ...-valid-obstacle-course-at-each-position.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/1964-find-the-longest-valid-obstacle-course-at-each-position.js b/1964-find-the-longest-valid-obstacle-course-at-each-position.js index bb0f7e46..86eab10a 100644 --- a/1964-find-the-longest-valid-obstacle-course-at-each-position.js +++ b/1964-find-the-longest-valid-obstacle-course-at-each-position.js @@ -1,3 +1,47 @@ +/** + * @param {number[]} obstacles + * @return {number[]} + */ +const longestObstacleCourseAtEachPosition = function(obstacles) { + const n = obstacles.length + const stack = [], res = [] + let len = 0 + + for(let i = 0; i < n; i++) { + const cur = obstacles[i] + const idx = chk(cur) + if(idx === len) { + stack.push(cur) + len++ + res.push(len) + }else { + stack[idx] = cur + res.push(idx + 1) + } + } + + return res + + function chk(x) { + if(len && stack[len - 1] <= x) return len + let l = 0, r = len - 1 + while(l < r) { + const mid = ~~((l + r) / 2) + if(stack[mid] <= x) { + l = mid + 1 + } else { + r = mid + } + } + return l + } +}; + + + + +// another + /** * @param {number[]} obstacles * @return {number[]} From b81e5e4f4346e02e944fce30960e5523be3343fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Aug 2021 20:04:54 +0800 Subject: [PATCH 0278/2039] Create 1979-find-greatest-common-divisor-of-array.js --- 1979-find-greatest-common-divisor-of-array.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1979-find-greatest-common-divisor-of-array.js diff --git a/1979-find-greatest-common-divisor-of-array.js b/1979-find-greatest-common-divisor-of-array.js new file mode 100644 index 00000000..3028ce94 --- /dev/null +++ b/1979-find-greatest-common-divisor-of-array.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findGCD = function(nums) { + let min = Math.min(...nums) + let max = Math.max(...nums) + return gcd(min, max) +}; + +function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) +} From eaec25cbc635d85eeeb4e633cbe38b8cee69e863 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Aug 2021 20:05:24 +0800 Subject: [PATCH 0279/2039] Create 1980-find-unique-binary-string.js --- 1980-find-unique-binary-string.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1980-find-unique-binary-string.js diff --git a/1980-find-unique-binary-string.js b/1980-find-unique-binary-string.js new file mode 100644 index 00000000..1e24e6a6 --- /dev/null +++ b/1980-find-unique-binary-string.js @@ -0,0 +1,22 @@ +/** + * @param {string[]} nums + * @return {string} + */ +const findDifferentBinaryString = function(nums) { + const set = new Set(nums) + const len = nums[0].length + for(let i = 0, n = 1 << 17; i < n; i++) { + const tmp = pad(bin(i), len) + if(!set.has(tmp)) return tmp + } + return '' +}; + +function bin(num) { + return (num >>> 0).toString(2) +} + +function pad(str,n) { + while(str.length < n) str = '0' + str + return str +} From 90b4a71d208eec93fc652c972eedad6f8f5e4f08 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Aug 2021 20:05:59 +0800 Subject: [PATCH 0280/2039] Create 1981-minimize-the-difference-between-target-and-chosen-elements.js --- ...ence-between-target-and-chosen-elements.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1981-minimize-the-difference-between-target-and-chosen-elements.js diff --git a/1981-minimize-the-difference-between-target-and-chosen-elements.js b/1981-minimize-the-difference-between-target-and-chosen-elements.js new file mode 100644 index 00000000..df41deae --- /dev/null +++ b/1981-minimize-the-difference-between-target-and-chosen-elements.js @@ -0,0 +1,21 @@ +/** + * @param {number[][]} mat + * @param {number} target + * @return {number} + */ +const minimizeTheDifference = function(mat, target) { + const m = mat.length, n = mat[0].length + const dp = Array.from({length: m}, () => Array(70*70).fill(-1)) + return fn(0, 0) + + function fn(row, sum) { + if(row === m) return Math.abs(target - sum) + if(dp[row][sum] !== -1) return dp[row][sum] + let res = Number.MAX_SAFE_INTEGER + for(let j = 0; j < n; j++) { + res = Math.min(res, fn(row + 1, sum + mat[row][j])) + } + return dp[row][sum] = res + } +}; + From 01a4f237899ff8e74013cf23193a797890eb6c65 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Aug 2021 19:38:06 +0800 Subject: [PATCH 0281/2039] Update 1713-minimum-operations-to-make-a-subsequence.js --- ...inimum-operations-to-make-a-subsequence.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1713-minimum-operations-to-make-a-subsequence.js b/1713-minimum-operations-to-make-a-subsequence.js index 8e751863..edd5d4c5 100644 --- a/1713-minimum-operations-to-make-a-subsequence.js +++ b/1713-minimum-operations-to-make-a-subsequence.js @@ -75,3 +75,41 @@ const minOperations = function(target, arr) { return target.length - stack.length }; + +// another + +/** + * @param {number[]} target + * @param {number[]} arr + * @return {number} + */ +const minOperations = function(target, arr) { + const hash = {} + for(let i = 0, n = target.length; i < n; i++) { + hash[target[i]] = i + } + const stack = [] + + for(let e of arr) { + if(hash[e] == null) continue + const cur = hash[e] + if(stack.length && cur > stack[stack.length - 1]) { + stack.push(cur) + continue + } + + let l = 0, r = stack.length - 1 + + while(l < r) { + const mid = ~~((l + r) / 2) + if(stack[mid] < cur) { + l = mid + 1 + } else r = mid + } + + stack[l] = cur + + } + + return target.length - stack.length +}; From bc124356d6bd061306f3d0fbdafa394cc01697ab Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Aug 2021 21:22:43 +0800 Subject: [PATCH 0282/2039] Create 1534-count-good-triplets.js --- 1534-count-good-triplets.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1534-count-good-triplets.js diff --git a/1534-count-good-triplets.js b/1534-count-good-triplets.js new file mode 100644 index 00000000..8d6d3b96 --- /dev/null +++ b/1534-count-good-triplets.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} arr + * @param {number} a + * @param {number} b + * @param {number} c + * @return {number} + */ +const countGoodTriplets = function(arr, a, b, c) { + const n = arr.length, { abs } = Math + let res = 0 + + for(let i = 0; i < n - 2; i++) { + for(let j = i + 1; j < n - 1; j++) { + if(abs(arr[i] - arr[j]) > a) continue + for(let k = j + 1; k < n; k++) { + if(abs(arr[j] - arr[k]) <= b && abs(arr[i] - arr[k]) <= c) res++ + } + } + } + + return res + +}; From f11a50a757f8e4cb935f24af083fce9b3f75ccf4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Aug 2021 21:54:09 +0800 Subject: [PATCH 0283/2039] Create 1982-find-array-given-subset-sums.js --- 1982-find-array-given-subset-sums.js | 43 ++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 1982-find-array-given-subset-sums.js diff --git a/1982-find-array-given-subset-sums.js b/1982-find-array-given-subset-sums.js new file mode 100644 index 00000000..b1b71020 --- /dev/null +++ b/1982-find-array-given-subset-sums.js @@ -0,0 +1,43 @@ +/** + * @param {number} n + * @param {number[]} sums + * @return {number[]} + */ +const recoverArray = function(n, sums) { + const res = [] + sums.sort((a, b) => a - b) + while(res.length < n) { + const used = Array(sums.length).fill(false) + const v0 = [], v1 = [] + let d = sums[1] - sums[0] + for(let i = 0, j = 1; ;i++, j++) { + while(i < sums.length && used[i]) i++ + if(i === sums.length) break + while(j <= i || sums[j] !== sums[i] + d) j++ + v0.push(sums[i]) + v1.push(sums[j]) + used[i] = used[j] = true + } + + if(bs(v0, 0)) { + res.push(d) + sums = v0 + }else { + res.push(-d) + sums = v1 + } + } + return res +}; + + +function bs(arr, e) { + let l = 0, r = arr.length - 1 + while(l < r) { + const mid = ~~((l + r) / 2) + if(arr[mid] < e) l = mid + 1 + else r = mid + } + + return arr[l] === e +} From dbd7d02fda2ffddd99202fb019a1da8595850bfc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Aug 2021 11:18:58 +0800 Subject: [PATCH 0284/2039] Update 354-russian-doll-envelopes.js --- 354-russian-doll-envelopes.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/354-russian-doll-envelopes.js b/354-russian-doll-envelopes.js index 81e09efb..bb10c078 100644 --- a/354-russian-doll-envelopes.js +++ b/354-russian-doll-envelopes.js @@ -26,3 +26,29 @@ const maxEnvelopes = function(envelopes) { } return dp.length } + +// another + +/** + * @param {number[][]} envelopes + * @return {number} + */ +const maxEnvelopes = function(envelopes) { + envelopes.sort((a, b) => a[0] === b[0] ? b[1] - a[1] : a[0] - b[0]) + const stack = [] + for(let e of envelopes) { + if(stack.length === 0 || e[1] > stack[stack.length - 1][1]) { + stack.push(e) + continue + } + let l = 0, r = stack.length - 1 + while(l < r) { + const mid = ~~((l+r)/2) + if(stack[mid][1] < e[1]) { + l = mid + 1 + } else r = mid + } + stack[l] = e + } + return stack.length +}; From 7af9a5537861cffb47a412a60a3b45aee27cd8c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Aug 2021 15:59:57 +0800 Subject: [PATCH 0285/2039] Create 1221-split-a-string-in-balanced-strings.js --- 1221-split-a-string-in-balanced-strings.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1221-split-a-string-in-balanced-strings.js diff --git a/1221-split-a-string-in-balanced-strings.js b/1221-split-a-string-in-balanced-strings.js new file mode 100644 index 00000000..fe5401de --- /dev/null +++ b/1221-split-a-string-in-balanced-strings.js @@ -0,0 +1,12 @@ +/** + * @param {string} s + * @return {number} + */ +const balancedStringSplit = function(s) { + let res = 0, num = 0 + for(let ch of s) { + num += ch === 'L' ? 1 : -1 + if(num === 0) res++ + } + return res +}; From d8312c0fc9968407dd548fcdbd057dae13c4a299 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Aug 2021 16:12:29 +0800 Subject: [PATCH 0286/2039] Create 1360-number-of-days-between-two-dates.js --- 1360-number-of-days-between-two-dates.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 1360-number-of-days-between-two-dates.js diff --git a/1360-number-of-days-between-two-dates.js b/1360-number-of-days-between-two-dates.js new file mode 100644 index 00000000..3c1a019f --- /dev/null +++ b/1360-number-of-days-between-two-dates.js @@ -0,0 +1,10 @@ +/** + * @param {string} date1 + * @param {string} date2 + * @return {number} + */ +const daysBetweenDates = function(date1, date2) { + const d1 = new Date(date1) + const d2 = new Date(date2) + return Math.abs((d1.getTime() - d2.getTime()) / (1000 * 60 * 60 * 24)) +}; From e78a83db37afcc8740d512551699f7be9a010f89 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Aug 2021 21:52:25 +0800 Subject: [PATCH 0287/2039] Update 1982-find-array-given-subset-sums.js --- 1982-find-array-given-subset-sums.js | 48 ++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/1982-find-array-given-subset-sums.js b/1982-find-array-given-subset-sums.js index b1b71020..e9c93661 100644 --- a/1982-find-array-given-subset-sums.js +++ b/1982-find-array-given-subset-sums.js @@ -41,3 +41,51 @@ function bs(arr, e) { return arr[l] === e } + +// another + +/** + * @param {number} n + * @param {number[]} sums + * @return {number[]} + */ +const recoverArray = function(n, sums) { + const res = [] + sums.sort((a, b) => a - b) + + while(res.length < n) { + const visited = Array(sums.length).fill(false) + const a1 = [], a2 = [] + const d = sums[1] - sums[0] + for(let i = 0, j = 1; i < sums.length; i++, j++) { + while(i < sums.length && visited[i]) i++ + if(i === sums.length) break + while(j <= i || sums[j] !== sums[i] + d) j++ + a1.push(sums[i]) + a2.push(sums[j]) + visited[i] = visited[j] = true + } + + if(bs(a1, 0)) { + sums = a1 + res.push(d) + } else { + sums = a2 + res.push(-d) + } + } + + return res +}; + +function bs(arr, val) { + let l = 0, r = arr.length - 1 + while(l < r) { + const mid = ~~((l + r) / 2) + if(arr[mid] < val) l = mid + 1 + else r = mid + } + + return arr[l] === val +} + From 0749af83dede671e42e0c541a2addaaa00748333 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Aug 2021 22:10:19 +0800 Subject: [PATCH 0288/2039] Update 1981-minimize-the-difference-between-target-and-chosen-elements.js --- ...ence-between-target-and-chosen-elements.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1981-minimize-the-difference-between-target-and-chosen-elements.js b/1981-minimize-the-difference-between-target-and-chosen-elements.js index df41deae..f66a42de 100644 --- a/1981-minimize-the-difference-between-target-and-chosen-elements.js +++ b/1981-minimize-the-difference-between-target-and-chosen-elements.js @@ -19,3 +19,29 @@ const minimizeTheDifference = function(mat, target) { } }; +// another + +/** + * @param {number[][]} mat + * @param {number} target + * @return {number} + */ +const minimizeTheDifference = function(mat, target) { + const m = mat.length, n = mat[0].length + const memo = Array.from({ length: m }, () => Array()) + return dfs(0, 0) + + function dfs(row, sum) { + if(row === m) return Math.abs(target - sum) + if(memo[row][sum] != null) return memo[row][sum] + let res = Number.MAX_SAFE_INTEGER + for(let i = 0; i < n; i++) { + res = Math.min(res, dfs(row + 1, sum + mat[row][i])) + } + + return memo[row][sum] = res + } +}; + + + From af3b50a770e82dd82a28705b5fd48859a771fb46 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 Aug 2021 20:26:40 +0800 Subject: [PATCH 0289/2039] Create 1969-minimum-non-zero-product-of-the-array-elements.js --- ...-non-zero-product-of-the-array-elements.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1969-minimum-non-zero-product-of-the-array-elements.js diff --git a/1969-minimum-non-zero-product-of-the-array-elements.js b/1969-minimum-non-zero-product-of-the-array-elements.js new file mode 100644 index 00000000..86883cd5 --- /dev/null +++ b/1969-minimum-non-zero-product-of-the-array-elements.js @@ -0,0 +1,25 @@ +/** + * @param {number} p + * @return {number} + */ +const minNonZeroProduct = function (p) { + const b = BigInt(p) + const mod = BigInt(10 ** 9 + 7) + + return ( + (((BigInt(1n << b) - 1n) % mod) * + pow(BigInt(1n << b) - 2n, BigInt(1n << (b - 1n)) - 1n)) % + mod + ) + + function pow(a, n) { + let r = 1n + a %= mod + while (n > 0n) { + r = (r * a) % mod + a = (a * a) % mod + n /= 2n + } + return r + } +} From d963fbbb7d44874b9ceccf4bd833116cd0832772 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 Aug 2021 21:59:54 +0800 Subject: [PATCH 0290/2039] Update 1969-minimum-non-zero-product-of-the-array-elements.js --- ...-non-zero-product-of-the-array-elements.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1969-minimum-non-zero-product-of-the-array-elements.js b/1969-minimum-non-zero-product-of-the-array-elements.js index 86883cd5..2b29dade 100644 --- a/1969-minimum-non-zero-product-of-the-array-elements.js +++ b/1969-minimum-non-zero-product-of-the-array-elements.js @@ -1,3 +1,27 @@ +/** + * @param {number} p + * @return {number} + */ +const minNonZeroProduct = function (p) { + const MOD = BigInt(10 ** 9 + 7), bp = BigInt(p) + const bpm = BigInt(1n << bp) - 1n, base = BigInt(1n << bp) - 2n, pow = BigInt(1n << (bp - 1n)) - 1n + return Number((bpm % MOD) * fastPow(base, pow, MOD) % MOD) + +} + +function fastPow(base, power, mod) { + if(power === 0n) return 1n + base %= mod + let res = fastPow(base, power / 2n, mod) + res = (res * res) % mod + if(power & 1n) res = (res * base) % mod + return res +} + + +// another + + /** * @param {number} p * @return {number} From a33e9e7b76c08dc947585b5f2a259cd9b97d33fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Aug 2021 09:29:14 +0800 Subject: [PATCH 0291/2039] Create 1970-last-day-where-you-can-still-cross.js --- 1970-last-day-where-you-can-still-cross.js | 66 ++++++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 1970-last-day-where-you-can-still-cross.js diff --git a/1970-last-day-where-you-can-still-cross.js b/1970-last-day-where-you-can-still-cross.js new file mode 100644 index 00000000..4ff89b21 --- /dev/null +++ b/1970-last-day-where-you-can-still-cross.js @@ -0,0 +1,66 @@ +/** + * @param {number} row + * @param {number} col + * @param {number[][]} cells + * @return {number} + */ +const latestDayToCross = function (row, col, cells) { + let l = 0, + n = cells.length, + r = n - 1, + res = 0 + while (l < r) { + const mid = ~~((l + r) / 2) + if (canWalk(mid)) { + l = mid + 1 + res = mid + } else { + r = mid + } + } + + return res + 1 + + function canWalk(mid) { + const grid = Array.from({ length: row }, () => Array(col).fill(0)) + const dirs = [ + [1, 0], + [-1, 0], + [0, 1], + [0, -1], + ] + for (let i = 0; i <= mid; i++) { + const [r, c] = cells[i] + grid[r - 1][c - 1] = 1 + } + + let q = [] + + for (let i = 0; i < col; i++) { + if (grid[0][i] === 0) { + q.push([0, i]) + grid[0][i] = 1 + } + } + + while (q.length) { + const size = q.length, + tmp = [] + for (let i = 0; i < size; i++) { + const [r, c] = q[i] + if (r === row - 1) return true + for (let [dr, dc] of dirs) { + const nr = r + dr, + nc = c + dc + if (nr < 0 || nr >= row || nc < 0 || nc >= col || grid[nr][nc] === 1) + continue + tmp.push([nr, nc]) + grid[nr][nc] = 1 + } + } + q = tmp + } + + return false + } +} From cb7951b7462ef5596466ae42599ad21f3f57bfee Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Aug 2021 10:00:42 +0800 Subject: [PATCH 0292/2039] Update 1970-last-day-where-you-can-still-cross.js --- 1970-last-day-where-you-can-still-cross.js | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/1970-last-day-where-you-can-still-cross.js b/1970-last-day-where-you-can-still-cross.js index 4ff89b21..ed44df6b 100644 --- a/1970-last-day-where-you-can-still-cross.js +++ b/1970-last-day-where-you-can-still-cross.js @@ -7,19 +7,17 @@ const latestDayToCross = function (row, col, cells) { let l = 0, n = cells.length, - r = n - 1, - res = 0 + r = n while (l < r) { const mid = ~~((l + r) / 2) if (canWalk(mid)) { l = mid + 1 - res = mid } else { r = mid } } - return res + 1 + return l function canWalk(mid) { const grid = Array.from({ length: row }, () => Array(col).fill(0)) From 8cc7f5a5c23eb41e4beda8be126e439a88ccf6af Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Aug 2021 21:10:28 +0800 Subject: [PATCH 0293/2039] Create 1636-sort-array-by-increasing-frequency.js --- 1636-sort-array-by-increasing-frequency.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1636-sort-array-by-increasing-frequency.js diff --git a/1636-sort-array-by-increasing-frequency.js b/1636-sort-array-by-increasing-frequency.js new file mode 100644 index 00000000..eee5122f --- /dev/null +++ b/1636-sort-array-by-increasing-frequency.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const frequencySort = function(nums) { + const hash = {} + for(let e of nums) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + nums.sort((a, b) => hash[a] === hash[b] ? b - a : hash[a] - hash[b]) + return nums +}; From d02b194e31bbea35b922cea3a0395525e308975a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Aug 2021 21:52:47 +0800 Subject: [PATCH 0294/2039] Create 1275-find-winner-on-a-tic-tac-toe-game.js --- 1275-find-winner-on-a-tic-tac-toe-game.js | 49 +++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 1275-find-winner-on-a-tic-tac-toe-game.js diff --git a/1275-find-winner-on-a-tic-tac-toe-game.js b/1275-find-winner-on-a-tic-tac-toe-game.js new file mode 100644 index 00000000..8432a481 --- /dev/null +++ b/1275-find-winner-on-a-tic-tac-toe-game.js @@ -0,0 +1,49 @@ +/** + * @param {number[][]} moves + * @return {string} + */ +const tictactoe = function(moves) { + const grid = Array.from({ length: 3 }, () => Array(3).fill('')) + for(let i = 0, n = moves.length; i < n; i++) { + const ch = i % 2 === 0 ? 'X' : 'O' + const [r, c] = moves[i] + grid[r][c] = ch + const res = chk(ch, grid) + if(res) return ch === 'X' ? 'A' : 'B' + } + + return moves.length < 9 ? 'Pending' : 'Draw' +}; + +function chk(ch, grid) { + for(let i = 0; i < 3; i++) { + if( + grid[i][0] === ch && + grid[i][1] === ch && + grid[i][2] === ch + ) return true + } + + for(let i = 0; i < 3; i++) { + if( + grid[0][i] === ch && + grid[1][i] === ch && + grid[2][i] === ch + ) return true + } + + + if( + grid[0][0] === ch && + grid[1][1] === ch && + grid[2][2] === ch + ) return true + + if( + grid[0][2] === ch && + grid[1][1] === ch && + grid[2][0] === ch + ) return true + + return false +} From 339d5389152385d4def1125614e601677819f534 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Aug 2021 22:07:10 +0800 Subject: [PATCH 0295/2039] Update 1275-find-winner-on-a-tic-tac-toe-game.js --- 1275-find-winner-on-a-tic-tac-toe-game.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1275-find-winner-on-a-tic-tac-toe-game.js b/1275-find-winner-on-a-tic-tac-toe-game.js index 8432a481..d6029d14 100644 --- a/1275-find-winner-on-a-tic-tac-toe-game.js +++ b/1275-find-winner-on-a-tic-tac-toe-game.js @@ -47,3 +47,24 @@ function chk(ch, grid) { return false } + +// another + +/** + * @param {number[][]} moves + * @return {string} + */ +const tictactoe = function(moves) { + const aRow = Array(3).fill(0), aCol = Array(3).fill(0), bRow= Array(3).fill(0), bCol =Array(3).fill(0) + let ad = 0, ads = 0, bd = 0, bds = 0 + for(let i = 0; i < moves.length; i++) { + const [r, c] = moves[i] + if(i % 2===0) { + if(++aRow[r] === 3 || ++aCol[c] === 3 || r === c && ++ad === 3 || r + c === 2&& ++ads === 3 ) return 'A' + }else { + if(++bRow[r] === 3 || ++bCol[c] === 3 || r === c && ++bd === 3 || r + c === 2&& ++bds === 3 ) return 'B' + } + } + + return moves.length >= 9 ? 'Draw' : 'Pending' +}; From e9ef8add0a85d3720719b2435d09dec9daa70deb Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Aug 2021 19:44:30 +0800 Subject: [PATCH 0296/2039] Update 803-bricks-falling-when-hit.js --- 803-bricks-falling-when-hit.js | 55 ++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) diff --git a/803-bricks-falling-when-hit.js b/803-bricks-falling-when-hit.js index d2cda611..36c09fe0 100644 --- a/803-bricks-falling-when-hit.js +++ b/803-bricks-falling-when-hit.js @@ -196,3 +196,58 @@ function isConnected(i, j, grid, dirs) { } return false } + +// another + +/** + * @param {number[][]} grid + * @param {number[][]} hits + * @return {number[]} + */ +const hitBricks = function (grid, hits) { + const m = grid.length, + n = grid[0].length, + res = Array(hits.length).fill(0), + dirs = [ + [-1, 0], + [1, 0], + [0, 1], + [0, -1], + ]; + for (let [r, c] of hits) grid[r][c] -= 1; + + for (let i = 0; i < n; i++) dfs(grid, 0, i, m, n, dirs); + + for (let i = hits.length - 1; i >= 0; i--) { + const [r, c] = hits[i]; + grid[r][c] += 1; + if (grid[r][c] === 1 && connected(grid, r, c, m, n, dirs)) { + res[i] = dfs(grid, r, c, m, n, dirs) - 1; + } + } + + return res; +}; + +function dfs(grid, i, j, m, n, dirs) { + if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] !== 1) return 0; + grid[i][j] = 2; + let res = 1; + for (let [dr, dc] of dirs) { + res += dfs(grid, i + dr, j + dc, m, n, dirs); + } + return res; +} + +function connected(grid, i, j, m, n, dirs) { + if (i === 0) return true; + for (let [dr, dc] of dirs) { + const nr = i + dr, + nc = j + dc; + if (nr >= 0 && nr < m && nc >= 0 && nc < n && grid[nr][nc] === 2) + return true; + } + + return false; +} + From ac9328b4aa81cedecdda29ac9f681acb6224e55f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Aug 2021 22:48:07 +0800 Subject: [PATCH 0297/2039] Create 1436-destination-city.js --- 1436-destination-city.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1436-destination-city.js diff --git a/1436-destination-city.js b/1436-destination-city.js new file mode 100644 index 00000000..f9d4d15c --- /dev/null +++ b/1436-destination-city.js @@ -0,0 +1,16 @@ +/** + * @param {string[][]} paths + * @return {string} + */ +const destCity = function(paths) { + const hash = {} + for(let [s, e] of paths) { + if(hash[e] == null) hash[e] = true + hash[s] = false + if(hash[s] === true) hash[s] = false + } + + for(let k in hash) { + if(hash[k]) return k + } +}; From 9f86ed0eb6c6c4b7c079e7d185bbe4b6116b6f49 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Aug 2021 22:51:42 +0800 Subject: [PATCH 0298/2039] Update 1436-destination-city.js --- 1436-destination-city.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/1436-destination-city.js b/1436-destination-city.js index f9d4d15c..18999109 100644 --- a/1436-destination-city.js +++ b/1436-destination-city.js @@ -14,3 +14,17 @@ const destCity = function(paths) { if(hash[k]) return k } }; + +// another + +/** + * @param {string[][]} paths + * @return {string} + */ +const destCity = function(paths) { + const set = new Set() + for(let [s, e] of paths) set.add(e) + for(let [s, e] of paths) set.delete(s) + + return set[Symbol.iterator]().next().value +}; From 9562bfa60ea2a2e1daff18b4a68ec7e87554b27a Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Aug 2021 23:13:52 +0800 Subject: [PATCH 0299/2039] Create 1389-create-target-array-in-the-given-order.js --- 1389-create-target-array-in-the-given-order.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1389-create-target-array-in-the-given-order.js diff --git a/1389-create-target-array-in-the-given-order.js b/1389-create-target-array-in-the-given-order.js new file mode 100644 index 00000000..10b922ec --- /dev/null +++ b/1389-create-target-array-in-the-given-order.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @param {number[]} index + * @return {number[]} + */ +const createTargetArray = function(nums, index) { + const res = [], n = nums.length + for(let i = 0; i < n; i++) { + if(res[index[i]] == null) res[index[i]] = nums[i] + else res.splice(index[i], 0, nums[i]) + + } + + return res +}; From 1a2411a9c75cd1a53fa62649eeca4edb22f49adf Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Aug 2021 23:23:51 +0800 Subject: [PATCH 0300/2039] Create 1413-minimum-value-to-get-positive-step-by-step-sum.js --- ...inimum-value-to-get-positive-step-by-step-sum.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1413-minimum-value-to-get-positive-step-by-step-sum.js diff --git a/1413-minimum-value-to-get-positive-step-by-step-sum.js b/1413-minimum-value-to-get-positive-step-by-step-sum.js new file mode 100644 index 00000000..8eaf024c --- /dev/null +++ b/1413-minimum-value-to-get-positive-step-by-step-sum.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minStartValue = function(nums) { + let sum = 0, min = Infinity + for(let e of nums) { + sum += e + min = Math.min(min, sum) + } + + return min >= 0 ? 1 : -min + 1 +}; From 901a37bcd69f43a41d140f6fb41f833d9290f095 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Aug 2021 23:44:52 +0800 Subject: [PATCH 0301/2039] Create 1313-decompress-run-length-encoded-list.js --- 1313-decompress-run-length-encoded-list.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1313-decompress-run-length-encoded-list.js diff --git a/1313-decompress-run-length-encoded-list.js b/1313-decompress-run-length-encoded-list.js new file mode 100644 index 00000000..95417f5a --- /dev/null +++ b/1313-decompress-run-length-encoded-list.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const decompressRLElist = function(nums) { + const res = [] + for(let i = 0, n = nums.length; i < n - 1; i += 2) { + const [freq, val] = [nums[i], nums[i + 1]] + for(let j = 0; j < freq; j++) res.push(val) + } + + return res +}; From f1f209d916a403cac1a700512b14bac7f58ce01e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Aug 2021 12:02:44 +0800 Subject: [PATCH 0302/2039] Create 1987-number-of-unique-good-subsequences.js --- 1987-number-of-unique-good-subsequences.js | 52 ++++++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 1987-number-of-unique-good-subsequences.js diff --git a/1987-number-of-unique-good-subsequences.js b/1987-number-of-unique-good-subsequences.js new file mode 100644 index 00000000..e2aa2fb4 --- /dev/null +++ b/1987-number-of-unique-good-subsequences.js @@ -0,0 +1,52 @@ +/** + * @param {string} binary + * @return {number} + */ +const numberOfUniqueGoodSubsequences = function (binary) { + const n = binary.length, + P = 1e9 + 7 + let first1Position = -1, + first0Position = -1 + for (let i = 0; i < binary.length; i++) { + if (binary[i] === '0' && first0Position == -1) { + first0Position = i + } + if (binary[i] === '1' && first1Position == -1) { + first1Position = i + } + if(first0Position !== -1 && first1Position !== -1) break + } + if (first1Position === -1) return 1 + if (first0Position === -1) return n + + const next0 = new Array(n).fill(0) + const next1 = new Array(n).fill(0) + let nextZero = -1, + nextOne = -1 + for (let i = binary.length - 1; i >= 0; i--) { + next0[i] = nextZero + next1[i] = nextOne + if (binary[i] === '0') { + nextZero = i + } else { + nextOne = i + } + } + const dp = new Array(n).fill(-1) + return (1 + fn(first1Position)) % P + + function fn(index) { + if (index == n) return 0 + if (dp[index] !== -1) return dp[index] + let result = 1 + if (next0[index] >= 0) { + result += fn(next0[index]) + result %= P + } + if (next1[index] >= 0) { + result += fn(next1[index]) + result %= P + } + return (dp[index] = result) + } +} From 29ab25a2b987815af8e46cc2be1deeb19267405e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Aug 2021 12:03:19 +0800 Subject: [PATCH 0303/2039] Create 1986-minimum-number-of-work-sessions-to-finish-the-tasks.js --- ...er-of-work-sessions-to-finish-the-tasks.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 1986-minimum-number-of-work-sessions-to-finish-the-tasks.js diff --git a/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js b/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js new file mode 100644 index 00000000..e3e4b07a --- /dev/null +++ b/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} tasks + * @param {number} sessionTime + * @return {number} + */ +const minSessions = function(tasks, sessionTime) { + const n = tasks.length + const dp = Array.from({ length: 1 << 14 }, () => Array(16).fill(-1)) + return fn(0, 0) + + function fn(mask, consumed) { + if (mask === (1 << n) - 1) { + return consumed === 0 ? 0 : 1 + } + if (dp[mask][consumed] !== -1) { + return dp[mask][consumed]; + } + + let result = Number.MAX_VALUE; + if (consumed > 0) { + result = Math.min(result, 1 + fn(mask, 0)); + } + for (let i = 0; i < n; i++) { + if ((mask & (1 << i)) === 0 && consumed + tasks[i] <= sessionTime) { + result = Math.min(result, fn(mask | (1 << i), consumed + tasks[i])); + } + } + return dp[mask][consumed] = result; + } +}; From f89ee0ee0e282d28cbd8d828235f04966e47e36a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Aug 2021 12:03:56 +0800 Subject: [PATCH 0304/2039] Create 1985-find-the-kth-largest-integer-in-the-array.js --- 1985-find-the-kth-largest-integer-in-the-array.js | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 1985-find-the-kth-largest-integer-in-the-array.js diff --git a/1985-find-the-kth-largest-integer-in-the-array.js b/1985-find-the-kth-largest-integer-in-the-array.js new file mode 100644 index 00000000..3b542d53 --- /dev/null +++ b/1985-find-the-kth-largest-integer-in-the-array.js @@ -0,0 +1,9 @@ +/** + * @param {string[]} nums + * @param {number} k + * @return {string} + */ +const kthLargestNumber = function(nums, k) { + nums.sort((a, b) => BigInt(b) - BigInt(a) === 0n ? 0 : (BigInt(b) - BigInt(a) > 0n ? 1 : -1) ) + return nums[k - 1] +}; From c0bd9e10e91392e0c859c0d7d43867e5a7d49c6c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Aug 2021 12:04:26 +0800 Subject: [PATCH 0305/2039] Create 1984-minimum-difference-between-highest-and-lowest-of-k-scores.js --- ...ence-between-highest-and-lowest-of-k-scores.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1984-minimum-difference-between-highest-and-lowest-of-k-scores.js diff --git a/1984-minimum-difference-between-highest-and-lowest-of-k-scores.js b/1984-minimum-difference-between-highest-and-lowest-of-k-scores.js new file mode 100644 index 00000000..fb38f96a --- /dev/null +++ b/1984-minimum-difference-between-highest-and-lowest-of-k-scores.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minimumDifference = function(nums, k) { + nums.sort((a, b) => a - b) + let res = Infinity + for(let i = 0, n = nums.length; i < n - k + 1; i++) { + res = Math.min(res, nums[i + k - 1] - nums[i]) + } + + return res + +}; From 2e6f0f2042afaf76421708a6f671d15f087a3da1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Aug 2021 21:22:44 +0800 Subject: [PATCH 0306/2039] Update 1987-number-of-unique-good-subsequences.js --- 1987-number-of-unique-good-subsequences.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/1987-number-of-unique-good-subsequences.js b/1987-number-of-unique-good-subsequences.js index e2aa2fb4..9cc21f0f 100644 --- a/1987-number-of-unique-good-subsequences.js +++ b/1987-number-of-unique-good-subsequences.js @@ -50,3 +50,25 @@ const numberOfUniqueGoodSubsequences = function (binary) { return (dp[index] = result) } } + +// another + +/** + * @param {string} binary + * @return {number} + */ +const numberOfUniqueGoodSubsequences = function (binary) { + const n = binary.length, + mod = 1e9 + 7 + let hasZero = 0, ends1 = 0, ends0 = 0 + for(let ch of binary) { + if(ch === '1') { + ends1 = (ends1 + ends0 + 1) % mod + } else { + ends0 = (ends1 + ends0) % mod + hasZero = 1 + } + } + return (ends1 + ends0 + hasZero) % mod +} + From 80552c5ff923485227b68480fe55ad7ac31b08a5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 30 Aug 2021 09:27:30 +0800 Subject: [PATCH 0307/2039] Update 647-palindromic-substrings.js --- 647-palindromic-substrings.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/647-palindromic-substrings.js b/647-palindromic-substrings.js index 177cd7b5..ebf640e7 100755 --- a/647-palindromic-substrings.js +++ b/647-palindromic-substrings.js @@ -30,3 +30,35 @@ const countSubstrings = function(s) { console.log(countSubstrings("abc")); console.log(countSubstrings("aaa")); + +// another + +/** + * @param {string} s + * @return {number} + */ +const countSubstrings = function(s) { + const arr = manachers(s) + return arr.map(e => ~~((e + 1) / 2)).reduce((ac, e) => ac + e, 0) +}; + +function manachers(s) { + const str = `@#${s.split('').join('#')}#$` + const arr = Array(str.length).fill(0) + + let center = right = 0 + for(let i = 1, n = str.length; i < n - 1; i++) { + if(i < right) { + arr[i] = Math.min(right - i, arr[2 * center - i]) + } + while(str[i + arr[i] + 1] === str[i - arr[i] - 1]) { + arr[i] += 1 + } + if(i + arr[i] > right) { + center = i + right = i + arr[i] + } + } + + return arr +} From c1dd84ac4882c170c85603f7f001f5de1aa6a5e0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 30 Aug 2021 19:41:45 +0800 Subject: [PATCH 0308/2039] Create 1960-maximum-product-of-the-length-of-two-palindromic-substrings.js --- ...he-length-of-two-palindromic-substrings.js | 59 +++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 1960-maximum-product-of-the-length-of-two-palindromic-substrings.js diff --git a/1960-maximum-product-of-the-length-of-two-palindromic-substrings.js b/1960-maximum-product-of-the-length-of-two-palindromic-substrings.js new file mode 100644 index 00000000..7651f1eb --- /dev/null +++ b/1960-maximum-product-of-the-length-of-two-palindromic-substrings.js @@ -0,0 +1,59 @@ +/** + * @param {string} s + * @return {number} + */ +const maxProduct = function (s) { + const t1 = helper(s), + t2 = helper(reverse(s)) + let res = 0 + for (let n = s.length, i = 0, j = n - 2; i < n - 1; ++i, --j) + res = Math.max(res, t1[i] * t2[j]) + + return res +} +function reverse(s) { + return [...s].reverse().join('') +} +function helper(s) { + const man = manachers(s).filter( + (e, i, ar) => i >= 2 && i < ar.length - 2 && i % 2 === 0 + ) + const n = s.length, + { max } = Math + const ints = man.map((e, i) => [i - ~~(e / 2), i + ~~(e / 2)]) + const arr = Array(n).fill(0) + for (const [a, b] of ints) { + arr[b] = max(arr[b], b - a + 1) + } + for (let i = n - 2; i >= 0; i--) { + arr[i] = max(arr[i], arr[i + 1] - 2) + } + let tmp = 0 + for (let i = 0; i < n; i++) { + if (arr[i] > tmp) { + tmp = arr[i] + } else arr[i] = tmp + } + return arr +} +function manachers(s) { + const str = `@#${s.split('').join('#')}#$` + const arr = Array(str.length).fill(0) + + let center = 0, + right = 0 + for (let i = 1, n = str.length; i < n - 1; i++) { + if (i < right) { + arr[i] = Math.min(right - i, arr[2 * center - i]) + } + while (str[i + arr[i] + 1] === str[i - arr[i] - 1]) { + arr[i] += 1 + } + if (i + arr[i] > right) { + center = i + right = i + arr[i] + } + } + + return arr +} From 22605ba5994135c42d7f88734b6abb1c83a8c0dc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 31 Aug 2021 10:07:15 +0800 Subject: [PATCH 0309/2039] Update 214-shortest-palindrome.js --- 214-shortest-palindrome.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/214-shortest-palindrome.js b/214-shortest-palindrome.js index fce3267e..a278095f 100644 --- a/214-shortest-palindrome.js +++ b/214-shortest-palindrome.js @@ -50,3 +50,37 @@ function getFail(s) { return table } +// another + +/** + * @param {string} s + * @return {string} + */ +const shortestPalindrome = function(s) { + const tmp = `${s}#${reverse(s)}` + const table = kmp(tmp) + return `${reverse(s.slice(table[table.length - 1]))}${s}` +}; +function reverse(str) { + return [...str].reverse().join('') +} + +function kmp(s) { + const n = s.length, table = Array(n).fill(0) + let idx = 0 + for(let i = 1; i < n; ) { + if(s[i] === s[idx]) { + idx++ + table[i] = idx + i++ + } else { + if(idx > 0) { + idx = table[idx - 1] + } else { + idx = 0 + i++ + } + } + } + return table +} From aaf193604fe9606ab56376c9adda2d27c66a32cd Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 1 Sep 2021 19:56:51 +0800 Subject: [PATCH 0310/2039] Create 1976-number-of-ways-to-arrive-at-destination.js --- ...number-of-ways-to-arrive-at-destination.js | 111 ++++++++++++++++++ 1 file changed, 111 insertions(+) create mode 100644 1976-number-of-ways-to-arrive-at-destination.js diff --git a/1976-number-of-ways-to-arrive-at-destination.js b/1976-number-of-ways-to-arrive-at-destination.js new file mode 100644 index 00000000..b6015baa --- /dev/null +++ b/1976-number-of-ways-to-arrive-at-destination.js @@ -0,0 +1,111 @@ +/** + * @param {number} n + * @param {number[][]} roads + * @return {number} + */ +const countPaths = function(n, roads) { + const graph = {} + for(let r of roads) { + const [u, v, t] = r + if(graph[u] == null) graph[u] = [] + if(graph[v] == null) graph[v] = [] + graph[u].push([v, t]) + graph[v].push([u, t]) + } + + return dijkstra(graph, n, 0) + + function dijkstra(graph, n, src) { + const dist = Array(n).fill(Infinity) + const ways = Array(n).fill(0), mod = 1e9 + 7 + ways[src] = 1 + dist[src] = 0 + const pq = new PriorityQueue((a, b) => a[0] === b[0] ? a[1] < b[1] : a[0] < b[0]) + pq.push([0, 0]) + while(!pq.isEmpty()) { + const [d, u] = pq.pop() + if(d > dist[u]) continue + if(graph[u] == null) graph[u] = [] + for(const [v, time] of graph[u]) { + if(dist[v] > d + time) { + ways[v] = ways[u] + dist[v] = d + time + pq.push([dist[v], v]) + } else if(dist[v] === d + time) { + ways[v] = (ways[v] + ways[u]) % mod + } + } + } + return ways[n - 1] + } + +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + From 4ccc737e0870bb0215064c1fe69ff4cedf768c83 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Sep 2021 11:02:25 +0800 Subject: [PATCH 0311/2039] Create 1977-number-of-ways-to-separate-numbers.js --- 1977-number-of-ways-to-separate-numbers.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1977-number-of-ways-to-separate-numbers.js diff --git a/1977-number-of-ways-to-separate-numbers.js b/1977-number-of-ways-to-separate-numbers.js new file mode 100644 index 00000000..71a4a134 --- /dev/null +++ b/1977-number-of-ways-to-separate-numbers.js @@ -0,0 +1,21 @@ +function numberOfCombinations( num) { + let dp = Array(3501).fill(0), dpp=Array(3501).fill(0), pf=Array(3501).fill(0), n = num.length, mod = 1000000007; + for (let l = 1; l <= n; ++l) { + dpp[0] = 1; + for (let i = n; i - l > 0; --i) + pf[i - 1] = num[i - 1 - l] == num[i - 1] ? pf[i] + 1 : 0; + for (let i = 0; i < n; ++i) { + dp[i + 1] = dpp[i + 1]; + if (l <= i + 1 && num[i + 1 - l] != '0') { + if (i + 1 - 2 * l >= 0 && (pf[i + 1 - l] >= l || num[i + 1 - l + pf[i + 1 - l]] > num[i + 1 - 2 * l + pf[i + 1 - l]])) + dp[i + 1] = (dp[i + 1] + dp[i + 1 - l]) % mod; + else + dp[i + 1] = (dp[i + 1] + dpp[i + 1 - l]) % mod; + } + } + let tmp = dpp + dpp = dp + dp = tmp + } + return dpp[n]; +} From 4ef906fb8f51682bf9df1bee0a1fd73b9909fa29 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Sep 2021 19:57:26 +0800 Subject: [PATCH 0312/2039] Update 1977-number-of-ways-to-separate-numbers.js --- 1977-number-of-ways-to-separate-numbers.js | 47 +++++++++++++--------- 1 file changed, 29 insertions(+), 18 deletions(-) diff --git a/1977-number-of-ways-to-separate-numbers.js b/1977-number-of-ways-to-separate-numbers.js index 71a4a134..a9e2226b 100644 --- a/1977-number-of-ways-to-separate-numbers.js +++ b/1977-number-of-ways-to-separate-numbers.js @@ -1,21 +1,32 @@ -function numberOfCombinations( num) { - let dp = Array(3501).fill(0), dpp=Array(3501).fill(0), pf=Array(3501).fill(0), n = num.length, mod = 1000000007; +/** + * @param {string} num + * @return {number} + */ +function numberOfCombinations(num) { + let dpArr = Array(3501).fill(0), + dp = Array(3501).fill(0), + prefix = Array(3501).fill(0), + n = num.length, + mod = 1e9 + 7 for (let l = 1; l <= n; ++l) { - dpp[0] = 1; - for (let i = n; i - l > 0; --i) - pf[i - 1] = num[i - 1 - l] == num[i - 1] ? pf[i] + 1 : 0; - for (let i = 0; i < n; ++i) { - dp[i + 1] = dpp[i + 1]; - if (l <= i + 1 && num[i + 1 - l] != '0') { - if (i + 1 - 2 * l >= 0 && (pf[i + 1 - l] >= l || num[i + 1 - l + pf[i + 1 - l]] > num[i + 1 - 2 * l + pf[i + 1 - l]])) - dp[i + 1] = (dp[i + 1] + dp[i + 1 - l]) % mod; - else - dp[i + 1] = (dp[i + 1] + dpp[i + 1 - l]) % mod; - } + dp[0] = 1 + for (let i = n; i - l > 0; --i) + prefix[i - 1] = num[i - 1 - l] === num[i - 1] ? prefix[i] + 1 : 0 + for (let i = 0; i < n; ++i) { + dpArr[i + 1] = dp[i + 1] + if (l <= i + 1 && num[i + 1 - l] != '0') { + if ( + i + 1 - 2 * l >= 0 && + (prefix[i + 1 - l] >= l || + num[i + 1 - l + prefix[i + 1 - l]] > num[i + 1 - 2 * l + prefix[i + 1 - l]]) + ) + dpArr[i + 1] = (dpArr[i + 1] + dpArr[i + 1 - l]) % mod + else dpArr[i + 1] = (dpArr[i + 1] + dp[i + 1 - l]) % mod } - let tmp = dpp - dpp = dp - dp = tmp - } - return dpp[n]; + } + const tmp = dp + dp = dpArr + dpArr = tmp + } + return dp[n] } From 89bacef77120b2e70d35d8cb8d5dedf6e2a29cf4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Sep 2021 08:30:43 +0800 Subject: [PATCH 0313/2039] Create 1385-find-the-distance-value-between-two-arrays.js --- ...d-the-distance-value-between-two-arrays.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1385-find-the-distance-value-between-two-arrays.js diff --git a/1385-find-the-distance-value-between-two-arrays.js b/1385-find-the-distance-value-between-two-arrays.js new file mode 100644 index 00000000..0e2d726a --- /dev/null +++ b/1385-find-the-distance-value-between-two-arrays.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @param {number} d + * @return {number} + */ +const findTheDistanceValue = function(arr1, arr2, d) { + let res = 0 + for(let i = 0, m = arr1.length; i < m; i++) { + let tmp = false, cur = arr1[i] + for(let j = 0, n = arr2.length; j < n; j++) { + if(Math.abs(cur - arr2[j]) <= d) { + tmp = true + break + } + } + if(!tmp) res++ + } + + return res +}; From 05d394c230e9e8a7f82292bfe500afccf3b1948b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Sep 2021 08:48:02 +0800 Subject: [PATCH 0314/2039] Create 1475-final-prices-with-a-special-discount-in-a-shop.js --- ...rices-with-a-special-discount-in-a-shop.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1475-final-prices-with-a-special-discount-in-a-shop.js diff --git a/1475-final-prices-with-a-special-discount-in-a-shop.js b/1475-final-prices-with-a-special-discount-in-a-shop.js new file mode 100644 index 00000000..55eb5749 --- /dev/null +++ b/1475-final-prices-with-a-special-discount-in-a-shop.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} prices + * @return {number[]} + */ +const finalPrices = function(prices) { + const res = [], n = prices.length + for(let i = 0; i < n; i++) { + const cur = prices[i] + let dis = null + for(let j = i + 1; j < n; j++) { + if(prices[j] <= cur) { + dis = prices[j] + break + } + } + res.push(dis == null ? cur : cur - dis) + } + return res +}; From 5a3d816ca5a191f134745668d4bcfe8a37776ab0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Sep 2021 18:30:03 +0800 Subject: [PATCH 0315/2039] Create 1995-count-special-quadruplets.js --- 1995-count-special-quadruplets.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1995-count-special-quadruplets.js diff --git a/1995-count-special-quadruplets.js b/1995-count-special-quadruplets.js new file mode 100644 index 00000000..419f45f2 --- /dev/null +++ b/1995-count-special-quadruplets.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countQuadruplets = function(nums) { + let res = 0 + for(let a = 0, n = nums.length; a < n - 3; a++) { + for(let b = a + 1; b < n - 2; b++) { + for(let c = b + 1; c < n - 1; c++) { + for(let d = c + 1; d < n; d++) { + if(nums[a] + nums[b] + nums[c] === nums[d]) res++ + } + } + } + } + + + return res + +}; From 7a7306bd76bb95a6d4cd64932768871f3f0dfe05 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Sep 2021 18:30:41 +0800 Subject: [PATCH 0316/2039] Create 1996-the-number-of-weak-characters-in-the-game.js --- ...e-number-of-weak-characters-in-the-game.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1996-the-number-of-weak-characters-in-the-game.js diff --git a/1996-the-number-of-weak-characters-in-the-game.js b/1996-the-number-of-weak-characters-in-the-game.js new file mode 100644 index 00000000..a68458a7 --- /dev/null +++ b/1996-the-number-of-weak-characters-in-the-game.js @@ -0,0 +1,25 @@ +/** + * @param {number[][]} properties + * @return {number} + */ +const numberOfWeakCharacters = function(properties) { + if (properties == null || properties.length == 0) { + return 0; + } + properties.sort((o1, o2) => { + if (o1[0] == o2[0]) { + return o1[1] - o2[1]; + } + return o1[0] - o2[0]; + }); + const { max } = Math + let mmax = Array(1e5 + 10).fill( 0); + let ans = 0; + let n = properties.length; + for (let i = n - 1; i >= 0; i--) mmax[properties[i][0]] = max(properties[i][1], mmax[properties[i][0]]); + for (let i = 1e5; i >= 1; i--) mmax[i] = max(mmax[i], mmax[i + 1]); + for (let i = 0; i < n; i++) { + if (mmax[properties[i][0] + 1] > properties[i][1]) ans++; + } + return ans; +}; From 07960056163855686f2a900c05220a604060c74e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Sep 2021 18:31:34 +0800 Subject: [PATCH 0317/2039] Create 1997-first-day-where-you-have-been-in-all-the-rooms.js --- ...day-where-you-have-been-in-all-the-rooms.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1997-first-day-where-you-have-been-in-all-the-rooms.js diff --git a/1997-first-day-where-you-have-been-in-all-the-rooms.js b/1997-first-day-where-you-have-been-in-all-the-rooms.js new file mode 100644 index 00000000..815c676c --- /dev/null +++ b/1997-first-day-where-you-have-been-in-all-the-rooms.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nextVisit + * @return {number} + */ +const firstDayBeenInAllRooms = function(nextVisit) { + const P = 1e9+7; + const n = nextVisit.length; + const f = Array(n).fill(0) ; + f[0] = 0; + + for (let i = 1; i < n; i++) { + f[i] = (( + (2 * f[i - 1]) % P + + P - f[nextVisit[i - 1]]) % P + 2) % P; + } + + return f[n - 1]; +}; From 2817bfe21782d06c2aa6cb9b3d44c37ca3ec9704 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Sep 2021 18:32:08 +0800 Subject: [PATCH 0318/2039] Create 1998-gcd-sort-of-an-array.js --- 1998-gcd-sort-of-an-array.js | 66 ++++++++++++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 1998-gcd-sort-of-an-array.js diff --git a/1998-gcd-sort-of-an-array.js b/1998-gcd-sort-of-an-array.js new file mode 100644 index 00000000..55c9526d --- /dev/null +++ b/1998-gcd-sort-of-an-array.js @@ -0,0 +1,66 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +const gcdSort = function(nums) { + const spf = Array(nums.length).fill(0) + let maxNum = Math.max(...nums); + sieve(maxNum); + + const uf = new UnionFind(maxNum+1); + for (let x of nums) { + for (let f of getFactors(x)) uf.union(f, x); + } + + + const sortedArr = nums.slice(); + sortedArr.sort((a, b) => a - b) + + for (let i = 0; i < nums.length; ++i) { + let pu = uf.find(sortedArr[i]); + let pv = uf.find(nums[i]); + if (pu != pv) return false; // can't swap nums[i] with sortedArr[i] + } + return true; + + function sieve( n) { // O(Nlog(logN)) ~ O(N) + for (let i = 2; i <= n; ++i) spf[i] = i; + for (let i = 2; i * i <= n; i++) { + if (spf[i] != i) continue; // skip if `i` is not a prime number + for (let j = i * i; j <= n; j += i) { + if (spf[j] == j) { // marking spf[j] if it is not previously marked + spf[j] = i; + } + } + } + } + + function getFactors(n) { // O(logN) + const factors = []; + while (n > 1) { + factors.push(spf[n]); + n = ~~(n /spf[n]); + } + return factors; + } +}; + +function gcd( x, y) { + return y == 0 ? x : gcd(y, x % y); +} + +class UnionFind { + constructor(n) { + this.parent = []; + for (let i = 0; i < n; i++) this.parent[i] = i; + } + find(x) { + if (x == this.parent[x]) return x; + return this.parent[x] = this.find(this.parent[x]); // Path compression + } + union( u, v) { + let pu = this.find(u), pv = this.find(v); + if (pu != pv) this.parent[pu] = pv; + } +}; + From e32d4a6e6426b7cc94176fd3824d985a54ca4aed Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Sep 2021 20:55:25 +0800 Subject: [PATCH 0319/2039] Create 1757-recyclable-and-low-fat-products.sql --- 1757-recyclable-and-low-fat-products.sql | 2 ++ 1 file changed, 2 insertions(+) create mode 100644 1757-recyclable-and-low-fat-products.sql diff --git a/1757-recyclable-and-low-fat-products.sql b/1757-recyclable-and-low-fat-products.sql new file mode 100644 index 00000000..cec82c14 --- /dev/null +++ b/1757-recyclable-and-low-fat-products.sql @@ -0,0 +1,2 @@ +# Write your MySQL query statement below +SELECT product_id FROM Products WHERE low_fats = 'Y' AND recyclable = 'Y' ORDER BY 1 ASC; From 64ee05e7e30de5e91269d85b5efca3a35441e242 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Sep 2021 21:04:35 +0800 Subject: [PATCH 0320/2039] Create 1380-lucky-numbers-in-a-matrix.js --- 1380-lucky-numbers-in-a-matrix.js | 32 +++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 1380-lucky-numbers-in-a-matrix.js diff --git a/1380-lucky-numbers-in-a-matrix.js b/1380-lucky-numbers-in-a-matrix.js new file mode 100644 index 00000000..65055f5e --- /dev/null +++ b/1380-lucky-numbers-in-a-matrix.js @@ -0,0 +1,32 @@ +/** + * @param {number[][]} matrix + * @return {number[]} + */ +const luckyNumbers = function(matrix) { + const m = matrix.length, n = matrix[0].length + const res = [] + for(let i = 0; i < m; i++) { + let tmp = [i, 0, matrix[i][0]] + for(let j = 1; j < n; j++) { + if(matrix[i][j] < tmp[2]) { + tmp = [i, j, matrix[i][j]] + } + } + res.push(tmp) + } + + const ans = [] + for(let [r, c, v] of res) { + let found = false + for(let i = 0; i < m; i++) { + if(i !== r && matrix[i][c] > v) { + found = true + break + } + } + + if(found === false) ans.push(v) + } + + return ans +}; From 894a06434d963031bb68d5fa43f4704cf3f5fc4d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Sep 2021 21:36:47 +0800 Subject: [PATCH 0321/2039] Create 1576-replace-all-s-to-avoid-consecutive-repeating-characters.js --- ...-avoid-consecutive-repeating-characters.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 1576-replace-all-s-to-avoid-consecutive-repeating-characters.js diff --git a/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js b/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js new file mode 100644 index 00000000..b6c76f9b --- /dev/null +++ b/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js @@ -0,0 +1,27 @@ +/** + * @param {string} s + * @return {string} + */ +const modifyString = function(s) { + const arr = s.split('') + for(let i = 0, n = s.length; i < n; i++) { + const cur = arr[i] + if(cur === '?') { + for(let j = 0, a = 'a'.charCodeAt(0); j < 26; j++) { + const ch = String.fromCharCode(a + j) + if( + n === 1 || + (i === 0 && i < n - 1 && ch !== arr[i + 1]) || + (i > 0 && ch !== arr[i - 1] && i < n - 1 && ch !== arr[i + 1]) || + (i=== n -1 && i - 1 >= 0 && ch !== arr[i - 1]) + ) { + + arr[i] = ch + break + } + } + } + } + + return arr.join('') +}; From bd9e4f991f262548f7ef8a279bc305ced3c3fe74 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Sep 2021 21:42:10 +0800 Subject: [PATCH 0322/2039] Update 1576-replace-all-s-to-avoid-consecutive-repeating-characters.js --- ...-avoid-consecutive-repeating-characters.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js b/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js index b6c76f9b..51a743c9 100644 --- a/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js +++ b/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js @@ -25,3 +25,32 @@ const modifyString = function(s) { return arr.join('') }; + + +// another + +/** + * @param {string} s + * @return {string} + */ +const modifyString = function(s) { + const arr = s.split('') + for(let i = 0, n = s.length; i < n; i++) { + const cur = arr[i] + if(cur === '?') { + for(let j = 0, a = 'a'.charCodeAt(0); j < 26; j++) { + const ch = String.fromCharCode(a + j) + if( + (i === 0 || arr[i - 1] !== ch) && + (i === n - 1 || arr[i + 1] !== ch) + ) { + + arr[i] = ch + break + } + } + } + } + + return arr.join('') +}; From 8e9e2646f1c46cdd4927af182312e80133d8fa52 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Sep 2021 21:33:33 +0800 Subject: [PATCH 0323/2039] Update 1655-distribute-repeating-integers.js --- 1655-distribute-repeating-integers.js | 41 +++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/1655-distribute-repeating-integers.js b/1655-distribute-repeating-integers.js index 8a7b0120..a7d7c2c5 100644 --- a/1655-distribute-repeating-integers.js +++ b/1655-distribute-repeating-integers.js @@ -70,3 +70,44 @@ const canDistribute = function (nums, quantity) { return (dp[idx][mask] = ans) } } + +// another + +/** + * @param {number[]} nums + * @param {number[]} quantity + * @return {boolean} + */ +const canDistribute = function(nums, quantity) { + const freq = {} + for(let e of nums) freq[e] = (freq[e] || 0) + 1 + const fArr = Object.values(freq) + + const m = quantity.length, n = fArr.length + const dp = Array.from({ length: n }, () => Array(1 << m).fill(-1)) + + return solve(0, 0) + + function solve(idx, mask) { + if(mask === (1 << m) - 1) return 1 + if(idx === n) return 0 + if(dp[idx][mask] !== -1) return dp[idx][mask] + + let res = solve(idx + 1, mask) + for(let i = 0; i < (1 << m); i++) { + if(mask !== (mask & i)) continue + let tmp = mask + let sum = 0 + for(let j = 0; j < m; j++) { + if(mask & (1 << j)) continue + if(i & (1 << j)) { + sum += quantity[j] + tmp |= (1 << j) + } + } + if(sum <= fArr[idx]) res |= solve(idx + 1, tmp) + } + + return dp[idx][mask] = res + } +}; From cfa4ebc50e7e7755f5685fc7df89d2b05db7582a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Sep 2021 19:26:35 +0800 Subject: [PATCH 0324/2039] Update 940-distinct-subsequences-ii.js --- 940-distinct-subsequences-ii.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/940-distinct-subsequences-ii.js b/940-distinct-subsequences-ii.js index ba309c5a..723acd12 100644 --- a/940-distinct-subsequences-ii.js +++ b/940-distinct-subsequences-ii.js @@ -1,3 +1,25 @@ +/** + * @param {string} s + * @return {number} + */ +const distinctSubseqII = function(s) { + const n = s.length, + dp = Array(26).fill(0), + a = 'a'.charCodeAt(0), + mod = 1e9 + 7 + let res = 0 + for(let ch of s) { + const idx = ch.charCodeAt(0) - a + let tmp = 0 + for(let i = 0; i < 26; i++) tmp = (tmp + dp[i]) % mod + tmp = (tmp + 1) % mod + dp[idx] = tmp + } + return dp.reduce((ac, e) => (ac + e) % mod, 0) +}; + +// another + /** * @param {string} S * @return {number} From a394e51d269c4100d608f815785b273d2c76e692 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 10 Sep 2021 10:47:29 +0800 Subject: [PATCH 0325/2039] Create 1994-the-number-of-good-subsets.js --- 1994-the-number-of-good-subsets.js | 94 ++++++++++++++++++++++++++++++ 1 file changed, 94 insertions(+) create mode 100644 1994-the-number-of-good-subsets.js diff --git a/1994-the-number-of-good-subsets.js b/1994-the-number-of-good-subsets.js new file mode 100644 index 00000000..8ca7236d --- /dev/null +++ b/1994-the-number-of-good-subsets.js @@ -0,0 +1,94 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const numberOfGoodSubsets = function (nums) { + const primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] + const n = nums.length, + cnt = {}, + mod = BigInt(1e9 + 7) + const bm = [] + for (let num of nums) { + cnt[num] = (cnt[num] || 0n) + 1n + } + for (let i = 0; i < 31; i++) { + let tmp = 0 + for (let j = 0, m = primes.length; j < m; j++) { + const p = primes[j] + if (i % p === 0) tmp += 1 << j + } + bm[i] = tmp + } + const bad = new Set([4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28]) + const memo = {} + + function dp(mask, num) { + if (num === 1) return 1n + if (memo[mask] && memo[mask][num] != null) return memo[mask][num] + let res = dp(mask, num - 1) + if (!bad.has(num) && (mask | bm[num]) === mask) { + res += dp(mask ^ bm[num], num - 1) * (cnt[num] || 0n) + } + if (memo[mask] == null) memo[mask] = {} + return (memo[mask][num] = res % mod) + } + + return ((dp(1023, 30) - 1n) * pow(2n, cnt[1] || 0n, mod)) % mod +} + +function pow(base, exp, mod) { + if (exp === 0n) return 1n + // console.log(base, mod) + base %= mod + let res = pow(base, exp / 2n, mod) + res = (res * res) % mod + if (exp & 1n) res = (res * base) % mod + return res +} +/** + * @param {number[]} nums + * @return {number} + */ +const numberOfGoodSubsets = function (nums) { + const primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] + const n = nums.length, + cnt = {}, + mod = BigInt(1e9 + 7) + const bm = [] + for (let num of nums) { + cnt[num] = (cnt[num] || 0n) + 1n + } + for (let i = 0; i < 31; i++) { + let tmp = 0 + for (let j = 0, m = primes.length; j < m; j++) { + const p = primes[j] + if (i % p === 0) tmp += 1 << j + } + bm[i] = tmp + } + const bad = new Set([4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28]) + const memo = {} + + function dp(mask, num) { + if (num === 1) return 1n + if (memo[mask] && memo[mask][num] != null) return memo[mask][num] + let res = dp(mask, num - 1) + if (!bad.has(num) && (mask | bm[num]) === mask) { + res += dp(mask ^ bm[num], num - 1) * (cnt[num] || 0n) + } + if (memo[mask] == null) memo[mask] = {} + return (memo[mask][num] = res % mod) + } + + return ((dp(1023, 30) - 1n) * pow(2n, cnt[1] || 0n, mod)) % mod +} + +function pow(base, exp, mod) { + if (exp === 0n) return 1n + // console.log(base, mod) + base %= mod + let res = pow(base, exp / 2n, mod) + res = (res * res) % mod + if (exp & 1n) res = (res * base) % mod + return res +} From 436d514b966ae8431971d1eae5bd537caa36d12c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 11 Sep 2021 11:17:27 +0800 Subject: [PATCH 0326/2039] Update 1996-the-number-of-weak-characters-in-the-game.js --- ...he-number-of-weak-characters-in-the-game.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/1996-the-number-of-weak-characters-in-the-game.js b/1996-the-number-of-weak-characters-in-the-game.js index a68458a7..631ae293 100644 --- a/1996-the-number-of-weak-characters-in-the-game.js +++ b/1996-the-number-of-weak-characters-in-the-game.js @@ -23,3 +23,21 @@ const numberOfWeakCharacters = function(properties) { } return ans; }; + +// another + +/** + * @param {number[][]} properties + * @return {number} + */ +const numberOfWeakCharacters = function(properties) { + properties.sort((a, b) => a[0] === b[0] ? b[1] - a[1] : a[0] - b[0]) + let max = -Infinity, res = 0 + for(let n = properties.length, i = n - 1; i >= 0; i--) { + const [a, d] = properties[i] + if(d < max) res++ + max = Math.max(max, d) + } + + return res +}; From a3aa4bbf5f58c39c024f630766b2f66bae15f0e1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 11 Sep 2021 11:38:27 +0800 Subject: [PATCH 0327/2039] Update 1996-the-number-of-weak-characters-in-the-game.js --- ...e-number-of-weak-characters-in-the-game.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1996-the-number-of-weak-characters-in-the-game.js b/1996-the-number-of-weak-characters-in-the-game.js index 631ae293..e5ea1f78 100644 --- a/1996-the-number-of-weak-characters-in-the-game.js +++ b/1996-the-number-of-weak-characters-in-the-game.js @@ -1,3 +1,24 @@ +/** + * @param {number[][]} properties + * @return {number} + */ +const numberOfWeakCharacters = function(properties) { + properties.sort((a, b) => a[0] - b[0] || b[1] - a[1]) + let stack = [], res = 0 + + for(let i = 0, n = properties.length; i < n; i++) { + while(stack.length && stack[stack.length - 1] < properties[i][1]) { + stack.pop() + res++ + } + stack.push(properties[i][1]) + } + + return res +}; + +// another + /** * @param {number[][]} properties * @return {number} From bfb0fbc3bd3d6638e81a4056db081675783ff807 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Sep 2021 19:08:41 +0800 Subject: [PATCH 0328/2039] Create 2000-reverse-prefix-of-word.js --- 2000-reverse-prefix-of-word.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2000-reverse-prefix-of-word.js diff --git a/2000-reverse-prefix-of-word.js b/2000-reverse-prefix-of-word.js new file mode 100644 index 00000000..3553e662 --- /dev/null +++ b/2000-reverse-prefix-of-word.js @@ -0,0 +1,21 @@ +/** + * @param {string} word + * @param {character} ch + * @return {string} + */ +const reversePrefix = function(word, ch) { + const arr = word.split('') + let idx = -1 + for(let i = 0; i < arr.length; i++) { + if(arr[i] === ch) { + idx = i + break + } + } + if(idx !== -1) { + const pre = arr.slice(0, idx + 1) + const remain = arr.slice(idx + 1) + return pre.reverse().concat(remain).join('') + } + return word +}; From 93dd34e5514bab2e010ce76196d210e640ee2278 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Sep 2021 19:09:10 +0800 Subject: [PATCH 0329/2039] Create 2001-number-of-pairs-of-interchangeable-rectangles.js --- ...er-of-pairs-of-interchangeable-rectangles.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2001-number-of-pairs-of-interchangeable-rectangles.js diff --git a/2001-number-of-pairs-of-interchangeable-rectangles.js b/2001-number-of-pairs-of-interchangeable-rectangles.js new file mode 100644 index 00000000..bd69e8ad --- /dev/null +++ b/2001-number-of-pairs-of-interchangeable-rectangles.js @@ -0,0 +1,17 @@ +/** + * @param {number[][]} rectangles + * @return {number} + */ +const interchangeableRectangles = function(rectangles) { + const count = new Map() + + for (const [w, h] of rectangles) { + count.set( w / h, 1 + (count.get( w / h) || 0)) + } + + let res = 0 + for (let c of count.values()) { + if(c > 1) res += ((c * (c - 1)) / 2) + } + return res +}; From 0a628811bdcd3c921b9805ef6f2375a1b354ed8b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Sep 2021 19:09:42 +0800 Subject: [PATCH 0330/2039] Create 2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js --- ...-length-of-two-palindromic-subsequences.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js diff --git a/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js b/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js new file mode 100644 index 00000000..ad4a1b79 --- /dev/null +++ b/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js @@ -0,0 +1,29 @@ +/** + * @param {string} s + * @return {number} + */ +var maxProduct = function(s) { + const n = s.length; + let max = 0; + for (let i = 0; i < (1 << n); i++) { + let n0 = palindromic(i, s, true); + if (n0 === 0) continue; + for (let j = 0; j < (1 << n); j++) { + if ((i & j) > 0) continue; + max = Math.max(palindromic(j, s) * n0, max); + } + } + return max; +}; +function palindromic( i, s) { + const n = s.length; + let sub = ""; + for (let x = 0; x < n; x++) { + if (i & (1 << x)) sub += s[x] + } + let len = sub.length; + for (let i = 0; i < len; i++) { + if (sub[i] !== sub[len - i - 1]) return 0; + } + return len; +} From 3512b727a5bbe14c4a1f6c0821c0a3a20dabd05a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Sep 2021 19:10:14 +0800 Subject: [PATCH 0331/2039] Create 2003-smallest-missing-genetic-value-in-each-subtree.js --- ...t-missing-genetic-value-in-each-subtree.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2003-smallest-missing-genetic-value-in-each-subtree.js diff --git a/2003-smallest-missing-genetic-value-in-each-subtree.js b/2003-smallest-missing-genetic-value-in-each-subtree.js new file mode 100644 index 00000000..fccbd9db --- /dev/null +++ b/2003-smallest-missing-genetic-value-in-each-subtree.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} parents + * @param {number[]} nums + * @return {number[]} + */ +const smallestMissingValueSubtree = function(parents, nums) { + let n = parents.length; + const ans = new Array(n).fill(0); + const fn = new Array(100010).fill(0); + const tree = []; + const nums1 = nums; + for(let idx=0;idxrec && fn[pos]<=nodeIdx) { + pos++; + } + ans[root] = pos; + return pos; + } +}; + From 0885e2da44e8349df29fac8e3233f0ec5ee36a5d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Sep 2021 21:15:19 +0800 Subject: [PATCH 0332/2039] Update 1997-first-day-where-you-have-been-in-all-the-rooms.js --- ...day-where-you-have-been-in-all-the-rooms.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/1997-first-day-where-you-have-been-in-all-the-rooms.js b/1997-first-day-where-you-have-been-in-all-the-rooms.js index 815c676c..8b503fdd 100644 --- a/1997-first-day-where-you-have-been-in-all-the-rooms.js +++ b/1997-first-day-where-you-have-been-in-all-the-rooms.js @@ -16,3 +16,21 @@ const firstDayBeenInAllRooms = function(nextVisit) { return f[n - 1]; }; + +// another + +/** + * @param {number[]} nextVisit + * @return {number} + */ +const firstDayBeenInAllRooms = function(nextVisit) { + const mod = 1e9 + 7 + const n = nextVisit.length + const dp = Array(n).fill(0) + for(let i = 1; i < n; i++) { + // i - 1 ---> nextVisit[i - 1] ---> i - 1 ---> i + dp[i] = (dp[i - 1] + 1 + dp[i - 1] - dp[nextVisit[i - 1]] + 1 + mod) % mod + } + + return dp[n - 1] +}; From a9848388bae820b65995d96adb87b4114f9c8fcf Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 Sep 2021 17:05:44 +0800 Subject: [PATCH 0333/2039] Update 169-majority-element.js --- 169-majority-element.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/169-majority-element.js b/169-majority-element.js index 857fce5c..5d97af39 100755 --- a/169-majority-element.js +++ b/169-majority-element.js @@ -16,3 +16,22 @@ const majorityElement = function(nums) { .map(el => +el[0]) .sort((a, b) => b - a)[0]; }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const majorityElement = function(nums) { + let cnt = 1, candidate = nums[0] + for(let i = 1, n = nums.length; i < n; i++) { + if(candidate === nums[i]) cnt++ + else cnt-- + if(cnt === 0) { + cnt = 1 + candidate = nums[i] + } + } + return candidate +}; From 1e67a7bcf60ecac8955ed0598ae860fcb6b17a0c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 Sep 2021 17:07:53 +0800 Subject: [PATCH 0334/2039] Update 169-majority-element.js --- 169-majority-element.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/169-majority-element.js b/169-majority-element.js index 5d97af39..91f38a94 100755 --- a/169-majority-element.js +++ b/169-majority-element.js @@ -35,3 +35,21 @@ const majorityElement = function(nums) { } return candidate }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const majorityElement = function(nums) { + let cnt = 1, candidate = nums[0] + for(let i = 1, n = nums.length; i < n; i++) { + if(cnt === 0) { + cnt = 1 + candidate = nums[i] + }else if(candidate === nums[i]) cnt++ + else cnt-- + } + return candidate +}; From 1b562d2fd09a7a6f592399db2c7997ddb1c103f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Sep 2021 22:49:25 +0800 Subject: [PATCH 0335/2039] Create 2012-sum-of-beauty-in-the-array.js --- 2012-sum-of-beauty-in-the-array.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2012-sum-of-beauty-in-the-array.js diff --git a/2012-sum-of-beauty-in-the-array.js b/2012-sum-of-beauty-in-the-array.js new file mode 100644 index 00000000..62f7b28b --- /dev/null +++ b/2012-sum-of-beauty-in-the-array.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const sumOfBeauties = function(nums) { + const n = nums.length + const maxArr = Array(n).fill(0), minArr = Array(n).fill(0) + let max = -Infinity, min = Infinity + for(let i = 0; i < n; i++) { + const tmp = Math.max(max, nums[i]) + if(tmp > max) max = tmp + maxArr[i] = max + } + + for(let i = n - 1; i >= 0; i--) { + const tmp = Math.min(min, nums[i]) + if(tmp < min) min = tmp + minArr[i] = min + } + let res = 0 + + for(let i = 1; i < n - 1; i++) { + if(nums[i] > maxArr[i - 1] && nums[i] < minArr[i + 1]) res += 2 + else if(nums[i] > nums[i - 1] && nums[i] < nums[i + 1]) res += 1 + } + + return res +}; From ebbae815c267c183ff28ede2b4d650b8873c808a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Sep 2021 22:49:56 +0800 Subject: [PATCH 0336/2039] Create 2011-final-value-of-variable-after-performing-operations.js --- ...value-of-variable-after-performing-operations.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2011-final-value-of-variable-after-performing-operations.js diff --git a/2011-final-value-of-variable-after-performing-operations.js b/2011-final-value-of-variable-after-performing-operations.js new file mode 100644 index 00000000..300d15a4 --- /dev/null +++ b/2011-final-value-of-variable-after-performing-operations.js @@ -0,0 +1,13 @@ +/** + * @param {string[]} operations + * @return {number} + */ +const finalValueAfterOperations = function(operations) { + let res = 0 + for(let op of operations) { + if(op.indexOf('++') !== -1) res++ + else res-- + } + + return res +}; From 1ce1ecdec560ee9684117aa1d1fe1f8e99169055 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Sep 2021 23:53:19 +0800 Subject: [PATCH 0337/2039] Create 2013-detect-squares.js --- 2013-detect-squares.js | 80 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 80 insertions(+) create mode 100644 2013-detect-squares.js diff --git a/2013-detect-squares.js b/2013-detect-squares.js new file mode 100644 index 00000000..cf68cf50 --- /dev/null +++ b/2013-detect-squares.js @@ -0,0 +1,80 @@ + +var DetectSquares = function() { + this.xMap = new Map(); + this.yMap = new Map(); +}; + +/** + * @param {number[]} point + * @return {void} + */ +DetectSquares.prototype.add = function(point) { + const [ x, y ] = point; + + // X-map + if (this.xMap.has(x)) { + const xMap = this.xMap.get(x); + + if (xMap.has(y)) { + xMap.set(y, xMap.get(y) + 1); + } else { + xMap.set(y, 1); + } + } else { + const countMap = new Map(); + countMap.set(y, 1); + this.xMap.set(x, countMap); + } + + // Y-map + if (this.yMap.has(y)) { + const yMap = this.yMap.get(y); + + if (yMap.has(x)) { + yMap.set(x, yMap.get(x) + 1); + } else { + yMap.set(x, 1); + } + } else { + const countMap = new Map(); + countMap.set(x, 1); + this.yMap.set(y, countMap); + } +}; + +/** + * @param {number[]} point + * @return {number} + */ +DetectSquares.prototype.count = function(point) { + const [ x, y ] = point; + let ans = 0; + + if (this.xMap.has(x) && this.yMap.has(y)) { + for (const y2 of this.xMap.get(x).keys()) { + if (y === y2) { + continue; + } + + // Find parallel + const sideLen = Math.abs(y - y2); + const possibleX = [ x - sideLen, x + sideLen]; + + for (const px of possibleX) { + if (this.yMap.get(y).has(px) && this.xMap.has(px) && this.xMap.get(px).has(y2)) { + ans += this.xMap.get(x).get(y2) * this.yMap.get(y).get(px) + * this.xMap.get(px).get(y2); + } + } + } + } + + return ans; +}; + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = new DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */ From 7b38fc59ab6d86ee3507f979e691e438ede6cb61 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Sep 2021 23:54:40 +0800 Subject: [PATCH 0338/2039] Create 2014-longest-subsequence-repeated-k-times.js --- 2014-longest-subsequence-repeated-k-times.js | 83 ++++++++++++++++++++ 1 file changed, 83 insertions(+) create mode 100644 2014-longest-subsequence-repeated-k-times.js diff --git a/2014-longest-subsequence-repeated-k-times.js b/2014-longest-subsequence-repeated-k-times.js new file mode 100644 index 00000000..8767d8f7 --- /dev/null +++ b/2014-longest-subsequence-repeated-k-times.js @@ -0,0 +1,83 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var longestSubsequenceRepeatedK = function(s, k) { + // Max length of the subsequence can be determined by the length of the string and k + const maxLen = Math.floor(s.length / k); + + // Find all possible characters that can appear in the subsequence (characters must appear at + // least k times in s) + const charCount = new Map(); + const possibleChars = [] + + for (const char of s) { + if (charCount.has(char)) { + charCount.set(char, charCount.get(char) + 1); + } else { + charCount.set(char, 1); + } + } + + for (const char of charCount.keys()) { + if (charCount.get(char) >= k) { + possibleChars.push(char); + } + } + + // Test possibilities + let ans = ""; + dfs(""); + + return ans; + + // Recursive function, tests if the given subsequence repeats k times in s + function dfs(seq) { + // Does not have enough repeats, return + if (countRepeats(seq) < k) { + return; + } + + // Update our answer if the new subsequence is better + if (seq.length > ans.length || (seq.length === ans.length && seq > ans)) { + ans = seq; + } + + // Append possible characters to the subsequence and test again + if (seq.length < maxLen) { + for (const char of possibleChars) { + dfs(seq + char); + } + } + } + + // Counts the number of times the given subsequence repeats in s (up to k) + function countRepeats(seq) { + + // Empty string, return k + if (!seq) { + return k; + } + + let repeats = 0; + let seqIdx = 0; + + for (const char of s) { + if (char === seq[seqIdx]) { + seqIdx += 1; + + if (seqIdx >= seq.length) { + seqIdx = 0; + repeats += 1; + + if (repeats >= k) { + break; + } + } + } + } + + return repeats; + } +}; From 5375fee8c10850c2de4bb19b5273b41413714668 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Sep 2021 15:33:15 +0800 Subject: [PATCH 0339/2039] Update 2014-longest-subsequence-repeated-k-times.js --- 2014-longest-subsequence-repeated-k-times.js | 50 ++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/2014-longest-subsequence-repeated-k-times.js b/2014-longest-subsequence-repeated-k-times.js index 8767d8f7..57941aba 100644 --- a/2014-longest-subsequence-repeated-k-times.js +++ b/2014-longest-subsequence-repeated-k-times.js @@ -1,3 +1,53 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const longestSubsequenceRepeatedK = function(s, k) { + const n = s.length, a = 'a'.charCodeAt(0) + + let res = '' + const q = [''] + + while(q.length) { + const size = q.length + for(let i = 0; i < size; i++) { + const cur = q.shift() + for(let j = 0; j < 26; j++) { + const next = cur + String.fromCharCode(a + j) + if(isSub(s, next, k)) { + res = next + q.push(next) + } + } + + } + } + + return res + + + function isSub(s, p, k) { + let repeated = 0 + for(let i = 0, j = 0, n = s.length, m = p.length; i < n; i++) { + if(s[i] === p[j]) { + j++ + if(j === m) { + repeated++ + j = 0 + if(repeated === k) { + return true + } + } + } + } + + return false + } +}; + +// another + /** * @param {string} s * @param {number} k From 5632cf9cda0c4aba14dbde29fc358da57469c627 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Sep 2021 16:03:29 +0800 Subject: [PATCH 0340/2039] Update 2013-detect-squares.js --- 2013-detect-squares.js | 42 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/2013-detect-squares.js b/2013-detect-squares.js index cf68cf50..3cb84312 100644 --- a/2013-detect-squares.js +++ b/2013-detect-squares.js @@ -1,4 +1,46 @@ +const DetectSquares = function() { + this.pts = [] + this.ptsCnt = {} +}; + +/** + * @param {number[]} point + * @return {void} + */ +DetectSquares.prototype.add = function(point) { + this.pts.push(point) + const key = `${point[0]},${point[1]}` + this.ptsCnt[key] = (this.ptsCnt[key] || 0) + 1 +}; + +/** + * @param {number[]} point + * @return {number} + */ +DetectSquares.prototype.count = function(point) { + let res = 0 + const [px, py] = point + for(const [x, y] of this.pts) { + if(px === x || py === y || Math.abs(px - x) !== Math.abs(py - y)) { + continue + } + res += (this.ptsCnt[`${px},${y}`] || 0) * (this.ptsCnt[`${x},${py}`] || 0) + } + + return res +}; + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = new DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */ + + +// another + var DetectSquares = function() { this.xMap = new Map(); this.yMap = new Map(); From b0427fba3e8e90fafec6255cc2940e3bfe491739 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 22 Sep 2021 09:03:56 +0800 Subject: [PATCH 0341/2039] Update 973-k-closest-points-to-origin.js --- 973-k-closest-points-to-origin.js | 34 +++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/973-k-closest-points-to-origin.js b/973-k-closest-points-to-origin.js index 5e110353..b02f1611 100644 --- a/973-k-closest-points-to-origin.js +++ b/973-k-closest-points-to-origin.js @@ -132,3 +132,37 @@ class PriorityQueue { } } } + +// another + +/** + * @param {number[][]} points + * @param {number} k + * @return {number[][]} + */ +const kClosest = function(points, k) { + let len = points.length, l = 0, r = len - 1 + while (l <= r) { + let mid = helper(points, l, r) + if (mid === k) break + if (mid < k) l = mid + 1 + else r = mid - 1 + } + return points.slice(0, k) + + function helper(arr, l, r) { + const pivot = arr[l] + while(l < r) { + while(l < r && cmp(arr[r], pivot) >= 0) r-- + arr[l] = arr[r] + while(l < r && cmp(arr[l], pivot) <= 0) l++ + arr[r] = arr[l] + } + arr[l] = pivot + return l + } + + function cmp(a, b) { + return a[0] * a[0] + a[1] * a[1] - b[0] * b[0] - b[1] * b[1] + } +}; From 2e5b3bf615d4c7cdf8f64ad9e14669f42f7416eb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 22 Sep 2021 21:19:34 +0800 Subject: [PATCH 0342/2039] Create 1572-matrix-diagonal-sum.js --- 1572-matrix-diagonal-sum.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1572-matrix-diagonal-sum.js diff --git a/1572-matrix-diagonal-sum.js b/1572-matrix-diagonal-sum.js new file mode 100644 index 00000000..88866342 --- /dev/null +++ b/1572-matrix-diagonal-sum.js @@ -0,0 +1,16 @@ +/** + * @param {number[][]} mat + * @return {number} + */ +const diagonalSum = function(mat) { + let res = 0, n = mat.length + for(let i = 0; i < n; i++) { + const j = i, ii = i, jj = n - 1 - i + if(j == jj) res += mat[i][j] + else { + res += mat[i][j] + mat[ii][jj] + } + } + + return res +}; From f8657b43083ce05e79f1578672e3cbc1ec324f82 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 22 Sep 2021 21:24:41 +0800 Subject: [PATCH 0343/2039] Create 1331-rank-transform-of-an-array.js --- 1331-rank-transform-of-an-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1331-rank-transform-of-an-array.js diff --git a/1331-rank-transform-of-an-array.js b/1331-rank-transform-of-an-array.js new file mode 100644 index 00000000..11f7335f --- /dev/null +++ b/1331-rank-transform-of-an-array.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} arr + * @return {number[]} + */ +const arrayRankTransform = function(arr) { + const hash = {} + for(let e of arr) { + hash[e] = 1 + } + const keys = Object.keys(hash) + keys.sort((a, b) => a - b) + const rank = {} + for(let i = 0, n= keys.length; i < n; i++) { + rank[keys[i]] = i + 1 + } + + return arr.map(e => rank[e]) +}; From 118d8ac08d486cc60392ec6b577a71bb41e9fdcd Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 Sep 2021 09:33:05 +0800 Subject: [PATCH 0344/2039] Update 215-kth-largest-element-in-an-array.js --- 215-kth-largest-element-in-an-array.js | 36 ++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/215-kth-largest-element-in-an-array.js b/215-kth-largest-element-in-an-array.js index f8544874..cbf5ce05 100755 --- a/215-kth-largest-element-in-an-array.js +++ b/215-kth-largest-element-in-an-array.js @@ -100,4 +100,40 @@ function swap(arr, i, j) { arr[j] = tmp } +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const findKthLargest = function(nums, k) { + const n = nums.length + let l = 0, r = n - 1, t = n - k + while(l < r) { + const idx = partition(nums, l, r) + if (idx === t) return nums[t] + if (idx < t) l = idx + 1 + else r = idx - 1 + } + return nums[l] +}; + +function partition(arr, l, r) { + let tmp = l, pivot = arr[l] + while(l < r) { + while(l < r && arr[r] >= pivot) r-- + while(l < r && arr[l] <= pivot) l++ + swap(arr, l, r) + } + swap(arr, l, tmp) + return l +} + +function swap(arr, i, j) { + const tmp = arr[i] + arr[i] = arr[j] + arr[j] = tmp +} + From eac60491e9a4bf1faf828e8da35e4e5f6fa4d9df Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 Sep 2021 14:41:04 +0800 Subject: [PATCH 0345/2039] Create 1128-number-of-equivalent-domino-pairsnumber-of-equivalent-domino-pairs.js --- ...-pairsnumber-of-equivalent-domino-pairs.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1128-number-of-equivalent-domino-pairsnumber-of-equivalent-domino-pairs.js diff --git a/1128-number-of-equivalent-domino-pairsnumber-of-equivalent-domino-pairs.js b/1128-number-of-equivalent-domino-pairsnumber-of-equivalent-domino-pairs.js new file mode 100644 index 00000000..eebd4674 --- /dev/null +++ b/1128-number-of-equivalent-domino-pairsnumber-of-equivalent-domino-pairs.js @@ -0,0 +1,34 @@ +/** + * @param {number[][]} dominoes + * @return {number} + */ +const numEquivDominoPairs = function(dominoes) { + const hash = {} + for (let dom of dominoes) { + const [a, b] = dom + const key = `${a},${b}`, alterKey = `${b},${a}` + if (hash[key] == null && hash[alterKey] == null) { + hash[key] = 1 + } else { + if(hash[key] != null) hash[key] += 1 + else hash[alterKey] += 1 + } + } + + let res = 0 + + Object.keys(hash).forEach(k => { + if(hash[k] > 1) res += sum(hash[k]) + }) + + return res +}; + +function sum(n) { + let res = 0 + while(n > 1) { + res += n - 1 + n-- + } + return res +} From 8e307d14364e3e5ea248b1542083041fc6481989 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 24 Sep 2021 16:32:42 +0800 Subject: [PATCH 0346/2039] Create 2009-minimum-number-of-operations-to-make-array-continuous.js --- ...-of-operations-to-make-array-continuous.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2009-minimum-number-of-operations-to-make-array-continuous.js diff --git a/2009-minimum-number-of-operations-to-make-array-continuous.js b/2009-minimum-number-of-operations-to-make-array-continuous.js new file mode 100644 index 00000000..be0adb9f --- /dev/null +++ b/2009-minimum-number-of-operations-to-make-array-continuous.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minOperations = function(nums) { + const N = nums.length; + if(N === 1) return 0; + nums.sort((a, b) => a - b) + let M = 1; + for(let i = 1; i < N; i++) { + if(nums[i] != nums[i-1]) nums[M++] = nums[i]; + } + + let j = 0; + let ans = N; + for(let i = 0; i < M; i++) { + while(j < M && nums[j] <= N + nums[i] - 1) j++; + ans = Math.min(ans, N - (j - i)); + } + + return ans; +}; From c8f5cac1ed0ebd9251ed0cebb8251cc7e5541fef Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 24 Sep 2021 16:46:06 +0800 Subject: [PATCH 0347/2039] Update 2009-minimum-number-of-operations-to-make-array-continuous.js --- ...imum-number-of-operations-to-make-array-continuous.js | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/2009-minimum-number-of-operations-to-make-array-continuous.js b/2009-minimum-number-of-operations-to-make-array-continuous.js index be0adb9f..4595f1b3 100644 --- a/2009-minimum-number-of-operations-to-make-array-continuous.js +++ b/2009-minimum-number-of-operations-to-make-array-continuous.js @@ -12,11 +12,14 @@ const minOperations = function(nums) { } let j = 0; - let ans = N; + let res = N; for(let i = 0; i < M; i++) { + // let `j` point to the first element that is out of range -- `> nums[i] + N - 1`. while(j < M && nums[j] <= N + nums[i] - 1) j++; - ans = Math.min(ans, N - (j - i)); + // The length of this subarray is `j - i`. + // We need to replace `N - (j - i)` elements to make it continuous. + res = Math.min(res, N - (j - i)); } - return ans; + return res; }; From b48a8cba8ca21630a59f012322cc2f9f76459024 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Sep 2021 18:36:19 +0800 Subject: [PATCH 0348/2039] Create 2008-maximum-earnings-from-taxi.js --- 2008-maximum-earnings-from-taxi.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2008-maximum-earnings-from-taxi.js diff --git a/2008-maximum-earnings-from-taxi.js b/2008-maximum-earnings-from-taxi.js new file mode 100644 index 00000000..e1b42d22 --- /dev/null +++ b/2008-maximum-earnings-from-taxi.js @@ -0,0 +1,21 @@ +/** + * @param {number} n + * @param {number[][]} rides + * @return {number} + */ +const maxTaxiEarnings = function(n, rides) { + const { max } = Math + const rideStartAt = Array.from({length: n}, () => []); + for (let ride of rides) { + let s = ride[0], e = ride[1], t = ride[2]; + rideStartAt[s].push([e, e - s + t]); // [end, dollar] + } + const dp = Array(n+1).fill(0); + for (let i = n-1; i >= 1; --i) { + for (let [e, d] of rideStartAt[i]) { + dp[i] = max(dp[i], dp[e] + d); + } + dp[i] = max(dp[i], dp[i + 1]); + } + return dp[1]; +}; From 3aff380d72db3abc181e93bebea3ad48db33bab0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Sep 2021 21:42:33 +0800 Subject: [PATCH 0349/2039] Create 1356-sort-integers-by-the-number-of-1-bits.js --- 1356-sort-integers-by-the-number-of-1-bits.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1356-sort-integers-by-the-number-of-1-bits.js diff --git a/1356-sort-integers-by-the-number-of-1-bits.js b/1356-sort-integers-by-the-number-of-1-bits.js new file mode 100644 index 00000000..30f0ee20 --- /dev/null +++ b/1356-sort-integers-by-the-number-of-1-bits.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} arr + * @return {number[]} + */ +const sortByBits = function(arr) { + arr.sort((a, b) => { + const an = numOfBits(a), bn = numOfBits(b) + return an === bn ? a - b : an - bn + }) + return arr +}; + +function numOfBits(n) { + let res = 0 + for(let i = 0; i < 32; i++) { + if((1 << i) & n) res++ + } + return res +} From d2c01fed888bd236751a3c570f16595aba96978b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Sep 2021 09:43:29 +0800 Subject: [PATCH 0350/2039] Create 1560-most-visited-sector-in-a-circular-track.js --- ...most-visited-sector-in-a-circular-track.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1560-most-visited-sector-in-a-circular-track.js diff --git a/1560-most-visited-sector-in-a-circular-track.js b/1560-most-visited-sector-in-a-circular-track.js new file mode 100644 index 00000000..62d2eea1 --- /dev/null +++ b/1560-most-visited-sector-in-a-circular-track.js @@ -0,0 +1,24 @@ +/** + * @param {number} n + * @param {number[]} rounds + * @return {number[]} + */ +const mostVisited = function(n, rounds) { + const arr = Array(n + 1).fill(0) + for(let i = 1, m = rounds.length; i < m; i++) { + let start = rounds[i - 1], end = rounds[i] + + if(i == 1) arr[start]++ + while(start !== end) { + start += 1 + if (start === n + 1) start = 1 + arr[start]++ + } + } + const max = Math.max(...arr) + const res = [] + for(let i = 1; i <= n; i++) { + if(arr[i] === max) res.push(i) + } + return res +}; From 822dff0c934595131d66c89bfb0d952b1d945770 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Sep 2021 19:39:39 +0800 Subject: [PATCH 0351/2039] Update 1235-maximum-profit-in-job-scheduling.js --- 1235-maximum-profit-in-job-scheduling.js | 37 ++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/1235-maximum-profit-in-job-scheduling.js b/1235-maximum-profit-in-job-scheduling.js index 5870bc35..a5a0fa3b 100644 --- a/1235-maximum-profit-in-job-scheduling.js +++ b/1235-maximum-profit-in-job-scheduling.js @@ -1,3 +1,40 @@ +/** + * @param {number[]} startTime + * @param {number[]} endTime + * @param {number[]} profit + * @return {number} + */ +const jobScheduling = function (startTime, endTime, profit) { + const n = startTime.length + const items = Array(n) + for(let i = 0;i < n; i++) items[i] = [startTime[i], endTime[i], profit[i]] + items.sort((a, b) => a[1] - b[1]) + const dpEndTime = [0] + const dpProfit = [0] + for(const [s, e, p] of items) { + const prevIdx = binarySearch(dpEndTime, 0, dpEndTime.length - 1, s) + const curProfit = dpProfit[prevIdx] + p, maxProfit = dpProfit[dpProfit.length - 1] + if(curProfit > maxProfit) { + dpProfit.push(curProfit) + dpEndTime.push(e) + } + } + + return dpProfit[dpProfit.length - 1] +} + +function binarySearch(arr, l, r, x) { + while (l < r) { + const mid = r - ((r - l) >> 1) + if (arr[mid] > x) r = mid - 1 + else l = mid + } + return l +} + + +// another + /** * @param {number[]} startTime * @param {number[]} endTime From 19b9b62dd2e26a6a19231635a617a0fa29776ada Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 27 Sep 2021 10:52:11 +0800 Subject: [PATCH 0352/2039] Update 1751-maximum-number-of-events-that-can-be-attended-ii.js --- ...umber-of-events-that-can-be-attended-ii.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1751-maximum-number-of-events-that-can-be-attended-ii.js b/1751-maximum-number-of-events-that-can-be-attended-ii.js index 0de7c6d0..6f1ce829 100644 --- a/1751-maximum-number-of-events-that-can-be-attended-ii.js +++ b/1751-maximum-number-of-events-that-can-be-attended-ii.js @@ -1,3 +1,31 @@ +/** + * @param {number[][]} events + * @param {number} k + * @return {number} + */ +const maxValue = function (events, k) { + const n = events.length + const memo = Array.from({ length: n + 1 }, () => Array(k + 1).fill(-1)) + events.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + return helper(memo, events, n, 0, k) +} + +function helper(memo, events, n, i, k) { + if(i === n || k === 0) return 0 + if(memo[i][k] !== -1) return memo[i][k] + let ni = i + 1 + for(; ni < n; ni++) { + if(events[ni][0] > events[i][1]) break + } + + return memo[i][k] = Math.max( + helper(memo, events, n, i + 1, k), + events[i][2] + helper(memo, events, n, ni, k - 1) + ) +} + +// another + /** * @param {number[][]} events * @param {number} k From 8f619eed7f6f34b88d4362a31b2242d37c657837 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 28 Sep 2021 19:56:17 +0800 Subject: [PATCH 0353/2039] Create 1281-subtract-the-product-and-sum-of-digits-of-an-integer.js --- ...-the-product-and-sum-of-digits-of-an-integer.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1281-subtract-the-product-and-sum-of-digits-of-an-integer.js diff --git a/1281-subtract-the-product-and-sum-of-digits-of-an-integer.js b/1281-subtract-the-product-and-sum-of-digits-of-an-integer.js new file mode 100644 index 00000000..81d0a338 --- /dev/null +++ b/1281-subtract-the-product-and-sum-of-digits-of-an-integer.js @@ -0,0 +1,14 @@ +/** + * @param {number} n + * @return {number} + */ +const subtractProductAndSum = function(n) { + if(n === 0) return 0 + let sum = 0, product = 1 + n = '' + n + for(let ch of n) { + sum += +(ch) + product *= +(ch) + } + return product - sum +}; From b19d5f109b95c712b1c748990aae9d73b87915f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Sep 2021 19:29:32 +0800 Subject: [PATCH 0354/2039] Create 1528-shuffle-string.js --- 1528-shuffle-string.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1528-shuffle-string.js diff --git a/1528-shuffle-string.js b/1528-shuffle-string.js new file mode 100644 index 00000000..1c965ce1 --- /dev/null +++ b/1528-shuffle-string.js @@ -0,0 +1,13 @@ +/** + * @param {string} s + * @param {number[]} indices + * @return {string} + */ +const restoreString = function(s, indices) { + const n = s.length + const arr = Array(n) + for(let i = 0; i < n; i++) { + arr[indices[i]] = s[i] + } + return arr.join('') +}; From 9f9fb42cb48af9dbb7101146df8a6559717bad53 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Sep 2021 19:41:53 +0800 Subject: [PATCH 0355/2039] Create 1486-xor-operation-in-an-array.js --- 1486-xor-operation-in-an-array.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1486-xor-operation-in-an-array.js diff --git a/1486-xor-operation-in-an-array.js b/1486-xor-operation-in-an-array.js new file mode 100644 index 00000000..32db560e --- /dev/null +++ b/1486-xor-operation-in-an-array.js @@ -0,0 +1,17 @@ +/** + * @param {number} n + * @param {number} start + * @return {number} + */ +const xorOperation = function(n, start) { + const nums = [] + let i = 0 + while (i < n) { + nums[i] = start + 2 * i + i++ + } + // console.log(nums) + let res = nums[0] + for(let i = 1; i < n; i++) res ^= nums[i] + return res +}; From c0f32ef7af5a3171f200789ebfb8dd9ab1e2aa59 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Sep 2021 18:38:47 +0800 Subject: [PATCH 0356/2039] Create 2018-check-if-word-can-be-placed-in-crossword.js --- ...heck-if-word-can-be-placed-in-crossword.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2018-check-if-word-can-be-placed-in-crossword.js diff --git a/2018-check-if-word-can-be-placed-in-crossword.js b/2018-check-if-word-can-be-placed-in-crossword.js new file mode 100644 index 00000000..059c6731 --- /dev/null +++ b/2018-check-if-word-can-be-placed-in-crossword.js @@ -0,0 +1,33 @@ +/** + * @param {character[][]} board + * @param {string} word + * @return {boolean} + */ +const placeWordInCrossword = function(board, word) { + for (let state of [board, getRotated(board)]) + for (let chars of state) + for (let token of chars.join('').split("#")) + for (let letters of [word, word.split('').reverse().join('')]) + if (letters.length == token.length) + if (canFit(letters, token)) + return true; + return false; +} + +function getRotated(board) { + const m = board.length; + const n = board[0].length; + + const rotated = Array.from({length: n}, () => Array(m)); + for (let i = 0; i < m; ++i) + for (let j = 0; j < n; ++j) + rotated[j][i] = board[i][j]; + return rotated; +} + +function canFit(letters, token) { + for (let i = 0; i < letters.length; ++i) + if (token.charAt(i) != ' ' && token.charAt(i) != letters.charAt(i)) + return false; + return true; +} From 1fa1b9b054195e0d81c013bc5f1f0627519b0c33 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Oct 2021 00:15:27 +0800 Subject: [PATCH 0357/2039] Create 1217-minimum-cost-to-move-chips-to-the-same-position.js --- ...inimum-cost-to-move-chips-to-the-same-position.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1217-minimum-cost-to-move-chips-to-the-same-position.js diff --git a/1217-minimum-cost-to-move-chips-to-the-same-position.js b/1217-minimum-cost-to-move-chips-to-the-same-position.js new file mode 100644 index 00000000..c9c72ba9 --- /dev/null +++ b/1217-minimum-cost-to-move-chips-to-the-same-position.js @@ -0,0 +1,12 @@ +/** + * @param {number[]} position + * @return {number} + */ +const minCostToMoveChips = function(position) { + let oddSum = 0, evenSum = 0 + for(let i = 0; i < position.length; i++) { + if(position[i] % 2 === 0) evenSum++ + else oddSum++ + } + return Math.min(oddSum, evenSum) +}; From c00ff0d66933286b25927a1ccc418c528a61adc9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Oct 2021 17:44:53 +0800 Subject: [PATCH 0358/2039] Create 1332-remove-palindromic-subsequences.js --- 1332-remove-palindromic-subsequences.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1332-remove-palindromic-subsequences.js diff --git a/1332-remove-palindromic-subsequences.js b/1332-remove-palindromic-subsequences.js new file mode 100644 index 00000000..747c066d --- /dev/null +++ b/1332-remove-palindromic-subsequences.js @@ -0,0 +1,20 @@ +/** + * @param {string} s + * @return {number} + */ +const removePalindromeSub = function(s) { + if(s == null || s === '') return 0 + if(chk(s)) return 1 + return 2 +}; + +function chk(s) { + let l = 0, r = s.length - 1 + while(l < r) { + if(s[l] !== s[r]) return false + l++ + r-- + } + + return true +} From 1f1d966ba145e28a24c45e8d5633b725c681db12 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Oct 2021 12:21:21 +0800 Subject: [PATCH 0359/2039] Create 2019-the-score-of-students-solving-math-expression.js --- ...ore-of-students-solving-math-expression.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 2019-the-score-of-students-solving-math-expression.js diff --git a/2019-the-score-of-students-solving-math-expression.js b/2019-the-score-of-students-solving-math-expression.js new file mode 100644 index 00000000..9dee9e18 --- /dev/null +++ b/2019-the-score-of-students-solving-math-expression.js @@ -0,0 +1,43 @@ +/** + * @param {string} s + * @param {number[]} answers + * @return {number} + */ +const op = { + '+': ((a, b) => Number(a) + Number(b)), + '*':((a, b) => a * b), +} +let dp = {}; +const dfs = (s) => { + if(s.length == 0) return {}; + if(s.length == 1) return { [s[0]] : 1}; + const dps = dp[s]; + if(dps) return dps; + const res = {}; + for(let i = 0; i < s.length - 2; i += 2) { + const l = dfs(s.substr(0, i + 1)) + const r = dfs(s.substr(i + 2, s.length - i - 2)); + for(let x in l) { + for(let y in r) { + const z = op[s[i + 1]](x, y); + if(z > 1000) continue; + res[z] = 1; + } + } + + } + dp[s] = res; + return res; +} + +const scoreOfStudents = function(s, answers) { + const correct = eval(s); + dp = {}; + const allAns = dfs(s); + let ans = 0; + answers.forEach(x => { + if( x == correct) ans += 5; + else if(allAns[x]) ans += 2; + }) + return ans; +}; From ac59868e1a3abc7f14e2effc26a63266e03d5ed0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Oct 2021 17:50:39 +0800 Subject: [PATCH 0360/2039] Create 2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.js --- ...ubsequence-with-occurrences-of-a-letter.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.js diff --git a/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.js b/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.js new file mode 100644 index 00000000..881d96aa --- /dev/null +++ b/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.js @@ -0,0 +1,36 @@ +/** + * @param {string} s + * @param {number} k + * @param {character} letter + * @param {number} repetition + * @return {string} + */ +const smallestSubsequence = function (s, k, letter, repetition) { + let n_letters = 0 + for (let i = 0; i < s.length; i++) if (s.charAt(i) == letter) n_letters++ + const stack = [] + for (let i = 0; i < s.length; i++) { + let c = s.charAt(i) + while ( + stack.length && + stack[stack.length - 1] > c && + s.length - i + stack.length > k && + (stack[stack.length - 1] != letter || n_letters > repetition) + ) { + if (stack.pop() == letter) repetition++ + } + if (stack.length < k) { + if (c == letter) { + stack.push(c) + repetition-- + } else if (k - stack.length > repetition) { + stack.push(c) + } + } + if (c == letter) n_letters-- + } + + let sb = '' + for (let c of stack) sb += c + return sb +} From 26c177d977c25c10640a26e0a6904a9ca0968ca8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Oct 2021 13:05:48 +0800 Subject: [PATCH 0361/2039] Create 2024-maximize-the-confusion-of-an-exam.js --- 2024-maximize-the-confusion-of-an-exam.js | 25 +++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2024-maximize-the-confusion-of-an-exam.js diff --git a/2024-maximize-the-confusion-of-an-exam.js b/2024-maximize-the-confusion-of-an-exam.js new file mode 100644 index 00000000..d1a382f2 --- /dev/null +++ b/2024-maximize-the-confusion-of-an-exam.js @@ -0,0 +1,25 @@ +/** + * @param {string} answerKey + * @param {number} k + * @return {number} + */ +const maxConsecutiveAnswers = function(answerKey, k) { + const helper = (str, transT) => { + let res = 0, l = 0, r = 0, num = 0 + const n = str.length + const target = transT === 1 ? 'T' : 'F' + while(r < n) { + if(str[r] === target) num++ + while(num > k) { + if(str[l] === target) num-- + l++ + } + res = Math.max(res, r - l + 1) + r++ + } + return res + } + + return Math.max(helper(answerKey, 0), helper(answerKey, 1)) +}; + From 69fb0020b050c8030dafe42ad856ddd3e5154484 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Oct 2021 13:58:09 +0800 Subject: [PATCH 0362/2039] Update 424-longest-repeating-character-replacement.js --- ...longest-repeating-character-replacement.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/424-longest-repeating-character-replacement.js b/424-longest-repeating-character-replacement.js index 8a17a9fa..dca0fa47 100755 --- a/424-longest-repeating-character-replacement.js +++ b/424-longest-repeating-character-replacement.js @@ -23,3 +23,27 @@ const characterReplacement = function(s, k) { console.log(characterReplacement("ABAB", 2)); console.log(characterReplacement("AABABBA", 1)); + + +// another + +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const characterReplacement = function(s, k) { + const freq = Array(26).fill(0), n = s.length, A = 'A'.charCodeAt(0) + let res = 0, l = 0, r = 0, maxFreq = 0 + while(r < n) { + maxFreq = Math.max(maxFreq, ++freq[s.charCodeAt(r) - A]) + if(r - l + 1 - maxFreq > k) { + freq[s.charCodeAt(l) - A]-- + l++ + } + res = Math.max(res, r - l + 1) + r++ + } + + return res +}; From a35a0e0e49e5cc1e8f5aabb6108ff345b364370e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Oct 2021 13:59:15 +0800 Subject: [PATCH 0363/2039] Update 2024-maximize-the-confusion-of-an-exam.js --- 2024-maximize-the-confusion-of-an-exam.js | 25 +++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2024-maximize-the-confusion-of-an-exam.js b/2024-maximize-the-confusion-of-an-exam.js index d1a382f2..a181942c 100644 --- a/2024-maximize-the-confusion-of-an-exam.js +++ b/2024-maximize-the-confusion-of-an-exam.js @@ -23,3 +23,28 @@ const maxConsecutiveAnswers = function(answerKey, k) { return Math.max(helper(answerKey, 0), helper(answerKey, 1)) }; +// another + +/** + * @param {string} answerKey + * @param {number} k + * @return {number} + */ +const maxConsecutiveAnswers = function(answerKey, k) { + let s = answerKey + const freq = Array(26).fill(0), n = s.length, A = 'A'.charCodeAt(0) + let res = 0, l = 0, r = 0, maxFreq = 0 + while(r < n) { + maxFreq = Math.max(maxFreq, ++freq[s.charCodeAt(r) - A]) + if(r - l + 1 - maxFreq > k) { + freq[s.charCodeAt(l) - A]-- + l++ + } + res = Math.max(res, r - l + 1) + r++ + } + + return res +}; + + From 05a7864e5da3681cf3ebfad5edc1e7f1d7c73e15 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Oct 2021 11:53:13 +0800 Subject: [PATCH 0364/2039] Update 424-longest-repeating-character-replacement.js --- ...longest-repeating-character-replacement.js | 25 ++++++++++++------- 1 file changed, 16 insertions(+), 9 deletions(-) diff --git a/424-longest-repeating-character-replacement.js b/424-longest-repeating-character-replacement.js index dca0fa47..7a49780e 100755 --- a/424-longest-repeating-character-replacement.js +++ b/424-longest-repeating-character-replacement.js @@ -32,18 +32,25 @@ console.log(characterReplacement("AABABBA", 1)); * @param {number} k * @return {number} */ -const characterReplacement = function(s, k) { - const freq = Array(26).fill(0), n = s.length, A = 'A'.charCodeAt(0) - let res = 0, l = 0, r = 0, maxFreq = 0 - while(r < n) { - maxFreq = Math.max(maxFreq, ++freq[s.charCodeAt(r) - A]) - if(r - l + 1 - maxFreq > k) { +const characterReplacement = function (s, k) { + const freq = Array(26).fill(0), + n = s.length, + { max } = Math, + A = 'A'.charCodeAt(0) + let res = 0, + l = 0, + r = 0, + maxFreq = 0 + while (r < n) { + maxFreq = max(maxFreq, ++freq[s.charCodeAt(r) - A]) + if (r - l + 1 - maxFreq > k) { freq[s.charCodeAt(l) - A]-- l++ } - res = Math.max(res, r - l + 1) + res = max(res, r - l + 1) r++ } - + return res -}; +} + From 89d6ad2bada3bcd934debfac8ab77fb169229a48 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Oct 2021 19:08:28 +0800 Subject: [PATCH 0365/2039] Create 2025-maximum-number-of-ways-to-partition-an-array.js --- ...um-number-of-ways-to-partition-an-array.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2025-maximum-number-of-ways-to-partition-an-array.js diff --git a/2025-maximum-number-of-ways-to-partition-an-array.js b/2025-maximum-number-of-ways-to-partition-an-array.js new file mode 100644 index 00000000..759d33fc --- /dev/null +++ b/2025-maximum-number-of-ways-to-partition-an-array.js @@ -0,0 +1,48 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const waysToPartition = function (nums, k) { + const n = nums.length + const pref = Array(n).fill(0), + suff = Array(n).fill(0) + pref[0] = nums[0] + suff[n - 1] = nums[n - 1] + for (let i = 1; i < n; ++i) { + pref[i] = pref[i - 1] + nums[i] + suff[n - 1 - i] = suff[n - i] + nums[n - 1 - i] + } + let ans = 0 + const left = {}, + right = {} + + for (let i = 0; i < n - 1; ++i) { + const delta = pref[i] - suff[i + 1] + if (right[delta] == null) right[delta] = 0 + right[delta]++ + } + + if (right[0]) ans = right[0] + for (let i = 0; i < n; ++i) { + //find the number of pivot indexes when nums[i] is changed to k + let curr = 0, + diff = k - nums[i] + if (left[diff]) curr += left[diff] + if (right[-diff]) curr += right[-diff] + + //update answer + ans = Math.max(ans, curr) + + //transfer the current element from right to left + if (i < n - 1) { + let dd = pref[i] - suff[i + 1] + if(left[dd] == null) left[dd] = 0 + if(right[dd] == null) right[dd] = 0 + left[dd]++ + right[dd]-- + if (right[dd] == 0) delete right[dd] + } + } + return ans +} From 2c29a1ba94557a9d56dea0accb77c23d25ed5cad Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Oct 2021 22:11:48 +0800 Subject: [PATCH 0366/2039] Update 2025-maximum-number-of-ways-to-partition-an-array.js --- ...um-number-of-ways-to-partition-an-array.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/2025-maximum-number-of-ways-to-partition-an-array.js b/2025-maximum-number-of-ways-to-partition-an-array.js index 759d33fc..ed96ae1e 100644 --- a/2025-maximum-number-of-ways-to-partition-an-array.js +++ b/2025-maximum-number-of-ways-to-partition-an-array.js @@ -1,3 +1,45 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const waysToPartition = function (nums, k) { + const n = nums.length, pre = Array(n).fill(0), suf = Array(n).fill(0) + pre[0] = nums[0], suf[n - 1] = nums[n - 1] + for(let i = 1; i < n; i++) { + pre[i] = pre[i - 1] + nums[i] + suf[n - 1 - i] = suf[n - i] + nums[n - 1 - i] + } + const sum = nums.reduce((ac, e) => ac + e, 0) + let res = 0 + for(let i = 0; i < n - 1; i++) { + if(pre[i] === suf[i + 1]) res++ + } + const cnt = new Map() + const arr = Array(n).fill(0) + for(let i = 0; i < n; i++) { + const newSum = sum - nums[i] + k + if(newSum % 2 === 0) arr[i] += (cnt.get(newSum / 2) || 0) + cnt.set(pre[i], (cnt.get(pre[i]) || 0) + 1) + } + cnt.clear() + for(let i = n - 1; i >= 0; i--) { + const newSum = sum - nums[i] + k + if(newSum % 2 === 0) arr[i] += (cnt.get(newSum / 2) || 0) + cnt.set(suf[i], (cnt.get(suf[i]) || 0) + 1) + } + + for(let e of arr) { + if(e > res) res = e + } + + return res +} + + +// another + + /** * @param {number[]} nums * @param {number} k From bda7e5e88321c6a4a9696bb056b6728920bcb19d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Oct 2021 09:35:11 +0800 Subject: [PATCH 0367/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index 2617178c..42f649fc 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -18,3 +18,28 @@ var findTheLongestSubstring = function (s, V = 'aeiou', max = 0) { } return max } + +// another + +/** + * @param {string} s + * @return {number} + */ +const findTheLongestSubstring = function(s) { + const n = s.length + const ch2num = ch => { + const idx = 'aeiou'.indexOf(ch) + return idx === -1 ? 0 : (1 << idx) + } + let res = 0 + const arr = Array(n + 1).fill(0) + const hash = new Map([[0, 0]]) + for(let i = 1; i <= n; i++) { + arr[i] = arr[i - 1] ^ ch2num(s[i - 1]) + const first = hash.has(arr[i]) ? hash.get(arr[i]) : i + if (!hash.has(arr[i])) hash.set(arr[i], i) + res = Math.max(res, i - first) + } + + return res +}; From b5acc53d39e138eab5216af1753a1b28aede8636 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Oct 2021 09:41:49 +0800 Subject: [PATCH 0368/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...ngest-substring-containing-vowels-in-even-counts.js | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index 42f649fc..9260de39 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -32,12 +32,12 @@ const findTheLongestSubstring = function(s) { return idx === -1 ? 0 : (1 << idx) } let res = 0 - const arr = Array(n + 1).fill(0) + let mask = 0 const hash = new Map([[0, 0]]) - for(let i = 1; i <= n; i++) { - arr[i] = arr[i - 1] ^ ch2num(s[i - 1]) - const first = hash.has(arr[i]) ? hash.get(arr[i]) : i - if (!hash.has(arr[i])) hash.set(arr[i], i) + for (let i = 1; i <= n; i++) { + mask ^= ch2num(s[i - 1]) + const first = hash.has(mask) ? hash.get(mask) : i + if (!hash.has(mask)) hash.set(mask, i) res = Math.max(res, i - first) } From 6756d846dfc289c05e9c92ec35abcff7d3d31d54 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Oct 2021 10:44:19 +0800 Subject: [PATCH 0369/2039] Create 1507-reformat-date.js --- 1507-reformat-date.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1507-reformat-date.js diff --git a/1507-reformat-date.js b/1507-reformat-date.js new file mode 100644 index 00000000..2057763c --- /dev/null +++ b/1507-reformat-date.js @@ -0,0 +1,14 @@ +/** + * @param {string} date + * @return {string} + */ +const reformatDate = function(date) { + const months = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"]; + const map = new Map(); + for (let i = 0; i < months.length; ++i) { + map.set(months[i], (i + 1 < 10 ? "0" : "") + (i+1)); + } + const parts = date.split(" "); + const day = (parts[0].length == 3 ? "0" : "") + parts[0].slice(0, parts[0].length - 2); + return parts[2] + "-" + map.get(parts[1]) + "-" + day; +}; From b9c069e1c09fd403281426d8d45b46be744aa7a9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Oct 2021 11:48:35 +0800 Subject: [PATCH 0370/2039] Create 1337-the-k-weakest-rows-in-a-matrix.js --- 1337-the-k-weakest-rows-in-a-matrix.js | 94 ++++++++++++++++++++++++++ 1 file changed, 94 insertions(+) create mode 100644 1337-the-k-weakest-rows-in-a-matrix.js diff --git a/1337-the-k-weakest-rows-in-a-matrix.js b/1337-the-k-weakest-rows-in-a-matrix.js new file mode 100644 index 00000000..77ba5790 --- /dev/null +++ b/1337-the-k-weakest-rows-in-a-matrix.js @@ -0,0 +1,94 @@ +/** + * @param {number[][]} mat + * @param {number} k + * @return {number[]} + */ +const kWeakestRows = function(mat, k) { + const pq = new PriorityQueue((a, b) => a[0] === b[0] ? a[1] > b[1] : a[0] > b[0]) + const res = [], m = mat.length + for(let i = 0; i < m; i++) { + pq.push([oneNum(mat[i]), i]) + if(pq.size() > k) pq.pop() + } + while(k > 0) res[--k] = pq.pop()[1] + return res +}; + +function oneNum(arr) { + let l = 0, h = arr.length + while(l < h) { + const mid = l + ((h - l) >> 1) + if(arr[mid] === 1) l = mid + 1 + else h = mid + } + return l +} + + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 0a5d727cf0417926be1def006e5bf3d01dd6ad32 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Oct 2021 12:01:28 +0800 Subject: [PATCH 0371/2039] Create 2032-two-out-of-three.js --- 2032-two-out-of-three.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2032-two-out-of-three.js diff --git a/2032-two-out-of-three.js b/2032-two-out-of-three.js new file mode 100644 index 00000000..e392cbbe --- /dev/null +++ b/2032-two-out-of-three.js @@ -0,0 +1,32 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number[]} nums3 + * @return {number[]} + */ +const twoOutOfThree = function(nums1, nums2, nums3) { + const res = [] + const hash = {} + for(let e of new Set(nums1)) { + if(hash[e] == null) hash[e] = 0 + hash[e] = 1 + } + + for(let e of new Set(nums2)) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + + + for(let e of new Set(nums3)) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + + Object.keys(hash).forEach(k => { + if(hash[k] > 1) res.push(k) + }) + + + return res +}; From 0c50b87c22aedc2edaa752346a7ace2f397f4f9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Oct 2021 12:02:03 +0800 Subject: [PATCH 0372/2039] Create 2033-minimum-operations-to-make-a-uni-value-grid.js --- ...mum-operations-to-make-a-uni-value-grid.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 2033-minimum-operations-to-make-a-uni-value-grid.js diff --git a/2033-minimum-operations-to-make-a-uni-value-grid.js b/2033-minimum-operations-to-make-a-uni-value-grid.js new file mode 100644 index 00000000..b434220d --- /dev/null +++ b/2033-minimum-operations-to-make-a-uni-value-grid.js @@ -0,0 +1,49 @@ +/** + * @param {number[][]} grid + * @param {number} x + * @return {number} + */ +const minOperations = function(grid, x) { + const arr = [] + const m = grid.length, n = grid[0].length + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + arr.push(grid[i][j]) + } + } + arr.sort((a, b) => a - b) + + for(let i = 1; i < m * n; i++) { + if((arr[i] - arr[i - 1]) % x !== 0) return -1 + } + const sum = arr.reduce((ac, e) => ac + e, 0) + const pre = [] + pre.push(arr[0]) + for(let i = 1; i < m * n; i++) { + pre[i] = pre[i - 1] + arr[i] + } + + let res = 0, num = 0, min = sum - arr[0] * m * n, idx = 0 + for(let i = 1; i < m * n; i++) { + const cur = (i + 1) * arr[i] - pre[i] + (sum - pre[i] - arr[i] * (m * n - i - 1)) + // console.log(cur, (i + 1) * arr[i] - pre[i], sum - pre[i] - arr[i] * (m * n - i - 1)) + // const cur = sum - arr[i] * (m * n - i) + if(cur < min) { + idx = i + min = cur + } + } + + // console.log(idx) + + for(let i = 0; i < m * n; i++) { + if(i === idx) continue + res += Math.abs(arr[i] - arr[idx]) / x + } + + return res +}; +// 20 - 6 - 4 * 2 +// 2 4 6 8 +// 1 2 3 5 + From 80a8b9e0d09b96ae398f2ee8991d5a51b8c4ac11 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Oct 2021 13:59:14 +0800 Subject: [PATCH 0373/2039] Create 2034-stock-price-fluctuation.js --- 2034-stock-price-fluctuation.js | 62 +++++++++++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 2034-stock-price-fluctuation.js diff --git a/2034-stock-price-fluctuation.js b/2034-stock-price-fluctuation.js new file mode 100644 index 00000000..67eecd73 --- /dev/null +++ b/2034-stock-price-fluctuation.js @@ -0,0 +1,62 @@ +const StockPrice = function () { + this.timeToPrice = new Map() + this.lastTime = 0 + this.minPrices = new MinPriorityQueue({ priority: (stock) => stock.price }) + this.maxPrices = new MaxPriorityQueue({ priority: (stock) => stock.price }) +} + +/** + * @param {number} timestamp + * @param {number} price + * @return {void} + */ +StockPrice.prototype.update = function (timestamp, price) { + this.timeToPrice.set(timestamp, price) + this.lastTime = Math.max(this.lastTime, timestamp) + this.minPrices.enqueue({ timestamp, price }) + this.maxPrices.enqueue({ timestamp, price }) +} + +/** + * @return {number} + */ +StockPrice.prototype.current = function () { + return this.timeToPrice.get(this.lastTime) +} + +/** + * @return {number} + */ +StockPrice.prototype.maximum = function () { + while ( + this.maxPrices.front().element.price !== + this.timeToPrice.get(this.maxPrices.front().element.timestamp) + ) { + this.maxPrices.dequeue() + } + + return this.maxPrices.front().element.price +} + +/** + * @return {number} + */ +StockPrice.prototype.minimum = function () { + while ( + this.minPrices.front().element.price !== + this.timeToPrice.get(this.minPrices.front().element.timestamp) + ) { + this.minPrices.dequeue() + } + + return this.minPrices.front().element.price +} + +/** + * Your StockPrice object will be instantiated and called as such: + * var obj = new StockPrice() + * obj.update(timestamp,price) + * var param_2 = obj.current() + * var param_3 = obj.maximum() + * var param_4 = obj.minimum() + */ From 78d53fc631c3a6a040b6a5d70c5ff28ab533b140 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Oct 2021 18:21:26 +0800 Subject: [PATCH 0374/2039] Create 2035-partition-array-into-two-arrays-to-minimize-sum-difference.js --- ...o-two-arrays-to-minimize-sum-difference.js | 97 +++++++++++++++++++ 1 file changed, 97 insertions(+) create mode 100644 2035-partition-array-into-two-arrays-to-minimize-sum-difference.js diff --git a/2035-partition-array-into-two-arrays-to-minimize-sum-difference.js b/2035-partition-array-into-two-arrays-to-minimize-sum-difference.js new file mode 100644 index 00000000..630caf18 --- /dev/null +++ b/2035-partition-array-into-two-arrays-to-minimize-sum-difference.js @@ -0,0 +1,97 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const mi = Math.min, + abs = Math.abs +const minimumDifference = (nums) => { + let m = nums.length, + n = m >> 1 + let a = initializeGraph(n + 1) + let b = initializeGraph(n + 1) + for (let i = 0; i < 1 << n; i++) { + // mask + let sum = 0, + cnt = 0 + for (let j = 0; j < n; j++) { + if (i & (1 << j)) { + // bit of 1's + sum += nums[j] + cnt++ // bit count + } else { + sum -= nums[j] + } + } + a[cnt].push(sum) + ;(sum = 0), (cnt = 0) + for (let j = 0; j < n; j++) { + if (i & (1 << j)) { + sum += nums[n + j] + cnt++ + } else { + sum -= nums[n + j] + } + } + b[cnt].push(sum) + } + for (let i = 0; i < n; i++) { + a[i].sort((x, y) => x - y) + b[i].sort((x, y) => x - y) + } + let res = Number.MAX_SAFE_INTEGER + let bi = new Bisect() + for (let i = 0; i <= n; i++) { + for (const x of a[i]) { + let idx = bi.bisect_left(b[n - i], -x) // binary search lower_bound + if (idx != b[n - i].length) res = mi(res, abs(x + b[n - i][idx])) + if (idx != 0) { + idx-- + res = mi(res, abs(x + b[n - i][idx])) + } + } + } + return res +} + +//////////////////////////////////////// Template //////////////////////////////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_right(a, x, lo = 0, hi = null) { + // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = (lo + hi) >> 1 + x < a[mid] ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_left(a, x, lo = 0, hi = null) { + // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = (lo + hi) >> 1 + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } +} + +const initializeGraph = (n) => { + let G = [] + for (let i = 0; i < n; i++) { + G.push([]) + } + return G +} +///////////////////////////////////////////////////////////////////////////////////////////////////////////// + From 7778473ec7d122914fd328a02108db9cef0b72d4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Oct 2021 10:29:07 +0800 Subject: [PATCH 0375/2039] Update 2033-minimum-operations-to-make-a-uni-value-grid.js --- ...mum-operations-to-make-a-uni-value-grid.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2033-minimum-operations-to-make-a-uni-value-grid.js b/2033-minimum-operations-to-make-a-uni-value-grid.js index b434220d..11b9f977 100644 --- a/2033-minimum-operations-to-make-a-uni-value-grid.js +++ b/2033-minimum-operations-to-make-a-uni-value-grid.js @@ -47,3 +47,31 @@ const minOperations = function(grid, x) { // 2 4 6 8 // 1 2 3 5 +// another + +/** + * @param {number[][]} grid + * @param {number} x + * @return {number} + */ +const minOperations = function(grid, x) { + const arr = [], m = grid.length, n = grid[0].length + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + arr.push(grid[i][j]) + } + } + arr.sort((a, b) => a - b) + const mid = arr[~~((m * n) / 2)] + let res = 0 + + for(let e of arr) { + if (e !== mid) { + const cur = Math.abs(e - mid) + if(cur % x !== 0) return -1 + res += cur / x + } + } + return res +}; + From 9b6f4b40e27d1e1e28f228aae1132b2e3549212d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Oct 2021 20:52:37 +0800 Subject: [PATCH 0376/2039] Update 1542-find-longest-awesome-substring.js --- 1542-find-longest-awesome-substring.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1542-find-longest-awesome-substring.js b/1542-find-longest-awesome-substring.js index a4597cc6..aaa37653 100644 --- a/1542-find-longest-awesome-substring.js +++ b/1542-find-longest-awesome-substring.js @@ -15,3 +15,27 @@ const longestAwesome = function (s) { } return res } + +// another + +/** + * @param {string} s + * @return {number} + */ +const longestAwesome = function(s) { + const n = s.length, { max, min } = Math + const dp = Array(2 ** 10).fill(n) + let res = 0, mask = 0 + dp[0] = -1 + for(let i = 0; i < n; i++) { + mask ^= (1 << parseInt(s[i])) + res = max(res, i - dp[mask]) + for(let j = 0; j <= 9; j++) { + const tmp = mask ^ (1 << j) + res = max(res, i - dp[tmp]) + } + dp[mask] = min(i, dp[mask]) + } + + return res +}; From 7bf6cf748f326a9d5d429bb324a1baf24724679b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 12 Oct 2021 21:15:48 +0800 Subject: [PATCH 0377/2039] Create 2029-stone-game-ix.js --- 2029-stone-game-ix.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 2029-stone-game-ix.js diff --git a/2029-stone-game-ix.js b/2029-stone-game-ix.js new file mode 100644 index 00000000..eea5b685 --- /dev/null +++ b/2029-stone-game-ix.js @@ -0,0 +1,10 @@ +/** + * @param {number[]} stones + * @return {boolean} + */ +const stoneGameIX = function(stones) { + const cnt = Array(3).fill(0), { abs } = Math + for (let a of stones) cnt[a % 3]++; + if (cnt[0] % 2 == 0) return cnt[1] && cnt[2] + return abs(cnt[1] - cnt[2]) >= 3 +}; From 2ef0925d86fe8ea8bc640bdd5ed9e25b61517984 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Oct 2021 19:29:44 +0800 Subject: [PATCH 0378/2039] Update 1316-distinct-echo-substrings.js --- 1316-distinct-echo-substrings.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1316-distinct-echo-substrings.js b/1316-distinct-echo-substrings.js index 26c3b1d7..4d8ecaee 100644 --- a/1316-distinct-echo-substrings.js +++ b/1316-distinct-echo-substrings.js @@ -17,3 +17,27 @@ const distinctEchoSubstrings = function (text) { } return set.size } + +// another + +/** + * @param {string} s + * @return {string} + */ +const removeDuplicateLetters = function(s) { + const last = {} + for (let i = 0; i < s.length; i++) last[s.charAt(i)] = i + const added = {} + const stack = [] + for (let i = 0; i < s.length; i++) { + const char = s.charAt(i) + if (added[char]) continue + while (stack.length && char < stack[stack.length - 1] && last[stack[stack.length - 1]] > i) { + added[stack[stack.length - 1]] = false + stack.pop() + } + stack.push(char) + added[char] = true + } + return stack.join('') +} From ae206e3bceb1223666b1378f9496eea02180eb12 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Oct 2021 19:31:30 +0800 Subject: [PATCH 0379/2039] Update 316-remove-duplicate-letters.js --- 316-remove-duplicate-letters.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/316-remove-duplicate-letters.js b/316-remove-duplicate-letters.js index e06503f9..a64a93b2 100644 --- a/316-remove-duplicate-letters.js +++ b/316-remove-duplicate-letters.js @@ -52,3 +52,27 @@ const removeDuplicateLetters = function(s) { } return String.fromCharCode(...aChNo) } + +// another + +/** + * @param {string} s + * @return {string} + */ +const removeDuplicateLetters = function(s) { + const last = {} + for (let i = 0; i < s.length; i++) last[s.charAt(i)] = i + const added = {} + const stack = [] + for (let i = 0; i < s.length; i++) { + const char = s.charAt(i) + if (added[char]) continue + while (stack.length && char < stack[stack.length - 1] && last[stack[stack.length - 1]] > i) { + added[stack[stack.length - 1]] = false + stack.pop() + } + stack.push(char) + added[char] = true + } + return stack.join('') +} From 3794274330e5b326ff8126e14935e3691ea8cc8f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Oct 2021 19:47:49 +0800 Subject: [PATCH 0380/2039] Update 1316-distinct-echo-substrings.js --- 1316-distinct-echo-substrings.js | 23 ----------------------- 1 file changed, 23 deletions(-) diff --git a/1316-distinct-echo-substrings.js b/1316-distinct-echo-substrings.js index 4d8ecaee..478c3c0a 100644 --- a/1316-distinct-echo-substrings.js +++ b/1316-distinct-echo-substrings.js @@ -18,26 +18,3 @@ const distinctEchoSubstrings = function (text) { return set.size } -// another - -/** - * @param {string} s - * @return {string} - */ -const removeDuplicateLetters = function(s) { - const last = {} - for (let i = 0; i < s.length; i++) last[s.charAt(i)] = i - const added = {} - const stack = [] - for (let i = 0; i < s.length; i++) { - const char = s.charAt(i) - if (added[char]) continue - while (stack.length && char < stack[stack.length - 1] && last[stack[stack.length - 1]] > i) { - added[stack[stack.length - 1]] = false - stack.pop() - } - stack.push(char) - added[char] = true - } - return stack.join('') -} From 27f37c26638cd65df4a6b323bba778ba40d5b52a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 14 Oct 2021 10:24:32 +0800 Subject: [PATCH 0381/2039] Update 1081-smallest-subsequence-of-distinct-characters.js --- ...lest-subsequence-of-distinct-characters.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1081-smallest-subsequence-of-distinct-characters.js b/1081-smallest-subsequence-of-distinct-characters.js index f27ff2d9..2b5e37c8 100644 --- a/1081-smallest-subsequence-of-distinct-characters.js +++ b/1081-smallest-subsequence-of-distinct-characters.js @@ -56,3 +56,26 @@ const smallestSubsequence = function(s) { return res.join('') }; +// anoother + + +/** + * @param {string} text + * @return {string} + */ +const smallestSubsequence = function(text) { + const n = text.length, stack = [], last = {}, visited = {} + for(let i = 0; i < n; i++) last[text[i]] = i + for(let i = 0; i < n; i++) { + const ch = text[i] + if (visited[ch]) continue + while(stack.length && stack[stack.length - 1] > ch && last[stack[stack.length - 1]] > i) { + visited[stack[stack.length - 1]] = 0 + stack.pop() + } + visited[ch] = 1 + stack.push(ch) + } + + return stack.join('') +}; From 4b5d92ba15eed0f11c1535e9c7a6c6127a8cb8ac Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 15 Oct 2021 14:28:06 +0800 Subject: [PATCH 0382/2039] Update 402-remove-k-digits.js --- 402-remove-k-digits.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/402-remove-k-digits.js b/402-remove-k-digits.js index ea693f3b..21ef2e47 100644 --- a/402-remove-k-digits.js +++ b/402-remove-k-digits.js @@ -48,3 +48,28 @@ const removeKdigits = function(num, k) { while(stack[0] === '0') stack.shift() return stack.length ? stack.join('') : '0' }; + +// another + +/** + * @param {string} num + * @param {number} k + * @return {string} + */ +const removeKdigits = function(num, k) { + const n = num.length, stack = [] + for(let i = 0; i < n; i++) { + const ch = num[i] + while(stack.length && k > 0 && ch < stack[stack.length - 1]) { + stack.pop() + k-- + } + stack.push(ch) + } + while(k > 0) { + stack.pop() + k-- + } + while(stack[0] === '0') stack.shift() + return stack.length ? stack.join('') : '0' +}; From 4b1064824dfb145d5d7b7e6c272beccf6f567831 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 16 Oct 2021 15:10:03 +0800 Subject: [PATCH 0383/2039] Update 1673-find-the-most-competitive-subsequence.js --- 1673-find-the-most-competitive-subsequence.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1673-find-the-most-competitive-subsequence.js b/1673-find-the-most-competitive-subsequence.js index 51acc346..bf913f46 100644 --- a/1673-find-the-most-competitive-subsequence.js +++ b/1673-find-the-most-competitive-subsequence.js @@ -43,3 +43,27 @@ const mostCompetitive = function (nums, k) { } return stack } + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +const mostCompetitive = function (nums, k) { + const n = nums.length, stack = [] + for(let i = 0; i < n; i++) { + const ch = nums[i] + while( + stack.length && + ch < stack[stack.length - 1] && + stack.length + (n - 1 - i) >= k + ) { + stack.pop() + } + if(stack.length < k) stack.push(ch) + } + return stack +} + From 834468074493c973c30354fa3471c7836e16ca01 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Oct 2021 21:10:48 +0800 Subject: [PATCH 0384/2039] Create 2044-count-number-of-maximum-bitwise-or-subsets.js --- ...unt-number-of-maximum-bitwise-or-subsets.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2044-count-number-of-maximum-bitwise-or-subsets.js diff --git a/2044-count-number-of-maximum-bitwise-or-subsets.js b/2044-count-number-of-maximum-bitwise-or-subsets.js new file mode 100644 index 00000000..496a388c --- /dev/null +++ b/2044-count-number-of-maximum-bitwise-or-subsets.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countMaxOrSubsets = function(nums) { + let res = 0, max = 0, n = nums.length + for(let num of nums) max |= num + dfs(0, 0) + dfs(0, nums[0]) + return res + + function dfs(i, cur) { + if(i === n) return + if(cur === max) return res += Math.pow(2, n - 1 - i) + dfs(i + 1, cur) + dfs(i + 1, cur | nums[i + 1]) + } +}; From fc303b0499794c0f9eb8ddf27aca3055cb618f73 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Oct 2021 21:11:23 +0800 Subject: [PATCH 0385/2039] Create 2043-simple-bank-system.js --- 2043-simple-bank-system.js | 56 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 2043-simple-bank-system.js diff --git a/2043-simple-bank-system.js b/2043-simple-bank-system.js new file mode 100644 index 00000000..95ac0446 --- /dev/null +++ b/2043-simple-bank-system.js @@ -0,0 +1,56 @@ +/** + * @param {number[]} balance + */ +const Bank = function(balance) { + this.n = balance.length + balance.unshift(0) + this.b = balance + +}; + +/** + * @param {number} account1 + * @param {number} account2 + * @param {number} money + * @return {boolean} + */ +Bank.prototype.transfer = function(account1, account2, money) { + let res = true + if(account1 > this.n || account1 < 1) return false + if(account2 > this.n || account2 < 1) return false + if(this.b[account1]< money) return false + this.b[account1] -= money + this.b[account2] += money + return true +}; + +/** + * @param {number} account + * @param {number} money + * @return {boolean} + */ +Bank.prototype.deposit = function(account, money) { + if(account > this.n || account < 1) return false + this.b[account] += money + return true +}; + +/** + * @param {number} account + * @param {number} money + * @return {boolean} + */ +Bank.prototype.withdraw = function(account, money) { + if(account > this.n || account < 1) return false + if(this.b[account] < money) return false + this.b[account] -= money + return true +}; + +/** + * Your Bank object will be instantiated and called as such: + * var obj = new Bank(balance) + * var param_1 = obj.transfer(account1,account2,money) + * var param_2 = obj.deposit(account,money) + * var param_3 = obj.withdraw(account,money) + */ From 90bfb30666faab962f027d65fb8960da7cd0476b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Oct 2021 21:11:52 +0800 Subject: [PATCH 0386/2039] Create 2042-check-if-numbers-are-ascending-in-a-sentence.js --- ...check-if-numbers-are-ascending-in-a-sentence.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2042-check-if-numbers-are-ascending-in-a-sentence.js diff --git a/2042-check-if-numbers-are-ascending-in-a-sentence.js b/2042-check-if-numbers-are-ascending-in-a-sentence.js new file mode 100644 index 00000000..1f128e49 --- /dev/null +++ b/2042-check-if-numbers-are-ascending-in-a-sentence.js @@ -0,0 +1,14 @@ +/** + * @param {string} s + * @return {boolean} + */ +const areNumbersAscending = function(s) { + const arr =s.split(' ') + const f = arr.filter(e => !Number.isNaN(+e)).map(e => +e) + let res = true + for(let i = 1; i < f.length; i++) { + if(f[i] <= f[i - 1]) return false + } + + return res +}; From e61b0ce6fd1519925d2344429a33b446050db887 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Oct 2021 21:13:45 +0800 Subject: [PATCH 0387/2039] Create 2045-second-minimum-time-to-reach-destination.js --- ...econd-minimum-time-to-reach-destination.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2045-second-minimum-time-to-reach-destination.js diff --git a/2045-second-minimum-time-to-reach-destination.js b/2045-second-minimum-time-to-reach-destination.js new file mode 100644 index 00000000..d77c8c8c --- /dev/null +++ b/2045-second-minimum-time-to-reach-destination.js @@ -0,0 +1,51 @@ +const initializeGraph = (n) => { + let G = [] + for (let i = 0; i < n; i++) { + G.push([]) + } + return G +} +const addEdgeToG = (G, Edges) => { + for (const [u, v] of Edges) { + G[u].push(v) + G[v].push(u) + } +} +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} time + * @param {number} change + * @return {number} + */ +const secondMinimum = (n, edges, time, change) => { + let adj = initializeGraph(n + 1) + addEdgeToG(adj, edges) + let cost = initializeGraph(n + 1) + let pq = new MinPriorityQueue({ priority: (x) => x[0] }) + pq.enqueue([0, 1]) + let green = 2 * change + while (pq.size()) { + let cur = pq.dequeue().element + let [t, node] = cur + if (cost[node].length == 2) continue + let nextT = + t % green < change ? t : (((t + green - 1) / green) >> 0) * green + let cn = cost[node].length + if (node == n) { + if (cn == 0 || cost[node][cn - 1] != t) { + cost[node].push(t) + } else { + continue + } + } else { + if (cn == 0 || cost[node][cn - 1] != nextT) { + cost[node].push(nextT) + } else { + continue + } + } + for (const next_node of adj[node]) pq.enqueue([nextT + time, next_node]) + } + return cost[n][1] +} From 1a2f1f3f1e0a437c5943fd80a42875e45d834325 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Oct 2021 15:49:18 +0800 Subject: [PATCH 0388/2039] Update 2033-minimum-operations-to-make-a-uni-value-grid.js --- ...mum-operations-to-make-a-uni-value-grid.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2033-minimum-operations-to-make-a-uni-value-grid.js b/2033-minimum-operations-to-make-a-uni-value-grid.js index 11b9f977..4f4698c3 100644 --- a/2033-minimum-operations-to-make-a-uni-value-grid.js +++ b/2033-minimum-operations-to-make-a-uni-value-grid.js @@ -75,3 +75,31 @@ const minOperations = function(grid, x) { return res }; +// another + +/** + * @param {number[][]} grid + * @param {number} x + * @return {number} + */ +function minOperations(grid, x) { + const m = grid.length, n = grid[0].length, mn = m * n, arr = [] + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + arr.push(grid[i][j]) + } + } + arr.sort((a, b) => a - b) + const mid = arr[~~(mn / 2)] + let res = 0 + + for(let e of arr) { + if(e !== mid) { + const delta = Math.abs(e - mid) + if(delta % x !== 0) return -1 + res += delta / x + } + } + + return res +}; From fed0822391d356db14683e1887eaf2cda545257d Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Oct 2021 21:23:00 +0800 Subject: [PATCH 0389/2039] Create 1113-reported-posts.sql --- 1113-reported-posts.sql | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 1113-reported-posts.sql diff --git a/1113-reported-posts.sql b/1113-reported-posts.sql new file mode 100644 index 00000000..5322b458 --- /dev/null +++ b/1113-reported-posts.sql @@ -0,0 +1,8 @@ +# Write your MySQL query statement below +select + extra as report_reason + ,count(distinct post_id) as report_count +from Actions +where action_date = '2019-07-04' + and action = 'report' +group by extra; From d042d85e4f03108f3c299cf2c7265b6a830727c4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Oct 2021 21:29:40 +0800 Subject: [PATCH 0390/2039] Create 1133-largest-unique-number.js --- 1133-largest-unique-number.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1133-largest-unique-number.js diff --git a/1133-largest-unique-number.js b/1133-largest-unique-number.js new file mode 100644 index 00000000..8e9ec0ca --- /dev/null +++ b/1133-largest-unique-number.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const largestUniqueNumber = function(nums) { + const hash = {} + for(let e of nums) { + hash[e] = (hash[e] || 0) + 1 + } + let res = -Infinity + Object.keys(hash).forEach(k => { + if(hash[k] === 1) { + if(+k > res) { + res = +k + } + } + }) + return res === -Infinity ? -1 : res +}; From b6c24d148c8260e4163fac23c10ec306290555fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Oct 2021 21:41:25 +0800 Subject: [PATCH 0391/2039] Create 1134-armstrong-number.js --- 1134-armstrong-number.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1134-armstrong-number.js diff --git a/1134-armstrong-number.js b/1134-armstrong-number.js new file mode 100644 index 00000000..5884e3f4 --- /dev/null +++ b/1134-armstrong-number.js @@ -0,0 +1,20 @@ +/** + * @param {number} n + * @return {boolean} + */ +const isArmstrong = function(n) { + //number of digits in N + let k = ~~(Math.log10(n) + 1); + //temporary variable (so we dont modify N) + let x = n; + //to hold sum + let sum = 0; + //get each digit + while (x !== 0) { + //add this digit^k to sum + sum += Math.pow(x % 10, k); + //get next digit + x = ~~(x/10); + } + return sum == n; +}; From 014b3c168b3398b95e60b0669e0994dcd68e9de8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Oct 2021 09:11:52 +0800 Subject: [PATCH 0392/2039] Update 1723-find-minimum-time-to-finish-all-jobs.js --- 1723-find-minimum-time-to-finish-all-jobs.js | 38 ++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1723-find-minimum-time-to-finish-all-jobs.js b/1723-find-minimum-time-to-finish-all-jobs.js index 4a61666c..e402f90d 100644 --- a/1723-find-minimum-time-to-finish-all-jobs.js +++ b/1723-find-minimum-time-to-finish-all-jobs.js @@ -45,3 +45,41 @@ const minimumTimeRequired = function (jobs, k) { dfs(0) return minLongestWorkingTime } + +// another + +/** + * @param {number[]} jobs + * @param {number} k + * @return {number} + */ +const minimumTimeRequired = function(jobs, k) { + return solution(jobs, k) +}; + +function solution(jobs, k) { + const n = jobs.length + let res = Infinity, arr = Array(k).fill(0) + + let start = 0 + bt(0) + return res + + function bt(idx) { + start++ + if(idx === n) { + res = Math.min(res, Math.max(...arr)) + return + } + const visited = new Set() + for(let j = start; j < start + k; j++) { + const i = j % k + if(visited.has(arr[i])) continue + if(arr[i] + jobs[idx] > res) continue + visited.add(arr[i]) + arr[i] += jobs[idx] + bt(idx + 1) + arr[i] -= jobs[idx] + } + } +} From 833b3b2607ec8220e2e1bca22ff22967c9181c07 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Oct 2021 09:30:57 +0800 Subject: [PATCH 0393/2039] Create 1141-user-activity-for-the-past-30-days-i.sql --- 1141-user-activity-for-the-past-30-days-i.sql | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 1141-user-activity-for-the-past-30-days-i.sql diff --git a/1141-user-activity-for-the-past-30-days-i.sql b/1141-user-activity-for-the-past-30-days-i.sql new file mode 100644 index 00000000..8b46b0d9 --- /dev/null +++ b/1141-user-activity-for-the-past-30-days-i.sql @@ -0,0 +1,5 @@ +# Write your MySQL query statement below +select activity_date as day, count(distinct user_id) as active_users +from Activity +where datediff('2019-07-27', activity_date) < 30 +group by activity_date; From b3e5b2668d6177b8abe910243b537cfafe2de597 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Oct 2021 09:40:03 +0800 Subject: [PATCH 0394/2039] Create 1148-article-views-i.sql --- 1148-article-views-i.sql | 4 ++++ 1 file changed, 4 insertions(+) create mode 100644 1148-article-views-i.sql diff --git a/1148-article-views-i.sql b/1148-article-views-i.sql new file mode 100644 index 00000000..47b0221c --- /dev/null +++ b/1148-article-views-i.sql @@ -0,0 +1,4 @@ +# Write your MySQL query statement below +SELECT DISTINCT author_id AS id FROM Views +where author_id = viewer_id +ORDER BY id; From e56488e00e1d36cd242abcd33eff12aa68dd8ffe Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Oct 2021 14:07:14 +0800 Subject: [PATCH 0395/2039] Create 1150-check-if-a-number-is-majority-element-in-a-sorted-array.js --- ...r-is-majority-element-in-a-sorted-array.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1150-check-if-a-number-is-majority-element-in-a-sorted-array.js diff --git a/1150-check-if-a-number-is-majority-element-in-a-sorted-array.js b/1150-check-if-a-number-is-majority-element-in-a-sorted-array.js new file mode 100644 index 00000000..53b5b874 --- /dev/null +++ b/1150-check-if-a-number-is-majority-element-in-a-sorted-array.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {boolean} + */ +function isMajorityElement(nums, target) { + let firstIdx = bs(nums, target) + let endIdx = firstIdx + (~~(nums.length / 2)) + if(endIdx < nums.length && nums[endIdx] === target) return true + return false +} + +function bs(arr, target) { + let l = 0, h = arr.length - 1 + while(l < h) { + const mid = l + ((h - l) >> 1) + if (arr[mid] < target) l = mid + 1 + else h = mid + } + return l +} From 0ce2abed300f5869ac45e95113a3b3b2a46a9507 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Oct 2021 14:31:25 +0800 Subject: [PATCH 0396/2039] Create 1165-single-row-keyboard.js --- 1165-single-row-keyboard.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1165-single-row-keyboard.js diff --git a/1165-single-row-keyboard.js b/1165-single-row-keyboard.js new file mode 100644 index 00000000..6a8039f2 --- /dev/null +++ b/1165-single-row-keyboard.js @@ -0,0 +1,17 @@ +/** + * @param {string} keyboard + * @param {string} word + * @return {number} + */ +const calculateTime = function(keyboard, word) { + const hash = {}, { abs } = Math + for(let i = 0; i < 26; i++) { + hash[keyboard[i]] = i + } + let pre = 0, sum = 0 + for(const ch of word) { + sum += abs(hash[ch] - pre) + pre = hash[ch] + } + return sum +}; From 8548592a9eb9e45f4558c5b10e35c83dd0574181 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 21 Oct 2021 14:21:59 +0800 Subject: [PATCH 0397/2039] Update 1478-allocate-mailboxes.js --- 1478-allocate-mailboxes.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/1478-allocate-mailboxes.js b/1478-allocate-mailboxes.js index aac971f9..0281bb7c 100644 --- a/1478-allocate-mailboxes.js +++ b/1478-allocate-mailboxes.js @@ -24,3 +24,39 @@ const minDistance = function (A, K) { } return dp[n - 1] } + +// another + +/** + * @param {number[]} houses + * @param {number} k + * @return {number} + */ +function minDistance(houses, k) { + const n = houses.length, { abs, min } = Math, INF = Infinity + houses.sort((a, b) => a - b) + const costs = Array.from({ length: 100 }, () => Array(100).fill(0)) + const memo = Array.from({ length: 100 }, () => Array(100).fill(null)) + + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + const mid = houses[~~((i + j) >> 1)] + for (let k = i; k <= j; k++) costs[i][j] += abs(mid - houses[k]) + } + } + + return dp(k, 0) + + function dp(k, i) { + if (k === 0 && i === n) return 0 + if (k === 0 || i === n) return INF + if (memo[k][i] != null) return memo[k][i] + let res = INF + for (let j = i; j < n; j++) { + res = min(res, costs[i][j] + dp(k - 1, j + 1)) + } + + return memo[k][i] = res + } +} + From ec07531427d0f79ac4c0b90ee3bcec378d889b56 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Oct 2021 16:04:40 +0800 Subject: [PATCH 0398/2039] Create 2050-parallel-courses-iii.js --- 2050-parallel-courses-iii.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2050-parallel-courses-iii.js diff --git a/2050-parallel-courses-iii.js b/2050-parallel-courses-iii.js new file mode 100644 index 00000000..288ee388 --- /dev/null +++ b/2050-parallel-courses-iii.js @@ -0,0 +1,36 @@ +/** + * @param {number} n + * @param {number[][]} relations + * @param {number[]} time + * @return {number} + */ +const minimumTime = function(n, relations, time) { + const graph = {}, dist = Array(n).fill(0), inDegree = Array(n).fill(0) + for(let [from, to] of relations) { + from--, to-- + if (graph[from] == null) graph[from] = [] + graph[from].push(to) + inDegree[to]++ + } + const q = [] + for(let i = 0; i < n; i++) { + if(inDegree[i] === 0) { + q.push(i) + dist[i] = time[i] + } + } + + while(q.length) { + const u = q.shift() + for(const v of (graph[u] || [])) { + dist[v] = Math.max(dist[v], dist[u] + time[v]) + if(--inDegree[v] === 0) q.push(v) + } + } + + let res = 0 + for(let e of dist) { + if(e > res) res = e + } + return res +}; From 57f1c620ef9e29d7f30a6556e82a07eb55ec2493 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Oct 2021 16:17:09 +0800 Subject: [PATCH 0399/2039] Create 2047-number-of-valid-words-in-a-sentence.js --- 2047-number-of-valid-words-in-a-sentence.js | 42 +++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2047-number-of-valid-words-in-a-sentence.js diff --git a/2047-number-of-valid-words-in-a-sentence.js b/2047-number-of-valid-words-in-a-sentence.js new file mode 100644 index 00000000..689fb933 --- /dev/null +++ b/2047-number-of-valid-words-in-a-sentence.js @@ -0,0 +1,42 @@ +/** + * @param {string} sentence + * @return {number} + */ +const countValidWords = function(s) { + const arr = s.split(' ') + let res = 0 + for(const e of arr) { + if(e.trim() && valid(e.trim())) res ++ + } + return res +}; + +function valid(e) { + const zi = '0'.charCodeAt(0), ni = '9'.charCodeAt(0) + const len = e.length + for(const el of e) { + if(el.charCodeAt(0) >= zi && el.charCodeAt(0) <= ni) return false + } + const num = (p, n) => (p >= 'a' && p <= 'z') && (n >= 'a' && n <= 'z') + const hi = e.indexOf('-') + if(hi !== -1) { + if(hi === 0 || hi === e.length - 1 || e.indexOf('-', hi + 1) !== -1 || !num(e[hi - 1], e[hi + 1])) return false + } + + const p1 = e.indexOf('!') + if(p1 !== -1) { + if((len > 1 && p1 !== e.length - 1) || e.indexOf('-', p1 + 1) !== -1) return false + } + + const p2 = e.indexOf('.') + if(p2 !== -1) { + if((len > 1 && p2 !== e.length - 1) || e.indexOf('-', p2 + 1) !== -1) return false + } + + const p3 = e.indexOf(',') + if(p3 !== -1) { + if((len > 1 && p3 !== e.length - 1) || e.indexOf('-', p3 + 1) !== -1) return false + } + + return true +} From 70538c736e16eaa575b856b0697d5046480533f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Oct 2021 17:54:32 +0800 Subject: [PATCH 0400/2039] Create 2048-next-greater-numerically-balanced-number.js --- ...ext-greater-numerically-balanced-number.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2048-next-greater-numerically-balanced-number.js diff --git a/2048-next-greater-numerically-balanced-number.js b/2048-next-greater-numerically-balanced-number.js new file mode 100644 index 00000000..b19e9e7a --- /dev/null +++ b/2048-next-greater-numerically-balanced-number.js @@ -0,0 +1,23 @@ +/** + * @param {number} n + * @return {number} + */ +const nextBeautifulNumber = function(n) { + while (true) { + ++n; + if (balance(n)) return n; + } + function balance(n) { + let cnt = Array(10).fill(0); + while (n) { + if (n % 10 == 0) return false; // no 0 allowed + cnt[n % 10]++; + n = ~~(n / 10); + } + for (let i = 1; i < 10; ++i) { + if (cnt[i] && cnt[i] !== i) return false; + } + return true; + } +}; + From c8103af8d8053b5ad7635e835d57d7f00ae4c3b7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Oct 2021 21:23:52 +0800 Subject: [PATCH 0401/2039] Update 373-find-k-pairs-with-smallest-sums.js --- 373-find-k-pairs-with-smallest-sums.js | 93 ++++++++++++++++++++++++++ 1 file changed, 93 insertions(+) diff --git a/373-find-k-pairs-with-smallest-sums.js b/373-find-k-pairs-with-smallest-sums.js index 6b4c9123..35fd1146 100644 --- a/373-find-k-pairs-with-smallest-sums.js +++ b/373-find-k-pairs-with-smallest-sums.js @@ -1,3 +1,96 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number[][]} + */ +const kSmallestPairs = function (nums1, nums2, k) { + const pq = new PriorityQueue((a, b) => a[0] + a[1] < b[0] + b[1]) + for(let i = 0; i < nums1.length && i < k; i++) { + pq.push([nums1[i], nums2[0], 0]) + } + const res = [] + while(k > 0 && !pq.isEmpty()) { + const [e1, e2, e2i] = pq.pop() + res.push([e1, e2]) + if(e2i + 1 < nums2.length) pq.push([e1, nums2[e2i + 1], e2i + 1]) + k-- + } + + return res +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + + +// another + /** * @param {number[]} nums1 * @param {number[]} nums2 From bcede51b99acba3b19bb12b4e34b639ffb4dda30 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Oct 2021 08:45:29 +0800 Subject: [PATCH 0402/2039] Update 560-subarray-sum-equals-k.js --- 560-subarray-sum-equals-k.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/560-subarray-sum-equals-k.js b/560-subarray-sum-equals-k.js index 5024c772..fd6021d0 100644 --- a/560-subarray-sum-equals-k.js +++ b/560-subarray-sum-equals-k.js @@ -21,3 +21,26 @@ const subarraySum = function(nums, k) { } return totalNum } + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const subarraySum = function (nums, k) { + const n = nums.length, hash = { 0: 1 } + let pre = 0 + if (nums.length === 1) { + return nums[0] === k ? 1 : 0 + } + let res = 0 + for (let i = 0; i < n; i++) { + const cur = pre + nums[i] + if (hash[cur - k] != null) res += hash[cur - k] + hash[cur] = (hash[cur] || 0) + 1 + pre = cur + } + return res +} From 8d357ccf6c34ccf2161cc24a2fda080eabd8992c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Oct 2021 08:46:13 +0800 Subject: [PATCH 0403/2039] Update 560-subarray-sum-equals-k.js --- 560-subarray-sum-equals-k.js | 3 --- 1 file changed, 3 deletions(-) diff --git a/560-subarray-sum-equals-k.js b/560-subarray-sum-equals-k.js index fd6021d0..c81bff23 100644 --- a/560-subarray-sum-equals-k.js +++ b/560-subarray-sum-equals-k.js @@ -32,9 +32,6 @@ const subarraySum = function(nums, k) { const subarraySum = function (nums, k) { const n = nums.length, hash = { 0: 1 } let pre = 0 - if (nums.length === 1) { - return nums[0] === k ? 1 : 0 - } let res = 0 for (let i = 0; i < n; i++) { const cur = pre + nums[i] From 3e92383d400a6426fdde576c098b8d13c42991f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Oct 2021 11:25:48 +0800 Subject: [PATCH 0404/2039] Update 719-find-k-th-smallest-pair-distance.js --- 719-find-k-th-smallest-pair-distance.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/719-find-k-th-smallest-pair-distance.js b/719-find-k-th-smallest-pair-distance.js index 1ef7c937..63e8a619 100644 --- a/719-find-k-th-smallest-pair-distance.js +++ b/719-find-k-th-smallest-pair-distance.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +function smallestDistancePair(nums, k) { + nums.sort((a, b) => a - b) + let l = 0, n = nums.length, r = nums[n - 1] - nums[0] + + let res = 0 + while(l < r) { + let cnt = 0, mid = l + ((r - l) >> 1) + for(let i = 0, j = 0; i < n; i++) { + while(j < n && nums[j] <= nums[i] + mid) j++ + cnt += j - 1 - i + } + if(cnt < k) l = mid + 1 + else r = mid + } + + return l +} + +// another + /** * @param {number[]} nums * @param {number} k From a25d1a8b64a32b0e5b9d06b3fbb8e288fa75dbb6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Oct 2021 20:03:03 +0800 Subject: [PATCH 0405/2039] Create 2049-count-nodes-with-the-highest-score.js --- 2049-count-nodes-with-the-highest-score.js | 26 ++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2049-count-nodes-with-the-highest-score.js diff --git a/2049-count-nodes-with-the-highest-score.js b/2049-count-nodes-with-the-highest-score.js new file mode 100644 index 00000000..cc8176fc --- /dev/null +++ b/2049-count-nodes-with-the-highest-score.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} parents + * @return {number} + */ +const countHighestScoreNodes = function(parents) { + const n = parents.length, graph = {}, hash = {} + for(let i = 1; i < n; i++) { + if(graph[parents[i]] == null) graph[parents[i]] = [] + graph[parents[i]].push(i) + } + dfs(0) + + function dfs(node) { + let product = 1, num = 0 + for(let child of (graph[node] || [])) { + const tmp = dfs(child) + product *= tmp + num += tmp + } + if(n - 1 - num > 0) product *= (n - 1 - num) + hash[product] = (hash[product] || 0) + 1 + return num + 1 + } + const maxKey = Math.max(...Object.keys(hash)) + return hash[maxKey] +}; From 7f7abea4c59849607ec176f91872ce16bc4ac6ae Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Oct 2021 09:26:20 +0800 Subject: [PATCH 0406/2039] Create 1918-kth-smallest-subarray-sum.js --- 1918-kth-smallest-subarray-sum.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1918-kth-smallest-subarray-sum.js diff --git a/1918-kth-smallest-subarray-sum.js b/1918-kth-smallest-subarray-sum.js new file mode 100644 index 00000000..cea6e615 --- /dev/null +++ b/1918-kth-smallest-subarray-sum.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const kthSmallestSubarraySum = function(nums, k) { + const sum = nums.reduce((ac, e) => ac + e, 0), n = nums.length + let l = 0, r = sum + while(l < r) { + const mid = l + ((r - l) >> 1) + let cnt = 0 + for(let i = 0, j = 0, tmp = 0; i < n; i++) { + tmp += nums[i] + while(tmp > mid) tmp -= nums[j++] + cnt += i - (j - 1) + } + if (cnt < k) l = mid + 1 + else r = mid + } + return l +}; From 29724dbdac4679a32502699b37561d3df48c1240 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Oct 2021 10:37:52 +0800 Subject: [PATCH 0407/2039] Create 2040-kth-smallest-product-of-two-sorted-arrays.js --- ...h-smallest-product-of-two-sorted-arrays.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2040-kth-smallest-product-of-two-sorted-arrays.js diff --git a/2040-kth-smallest-product-of-two-sorted-arrays.js b/2040-kth-smallest-product-of-two-sorted-arrays.js new file mode 100644 index 00000000..b1f3dadb --- /dev/null +++ b/2040-kth-smallest-product-of-two-sorted-arrays.js @@ -0,0 +1,40 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number} + */ +const kthSmallestProduct = function(nums1, nums2, k) { + const neg = nums1.filter(e => e < 0) + const pos = nums1.filter(e => e >= 0) + const negRev = neg.slice(), posRev = pos.slice() + negRev.reverse() + posRev.reverse() + + let l = - (10 ** 10), r = 10 ** 10 + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(fn(mid) < k) l = mid + 1 + else r = mid + } + + return l + + function fn(val) { + let res = 0, n = nums2.length + let l = 0, r = n - 1 + const list = val >= 0 ? negRev.concat(pos) : neg.concat(posRev) + for(let e of list) { + if(e < 0) { + while(l < n && e * nums2[l] > val) l++ + res += n - l + } else if (e === 0) { + if(val >= 0) res += n + } else { + while(r >= 0 && e * nums2[r] > val) r-- + res += r + 1 + } + } + return res + } +}; From 365dd7962c80e58aa16164fb75465cf9c3dc89ee Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 29 Oct 2021 14:36:57 +0800 Subject: [PATCH 0408/2039] Update 668-kth-smallest-number-in-multiplication-table.js --- ...smallest-number-in-multiplication-table.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/668-kth-smallest-number-in-multiplication-table.js b/668-kth-smallest-number-in-multiplication-table.js index 41128049..6e15d6e4 100644 --- a/668-kth-smallest-number-in-multiplication-table.js +++ b/668-kth-smallest-number-in-multiplication-table.js @@ -30,3 +30,33 @@ function count(m, n, target) { } return nSmaller; } + +// another + +/** + * @param {number} m + * @param {number} n + * @param {number} k + * @return {number} + */ +const findKthNumber = function(m, n, k) { + let left = 1; + let right = m * n; + while (left < right) { + const mid = Math.floor((left + right) / 2); + const num = count(m, n, mid); + if (num < k) left = mid + 1; + else right = mid; + } + return left; +}; + +function count(m, n, target) { + let res = 0; + let j = n; + for (let i = 1; i <= m; i++) { + while (i * j > target) j-- + res += j; + } + return res; +} From 5b62f50dfb8f29d9bd70eb48fa29996feda18b2e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Oct 2021 13:03:24 +0800 Subject: [PATCH 0409/2039] Create 2060-check-if-an-original-string-exists-given-two-encoded-strings.js --- ...string-exists-given-two-encoded-strings.js | 57 +++++++++++++++++++ 1 file changed, 57 insertions(+) create mode 100644 2060-check-if-an-original-string-exists-given-two-encoded-strings.js diff --git a/2060-check-if-an-original-string-exists-given-two-encoded-strings.js b/2060-check-if-an-original-string-exists-given-two-encoded-strings.js new file mode 100644 index 00000000..316408e8 --- /dev/null +++ b/2060-check-if-an-original-string-exists-given-two-encoded-strings.js @@ -0,0 +1,57 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {boolean} + */ +var possiblyEquals = function (s1, s2) { + let n = s1.length + let m = s2.length + const f = Array.from({ length: 41 }, () => + Array.from({ length: 41 }, () => Array(1001).fill(false)) + ) + f[0][0][1000] = true + + for (let i = 0; i <= n; i++) + for (let j = 0; j <= m; j++) + for (let k = 0; k < 2000; k++) { + if (!f[i][j][k]) continue + // if k==1000 means length diff is 0, so check both next charactors. + if (i + 1 <= n && j + 1 <= m && k == 1000 && s1[i] == s2[j]) { + f[i + 1][j + 1][k] = true + } + // if first string is longer or same length, extend second string. + if (k >= 1000 && j + 1 <= m) { + if (s2[j] >= 'a' && s2[j] <= 'z') { + // do not extend to be a longer string using a-z. + if (k > 1000) { + f[i][j + 1][k - 1] = true + } + } else if (s2[j] > '0') { + let cur = 0 + for (let r = j; r < m; r++) { + if (s2[r] >= '0' && s2[r] <= '9') { + cur = cur * 10 + (s2[r] - '0') + f[i][r + 1][k - cur] = true + } else break + } + } + } + // if second string is longer or same length, extend first string. + if (k <= 1000 && i + 1 <= n) { + if (s1[i] >= 'a' && s1[i] <= 'z') { + if (k < 1000) { + f[i + 1][j][k + 1] = true + } + } else if (s1[i] > '0') { + let cur = 0 + for (let r = i; r < n; r++) { + if (s1[r] >= '0' && s1[r] <= '9') { + cur = cur * 10 + (s1[r] - '0') + f[r + 1][j][k + cur] = true + } else break + } + } + } + } + return f[n][m][1000] +} From 81bb83fe911a5836b76d724c9e74a4d6cf1b6e82 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Oct 2021 13:04:11 +0800 Subject: [PATCH 0410/2039] Create 2059-minimum-operations-to-convert-number.js --- 2059-minimum-operations-to-convert-number.js | 36 ++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2059-minimum-operations-to-convert-number.js diff --git a/2059-minimum-operations-to-convert-number.js b/2059-minimum-operations-to-convert-number.js new file mode 100644 index 00000000..05e7efd5 --- /dev/null +++ b/2059-minimum-operations-to-convert-number.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @param {number} start + * @param {number} goal + * @return {number} + */ +var minimumOperations = function (nums, start, goal) { + const visited = Array(1001).fill(0) + const q = [] + q.push([start, 0]) + visited[start] = 1 + while (q.length) { + const [val, idx] = q.shift() + if (val === goal) return idx + for (let e of nums) { + if (val + e === goal) return idx + 1 + if (val + e <= 1000 && val + e >= 0 && !visited[val + e]) { + visited[val + e] = 1 + q.push([val + e, idx + 1]) + } + if (val - e === goal) return idx + 1 + if (val - e <= 1000 && val - e >= 0 && !visited[val - e]) { + visited[val - e] = 1 + q.push([val - e, idx + 1]) + } + + if ((val ^ e) === goal) return idx + 1 + if ((val ^ e) <= 1000 && (val ^ e) >= 0 && !visited[val ^ e]) { + visited[val ^ e] = 1 + q.push([val ^ e, idx + 1]) + } + } + } + + return -1 +} From f9283c29f478a637c10b4a7f216f1e7b73d7b4d4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Oct 2021 13:04:40 +0800 Subject: [PATCH 0411/2039] Create 2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.js --- ...number-of-nodes-between-critical-points.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.js diff --git a/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.js b/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.js new file mode 100644 index 00000000..efd5d273 --- /dev/null +++ b/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.js @@ -0,0 +1,33 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {number[]} + */ +const nodesBetweenCriticalPoints = function(head) { + const arr = [] + let cur = head + while(cur) { + arr.push(cur.val) + cur = cur.next + } + const idxArr = [] + const n = arr.length + for(let i = 1; i < n - 1; i++) { + if((arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) || (arr[i] < arr[i - 1] && arr[i] < arr[i + 1])) { + idxArr.push(i) + } + } + + let min = Infinity, max = -1 + for(let i = 1; i < idxArr.length; i++) { + if(idxArr[i] - idxArr[i - 1] < min) min = idxArr[i] - idxArr[i - 1] + } + if(idxArr.length > 1) max = idxArr[idxArr.length - 1] - idxArr[0] + return [min === Infinity ? -1 : min, max] +}; From 323b9dc3756684d252edec968ce77457fc010cca Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Oct 2021 13:05:04 +0800 Subject: [PATCH 0412/2039] Create 2057-smallest-index-with-equal-value.js --- 2057-smallest-index-with-equal-value.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 2057-smallest-index-with-equal-value.js diff --git a/2057-smallest-index-with-equal-value.js b/2057-smallest-index-with-equal-value.js new file mode 100644 index 00000000..c928e0da --- /dev/null +++ b/2057-smallest-index-with-equal-value.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var smallestEqual = function(nums) { + const n = nums.length + for(let i = 0; i < n; i++) { + if(i % 10 === nums[i]) return i + } + return -1 +}; From d413d0659a3c0062f49346941446b65baaf86719 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 1 Nov 2021 17:25:38 +0800 Subject: [PATCH 0413/2039] Update 1263-minimum-moves-to-move-a-box-to-their-target-location.js --- ...-to-move-a-box-to-their-target-location.js | 83 +++++++++++++++++++ 1 file changed, 83 insertions(+) diff --git a/1263-minimum-moves-to-move-a-box-to-their-target-location.js b/1263-minimum-moves-to-move-a-box-to-their-target-location.js index 0d950897..b92dbab3 100644 --- a/1263-minimum-moves-to-move-a-box-to-their-target-location.js +++ b/1263-minimum-moves-to-move-a-box-to-their-target-location.js @@ -281,3 +281,86 @@ const minPushBox = function (grid) { } } +// another + +/** + * @param {character[][]} grid + * @return {number} + */ + const minPushBox = function (grid) { + const m = grid.length, + n = grid[0].length + let target, person, box + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (grid[i][j] === 'T') target = [i, j] + else if (grid[i][j] === 'B') box = [i, j] + else if (grid[i][j] === 'S') person = [i, j] + } + } + + const valid = ([x, y]) => { + return x >= 0 && x < m && y >= 0 && y < n && grid[x][y] !== '#' + } + + const check = (cur, dest, box) => { + const q = [cur] + const visited = new Set([`${box[0]},${box[1]}`]) + const dirs = [ + [-1, 0], + [1, 0], + [0, 1], + [0, -1], + ] + + while (q.length) { + const pos = q.shift() + if (pos.join(',') === dest.join(',')) return true + const newPos = [] + for (const [dx, dy] of dirs) newPos.push([pos[0] + dx, pos[1] + dy]) + for (const [nx, ny] of newPos) { + const k = `${nx},${ny}` + if (valid([nx, ny]) && !visited.has(k)) { + visited.add(k) + q.push([nx, ny]) + } + } + } + + return false + } + + const q = [[0, box, person]] + const vis = new Set([`${box.join(',')},${person.join(',')}`]) + while (q.length) { + const [dist, box, person] = q.shift() + if (box.join(',') === target.join(',')) return dist + + const bCoord = [ + [box[0] + 1, box[1]], + [box[0] - 1, box[1]], + [box[0], box[1] + 1], + [box[0], box[1] - 1], + ] + const pCoord = [ + [box[0] - 1, box[1]], + [box[0] + 1, box[1]], + [box[0], box[1] - 1], + [box[0], box[1] + 1], + ] + + for (let i = 0; i < 4; i++) { + const [newBox, newPerson] = [bCoord[i], pCoord[i]] + const key = `${newBox.join(',')},${box.join(',')}` + if (valid(newBox) && !vis.has(key)) { + if (valid(newPerson) && check(person, newPerson, box)) { + vis.add(key) + q.push([dist + 1, newBox, box]) + } + } + } + } + + return -1 +} + From 222e3fa75622394cb7124aa5a23f6989cd7e5ca9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Nov 2021 09:33:23 +0800 Subject: [PATCH 0414/2039] Update 543-diameter-of-binary-tree.js --- 543-diameter-of-binary-tree.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/543-diameter-of-binary-tree.js b/543-diameter-of-binary-tree.js index a8d6dd5f..aa2efec2 100755 --- a/543-diameter-of-binary-tree.js +++ b/543-diameter-of-binary-tree.js @@ -23,3 +23,30 @@ const diameterOfBinaryTree = function (root) { return longest - 1 } +// another + +/** + * 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} + */ +const diameterOfBinaryTree = function(root) { + let res = 0 + dfs(root) + return res + + function dfs(node) { + if(node == null) return 0 + const left = dfs(node.left), right = dfs(node.right) + res = Math.max(res, left + right) + return Math.max(left, right) + 1 + } +}; + From 45fb60ae65a5e4ee7180ee5fea1c7bfff39ddacb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Nov 2021 10:11:18 +0800 Subject: [PATCH 0415/2039] Update 687-longest-univalue-path.js --- 687-longest-univalue-path.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/687-longest-univalue-path.js b/687-longest-univalue-path.js index baa86b5f..123bfd54 100644 --- a/687-longest-univalue-path.js +++ b/687-longest-univalue-path.js @@ -1,3 +1,37 @@ + +/** + * 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} + */ +const longestUnivaluePath = function(root) { + let res = 0 + dfs(root) + return res + + function dfs(node) { + if(node == null) return 0 + let left = dfs(node.left), right = dfs(node.right) + if(node.left && node.left.val === node.val) left++ + else left = 0 + + if(node.right && node.right.val === node.val) right++ + else right = 0 + + res = Math.max(res, left + right) + return Math.max(left, right) + } +}; + +// another + /** * Definition for a binary tree node. * function TreeNode(val) { From a6835c80e891d67c55f59c7a1f85ae4736556b17 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Nov 2021 22:17:59 +0800 Subject: [PATCH 0416/2039] Update 224-basic-calculator.js --- 224-basic-calculator.js | 43 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/224-basic-calculator.js b/224-basic-calculator.js index 9705eb73..002c0d40 100644 --- a/224-basic-calculator.js +++ b/224-basic-calculator.js @@ -34,3 +34,46 @@ const calculate = function(s) { } return res + sign * num } + +// another + +/** + * @param {string} s + * @return {number} + */ +const calculate = function(s) { + s = s.split(' ').join('') + const n = s.length, stack = [] + const isNum = ch => ch >= '0' && ch <= '9' + let num = 0, op = 1, res = 0 + for(let i = 0; i < n; i++) { + const ch = s[i] + if(isNum(ch)) { + num = num * 10 + (+ch) + } else { + if(ch === '(') { + stack.push(res) + stack.push(op) + num = 0 + op = 1 + res = 0 + } else if(ch === ')') { + res += num * op + res *= stack.pop() + res += stack.pop() + num = 0 + op = 1 + } else if(ch === '+') { + res += op * num + op = 1 + num = 0 + } else if(ch === '-') { + res += op * num + op = -1 + num = 0 + } + } + } + + return res + op * num +}; From b1edcb0253691afbf44b80de10f551ba91e2d578 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Nov 2021 20:56:31 +0800 Subject: [PATCH 0417/2039] Create 1266-minimum-time-visiting-all-points.js --- 1266-minimum-time-visiting-all-points.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1266-minimum-time-visiting-all-points.js diff --git a/1266-minimum-time-visiting-all-points.js b/1266-minimum-time-visiting-all-points.js new file mode 100644 index 00000000..3cd447b9 --- /dev/null +++ b/1266-minimum-time-visiting-all-points.js @@ -0,0 +1,19 @@ +/** + * @param {number[][]} points + * @return {number} + */ +const minTimeToVisitAllPoints = function(points) { + let res = 0 + for(let i = 1; i < points.length; i++) { + res += calc(points[i], points[i - 1]) + } + return res + + function calc(p1, p2) { + const [x1, y1] = p1, [x2, y2] = p2 + const { abs, min } = Math + const deltaX = abs(x1 - x2), deltaY = abs(y1 - y2) + + return min(deltaX, deltaY) + abs(deltaX - deltaY) + } +}; From 622269895abf1d4e8cf7d63993afc347196ed0ab Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Nov 2021 21:00:50 +0800 Subject: [PATCH 0418/2039] Create 1342-number-of-steps-to-reduce-a-number-to-zero.js --- ...-number-of-steps-to-reduce-a-number-to-zero.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1342-number-of-steps-to-reduce-a-number-to-zero.js diff --git a/1342-number-of-steps-to-reduce-a-number-to-zero.js b/1342-number-of-steps-to-reduce-a-number-to-zero.js new file mode 100644 index 00000000..9da8bfa9 --- /dev/null +++ b/1342-number-of-steps-to-reduce-a-number-to-zero.js @@ -0,0 +1,15 @@ +/** + * @param {number} num + * @return {number} + */ +const numberOfSteps = function(num) { + let res = 0 + while(num !== 0) { + if(num % 2 === 0) { + num /= 2 + } else num-- + res++ + } + + return res +}; From 46fbc777cb8cf911d06a4fccb32e3f054b04ce57 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Nov 2021 21:09:59 +0800 Subject: [PATCH 0419/2039] Create 1213-intersection-of-three-sorted-arrays.js --- 1213-intersection-of-three-sorted-arrays.js | 31 +++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 1213-intersection-of-three-sorted-arrays.js diff --git a/1213-intersection-of-three-sorted-arrays.js b/1213-intersection-of-three-sorted-arrays.js new file mode 100644 index 00000000..d0ff8fb3 --- /dev/null +++ b/1213-intersection-of-three-sorted-arrays.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @param {number[]} arr3 + * @return {number[]} + */ +const arraysIntersection = function(arr1, arr2, arr3) { + const common = [], n1 = arr1.length, n2 = arr2.length, n3 = arr3.length + let p1 = 0, p2 = 0, p3 = 0 + while(p1 < n1 && p2 < n2) { + if(arr1[p1] === arr2[p2]) { + common.push(arr1[p1]) + p1++ + p2++ + } else if(arr1[p1] < arr2[p2]) p1++ + else p2++ + } + const res = [], nc = common.length + let pc = 0 + while(pc < nc && p3 < n3) { + if(common[pc] === arr3[p3]) { + res.push(arr3[p3]) + pc++ + p3++ + } else if(common[pc] < arr3[p3]) pc++ + else p3++ + } + + + return res +}; From 505fdea1d9d3328d0400e00c8b620f13a73e7c67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Nov 2021 21:13:17 +0800 Subject: [PATCH 0420/2039] Update 1213-intersection-of-three-sorted-arrays.js --- 1213-intersection-of-three-sorted-arrays.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1213-intersection-of-three-sorted-arrays.js b/1213-intersection-of-three-sorted-arrays.js index d0ff8fb3..3984750c 100644 --- a/1213-intersection-of-three-sorted-arrays.js +++ b/1213-intersection-of-three-sorted-arrays.js @@ -29,3 +29,24 @@ const arraysIntersection = function(arr1, arr2, arr3) { return res }; + +// another + +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @param {number[]} arr3 + * @return {number[]} + */ +const arraysIntersection = function(arr1, arr2, arr3) { + let a=0,b=0,c=0; + const res = []; + while(a Date: Thu, 4 Nov 2021 21:29:18 +0800 Subject: [PATCH 0421/2039] Create 1228-missing-number-in-arithmetic-progression.js --- 1228-missing-number-in-arithmetic-progression.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1228-missing-number-in-arithmetic-progression.js diff --git a/1228-missing-number-in-arithmetic-progression.js b/1228-missing-number-in-arithmetic-progression.js new file mode 100644 index 00000000..6bccbb36 --- /dev/null +++ b/1228-missing-number-in-arithmetic-progression.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const missingNumber = function(arr) { + const n = arr.length + + for(let i = 1 ; i < n - 1; i++) { + const d1 = arr[i] - arr[i - 1], d2 = arr[i + 1] - arr[i] + if(d1 === d2) continue + if(d1 / d2 === 2) return arr[i - 1] + d1 / 2 + if(d2 / d1 === 2) return arr[i] + d2 / 2 + } + return arr[0] +}; From 9845a381a70e855cdb3aa71e17409729ed976f56 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Nov 2021 09:24:50 +0800 Subject: [PATCH 0422/2039] Update 124-binary-tree-maximum-path-sum.js --- 124-binary-tree-maximum-path-sum.js | 32 +++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/124-binary-tree-maximum-path-sum.js b/124-binary-tree-maximum-path-sum.js index 5f53f2dc..68e174a9 100644 --- a/124-binary-tree-maximum-path-sum.js +++ b/124-binary-tree-maximum-path-sum.js @@ -26,3 +26,35 @@ function traverse(node, obj) { return node.val + Math.max(left, right) } +// another + +/** + * 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} + */ +const maxPathSum = function(root) { + let res = -Infinity + dfs(root) + return res + + function dfs(node) { + if(node == null) return 0 + let left = dfs(node.left), right = dfs(node.right) + res = Math.max( + res, + node.val, + node.val + left, + node.val + right, + node.val + left + right, + ) + return Math.max(node.val, node.val + left, node.val + right) + } +}; From de52b1418285486d5ef7ccb03ba39bb194004263 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Nov 2021 15:01:58 +0800 Subject: [PATCH 0423/2039] Create 1394-find-lucky-integer-in-an-array.js --- 1394-find-lucky-integer-in-an-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1394-find-lucky-integer-in-an-array.js diff --git a/1394-find-lucky-integer-in-an-array.js b/1394-find-lucky-integer-in-an-array.js new file mode 100644 index 00000000..8805447d --- /dev/null +++ b/1394-find-lucky-integer-in-an-array.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const findLucky = function(arr) { + const hash = {} + for(let e of arr) hash[e] = (hash[e] || 0) + 1 + let res + Object.keys(hash).forEach(k => { + if(+k === hash[k]) { + if (res == null) res = hash[k] + else { + if (hash[k] > res) res = hash[k] + } + } + }) + return res == null ? -1 : res +}; From f6f52d04e71a46b43aa395590160587783590c4b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Nov 2021 15:33:51 +0800 Subject: [PATCH 0424/2039] Create 1441-build-an-array-with-stack-operations.js --- 1441-build-an-array-with-stack-operations.js | 22 ++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1441-build-an-array-with-stack-operations.js diff --git a/1441-build-an-array-with-stack-operations.js b/1441-build-an-array-with-stack-operations.js new file mode 100644 index 00000000..7cadddb6 --- /dev/null +++ b/1441-build-an-array-with-stack-operations.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} target + * @param {number} n + * @return {string[]} + */ + const buildArray = function(target, n) { + const res = [] + let ti = 0, ni = 1, num = 0 + while(num !== target.length && ni <= n) { + if(ni !== target[ti]) { + res.push('Push', 'Pop') + ni++ + }else { + res.push('Push') + ni++ + num++ + ti++ + } + } + + return res +}; From 83fb8fd2a2eb04b09ed7f2afc784a74285729926 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Nov 2021 16:12:37 +0800 Subject: [PATCH 0425/2039] Create 1991-find-the-middle-index-in-array.js --- 1991-find-the-middle-index-in-array.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1991-find-the-middle-index-in-array.js diff --git a/1991-find-the-middle-index-in-array.js b/1991-find-the-middle-index-in-array.js new file mode 100644 index 00000000..7cd927ea --- /dev/null +++ b/1991-find-the-middle-index-in-array.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findMiddleIndex = function(nums) { + const n = nums.length, leftSum = Array(n + 1).fill(0) + const sum = nums.reduce((ac, e) => ac + e, 0) + for(let i = 0; i < n; i++) { + leftSum[i+1] = leftSum[i] + nums[i] + } + + let res + for(let i = 0; i < n; i++) { + if(leftSum[i] === sum - leftSum[i] - nums[i]) { + res = i + break + } + } + + return res == null ? -1 : res +}; From 9004782b244ed266ca464cc80d028a30251f075c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Nov 2021 16:14:47 +0800 Subject: [PATCH 0426/2039] Update 1991-find-the-middle-index-in-array.js --- 1991-find-the-middle-index-in-array.js | 12 +++++------- 1 file changed, 5 insertions(+), 7 deletions(-) diff --git a/1991-find-the-middle-index-in-array.js b/1991-find-the-middle-index-in-array.js index 7cd927ea..e2d5fcea 100644 --- a/1991-find-the-middle-index-in-array.js +++ b/1991-find-the-middle-index-in-array.js @@ -3,18 +3,16 @@ * @return {number} */ const findMiddleIndex = function(nums) { - const n = nums.length, leftSum = Array(n + 1).fill(0) + const n = nums.length const sum = nums.reduce((ac, e) => ac + e, 0) + + let res, leftSum = 0 for(let i = 0; i < n; i++) { - leftSum[i+1] = leftSum[i] + nums[i] - } - - let res - for(let i = 0; i < n; i++) { - if(leftSum[i] === sum - leftSum[i] - nums[i]) { + if(leftSum === sum - leftSum - nums[i]) { res = i break } + leftSum += nums[i] } return res == null ? -1 : res From 095273b830e384c3536427e845a6e30b1c8be165 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Nov 2021 16:46:58 +0800 Subject: [PATCH 0427/2039] Create 1309-decrypt-string-from-alphabet-to-integer-mapping.js --- ...string-from-alphabet-to-integer-mapping.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 1309-decrypt-string-from-alphabet-to-integer-mapping.js diff --git a/1309-decrypt-string-from-alphabet-to-integer-mapping.js b/1309-decrypt-string-from-alphabet-to-integer-mapping.js new file mode 100644 index 00000000..01066f4f --- /dev/null +++ b/1309-decrypt-string-from-alphabet-to-integer-mapping.js @@ -0,0 +1,32 @@ +/** + * @param {string} s + * @return {string} + */ +const freqAlphabets = function(s) { + const n = s.length, a = 'a'.charCodeAt(0) - 1 + let res = '', cur = '', num = 0 + + for(let i = n - 1; i >= 0; i--) { + const ch = s[i] + if(cur === '') { + if(ch === '#') { + cur = ch + num = 0 + } else{ + res = (String.fromCharCode(a + (+ch))) + res + } + } else { + if (num < 1) { + cur = ch + cur + num++ + } else { + cur = ch + cur + const tmp = cur.slice(0,cur.length - 1) + res = (String.fromCharCode(a + (+tmp))) + res + cur = '' + num = 0 + } + } + } + return res +}; From aeaa1dc22481f71364422b053ecd26b4e25664ea Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 6 Nov 2021 18:51:46 +0800 Subject: [PATCH 0428/2039] Update 207-course-schedule.js --- 207-course-schedule.js | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/207-course-schedule.js b/207-course-schedule.js index bbec50c5..1b6c9473 100644 --- a/207-course-schedule.js +++ b/207-course-schedule.js @@ -72,3 +72,40 @@ const canFinish = function(vertices, edges) { } return sortedOrder.length === vertices ? true : false } + +// another + +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @return {boolean} + */ +const canFinish = function(numCourses, prerequisites) { + const set = new Set(), hash = {} + for(let i = 0; i < prerequisites.length; i++) { + const [cur, pre] = prerequisites[i] + if(hash[cur] == null) hash[cur] = new Set() + hash[cur].add(pre) + } + const q = [] + + for(let i = 0; i < numCourses; i++) { + if(hash[i] == null) q.push(i) + } + let visited = 0 + + while(q.length) { + const cur = q.shift() + visited++ + Object.keys(hash).forEach(k => { + if(hash[k].has(cur)) { + hash[k].delete(cur) + } + if(hash[k].size === 0) { + delete hash[k] + q.push(+k) + } + }) + } + return visited === numCourses +}; From eff4d7da456238603eee58b079ee42409b0d7112 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 6 Nov 2021 21:36:56 +0800 Subject: [PATCH 0429/2039] Update 207-course-schedule.js --- 207-course-schedule.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/207-course-schedule.js b/207-course-schedule.js index 1b6c9473..26831e37 100644 --- a/207-course-schedule.js +++ b/207-course-schedule.js @@ -1,3 +1,41 @@ +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @return {boolean} + */ +const canFinish = function(numCourses, prerequisites) { + const [graph, inDegree] = buildGraph(numCourses, prerequisites) + + const q = [] + for(let i = 0; i < numCourses; i++) { + if(inDegree.get(i) == null) q.push(i) + } + let num = 0 + while(q.length) { + const pre = q.pop() + num++ + for(const next of (graph.get(pre) || [])) { + inDegree.set(next, inDegree.get(next) - 1) + if(inDegree.get(next) === 0) q.push(next) + } + } + return num === numCourses + + + function buildGraph(n, arr) { + const res = new Map(), inDegree = new Map() + for(const [cur, pre] of arr) { + if(res.get(pre) == null) res.set(pre, new Set()) + res.get(pre).add(cur) + if(inDegree.get(cur) == null) inDegree.set(cur, 0) + inDegree.set(cur, inDegree.get(cur) + 1) + } + return [res, inDegree] + } +}; + +// another + /** * @param {number} numCourses * @param {number[][]} prerequisites From ecdade323771b1277da83a9cf38c5c8757bef171 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Nov 2021 12:50:12 +0800 Subject: [PATCH 0430/2039] Create 2065-maximum-path-quality-of-a-graph.js --- 2065-maximum-path-quality-of-a-graph.js | 39 +++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2065-maximum-path-quality-of-a-graph.js diff --git a/2065-maximum-path-quality-of-a-graph.js b/2065-maximum-path-quality-of-a-graph.js new file mode 100644 index 00000000..419e1986 --- /dev/null +++ b/2065-maximum-path-quality-of-a-graph.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} values + * @param {number[][]} edges + * @param {number} maxTime + * @return {number} + */ +const maximalPathQuality = function(values, edges, maxTime) { + let zeroMax = 0; + let n = values.length; + let ll = Array.from({length: n + 1}, () => []) + for (let edge of edges) { + let u = edge[0]; + let v = edge[1]; + let t = edge[2]; + ll[u].push([v, t]); + ll[v].push([u, t]); + } + const visited = Array(n + 1).fill(false); + dfs(0, 0, 0, maxTime, visited); + return zeroMax; + + function dfs(val, curNode, curTime, maxTime, visited) { + if (curTime > maxTime) { + return; + } + let before = visited[curNode]; + if (!visited[curNode]) { + val += values[curNode]; + visited[curNode] = true; + } + if (curNode == 0) { + zeroMax = Math.max(zeroMax, val); + } + for (let next of (ll[curNode] || [])) { + dfs(val, next[0], curTime + next[1], maxTime, visited); + } + visited[curNode] = before; + } +}; From 7c0abb666675ce552e02983bae779dda4a9dd35a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Nov 2021 12:50:56 +0800 Subject: [PATCH 0431/2039] Create 2064-minimized-maximum-of-products-distributed-to-any-store.js --- ...um-of-products-distributed-to-any-store.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2064-minimized-maximum-of-products-distributed-to-any-store.js diff --git a/2064-minimized-maximum-of-products-distributed-to-any-store.js b/2064-minimized-maximum-of-products-distributed-to-any-store.js new file mode 100644 index 00000000..d6b13e04 --- /dev/null +++ b/2064-minimized-maximum-of-products-distributed-to-any-store.js @@ -0,0 +1,24 @@ +/** + * @param {number} n + * @param {number[]} quantities + * @return {number} + */ +var minimizedMaximum = function(n, quantities) { + let MAX = 0; + for (let x of quantities) MAX = Math.max(x, MAX); + let l = 1, r = MAX; + while (l < r) { + let mid = Math.floor((l + r) / 2); + if (valid(quantities, mid) <= n) r = mid; + else l = mid + 1; + } + return l; +}; + + + + function valid(quantities, max) { + let cnt = 0; + for (let x of quantities) cnt += Math.floor(x / max) + ((x % max) ? 1 : 0); + return cnt; + } From 45646058d4180cf6213dce9dcca5470774b4ba20 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Nov 2021 12:51:37 +0800 Subject: [PATCH 0432/2039] Create 2063-vowels-of-all-substrings.js --- 2063-vowels-of-all-substrings.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2063-vowels-of-all-substrings.js diff --git a/2063-vowels-of-all-substrings.js b/2063-vowels-of-all-substrings.js new file mode 100644 index 00000000..f05e18ed --- /dev/null +++ b/2063-vowels-of-all-substrings.js @@ -0,0 +1,20 @@ +/** + * @param {string} word + * @return {number} + */ +const countVowels = function(word) { + let res = 0n + const n = BigInt(word.length) + const set = new Set(['a', 'e', 'i', 'o', 'u']) + const dp = Array(n + 1n).fill(0n) + for(let i = 0n; i < n; i++) { + const ch = word[i] + if(set.has(ch)) dp[i + 1n] = dp[i] + (i + 1n) + else dp[i + 1n] = dp[i] + } + + for(const e of dp) res += e + return res +}; + + From 8e571f757b134e66f6bab0d2e7dcfd4ed0b61bf1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Nov 2021 12:52:07 +0800 Subject: [PATCH 0433/2039] Create 2062-count-vowel-substrings-of-a-string.js --- 2062-count-vowel-substrings-of-a-string.js | 27 ++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2062-count-vowel-substrings-of-a-string.js diff --git a/2062-count-vowel-substrings-of-a-string.js b/2062-count-vowel-substrings-of-a-string.js new file mode 100644 index 00000000..6645120c --- /dev/null +++ b/2062-count-vowel-substrings-of-a-string.js @@ -0,0 +1,27 @@ +/** + * @param {string} word + * @return {number} + */ +const countVowelSubstrings = function(word) { + let res = 0, n= word.length + for(let i = 0; i < n - 1;i++) { + for(let j = i + 1;j < n; j++) { + if(valid(word, i, j)) res++ + } + } + + return res + + function valid(s, i, j) { + const set = new Set(['a', 'e', 'i', 'o','u']) + const vis = new Set() + for(let idx = i; idx <= j; idx++) { + if(!set.has(s[idx])) return false + else { + vis.add(s[idx]) + } + } + // console.log(vis) + return vis.size === 5 + } +}; From e6a54230c86969051548a000f8d29a47b2f76fc2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Nov 2021 19:44:20 +0800 Subject: [PATCH 0434/2039] Update 1462-course-schedule-iv.js --- 1462-course-schedule-iv.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1462-course-schedule-iv.js b/1462-course-schedule-iv.js index 33ec5f9c..f9a76d50 100644 --- a/1462-course-schedule-iv.js +++ b/1462-course-schedule-iv.js @@ -20,3 +20,28 @@ const checkIfPrerequisite = function(numCourses, prerequisites, queries) { for(let q of queries) res.push(connected[q[0]][q[1]]) return res }; + +// another + +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @param {number[][]} queries + * @return {boolean[]} + */ +const checkIfPrerequisite = function (numCourses, prerequisites, queries) { + const n = numCourses + const connected = Array.from({ length: n }, () => Array(n).fill(false)) + for (let p of prerequisites) connected[p[0]][p[1]] = true + for (let k = 0; k < n; k++) { + for (let i = 0; i < n; i++) { + for (let j = 0; j < n; j++) { + connected[i][j] = + connected[i][j] || (connected[i][k] && connected[k][j]) + } + } + } + const res = [] + for (let q of queries) res.push(connected[q[0]][q[1]]) + return res +} From 1d6d10abde06a96ea113719bd21fcaf7642850dd Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Nov 2021 21:23:02 +0800 Subject: [PATCH 0435/2039] Update 1462-course-schedule-iv.js --- 1462-course-schedule-iv.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1462-course-schedule-iv.js b/1462-course-schedule-iv.js index f9a76d50..3d882210 100644 --- a/1462-course-schedule-iv.js +++ b/1462-course-schedule-iv.js @@ -45,3 +45,41 @@ const checkIfPrerequisite = function (numCourses, prerequisites, queries) { for (let q of queries) res.push(connected[q[0]][q[1]]) return res } + +// another + +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @param {number[][]} queries + * @return {boolean[]} + */ +const checkIfPrerequisite = function (numCourses, prerequisites, queries) { + const graph = {}, + connected = Array.from({ length: numCourses }, () => + Array(numCourses).fill(-1) + ) + for (const [u, v] of prerequisites) { + if (graph[u] == null) graph[u] = [] + graph[u].push(v) + connected[u][v] = 1 + } + + const res = [] + for (const [u, v] of queries) res.push(dfs(u, v)) + + return res + + function dfs(u, v) { + if (connected[u][v] !== -1) return connected[u][v] + let res = false + for (const next of graph[u] || []) { + if (!res) { + res ||= dfs(next, v) + } else break + } + connected[u][v] = res + return res + } +} + From bee98e332bab4518eac55bfc8c9c84d7a5bb7e53 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 10 Nov 2021 16:27:46 +0800 Subject: [PATCH 0436/2039] Update 2050-parallel-courses-iii.js --- 2050-parallel-courses-iii.js | 39 ++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/2050-parallel-courses-iii.js b/2050-parallel-courses-iii.js index 288ee388..97ad7213 100644 --- a/2050-parallel-courses-iii.js +++ b/2050-parallel-courses-iii.js @@ -1,3 +1,42 @@ +/** + * @param {number} n + * @param {number[][]} relations + * @param {number[]} time + * @return {number} + */ +const minimumTime = function(n, relations, time) { + const graph = {}, dist = Array(n).fill(0), inDegree = Array(n).fill(0) + + for(let [pre, next] of relations) { + pre--, next-- + if(graph[pre] == null) graph[pre] = [] + graph[pre].push(next) + inDegree[next]++ + } + + const q = [] + for(let i = 0; i < n; i++) { + if(inDegree[i] === 0) { + q.push(i) + dist[i] = time[i] + } + } + + let res = 0 + while(q.length) { + const cur = q.shift() + for(const next of (graph[cur] || [])) { + dist[next] = Math.max(dist[next], dist[cur] + time[next]) + inDegree[next]-- + if(inDegree[next] === 0) q.push(next) + } + } + + return Math.max(...dist) +} + +// another + /** * @param {number} n * @param {number[][]} relations From 613f7e1862705e461d17d8324353dfaeafaacd17 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 10 Nov 2021 19:27:55 +0800 Subject: [PATCH 0437/2039] Create 1260-shift-2d-grid.js --- 1260-shift-2d-grid.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1260-shift-2d-grid.js diff --git a/1260-shift-2d-grid.js b/1260-shift-2d-grid.js new file mode 100644 index 00000000..e5ede767 --- /dev/null +++ b/1260-shift-2d-grid.js @@ -0,0 +1,24 @@ +/** + * @param {number[][]} grid + * @param {number} k + * @return {number[][]} + */ +const shiftGrid = function(grid, k) { + for(let i = 0; i < k; i++) once(grid) + return grid +}; + +function once(grid) { + const m = grid.length, n = grid[0].length + let last = grid[m - 1][n - 1] + for(let i = 0; i < m; i++) { + let pre = grid[i][0] + for(let j = 1; j < n; j++) { + let cur = grid[i][j] + grid[i][j] = pre + pre = cur + } + grid[i][0] = last + last = pre + } +} From 4f6ee0cabfee6e30ece8305460f3a038d6146343 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Nov 2021 13:43:53 +0800 Subject: [PATCH 0438/2039] Update 1246-palindrome-removal.js --- 1246-palindrome-removal.js | 54 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/1246-palindrome-removal.js b/1246-palindrome-removal.js index a7947edc..0ba60612 100644 --- a/1246-palindrome-removal.js +++ b/1246-palindrome-removal.js @@ -34,3 +34,57 @@ const minimumMoves = function (arr) { } return dp[0][n - 1] } + +// another + +/** + * @param {number[]} arr + * @return {number} + */ + const minimumMoves = function (arr) { + const n = arr.length + + const dp = Array.from({ length: n }, () => Array(n).fill(n)) + + for(let i = 0; i < n; i++) dp[i][i] = 1 + for(let i = 0; i < n - 1; i++) { + dp[i][i + 1] = arr[i] === arr[i + 1] ? 1 : 2 + } + + for(let size = 3; size <= n; size++) { + for(let i = 0; i + size - 1 < n; i++) { + const right = i + size - 1 + if(arr[i] === arr[right]) dp[i][right] = dp[i + 1][right - 1] + for(let j = i; j < right; j++) { + dp[i][right] = Math.min(dp[i][right], dp[i][j] + dp[j + 1][right]) + } + } + } + + return dp[0][n - 1] +}/** + * @param {number[]} arr + * @return {number} + */ + const minimumMoves = function (arr) { + const n = arr.length + + const dp = Array.from({ length: n }, () => Array(n).fill(n)) + + for(let i = 0; i < n; i++) dp[i][i] = 1 + for(let i = 0; i < n - 1; i++) { + dp[i][i + 1] = arr[i] === arr[i + 1] ? 1 : 2 + } + + for(let size = 3; size <= n; size++) { + for(let i = 0; i + size - 1 < n; i++) { + const right = i + size - 1 + if(arr[i] === arr[right]) dp[i][right] = dp[i + 1][right - 1] + for(let j = i; j < right; j++) { + dp[i][right] = Math.min(dp[i][right], dp[i][j] + dp[j + 1][right]) + } + } + } + + return dp[0][n - 1] +} From fa61bf1824dedc8ecbca591fda43a90437b0f63a Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Nov 2021 13:44:19 +0800 Subject: [PATCH 0439/2039] Update 1246-palindrome-removal.js --- 1246-palindrome-removal.js | 25 ------------------------- 1 file changed, 25 deletions(-) diff --git a/1246-palindrome-removal.js b/1246-palindrome-removal.js index 0ba60612..f73084af 100644 --- a/1246-palindrome-removal.js +++ b/1246-palindrome-removal.js @@ -62,29 +62,4 @@ const minimumMoves = function (arr) { } return dp[0][n - 1] -}/** - * @param {number[]} arr - * @return {number} - */ - const minimumMoves = function (arr) { - const n = arr.length - - const dp = Array.from({ length: n }, () => Array(n).fill(n)) - - for(let i = 0; i < n; i++) dp[i][i] = 1 - for(let i = 0; i < n - 1; i++) { - dp[i][i + 1] = arr[i] === arr[i + 1] ? 1 : 2 - } - - for(let size = 3; size <= n; size++) { - for(let i = 0; i + size - 1 < n; i++) { - const right = i + size - 1 - if(arr[i] === arr[right]) dp[i][right] = dp[i + 1][right - 1] - for(let j = i; j < right; j++) { - dp[i][right] = Math.min(dp[i][right], dp[i][j] + dp[j + 1][right]) - } - } - } - - return dp[0][n - 1] } From 75c039aa85b698d9265a105c895d6f1c111a0856 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Nov 2021 16:41:43 +0800 Subject: [PATCH 0440/2039] Update 312-burst-balloons.js --- 312-burst-balloons.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/312-burst-balloons.js b/312-burst-balloons.js index 1509854d..a6cb9fa8 100644 --- a/312-burst-balloons.js +++ b/312-burst-balloons.js @@ -1,3 +1,28 @@ +function maxCoins(arr) { + const len = arr.length + const nums = Array(len + 2).fill(0); + let n = 1; + for (const x of arr) if (x > 0) nums[n++] = x; + nums[0] = nums[n++] = 1; + + const dp = Array.from({ length: n }, () => Array(n).fill(0)); + for (let k = 2; k < n; k++) { + for (let left = 0; left < n - k; left++) { + let right = left + k; + for (let i = left + 1; i < right; i++) { + dp[left][right] = Math.max( + dp[left][right], + nums[left] * nums[i] * nums[right] + dp[left][i] + dp[i][right], + ); + } + } + } + + return dp[0][n - 1]; +} + +// another + /** * @param {number[]} nums * @return {number} From b80d4815f1b6938af99eb81a56e66d3126e41130 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Nov 2021 20:13:18 +0800 Subject: [PATCH 0441/2039] Create 2073-time-needed-to-buy-tickets.js --- 2073-time-needed-to-buy-tickets.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2073-time-needed-to-buy-tickets.js diff --git a/2073-time-needed-to-buy-tickets.js b/2073-time-needed-to-buy-tickets.js new file mode 100644 index 00000000..f468ef72 --- /dev/null +++ b/2073-time-needed-to-buy-tickets.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} tickets + * @param {number} k + * @return {number} + */ +const timeRequiredToBuy = function(tickets, k) { + let res = 0 + + while(tickets[k] !== 0) { + res += helper(tickets, k) + } + + return res + + function helper(arr, k) { + let tmp = 0 + for(let i = 0; i < arr.length; i++) { + if(arr[i] > 0) { + arr[i]-- + tmp++ + } + if(arr[k] === 0) break + } + return tmp + } + +}; From cee6733b945d3b3d9e52e73c455b792e8063ae43 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Nov 2021 20:13:47 +0800 Subject: [PATCH 0442/2039] Create 2074-reverse-nodes-in-even-length-groups.js --- 2074-reverse-nodes-in-even-length-groups.js | 41 +++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 2074-reverse-nodes-in-even-length-groups.js diff --git a/2074-reverse-nodes-in-even-length-groups.js b/2074-reverse-nodes-in-even-length-groups.js new file mode 100644 index 00000000..357cdfb3 --- /dev/null +++ b/2074-reverse-nodes-in-even-length-groups.js @@ -0,0 +1,41 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const reverseEvenLengthGroups = function(head) { + const arr = [] + let cur = head + while(cur) { + arr.push(cur) + cur = cur.next + } + let len = 1, res = [] + for(let i = 0, n = arr.length; i < n; ) { + let backup = len, tmp = [], rev = len % 2 === 0 + while(len && i < n) { + tmp.push(arr[i]) + i++ + len-- + } + if((tmp.length % 2 === 0) ) { + tmp.reverse() + } + res.push(...tmp) + len = backup + 1 + } + for(let i = 0; i < res.length; i++) { + if(i === res.length - 1) res[i].next = null + else { + res[i].next = res[i + 1] + } + } + + return res[0] +}; From 4a0899ba1fe2de8164b43577075835dccd6cb483 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Nov 2021 20:20:15 +0800 Subject: [PATCH 0443/2039] Create 2075-decode-the-slanted-ciphertext.js --- 2075-decode-the-slanted-ciphertext.js | 29 +++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2075-decode-the-slanted-ciphertext.js diff --git a/2075-decode-the-slanted-ciphertext.js b/2075-decode-the-slanted-ciphertext.js new file mode 100644 index 00000000..d0b88b7d --- /dev/null +++ b/2075-decode-the-slanted-ciphertext.js @@ -0,0 +1,29 @@ +/** + * @param {string} encodedText + * @param {number} rows + * @return {string} + */ +var decodeCiphertext = function(encodedText, rows) { + let n = encodedText.length; + let cols = ~~(n / rows); + const matrix = Array.from({ length: rows }, () => Array(cols).fill('')) + for (let i = 0; i < rows; i++) { + for (let j = 0; j < cols; j++) { + matrix[i][j] = encodedText[i * cols + j]; + } + } + let ans = ""; + for (let i = 0; i < cols; i++) { + let t = Math.min(rows, cols - i); + for (let j = 0; j < t; j++) { + ans += matrix[j][i + j]; + } + } + let idx = ans.length - 1 + for(; idx >= 0; idx--) { + if(ans[idx] === ' ') continue + else break + } + return ans.slice(0, idx + 1); +}; + From 8a95fdf908c10c3669d2595a37da51b7a609ab23 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Nov 2021 20:29:13 +0800 Subject: [PATCH 0444/2039] Create 2076-process-restricted-friend-requests.js --- 2076-process-restricted-friend-requests.js | 40 ++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2076-process-restricted-friend-requests.js diff --git a/2076-process-restricted-friend-requests.js b/2076-process-restricted-friend-requests.js new file mode 100644 index 00000000..a757b1c9 --- /dev/null +++ b/2076-process-restricted-friend-requests.js @@ -0,0 +1,40 @@ +/** + * @param {number} n + * @param {number[][]} restrictions + * @param {number[][]} requests + * @return {boolean[]} + */ +var friendRequests = function(n, restrictions, requests) { + function validation(arr) { + for (const [x, y] of restrictions) { + if (arr[x] == arr[y]) return false + } + + return true + } + + + + let groupId = [] + for(let i = 0; i < n; i++) groupId.push(i) + + + const ans = [] + for(let [u, v] of requests) { + if (v < u) [u, v] = [v, u] + const tmp = groupId.slice() + + for(let i = 0; i < n; i++) { + if (tmp[i] == groupId[v]) tmp[i] = groupId[u] + } + + if (validation(tmp)) { + ans.push(true) + groupId = tmp + } else ans.push(false) + } + + + return ans +}; + From 73dff679a61ab180deddf73a848529b52b64a11a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Nov 2021 10:18:44 +0800 Subject: [PATCH 0445/2039] Update 524-longest-word-in-dictionary-through-deleting.js --- ...est-word-in-dictionary-through-deleting.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/524-longest-word-in-dictionary-through-deleting.js b/524-longest-word-in-dictionary-through-deleting.js index ffd815ae..70141249 100644 --- a/524-longest-word-in-dictionary-through-deleting.js +++ b/524-longest-word-in-dictionary-through-deleting.js @@ -1,3 +1,26 @@ +/** + * @param {string} s + * @param {string[]} dictionary + * @return {string} + */ + const findLongestWord = function(s, dictionary) { + let res = '' + for (const word of dictionary) { + let j = 0 + for (let i = 0, len = s.length; i < len; i++) { + if(word[j] === s[i]) j++ + if(j === word.length) { + if(word.length > res.length) res = word + else if(word.length === res.length && word < res) res = word + break + } + } + } + return res +}; + +// another + /** * @param {string} s * @param {string[]} dictionary From 6426e976e951b97183e60a2273c0b1cacfd9d540 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Nov 2021 13:51:22 +0800 Subject: [PATCH 0446/2039] Update 727-minimum-window-subsequence.js --- 727-minimum-window-subsequence.js | 39 +++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/727-minimum-window-subsequence.js b/727-minimum-window-subsequence.js index c75b04cc..ce26ad1b 100644 --- a/727-minimum-window-subsequence.js +++ b/727-minimum-window-subsequence.js @@ -1,3 +1,42 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {string} + */ +const minWindow = function (s1, s2) { + let n1 = s1.length, + n2 = s2.length, + s1Idx = 0, + s2Idx = 0, + start = -1, + len = n1 + 1 + while (s1Idx < n1) { + if (s1[s1Idx] === s2[s2Idx]) { + if (s2Idx === n2 - 1) { + const end = s1Idx + while (s2Idx >= 0) { + while (s1[s1Idx] !== s2[s2Idx]) s1Idx-- + s2Idx-- + s1Idx-- + } + const tmp = end - s1Idx + if (tmp < len) { + len = tmp + start = s1Idx + 1 + } + s2Idx++ + s1Idx += 2 + } else { + s2Idx++ + s1Idx++ + } + } else s1Idx++ + } + return start === -1 ? '' : s1.slice(start, start + len) +} + +// another + /** * @param {string} s1 * @param {string} s2 From c58974cf14f6dd546e58259149c507ae63d73e15 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Nov 2021 15:53:34 +0800 Subject: [PATCH 0447/2039] Create 2055-plates-between-candles.js --- 2055-plates-between-candles.js | 38 ++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2055-plates-between-candles.js diff --git a/2055-plates-between-candles.js b/2055-plates-between-candles.js new file mode 100644 index 00000000..a5f6cc3a --- /dev/null +++ b/2055-plates-between-candles.js @@ -0,0 +1,38 @@ +/** + * @param {string} s + * @param {number[][]} queries + * @return {number[]} + */ +const platesBetweenCandles = function(s, queries) { + const n = s.length, + leftCandlePos = Array(n).fill(-1) + rightCandlePos = Array(n).fill(-1) + candleCnt = Array(n).fill(0) + let pos = -1 + for(let i = 0; i < n; i++) { + if(s[i] === '|') pos = i + leftCandlePos[i] = pos + } + pos = -1 + for(let i = n - 1; i >= 0; i--) { + if(s[i] === '|') pos = i + rightCandlePos[i] = pos + } + for(let i = 0, cnt = 0; i < n; i++) { + if(s[i] === '|') cnt++ + candleCnt[i] = cnt + } + + const len = queries.length, res = Array(len).fill(0) + + for(let i = 0; i < len; i++) { + const [left, right] = queries[i] + const leftCandle = rightCandlePos[left], rightCandle = leftCandlePos[right] + const delta = rightCandle - leftCandle + if(leftCandle !== -1 && rightCandle !== -1 && delta > 1) { + res[i] = delta + 1 - (candleCnt[rightCandle] - candleCnt[leftCandle] + 1) + } + } + + return res +} From d234e833852920dbb8f153b25900064c4f3393cb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 14:22:18 +0800 Subject: [PATCH 0448/2039] Create 2054-two-best-non-overlapping-events.js --- 2054-two-best-non-overlapping-events.js | 30 +++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2054-two-best-non-overlapping-events.js diff --git a/2054-two-best-non-overlapping-events.js b/2054-two-best-non-overlapping-events.js new file mode 100644 index 00000000..a7037b03 --- /dev/null +++ b/2054-two-best-non-overlapping-events.js @@ -0,0 +1,30 @@ + +/** + * @param {number[][]} events + * @return {number} + */ +const maxTwoEvents = function(events) { + const n = events.length + events.sort((a, b) => a[0] - b[0]) + const dp = Array.from({ length: n }, () => Array(3).fill(-1)) + + return dfs(0, 0) + + function dfs(idx, cnt) { + if(cnt === 2 || idx >= n) return 0 + if(dp[idx][cnt] === -1) { + let end = events[idx][1] + let lo = idx + 1, hi = n - 1; + while (lo < hi) { + const mid = lo + ((hi - lo) >> 1); + if (events[mid][0] <= end) lo = mid + 1 + else hi = mid; + } + const include = events[idx][2] + (lo < n && events[lo][0] > end ? dfs(lo, cnt + 1) : 0); + const exclude = dfs(idx + 1, cnt); + dp[idx][cnt] = Math.max(include, exclude); + } + + return dp[idx][cnt] + } +}; From a9206f33ebd5baa3bff06a3d39536cf76673a0c5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 15:07:49 +0800 Subject: [PATCH 0449/2039] Update 2054-two-best-non-overlapping-events.js --- 2054-two-best-non-overlapping-events.js | 88 +++++++++++++++++++++++++ 1 file changed, 88 insertions(+) diff --git a/2054-two-best-non-overlapping-events.js b/2054-two-best-non-overlapping-events.js index a7037b03..07adffa0 100644 --- a/2054-two-best-non-overlapping-events.js +++ b/2054-two-best-non-overlapping-events.js @@ -28,3 +28,91 @@ const maxTwoEvents = function(events) { return dp[idx][cnt] } }; + +// another + +/** + * @param {number[][]} events + * @return {number} + */ +const maxTwoEvents = function(events) { + const n = events.length, { max } = Math + let res = 0, maxVal = 0; + const pq = new PriorityQueue((a, b) => a[0] < b[0]); + events.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + for (let e of events) { + for(; !pq.isEmpty() && pq.peek()[0] < e[0]; pq.pop()) + maxVal = max(maxVal, pq.peek()[1]); + res = max(res, maxVal + e[2]); + pq.push([e[1], e[2]]); + } + return res; +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 2790d3df25c466173f5c2989cb7426a5712af189 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 16:42:37 +0800 Subject: [PATCH 0450/2039] Create 2068-check-whether-two-strings-are-almost-equivalent.js --- ...ether-two-strings-are-almost-equivalent.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2068-check-whether-two-strings-are-almost-equivalent.js diff --git a/2068-check-whether-two-strings-are-almost-equivalent.js b/2068-check-whether-two-strings-are-almost-equivalent.js new file mode 100644 index 00000000..7c242d12 --- /dev/null +++ b/2068-check-whether-two-strings-are-almost-equivalent.js @@ -0,0 +1,21 @@ +/** + * @param {string} word1 + * @param {string} word2 + * @return {boolean} + */ +const checkAlmostEquivalent = function(word1, word2) { + const a = 'a'.charCodeAt(0), n = word1.length + const arr1 = Array(26).fill(0), arr2 = Array(26).fill(0) + + for(const ch of word1) { + arr1[ch.charCodeAt(0) - a]++ + } + for(const ch of word2) { + arr2[ch.charCodeAt(0) - a]++ + } + for(let i = 0; i < 26; i++) { + if(Math.abs(arr1[i] - arr2[i]) > 3) return false + } + + return true +}; From f9ceb590826ad0fd463d6524f651a6a86c0de710 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 16:47:00 +0800 Subject: [PATCH 0451/2039] Create 1941-check-if-all-characters-have-equal-number-of-occurrences.js --- ...aracters-have-equal-number-of-occurrences.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1941-check-if-all-characters-have-equal-number-of-occurrences.js diff --git a/1941-check-if-all-characters-have-equal-number-of-occurrences.js b/1941-check-if-all-characters-have-equal-number-of-occurrences.js new file mode 100644 index 00000000..dfc28545 --- /dev/null +++ b/1941-check-if-all-characters-have-equal-number-of-occurrences.js @@ -0,0 +1,17 @@ +/** + * @param {string} s + * @return {boolean} + */ +var areOccurrencesEqual = function(s) { + const n = s.length + const arr = Array(26).fill(0), a = 'a'.charCodeAt(0) + for(const ch of s) { + arr[ch.charCodeAt(0) - a]++ + } + const set = new Set() + for(const e of arr) { + if(e !== 0) set.add(e) + if(set.size > 1) return false + } + return true +}; From ed827e88b636af62ba6634e42295eb3a158f9e13 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 17:13:41 +0800 Subject: [PATCH 0452/2039] Create 1971-find-if-path-exists-in-graph.js --- 1971-find-if-path-exists-in-graph.js | 29 ++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 1971-find-if-path-exists-in-graph.js diff --git a/1971-find-if-path-exists-in-graph.js b/1971-find-if-path-exists-in-graph.js new file mode 100644 index 00000000..154edce0 --- /dev/null +++ b/1971-find-if-path-exists-in-graph.js @@ -0,0 +1,29 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} start + * @param {number} end + * @return {boolean} + */ +const validPath = function(n, edges, start, end) { + const graph = {} + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = new Set() + if(graph[v] == null) graph[v] = new Set() + graph[u].add(v) + graph[v].add(u) + } + const q = [start], visited = new Set() + visited.add(start) + while(q.length) { + const cur = q.shift() + if(cur === end) return true + for(const next of graph[cur]) { + if(visited.has(next)) continue + q.push(next) + visited.add(next) + } + } + + return false +}; From 86e71ae7681e2a93d100125f184c2393b396d908 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 17:33:30 +0800 Subject: [PATCH 0453/2039] Create 1925-count-square-sum-triples.js --- 1925-count-square-sum-triples.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1925-count-square-sum-triples.js diff --git a/1925-count-square-sum-triples.js b/1925-count-square-sum-triples.js new file mode 100644 index 00000000..dbc871df --- /dev/null +++ b/1925-count-square-sum-triples.js @@ -0,0 +1,19 @@ +/** + * @param {number} n + * @return {number} + */ +const countTriples = function(n) { + let res = 0 + const hash = {} + for(let i = 1; i<= n; i++) { + hash[i * i] = 1 + } + + for(let i = 1; i <= n; i++) { + for(let j = i; i * i + j * j <= n * n; j++) { + res += (hash[i * i + j * j] || 0) * 2 + } + } + + return res +}; From df6d5567a51978b36d30fca26ce06dc28cdb654f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 20:19:46 +0800 Subject: [PATCH 0454/2039] Create 1464-maximum-product-of-two-elements-in-an-array.js --- ...imum-product-of-two-elements-in-an-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1464-maximum-product-of-two-elements-in-an-array.js diff --git a/1464-maximum-product-of-two-elements-in-an-array.js b/1464-maximum-product-of-two-elements-in-an-array.js new file mode 100644 index 00000000..cdd33d69 --- /dev/null +++ b/1464-maximum-product-of-two-elements-in-an-array.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxProduct = function(nums) { + const n = nums.length + let res = 0, m1 = 0, m2 = 0 + for(const e of nums) { + if(e > m1) { + m2 = m1 + m1 = e + } else if(e > m2) { + m2 = e + } + } + + return (m1 - 1) * (m2 - 1) +}; From 2817bc8da6eab111cc2118a3aa8cda8b2b0ebd7d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 20:46:23 +0800 Subject: [PATCH 0455/2039] Create 1511-customer-order-frequency.sql --- 1511-customer-order-frequency.sql | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 1511-customer-order-frequency.sql diff --git a/1511-customer-order-frequency.sql b/1511-customer-order-frequency.sql new file mode 100644 index 00000000..1994419b --- /dev/null +++ b/1511-customer-order-frequency.sql @@ -0,0 +1,7 @@ +# Write your MySQL query statement below +SELECT customer_id, name +FROM Customers JOIN Orders USING(customer_id) + JOIN Product USING(product_id) +GROUP BY customer_id +HAVING SUM(IF(LEFT(order_date, 7) = '2020-06', quantity, 0) * price) >= 100 + AND SUM(IF(LEFT(order_date, 7) = '2020-07', quantity, 0) * price) >= 100; From 5250cc05dfc83933b6c7b54aa88a7e9d045e0b4a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Nov 2021 21:47:35 +0800 Subject: [PATCH 0456/2039] Create 1460-make-two-arrays-equal-by-reversing-sub-arrays.js --- ...wo-arrays-equal-by-reversing-sub-arrays.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1460-make-two-arrays-equal-by-reversing-sub-arrays.js diff --git a/1460-make-two-arrays-equal-by-reversing-sub-arrays.js b/1460-make-two-arrays-equal-by-reversing-sub-arrays.js new file mode 100644 index 00000000..843cbe89 --- /dev/null +++ b/1460-make-two-arrays-equal-by-reversing-sub-arrays.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} target + * @param {number[]} arr + * @return {boolean} + */ +const canBeEqual = function(target, arr) { + if(target.length !== arr.length) return false + const tHash = {}, aHash = {} + for(let i = 0, len = arr.length; i < len;i++) { + const t = target[i], a = arr[i] + if(tHash[t] == null) tHash[t] = 0 + if(aHash[a] == null) aHash[a] = 0 + tHash[t]++ + aHash[a]++ + } + + const keys = Object.keys(tHash) + for(let k of keys) { + if(tHash[k] !== aHash[k]) return false + } + + return true +}; From e0bba0818fc219be581de961bcaf8dc1a071ba08 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 Nov 2021 09:23:46 +0800 Subject: [PATCH 0457/2039] Update 69-sqrt(x).js --- 69-sqrt(x).js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/69-sqrt(x).js b/69-sqrt(x).js index d392b5ee..3e3da29d 100755 --- a/69-sqrt(x).js +++ b/69-sqrt(x).js @@ -1,3 +1,22 @@ +/** + * @param {number} x + * @return {number} + */ +const mySqrt = function(x) { + let left = 0, right = x; + while (left < right) { + let mid = right - ((right - left) >> 1); + if (mid * mid > x) { + right = mid - 1; + } else { + left = mid; + } + } + return left; +}; + +// another + /** * @param {number} x * @return {number} From 73026c57c8fe232af275d7587a9965e71b42bce5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 19 Nov 2021 09:38:44 +0800 Subject: [PATCH 0458/2039] Update 2008-maximum-earnings-from-taxi.js --- 2008-maximum-earnings-from-taxi.js | 31 ++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2008-maximum-earnings-from-taxi.js b/2008-maximum-earnings-from-taxi.js index e1b42d22..eb4fb356 100644 --- a/2008-maximum-earnings-from-taxi.js +++ b/2008-maximum-earnings-from-taxi.js @@ -19,3 +19,34 @@ const maxTaxiEarnings = function(n, rides) { } return dp[1]; }; + +// another + +/** + * @param {number} n + * @param {number[][]} rides + * @return {number} + */ +const maxTaxiEarnings = function(n, rides) { + const size = rides.length + rides.sort((a, b) => a[1] - b[1]) + const dp = [[0,0]] + for(const [s, e, t] of rides) { + const cur = bs(dp, s) + (e - s + t) + if(cur > dp[dp.length - 1][1]) { + dp.push([e, cur]) + } + } + return dp[dp.length - 1][1] + + function bs(arr, t) { + let l = 0, r = arr.length - 1 + while(l < r) { + const mid = r - ((r - l) >> 1) + if(arr[mid][0] > t) r = mid - 1 + else l = mid + } + // console.log(arr, t, l) + return arr[l][1] + } +}; From a9cf2e7786a1d46ba1b4fe5556fbc2addb1ba700 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Nov 2021 15:29:53 +0800 Subject: [PATCH 0459/2039] Create 2078-two-furthest-houses-with-different-colors.js --- ...o-furthest-houses-with-different-colors.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2078-two-furthest-houses-with-different-colors.js diff --git a/2078-two-furthest-houses-with-different-colors.js b/2078-two-furthest-houses-with-different-colors.js new file mode 100644 index 00000000..0e3c6406 --- /dev/null +++ b/2078-two-furthest-houses-with-different-colors.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} colors + * @return {number} + */ +const maxDistance = function(colors) { + const n = colors.length + let res = 0 + for(let i = 1; i < n; i++) { + const cur = colors[i] + for(let j = 0; j < i; j++) { + if(colors[i] !== colors[j]) { + res = Math.max(res, i - j) + break + } + } + } + + return res +}; From fae139a187dd06bf32eb8f6c723089bda67b6207 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Nov 2021 15:30:20 +0800 Subject: [PATCH 0460/2039] Create 2079-watering-plants.js --- 2079-watering-plants.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2079-watering-plants.js diff --git a/2079-watering-plants.js b/2079-watering-plants.js new file mode 100644 index 00000000..b2c784d9 --- /dev/null +++ b/2079-watering-plants.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} plants + * @param {number} capacity + * @return {number} + */ +const wateringPlants = function(plants, capacity) { + let res = 0, cap = capacity, full = capacity + for(let i = 0, n = plants.length; i < n; i++) { + const cur = plants[i] + cap -= cur + if(cap >= 0) res++ + else { + res = res + (i + i + 1) + cap = full - cur + } + } + + return res +}; From ee1d5c54fa4d3040db934bceb7492e4fff8242c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Nov 2021 15:34:27 +0800 Subject: [PATCH 0461/2039] Create 2080-range-frequency-queries.js --- 2080-range-frequency-queries.js | 69 +++++++++++++++++++++++++++++++++ 1 file changed, 69 insertions(+) create mode 100644 2080-range-frequency-queries.js diff --git a/2080-range-frequency-queries.js b/2080-range-frequency-queries.js new file mode 100644 index 00000000..c474380b --- /dev/null +++ b/2080-range-frequency-queries.js @@ -0,0 +1,69 @@ +//////////////////////////////////////////////Template///////////////////////////////////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi); + a.splice(lo, 0, x); + } + function bisect_right(a, x, lo = 0, hi = null) { // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative'); + if (hi == null) hi = a.length; + while (lo < hi) { + let mid = parseInt((lo + hi) / 2); + x < a[mid] ? hi = mid : lo = mid + 1; + } + return lo; + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi); + a.splice(lo, 0, x); + } + function bisect_left(a, x, lo = 0, hi = null) { // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative'); + if (hi == null) hi = a.length; + while (lo < hi) { + let mid = parseInt((lo + hi) / 2); + a[mid] < x ? lo = mid + 1 : hi = mid; + } + return lo; + } +} + +// counter with {value: array indices (increasing order)} +const counter_value_in_indexA_in = (a_or_s) => { let m = new Map(); let n = a_or_s.length; for (let i = 0; i < n; i++) { if (!m.has(a_or_s[i])) m.set(a_or_s[i], []); m.get(a_or_s[i]).push(i); } return m; }; +////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + +/** + * @param {number[]} arr + */ +var RangeFreqQuery = function(arr) { + let a = arr + this.m = counter_value_in_indexA_in(a) + this.bi = new Bisect(); +}; + +/** + * @param {number} left + * @param {number} right + * @param {number} value + * @return {number} + */ +RangeFreqQuery.prototype.query = function(left, right, value) { + let l = left, r =right, x = value, m = this.m, bi = this.bi + if (!m.has(x)) return 0; + let a = m.get(x), len = a.length; + let min = a[0], max = a[len - 1]; + if (l <= min && r >= max) return len; // cover all + if (r < min || l > max) return 0; // out of bound + let lbs = bi.bisect_left(a, l); // needs lbs >= l (lower bound will find first >= l) + let ubs = bi.bisect_right(a, r); // needs ubs <= r (upper bound will find first ubs > r, -1 will guarantee <= r) + ubs--; + return ubs - lbs + 1; +}; + +/** + * Your RangeFreqQuery object will be instantiated and called as such: + * var obj = new RangeFreqQuery(arr) + * var param_1 = obj.query(left,right,value) + */ + From 839e609b68cabf68775adfa801ce1a3f1e5ac4bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Nov 2021 15:36:05 +0800 Subject: [PATCH 0462/2039] Create 2081-sum-of-k-mirror-numbers.js --- 2081-sum-of-k-mirror-numbers.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2081-sum-of-k-mirror-numbers.js diff --git a/2081-sum-of-k-mirror-numbers.js b/2081-sum-of-k-mirror-numbers.js new file mode 100644 index 00000000..118be589 --- /dev/null +++ b/2081-sum-of-k-mirror-numbers.js @@ -0,0 +1,26 @@ +const isPalindrome = (s) => { let n = s.length; let i = 0; let j = n - 1; while (i < j) { if (s[i++] != s[j--]) return false; } return true; }; + +const int = parseInt; +/** + * @param {number} k + * @param {number} n + * @return {number} + */ +var kMirror = function(k, n) { + let res = 0; + for (let len = 1; ; len++) { + let min = 10 ** ((len - 1) >> 1), max = 10 ** ((len + 1) >> 1); + for (let base = min; base < max; base++) { + let x = base; + for (let i = len & 1 ? int(base / 10) : base; i > 0; i = int(i / 10)) { + x = x * 10 + i % 10; + } + let s = x.toString(k); + if (isPalindrome(s)) { + res += x; + n--; + if (!n) return res; + } + } + } +}; From 8f5595bdaad1e6941ea21e791e242b5fb6420950 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Nov 2021 15:48:26 +0800 Subject: [PATCH 0463/2039] Update 2060-check-if-an-original-string-exists-given-two-encoded-strings.js --- ...string-exists-given-two-encoded-strings.js | 69 ++++++++++++++++++- 1 file changed, 67 insertions(+), 2 deletions(-) diff --git a/2060-check-if-an-original-string-exists-given-two-encoded-strings.js b/2060-check-if-an-original-string-exists-given-two-encoded-strings.js index 316408e8..042ee1ec 100644 --- a/2060-check-if-an-original-string-exists-given-two-encoded-strings.js +++ b/2060-check-if-an-original-string-exists-given-two-encoded-strings.js @@ -1,3 +1,68 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {boolean} + */ +const possiblyEquals = function(s1, s2) { + const n = s1.length + const m = s2.length + const memo = Array.from({ length: n + 1 }, () => + Array.from({ length: m + 1 }, () => Array(1001).fill(null)) + ) + memo[0][0][1000] = true + + return dfs(0, 0, 0) + + function dfs(i, j, diff) { + if(memo[i][j][diff] != null) return memo[i][j][diff] + let res = false + if (i == n && j == m) res = diff === 0 + else if (i < n && isDigit(s1[i])) { + let ii = i + while (ii < n && isDigit( s1[ii] )) ii += 1 + for (let x of helper(s1.slice(i, ii))) { + if (dfs(ii, j, diff-x)) res = true + } + } else if (j < m && isDigit( s2[j] )) { + let jj = j + while (jj < m && isDigit( s2[jj] )) jj += 1 + for (let y of helper(s2.slice(j, jj))) { + if (dfs(i, jj, diff+y)) res = true + } + } else if (diff == 0) { + if (i < n && j < m && s1[i] == s2[j]) res = dfs(i+1, j+1, 0) + } else if (diff > 0) { + if (i < n) res = dfs(i+1, j, diff-1) + } else { + if (j < m) res = dfs(i, j+1, diff+1) + } + + memo[i][j][diff] = res + return res + } + + function isDigit(ch) { + return ch >= '0' && ch <= '9' + } + + function helper(str) { + const ans = new Set() + ans.add(+str) + for(let i = 1, len = str.length; i < len; i++) { + const pre = helper(str.slice(0, i)) + const post = helper(str.slice(i)) + for(let p of pre) { + for(let n of post) { + ans.add(p + n) + } + } + } + return Array.from(ans) + } +}; + +// another + /** * @param {string} s1 * @param {string} s2 @@ -6,8 +71,8 @@ var possiblyEquals = function (s1, s2) { let n = s1.length let m = s2.length - const f = Array.from({ length: 41 }, () => - Array.from({ length: 41 }, () => Array(1001).fill(false)) + const f = Array.from({ length: n + 1 }, () => + Array.from({ length: m + 1 }, () => Array(1001).fill(false)) ) f[0][0][1000] = true From d7348eeaba32a6c06bc9bc6b602140910df567cf Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Nov 2021 15:54:18 +0800 Subject: [PATCH 0464/2039] Update 2060-check-if-an-original-string-exists-given-two-encoded-strings.js --- ...string-exists-given-two-encoded-strings.js | 61 +++++++++++++++++++ 1 file changed, 61 insertions(+) diff --git a/2060-check-if-an-original-string-exists-given-two-encoded-strings.js b/2060-check-if-an-original-string-exists-given-two-encoded-strings.js index 042ee1ec..12be2ab2 100644 --- a/2060-check-if-an-original-string-exists-given-two-encoded-strings.js +++ b/2060-check-if-an-original-string-exists-given-two-encoded-strings.js @@ -1,3 +1,64 @@ +function possiblyEquals(s1, s2) { + const n = s1.length, m = s2.length; + const dp = Array.from({ length: n + 1 }, v => Array.from({ length: m + 1}, w => new Set())); + dp[0][0].add(0); + + for (let i = 0; i <= n; i++) { + for (let j = 0; j <= m; j++) { + for (let delta of dp[i][j]) { + // s1 is number + let num = 0; + if (delta <= 0) { + for (let p = i; i < Math.min(i + 3, n); p++) { + if (isDigit(s1[p])) { + num = num * 10 + Number(s1[p]); + dp[p + 1][j].add(delta + num); + } else { + break; + } + } + } + + // s2 is number + num = 0; + if (delta >= 0) { + for (let q = j; q < Math.min(j + 3, m); q++) { + if (isDigit(s2[q])) { + num = num * 10 + Number(s2[q]); + dp[i][q + 1].add(delta - num); + } else { + break; + } + } + } + + // match s1 non-digit character + if (i < n && delta < 0 && !isDigit(s1[i])) { + dp[i + 1][j].add(delta + 1); + } + + // match s2 non-digit character + if (j < m && delta > 0 && !isDigit(s2[j])) { + dp[i][j + 1].add(delta - 1); + } + + // two non-digit character match + if (i < n && j < m && delta == 0 && s1[i] == s2[j]) { + dp[i + 1][j + 1].add(0); + } + + } + } + } + return dp[n][m].has(0); +}; + +function isDigit(char) { + return (/^\d{1}$/g).test(char); +} + +// another + /** * @param {string} s1 * @param {string} s2 From 5cbae3afb0dcd06e81f065ac1f96ef6c34f8328b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 23 Nov 2021 10:05:54 +0800 Subject: [PATCH 0465/2039] Update 2065-maximum-path-quality-of-a-graph.js --- 2065-maximum-path-quality-of-a-graph.js | 39 +++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/2065-maximum-path-quality-of-a-graph.js b/2065-maximum-path-quality-of-a-graph.js index 419e1986..73827e0f 100644 --- a/2065-maximum-path-quality-of-a-graph.js +++ b/2065-maximum-path-quality-of-a-graph.js @@ -1,3 +1,42 @@ +/** + * @param {number[]} values + * @param {number[][]} edges + * @param {number} maxTime + * @return {number} + */ +const maximalPathQuality = function(values, edges, maxTime) { + const graph = {}, n = values.length + for(const [u, v, t] of edges) { + if(graph[u] == null) graph[u] = [] + if(graph[v] == null) graph[v] = [] + graph[u].push([v, t]) + graph[v].push([u, t]) + } + let res = 0, visited = Array(n).fill(false) + bt(0, 0, 0) + return res + + function bt(i, cur, time) { + if(time > maxTime) return + const backup = visited[i] + if(!visited[i]) { + visited[i] = true + cur += values[i] + } + + if(i === 0) { + res = Math.max(res, cur) + } + + for(const [next, nextTime] of (graph[i] || [])) { + bt(next, cur, time + nextTime) + } + visited[i] = backup + } +}; + +// another + /** * @param {number[]} values * @param {number[][]} edges From 6073326593ac506c815effe409254d0fe0177942 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 23 Nov 2021 10:46:07 +0800 Subject: [PATCH 0466/2039] Update 2065-maximum-path-quality-of-a-graph.js --- 2065-maximum-path-quality-of-a-graph.js | 35 +++++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/2065-maximum-path-quality-of-a-graph.js b/2065-maximum-path-quality-of-a-graph.js index 73827e0f..ced6bb56 100644 --- a/2065-maximum-path-quality-of-a-graph.js +++ b/2065-maximum-path-quality-of-a-graph.js @@ -1,3 +1,38 @@ +/** + * @param {number[]} values + * @param {number[][]} edges + * @param {number} maxTime + * @return {number} + */ +const maximalPathQuality = function(values, edges, maxTime) { + const graph = {}, n = values.length + for(const [u, v, t] of edges) { + if(graph[u] == null) graph[u] = [] + if(graph[v] == null) graph[v] = [] + graph[u].push([v, t]) + graph[v].push([u, t]) + } + let res = 0, visited = new Array(n).fill(0) + visited[0] = 1 + bt(0, values[0], 0) + return res + + function bt(i, val, time) { + if(time > maxTime) return + if(i === 0) res = Math.max(res, val) + + for(const [next, nextTime] of (graph[i] || [])) { + const nextVal = visited[next] > 0 ? val : val + values[next] + visited[next]++ + bt(next, nextVal, time + nextTime) + visited[next]-- + } + } +}; + +// another + + /** * @param {number[]} values * @param {number[][]} edges From 41402a32be7594023ca0cf89478e1b1cd47488c5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 24 Nov 2021 18:54:37 +0800 Subject: [PATCH 0467/2039] Update 2064-minimized-maximum-of-products-distributed-to-any-store.js --- ...um-of-products-distributed-to-any-store.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2064-minimized-maximum-of-products-distributed-to-any-store.js b/2064-minimized-maximum-of-products-distributed-to-any-store.js index d6b13e04..ac753600 100644 --- a/2064-minimized-maximum-of-products-distributed-to-any-store.js +++ b/2064-minimized-maximum-of-products-distributed-to-any-store.js @@ -22,3 +22,28 @@ var minimizedMaximum = function(n, quantities) { for (let x of quantities) cnt += Math.floor(x / max) + ((x % max) ? 1 : 0); return cnt; } + +// another + +/** + * @param {number} n + * @param {number[]} quantities + * @return {number} + */ +const minimizedMaximum = function(n, quantities) { + let MAX = 0; + for (let x of quantities) MAX = Math.max(x, MAX); + let l = 1, r = MAX; + while (l < r) { + let mid = Math.floor((l + r) / 2); + if (valid(quantities, mid, n)) l = mid + 1; + else r = mid; + } + return l; +}; + +function valid(quantities, max, n) { + let cnt = 0; + for (let x of quantities) cnt += Math.floor(x / max) + ((x % max) ? 1 : 0); + return cnt > n; +} From 9497bf0343a4092c515979fb60dc67f7a21db95e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Nov 2021 17:11:09 +0800 Subject: [PATCH 0468/2039] Update 1802-maximum-value-at-a-given-index-in-a-bounded-array.js --- ...lue-at-a-given-index-in-a-bounded-array.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js index 54bbb8c4..9767fb3b 100644 --- a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js +++ b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js @@ -1,3 +1,33 @@ +/** + * @param {number} n + * @param {number} index + * @param {number} maxSum + * @return {number} + */ +const maxValue = function(n, index, maxSum) { + const { floor, sqrt } = Math + maxSum -= n + if(index < Math.floor(n / 2)) index = n - 1 - index + let left = index // number of element to the left of the index + let right = n - 1 - index // number of element to the right of the index + // the triangle area for the left side if not hitting the boundary + let leftSum = floor((left * (left + 1)) / 2) + // the triangle area for the right side if not hitting the boundary + let rightSum = floor((right * (right + 1)) / 2) + // case: perfect pyramid + if (maxSum <= (rightSum * 2 + right + 1)) return floor(sqrt(maxSum) + 1) + // case: right side hits the boundary + if (maxSum <= (leftSum + rightSum + (left - right) * right + left + 1)) { + const b = 3 + 2 * right + return floor((-b + sqrt(b * b - 8 * (rightSum + 1 - right * right - maxSum))) / 2) + 1 + 1 + } + // case: both sides hit boundaries + maxSum -= (leftSum + rightSum + (left - right) * right + left + 1) + return left + 1 + 1 + floor(maxSum / n) +}; + +// another + /** * @param {number} n * @param {number} index From 04f0eb133550f9b74a2163b593502a283c2e2863 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Nov 2021 17:50:05 +0800 Subject: [PATCH 0469/2039] Update 1802-maximum-value-at-a-given-index-in-a-bounded-array.js --- ...lue-at-a-given-index-in-a-bounded-array.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js index 9767fb3b..897df086 100644 --- a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js +++ b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js @@ -1,3 +1,31 @@ +/** + * @param {number} n + * @param {number} index + * @param {number} maxSum + * @return {number} + */ +const maxValue = function(n, index, maxSum) { + maxSum -= n; + let level = 1; + let left = index; + let right = index; + + while (maxSum - (right - left + 1) >= 0) { + if (left === 0 && right === n - 1) break + maxSum -= right - left + 1; + if (left - 1 >= 0) left-- + if (right + 1 <= n - 1) right++; + level++; + } + + if (maxSum) level += ~~(maxSum / n) + + return level; +} + +// another + + /** * @param {number} n * @param {number} index From 163b834d0906466dca183fbd0c24aa7c47cd4e60 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 26 Nov 2021 09:51:47 +0800 Subject: [PATCH 0470/2039] Update 1870-minimum-speed-to-arrive-on-time.js --- 1870-minimum-speed-to-arrive-on-time.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/1870-minimum-speed-to-arrive-on-time.js b/1870-minimum-speed-to-arrive-on-time.js index 0a59cb8b..df7be0e5 100644 --- a/1870-minimum-speed-to-arrive-on-time.js +++ b/1870-minimum-speed-to-arrive-on-time.js @@ -1,3 +1,23 @@ +/** + * @param {number[]} dist + * @param {number} hour + * @return {number} + */ +const minSpeedOnTime = function(dist, hour) { + let n = dist.length, l = 1, r = 1e7 + 1 + while(l < r) { + const mid = l + ((r - l) >> 1) + let time = 0 + for(let i = 0; i < n - 1; i++) time += Math.ceil(dist[i] / mid) + time += dist[dist.length - 1] / mid + if(time > hour) l = mid + 1 + else r = mid + } + return l > 1e7 ? -1 : l +}; + +// another + /** * @param {number[]} dist * @param {number} hour From a9bf29e5e6f8bc75e59973ef117d325861006f9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 26 Nov 2021 14:13:10 +0800 Subject: [PATCH 0471/2039] Update 1802-maximum-value-at-a-given-index-in-a-bounded-array.js --- ...lue-at-a-given-index-in-a-bounded-array.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js index 897df086..8788b9cf 100644 --- a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js +++ b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js @@ -1,3 +1,30 @@ +/** + * @param {number} n + * @param {number} index + * @param {number} maxSum + * @return {number} + */ +const maxValue = function(n, index, maxSum) { + let res = 1, l = index, r = index + maxSum -= n + + while(l > 0 || r < n - 1) { + const len = r - l + 1 + if(maxSum >= len) { + maxSum -= len + res++ + } else break + if(l > 0) l-- + if(r < n - 1) r++ + } + res += ~~(maxSum / n) + + return res +} + +// another + + /** * @param {number} n * @param {number} index From dd8964fde2e9cdc53e74096388e8b7e3f04644dc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Nov 2021 12:06:24 +0800 Subject: [PATCH 0472/2039] Create 2089-find-target-indices-after-sorting-array.js --- 2089-find-target-indices-after-sorting-array.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2089-find-target-indices-after-sorting-array.js diff --git a/2089-find-target-indices-after-sorting-array.js b/2089-find-target-indices-after-sorting-array.js new file mode 100644 index 00000000..ddc093b9 --- /dev/null +++ b/2089-find-target-indices-after-sorting-array.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number[]} + */ +const targetIndices = function(nums, target) { + let res = [] + nums.sort((a, b) => a - b) + for(let i = 0; i < nums.length; i++) { + if(nums[i] === target) res.push(i) + } + return res +}; From 99384aeb96a1896d9a146ecef6fb0ae48174fccb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Nov 2021 12:06:58 +0800 Subject: [PATCH 0473/2039] Create 2090-k-radius-subarray-averages.js --- 2090-k-radius-subarray-averages.js | 43 ++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 2090-k-radius-subarray-averages.js diff --git a/2090-k-radius-subarray-averages.js b/2090-k-radius-subarray-averages.js new file mode 100644 index 00000000..c99d400c --- /dev/null +++ b/2090-k-radius-subarray-averages.js @@ -0,0 +1,43 @@ +const lowBit = (x) => x & -x +class FenwickTree { + constructor(n) { + if (n < 1) return + this.sum = Array(n + 1).fill(0) + } + update(i, delta) { + if (i < 1) return + while (i < this.sum.length) { + this.sum[i] += delta + i += lowBit(i) + } + } + query(i) { + if (i < 1) return 0 + let sum = 0 + while (i > 0) { + sum += this.sum[i] + i -= lowBit(i) + } + return sum + } +} +/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +const getAverages = function(nums, k) { + const n = nums.length + const bit = new FenwickTree(n) + for(let i = 0; i < n; i++) { + bit.update(i + 1, nums[i]) + } + const res = Array(n).fill(-1) + // console.log(bit) + for(let i = k; i < n - k; i++) { + const pre = bit.query(i + 1 - k - 1), cur = bit.query(i + 1 + k) + res[i] = ~~((cur - pre) / (k * 2 + 1)) + } + + return res +}; From 8c17e67d78a68653a605b4e863955180b0f5c937 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Nov 2021 12:07:23 +0800 Subject: [PATCH 0474/2039] Create 2091-removing-minimum-and-maximum-from-array.js --- ...removing-minimum-and-maximum-from-array.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2091-removing-minimum-and-maximum-from-array.js diff --git a/2091-removing-minimum-and-maximum-from-array.js b/2091-removing-minimum-and-maximum-from-array.js new file mode 100644 index 00000000..81d73144 --- /dev/null +++ b/2091-removing-minimum-and-maximum-from-array.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumDeletions = function(nums) { + let mi = Infinity, ma = -Infinity + let mii = -1, mai = -1 + const { max, min, abs } = Math, n = nums.length + for(let i = 0; i < n; i++) { + const e = nums[i] + if(e < mi) { + mi = e + mii = i + } + if(e > ma) { + ma = e + mai = i + } + } + + const disMi = abs(mii + 1, n - mii) + const disMa = abs(mai + 1, n - mai) + let res = 0 + let lmi = min(mii, mai), lma = max(mii, mai) + + res += min(lmi + 1 + n - lma, lma + 1, n - lmi) + + + return res +}; From 3bbaeb29586109bd6438cae0168adf2b94ea057c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Nov 2021 12:07:52 +0800 Subject: [PATCH 0475/2039] Create 2092-find-all-people-with-secret.js --- 2092-find-all-people-with-secret.js | 46 +++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 2092-find-all-people-with-secret.js diff --git a/2092-find-all-people-with-secret.js b/2092-find-all-people-with-secret.js new file mode 100644 index 00000000..69ce4439 --- /dev/null +++ b/2092-find-all-people-with-secret.js @@ -0,0 +1,46 @@ +/** + * @param {number} n + * @param {number[][]} meetings + * @param {number} firstPerson + * @return {number[]} + */ +const findAllPeople = function(n, meetings, firstPerson) { + meetings.sort((a, b) => a[2] - b[2]) + const shared = new Set([0, firstPerson]) + + let start = new Set(), links = {} + for(let i = 0, len = meetings.length; i < len; i++) { + const [x,y,t] = meetings[i] + if(i > 0 && t !== meetings[i - 1][2]) { + dfs(start, links, shared) + start = new Set() + links = {} + } + if(shared.has(x)) start.add(x) + if(shared.has(y)) start.add(y) + if(links[x] == null) links[x] = [] + if(links[y] == null) links[y] = [] + links[x].push(y) + links[y].push(x) + } + + + dfs(start, links, shared) + return Array.from(shared) + + function dfs(start, links, shared) { + const visited = new Set() + while(start.size) { + const it = start[Symbol.iterator]() + const cur = it.next().value + start.delete(cur) + visited.add(cur) + shared.add(cur) + for(let e of (links[cur] || [])) { + if(!visited.has(e)) start.add(e) + } + } + } +}; + + From f99cfb02a6de29380a875902bf83fcd7143b067a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Nov 2021 12:17:51 +0800 Subject: [PATCH 0476/2039] Update 2092-find-all-people-with-secret.js --- 2092-find-all-people-with-secret.js | 9 +++------ 1 file changed, 3 insertions(+), 6 deletions(-) diff --git a/2092-find-all-people-with-secret.js b/2092-find-all-people-with-secret.js index 69ce4439..88ab147f 100644 --- a/2092-find-all-people-with-secret.js +++ b/2092-find-all-people-with-secret.js @@ -12,7 +12,7 @@ const findAllPeople = function(n, meetings, firstPerson) { for(let i = 0, len = meetings.length; i < len; i++) { const [x,y,t] = meetings[i] if(i > 0 && t !== meetings[i - 1][2]) { - dfs(start, links, shared) + bfs(start, links) start = new Set() links = {} } @@ -24,11 +24,10 @@ const findAllPeople = function(n, meetings, firstPerson) { links[y].push(x) } - - dfs(start, links, shared) + bfs(start, links) return Array.from(shared) - function dfs(start, links, shared) { + function bfs(start, links) { const visited = new Set() while(start.size) { const it = start[Symbol.iterator]() @@ -42,5 +41,3 @@ const findAllPeople = function(n, meetings, firstPerson) { } } }; - - From 782d09e7fe0910a60ec58f716c2ddbd7f64308ad Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Nov 2021 15:44:50 +0800 Subject: [PATCH 0477/2039] Update 1608-special-array-with-x-elements-greater-than-or-equal-x.js --- ...-with-x-elements-greater-than-or-equal-x.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/1608-special-array-with-x-elements-greater-than-or-equal-x.js b/1608-special-array-with-x-elements-greater-than-or-equal-x.js index 6964d8c3..b9b51023 100644 --- a/1608-special-array-with-x-elements-greater-than-or-equal-x.js +++ b/1608-special-array-with-x-elements-greater-than-or-equal-x.js @@ -30,3 +30,21 @@ const specialArray = function(nums) { // larger or equal to i, which makes array not special. return left < nums.length && left === nums[left] ? -1 : left }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const specialArray = function(nums) { + const n = nums.length + nums.sort((a, b) => b - a) + let l = 0, r = n + while(l < r) { + const mid = l + ((r - l) >> 1) + if(nums[mid] > mid) l = mid + 1 + else r = mid + } + return l < n && l === nums[l] ? -1 : l +} From b29f91daa76479d5aebdeebc60381c93bc4f8194 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 Nov 2021 11:28:25 +0800 Subject: [PATCH 0478/2039] Create 2071-maximum-number-of-tasks-you-can-assign.js --- ...-maximum-number-of-tasks-you-can-assign.js | 75 +++++++++++++++++++ 1 file changed, 75 insertions(+) create mode 100644 2071-maximum-number-of-tasks-you-can-assign.js diff --git a/2071-maximum-number-of-tasks-you-can-assign.js b/2071-maximum-number-of-tasks-you-can-assign.js new file mode 100644 index 00000000..dabb440a --- /dev/null +++ b/2071-maximum-number-of-tasks-you-can-assign.js @@ -0,0 +1,75 @@ +//////////////////////////////////////////////Template///////////////////////////////////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_right(a, x, lo = 0, hi = null) { + // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + x < a[mid] ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_left(a, x, lo = 0, hi = null) { + // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } +} +/** + * @param {number[]} tasks + * @param {number[]} workers + * @param {number} pills + * @param {number} strength + * @return {number} + */ +const maxTaskAssign = function(tasks, workers, pills, strength) { + tasks.sort((a, b) => a - b) + workers.sort((a, b) => b - a) + const m = tasks.length, n = workers.length + const { min, floor } = Math + let l = 0, r = min(n, m) + while (l < r) { + const mid = r - floor((r - l) / 2) + if (check(mid)) l = mid + else r = mid - 1 + } + + return l + + function check(k){ + const wArr = workers.slice(0, k), tArr = tasks.slice(0, k) + let tries = pills, bs = new Bisect() + wArr.reverse() + tArr.reverse() + + for (let elem of tArr) { + const place = bs.bisect_left(wArr, elem) + if (place < wArr.length) { + wArr.pop() + } else if (tries > 0) { + const place2 = bs.bisect_left(wArr, elem - strength) + if (place2 < wArr.length) { + wArr.splice(place2, 1) + tries -= 1 + } + } else return false + } + + return wArr.length === 0 + } +}; From cee0441786a06d6427fa15bf4393c4b928bd2921 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 1 Dec 2021 10:47:55 +0800 Subject: [PATCH 0479/2039] Create 2069-walking-robot-simulation-ii.js --- 2069-walking-robot-simulation-ii.js | 49 +++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 2069-walking-robot-simulation-ii.js diff --git a/2069-walking-robot-simulation-ii.js b/2069-walking-robot-simulation-ii.js new file mode 100644 index 00000000..50be2e38 --- /dev/null +++ b/2069-walking-robot-simulation-ii.js @@ -0,0 +1,49 @@ +/** + * @param {number} width + * @param {number} height + */ +const Robot = function(width, height) { + this.i = 0 + const pos = Array() + this.len = width + height - 1 + width - 1 + height - 2 + pos.push( [0,0,3] ) + for(let i = 1; i < width; i++) { + pos.push([i, 0, 0]) + } + for(let i = 1; i < height; i++) { + pos.push([width - 1, i, 1]) + } + for(let i = 1; i < width; i++) { + pos.push([width - 1 - i, height - 1, 2]) + } + for(let i = 1; i < height - 1; i++) { + pos.push([0, height - 1 - i, 3]) + } + this.pos = pos +}; + +/** + * @param {number} num + * @return {void} + */ +Robot.prototype.step = function(num) { + this.i += num +}; + +/** + * @return {number[]} + */ +Robot.prototype.getPos = function() { + return this.pos[this.i % this.len].slice(0, 2) +}; + +/** + * @return {string} + */ +Robot.prototype.getDir = function() { + const hash = ['East', 'North', 'West', 'South'] + if(this.i === 0) return hash[0] + else { + return hash[this.pos[this.i % this.len][2]] + } +}; From 3ec579551c1b5bc9c45d928d3885b27a14c2cefc Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Dec 2021 10:03:57 +0800 Subject: [PATCH 0480/2039] Create 1251-average-selling-price.sql --- 1251-average-selling-price.sql | 6 ++++++ 1 file changed, 6 insertions(+) create mode 100644 1251-average-selling-price.sql diff --git a/1251-average-selling-price.sql b/1251-average-selling-price.sql new file mode 100644 index 00000000..ca95a4c1 --- /dev/null +++ b/1251-average-selling-price.sql @@ -0,0 +1,6 @@ +# Write your MySQL query statement below +SELECT a.product_id,ROUND(SUM(b.units*a.price)/SUM(b.units),2) as average_price +FROM Prices as a +JOIN UnitsSold as b +ON a.product_id=b.product_id AND (b.purchase_date BETWEEN a.start_date AND a.end_date) +GROUP BY product_id; From dc2f9557e9a99b6c28166637370f71f5977ba122 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Dec 2021 10:16:40 +0800 Subject: [PATCH 0481/2039] Update 206-reverse-linked-list.js --- 206-reverse-linked-list.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/206-reverse-linked-list.js b/206-reverse-linked-list.js index d804118a..94c78a97 100755 --- a/206-reverse-linked-list.js +++ b/206-reverse-linked-list.js @@ -1,3 +1,30 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const reverseList = function(head) { + if(head == null) return head + const pre = new ListNode(null, head) + let cur = head + while(cur.next) { + let tmp = pre.next + pre.next = cur.next + cur.next = cur.next.next + pre.next.next = tmp + } + + return pre.next +}; + +// another + /** * Definition for singly-linked list. * function ListNode(val) { From b1d532f66196a2cb44dc558ee42a0587abec9078 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 12:03:10 +0800 Subject: [PATCH 0482/2039] Update 92-reverse-linked-list-ii.js --- 92-reverse-linked-list-ii.js | 40 ++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/92-reverse-linked-list-ii.js b/92-reverse-linked-list-ii.js index e9c73874..8b30ebfb 100644 --- a/92-reverse-linked-list-ii.js +++ b/92-reverse-linked-list-ii.js @@ -1,3 +1,43 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @param {number} left + * @param {number} right + * @return {ListNode} + */ +const reverseBetween = function(head, left, right) { + if(head == null) return head + const dummy = new ListNode(null, head) + let num = 0, cur = head + while (cur) { + num++ + cur = cur.next + } + let idx = 0, pre = null + cur = dummy + while (idx < right && idx <= num) { + if (idx === left - 1) pre = cur + if (idx >= left) { + const tmp = pre.next + pre.next = cur.next + cur.next = cur.next.next + pre.next.next = tmp + } + + if (idx < left) cur = cur.next + idx++ + } + return dummy.next +}; + +// another + /** * Definition for singly-linked list. * function ListNode(val) { From 116c123e35143d17018429e05953efd9b15e7b41 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 14:29:24 +0800 Subject: [PATCH 0483/2039] Create 1374-generate-a-string-with-characters-that-have-odd-counts.js --- ...-a-string-with-characters-that-have-odd-counts.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1374-generate-a-string-with-characters-that-have-odd-counts.js diff --git a/1374-generate-a-string-with-characters-that-have-odd-counts.js b/1374-generate-a-string-with-characters-that-have-odd-counts.js new file mode 100644 index 00000000..cb124879 --- /dev/null +++ b/1374-generate-a-string-with-characters-that-have-odd-counts.js @@ -0,0 +1,12 @@ +/** + * @param {number} n + * @return {string} + */ +const generateTheString = function(n, ch = 'a') { + const odd = n % 2 === 1 + const code = ch.charCodeAt(0) + if(odd) return ch.repeat(n) + const nch = String.fromCharCode(code + 1), nnch = String.fromCharCode(code + 2) + const even = (n / 2) % 2 === 0 + return generateTheString(even ? n / 2 - 1 : n / 2, nch) + generateTheString(even ? n / 2 + 1 : n / 2, nnch) +}; From f564eff69c653db36a56c1defba640f170978f3a Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 14:54:45 +0800 Subject: [PATCH 0484/2039] Create 1370-increasing-decreasing-string.js --- 1370-increasing-decreasing-string.js | 32 ++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 1370-increasing-decreasing-string.js diff --git a/1370-increasing-decreasing-string.js b/1370-increasing-decreasing-string.js new file mode 100644 index 00000000..c9bc2a65 --- /dev/null +++ b/1370-increasing-decreasing-string.js @@ -0,0 +1,32 @@ +/** + * @param {string} s + * @return {string} + */ +const sortString = function(s) { + const arr = Array(26).fill(0), a = 'a'.charCodeAt(0) + for(const ch of s) { + arr[ch.charCodeAt(0) - a]++ + } + + let res = '', delta = 1 + const valid = arr => arr.every(e => e === 0) + while(!valid(arr)) { + if(delta > 0) { + for(let i = 0; i< 26; i++) { + if(arr[i]) { + res += String.fromCharCode(a + i) + arr[i]-- + } + } + } else { + for(let i = 25; i >= 0; i--) { + if(arr[i]) { + res += String.fromCharCode(a + i) + arr[i]-- + } + } + } + delta = delta === 1 ? -1 : 1 + } + return res +}; From 3c96de4b9632fb85380669e01eb767b8e6214c09 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 15:55:29 +0800 Subject: [PATCH 0485/2039] Create 2082-the-number-of-rich-customers.sql --- 2082-the-number-of-rich-customers.sql | 2 ++ 1 file changed, 2 insertions(+) create mode 100644 2082-the-number-of-rich-customers.sql diff --git a/2082-the-number-of-rich-customers.sql b/2082-the-number-of-rich-customers.sql new file mode 100644 index 00000000..fa154f5e --- /dev/null +++ b/2082-the-number-of-rich-customers.sql @@ -0,0 +1,2 @@ +# Write your MySQL query statement below +SELECT COUNT(DISTINCT customer_id) AS rich_count FROM Store WHERE amount > 500; From b947456ddd28b070ad616a68f802de4d7a78a5d0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 15:57:34 +0800 Subject: [PATCH 0486/2039] Create 1873-calculate-special-bonus.sql --- 1873-calculate-special-bonus.sql | 2 ++ 1 file changed, 2 insertions(+) create mode 100644 1873-calculate-special-bonus.sql diff --git a/1873-calculate-special-bonus.sql b/1873-calculate-special-bonus.sql new file mode 100644 index 00000000..9f6862d0 --- /dev/null +++ b/1873-calculate-special-bonus.sql @@ -0,0 +1,2 @@ +# Write your MySQL query statement below +select employee_id, if(employee_id%2=1 and name not like'M%', salary,0) as bonus from Employees; From a9b131472f5c45d3ae32070e1ea2c5a92c5d00b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 16:03:54 +0800 Subject: [PATCH 0487/2039] Create 1795-rearrange-products-table.sql --- 1795-rearrange-products-table.sql | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 1795-rearrange-products-table.sql diff --git a/1795-rearrange-products-table.sql b/1795-rearrange-products-table.sql new file mode 100644 index 00000000..6a135447 --- /dev/null +++ b/1795-rearrange-products-table.sql @@ -0,0 +1,8 @@ +# Write your MySQL query statement below +SELECT product_id, 'store1' AS store, store1 AS price FROM Products WHERE store1 IS NOT NULL +UNION +SELECT product_id, 'store2' AS store, store2 AS price FROM Products WHERE store2 IS NOT NULL +UNION +SELECT product_id, 'store3' AS store, store3 AS price FROM Products WHERE store3 IS NOT NULL + +ORDER BY 1,2 ASC; From 54d469a199b79405e20d4eb55577886831c7f734 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 16:32:44 +0800 Subject: [PATCH 0488/2039] Create 1844-replace-all-digits-with-characters.js --- 1844-replace-all-digits-with-characters.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1844-replace-all-digits-with-characters.js diff --git a/1844-replace-all-digits-with-characters.js b/1844-replace-all-digits-with-characters.js new file mode 100644 index 00000000..af554d97 --- /dev/null +++ b/1844-replace-all-digits-with-characters.js @@ -0,0 +1,16 @@ +/** + * @param {string} s + * @return {string} + */ +const replaceDigits = function(s) { + let arr = s.split('') + for(let i = 1; i < s.length; i += 2) { + arr[i] = shift(s[i - 1], +s[i]) + } + + return arr.join('') + + function shift(ch, x) { + return String.fromCharCode(ch.charCodeAt(0) + x) + } +}; From cc639a386a7cf04ae2ea29bd196b239e25cdb695 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 16:52:06 +0800 Subject: [PATCH 0489/2039] Create 2053-kth-distinct-string-in-an-array.js --- 2053-kth-distinct-string-in-an-array.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2053-kth-distinct-string-in-an-array.js diff --git a/2053-kth-distinct-string-in-an-array.js b/2053-kth-distinct-string-in-an-array.js new file mode 100644 index 00000000..152a135c --- /dev/null +++ b/2053-kth-distinct-string-in-an-array.js @@ -0,0 +1,19 @@ +/** + * @param {string[]} arr + * @param {number} k + * @return {string} + */ +const kthDistinct = function(arr, k) { + let num = 0, hash = {} + + for(let str of arr) { + if(hash[str] == null) hash[str] = 0 + hash[str]++ + } + for(let str of arr) { + if(hash[str] > 1) continue + num++ + if(num === k) return str + } + return '' +}; From f9ea4c06ede44da11c09addeae30a115a4b21b5f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 17:05:08 +0800 Subject: [PATCH 0490/2039] Create 2006-count-number-of-pairs-with-absolute-difference-k.js --- ...mber-of-pairs-with-absolute-difference-k.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2006-count-number-of-pairs-with-absolute-difference-k.js diff --git a/2006-count-number-of-pairs-with-absolute-difference-k.js b/2006-count-number-of-pairs-with-absolute-difference-k.js new file mode 100644 index 00000000..30302a8c --- /dev/null +++ b/2006-count-number-of-pairs-with-absolute-difference-k.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countKDifference = function(nums, k) { + const hash = {} + let res = 0 + for(let i = 0; i < nums.length; i++) { + const cur = nums[i] + if(hash[cur + k]) res += hash[cur + k] + if(hash[cur - k]) res += hash[cur - k] + + if(hash[cur] == null) hash[cur] = 0 + hash[cur]++ + } + return res +}; From 145e423754b91bebcacf18d2750e04549cb116a8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 17:08:11 +0800 Subject: [PATCH 0491/2039] Create 1323-maximum-69-number.js --- 1323-maximum-69-number.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1323-maximum-69-number.js diff --git a/1323-maximum-69-number.js b/1323-maximum-69-number.js new file mode 100644 index 00000000..87e472b9 --- /dev/null +++ b/1323-maximum-69-number.js @@ -0,0 +1,14 @@ +/** + * @param {number} num + * @return {number} + */ +var maximum69Number = function(num) { + const arr = (num+'').split('') + for(let i = 0; i < arr.length; i++) { + if(arr[i] === '6') { + arr[i] = '9' + break + } + } + return arr.join('') +}; From b8d2f4e3e46435b865d14d1b934e6c977a74cec5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Dec 2021 17:21:03 +0800 Subject: [PATCH 0492/2039] Create 2037-minimum-number-of-moves-to-seat-everyone.js --- 2037-minimum-number-of-moves-to-seat-everyone.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2037-minimum-number-of-moves-to-seat-everyone.js diff --git a/2037-minimum-number-of-moves-to-seat-everyone.js b/2037-minimum-number-of-moves-to-seat-everyone.js new file mode 100644 index 00000000..92ff7134 --- /dev/null +++ b/2037-minimum-number-of-moves-to-seat-everyone.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} seats + * @param {number[]} students + * @return {number} + */ +const minMovesToSeat = function(seats, students) { + let res = 0 + seats.sort((a, b) => a - b) + students.sort((a, b) => a - b) + + for(let i = 0; i < students.length; i++) { + res += Math.abs(seats[i] - students[i]) + } + + return res +}; From 71fda8bff495854bdc2bb1a8c3c4a06bdad6d433 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Dec 2021 12:14:49 +0800 Subject: [PATCH 0493/2039] Create 2094-finding-3-digit-even-numbers.js --- 2094-finding-3-digit-even-numbers.js | 49 ++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 2094-finding-3-digit-even-numbers.js diff --git a/2094-finding-3-digit-even-numbers.js b/2094-finding-3-digit-even-numbers.js new file mode 100644 index 00000000..a3f166fe --- /dev/null +++ b/2094-finding-3-digit-even-numbers.js @@ -0,0 +1,49 @@ +/** + * @param {number[]} digits + * @return {number[]} + */ +const findEvenNumbers = function(digits) { + const set = new Set(), visited = new Set() + helper(0, []) + const res = Array.from(set) + res.sort((a, b) => a - b) + return res + + function helper(idx, cur) { + if(cur.length === 3) { + set.add(+cur.join('')) + return + } + for(let i = 0; i < digits.length; i++) { + if(visited.has(i)) continue + const d = digits[i] + if(d === 0) { + if(cur.length === 0) continue + else { + cur.push(d) + visited.add(i) + helper(i + 1, cur) + visited.delete(i) + cur.pop() + } + } else { + const isEven = d % 2 === 0 + if(cur.length === 3 - 1) { + if(isEven) { + cur.push(d) + visited.add(i) + helper(i + 1, cur) + visited.delete(i) + cur.pop() + } else continue + } else { + cur.push(d) + visited.add(i) + helper(i + 1, cur) + visited.delete(i) + cur.pop() + } + } + } + } +}; From a3eda4f789b438ab283e933f322796b05737b599 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Dec 2021 18:57:25 +0800 Subject: [PATCH 0494/2039] Create 2095-delete-the-middle-node-of-a-linked-list.js --- ...delete-the-middle-node-of-a-linked-list.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2095-delete-the-middle-node-of-a-linked-list.js diff --git a/2095-delete-the-middle-node-of-a-linked-list.js b/2095-delete-the-middle-node-of-a-linked-list.js new file mode 100644 index 00000000..7ee0aef7 --- /dev/null +++ b/2095-delete-the-middle-node-of-a-linked-list.js @@ -0,0 +1,36 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const deleteMiddle = function(head) { + if(head == null) return head + const dummy = new ListNode(null, head) + let n = 0, cur = head + while(cur) { + n++ + cur = cur.next + } + if(n === 1) return null + const mid = Math.floor(n / 2) + cur = dummy.next + let pre = dummy + for(let i = 0; i < n; i++) { + if(i === mid - 1) { + pre = cur + // pre.next = cur.next.next + } + if(i === mid) { + pre.next = cur.next + } + if(i > mid) break + cur = cur.next + } + return dummy.next +}; From cee772b02bf9ad516dadea834144e53232cc00d7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Dec 2021 18:59:45 +0800 Subject: [PATCH 0495/2039] Create 2096-step-by-step-directions-from-a-binary-tree-node-to-another.js --- ...ions-from-a-binary-tree-node-to-another.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2096-step-by-step-directions-from-a-binary-tree-node-to-another.js diff --git a/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js b/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js new file mode 100644 index 00000000..e8e3943c --- /dev/null +++ b/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js @@ -0,0 +1,36 @@ +/** + * 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} startValue + * @param {number} destValue + * @return {string} + */ +var getDirections = function(root, startValue, destValue) { + let start = ""; + let end = ""; + + const traverse = (node, path) => { + if (node === null) return; + + if (node.val === startValue) start = path; + if (node.val === destValue) end = path; + + if (start !== "" && end !== "") return; + if (node.left !== null) traverse(node.left, path + "L"); + if (node.right !== null) traverse(node.right, path + "R"); + } + + traverse(root, ""); + + let skip = 0; + while (start[skip] && start[skip] === end[skip]) ++skip; + + return "U".repeat(start.length - skip) + end.substring(skip); +}; From 75b4bc7c9b4a49f9b5c2ea0ba9d5f0525f48a97a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Dec 2021 20:34:15 +0800 Subject: [PATCH 0496/2039] Update 2096-step-by-step-directions-from-a-binary-tree-node-to-another.js --- ...ions-from-a-binary-tree-node-to-another.js | 38 ++++++++----------- 1 file changed, 16 insertions(+), 22 deletions(-) diff --git a/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js b/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js index e8e3943c..af3be49d 100644 --- a/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js +++ b/2096-step-by-step-directions-from-a-binary-tree-node-to-another.js @@ -12,25 +12,19 @@ * @param {number} destValue * @return {string} */ -var getDirections = function(root, startValue, destValue) { - let start = ""; - let end = ""; - - const traverse = (node, path) => { - if (node === null) return; - - if (node.val === startValue) start = path; - if (node.val === destValue) end = path; - - if (start !== "" && end !== "") return; - if (node.left !== null) traverse(node.left, path + "L"); - if (node.right !== null) traverse(node.right, path + "R"); - } - - traverse(root, ""); - - let skip = 0; - while (start[skip] && start[skip] === end[skip]) ++skip; - - return "U".repeat(start.length - skip) + end.substring(skip); -}; +const getDirections = function (root, startValue, destValue) { + let start = '' + let end = '' + const traverse = (node, path) => { + if (node === null) return + if (node.val === startValue) start = path + if (node.val === destValue) end = path + if (start !== '' && end !== '') return + if (node.left !== null) traverse(node.left, path + 'L') + if (node.right !== null) traverse(node.right, path + 'R') + } + traverse(root, '') + let skip = 0 + while (start[skip] && start[skip] === end[skip]) skip++ + return 'U'.repeat(start.length - skip) + end.slice(skip) +} From 7895f3ab16b539e73e28c8d8b72a38b40e787bdd Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Dec 2021 19:18:16 +0800 Subject: [PATCH 0497/2039] Update 143-reorder-list.js --- 143-reorder-list.js | 54 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/143-reorder-list.js b/143-reorder-list.js index 366da9b2..ebc5bec4 100644 --- a/143-reorder-list.js +++ b/143-reorder-list.js @@ -1,3 +1,57 @@ +/** + * Definition for singly-linked list. + * function ListNode(val) { + * this.val = val; + * this.next = null; + * } + */ +/** + * @param {ListNode} head + * @return {void} Do not return anything, modify head in-place instead. + */ +const reorderList = function(head) { + if (!head || !head.next) return head; + + const reverse = head => { + if (!head || !head.next) return head; + const newHead = reverse(head.next); + head.next.next = head; + head.next = null; + return newHead; + }; + + const merge = (l1, l2) => { + if (!l1) return l2; + if (!l2) return l1; + while (l1 && l2) { + const next1 = l1.next; + const next2 = l2.next; + l1.next = l2; + if (next1 == null) break; + l2.next = next1; + l1 = next1; + l2 = next2; + } + }; + + let fast = head; + let slow = head; + + while (fast && fast.next) { + fast = fast.next.next; + slow = slow.next; + } + + fast = slow.next; + slow.next = null; + + fast = reverse(fast); + merge(head, fast); +}; + + +// another + /** * Definition for singly-linked list. * function ListNode(val) { From d3ee6ec17f94db2fbb17e277bbd3e4fb3fc3c5b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Dec 2021 20:49:24 +0800 Subject: [PATCH 0498/2039] Update 143-reorder-list.js --- 143-reorder-list.js | 45 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/143-reorder-list.js b/143-reorder-list.js index ebc5bec4..5d49c176 100644 --- a/143-reorder-list.js +++ b/143-reorder-list.js @@ -1,3 +1,48 @@ +/** + * Definition for singly-linked list. + * function ListNode(val) { + * this.val = val; + * this.next = null; + * } + */ +/** + * @param {ListNode} head + * @return {void} Do not return anything, modify head in-place instead. + */ +const reorderList = function(head) { + if(head == null) return head + let slow = head, fast = head + while(fast && fast.next) { + slow = slow.next + fast = fast.next.next + } + let head2 = reverse(slow.next) + slow.next = null + + while(head && head2) { + const next = head.next, next2 = head2.next + head2.next = head.next + head.next = head2 + head = next + head2 = next2 + } + + function reverse(node) { + let pre = null, cur = node + while(cur) { + const tmp = cur.next + cur.next = pre + pre = cur + cur = tmp + } + return pre + } +}; + + + +// another + /** * Definition for singly-linked list. * function ListNode(val) { From 2d682d35797ff1021d8e179660f9c4049dac8d1a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Dec 2021 10:50:16 +0800 Subject: [PATCH 0499/2039] Create 2046-sort-linked-list-already-sorted-using-absolute-values.js --- ...st-already-sorted-using-absolute-values.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2046-sort-linked-list-already-sorted-using-absolute-values.js diff --git a/2046-sort-linked-list-already-sorted-using-absolute-values.js b/2046-sort-linked-list-already-sorted-using-absolute-values.js new file mode 100644 index 00000000..c80d553a --- /dev/null +++ b/2046-sort-linked-list-already-sorted-using-absolute-values.js @@ -0,0 +1,30 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const sortLinkedList = function(head) { + if(head == null) return head + const dummy = new ListNode(null, head) + let pre = dummy, cur = head + while(cur) { + if(cur.val < 0 && cur !== head) { + const tmp = cur.next, tmpHead = dummy.next + dummy.next = cur + cur.next = tmpHead + pre.next = tmp + cur = tmp + } else { + pre = cur + cur = cur.next + } + } + + return dummy.next +}; From f2ae2ee86d512fe630025df10f12e63065094d59 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Dec 2021 20:43:24 +0800 Subject: [PATCH 0500/2039] Create 1422-maximum-score-after-splitting-a-string.js --- 1422-maximum-score-after-splitting-a-string.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1422-maximum-score-after-splitting-a-string.js diff --git a/1422-maximum-score-after-splitting-a-string.js b/1422-maximum-score-after-splitting-a-string.js new file mode 100644 index 00000000..4f897b49 --- /dev/null +++ b/1422-maximum-score-after-splitting-a-string.js @@ -0,0 +1,17 @@ +/** + * @param {string} s + * @return {number} + */ +const maxScore = function(s) { + const n = s.length + let res = 0, numOfOne = 0 + for(let ch of s) { + if(ch === '1') numOfOne++ + } + for(let i = 0, one = 0; i < n - 1; i++) { + if(s[i] === '1') one++ + res = Math.max(res, (i + 1 - one) + (numOfOne - one)) + } + + return res +}; From e97508a4bae294444795cc58d4d3375fe03b98da Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Dec 2021 20:59:20 +0800 Subject: [PATCH 0501/2039] Update 1422-maximum-score-after-splitting-a-string.js --- 1422-maximum-score-after-splitting-a-string.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) diff --git a/1422-maximum-score-after-splitting-a-string.js b/1422-maximum-score-after-splitting-a-string.js index 4f897b49..916bae85 100644 --- a/1422-maximum-score-after-splitting-a-string.js +++ b/1422-maximum-score-after-splitting-a-string.js @@ -15,3 +15,20 @@ const maxScore = function(s) { return res }; + +// another + +/** + * @param {string} s + * @return {number} + */ +const maxScore = function(s) { + const n = s.length + let res = -Infinity, one = 0, zero = 0 + for(let i = 0; i < n; i++) { + s[i] === '0' ? zero++ : one++ + if(i !== n - 1) res = Math.max(res, zero - one) + } + + return res + one +}; From 3324cfef2a7a1c031e2abfbdcf99ae9f1492fce3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Dec 2021 16:55:37 +0800 Subject: [PATCH 0502/2039] Update 479-largest-palindrome-product.js --- 479-largest-palindrome-product.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/479-largest-palindrome-product.js b/479-largest-palindrome-product.js index 515ba62a..43fb57ef 100644 --- a/479-largest-palindrome-product.js +++ b/479-largest-palindrome-product.js @@ -1,3 +1,25 @@ +/** + * @param {number} n + * @return {number} + */ +const largestPalindrome = function (n) { + if (n === 1) return 9 + for (let i = 2, limit = 9 * 10 ** (n - 1); i < limit; i++) { + let left = 10 ** n - i + let right = +('' + left).split('').reverse().join('') + if (i ** 2 - 4 * right < 0) continue + const tmp = (i ** 2 - 4 * right) ** 0.5 + if (tmp === Math.floor(tmp)) { + return ( + (BigInt(right) + 10n ** BigInt(n) * (10n ** BigInt(n) - BigInt(i))) % + 1337n + ) + } + } +} + +// another + /** * @param {number} n * @return {number} From dbcf4c69f43ab9f4aac3412ab81e8e045a6eae97 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Dec 2021 20:10:46 +0800 Subject: [PATCH 0503/2039] Create 1295-find-numbers-with-even-number-of-digits.js --- 1295-find-numbers-with-even-number-of-digits.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1295-find-numbers-with-even-number-of-digits.js diff --git a/1295-find-numbers-with-even-number-of-digits.js b/1295-find-numbers-with-even-number-of-digits.js new file mode 100644 index 00000000..187c8e4e --- /dev/null +++ b/1295-find-numbers-with-even-number-of-digits.js @@ -0,0 +1,12 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findNumbers = function(nums) { + let res = 0 + for(const e of nums) { + const str = '' + e + if(str.length % 2 === 0) res++ + } + return res +}; From 47513c88c4a239d9e4b0c6ec8d5764fefce7ebdf Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Dec 2021 21:05:36 +0800 Subject: [PATCH 0504/2039] Create 1287-element-appearing-more-than-25-in-sorted-array.js --- ...-appearing-more-than-25-in-sorted-array.js | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 1287-element-appearing-more-than-25-in-sorted-array.js diff --git a/1287-element-appearing-more-than-25-in-sorted-array.js b/1287-element-appearing-more-than-25-in-sorted-array.js new file mode 100644 index 00000000..19e42d38 --- /dev/null +++ b/1287-element-appearing-more-than-25-in-sorted-array.js @@ -0,0 +1,50 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const findSpecialInteger = function (arr) { + const n = arr.length, + { floor } = Math, + { getWordIndexRange } = Search() + const ticks = [n / 4, n / 2, (n * 3) / 4].map((e) => floor(e)) + for (const i of ticks) { + const [s, e] = getWordIndexRange(arr, arr[i]) + if (e - s > n / 4) return arr[i] + } + return 0 +} + +function Search() { + return { getWordIndexRange } + + /** + * Searches for the first true value in the predicate. + * Returns hi if not found. + * [lo, hi) + */ + function binarySearch(lo, hi, predicate) { + while (lo != hi) { + let mid = ((lo + hi) / 2) | 0 + if (predicate(mid)) { + hi = mid + } else { + lo = mid + 1 + } + } + return lo + } + + function getWordIndexRange(keys, word) { + let lo = 0, + hi = keys.length + function greaterOrEqual(index) { + return keys[index] >= word + } + function less(index) { + return keys[index] > word + } + let lower_bound = binarySearch(0, keys.length, greaterOrEqual) + let upper_bound = binarySearch(lower_bound, keys.length, less) + return [lower_bound, upper_bound] + } +} From cddd0cbf5f3851ccd2c6a3243bf5a611f1314303 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 9 Dec 2021 09:55:15 +0800 Subject: [PATCH 0505/2039] Update 866-prime-palindrome.js --- 866-prime-palindrome.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/866-prime-palindrome.js b/866-prime-palindrome.js index aaa749f5..1b2652f4 100644 --- a/866-prime-palindrome.js +++ b/866-prime-palindrome.js @@ -1,3 +1,28 @@ +/** + * @param {number} n + * @return {number} + */ +const primePalindrome = function(n) { + if(n >= 8 && n <= 11) return 11 + const rev = str => str.split('').reverse().join('') + for (let i = 1; i < 1e5; i++) { + let left = `${i}`, right = rev(left).slice(1) + let num = +(left + right) + if (num >= n && isPrime(num)) return num + } + return -1 + + function isPrime(num) { + if(num < 2 || num % 2 === 0) return num === 2 + for(let i = 3; i * i <= num; i += 2) { + if(num % i === 0) return false + } + return true + } +}; + +// another + /** * @param {number} N * @return {number} From 67f7b275905673be3030c51c610da9f3f72825f7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 10 Dec 2021 14:20:45 +0800 Subject: [PATCH 0506/2039] Update 906-super-palindromes.js --- 906-super-palindromes.js | 43 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/906-super-palindromes.js b/906-super-palindromes.js index 5c876add..2335c676 100644 --- a/906-super-palindromes.js +++ b/906-super-palindromes.js @@ -110,3 +110,46 @@ const isPalindromeInt = function (nr) { const isPalindrome = function (nr) { return nr === nr.split('').reverse().join('') } + +// another + +/** + * @param {string} left + * @param {string} right + * @return {number} + */ + const superpalindromesInRange = function(left, right) { + const palindromes = [] + let res = 0 + for(let i = 1; i < 10; i++) { + palindromes.push(`${i}`) + } + for(let i = 1; i < 1e4; i++) { + let l = `${i}`, r = l.split('').reverse().join('') + palindromes.push(`${l}${r}`) + for(let j = 0; j < 10; j++) { + palindromes.push(`${l}${j}${r}`) + } + } + + for(let p of palindromes) { + const square = BigInt(p) * BigInt(p) + if(!isPalindrome(`${square}`)) continue + if(BigInt(left) <= square && square <= BigInt(right)) res++ + } + + return res + + function isPalindrome(str) { + let i = 0; + let j = str.length - 1; + while (i < j) { + if (str.charAt(i) !== str.charAt(j)) { + return false; + } + i++; + j--; + } + return true; + } +}; From e642e874985f1fbb6331fd36b151424ac18f3e8f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 10 Dec 2021 14:21:04 +0800 Subject: [PATCH 0507/2039] Update 906-super-palindromes.js --- 906-super-palindromes.js | 45 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/906-super-palindromes.js b/906-super-palindromes.js index 2335c676..9b97b889 100644 --- a/906-super-palindromes.js +++ b/906-super-palindromes.js @@ -153,3 +153,48 @@ const isPalindrome = function (nr) { return true; } }; + +// another + +/** + * @param {string} left + * @param {string} right + * @return {number} + */ +const superpalindromesInRange = function (left, right) { + let ans = 9 >= left && 9 <= right ? 1 : 0 + + const isPal = (str) => { + for (let i = 0, j = str.length - 1; i < j; i++, j--) + if (str.charAt(i) !== str.charAt(j)) return false + return true + } + + for (let dig = 1; dig < 10; dig++) { + let isOdd = dig % 2 && dig !== 1, + innerLen = (dig >> 1) - 1, + innerLim = Math.max(1, 2 ** innerLen), + midPos = dig >> 1, + midLim = isOdd ? 3 : 1 + for (let edge = 1; edge < 3; edge++) { + let pal = new Uint8Array(dig) + ;(pal[0] = edge), (pal[dig - 1] = edge) + if (edge === 2) (innerLim = 1), (midLim = Math.min(midLim, 2)) + for (let inner = 0; inner < innerLim; inner++) { + if (inner > 0) { + let innerStr = inner.toString(2).padStart(innerLen, '0') + for (let i = 0; i < innerLen; i++) + (pal[1 + i] = innerStr[i]), (pal[dig - 2 - i] = innerStr[i]) + } + for (let mid = 0; mid < midLim; mid++) { + if (isOdd) pal[midPos] = mid + let palin = ~~pal.join(''), + square = BigInt(palin) * BigInt(palin) + if (square > right) return ans + if (square >= left && isPal(square.toString())) ans++ + } + } + } + } + return ans +} From a7ba97872b900242725942c79ba905277c22b0df Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Dec 2021 12:21:14 +0800 Subject: [PATCH 0508/2039] Create 2103-rings-and-rods.js --- 2103-rings-and-rods.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2103-rings-and-rods.js diff --git a/2103-rings-and-rods.js b/2103-rings-and-rods.js new file mode 100644 index 00000000..eb8abfab --- /dev/null +++ b/2103-rings-and-rods.js @@ -0,0 +1,22 @@ +/** + * @param {string} rings + * @return {number} + */ +const countPoints = function(rings) { + const hash = {} + + for(let i = 0, n = rings.length; i < n; i+=2) { + const ch = rings[i], num = +rings[i + 1] + if(hash[num] == null) hash[num] = new Set() + hash[num].add(ch) + } + + + + let res = 0 + Object.keys(hash).forEach(k => { + if(hash[k].size === 3) res++ + }) + + return res +}; From b9163218281d8e1807651ace6635e7a2504f83fe Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Dec 2021 12:22:21 +0800 Subject: [PATCH 0509/2039] Create 2104-sum-of-subarray-ranges.js --- 2104-sum-of-subarray-ranges.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2104-sum-of-subarray-ranges.js diff --git a/2104-sum-of-subarray-ranges.js b/2104-sum-of-subarray-ranges.js new file mode 100644 index 00000000..c3fae69d --- /dev/null +++ b/2104-sum-of-subarray-ranges.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const subArrayRanges = function(nums) { + const n = nums.length, { max, min } = Math + let res = 0 + + for(let i = 0; i < n; i++) { + let [most, least] = [-Infinity, Infinity] + for(let j = i; j < n; j++) { + most = max(most, nums[j]) + least = min(least, nums[j]) + res += most - least + } + } + return res +}; From df9998d73d7e22000efa2dcb74dea321746ea3cd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Dec 2021 12:23:32 +0800 Subject: [PATCH 0510/2039] Create 2105-watering-plants-ii.js --- 2105-watering-plants-ii.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2105-watering-plants-ii.js diff --git a/2105-watering-plants-ii.js b/2105-watering-plants-ii.js new file mode 100644 index 00000000..3d4f62e6 --- /dev/null +++ b/2105-watering-plants-ii.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} plants + * @param {number} capacityA + * @param {number} capacityB + * @return {number} + */ +const minimumRefill = function(plants, capacityA, capacityB) { + const n = plants.length + let [left, right] = [0, n - 1] + let [A, B] = [capacityA, capacityB] + let ans = 0 + while (left < right) { + if (A < plants[left]) { + A = capacityA + ans += 1 + } + + A -= plants[left] + left += 1 + if (B < plants[right]) { + B = capacityB + ans += 1 + } + + B -= plants[right] + right -= 1 + } + + + if (left != right || A >= plants[left] || B >= plants[left]) return ans + return ans + 1 +}; + From 97a9d6f07b0f48406335e285a88854424f65ffc2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Dec 2021 12:24:10 +0800 Subject: [PATCH 0511/2039] Create 2106-maximum-fruits-harvested-after-at-most-k-steps.js --- ...-fruits-harvested-after-at-most-k-steps.js | 66 +++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 2106-maximum-fruits-harvested-after-at-most-k-steps.js diff --git a/2106-maximum-fruits-harvested-after-at-most-k-steps.js b/2106-maximum-fruits-harvested-after-at-most-k-steps.js new file mode 100644 index 00000000..95c808c0 --- /dev/null +++ b/2106-maximum-fruits-harvested-after-at-most-k-steps.js @@ -0,0 +1,66 @@ +/** + * @param {number[][]} fruits + * @param {number} startPos + * @param {number} k + * @return {number} + */ +const maxTotalFruits = function(fruits, startPos, k) { + let n = fruits.length, { max, min } = Math + let pos = fruits.map(([p,a]) => p) + const prefix = Array(n).fill(0) + + let curr = 0 + for (let i = 0; i < n; i++) { + curr += fruits[i][1] + prefix[i] = curr + } + + function bisect_left(a, x, lo = 0, hi = null) { + // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } + function bisect_right(a, x, lo = 0, hi = null) { + // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + x < a[mid] ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function query(left, right) { + left = max(left, 0) + right = min(right, 200000) + let l = bisect_left(pos, left) + let r = bisect_right(pos, right) - 1 + if (l > r) return 0 + if (!l) return prefix[r] + return prefix[r] - prefix[l - 1] + } + + + let best = 0 + let idx = 0 + for(let right = startPos + k; right > startPos - 1; right -= 2) { + let cand = query(startPos - idx, right) + best = max(best, cand) + idx += 1 + } + + idx = 0 + for(let left = startPos - k; left < startPos + 1; left += 2) { + let cand = query(left, startPos + idx) + best = max(best, cand) + idx += 1 + } + + return best +}; + From 02a362a3590c1cf1a7a49f85e1b964a52c6bee99 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 13 Dec 2021 10:19:33 +0800 Subject: [PATCH 0512/2039] Update 1277-count-square-submatrices-with-all-ones.js --- ...-count-square-submatrices-with-all-ones.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1277-count-square-submatrices-with-all-ones.js b/1277-count-square-submatrices-with-all-ones.js index f0f1bd44..61494fcb 100644 --- a/1277-count-square-submatrices-with-all-ones.js +++ b/1277-count-square-submatrices-with-all-ones.js @@ -1,3 +1,27 @@ +/** + * @param {number[][]} matrix + * @return {number} + */ +const countSquares = function (matrix) { + const [m, n] = [matrix.length, matrix[0].length] + let res = 0 + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(matrix[i][j] && i > 0 && j > 0) { + matrix[i][j] = 1 + Math.min( + matrix[i - 1][j], + matrix[i][j - 1], + matrix[i - 1][j - 1], + ) + } + res += matrix[i][j] + } + } + return res +} + +// another + /** * @param {number[][]} matrix * @return {number} From fdcce3a85feba3c04846792a2f83e71efb477951 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Dec 2021 10:32:02 +0800 Subject: [PATCH 0513/2039] Create 2088-count-fertile-pyramids-in-a-land.js --- 2088-count-fertile-pyramids-in-a-land.js | 48 ++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2088-count-fertile-pyramids-in-a-land.js diff --git a/2088-count-fertile-pyramids-in-a-land.js b/2088-count-fertile-pyramids-in-a-land.js new file mode 100644 index 00000000..a44c84c3 --- /dev/null +++ b/2088-count-fertile-pyramids-in-a-land.js @@ -0,0 +1,48 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const countPyramids = function(grid) { + const rev = clone(grid) + let res = count(grid) + rev.reverse() + res += count(rev) + return res + + function clone(grid) { + let res = [] + for (const row of grid) { + res.push(row.slice()) + } + return res + } + function reverse(grid) { + let l = 0, r = grid.length - 1 + while(l < r) { + const tmp = grid[l] + grid[l] = grid[r] + grid[r] = tmp + l++ + r-- + } + } + + function count(grid) { + const m = grid.length, n = grid[0].length + let res = 0 + + for (let i = 1; i < m; i++) { + for (let j = 1; j < n - 1; j++) { + if (grid[i][j] && grid[i - 1][j]) { + grid[i][j] = Math.min( + grid[i - 1][j - 1], + grid[i - 1][j + 1] + ) + 1 + res += grid[i][j] - 1 + } + } + } + + return res + } +}; From fbf647085254a8c7a705f0c6c003a2824d469bfb Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Dec 2021 10:34:08 +0800 Subject: [PATCH 0514/2039] Update 2088-count-fertile-pyramids-in-a-land.js --- 2088-count-fertile-pyramids-in-a-land.js | 23 +++-------------------- 1 file changed, 3 insertions(+), 20 deletions(-) diff --git a/2088-count-fertile-pyramids-in-a-land.js b/2088-count-fertile-pyramids-in-a-land.js index a44c84c3..f1677e0d 100644 --- a/2088-count-fertile-pyramids-in-a-land.js +++ b/2088-count-fertile-pyramids-in-a-land.js @@ -2,35 +2,19 @@ * @param {number[][]} grid * @return {number} */ -const countPyramids = function(grid) { - const rev = clone(grid) + const countPyramids = function(grid) { + const rev = clone(grid).reverse() let res = count(grid) - rev.reverse() res += count(rev) return res function clone(grid) { - let res = [] - for (const row of grid) { - res.push(row.slice()) - } - return res - } - function reverse(grid) { - let l = 0, r = grid.length - 1 - while(l < r) { - const tmp = grid[l] - grid[l] = grid[r] - grid[r] = tmp - l++ - r-- - } + return grid.map(e => e.slice()) } function count(grid) { const m = grid.length, n = grid[0].length let res = 0 - for (let i = 1; i < m; i++) { for (let j = 1; j < n - 1; j++) { if (grid[i][j] && grid[i - 1][j]) { @@ -42,7 +26,6 @@ const countPyramids = function(grid) { } } } - return res } }; From b3f0f3c566bec9753b30c12e8e24f38d5ff9631f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Dec 2021 10:59:31 +0800 Subject: [PATCH 0515/2039] Create 2086-minimum-number-of-buckets-required-to-collect-rainwater-from-houses.js --- ...required-to-collect-rainwater-from-houses.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2086-minimum-number-of-buckets-required-to-collect-rainwater-from-houses.js diff --git a/2086-minimum-number-of-buckets-required-to-collect-rainwater-from-houses.js b/2086-minimum-number-of-buckets-required-to-collect-rainwater-from-houses.js new file mode 100644 index 00000000..e7193788 --- /dev/null +++ b/2086-minimum-number-of-buckets-required-to-collect-rainwater-from-houses.js @@ -0,0 +1,17 @@ +/** + * @param {string} street + * @return {number} + */ +var minimumBuckets = function(street) { + const arr = street.split(''), n = arr.length + let res = 0 + for(let i = 0; i < arr.length; i++) { + if(arr[i] === 'H') { + if(i > 0 && arr[i - 1] === 'B') continue + if(i < n - 1 && arr[i + 1] === '.') arr[i + 1] = 'B', res++ + else if(i > 0 && arr[i - 1] === '.') arr[i - 1] = 'B', res++ + else return -1 + } + } + return res +}; From 25258618fe63611a8994426e51548c0865290e55 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 17 Dec 2021 10:37:49 +0800 Subject: [PATCH 0516/2039] Update 2092-find-all-people-with-secret.js --- 2092-find-all-people-with-secret.js | 52 +++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/2092-find-all-people-with-secret.js b/2092-find-all-people-with-secret.js index 88ab147f..fc592271 100644 --- a/2092-find-all-people-with-secret.js +++ b/2092-find-all-people-with-secret.js @@ -1,3 +1,55 @@ +/** + * @param {number} n + * @param {number[][]} meetings + * @param {number} firstPerson + * @return {number[]} + */ +const findAllPeople = function(n, meetings, firstPerson) { + meetings.sort((a, b) => a[2] - b[2]) + const uf = new UnionFind(n); + uf.connect(0, firstPerson); + let ppl = []; + for (let i = 0, len = meetings.length; i < len; ) { + ppl = []; + let time = meetings[i][2]; + while (i < len && meetings[i][2] === time) { + uf.connect(meetings[i][0], meetings[i][1]); + ppl.push(meetings[i][0]); + ppl.push(meetings[i][1]); + i++ + } + for (let n of ppl) { + if (!uf.connected(0, n)) uf.reset(n); + } + } + let ans = []; + for (let i = 0; i < n; ++i) { + if (uf.connected(0, i)) ans.push(i); + } + return ans; +}; + +class UnionFind { + constructor(n) { + this.arr = Array(n).fill(null) + this.arr.forEach((e, i, arr) => arr[i] = i) + } + connect(a, b) { + this.arr[this.find(a)] = this.find(this.arr[b]) + } + find(a) { + return this.arr[a] === a ? a : (this.arr[a] = this.find(this.arr[a])) + } + connected(a, b) { + return this.find(a) === this.find(b) + } + reset(a) { + this.arr[a] = a + } +} + +// another + /** * @param {number} n * @param {number[][]} meetings From b3e47618852781b0004cc99147838e2e49ca1301 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Dec 2021 11:36:20 +0800 Subject: [PATCH 0517/2039] Create 5956-find-first-palindromic-string-in-the-array.js --- ...d-first-palindromic-string-in-the-array.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 5956-find-first-palindromic-string-in-the-array.js diff --git a/5956-find-first-palindromic-string-in-the-array.js b/5956-find-first-palindromic-string-in-the-array.js new file mode 100644 index 00000000..b496507a --- /dev/null +++ b/5956-find-first-palindromic-string-in-the-array.js @@ -0,0 +1,23 @@ +/** + * @param {string[]} words + * @return {string} + */ +const firstPalindrome = function(words) { + for(let str of words) { + if(isPa(str)) return str + } + + return '' +}; + +function isPa(str) { + let l = 0, r = str.length - 1 + while(l < r) { + if(str[l] !== str[r]) return false + l++ + r-- + } + + + return true +} From c32e88e36bac0bc1b9af082caaa28bf62027ad24 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Dec 2021 11:36:48 +0800 Subject: [PATCH 0518/2039] Create 5957-adding-spaces-to-a-string.js --- 5957-adding-spaces-to-a-string.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 5957-adding-spaces-to-a-string.js diff --git a/5957-adding-spaces-to-a-string.js b/5957-adding-spaces-to-a-string.js new file mode 100644 index 00000000..1696b3b6 --- /dev/null +++ b/5957-adding-spaces-to-a-string.js @@ -0,0 +1,18 @@ +/** + * @param {string} s + * @param {number[]} spaces + * @return {string} + */ +var addSpaces = function(s, spaces) { + let res = '', j = 0, idx = spaces[j] + for(let i = 0, n = s.length; i < n; i++) { + if(i === idx) { + res += ' ' + j++ + idx = spaces[j] + } + res += s[i] + } + + return res +}; From 7c68bf66eb05a2f7232cefe21d645455992690af Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Dec 2021 11:37:17 +0800 Subject: [PATCH 0519/2039] Create 5958-number-of-smooth-descent-periods-of-a-stock.js --- ...er-of-smooth-descent-periods-of-a-stock.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 5958-number-of-smooth-descent-periods-of-a-stock.js diff --git a/5958-number-of-smooth-descent-periods-of-a-stock.js b/5958-number-of-smooth-descent-periods-of-a-stock.js new file mode 100644 index 00000000..d797df08 --- /dev/null +++ b/5958-number-of-smooth-descent-periods-of-a-stock.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} prices + * @return {number} + */ +const getDescentPeriods = function(prices) { + if(prices.length === 1) return 1 + let res = 0, idx = 0 + + for (let i = 1, n = prices.length; i < n ; i++) { + if(prices[i - 1] - prices[i] === 1) { + if (i === n - 1) { + const len = i - idx + 1 + res += (len + 1) * len / 2 + } + } else { + const len = i - 1 - idx + 1 + res += (len + 1) * len / 2 + idx = i + if(i === n - 1) { + res += 1 + } + } + + } + + return res +}; From 0a82b29a7a84546cc39fd985518a7d5b302a7e80 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Dec 2021 11:37:46 +0800 Subject: [PATCH 0520/2039] Create 5959-minimum-operations-to-make-the-array-k-increasing.js --- ...erations-to-make-the-array-k-increasing.js | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 5959-minimum-operations-to-make-the-array-k-increasing.js diff --git a/5959-minimum-operations-to-make-the-array-k-increasing.js b/5959-minimum-operations-to-make-the-array-k-increasing.js new file mode 100644 index 00000000..75490810 --- /dev/null +++ b/5959-minimum-operations-to-make-the-array-k-increasing.js @@ -0,0 +1,45 @@ +/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +const kIncreasing = function(arr, k) { + const n = arr.length + const a = Array.from({ length: k }, () => Array()) + + for(let i = 0; i < k; i++) { + for(let j = i; j < n; j += k) { + a[i].push(arr[j]) + } + } + + let res = 0 + for(let i = 0; i < a.length; i++) { + const r = a[i] + res += r.length - lis(r) + } + + return res + + function bisect_right(a, x, lo = 0, hi = null) { // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative'); + if (hi == null) hi = a.length; + while (lo < hi) { + let mid = parseInt((lo + hi) / 2); + x < a[mid] ? hi = mid : lo = mid + 1; + } + return lo; + } + + function lis(ar) { + let q = [] + for (let x of ar) { + let i = bisect_right(q, x) + if (i == q.length) q.push(x) + else q[i] = x + } + + return q.length + } +}; + From 279caa1230f2ef319217de70505baac767e810dd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Dec 2021 20:12:16 +0800 Subject: [PATCH 0521/2039] Create 2097-valid-arrangement-of-pairs.js --- 2097-valid-arrangement-of-pairs.js | 36 ++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2097-valid-arrangement-of-pairs.js diff --git a/2097-valid-arrangement-of-pairs.js b/2097-valid-arrangement-of-pairs.js new file mode 100644 index 00000000..35ae9f41 --- /dev/null +++ b/2097-valid-arrangement-of-pairs.js @@ -0,0 +1,36 @@ +const packDGInOutDegreeMap = (gm, edges, dm) => { for (const [u, v] of edges) { if (!gm.has(u)) gm.set(u, []); gm.get(u).push(v); dm.set(u, (dm.get(u) || 0) + 1); dm.set(v, (dm.get(v) || 0) - 1); } }; + +/** + * @param {number[][]} pairs + * @return {number[][]} + */ +const validArrangement = (pairs) => { + let g = new Map(), deg = new Map(), res = []; + packDGInOutDegreeMap(g, pairs, deg); + let start = -1; + for (const [node, ] of deg) { // looking for starting node + if (start == -1 || deg.get(node) == 1) start = node; + } + let path = eulerianPath(g, start); + path.reverse(); + for (let i = 1; i < path.length; i++) { + res.push([path[i-1], path[i]]); + } + return res; +}; + +const eulerianPath = (g, start) => { // eulerian Path with Hierholzer’s Algorithm + let st = [start], path = []; + while (st.length) { + let u = st[st.length - 1], ua = g.get(u) || []; + if (ua.length) { + let v = ua.pop(); + g.set(u, ua); + st.push(v); + } else { + path.push(u); + st.pop(); + } + } + return path; +}; From 151eddef15e877cb8fb8179f4bf98378e6bbfdb9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 22 Dec 2021 11:24:41 +0800 Subject: [PATCH 0522/2039] Update 1123-lowest-common-ancestor-of-deepest-leaves.js --- ...owest-common-ancestor-of-deepest-leaves.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/1123-lowest-common-ancestor-of-deepest-leaves.js b/1123-lowest-common-ancestor-of-deepest-leaves.js index 36148413..ef42ddea 100644 --- a/1123-lowest-common-ancestor-of-deepest-leaves.js +++ b/1123-lowest-common-ancestor-of-deepest-leaves.js @@ -1,3 +1,36 @@ +/** + * 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 {TreeNode} + */ +const lcaDeepestLeaves = function(root) { + let maxDepth = 0, lcaNode = null + + function lca(node, depth) { + if(node == null) return depth - 1 + maxDepth = Math.max(depth, maxDepth) + const left = lca(node.left, depth + 1) + const right = lca(node.right, depth + 1) + if(left === maxDepth && right === maxDepth) { + lcaNode = node + } + return Math.max(left, right) + } + + lca(root, 0) + return lcaNode +}; + + +// another + /** * Definition for a binary tree node. * function TreeNode(val) { From 2869cbc81b05b46ac0fe51d1f55426230066eca1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 Dec 2021 09:41:50 +0800 Subject: [PATCH 0523/2039] Update 1740-find-distance-in-a-binary-tree.js --- 1740-find-distance-in-a-binary-tree.js | 40 ++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/1740-find-distance-in-a-binary-tree.js b/1740-find-distance-in-a-binary-tree.js index 9d982dec..97dae690 100644 --- a/1740-find-distance-in-a-binary-tree.js +++ b/1740-find-distance-in-a-binary-tree.js @@ -1,3 +1,43 @@ +/** + * 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} p + * @param {number} q + * @return {number} + */ +const findDistance = function(root, p, q) { + if(p === q) return 0 + return dfs(root, 0) + + function dfs(node, depth) { + let res = depth + if (node == null) { + res = 0 + } else if(node.val === p || node.val === q) { + let left = dfs(node.left, 1) + let right = dfs(node.right, 1) + res = (left > 0 || right > 0) ? Math.max(left, right) : res + } else { + let left = dfs(node.left, depth + 1) + let right = dfs(node.right, depth + 1) + res = left + right + if(left !== 0 && right !== 0) { + res -= 2 * depth + } + } + return res + } +}; + +// another + /** * Definition for a binary tree node. * function TreeNode(val, left, right) { From 0c193c36bf5b165fa9586fb75ffbca0ae0be6c00 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Dec 2021 15:14:49 +0800 Subject: [PATCH 0524/2039] Create 2119-a-number-after-a-double-reversal.js --- 2119-a-number-after-a-double-reversal.js | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 2119-a-number-after-a-double-reversal.js diff --git a/2119-a-number-after-a-double-reversal.js b/2119-a-number-after-a-double-reversal.js new file mode 100644 index 00000000..6d82d7f3 --- /dev/null +++ b/2119-a-number-after-a-double-reversal.js @@ -0,0 +1,9 @@ +/** + * @param {number} num + * @return {boolean} + */ +var isSameAfterReversals = function(num) { + if(('' +num).length === 1) return true + const tmp = (''+num).endsWith('0') + return !tmp +}; From bca43de3055be1a8b4a74b5c9e291c7870cadffa Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 27 Dec 2021 17:27:26 +0800 Subject: [PATCH 0525/2039] Create 2101-detonate-the-maximum-bombs.js --- 2101-detonate-the-maximum-bombs.js | 38 ++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2101-detonate-the-maximum-bombs.js diff --git a/2101-detonate-the-maximum-bombs.js b/2101-detonate-the-maximum-bombs.js new file mode 100644 index 00000000..8955bd15 --- /dev/null +++ b/2101-detonate-the-maximum-bombs.js @@ -0,0 +1,38 @@ +/** + * @param {number[][]} bombs + * @return {number} + */ + const maximumDetonation = function(bombs) { + let n = bombs.length, res = 1, graph = {} + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + if (i === j) continue + if (bombAdj(bombs[i], bombs[j])) { + if (graph[i] == null) graph[i] = [] + graph[i].push(j) + } + } + } + function dfs(node, visited) { + for(const next of (graph[node] || [])) { + if(!visited.has(next)) { + visited.add(next) + dfs(next, visited) + } + } + } + for (let i = 0; i < n; i++) { + const set = new Set([i]) + dfs(i, set) + res = Math.max(res, set.size) + } + + return res +}; + +function bombAdj(source, target) { + const [x1, y1, r1] = source + const [x2, y2] = target + const { abs } = Math + return abs(x1 - x2) ** 2 + abs(y1 - y2) ** 2 <= r1 ** 2 +} From 4c5514c23ce8877358746c0e41cbe55e502c70cb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Dec 2021 15:47:04 +0800 Subject: [PATCH 0526/2039] Update 1944-number-of-visible-people-in-a-queue.js --- 1944-number-of-visible-people-in-a-queue.js | 22 +++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/1944-number-of-visible-people-in-a-queue.js b/1944-number-of-visible-people-in-a-queue.js index 48cccf15..6505ef83 100644 --- a/1944-number-of-visible-people-in-a-queue.js +++ b/1944-number-of-visible-people-in-a-queue.js @@ -21,3 +21,25 @@ const canSeePersonsCount = function(heights) { return ans; }; + +// another + +/** + * @param {number[]} heights + * @return {number[]} + */ +const canSeePersonsCount = function(heights) { + const stack = [], n = heights.length, res = Array(n) + for(let i = n - 1; i >= 0; i--) { + const h = heights[i] + let del = 0 + while(stack.length && stack[stack.length - 1] <= h) { + stack.pop() + del++ + } + res[i] = stack.length ? del + 1 : del + stack.push(h) + } + + return res +}; From a3b3495fe703bbad571304d84fc995c9e989af7e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Dec 2021 19:12:05 +0800 Subject: [PATCH 0527/2039] Update 907-sum-of-subarray-minimums.js --- 907-sum-of-subarray-minimums.js | 25 ++++++++++++++----------- 1 file changed, 14 insertions(+), 11 deletions(-) diff --git a/907-sum-of-subarray-minimums.js b/907-sum-of-subarray-minimums.js index b9cf6459..c3c785c8 100644 --- a/907-sum-of-subarray-minimums.js +++ b/907-sum-of-subarray-minimums.js @@ -2,21 +2,24 @@ * @param {number[]} arr * @return {number} */ -const sumSubarrayMins = function(arr) { - const n = arr.length, s1 = [], s2 = [], left = Array(n), right = Array(n) - for(let i = 0; i < n; i++) { +const sumSubarrayMins = function (arr) { + const n = arr.length, + s1 = [], + s2 = [], + left = Array(n), + right = Array(n) + for (let i = 0; i < n; i++) { let cnt = 1 - while(s1.length && s1[s1.length - 1][0] > arr[i]) { + while (s1.length && s1[s1.length - 1][0] > arr[i]) { cnt += s1.pop()[1] } left[i] = cnt s1.push([arr[i], cnt]) } - - for(let i = n - 1; i >= 0; i--) { + + for (let i = n - 1; i >= 0; i--) { let cnt = 1 - // use ">=" to deal with duplicate elements - while(s2.length && s2[s2.length - 1][0] >= arr[i]) { + while (s2.length && s2[s2.length - 1][0] >= arr[i]) { cnt += s2.pop()[1] } right[i] = cnt @@ -24,11 +27,11 @@ const sumSubarrayMins = function(arr) { } let res = 0 const mod = 1e9 + 7 - for(let i = 0; i < n; i++) { + for (let i = 0; i < n; i++) { // left[i] number of starting positions // right[i] number of ending positions res = (res + arr[i] * left[i] * right[i]) % mod } - + return res -}; +} From 28d4e7cac5621ade85ce2521b48fb1e88b3482c4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Jan 2022 22:21:55 +0800 Subject: [PATCH 0528/2039] Create 1399-count-largest-group.js --- 1399-count-largest-group.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1399-count-largest-group.js diff --git a/1399-count-largest-group.js b/1399-count-largest-group.js new file mode 100644 index 00000000..c99882aa --- /dev/null +++ b/1399-count-largest-group.js @@ -0,0 +1,21 @@ +/** + * @param {number} n + * @return {number} + */ +const countLargestGroup = function(n) { + const hash = {} + const sum = n => `${n}`.split('').reduce((ac, e) => ac + (+e), 0) + for(let i = 1; i <= n; i++) { + const tmp = sum(i) + if(hash[tmp] == null) hash[tmp] = 0 + hash[tmp]++ + } + // console.log(hash) + const val = Math.max(...Object.values(hash)) + let res = 0 + Object.keys(hash).forEach(k => { + if(hash[k] === val) res++ + }) + + return res +}; From c68b0969a12eea7582bc342a9c19f1359263eba7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jan 2022 17:24:23 +0800 Subject: [PATCH 0529/2039] Create 2124-check-if-all-as-appears-before-all-bs.js --- 2124-check-if-all-as-appears-before-all-bs.js | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 2124-check-if-all-as-appears-before-all-bs.js diff --git a/2124-check-if-all-as-appears-before-all-bs.js b/2124-check-if-all-as-appears-before-all-bs.js new file mode 100644 index 00000000..071f480a --- /dev/null +++ b/2124-check-if-all-as-appears-before-all-bs.js @@ -0,0 +1,9 @@ +/** + * @param {string} s + * @return {boolean} + */ +const checkString = function(s) { + const la = s.lastIndexOf('a') + const fb = s.indexOf('b') + return fb === -1 ? true : la < fb +}; From c5c7774d0e008aac19fb0e74aa6ca6b42db1175c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jan 2022 17:24:48 +0800 Subject: [PATCH 0530/2039] Create 2125-number-of-laser-beams-in-a-bank.js --- 2125-number-of-laser-beams-in-a-bank.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2125-number-of-laser-beams-in-a-bank.js diff --git a/2125-number-of-laser-beams-in-a-bank.js b/2125-number-of-laser-beams-in-a-bank.js new file mode 100644 index 00000000..cd5bb046 --- /dev/null +++ b/2125-number-of-laser-beams-in-a-bank.js @@ -0,0 +1,24 @@ +/** + * @param {string[]} bank + * @return {number} + */ +var numberOfBeams = function(bank) { + const comb = (num1, num2) => num1 * num2 + const m = bank.length, n = bank[0].length + if(m === 0 || n === 0) return 0 + let pre = 0, res = 0 + for(let j = 0; j < n; j++) { + if(bank[0][j] === '1') pre++ + } + for(let i = 1; i < m; i++) { + let chk = 0, cur = bank[i] + for(let j = 0; j < n; j++) { + if(cur[j] === '1') chk++ + } + if(chk) { + res += comb(pre, chk) + pre = chk + } + } + return res +}; From 59d7f58e16266639b2ef4a7fdb70c65430902d39 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jan 2022 17:25:18 +0800 Subject: [PATCH 0531/2039] Create 2126-destroying-asteroids.js --- 2126-destroying-asteroids.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2126-destroying-asteroids.js diff --git a/2126-destroying-asteroids.js b/2126-destroying-asteroids.js new file mode 100644 index 00000000..add34396 --- /dev/null +++ b/2126-destroying-asteroids.js @@ -0,0 +1,20 @@ +/** + * @param {number} mass + * @param {number[]} asteroids + * @return {boolean} + */ +const asteroidsDestroyed = function(mass, asteroids) { + asteroids.sort((a, b) => a - b) + let res = true + for(let i = 0, n = asteroids.length; i < n; i++) { + const cur = asteroids[i] + if(mass >= cur) { + mass += cur + } else { + res = false + break + } + } + + return res +}; From 626e3967b3834042a1fccefba2bd3af87a2f18d7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jan 2022 17:25:42 +0800 Subject: [PATCH 0532/2039] Create 2127-maximum-employees-to-be-invited-to-a-meeting.js --- ...um-employees-to-be-invited-to-a-meeting.js | 52 +++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 2127-maximum-employees-to-be-invited-to-a-meeting.js diff --git a/2127-maximum-employees-to-be-invited-to-a-meeting.js b/2127-maximum-employees-to-be-invited-to-a-meeting.js new file mode 100644 index 00000000..c0247001 --- /dev/null +++ b/2127-maximum-employees-to-be-invited-to-a-meeting.js @@ -0,0 +1,52 @@ +/** + * @param {number[]} favorite + * @return {number} + */ +var maximumInvitations = function(favorite) { + const n = favorite.length, m = Array(n).fill(-1), r = Array.from({ length: n }, () => []) + for(let i = 0; i < n; i++) r[favorite[i]].push(i) + + function dfs(u) { + if(m[u] !== -1) return m[u] + let res = 0 + for(let v of r[u]) res = Math.max(res, dfs(v)) + return m[u] = 1 + res + } + let res = 0, free = 0 + for(let i = 0; i < n; ++i) { + if (m[i] != -1) continue; // skip visited nodes + if (favorite[favorite[i]] == i) { + m[i] = m[favorite[i]] = 0; + let a = 0, b = 0; // find the length of the longest arms starting from `i` and `A[i]` + for (let v of r[i]) { + if (v == favorite[i]) continue; + a = Math.max(a, dfs(v)); + } + for (let v of r[favorite[i]]) { + if (v == i) continue; + b = Math.max(b, dfs(v)); + } + free += a + b + 2; // this free component is of length `a+b+2` + } + } + function dfs2(u) { + if (m[u] != -1) return[u, m[u], false]; // this is the merge point + m[u] = 0; + let [mergePoint, depth, mergePointMet] = dfs2(favorite[u]); + if (mergePointMet) { // If we've met the merge point again already, this node is outside of the cycle and should be ignored. + m[u] = 0; + return [mergePoint, depth, true]; + } + m[u] = 1 + depth; // If we haven't met the merge point, we increment the depth. + return [mergePoint, m[u], u == mergePoint]; + } + + for(let i = 0; i < n; i++) { + if(m[i] !== -1) continue + let [mergePoint, depth, mergePointMet] = dfs2(i) + if(mergePointMet) res = Math.max(res, depth) + } + + return Math.max(res, free) +}; + From 3f01dfe6638f05f310a86a23ab78772cc0008cf4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 5 Jan 2022 16:05:12 +0800 Subject: [PATCH 0533/2039] Update 1964-find-the-longest-valid-obstacle-course-at-each-position.js --- ...-valid-obstacle-course-at-each-position.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1964-find-the-longest-valid-obstacle-course-at-each-position.js b/1964-find-the-longest-valid-obstacle-course-at-each-position.js index 86eab10a..878844f2 100644 --- a/1964-find-the-longest-valid-obstacle-course-at-each-position.js +++ b/1964-find-the-longest-valid-obstacle-course-at-each-position.js @@ -1,3 +1,35 @@ +/** + * @param {number[]} obstacles + * @return {number[]} + */ +const longestObstacleCourseAtEachPosition = function(obstacles) { + const n = obstacles.length, res = [], stk = [] + for (let i = 0; i < n; i++) { + const cur = obstacles[i] + let idx = chk(cur) + if (idx === stk.length) { + stk.push(cur) + } else { + stk[idx] = cur + } + res.push(++idx) + } + + return res + + function chk(val) { + let l = 0, r = stk.length + while(l < r) { + const mid = ~~((l + r) / 2) + if(stk[mid] <= val) l = mid + 1 + else r = mid + } + return l + } +}; + +// another + /** * @param {number[]} obstacles * @return {number[]} From 5d8ef4f5efda1ad241f93bf68da1ded6cf1229eb Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 6 Jan 2022 10:23:30 +0800 Subject: [PATCH 0534/2039] Update 5959-minimum-operations-to-make-the-array-k-increasing.js --- ...erations-to-make-the-array-k-increasing.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/5959-minimum-operations-to-make-the-array-k-increasing.js b/5959-minimum-operations-to-make-the-array-k-increasing.js index 75490810..821bceef 100644 --- a/5959-minimum-operations-to-make-the-array-k-increasing.js +++ b/5959-minimum-operations-to-make-the-array-k-increasing.js @@ -1,3 +1,45 @@ +/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +const kIncreasing = function(arr, k) { + let res = 0, matrix = Array.from({ length: k }, () => []), n = arr.length + for(let i = 0; i < k; i++) { + for(let j = i; j < n; j += k) { + matrix[i].push(arr[j]) + } + } + + for (let i = 0; i < k; i++) { + res += matrix[i].length - nonDecreasing(matrix[i]) + } + + return res + + function bisect_right(ar, x, l = 0, r) { + if(r == null) r = ar.length + while(l < r) { + const mid = ~~((l + r) / 2) + if(ar[mid] <= x) l = mid + 1 + else r = mid + } + return l + } + + function nonDecreasing(ar) { + let stk = [] + for(let e of ar) { + const idx = bisect_right(stk, e) + if(idx === stk.length) stk.push(e) + else stk[idx] = e + } + + return stk.length + } +}; + +// another /** * @param {number[]} arr * @param {number} k From e2688bcdc144e41e50b7c3ddca9dd5ab97b42a6c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 6 Jan 2022 10:23:49 +0800 Subject: [PATCH 0535/2039] Rename 5959-minimum-operations-to-make-the-array-k-increasing.js to 2111-minimum-operations-to-make-the-array-k-increasing.js --- ...s => 2111-minimum-operations-to-make-the-array-k-increasing.js | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename 5959-minimum-operations-to-make-the-array-k-increasing.js => 2111-minimum-operations-to-make-the-array-k-increasing.js (100%) diff --git a/5959-minimum-operations-to-make-the-array-k-increasing.js b/2111-minimum-operations-to-make-the-array-k-increasing.js similarity index 100% rename from 5959-minimum-operations-to-make-the-array-k-increasing.js rename to 2111-minimum-operations-to-make-the-array-k-increasing.js From 1664e4a1add4cd69f7b54a4004e07dacdde58c67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 7 Jan 2022 09:50:56 +0800 Subject: [PATCH 0536/2039] Update 1713-minimum-operations-to-make-a-subsequence.js --- ...inimum-operations-to-make-a-subsequence.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1713-minimum-operations-to-make-a-subsequence.js b/1713-minimum-operations-to-make-a-subsequence.js index edd5d4c5..72b75060 100644 --- a/1713-minimum-operations-to-make-a-subsequence.js +++ b/1713-minimum-operations-to-make-a-subsequence.js @@ -1,3 +1,29 @@ +/** + * @param {number[]} target + * @param {number[]} arr + * @return {number} + */ +const minOperations = function(target, arr) { + const hash = {} + for (let i = 0, n = target.length; i < n; i++) { + hash[target[i]] = i + } + const stk = [] + for(let e of arr) { + if(hash[e] == null) continue + let l = 0, r = stk.length + while(l < r) { + const mid = l + (~~((r - l) / 2)) + if(stk[mid] < hash[e]) l = mid + 1 + else r = mid + } + stk[l] = hash[e] + } + return target.length - stk.length +}; + +// another + /** * @param {number[]} target * @param {number[]} arr From 9e1a32ef8832180cba6a1bdba7f0d0791b82ef7c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jan 2022 11:58:33 +0800 Subject: [PATCH 0537/2039] Create 5979-earliest-possible-day-of-full-bloom.js --- 5979-earliest-possible-day-of-full-bloom.js | 36 +++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 5979-earliest-possible-day-of-full-bloom.js diff --git a/5979-earliest-possible-day-of-full-bloom.js b/5979-earliest-possible-day-of-full-bloom.js new file mode 100644 index 00000000..54a811b2 --- /dev/null +++ b/5979-earliest-possible-day-of-full-bloom.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} plantTime + * @param {number[]} growTime + * @return {number} + */ +var earliestFullBloom = function(plantTime, growTime) { + const sum = arr => arr.reduce((ac, e) => ac +e, 0) + let l = 0, r = sum(plantTime) + sum(growTime) + let n = plantTime.length + + let a = [] + for(let i = 0; i < n; i++) { + a.push([growTime[i], plantTime[i] ]) + } + + a.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + a.reverse() + function chk(d) { + let total = -1 + let max_num = 0 + for(let i = 0; i < n; i++) { + total += a[i][1] + max_num = Math.max(max_num, total + a[i][0] + 1) + } + return max_num <= d + } + + while (l < r) { + let m = ~~((l + r) / 2) + if (chk(m)) r = m + else l = m + 1 + } + + return l +}; + From 4c1a7268d88ef13fb8abec4aa486251a446120eb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jan 2022 11:59:02 +0800 Subject: [PATCH 0538/2039] Create 5978-count-words-obtained-after-adding-a-letter.js --- ...nt-words-obtained-after-adding-a-letter.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 5978-count-words-obtained-after-adding-a-letter.js diff --git a/5978-count-words-obtained-after-adding-a-letter.js b/5978-count-words-obtained-after-adding-a-letter.js new file mode 100644 index 00000000..9136ea31 --- /dev/null +++ b/5978-count-words-obtained-after-adding-a-letter.js @@ -0,0 +1,28 @@ +/** + * @param {string[]} startWords + * @param {string[]} targetWords + * @return {number} + */ +var wordCount = function(startWords, targetWords) { + const set = new Set(); + for (let startWord of startWords) { + const chars = startWord.split(''); + chars.sort(); + set.add(chars.join('')); + } + let res = 0; + for (let targetWord of targetWords) { + let chars = targetWord.split(''); + chars.sort() + + let word = chars.join(''); + for (let i = 0; i < chars.length; i++) { + let subWord = word.substring(0, i) + word.substring(i + 1, chars.length); + if (set.has(subWord)) { + res++; + break; + } + } + } + return res; +}; From cae148115a21b7ac6df5612d161700fd664adcfb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jan 2022 11:59:30 +0800 Subject: [PATCH 0539/2039] Create 5977-minimum-swaps-to-group-all-1s-together-ii.js --- ...nimum-swaps-to-group-all-1s-together-ii.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 5977-minimum-swaps-to-group-all-1s-together-ii.js diff --git a/5977-minimum-swaps-to-group-all-1s-together-ii.js b/5977-minimum-swaps-to-group-all-1s-together-ii.js new file mode 100644 index 00000000..a143e4b3 --- /dev/null +++ b/5977-minimum-swaps-to-group-all-1s-together-ii.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minSwaps = function(nums) { + let one = 0; + for (let i = 0; i < nums.length; i++) { + if (nums[i] == 1) + one++; + } + let maxOne = 0; + for (let i = 0; i < one; i++) { + if (nums[i] == 1) + maxOne++; + } + let max = maxOne; + for (let i = 1; i < nums.length; i++) { + if (nums[i - 1] == 1) + maxOne--; + if (nums[(i + one - 1) % nums.length] == 1) + maxOne++; + if (maxOne > max) + max = maxOne; + } + return one - max; + +}; From 01b805985d6991eb64a7b6675bc0e46f1c6edd90 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jan 2022 11:59:56 +0800 Subject: [PATCH 0540/2039] Create 5976-check-if-every-row-and-column-contains-all-numbers.js --- ...ery-row-and-column-contains-all-numbers.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 5976-check-if-every-row-and-column-contains-all-numbers.js diff --git a/5976-check-if-every-row-and-column-contains-all-numbers.js b/5976-check-if-every-row-and-column-contains-all-numbers.js new file mode 100644 index 00000000..fe00e653 --- /dev/null +++ b/5976-check-if-every-row-and-column-contains-all-numbers.js @@ -0,0 +1,34 @@ +/** + * @param {number[][]} matrix + * @return {boolean} + */ +var checkValid = function(matrix) { + const n = matrix.length + let res = true + for(let i = 0; i < n; i++) { + if(!chkRow(i) || !chkCol(i)) { + res = false + break + } + } + + + return res + + function chkRow(i) { + const row = matrix[i], set = new Set() + for(let i = 0; i < n; i++) { + set.add(row[i]) + } + return set.size === n + } + + function chkCol(j) { + const set = new Set() + for(let i = 0; i < n; i++) { + set.add(matrix[i][j]) + } + + return set.size === n + } +}; From 567ce7fa4dbe3e2eda999d659c9c6456b7d9c537 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jan 2022 09:59:24 +0800 Subject: [PATCH 0541/2039] Create 2115-find-all-possible-recipes-from-given-supplies.js --- ...ll-possible-recipes-from-given-supplies.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2115-find-all-possible-recipes-from-given-supplies.js diff --git a/2115-find-all-possible-recipes-from-given-supplies.js b/2115-find-all-possible-recipes-from-given-supplies.js new file mode 100644 index 00000000..2704f0cd --- /dev/null +++ b/2115-find-all-possible-recipes-from-given-supplies.js @@ -0,0 +1,40 @@ +/** + * @param {string[]} recipes + * @param {string[][]} ingredients + * @param {string[]} supplies + * @return {string[]} + */ +const findAllRecipes = function(recipes, ingredients, supplies) { + const set = new Set(supplies), res = [], graph = {}, n = recipes.length + const inDegree = {} + for(let x of recipes) inDegree[x] = 0 + for(let i = 0; i < n; i++) { + for(let j = 0; j < ingredients[i].length; j++) { + const ing = ingredients[i][j] + if(!set.has(ing)) { + if (graph[ing] == null) graph[ing] = [] + graph[ing].push(recipes[i]) + inDegree[recipes[i]]++ + } + } + } + // Kahn's Algorithm + const q = [] + for(let x in inDegree) { + if (inDegree[x] === 0) q.push(x) + } + while(q.length) { + const len = q.length + for(let i = 0; i < len; i++) { + const cur = q.pop() + res.push(cur) + for(let next of (graph[cur] || [])) { + inDegree[next]-- + if(inDegree[next] === 0) { + q.push(next) + } + } + } + } + return res +}; From 2a8c0177cea9eec674b222edeb52595c10cacd55 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Jan 2022 09:34:13 +0800 Subject: [PATCH 0542/2039] Update 1963-minimum-number-of-swaps-to-make-the-string-balanced.js --- ...er-of-swaps-to-make-the-string-balanced.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/1963-minimum-number-of-swaps-to-make-the-string-balanced.js b/1963-minimum-number-of-swaps-to-make-the-string-balanced.js index d54d75be..90a3793d 100644 --- a/1963-minimum-number-of-swaps-to-make-the-string-balanced.js +++ b/1963-minimum-number-of-swaps-to-make-the-string-balanced.js @@ -1,3 +1,22 @@ +/** + * @param {string} s + * @return {number} + */ +const minSwaps = function(s) { + const stk = [] + for (let e of s) { + if(e === '[') stk.push(e) + else { + if(stk.length) { + stk.pop() + } else stk.push(e) + } + } + return Math.ceil(stk.length / 2) +}; + +// another + /** * @param {string} s * @return {number} From 38723abf8306694626e9233129261cbd8b493c9b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 13 Jan 2022 09:24:41 +0800 Subject: [PATCH 0543/2039] Update 301-remove-invalid-parentheses.js --- 301-remove-invalid-parentheses.js | 34 +++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/301-remove-invalid-parentheses.js b/301-remove-invalid-parentheses.js index c587e840..9cb8bdde 100644 --- a/301-remove-invalid-parentheses.js +++ b/301-remove-invalid-parentheses.js @@ -1,3 +1,37 @@ +/** + * @param {string} s + * @return {string[]} + */ +const removeInvalidParentheses = function(s) { + const res = [] + helper(s, 0, 0, ['(', ')']) + return res + + function helper(str, lastI, lastJ, pair) { + let openNum = 0, closeNum = 0 + for(let i = lastI; i < str.length; i++) { + if(str[i] === pair[0]) openNum++ + if(str[i] === pair[1]) closeNum++ + if(closeNum > openNum) { + for(let j = lastJ; j <= i; j++) { + if(str[j] === pair[1] && (j === lastJ || str[j - 1] !== pair[1])) { + helper(str.slice(0, j) + str.slice(j + 1), i, j, pair) + } + } + return + } + } + let rev = str.split('').reverse().join('') + if(pair[0] === '(') { + helper(rev, 0, 0, [')', '(']) + } else { + res.push(rev) + } + } +}; + +// another + /** * @param {string} s * @return {string[]} From fcb3a022d812622502a67af5552fb0a14cc09b32 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 14 Jan 2022 08:59:23 +0800 Subject: [PATCH 0544/2039] Update 1249-minimum-remove-to-make-valid-parentheses.js --- ...inimum-remove-to-make-valid-parentheses.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1249-minimum-remove-to-make-valid-parentheses.js b/1249-minimum-remove-to-make-valid-parentheses.js index 8f6a909c..1599e395 100644 --- a/1249-minimum-remove-to-make-valid-parentheses.js +++ b/1249-minimum-remove-to-make-valid-parentheses.js @@ -49,3 +49,27 @@ const minRemoveToMakeValid = function(s) { } return res.join('') }; + +// another + +/** + * @param {string} s + * @return {string} + */ +const minRemoveToMakeValid = function(s) { + const stk = [], arr = s.split(''), n = s.length + for(let i = 0; i < n; i++) { + if(s[i] === '(') stk.push(i) + if(s[i] === ')') { + if(stk.length && stk[stk.length - 1] >= 0) stk.pop() + else stk.push(-(i + 1)) + } + } + + while(stk.length) { + const tmp = stk.pop() + if(tmp < 0) arr[-tmp - 1] = '' + else arr[tmp] = '' + } + return arr.join('') +}; From 903cc8d03e2b4db2a20b4e8dd0f175865083c325 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 Jan 2022 19:10:48 +0800 Subject: [PATCH 0545/2039] Update 1541-minimum-insertions-to-balance-a-parentheses-string.js --- ...ertions-to-balance-a-parentheses-string.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1541-minimum-insertions-to-balance-a-parentheses-string.js b/1541-minimum-insertions-to-balance-a-parentheses-string.js index 30fa00fa..f9f78d74 100644 --- a/1541-minimum-insertions-to-balance-a-parentheses-string.js +++ b/1541-minimum-insertions-to-balance-a-parentheses-string.js @@ -1,3 +1,34 @@ +/** + * @param {string} s + * @return {number} + */ +const minInsertions = function(s) { + let insert = 0, idx = 0, open = 0, len = s.length + while(idx < len) { + const ch = s[idx] + if(ch === '(') { + open++ + idx++ + } else { + if(open > 0) { + open-- + } else { + insert++ + } + if(idx < len - 1 && s[idx + 1] === ')') { + idx += 2 + } else { + insert++ + idx++ + } + } + } + if(open) insert += open * 2 + return insert +}; + +// another + /** * @param {string} s * @return {number} From 40f83763e1aedd23375b3ecf34c9a9c613c9c67f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jan 2022 17:20:16 +0800 Subject: [PATCH 0546/2039] Create 2138-divide-a-string-into-groups-of-size-k.js --- 2138-divide-a-string-into-groups-of-size-k.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2138-divide-a-string-into-groups-of-size-k.js diff --git a/2138-divide-a-string-into-groups-of-size-k.js b/2138-divide-a-string-into-groups-of-size-k.js new file mode 100644 index 00000000..1e532b80 --- /dev/null +++ b/2138-divide-a-string-into-groups-of-size-k.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @param {number} k + * @param {character} fill + * @return {string[]} + */ +var divideString = function(s, k, fill) { + let res = [], tmp = '' + for(let i = 0, n = s.length; i < n; i++) { + tmp += s[i] + if(tmp.length === k) { + res.push(tmp) + tmp = '' + } + } + if(tmp.length) { + for(let i = 0, limit = k - tmp.length; i < limit; i++) { + tmp += fill + } + res.push(tmp) + } + return res +}; From d7a3f0d48c5283fbb05042fb28d4077bf3ed5d0e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jan 2022 17:20:40 +0800 Subject: [PATCH 0547/2039] Create 2139-minimum-moves-to-reach-target-score.js --- 2139-minimum-moves-to-reach-target-score.js | 28 +++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2139-minimum-moves-to-reach-target-score.js diff --git a/2139-minimum-moves-to-reach-target-score.js b/2139-minimum-moves-to-reach-target-score.js new file mode 100644 index 00000000..abbd61f9 --- /dev/null +++ b/2139-minimum-moves-to-reach-target-score.js @@ -0,0 +1,28 @@ +/** + * @param {number} target + * @param {number} maxDoubles + * @return {number} + */ +const minMoves = function(target, maxDoubles) { + let count = 0; + + while(target != 1){ + + if(target % 2 != 0){ + target--; + count++; + } + else{ + if(maxDoubles != 0){ + target /= 2; + count++; + maxDoubles--; + } + else{ + count += target - 1; + break; + } + } + } + return count; +}; From 1fb1cb2a59245efbb82183c198059131ba5dbc67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jan 2022 17:21:13 +0800 Subject: [PATCH 0548/2039] Create 2140-solving-questions-with-brainpower.js --- 2140-solving-questions-with-brainpower.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2140-solving-questions-with-brainpower.js diff --git a/2140-solving-questions-with-brainpower.js b/2140-solving-questions-with-brainpower.js new file mode 100644 index 00000000..908ff28d --- /dev/null +++ b/2140-solving-questions-with-brainpower.js @@ -0,0 +1,20 @@ +/** + * @param {number[][]} questions + * @return {number} + */ +var mostPoints = function (questions) { + let n = questions.length + const temp = Array(n).fill(0) + + temp[n - 1] = questions[n - 1][0] + + for (let i = n - 2; i >= 0; i--) { + if (i + questions[i][1] + 1 <= n - 1) + temp[i] = Math.max( + temp[i + 1], + questions[i][0] + temp[Math.min(n - 1, i + questions[i][1] + 1)] + ) + else temp[i] = Math.max(temp[i + 1], questions[i][0]) + } + return temp[0] +} From 031ed390443c935ea139388b5c0cde83abd28431 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jan 2022 17:21:45 +0800 Subject: [PATCH 0549/2039] Create 2141-maximum-running-time-of-n-computers.js --- 2141-maximum-running-time-of-n-computers.js | 37 +++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 2141-maximum-running-time-of-n-computers.js diff --git a/2141-maximum-running-time-of-n-computers.js b/2141-maximum-running-time-of-n-computers.js new file mode 100644 index 00000000..762b70b4 --- /dev/null +++ b/2141-maximum-running-time-of-n-computers.js @@ -0,0 +1,37 @@ +/** + * @param {number} n + * @param {number[]} batteries + * @return {number} + */ +var maxRunTime = function (n, batteries) { + batteries.sort((a, b) => a - b) + const sum = batteries.reduce((ac, e) => ac + BigInt(e), 0n) + let hi = ~~(sum / BigInt(n)) + 1n, + lo = 0n + while (lo < hi) { + let mid = ~~((lo + hi) / 2n) + if (chk(mid)) { + lo = mid + 1n + } else { + hi = mid + } + } + + return lo - 1n + function chk(x) { + let current = 0n + let i = 0n + for (let b of batteries) { + if (i == BigInt(n)) break + if (b > x) b = x + if (b >= x - current) { + i += 1n + current = BigInt(b) - (x - current) + } else { + current += BigInt(b) + } + } + + return i == n + } +} From 4c49f6243772ea93bec0b41a2cc420dabf09d56a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jan 2022 20:37:55 +0800 Subject: [PATCH 0550/2039] Update 2140-solving-questions-with-brainpower.js --- 2140-solving-questions-with-brainpower.js | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/2140-solving-questions-with-brainpower.js b/2140-solving-questions-with-brainpower.js index 908ff28d..c971f87e 100644 --- a/2140-solving-questions-with-brainpower.js +++ b/2140-solving-questions-with-brainpower.js @@ -2,7 +2,7 @@ * @param {number[][]} questions * @return {number} */ -var mostPoints = function (questions) { +const mostPoints = function (questions) { let n = questions.length const temp = Array(n).fill(0) @@ -12,7 +12,7 @@ var mostPoints = function (questions) { if (i + questions[i][1] + 1 <= n - 1) temp[i] = Math.max( temp[i + 1], - questions[i][0] + temp[Math.min(n - 1, i + questions[i][1] + 1)] + questions[i][0] + temp[i + questions[i][1] + 1] ) else temp[i] = Math.max(temp[i + 1], questions[i][0]) } From 5d1a83828bbc0828392ba309ba6b142eabdb7340 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 Jan 2022 17:29:52 +0800 Subject: [PATCH 0551/2039] Create 2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js --- ...ck-if-a-parentheses-string-can-be-valid.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js diff --git a/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js b/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js new file mode 100644 index 00000000..fb99fe6e --- /dev/null +++ b/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js @@ -0,0 +1,21 @@ +/** + * @param {string} s + * @param {string} locked + * @return {boolean} + */ +const canBeValid = function (s, locked) { + return s.length % 2 === 0 && chk(s, locked, '(') && chk(s, locked, ')') + + function chk(s, locked, op) { + let bal = 0, + wild = 0, + sz = s.length + let start = op === '(' ? 0 : sz - 1, + dir = op === '(' ? 1 : -1 + for (let i = start; i >= 0 && i < sz && wild + bal >= 0; i += dir) { + if (locked[i] === '1') bal += s[i] === op ? 1 : -1 + else wild++ + } + return Math.abs(bal) <= wild + } +} From 910792ac99d0b4bcd40ccbf0f7a20241c5d4d759 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 Jan 2022 19:44:45 +0800 Subject: [PATCH 0552/2039] Update 2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js --- ...ck-if-a-parentheses-string-can-be-valid.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js b/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js index fb99fe6e..9c654fd1 100644 --- a/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js +++ b/2116-check-if-a-parentheses-string-can-be-validcheck-if-a-parentheses-string-can-be-valid.js @@ -1,3 +1,28 @@ +/** + * @param {string} s + * @param {string} locked + * @return {boolean} + */ +const canBeValid = function(s, locked) { + const n = s.length + if(n % 2 === 1) return false + let x = 0 + for(let i = 0; i < n; i++) { + if(s[i] === '(' || locked[i] === '0') x++ + else if(x > 0) x-- + else return false + } + x = 0 + for(let i = n - 1; i >= 0; i--) { + if(s[i] === ')' || locked[i] === '0') x++ + else if(x > 0) x-- + else return false + } + return true +}; + +// another + /** * @param {string} s * @param {string} locked From b2273cc0d003e0debc4b20bd284fac61499a03a9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Jan 2022 09:09:35 +0800 Subject: [PATCH 0553/2039] Update 32-longest-valid-parentheses.js --- 32-longest-valid-parentheses.js | 39 +++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/32-longest-valid-parentheses.js b/32-longest-valid-parentheses.js index d96dceff..cd69003d 100644 --- a/32-longest-valid-parentheses.js +++ b/32-longest-valid-parentheses.js @@ -36,3 +36,42 @@ const longestValidParentheses = function(s) { return longest } + +// another + +/** + * @param {string} s + * @return {number} + */ +const longestValidParentheses = function (s) { + let res = 0, + stk = [], + n = s.length, + idxStk = [] + for (let i = 0; i < n; i++) { + const ch = s[i] + if (stk.length && stk[stk.length - 1] === '(' && ch === ')') + stk.pop(), idxStk.pop() + else stk.push(ch), idxStk.push(i) + res = Math.max(res, i - (idxStk.length ? idxStk[idxStk.length - 1] : -1)) + } + return res +} +/** + * @param {string} s + * @return {number} + */ +const longestValidParentheses = function (s) { + let res = 0, + stk = [], + n = s.length, + idxStk = [] + for (let i = 0; i < n; i++) { + const ch = s[i] + if (stk.length && stk[stk.length - 1] === '(' && ch === ')') + stk.pop(), idxStk.pop() + else stk.push(ch), idxStk.push(i) + res = Math.max(res, i - (idxStk.length ? idxStk[idxStk.length - 1] : -1)) + } + return res +} From 695fae095a6837bcde1088562c12237dba77622f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Jan 2022 10:39:05 +0800 Subject: [PATCH 0554/2039] Update 1685-sum-of-absolute-differences-in-a-sorted-array.js --- ...-sum-of-absolute-differences-in-a-sorted-array.js | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/1685-sum-of-absolute-differences-in-a-sorted-array.js b/1685-sum-of-absolute-differences-in-a-sorted-array.js index 0092062e..c9893c3f 100644 --- a/1685-sum-of-absolute-differences-in-a-sorted-array.js +++ b/1685-sum-of-absolute-differences-in-a-sorted-array.js @@ -4,14 +4,14 @@ */ const getSumAbsoluteDifferences = function(nums) { const res = [], n = nums.length - let first = 0 - for(let i = 1; i < n; i++) { - first += nums[i] - nums[0] + let sum = 0 + for(let first = nums[0], i = 1; i < n; i++) { + sum += nums[i] - first } - res[0] = first + res[0] = sum for(let i = 1; i < n; i++) { - res[i] = res[i - 1] + (nums[i] - nums[i - 1]) * i - (nums[i] - nums[i - 1]) * (n - i) + res[i] = res[i - 1] - (nums[i] - nums[i - 1]) * (n - i - 1) + (nums[i] - nums[i - 1]) * (i - 1) } - + return res }; From 78d3926f464b4313b9e7d5cc18ecf0e227601f7e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 20 Jan 2022 09:29:21 +0800 Subject: [PATCH 0555/2039] Create 2121-intervals-between-identical-elements.js --- 2121-intervals-between-identical-elements.js | 31 ++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2121-intervals-between-identical-elements.js diff --git a/2121-intervals-between-identical-elements.js b/2121-intervals-between-identical-elements.js new file mode 100644 index 00000000..2c99b424 --- /dev/null +++ b/2121-intervals-between-identical-elements.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} arr + * @return {number[]} + */ +const getDistances = function(arr) { + let n = arr.length + const pre = Array(n).fill(0), suf = Array(n).fill(0), res = Array(n).fill(0), mp = {} + + for(let i = 0; i < n; i++) { + if(mp[arr[i]] == null) mp[arr[i]] = [] + mp[arr[i]].push(i) + } + + Object.keys(mp).forEach(k => { + const idxArr = mp[k] + for(let i = 1; i < idxArr.length; i++) { + pre[idxArr[i]] = pre[idxArr[i - 1]] + i * (idxArr[i] - idxArr[i - 1]) + } + }) + + Object.keys(mp).forEach(k => { + const idxArr = mp[k] + for(let i = idxArr.length - 2; i >= 0; i--) { + suf[idxArr[i]] = suf[idxArr[i + 1]] + (idxArr.length - 1 - i) * (idxArr[i + 1] - idxArr[i]) + } + }) + + for(let i = 0; i < n; i++) res[i] = pre[i] + suf[i] + + return res +}; From 13ea9abe32545d3aec1d108cb9a2265ca70378ec Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Jan 2022 09:49:24 +0800 Subject: [PATCH 0556/2039] Create 2007-find-original-array-from-doubled-array.js --- ...-find-original-array-from-doubled-array.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2007-find-original-array-from-doubled-array.js diff --git a/2007-find-original-array-from-doubled-array.js b/2007-find-original-array-from-doubled-array.js new file mode 100644 index 00000000..937249ae --- /dev/null +++ b/2007-find-original-array-from-doubled-array.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} changed + * @return {number[]} + */ + const findOriginalArray = function(changed) { + const n = changed.length, res = [] + if(n % 2 === 1 || n === 0) return res + const hash = {} + for(let e of changed) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + changed.sort((a, b) => a - b) + + for(let i = 0, len = n; i < len; i++) { + const cur = changed[i], dVal = cur * 2 + if (cur === 0 && hash[cur] % 2 === 1) continue + if(hash[dVal] && hash[cur]) { + res.push(cur) + hash[dVal]-- + hash[cur]-- + } + } + return res.length === n / 2 ? res : [] +}; From d66236711b007989e5ba262f16eee1b6354f625b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Jan 2022 10:58:00 +0800 Subject: [PATCH 0557/2039] Update 2007-find-original-array-from-doubled-array.js --- ...-find-original-array-from-doubled-array.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2007-find-original-array-from-doubled-array.js b/2007-find-original-array-from-doubled-array.js index 937249ae..89e270d2 100644 --- a/2007-find-original-array-from-doubled-array.js +++ b/2007-find-original-array-from-doubled-array.js @@ -1,3 +1,31 @@ +/** + * @param {number[]} changed + * @return {number[]} + */ + const findOriginalArray = function(changed) { + const n = changed.length, res = [], { abs } = Math + if(n % 2 === 1 || n === 0) return res + const hash = {} + for(let e of changed) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const keys = Object.keys(hash) + keys.sort((a, b) => abs(a) - abs(b)) + + for(let k of keys) { + if(hash[k] > (hash[k * 2] || 0)) return [] + for(let i = 0; i < hash[k]; i++) { + res.push(k) + hash[2 * k]-- + } + } + + return res +}; + +// another + /** * @param {number[]} changed * @return {number[]} From d8873a6fcb1d1acd7300dd67147e8cd8a22fa63c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 22 Jan 2022 17:32:18 +0800 Subject: [PATCH 0558/2039] Create 2122-recover-the-original-array.js --- 2122-recover-the-original-array.js | 35 ++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2122-recover-the-original-array.js diff --git a/2122-recover-the-original-array.js b/2122-recover-the-original-array.js new file mode 100644 index 00000000..daa3a91e --- /dev/null +++ b/2122-recover-the-original-array.js @@ -0,0 +1,35 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const recoverArray = function(nums) { + const n = nums.length, cnt = calcHash(nums) + nums.sort((a, b) => a - b) + for(let i = 1; i < n; i++) { + const tk = nums[i] - nums[0] + if(tk === 0 || tk % 2 === 1) continue + const [valid, res] = helper(tk) + if(valid) return res + } + + function helper(tk) { + const res = [], hash = Object.assign({}, cnt) + for(let i = 0; i < n; i++) { + const cur = nums[i] + if(hash[cur] === 0) continue + if(hash[cur + tk] === 0 || hash[cur + tk] == null) return [false] + hash[cur]-- + hash[cur + tk]-- + res.push(cur + tk / 2) + } + return [true, res] + } + function calcHash(arr) { + const hash = {} + for(let e of arr) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + return hash + } +}; From ebe45ffd0852a0c5a2ab46046eacf81b8c267db2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jan 2022 12:01:09 +0800 Subject: [PATCH 0559/2039] Create 2148-count-elements-with-strictly-smaller-and-greater-elements.js --- ...with-strictly-smaller-and-greater-elements.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2148-count-elements-with-strictly-smaller-and-greater-elements.js diff --git a/2148-count-elements-with-strictly-smaller-and-greater-elements.js b/2148-count-elements-with-strictly-smaller-and-greater-elements.js new file mode 100644 index 00000000..739a4604 --- /dev/null +++ b/2148-count-elements-with-strictly-smaller-and-greater-elements.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var countElements = function(nums) { + let min = Infinity, max = -Infinity + for(let e of nums) { + if(e > max) max = e + if(e < min) min = e + } + let res = 0 + for(let e of nums) { + if(e > min && e < max) res++ + } + return res +}; From e2d30a3864b16ddd55e0a080c6918efeb5e0136b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jan 2022 12:01:37 +0800 Subject: [PATCH 0560/2039] Create 2149-rearrange-array-elements-by-sign.js --- 2149-rearrange-array-elements-by-sign.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2149-rearrange-array-elements-by-sign.js diff --git a/2149-rearrange-array-elements-by-sign.js b/2149-rearrange-array-elements-by-sign.js new file mode 100644 index 00000000..9f4f1d71 --- /dev/null +++ b/2149-rearrange-array-elements-by-sign.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const rearrangeArray = function(nums) { + const pos = [], neg = [] + for(let e of nums) { + if(e >= 0) pos.push(e) + else neg.push(e) + } + const res = [] + for(let i = 0; i < nums.length; i++) { + if(i % 2 === 0) res.push(pos[~~(i / 2)]) + else res.push(neg[~~(i / 2)]) + } + return res +}; From aaf409b9e218e1a4e409207d1efdefb364590ca8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jan 2022 12:02:03 +0800 Subject: [PATCH 0561/2039] Create 2150-find-all-lonely-numbers-in-the-array.js --- 2150-find-all-lonely-numbers-in-the-array.js | 31 ++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2150-find-all-lonely-numbers-in-the-array.js diff --git a/2150-find-all-lonely-numbers-in-the-array.js b/2150-find-all-lonely-numbers-in-the-array.js new file mode 100644 index 00000000..ee604c44 --- /dev/null +++ b/2150-find-all-lonely-numbers-in-the-array.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var findLonely = function(nums) { + nums.sort((a, b) => a - b) + const cnt = {} + for(let e of nums) { + if(cnt[e] == null) cnt[e] = 0 + cnt[e]++ + } + // console.log(cnt) + const res = [] + for(let i = 0, n = nums.length; i < n; i++) { + if(i === 0){ + if(nums[i + 1] !== nums[i] + 1 && cnt[nums[i]] === 1) { + res.push(nums[i]) + } + } + else if(i === n - 1 ) { + if(nums[i] !== nums[i - 1] + 1 && cnt[nums[i]] === 1) { + res.push(nums[i]) + } + } + else if(cnt[nums[i]] === 1 && nums[i] !== nums[i - 1] + 1 && nums[i] !== nums[i + 1] - 1) { + res.push(nums[i]) + } + } + + return res +}; From aa061d40984de1194a433002411b7527aa546a34 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jan 2022 12:02:48 +0800 Subject: [PATCH 0562/2039] Create 2151-maximum-good-people-based-on-statements.js --- ...maximum-good-people-based-on-statements.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2151-maximum-good-people-based-on-statements.js diff --git a/2151-maximum-good-people-based-on-statements.js b/2151-maximum-good-people-based-on-statements.js new file mode 100644 index 00000000..37bc7de5 --- /dev/null +++ b/2151-maximum-good-people-based-on-statements.js @@ -0,0 +1,40 @@ +/** + * @param {number[][]} statements + * @return {number} + */ +const maximumGood = function (statements) { + const n = statements.length + let res = 0, + c = (1 << n) - 1 + for (let i = 0; i < c + 1; i++) { + let s = dec2bin(i) + s = '0'.repeat(n - s.length) + s + let arr = [], + f = 1 + for (let i = 0; i < n; i++) { + if (s[i] === '1') arr.push(i) + } + for (let i of arr) { + for (let j = 0; j < n; j++) { + if (statements[i][j] !== 2 && statements[i][j] !== +s[j]) { + f = 0 + break + } + } + if (!f) break + } + if (f) res = Math.max(res, cnt(s, '1')) + } + + return res +} +function cnt(s, ch) { + let res = 0 + for (let e of s) { + if (e === ch) res++ + } + return res +} +function dec2bin(dec) { + return (dec >>> 0).toString(2) +} From c36c73d2744b05c9a0c591adcdabca95316bd2ab Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jan 2022 20:14:25 +0800 Subject: [PATCH 0563/2039] Update 1982-find-array-given-subset-sums.js --- 1982-find-array-given-subset-sums.js | 43 ++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1982-find-array-given-subset-sums.js b/1982-find-array-given-subset-sums.js index e9c93661..ca16e18a 100644 --- a/1982-find-array-given-subset-sums.js +++ b/1982-find-array-given-subset-sums.js @@ -89,3 +89,46 @@ function bs(arr, val) { return arr[l] === val } +// another + +/** + * @param {number} n + * @param {number[]} sums + * @return {number[]} + */ +const recoverArray = function(n, sums) { + const res = [] + sums.sort((a, b) => a - b) + + while(res.length < n) { + const m = sums.length, visited = Array(m).fill(false) + let a1 = [], a2 = [], delta = sums[1] - sums[0] + for(let i = 0, j = 1; i < m && j < m; i++, j++) { + while(i < m && visited[i]) i++ + if(i === m) break + while(i >= j || sums[j] !== sums[i] + delta) j++ + if(j === m) break + a1.push(sums[i]) + a2.push(sums[j]) + visited[i] = visited[j] = true + } + if(binarySearch(a1, 0)) { + sums = a1 + res.push(delta) + } else { + sums = a2 + res.push(-delta) + } + } + return res + + function binarySearch(arr, val) { + let l = 0, r = arr.length - 1 + while(l < r) { + const mid = ~~((l + r) / 2) + if(arr[mid] < val) l = mid + 1 + else r = mid + } + return arr[l] === val + } +}; From 590f5ee5d699ee5226e82495d0ae2bda12fda4b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Jan 2022 10:49:53 +0800 Subject: [PATCH 0564/2039] Update 1605-find-valid-matrix-given-row-and-column-sums.js --- ...-valid-matrix-given-row-and-column-sums.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/1605-find-valid-matrix-given-row-and-column-sums.js b/1605-find-valid-matrix-given-row-and-column-sums.js index 2aff69a5..f1ab5894 100644 --- a/1605-find-valid-matrix-given-row-and-column-sums.js +++ b/1605-find-valid-matrix-given-row-and-column-sums.js @@ -15,3 +15,23 @@ const restoreMatrix = function(rowSum, colSum) { } return res; }; + +// another + +/** + * @param {number[]} rowSum + * @param {number[]} colSum + * @return {number[][]} + */ +const restoreMatrix = function(rowSum, colSum) { + const m = rowSum.length, n = colSum.length + const res = Array.from({ length: m }, () => Array(n).fill(0)) + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + res[i][j] = Math.min(rowSum[i], colSum[j]) + rowSum[i] -= res[i][j] + colSum[j] -= res[i][j] + } + } + return res +}; From 6dfca51b4ec766023f9785329a8a0b8f479a145d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Jan 2022 11:40:35 +0800 Subject: [PATCH 0565/2039] Create 1408-string-matching-in-an-array.js --- 1408-string-matching-in-an-array.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1408-string-matching-in-an-array.js diff --git a/1408-string-matching-in-an-array.js b/1408-string-matching-in-an-array.js new file mode 100644 index 00000000..17175b3b --- /dev/null +++ b/1408-string-matching-in-an-array.js @@ -0,0 +1,17 @@ +/** + * @param {string[]} words + * @return {string[]} + */ +const stringMatching = function(words) { + const res = [], n = words.length + for(let i = 0; i < n; i++) { + const cur = words[i] + for(let j = 0; j < n; j++) { + if(i !== j && words[j].indexOf(cur) !== -1) { + res.push(cur); + break + } + } + } + return res +}; From 22336944014c6e259b032cdf83a66e2e93dbabc0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Jan 2022 12:01:55 +0800 Subject: [PATCH 0566/2039] Create 1446-consecutive-characters.js --- 1446-consecutive-characters.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1446-consecutive-characters.js diff --git a/1446-consecutive-characters.js b/1446-consecutive-characters.js new file mode 100644 index 00000000..6ef92188 --- /dev/null +++ b/1446-consecutive-characters.js @@ -0,0 +1,18 @@ +/** + * @param {string} s + * @return {number} + */ +const maxPower = function(s) { + let prev = '', prevIdx = -1, res = -Infinity + for(let i = 0; i < s.length; i++) { + const cur = s[i] + if(cur !== prev) { + res = Math.max(res, i - prevIdx) + prev = cur + prevIdx = i + } else { + if(i === s.length - 1) res = Math.max(res, i - prevIdx + 1) + } + } + return res +}; From db6919b54e1d00cf1ee55a810010a877e0dc3de3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Jan 2022 12:08:07 +0800 Subject: [PATCH 0567/2039] Update 1446-consecutive-characters.js --- 1446-consecutive-characters.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/1446-consecutive-characters.js b/1446-consecutive-characters.js index 6ef92188..a8e49a47 100644 --- a/1446-consecutive-characters.js +++ b/1446-consecutive-characters.js @@ -1,3 +1,21 @@ +/** + * @param {string} s + * @return {number} + */ +const maxPower = function(s) { + let res = 1, cnt = 1 + for(let i = 1; i < s.length; i++) { + if(s[i] === s[i - 1]) { + if(++cnt > res) res = cnt + } else { + cnt = 1 + } + } + return res +}; + +// another + /** * @param {string} s * @return {number} From 6736241e8a3c232181c14e5fef94b5d9496db109 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 Jan 2022 09:26:51 +0800 Subject: [PATCH 0568/2039] Update 588-design-in-memory-file-system.js --- 588-design-in-memory-file-system.js | 74 +++++++++++++++++++++++++++++ 1 file changed, 74 insertions(+) diff --git a/588-design-in-memory-file-system.js b/588-design-in-memory-file-system.js index 61695f2c..e23ea7dd 100644 --- a/588-design-in-memory-file-system.js +++ b/588-design-in-memory-file-system.js @@ -73,3 +73,77 @@ FileSystem.prototype.readContentFromFile = function (filePath) { * obj.addContentToFile(filePath,content) * var param_4 = obj.readContentFromFile(filePath) */ + +// another + +const FileSystem = function () { + this.root = new Node() +} + +/** + * @param {string} path + * @return {string[]} + */ +FileSystem.prototype.ls = function (path) { + const cur = this.find(path) + if(cur.content) { + const arr = path.split('/') + return [arr[arr.length - 1]] + } + return Object.keys(cur.children).sort() +} + +/** + * @param {string} path + * @return {void} + */ +FileSystem.prototype.mkdir = function (path) { + this.find(path) +} + +/** + * @param {string} filePath + * @param {string} content + * @return {void} + */ +FileSystem.prototype.addContentToFile = function (filePath, content) { + const cur = this.find(filePath) + cur.content += content +} + +/** + * @param {string} filePath + * @return {string} + */ +FileSystem.prototype.readContentFromFile = function (filePath) { + const cur = this.find(filePath) + return cur.content +} + +FileSystem.prototype.find = function (filePath) { + if(filePath.length === 1) return this.root + const arr = filePath.split('/').slice(1) + let cur = this.root + for(let e of arr) { + if (cur.children[e] == null) cur.children[e] = new Node() + cur = cur.children[e] + } + return cur +} + +/** + * Your FileSystem object will be instantiated and called as such: + * var obj = new FileSystem() + * var param_1 = obj.ls(path) + * obj.mkdir(path) + * obj.addContentToFile(filePath,content) + * var param_4 = obj.readContentFromFile(filePath) + */ + +class Node { + constructor() { + this.children = {} + this.content = '' + } +} + From 28ecad193e9488dfb22cc5bf5b3a3d5f6988b52f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Jan 2022 13:38:53 +0800 Subject: [PATCH 0569/2039] Update 1857-largest-color-value-in-a-directed-graph.js --- ...largest-color-value-in-a-directed-graph.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/1857-largest-color-value-in-a-directed-graph.js b/1857-largest-color-value-in-a-directed-graph.js index be5c8ba3..3432baae 100644 --- a/1857-largest-color-value-in-a-directed-graph.js +++ b/1857-largest-color-value-in-a-directed-graph.js @@ -1,3 +1,47 @@ +/** + * @param {string} colors + * @param {number[][]} edges + * @return {number} + */ + const largestPathValue = function(colors, edges) { + const graph = {}, n = colors.length, a = 'a'.charCodeAt(0) + const indegree = Array(n).fill(0) + for (const [from, to] of edges) { + if (graph[from] == null) graph[from] = [] + graph[from].push(to) + indegree[to]++ + } + const cnt = Array.from({ length: n }, () => Array(26).fill(0)) + const code = idx => colors.charCodeAt(idx) - a + const q = [] + for (let i = 0; i < n; i++) { + if(indegree[i] === 0) { + q.push(i) + cnt[i][code(i)] = 1 + } + } + let res = 0, seen = 0 + + while(q.length) { + const u = q.pop() + const val = cnt[u][code(u)] + res = Math.max(res, val) + seen++ + for(const next of (graph[u] || [])) { + for(let i = 0; i < 26; i++) { + cnt[next][i] = Math.max(cnt[next][i], cnt[u][i] + (i === code(next) ? 1 : 0)) + } + if(--indegree[next] === 0) { + q.push(next) + } + } + } + return seen < n ? -1 : res +}; + +// another + + /** * @param {string} colors * @param {number[][]} edges From b3694be4df7fd5e2e3cdd768b3eaa558149f9ebc Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Jan 2022 11:43:53 +0800 Subject: [PATCH 0570/2039] Update 802-find-eventual-safe-states.js --- 802-find-eventual-safe-states.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/802-find-eventual-safe-states.js b/802-find-eventual-safe-states.js index 44a5d8b4..d55d224e 100644 --- a/802-find-eventual-safe-states.js +++ b/802-find-eventual-safe-states.js @@ -24,3 +24,30 @@ function dfs(graph, node, memo, visited) { memo[node] = hasCycle return hasCycle } + +// another + +/** + * @param {number[][]} graph + * @return {number[]} + */ +const eventualSafeNodes = function(graph) { + const res = [] + if(graph == null || graph.length === 0) return res + const n = graph.length + const color = Array(n).fill(0) + for(let i = 0; i < n; i++) { + if(bt(graph, i, color)) res.push(i) + } + return res + + function bt(graph, start, color) { + if(color[start] !== 0) return color[start] === 1 + color[start] = 2 + for(let next of graph[start]) { + if(!bt(graph, next, color)) return false + } + color[start] = 1 + return true + } +}; From bd640742bf759bb97aee13d73652c5cdb7ec6488 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 28 Jan 2022 22:05:26 +0800 Subject: [PATCH 0571/2039] Update 1591-strange-printer-ii.js --- 1591-strange-printer-ii.js | 76 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 76 insertions(+) diff --git a/1591-strange-printer-ii.js b/1591-strange-printer-ii.js index 5e9be1d4..4dd5b521 100644 --- a/1591-strange-printer-ii.js +++ b/1591-strange-printer-ii.js @@ -49,3 +49,79 @@ const isPrintable = function (targetGrid) { return true } } + +// another + +/** + * @param {number[][]} targetGrid + * @return {boolean} + */ +const isPrintable = function (targetGrid) { + /* + 1 -> 3 + 1 -> 4 + 1 -> 5 + 3 -> 4 + */ + + const dependencies = {} + + /* + 3: [mini, maxi, minj, maxj] + */ + const extents = {} + + for (let i = 0; i < targetGrid.length; i++) { + for (let j = 0; j < targetGrid[i].length; j++) { + const n = targetGrid[i][j] + let inf = Infinity + extents[n] = extents[n] || { + n, + mini: inf, + minj: inf, + maxi: -inf, + maxj: -inf, + } + extents[n].mini = Math.min(i, extents[n].mini) + extents[n].minj = Math.min(j, extents[n].minj) + extents[n].maxi = Math.max(i, extents[n].maxi) + extents[n].maxj = Math.max(j, extents[n].maxj) + } + } + + function canRemove(obj) { + for (let i = obj.mini; i <= obj.maxi; i++) { + for (let j = obj.minj; j <= obj.maxj; j++) { + const val = targetGrid[i][j] + if (val !== null && val !== obj.n) return false + } + } + return true + } + + function remove(obj) { + for (let i = obj.mini; i <= obj.maxi; i++) { + for (let j = obj.minj; j <= obj.maxj; j++) { + targetGrid[i][j] = null + } + } + delete extents[obj.n] + } + + while (Object.keys(extents).length > 0) { + let found = false + for (const n in extents) { + const obj = extents[n] + if (canRemove(obj)) { + remove(obj) + found = true + break + } + } + if (!found) { + return false + } + } + return true +} + From a102910ac50ccaa8cbcfb473f01742ef299fbdcc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 29 Jan 2022 10:59:54 +0800 Subject: [PATCH 0572/2039] Update 310-minimum-height-trees.js --- 310-minimum-height-trees.js | 38 +++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/310-minimum-height-trees.js b/310-minimum-height-trees.js index 98e754ee..2a49c6ff 100644 --- a/310-minimum-height-trees.js +++ b/310-minimum-height-trees.js @@ -1,3 +1,41 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ + const findMinHeightTrees = function(n, edges) { + if(n === 1) return [0] + const res = [], graph = {} + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = new Set() + if(graph[v] == null) graph[v] = new Set() + graph[u].add(v) + graph[v].add(u) + } + + let leaves = [] + Object.keys(graph).forEach(k => { + if(graph[k].size === 1) leaves.push(+k) + }) + while(n > 2) { + const newLeaves = [] + const size = leaves.length + for (let i = 0; i < size; i++) { + const cur = leaves.pop() + for (const next of graph[cur]) { + graph[next].delete(cur) + if(graph[next].size === 1) newLeaves.push(next) + } + } + n -= size + leaves = newLeaves + } + + return leaves +}; + +// another + /** * @param {number} n * @param {number[][]} edges From 66a8fa90369a3728b4b86eed2d91a3c237d9debb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jan 2022 12:16:20 +0800 Subject: [PATCH 0573/2039] Create 2154-keep-multiplying-found-values-by-two.js --- 2154-keep-multiplying-found-values-by-two.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2154-keep-multiplying-found-values-by-two.js diff --git a/2154-keep-multiplying-found-values-by-two.js b/2154-keep-multiplying-found-values-by-two.js new file mode 100644 index 00000000..398ea7f1 --- /dev/null +++ b/2154-keep-multiplying-found-values-by-two.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @param {number} original + * @return {number} + */ +var findFinalValue = function(nums, original) { + let res = original + while(nums.indexOf(res) !== -1) { + // const idx = nums.indexOf(res) + res *= 2 + } + return res +}; From b463e80958f3d84de07536dcfd580f92913548b7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jan 2022 12:16:50 +0800 Subject: [PATCH 0574/2039] Create 2155-all-divisions-with-the-highest-score-of-a-binary-array.js --- ...ith-the-highest-score-of-a-binary-array.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2155-all-divisions-with-the-highest-score-of-a-binary-array.js diff --git a/2155-all-divisions-with-the-highest-score-of-a-binary-array.js b/2155-all-divisions-with-the-highest-score-of-a-binary-array.js new file mode 100644 index 00000000..adf57c4a --- /dev/null +++ b/2155-all-divisions-with-the-highest-score-of-a-binary-array.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var maxScoreIndices = function(nums) { + const n = nums.length + // if(n === 1) return [0] + const leftZero = Array(n).fill(0), rightOne = Array(n).fill(0) + for (let i = 0, sum = 0; i < n; i++) { + if(nums[i] === 0) sum++ + leftZero[i] = sum + } + for (let i = n - 1, sum = 0; i >= 0; i--) { + if(nums[i] === 1) sum++ + rightOne[i] = sum + } + let hash = {} + for (let i = 0, sum = 0; i <= n; i++) { + + hash[i] = (i === 0 ? 0 : leftZero[i - 1]) + (i === n ? 0 : rightOne[i]) + } + const max = Math.max(...Object.values(hash)) + const res = [] + Object.keys(hash).forEach(k => { + if(hash[k] === max) res.push(+k) + }) + return res +}; From d238c5b7bd44c752040d30c2638817dca1309767 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jan 2022 12:33:27 +0800 Subject: [PATCH 0575/2039] Create 2156-find-substring-with-given-hash-value.js --- 2156-find-substring-with-given-hash-value.js | 30 ++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2156-find-substring-with-given-hash-value.js diff --git a/2156-find-substring-with-given-hash-value.js b/2156-find-substring-with-given-hash-value.js new file mode 100644 index 00000000..0549a3b3 --- /dev/null +++ b/2156-find-substring-with-given-hash-value.js @@ -0,0 +1,30 @@ +/** + * @param {string} s + * @param {number} power + * @param {number} modulo + * @param {number} k + * @param {number} hashValue + * @return {string} + */ +var subStrHash = function (s, power, modulo, k, hashValue) { + let n = s.length; + const p_pow = Array(n + 1); + p_pow[0] = 1n; + power = BigInt(power); + let m = BigInt(modulo); + for (let i = 1; i < p_pow.length; i++) p_pow[i] = (p_pow[i - 1] * power) % m; + + const val = (ch) => BigInt(ch.charCodeAt(0) - "a".charCodeAt(0)); + const h = Array(n + 1).fill(0n); + for (let i = n - 1; i >= 0; i--) + h[i] = (h[i + 1] * power + val(s[i]) + 1n) % m; + + for (let i = 0; i + k - 1 < n; i++) { + let cur_h = (h[i] - h[i + k] * p_pow[k]) % m; + let temp = (cur_h + m) % m; + if (temp == hashValue) { + return s.substr(i, k); + } + } + return ""; +}; From be895f6d84227fb4e7e90bfb1083250b6c0bc983 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Feb 2022 23:47:09 +0800 Subject: [PATCH 0576/2039] Update and rename 5979-earliest-possible-day-of-full-bloom.js to 2136-earliest-possible-day-of-full-bloom.js --- 2136-earliest-possible-day-of-full-bloom.js | 36 +++++++++++++++++++++ 5979-earliest-possible-day-of-full-bloom.js | 36 --------------------- 2 files changed, 36 insertions(+), 36 deletions(-) create mode 100644 2136-earliest-possible-day-of-full-bloom.js delete mode 100644 5979-earliest-possible-day-of-full-bloom.js diff --git a/2136-earliest-possible-day-of-full-bloom.js b/2136-earliest-possible-day-of-full-bloom.js new file mode 100644 index 00000000..8e118f06 --- /dev/null +++ b/2136-earliest-possible-day-of-full-bloom.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} plantTime + * @param {number[]} growTime + * @return {number} + */ +const earliestFullBloom = function(plantTime, growTime) { + const sum = arr => arr.reduce((ac, e) => ac +e, 0) + let l = 0, r = sum(plantTime) + sum(growTime) + const n = plantTime.length + + const a = [] + for(let i = 0; i < n; i++) { + a.push([growTime[i], plantTime[i] ]) + } + + a.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + a.reverse() + function chk(d) { + let total = -1 + let max_num = 0 + for(let i = 0; i < n; i++) { + total += a[i][1] + max_num = Math.max(max_num, total + a[i][0] + 1) + } + return max_num <= d + } + + while (l < r) { + let m = ~~((l + r) / 2) + if (chk(m)) r = m + else l = m + 1 + } + + return l +}; + diff --git a/5979-earliest-possible-day-of-full-bloom.js b/5979-earliest-possible-day-of-full-bloom.js deleted file mode 100644 index 54a811b2..00000000 --- a/5979-earliest-possible-day-of-full-bloom.js +++ /dev/null @@ -1,36 +0,0 @@ -/** - * @param {number[]} plantTime - * @param {number[]} growTime - * @return {number} - */ -var earliestFullBloom = function(plantTime, growTime) { - const sum = arr => arr.reduce((ac, e) => ac +e, 0) - let l = 0, r = sum(plantTime) + sum(growTime) - let n = plantTime.length - - let a = [] - for(let i = 0; i < n; i++) { - a.push([growTime[i], plantTime[i] ]) - } - - a.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) - a.reverse() - function chk(d) { - let total = -1 - let max_num = 0 - for(let i = 0; i < n; i++) { - total += a[i][1] - max_num = Math.max(max_num, total + a[i][0] + 1) - } - return max_num <= d - } - - while (l < r) { - let m = ~~((l + r) / 2) - if (chk(m)) r = m - else l = m + 1 - } - - return l -}; - From 1f8cc21be613193c5822dbfb52c2085de861c4da Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 2 Feb 2022 00:19:38 +0800 Subject: [PATCH 0577/2039] Update 2136-earliest-possible-day-of-full-bloom.js --- 2136-earliest-possible-day-of-full-bloom.js | 25 +++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2136-earliest-possible-day-of-full-bloom.js b/2136-earliest-possible-day-of-full-bloom.js index 8e118f06..6a736966 100644 --- a/2136-earliest-possible-day-of-full-bloom.js +++ b/2136-earliest-possible-day-of-full-bloom.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} plantTime + * @param {number[]} growTime + * @return {number} + */ +const earliestFullBloom = function(plantTime, growTime) { + const n = plantTime.length, arr = Array(n) + for(let i = 0; i < n; i++) { + arr.push([growTime[i], plantTime[i]]) + } + arr.sort((a, b) => b[0] - a[0]) + + let res = 0, cur = 0 + for(let i = 0; i < n; i++) { + const e = arr[i] + res = Math.max(res, cur + e[0] + e[1]) + cur += e[1] + } + + return res +}; + +// another + + /** * @param {number[]} plantTime * @param {number[]} growTime From 64d812d1ea884363f57abcd6b1aed2ebe95d7c43 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 3 Feb 2022 00:57:50 +0800 Subject: [PATCH 0578/2039] Update 630-course-schedule-iii.js --- 630-course-schedule-iii.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/630-course-schedule-iii.js b/630-course-schedule-iii.js index 824fca51..f9558beb 100644 --- a/630-course-schedule-iii.js +++ b/630-course-schedule-iii.js @@ -1,3 +1,26 @@ +/** + * @param {number[][]} courses + * @return {number} + */ +const scheduleCourse = function (courses) { + const queue = new MaxPriorityQueue({ + priority: e => e[0] + }) + courses.sort((a, b) => a[1] - b[1]) + let time = 0 + for(let e of courses) { + time += e[0] + queue.enqueue(e) + if(time > e[1]) { + const tmp = queue.dequeue().element + time -= tmp[0] + } + } + return queue.size() +} + +// another + /** * @param {number[][]} courses * @return {number} From 77fabe3411e75aec15fe424b27e666e39240abe5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 4 Feb 2022 11:02:25 +0800 Subject: [PATCH 0579/2039] Create 2132-stamping-the-grid.js --- 2132-stamping-the-grid.js | 59 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 2132-stamping-the-grid.js diff --git a/2132-stamping-the-grid.js b/2132-stamping-the-grid.js new file mode 100644 index 00000000..e3e936e4 --- /dev/null +++ b/2132-stamping-the-grid.js @@ -0,0 +1,59 @@ +/** + * @param {number[][]} grid + * @param {number} stampHeight + * @param {number} stampWidth + * @return {boolean} + */ +var possibleToStamp = function(grid, stampHeight, stampWidth) { + let d = []; + let a = grid; + let h = grid.length; + let w = grid[0].length; + for (let i = 0; i <= h; i++) { + d[i] = new Array(w + 1).fill(0); + } + //d - height of empty cells below + for (let i = h - 1; i >= 0; i--) { + for (let j = 0; j < w; j++) { + if (a[i][j] === 0) d[i][j] = d[i + 1][j] + 1; + } + } + //find stamps, and start to fill matrix + for (let i = 0; i < h; i++) { + let columns = 0; //width of consecutive empty columns with height>=stampHeight + for (let j = 0; j <= w; j++) { + if (d[i][j] >= stampHeight) { //column can be part of stamp + columns++; + if (columns >= stampWidth) { + //fill first row + if (columns === stampWidth) { + //fill previous columns + for (let l = j - stampWidth + 1; l <= j; l++) { + a[i][l] = stampHeight + } + } else { + a[i][j] = stampHeight; + } + } + } else { + columns = 0; + } + } + //fill cells below + for (let l = 0; l < w; l++) { + if (a[i][l] > 1) { + a[i + 1][l] = a[i][l] - 1; + } + } + } + + //check if all cells covered + let ans = true; + for (let i = 0; i < h; i++) { + for (let j = 0; j < w; j++) { + if (a[i][j] === 0) ans = false; + } + } + + return ans; +}; From 07d3cf9cd9b39c9b35cfd1f939526cd026d8e27b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 4 Feb 2022 19:09:05 +0800 Subject: [PATCH 0580/2039] Update 304-range-sum-query-2d-immutable.js --- 304-range-sum-query-2d-immutable.js | 34 +++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/304-range-sum-query-2d-immutable.js b/304-range-sum-query-2d-immutable.js index 9613134f..8333a777 100644 --- a/304-range-sum-query-2d-immutable.js +++ b/304-range-sum-query-2d-immutable.js @@ -40,3 +40,37 @@ NumMatrix.prototype.sumRegion = function(row1, col1, row2, col2) { * var obj = Object.create(NumMatrix).createNew(matrix) * var param_1 = obj.sumRegion(row1,col1,row2,col2) */ + +// another + +/** + * @param {number[][]} matrix + */ +const NumMatrix = function(matrix) { + const m = matrix.length, n = matrix[0].length + const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0)) + for(let i = 1; i <= m; i++) { + for(let j = 1; j <= n; j++) { + dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + matrix[i - 1][j - 1] + } + } + this.dp = dp +}; + +/** + * @param {number} row1 + * @param {number} col1 + * @param {number} row2 + * @param {number} col2 + * @return {number} + */ +NumMatrix.prototype.sumRegion = function(row1, col1, row2, col2) { + const dp = this.dp + return dp[row2 + 1][col2 + 1] - dp[row2 + 1][col1] - dp[row1][col2 + 1] + dp[row1][col1] +}; + +/** + * Your NumMatrix object will be instantiated and called as such: + * var obj = new NumMatrix(matrix) + * var param_1 = obj.sumRegion(row1,col1,row2,col2) + */ From eea1d9650bdc4a51ddda4a080e03d125d4eb6a7a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Feb 2022 12:12:40 +0800 Subject: [PATCH 0581/2039] Create 2164-sort-even-and-odd-indices-independently.js --- ...sort-even-and-odd-indices-independently.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2164-sort-even-and-odd-indices-independently.js diff --git a/2164-sort-even-and-odd-indices-independently.js b/2164-sort-even-and-odd-indices-independently.js new file mode 100644 index 00000000..b57971c9 --- /dev/null +++ b/2164-sort-even-and-odd-indices-independently.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var sortEvenOdd = function(nums) { + let nums_size = nums.length; + for (let i = 0; i < nums_size - 2; i++) { + for (let j = i + 2; j < nums_size; j += 2) { + if (i % 2 == 1) { + if (nums[i] < nums[j]) { + let temp = nums[i]; + nums[i] = nums[j]; + nums[j] = temp; + } + } else { + if (nums[i] > nums[j]) { + let temp = nums[i]; + nums[i] = nums[j]; + nums[j] = temp; + } + } + } + } + return nums; +}; From 5167c0496adb7e664d4ea779a8ea9c0421f893fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Feb 2022 12:13:47 +0800 Subject: [PATCH 0582/2039] Create 2165-smallest-value-of-the-rearranged-number.js --- ...smallest-value-of-the-rearranged-number.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2165-smallest-value-of-the-rearranged-number.js diff --git a/2165-smallest-value-of-the-rearranged-number.js b/2165-smallest-value-of-the-rearranged-number.js new file mode 100644 index 00000000..7be3004b --- /dev/null +++ b/2165-smallest-value-of-the-rearranged-number.js @@ -0,0 +1,20 @@ +/** + * @param {number} num + * @return {number} + */ +var smallestNumber = function(num) { + const minus = num < 0 + const nums = Math.abs(num) + .toString() + .split('') + .map(_ => parseInt(_)) + .sort((a, b) => minus ? b-a : a-b); + if(!minus && nums[0] === 0) { + let i = 0 + while(nums[i] === 0 && i < nums.length-1) i++ + nums[0] = nums[i] + nums[i] = 0 + } + const answer = parseInt(nums.map(_ => _.toString()).join('')) + return minus ? -answer : answer +}; From 2e18e1e8f6e9504a2bb9d2c8a2027e0020a85a49 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Feb 2022 12:14:23 +0800 Subject: [PATCH 0583/2039] Create 2166-design-bitset.js --- 2166-design-bitset.js | 88 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 88 insertions(+) create mode 100644 2166-design-bitset.js diff --git a/2166-design-bitset.js b/2166-design-bitset.js new file mode 100644 index 00000000..d38a595a --- /dev/null +++ b/2166-design-bitset.js @@ -0,0 +1,88 @@ +/** + * @param {number} size + */ +var Bitset = function(size) { + this.s = Array.from({ length:2 }, () => Array()) + this.cnt = 0 + this.now = 0 + for (let i = 0; i < size; i++) { + this.s[this.now].push( '0'); + this.s[this.now ^ 1].push( '1'); + } +}; + +/** + * @param {number} idx + * @return {void} + */ +Bitset.prototype.fix = function(idx) { + if (this.s[this.now][idx] == '1') return; + // swap(this.s[this.now][idx], this.s[this.now ^ 1][idx]); + const tmp = this.s[this.now][idx] + this.s[this.now][idx] = this.s[this.now ^ 1][idx] + this.s[this.now ^ 1][idx] = tmp + this.cnt++; +}; + +/** + * @param {number} idx + * @return {void} + */ +Bitset.prototype.unfix = function(idx) { + if (this.s[this.now][idx] == '0') return; + // swap(this.s[this.now][idx], this.s[this.now ^ 1][idx]); + const tmp = this.s[this.now][idx] + this.s[this.now][idx] = this.s[this.now ^ 1][idx] + this.s[this.now ^ 1][idx] = tmp + this.cnt--; +}; + +/** + * @return {void} + */ +Bitset.prototype.flip = function() { + this.now = this.now ^ 1; + this.cnt = this.s[0].length - this.cnt; +}; + +/** + * @return {boolean} + */ +Bitset.prototype.all = function() { + return this.cnt == this.s[0].length; +}; + +/** + * @return {boolean} + */ +Bitset.prototype.one = function() { + return this.cnt !== 0 +}; + +/** + * @return {number} + */ +Bitset.prototype.count = function() { + return this.cnt; +}; + +/** + * @return {string} + */ +Bitset.prototype.toString = function() { + return this.s[this.now].join(''); +}; + + +/** + * Your Bitset object will be instantiated and called as such: + * var obj = new Bitset(size) + * obj.fix(idx) + * obj.unfix(idx) + * obj.flip() + * var param_4 = obj.all() + * var param_5 = obj.one() + * var param_6 = obj.count() + * var param_7 = obj.toString() + */ + From e92e805eb3cb857d6a04626052be0b4f55958c4d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Feb 2022 12:14:50 +0800 Subject: [PATCH 0584/2039] Create 2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js --- ...emove-all-cars-containing-illegal-goods.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js diff --git a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js new file mode 100644 index 00000000..db4e36c1 --- /dev/null +++ b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js @@ -0,0 +1,47 @@ +/** + * @param {string} s + * @return {number} + */ +var minimumTime = function(s) { + + const { max, min } = Math + + let n = s.length; + const l = Array.from({ length: n + 1 }, () => Array(2).fill(0)) + const r = Array.from({ length: n + 1 }, () => Array(2).fill(0)) + for (let i = 0; i < n; i++) l[i][0] = l[i][1] = r[i][0] = r[i][1] = 0; + if (s[0] == '1') { + l[0][0] = 1; + l[0][1] = 2; + } + for (let i = 1; i < n; i++) { + if (s[i] == '0') { + l[i][0] = l[i - 1][0]; + l[i][1] = l[i - 1][1]; + } else { + l[i][0] = i + 1; + l[i][1] = min(l[i - 1][0], l[i - 1][1]) + 2; + } + } + if (s[n - 1] == '1') { + r[n - 1][0] = 1; + r[n - 1][1] = 2; + } + for (let i = n - 2; i >= 0; i--) { + if (s[i] == '0') { + r[i][0] = r[i + 1][0]; + r[i][1] = r[i + 1][1]; + } else { + r[i][0] = n - i; + r[i][1] = min(r[i + 1][0], r[i + 1][1]) + 2; + } + } + let ans = n; + for (let i = -1; i < n; i++) { + let cost = 0; + if (i != -1) cost += min(l[i][0], l[i][1]); + if (i != n - 1) cost += min(r[i + 1][0], r[i + 1][1]); + ans = min(ans, cost); + } + return ans; +}; From 7745e06383b352bee689a8caebd4986f8e4d9757 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Feb 2022 09:04:01 +0800 Subject: [PATCH 0585/2039] Update 2140-solving-questions-with-brainpower.js --- 2140-solving-questions-with-brainpower.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/2140-solving-questions-with-brainpower.js b/2140-solving-questions-with-brainpower.js index c971f87e..646ba1d2 100644 --- a/2140-solving-questions-with-brainpower.js +++ b/2140-solving-questions-with-brainpower.js @@ -1,3 +1,18 @@ +/** + * @param {number[][]} questions + * @return {number} + */ +const mostPoints = function(questions) { + const n = questions.length, dp = Array(n + 1).fill(0) + for (let i = n - 1; i >= 0; i--) { + const [gain, p] = questions[i] + dp[i] = Math.max(dp[i + 1], (dp[p + i + 1] || 0) + gain) + } + return dp[0] +}; + +// another + /** * @param {number[][]} questions * @return {number} From c413b748afe2243999c793f7615417401486a0bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Feb 2022 13:51:18 +0800 Subject: [PATCH 0586/2039] Update 1774-closest-dessert-cost.js --- 1774-closest-dessert-cost.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1774-closest-dessert-cost.js b/1774-closest-dessert-cost.js index a274115a..6d918079 100644 --- a/1774-closest-dessert-cost.js +++ b/1774-closest-dessert-cost.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} baseCosts + * @param {number[]} toppingCosts + * @param {number} target + * @return {number} + */ +const closestCost = function(baseCosts, toppingCosts, target) { + let res = baseCosts[0], n = baseCosts.length, m = toppingCosts.length + const { abs } = Math + for (let i = 0; i < n; i++) { + helper(0, baseCosts[i]) + } + return res + function helper(i, cur) { + if( + abs(cur - target) < abs(res - target) + || (abs(cur - target) === abs(res - target) && cur < res) + ) { + res = cur + } + if(i === m || cur > target) return + helper(i + 1, cur) + helper(i + 1, cur + toppingCosts[i]) + helper(i + 1, cur + toppingCosts[i] * 2) + } +}; + +// another + + /** * @param {number[]} baseCosts * @param {number[]} toppingCosts From d017657646953557e97b0444493780db7f527941 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 9 Feb 2022 10:17:57 +0800 Subject: [PATCH 0587/2039] Update 1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.js --- ...to-convert-binary-matrix-to-zero-matrix.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.js b/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.js index 52f950e6..a79ab5e6 100644 --- a/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.js +++ b/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.js @@ -1,3 +1,47 @@ +/** + * @param {number[][]} mat + * @return {number} + */ +const minFlips = function (mat) { + let start = 0 + const m = mat.length, n = mat[0].length + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + start |= mat[i][j] << (i * n + j) + } + } + let q = [start] + const seen = new Set(), dirs = [[-1, 0], [1, 0], [0, -1], [0, 1], [0, 0]] + + for(let i = 0; q.length; i++) { + const tmp = [] + for (let size = q.length; size > 0; size--) { + const cur = q.pop() + if(cur === 0) return i + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + let next = cur + for(const [dx, dy] of dirs) { + const r = i + dx, c = j + dy + if(r >= 0 && r < m && c >= 0 && c < n) { + next ^= (1 << (r * n + c)) + } + } + if (!seen.has(next)) { + seen.add(next) + tmp.push(next) + } + } + } + } + q = tmp + } + + return -1 +} + +// another + /** * @param {number[][]} mat * @return {number} From b47b14dcb783f06a12f17a7a394f1b09ddf942d9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Feb 2022 10:18:42 +0800 Subject: [PATCH 0588/2039] Create 1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js --- ...mpanies-is-not-a-subset-of-another-list.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js diff --git a/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js b/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js new file mode 100644 index 00000000..74cce6bb --- /dev/null +++ b/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js @@ -0,0 +1,38 @@ + +/** + * @param {string[][]} favoriteCompanies + * @return {number[]} + */ +const peopleIndexes = function(favoriteCompanies) { + const fcs = [] + for(const fc of favoriteCompanies) fcs.push(new Set(fc)) + const n = fcs.length, uf = new Array(n).fill(0) + for(let i = 0; i < n; i++) uf[i] = i + for(let i = 0; i < n; i++) { + for(let j = i + 1; j < n; j++) { + const a = find(uf, i), b = find(uf, j) + if(a === b) continue + else if(contains(fcs[a], fcs[b])) uf[b] = a + else if(contains(fcs[b], fcs[a])) uf[a] = b + } + } + const set = new Set() + for(const i of uf) set.add(find(uf, i)) + return Array.from(set).sort((a, b) => a - b) + + function contains(a, b) { + if(a.size < b.size) return false + for(let e of b) { + if(!a.has(e)) return false + } + return true + } + + function find(uf, e) { + while(uf[e] !== e) { + uf[e] = uf[uf[e]] + e = uf[e] + } + return e + } +}; From 6dcb918f22258d822a1b5bc2d1ac9f9be9a0850e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Feb 2022 17:19:57 +0800 Subject: [PATCH 0589/2039] Update 1601-maximum-number-of-achievable-transfer-requests.js --- ...-number-of-achievable-transfer-requests.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/1601-maximum-number-of-achievable-transfer-requests.js b/1601-maximum-number-of-achievable-transfer-requests.js index 969324af..b99d414f 100644 --- a/1601-maximum-number-of-achievable-transfer-requests.js +++ b/1601-maximum-number-of-achievable-transfer-requests.js @@ -1,3 +1,37 @@ +// O(n * 2 ^ r) +// r: number of requests +/** + * @param {number} n + * @param {number[][]} requests + * @return {number} + */ +const maximumRequests = function(n, requests) { + const arr = Array(n).fill(0) + let res = 0 + bt(requests, 0, arr, 0) + return res + function bt(r, idx, arr, num) { + if(idx === r.length) { + for(let i = 0; i < n; i++) { + if(arr[i] !== 0) return + } + res = Math.max(res, num) + return + } + const [from, to] = r[idx] + arr[from]++ + arr[to]-- + bt(r, idx + 1, arr, num + 1) + arr[from]-- + arr[to]++ + + bt(r, idx + 1, arr, num) + } +}; + + +// another + /** * @param {number} n * @param {number[][]} requests From 24fe085fd832bfad05927329cf01499ed76ddcab Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Feb 2022 20:32:59 +0800 Subject: [PATCH 0590/2039] Create 2169-count-operations-to-obtain-zero.js --- 2169-count-operations-to-obtain-zero.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2169-count-operations-to-obtain-zero.js diff --git a/2169-count-operations-to-obtain-zero.js b/2169-count-operations-to-obtain-zero.js new file mode 100644 index 00000000..5d4a260d --- /dev/null +++ b/2169-count-operations-to-obtain-zero.js @@ -0,0 +1,14 @@ +/** + * @param {number} num1 + * @param {number} num2 + * @return {number} + */ +var countOperations = function(num1, num2) { + let res = 0 + while(num1 !== 0 && num2 !== 0) { + if(num1 >= num2) num1 -= num2 + else num2 -= num1 + res++ + } + return res +}; From 9c461a96a8f5351cddc545cf0e2731dfd2703131 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 15 Feb 2022 20:24:08 +0800 Subject: [PATCH 0591/2039] Update 1879-minimum-xor-sum-of-two-arrays.js --- 1879-minimum-xor-sum-of-two-arrays.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1879-minimum-xor-sum-of-two-arrays.js b/1879-minimum-xor-sum-of-two-arrays.js index d85100e7..0225d947 100644 --- a/1879-minimum-xor-sum-of-two-arrays.js +++ b/1879-minimum-xor-sum-of-two-arrays.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const minimumXORSum = function (nums1, nums2) { + const n = nums1.length, dp = Array(1 << n).fill(Infinity) + return dfs(0, 0) + function dfs(i, mask) { + if(i === n) return 0 + if(dp[mask] !== Infinity) return dp[mask] + for(let j = 0; j < n; j++) { + if((mask & (1 << j)) === 0) { + dp[mask] = Math.min( + dp[mask], + (nums1[i] ^ nums2[j]) + dfs(i + 1, mask | (1 << j)) + ) + } + } + return dp[mask] + } +} + +// another + /** * @param {number[]} nums1 * @param {number[]} nums2 From 0436dd21684e3b77ba0ce01e16cee9e2f84b9e9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Feb 2022 20:51:36 +0800 Subject: [PATCH 0592/2039] Update 1947-maximum-compatibility-score-sum.js --- 1947-maximum-compatibility-score-sum.js | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/1947-maximum-compatibility-score-sum.js b/1947-maximum-compatibility-score-sum.js index 893623e4..e6148d33 100644 --- a/1947-maximum-compatibility-score-sum.js +++ b/1947-maximum-compatibility-score-sum.js @@ -40,9 +40,8 @@ const maxCompatibilitySum = function(students, mentors) { */ const maxCompatibilitySum = function(students, mentors) { const obj = { res: 0 }, hash = {} - for(let i = 0, n = students.length; i < n; i++) { - bt(students, mentors, 0, 0, obj, hash) - } + bt(students, mentors, 0, 0, obj, hash) + return obj.res }; @@ -51,7 +50,6 @@ function bt(stu, men, i, score, obj, hash) { if(i === stu.length) { if(score > obj.res) { obj.res = score - // console.log(hash) } return } From 5f4f96a80545681de3d56f0c674f66931383c714 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Feb 2022 14:04:55 +0800 Subject: [PATCH 0593/2039] Update 1066-campus-bikes-ii.js --- 1066-campus-bikes-ii.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1066-campus-bikes-ii.js b/1066-campus-bikes-ii.js index d3d96ed1..0f1f9b3a 100644 --- a/1066-campus-bikes-ii.js +++ b/1066-campus-bikes-ii.js @@ -1,3 +1,34 @@ +/** + * @param {number[][]} workers + * @param {number[][]} bikes + * @return {number} + */ +const assignBikes = function(workers, bikes) { + const n = workers.length, m = bikes.length + let res = Infinity + dfs(0, 0, 0) + return res + function dfs(i, mask, cur) { + if(i === n) { + res = Math.min(res, cur) + return + } + for(let j = 0; j < m; j++) { + if(((mask >> j) ^ 1) % 2 == 1) { + dfs(i + 1, mask | (1 << j), cur + calc(i, j)) + } + } + } + + function calc(i, j) { + const a = workers[i], b = bikes[j] + return Math.abs(a[0] - b[0]) + Math.abs(a[1] - b[1]) + } + +}; + +// another + /** * @param {number[][]} workers * @param {number[][]} bikes From 015bcdd20845b2f75e4e5c4319aa58961393ba5d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Feb 2022 14:06:52 +0800 Subject: [PATCH 0594/2039] Update 1066-campus-bikes-ii.js --- 1066-campus-bikes-ii.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/1066-campus-bikes-ii.js b/1066-campus-bikes-ii.js index 0f1f9b3a..ddf46b3d 100644 --- a/1066-campus-bikes-ii.js +++ b/1066-campus-bikes-ii.js @@ -14,7 +14,7 @@ const assignBikes = function(workers, bikes) { return } for(let j = 0; j < m; j++) { - if(((mask >> j) ^ 1) % 2 == 1) { + if((mask & (1 << j)) === 0) { dfs(i + 1, mask | (1 << j), cur + calc(i, j)) } } From 37a41a88cd51ff61a30dc4eceef722e132fbf12b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Feb 2022 12:55:50 +0800 Subject: [PATCH 0595/2039] Create 2180-count-integers-with-even-digit-sum.js --- 2180-count-integers-with-even-digit-sum.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2180-count-integers-with-even-digit-sum.js diff --git a/2180-count-integers-with-even-digit-sum.js b/2180-count-integers-with-even-digit-sum.js new file mode 100644 index 00000000..c15c2dc9 --- /dev/null +++ b/2180-count-integers-with-even-digit-sum.js @@ -0,0 +1,22 @@ +/** + * @param {number} num + * @return {number} + */ +var countEven = function(num) { + let res = 0 + for(let i = 1; i <= num; i++) { + const tmp = sum(i) + if(tmp % 2 === 0) res++ + } + + return res +}; + +function sum(e) { + let res = 0 + while(e) { + res += e % 10 + e = Math.floor(e/10) + } + return res +} From e606b4d2305407197399a1f55f4919bf7b2db117 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Feb 2022 12:56:17 +0800 Subject: [PATCH 0596/2039] Create 2181-merge-nodes-in-between-zeros.js --- 2181-merge-nodes-in-between-zeros.js | 37 ++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 2181-merge-nodes-in-between-zeros.js diff --git a/2181-merge-nodes-in-between-zeros.js b/2181-merge-nodes-in-between-zeros.js new file mode 100644 index 00000000..12bcb723 --- /dev/null +++ b/2181-merge-nodes-in-between-zeros.js @@ -0,0 +1,37 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +var mergeNodes = function(head) { + const dummy = new ListNode() + const arr = [] + let cur = head + while(cur) { + arr.push(cur) + cur = cur.next + } + let tail = dummy + let lastIdx = 0, sum = 0 + if(arr.length) { + for(let i = 1; i < arr.length; i++) { + const tmp = arr[i] + if(tmp.val === 0 && sum !== 0) { + lastIdx = i + tail.next = new ListNode(sum) + tail = tail.next + sum = 0 + } else { + sum += tmp.val + } + } + } + + return dummy.next +}; From 0ad002b6b8ceb90f54a2b6491d5abbe1658a7c3b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Feb 2022 12:56:44 +0800 Subject: [PATCH 0597/2039] Create 2182-construct-string-with-repeat-limit.js --- 2182-construct-string-with-repeat-limit.js | 46 ++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 2182-construct-string-with-repeat-limit.js diff --git a/2182-construct-string-with-repeat-limit.js b/2182-construct-string-with-repeat-limit.js new file mode 100644 index 00000000..3672040b --- /dev/null +++ b/2182-construct-string-with-repeat-limit.js @@ -0,0 +1,46 @@ +/** + * @param {string} s + * @param {number} repeatLimit + * @return {string} + */ +var repeatLimitedString = function(s, repeatLimit) { + const a = 'a'.charCodeAt(0) + const ch = Array(26).fill(0) + for(let e of s) { + const idx = e.charCodeAt(0) + ch[idx - a]++ + } + let res = '', last = '' + while(true) { + let len = res.length + let h = false + for(let i = 25; i >= 0; i--) { + if(ch[i] >= repeatLimit && res[res.length - 1] !== String.fromCharCode(a + i)) { + + res += String.fromCharCode(a + i).repeat(repeatLimit) + ch[i] -= repeatLimit + + if(ch[i]) { + for(let j = i - 1; j >= 0; j--) { + if(ch[j]) { + res += String.fromCharCode(a + j) + ch[j]-- + break + } + } + break + } + + }else if(ch[i] > 0 && res[res.length - 1] !== String.fromCharCode(a + i)) { + + res += String.fromCharCode(a + i).repeat(ch[i]) + ch[i] = 0 + break + } + } + if(len === res.length) break + } + + + return res +}; From 10d93e11c48bb203ee5383d8b2cfc7cd7a75ec37 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Feb 2022 12:57:13 +0800 Subject: [PATCH 0598/2039] Create 2183-count-array-pairs-divisible-by-k.js --- 2183-count-array-pairs-divisible-by-k.js | 27 ++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2183-count-array-pairs-divisible-by-k.js diff --git a/2183-count-array-pairs-divisible-by-k.js b/2183-count-array-pairs-divisible-by-k.js new file mode 100644 index 00000000..d7ff02ab --- /dev/null +++ b/2183-count-array-pairs-divisible-by-k.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const coutPairs = function(nums, k) { + let res = 0; + let cnt = Array(1e5 + 1).fill(0); + const n = nums.length + for (let i = 0; i < n; ++i) { + if (nums[i] % k == 0) { + res += i; + ++cnt[0]; + } + else { + let div = gcd(k, nums[i]); + for (let d = 0; d <= div; ++d) res += cnt[k / div * d]; + ++cnt[div]; + } + } + return res; +}; + +function gcd(a, b) { + if(b === 0) return a + return gcd(b, a % b) +} From d29635fe43e5dd092e5dd3755a6c2c0acd88b638 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Feb 2022 13:36:55 +0800 Subject: [PATCH 0599/2039] Update 1655-distribute-repeating-integers.js --- 1655-distribute-repeating-integers.js | 56 +++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/1655-distribute-repeating-integers.js b/1655-distribute-repeating-integers.js index a7d7c2c5..ece2391f 100644 --- a/1655-distribute-repeating-integers.js +++ b/1655-distribute-repeating-integers.js @@ -111,3 +111,59 @@ const canDistribute = function(nums, quantity) { return dp[idx][mask] = res } }; + +// another + +/** + * @param {number[]} nums + * @param {number[]} quantity + * @return {boolean} + */ +const canDistribute = function (nums, quantity) { + const hash = {} + for(const e of nums) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const cnts = Object.values(hash), m = quantity.length, n = cnts.length + const dp = Array.from({ length: n }, () => Array(1 << m).fill(null)) + + return helper(0, 0) + + function helper(idx, mask) { + // mask are already selected candidates + if(mask == (1 << m) - 1) { + return true; + } + if(idx == n) { + return false; + } + if(dp[idx][mask] != null) { + return dp[idx][mask]; + } + let ans = helper(idx + 1, mask); + + for(let i = 1; i < (1 << m); ++i) { + // i are potential candidates in addition to already selected ones (from mask) + // if i == mask, we can skip as the candidate is selected already + // if mask != (mask & i) means that this candidate does not include selected ones e.g + // mask = 3 (i.e 2 elements 1,2 in binary) and i = 4 (the third element in binary as 4 does not include 1 & 2), there we skip + if(mask == i || mask != (mask & i)) continue; + let sum = 0; + for(let j = 0; j < m; ++j) { + // mask << ~j is just a fancy way to do: if(mask & (1 << j)) that i've learned from @Uwi and this way you don't have to use "(", ")" + // what it does is simply pushing the jth bit to the 2^31 bit which is negative + // thus if the jth bit is 1 then the value is less than zero and if its 0 then its greater or equal to zero + if(mask << ~j >= 0 && i << ~j < 0) { // check that mask does not contain the new candidate and that the candidate is part of the potential candidate i + sum += quantity[j]; + } + } + if(sum <= cnts[idx]) { + ans |= helper(idx + 1, i); + } + if(ans) break; // if ans is true, then a solution exists and no further computation is required + } + dp[idx][mask] = ans; + return ans; + } +} From b2df82666a5e8463f5b32b67c75801f6306d57ca Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Feb 2022 11:50:37 +0800 Subject: [PATCH 0600/2039] Update 1986-minimum-number-of-work-sessions-to-finish-the-tasks.js --- ...er-of-work-sessions-to-finish-the-tasks.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js b/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js index e3e4b07a..2b5b5758 100644 --- a/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js +++ b/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js @@ -28,3 +28,35 @@ const minSessions = function(tasks, sessionTime) { return dp[mask][consumed] = result; } }; + +// another + +/** + * @param {number[]} tasks + * @param {number} sessionTime + * @return {number} + */ +function minSessions(tasks, sessionTime) { + const n = tasks.length + const memo = Array.from({ length: 1 << n }, () => Array(15)) + return helper((1 << n) - 1, 0) + + function helper(mask, remain) { + if(mask === 0) return 0 + if(memo[mask][remain] != null) return memo[mask][remain] + let res = n + + for(let i = 0; i < n; i++) { + if((1 << i) & mask) { + const newMask = mask & (~(1 << i)) + if(tasks[i] <= remain) { + res = Math.min(res, helper(newMask, remain - tasks[i])) + } else { + res = Math.min(res, helper(newMask, sessionTime - tasks[i]) + 1) + } + } + } + + return memo[mask][remain] = res + } +} From a742357fef9293ff3cf86c22bf845cb73e8e2fea Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Feb 2022 17:11:33 +0800 Subject: [PATCH 0601/2039] Create 2152-minimum-number-of-lines-to-cover-points.js --- ...minimum-number-of-lines-to-cover-points.js | 58 +++++++++++++++++++ 1 file changed, 58 insertions(+) create mode 100644 2152-minimum-number-of-lines-to-cover-points.js diff --git a/2152-minimum-number-of-lines-to-cover-points.js b/2152-minimum-number-of-lines-to-cover-points.js new file mode 100644 index 00000000..8c0878b4 --- /dev/null +++ b/2152-minimum-number-of-lines-to-cover-points.js @@ -0,0 +1,58 @@ +/** + * @param {number[][]} points + * @return {number} + */ +const minimumLines = function(points) { + const n = points.length; + const connects = Array.from({ length: n }, () => Array(n).fill(0)); + for(let i = 0; i < n; ++i) { + for(let j = i + 1; j < n; ++j) { + connects[i][j] = (1 << i) | (1 << j); + let dx = points[j][0] - points[i][0]; + let dy = points[j][1] - points[i][1]; + for(let k = j + 1; k < n; ++k) { // check if k will be on the line connecting i and j. + let dx2 = points[k][0] - points[i][0]; + let dy2 = points[k][1] - points[i][1]; + if (dx * dy2 == dy * dx2) { + connects[i][j] |= (1 << k); + } + } + } + } + const dp = new Array(1<= n - 2) { // if only 2 points left + dp[mask] = 1; + } else { // if there are more than 2 points, try a line connecting first to second, third, ... + let i = 0; + for(let x = (1 << i); i < n; ++i, x <<= 1) { + if ((mask & x) == 0) { + break; + } + } + for(let j = i + 1, x = (1 << j); j < n; ++j, x <<= 1) { + if ((mask & x) == 0) { + let mask2 = mask | connects[i][j]; + dp[mask] = Math.min(dp[mask], 1 + helper(n, mask2, dp, connects)); + } + } + } + } + return dp[mask]; +} + +function numOfOne(num) { + const str = (num >>> 0).toString(2) + let res = 0 + for(let ch of str) { + if(ch === '1') res++ + } + return res +} From 0b754135afaa8a5fee877f875314bf4d05b6f3e3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Feb 2022 00:09:50 +0800 Subject: [PATCH 0602/2039] Create 2179-count-good-triplets-in-an-array.js --- 2179-count-good-triplets-in-an-array.js | 37 +++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 2179-count-good-triplets-in-an-array.js diff --git a/2179-count-good-triplets-in-an-array.js b/2179-count-good-triplets-in-an-array.js new file mode 100644 index 00000000..56aca32c --- /dev/null +++ b/2179-count-good-triplets-in-an-array.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} a + * @param {number[]} b + * @return {number} + */ +const goodTriplets = function(a, b) { + let n = a.length, m = new Map(), res = 0; + for (let i = 0; i < n; i++) m.set(b[i], i); + let fen = new Fenwick(n + 3); + for (let i = 0; i < n; i++) { + let pos = m.get(a[i]); + let l = fen.query(pos), r = (n - 1 - pos) - (fen.query(n - 1) - fen.query(pos)); + res += l * r; + fen.update(pos, 1); + } + return res; +}; +function Fenwick(n) { + let tree = Array(n).fill(0); + return { query, update } + function query(i) { + let sum = 0; + i++; + while (i > 0) { + sum += tree[i]; + i -= i & -i; + } + return sum; + } + function update(i, v) { + i++; + while (i < n) { + tree[i] += v; + i += i & -i; + } + } +} From 2709eabdd1fea7cf076673d425ca4489c0ee1e1a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Mar 2022 15:12:09 +0800 Subject: [PATCH 0603/2039] Create 2163-minimum-difference-in-sums-after-removal-of-elements.js --- ...rence-in-sums-after-removal-of-elements.js | 110 ++++++++++++++++++ 1 file changed, 110 insertions(+) create mode 100644 2163-minimum-difference-in-sums-after-removal-of-elements.js diff --git a/2163-minimum-difference-in-sums-after-removal-of-elements.js b/2163-minimum-difference-in-sums-after-removal-of-elements.js new file mode 100644 index 00000000..938e51e7 --- /dev/null +++ b/2163-minimum-difference-in-sums-after-removal-of-elements.js @@ -0,0 +1,110 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumDifference = function(nums) { + const n = nums.length, len = n / 3 + const maxHeap = new PriorityQueue((a, b) => a > b) + const minHeap = new PriorityQueue((a, b) => a < b) + const pre = Array(n).fill(Infinity), suffix = Array(n).fill(-Infinity) + for(let i = 0, sum = 0; i < 2 * len; i++) { + const cur = nums[i] + maxHeap.push(cur) + sum += cur + if(maxHeap.size() > len) { + const tmp = maxHeap.pop() + sum -= tmp + } + if(maxHeap.size() === len) { + pre[i] = sum + } + } + + for(let i = n - 1, sum = 0; i >= len; i--) { + const cur = nums[i] + minHeap.push(cur) + sum += cur + if(minHeap.size() > len) { + const tmp = minHeap.pop() + sum -= tmp + } + if(minHeap.size() === len) { + suffix[i] = sum + } + } + + // console.log(pre, suffix) + let res = Infinity + for(let i = len - 1; i < n - len; i++) { + res = Math.min(res, pre[i] - suffix[i + 1]) + } + return res +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 6f616b04842ee2843a5b4ae9f45b071289e40427 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 2 Mar 2022 10:40:28 +0800 Subject: [PATCH 0604/2039] Update 1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js --- ...s-to-make-the-binary-string-alternating.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js b/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js index da32124d..0255d212 100644 --- a/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js +++ b/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.js @@ -76,5 +76,40 @@ const minFlips = function (s) { return res } +// another + +/** + * @param {string} s + * @return {number} + */ +const minFlips = function (s) { + const n = s.length + const ss = s + s + let s1 = '', s2 = '' + for(let i = 0; i < 2 * n; i++) { + if(i % 2 === 0) { + s1 += '0' + s2 += '1' + }else{ + s1 += '1' + s2 += '0' + } + } + let res = Infinity, res1 = 0, res2 = 0 + + for (let i = 0; i < 2 * n; i++) { + if(ss[i] !== s1[i]) res1++ + if(ss[i] !== s2[i]) res2++ + if(i >= n) { + if(ss[i - n] !== s1[i - n]) res1-- + if(ss[i - n] !== s2[i - n]) res2-- + } + if(i >= n - 1) { + res = Math.min(res, res1, res2) + } + } + + return res +} From 75f2207bd51144656254d63cd8cf817d9742e8a8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 3 Mar 2022 10:42:54 +0800 Subject: [PATCH 0605/2039] Update 1769-minimum-number-of-operations-to-move-all-balls-to-each-box.js --- ...perations-to-move-all-balls-to-each-box.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.js b/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.js index 6364c519..11f47aa6 100644 --- a/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.js +++ b/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.js @@ -45,3 +45,27 @@ function helper(str, idx) { } return res } + +// another + +/** + * @param {string} boxes + * @return {number[]} + */ + const minOperations = function(boxes) { + const n = boxes.length + const res = Array(n).fill(0) + let cnt = 0, sum = 0 + for(let i = 0; i < n; i++) { + res[i] = sum + cnt += boxes[i] === '1' ? 1 : 0 + sum += cnt + } + cnt = 0, sum = 0 + for(let i = n - 1; i >= 0; i--) { + res[i] += sum + cnt += boxes[i] === '1' ? 1 : 0 + sum += cnt + } + return res +}; From 27250dd73b17fb78695d1f944835ee6e667dc73a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Mar 2022 15:07:06 +0800 Subject: [PATCH 0606/2039] Update 2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js --- ...emove-all-cars-containing-illegal-goods.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js index db4e36c1..e0a246c8 100644 --- a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js +++ b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js @@ -1,3 +1,28 @@ +/** + * @param {string} s + * @return {number} + */ +const minimumTime = function(s) { + const n = s.length + const arr = [] + for(let ch of s) { + arr.push(ch === '1' ? 1 : -1) + } + const score = minSum(arr) + return n + score + + function minSum(ar) { + const dp = Array(n).fill(0) + dp[0] = ar[0] + for(let i = 1; i < n; i++) { + dp[i] = Math.min(ar[i], ar[i] + dp[i - 1]) + } + return Math.min(0, Math.min(...dp)) + } +}; + +// another + /** * @param {string} s * @return {number} From c5efe094fc52f0af09e7e8a0c5b8b1934f092d17 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Mar 2022 15:30:07 +0800 Subject: [PATCH 0607/2039] Update 53-maximum-subarray.js --- 53-maximum-subarray.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) diff --git a/53-maximum-subarray.js b/53-maximum-subarray.js index 60de46f4..8cb65d28 100755 --- a/53-maximum-subarray.js +++ b/53-maximum-subarray.js @@ -14,6 +14,23 @@ const maxSubArray = function(nums) { // another +/** + * @param {number[]} nums + * @return {number} + */ +const maxSubArray = function(nums) { + const n = nums.length, dp = Array(n).fill(0) + dp[0] = nums[0] + let res = dp[0] + for(let i = 1; i < n; i++) { + dp[i] = Math.max(dp[i - 1], 0) + nums[i] + res = Math.max(res, dp[i]) + } + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 7ea4451a50556738c3b1f6726990b9e36b6f7dd6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Mar 2022 15:51:34 +0800 Subject: [PATCH 0608/2039] Update 2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js --- ...emove-all-cars-containing-illegal-goods.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js index e0a246c8..f9911016 100644 --- a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js +++ b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js @@ -23,6 +23,35 @@ const minimumTime = function(s) { // another +/** + * @param {string} s + * @return {number} + */ +const minimumTime = function(s) { + if(s.length === 1) return s === '1' ? 1 : 0 + const n = s.length + const arr = [] + for(let ch of s) { + arr.push(ch === '1' ? 1 : -1) + } + const score = minSum(arr) + return n + score + + function minSum(ar) { + const dp = Array(n).fill(0) + dp[0] = ar[0] + let ans = dp[0] + for(let i = 1; i < n; i++) { + dp[i] = Math.min(ar[i], ar[i] + dp[i - 1]) + ans = Math.min(0, ans, dp[i]) + } + return ans + } +}; + +// another + + /** * @param {string} s * @return {number} From 44a42319f67093fbd138c70b6bee59d9de83d211 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Mar 2022 16:10:54 +0800 Subject: [PATCH 0609/2039] Update 2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js --- ...emove-all-cars-containing-illegal-goods.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js index f9911016..6f4ca66e 100644 --- a/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js +++ b/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.js @@ -1,3 +1,30 @@ +/** + * @param {string} s + * @return {number} + */ +const minimumTime = function(s) { + const n = s.length + const arr = [] + for(let ch of s) { + arr.push(ch === '1' ? 1 : -1) + } + const score = minSum(arr) + return n + score + + function minSum(ar) { + const dp = Array(n).fill(Infinity) + dp[0] = ar[0] + let ans = dp[0] + for(let i = 1; i < n; i++) { + dp[i] = Math.min(ar[i], ar[i] + dp[i - 1]) + ans = Math.min(ans, dp[i]) + } + return ans > 0 ? 0 : ans + } +}; + +// another + /** * @param {string} s * @return {number} From e2890a54d902751e9b3360326df518ea50652a03 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 9 Mar 2022 09:52:48 +0800 Subject: [PATCH 0610/2039] Update 334-increasing-triplet-subsequence.js --- 334-increasing-triplet-subsequence.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/334-increasing-triplet-subsequence.js b/334-increasing-triplet-subsequence.js index a62bf62c..bd231408 100644 --- a/334-increasing-triplet-subsequence.js +++ b/334-increasing-triplet-subsequence.js @@ -12,3 +12,26 @@ const increasingTriplet = function(nums) { } return false; }; + +// another + +/** + * @param {number[]} nums + * @return {boolean} + */ +const increasingTriplet = function(nums) { + const n = nums.length, stk = [] + for(let e of nums) { + let l = 0, r = stk.length + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if (e > stk[mid]) l = mid + 1 + else r = mid + } + + stk[l] = e + if(stk.length > 2) return true + } + + return false +}; From d9e6fcc703ef0f6412dcf249a548fe2d11c423de Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Mar 2022 10:47:39 +0800 Subject: [PATCH 0611/2039] Update 42-trapping-rain-water.js --- 42-trapping-rain-water.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/42-trapping-rain-water.js b/42-trapping-rain-water.js index 4b2a964a..1b31b415 100644 --- a/42-trapping-rain-water.js +++ b/42-trapping-rain-water.js @@ -93,3 +93,27 @@ const trap = function(height) { return res }; + +// another + +/** + * @param {number[]} height + * @return {number} + */ +const trap = function(height) { + const n = height.length, { max } = Math + let res = 0, l = 0, r = n - 1, leftMax = height[0], rightMax = height[n - 1] + while(l <= r) { + if(leftMax < rightMax) { + leftMax = max(leftMax, height[l]) + res += leftMax - height[l] + l++ + } else { + rightMax = max(rightMax, height[r]) + res += rightMax - height[r] + r-- + } + } + + return res +}; From 44241bcb33f1dcdebdb57bc6bc3613835e2ccbf5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Mar 2022 14:58:43 +0800 Subject: [PATCH 0612/2039] Create LICENSE --- LICENSE | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/LICENSE b/LICENSE index 584ad7e8..be19a0e2 100644 --- a/LICENSE +++ b/LICENSE @@ -1,6 +1,6 @@ MIT License -Copyright (c) 2018 everthis +Copyright (c) 2022 everthis Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal From 7419a713212d9adfa9005654bcaba199576d5095 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Mar 2022 09:02:55 +0800 Subject: [PATCH 0613/2039] Create 2193-minimum-number-of-moves-to-make-palindrome.js --- ...imum-number-of-moves-to-make-palindrome.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2193-minimum-number-of-moves-to-make-palindrome.js diff --git a/2193-minimum-number-of-moves-to-make-palindrome.js b/2193-minimum-number-of-moves-to-make-palindrome.js new file mode 100644 index 00000000..266ef822 --- /dev/null +++ b/2193-minimum-number-of-moves-to-make-palindrome.js @@ -0,0 +1,21 @@ +/** + * @param {string} s + * @return {number} + */ +const minMovesToMakePalindrome = function(s) { + let res = 0 + const arr = s.split('') + + while(arr.length) { + const idx = arr.indexOf(arr[arr.length - 1]) + if(idx === arr.length - 1) { + res += ~~(idx / 2) + } else { + res += idx + arr.splice(idx, 1) + } + arr.pop() + } + + return res +}; From af5ab66bec3e75fcd22377d734bed57d5f721e66 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Mar 2022 15:14:01 +0800 Subject: [PATCH 0614/2039] Create 1176-diet-plan-performance.js --- 1176-diet-plan-performance.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1176-diet-plan-performance.js diff --git a/1176-diet-plan-performance.js b/1176-diet-plan-performance.js new file mode 100644 index 00000000..c337b2e2 --- /dev/null +++ b/1176-diet-plan-performance.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} calories + * @param {number} k + * @param {number} lower + * @param {number} upper + * @return {number} + */ +var dietPlanPerformance = function(calories, k, lower, upper) { + let res = 0 + for(let i = 0, n = calories.length; i < n - k + 1; i++) { + let tmp = 0 + for(let j = 0; j < k && i + j < n; j++) { + tmp += calories[i + j] + } + if(tmp < lower) res-- + else if(tmp > upper) res++ + } + return res +}; From fc823c28b47576fd0b4a2e380ec9ddd5f1a945fe Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Mar 2022 15:17:46 +0800 Subject: [PATCH 0615/2039] Update 1176-diet-plan-performance.js --- 1176-diet-plan-performance.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1176-diet-plan-performance.js b/1176-diet-plan-performance.js index c337b2e2..4930160b 100644 --- a/1176-diet-plan-performance.js +++ b/1176-diet-plan-performance.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} calories + * @param {number} k + * @param {number} lower + * @param {number} upper + * @return {number} + */ +var dietPlanPerformance = function(calories, k, lower, upper) { + let res = 0 + for(let i = 0, n = calories.length, tmp = 0; i < n; i++) { + tmp += calories[i] + if(i >= k - 1) { + if(i >= k) { + tmp -= calories[i - k] + } + if(tmp < lower) res-- + else if(tmp > upper) res++ + } + + } + return res +}; + +// another + /** * @param {number[]} calories * @param {number} k From ef9c5e265f22ec75cef85d99f85dd4e34dacfead Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Mar 2022 15:44:16 +0800 Subject: [PATCH 0616/2039] Create 1243-array-transformation.js --- 1243-array-transformation.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1243-array-transformation.js diff --git a/1243-array-transformation.js b/1243-array-transformation.js new file mode 100644 index 00000000..b42a84d6 --- /dev/null +++ b/1243-array-transformation.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} arr + * @return {number[]} + */ + const transformArray = function(arr) { + let cur = arr + while(true) { + const clone = cur.slice() + for(let i = 1; i < clone.length - 1; i++) { + if(cur[i] > cur[i - 1] && cur[i] > cur[i + 1]) clone[i]-- + else if(cur[i] < cur[i - 1] && cur[i] < cur[i + 1]) clone[i]++ + } + if(same(cur, clone)) return clone + cur = clone + } + + return cur + + function same(a1, a2) { + for(let i = 0; i< a1.length; i++) { + if(a1[i] !== a2[i]) return false + } + return true + } +}; From 44eac72cf71d0a61f724506a050accc5cd7796a7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Mar 2022 17:18:42 +0800 Subject: [PATCH 0617/2039] Create 1180-count-substrings-with-only-one-distinct-letter.js --- ...unt-substrings-with-only-one-distinct-letter.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1180-count-substrings-with-only-one-distinct-letter.js diff --git a/1180-count-substrings-with-only-one-distinct-letter.js b/1180-count-substrings-with-only-one-distinct-letter.js new file mode 100644 index 00000000..bf5b3bec --- /dev/null +++ b/1180-count-substrings-with-only-one-distinct-letter.js @@ -0,0 +1,14 @@ +/** + * @param {string} s + * @return {number} + */ +const countLetters = function(s) { + const str = ` ${s} ` + let res = 0, cnt = 0 + for(let i = 1; i < str.length - 1; i++) { + if(str[i] !== str[i - 1]) cnt = 1 + else cnt += 1 + res += cnt + } + return res +}; From 099dbff35acaa1606d74babaeb2ee019ead5791d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 14 Mar 2022 15:59:32 +0800 Subject: [PATCH 0618/2039] Update 765-couples-holding-hands.js --- 765-couples-holding-hands.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/765-couples-holding-hands.js b/765-couples-holding-hands.js index 4fec7b3e..3b5aa4d9 100644 --- a/765-couples-holding-hands.js +++ b/765-couples-holding-hands.js @@ -72,3 +72,35 @@ const minSwapsCouples = function (row) { } } +// another + +/** + * @param {number[]} row + * @return {number} + */ +const minSwapsCouples = function (row) { + let res = 0 + const n = row.length + const ptn = Array(n).fill(0), pos = Array(n).fill(0) + + for(let i = 0; i < n; i++) { + ptn[i] = (i % 2 === 0 ? i + 1 : i - 1) + pos[row[i]] = i + } + + for (let i = 0; i < n ;i++) { + for (let j = ptn[pos[ptn[row[i]]]]; i != j; j = ptn[pos[ptn[row[i]]]]) { + swap(row, i, j); + swap(pos, row[i], row[j]); + res++; + } + } + + return res + + function swap(arr, i, j) { + const val = arr[i] + arr[i] = arr[j] + arr[j] = val + } +} From fd0f57aad0cde908c1fe2ebcfe39c3e3df41208d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Mar 2022 16:36:11 +0800 Subject: [PATCH 0619/2039] Update 743-network-delay-time.js --- 743-network-delay-time.js | 101 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 101 insertions(+) diff --git a/743-network-delay-time.js b/743-network-delay-time.js index 153e225e..a827a9ca 100644 --- a/743-network-delay-time.js +++ b/743-network-delay-time.js @@ -47,3 +47,104 @@ const networkDelayTime = function(times, N, K) { const res = Math.max(...distances); return res === Infinity ? -1 : res; }; + +// another + +/** + * @param {number[][]} times + * @param {number} N + * @param {number} K + * @return {number} + */ +const networkDelayTime = function (times, N, K) { + const hash = {} + for(const [u, v, t] of times) { + if(hash[u] == null) hash[u] = {} + hash[u][v] = t + } + const pq = new PriorityQueue((a, b) => a[0] < b[0]) + pq.push([0, K]) + const visited = Array.from(N + 1) + let res = 0 + while(!pq.isEmpty()) { + const [dist, cur] = pq.pop() + if(visited[cur]) continue + visited[cur] = true + res = dist + N-- + if(hash[cur]) { + for(let next of Object.keys(hash[cur])) { + pq.push([dist + hash[cur][next], next]) + } + } + } + return N === 0 ? res : -1 +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 5b4fffd96e3367de025b3299c19631e77d88c0f5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Mar 2022 09:58:29 +0800 Subject: [PATCH 0620/2039] Update 1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js --- ...-make-at-least-one-valid-path-in-a-grid.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js b/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js index 1607e02e..8c9c7b30 100644 --- a/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js +++ b/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js @@ -33,3 +33,34 @@ const minCost = function (grid) { } return dp[n - 1][m - 1] } + +// another + +function minCost(grid) { + const INF = 1e9, m = grid.length, n = grid[0].length + const dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]] // right, left, down, up + let cost = 0 + const dp = Array.from({ length: m }, () => Array(n).fill(INF)) + const q = [] + dfs(0, 0, 0) + while(q.length) { + cost++ + for (let size = q.length; size > 0; size--) { + const [r, c] = q.shift() + for(let [dx, dy] of dirs) { + dfs(r + dx, c + dy, cost) + } + } + } + + return dp[m - 1][n - 1] + function dfs(r, c, cost) { + if(r < 0 || r >= m || c < 0 || c >= n || dp[r][c] !== INF) return + dp[r][c] = cost + q.push([r, c]) + const nextDir = grid[r][c] - 1 + const [dx, dy] = dirs[nextDir] + dfs(r + dx, c + dy, cost) + } +} + From 88be6ffb6f2ee43b090868fa3e6c1ffca0e50561 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Mar 2022 10:28:10 +0800 Subject: [PATCH 0621/2039] Update 1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js --- ...-make-at-least-one-valid-path-in-a-grid.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js b/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js index 8c9c7b30..def7dab1 100644 --- a/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js +++ b/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js @@ -1,3 +1,35 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +function minCost(grid) { + const m = grid.length, n = grid[0].length + const dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]] // right, left, down, up + const dp = Array.from({ length: m }, () => Array(n).fill(Infinity)) + let q = [[0, 0]] + dp[0][0] = 0 + while(q.length) { + const tmp = [] + for(let idx = q.length - 1; idx >= 0; idx--) { + const [r, c] = q[idx] + for(let i = 0; i < dirs.length; i++) { + const [dr, dc] = dirs[i] + const nr = r + dr, nc = c + dc + if(nr < 0 || nr >= m || nc < 0 || nc >= n) continue + if(dp[nr][nc] > dp[r][c] + (i === grid[r][c] - 1 ? 0 : 1)) { + dp[nr][nc] = dp[r][c] + (i === grid[r][c] - 1 ? 0 : 1) + tmp.push([nr, nc]) + } + } + } + q = tmp + } + + return dp[m - 1][n - 1] +} + +// another + /** * @param {number[][]} grid * @return {number} From 6f36d88100eab89db60007c6fa491480b90b4b3d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Mar 2022 09:49:38 +0800 Subject: [PATCH 0622/2039] Update 1976-number-of-ways-to-arrive-at-destination.js --- ...number-of-ways-to-arrive-at-destination.js | 111 ++++++++++++++++++ 1 file changed, 111 insertions(+) diff --git a/1976-number-of-ways-to-arrive-at-destination.js b/1976-number-of-ways-to-arrive-at-destination.js index b6015baa..11572bdd 100644 --- a/1976-number-of-ways-to-arrive-at-destination.js +++ b/1976-number-of-ways-to-arrive-at-destination.js @@ -109,3 +109,114 @@ class PriorityQueue { } } +// another + +/** + * @param {number} n + * @param {number[][]} roads + * @return {number} + */ +const countPaths = function(n, roads) { + const graph = {}, MOD = 1e9 + 7 + for(const [u, v, t] of roads) { + if(graph[u] == null) graph[u] = {} + if(graph[v] == null) graph[v] = {} + graph[u][v] = t + graph[v][u] = t + } + + return dijkstra(graph, n, 0) + + function dijkstra(graph, n, src) { + const dist = Array(n).fill(Infinity) + const ways = Array(n).fill(0) + ways[src] = 1 + dist[src] = 0 + const pq = new PriorityQueue((a, b) => a[0] < b[0]) + pq.push([0, 0]) + while(!pq.isEmpty()) { + const [d, u] = pq.pop() + if(d > dist[u]) continue + for(const next of Object.keys(graph[u] || {})) { + const val = graph[u][next] + if(dist[next] > d + val) { + dist[next] = d + val + ways[next] = ways[u] + pq.push([dist[next], next]) + } else if(dist[next] === d + val) { + ways[next] = (ways[next] + ways[u]) % MOD + } + } + } + + return ways[n - 1] + } +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 844ef51e0de56eca5b693a896e7f04baff0fe17c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Mar 2022 11:29:31 +0800 Subject: [PATCH 0623/2039] Create 2210-count-hills-and-valleys-in-an-array.js --- 2210-count-hills-and-valleys-in-an-array.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2210-count-hills-and-valleys-in-an-array.js diff --git a/2210-count-hills-and-valleys-in-an-array.js b/2210-count-hills-and-valleys-in-an-array.js new file mode 100644 index 00000000..7ffb12a9 --- /dev/null +++ b/2210-count-hills-and-valleys-in-an-array.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countHillValley = function(nums) { + const arr = [nums[0]], n = nums.length + for(let i = 1; i < n; i++) { + if(nums[i] !== nums[i - 1]) arr.push(nums[i]) + } + let res = 0 + for(let i = 1; i < arr.length - 1; i++) { + if( + arr[i] > arr[i - 1] && arr[i] > arr[i + 1] || + arr[i] < arr[i - 1] && arr[i] < arr[i + 1] + ) res++ + } + + return res +}; From 7918704bba8288b0e2c2e7ef6e2c6e8c3b0288ac Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Mar 2022 14:02:27 +0800 Subject: [PATCH 0624/2039] Create 2211-count-collisions-on-a-road.js --- 2211-count-collisions-on-a-road.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2211-count-collisions-on-a-road.js diff --git a/2211-count-collisions-on-a-road.js b/2211-count-collisions-on-a-road.js new file mode 100644 index 00000000..98bc465d --- /dev/null +++ b/2211-count-collisions-on-a-road.js @@ -0,0 +1,28 @@ +/** + * @param {string} directions + * @return {number} + */ +const countCollisions = function(directions) { + let res = 0, n = directions.length + + let flag = false + // left -> right + for(let i = 0; i < n; i++) { + if(directions[i] !== 'L') { + flag = true + } else { + res += flag ? 1 : 0 + } + } + flag = false + // right -> left + for(let i = n - 1; i >= 0; i--) { + if(directions[i] !== 'R') { + flag = true + } else { + res += flag ? 1 : 0 + } + } + + return res +}; From eecacfd4095acd70f56746b97ad1227ccd7e9e0c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Mar 2022 14:59:12 +0800 Subject: [PATCH 0625/2039] Update 2211-count-collisions-on-a-road.js --- 2211-count-collisions-on-a-road.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/2211-count-collisions-on-a-road.js b/2211-count-collisions-on-a-road.js index 98bc465d..03ab8347 100644 --- a/2211-count-collisions-on-a-road.js +++ b/2211-count-collisions-on-a-road.js @@ -26,3 +26,18 @@ const countCollisions = function(directions) { return res }; + +// another + +/** + * @param {string} directions + * @return {number} + */ + const countCollisions = function(directions) { + let res = 0, n = directions.length + let left = 0, right = n - 1 + while(left < n && directions[left] === 'L') left++ + while(right >= 0 && directions[right] === 'R') right-- + for(let i = left; i <= right; i++) res += directions[i] === 'S' ? 0 : 1 + return res +}; From d87227a42f4606c55c7653db18ebc902fed44be3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Mar 2022 10:29:51 +0800 Subject: [PATCH 0626/2039] Update 1786-number-of-restricted-paths-from-first-to-last-node.js --- ...estricted-paths-from-first-to-last-node.js | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/1786-number-of-restricted-paths-from-first-to-last-node.js b/1786-number-of-restricted-paths-from-first-to-last-node.js index 0552741f..6a80fd88 100644 --- a/1786-number-of-restricted-paths-from-first-to-last-node.js +++ b/1786-number-of-restricted-paths-from-first-to-last-node.js @@ -116,3 +116,57 @@ class PriorityQueue { } } } + +// another + +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +const countRestrictedPaths = function(n, edges) { + if (n === 1) return 0 + const graph = {} + for(const [u, v, t] of edges) { + if(graph[u] == null) graph[u] = {} + if(graph[v] == null) graph[v] = {} + graph[u][v] = t + graph[v][u] = t + } + const dist = dijkstra(n, graph) + const memo = Array(n + 1).fill(null) + const res = dfs(1) + return res + + function dijkstra(n, graph) { + const dist = Array(n + 1).fill(Infinity) + dist[n] = 0 + const pq = new PriorityQueue((a, b) => a[0] < b[0]) + pq.push([0, n]) + while(!pq.isEmpty()) { + const [d, cur] = pq.pop() + if(d !== dist[cur]) continue + for(const next of Object.keys(graph[cur] || {})) { + const delta = graph[cur][next] + if(dist[next] > d + delta) { + dist[next] = d + delta + pq.push([d + delta, next]) + } + } + } + return dist + } + + function dfs(src) { + if(memo[src] != null) return memo[src] + if(src === n) return 1 + let res = 0 + for(let next of Object.keys(graph[src] || {})) { + next = +next + if(dist[src] > dist[next]) { + res = ((res + dfs(next)) % (1e9 + 7)) + } + } + return memo[src] = res + } +} From a30ef92cdd6e58490480c75532f6ab806468513f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Mar 2022 14:52:35 +0800 Subject: [PATCH 0627/2039] Create 2212-maximum-points-in-an-archery-competition.js --- ...aximum-points-in-an-archery-competition.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2212-maximum-points-in-an-archery-competition.js diff --git a/2212-maximum-points-in-an-archery-competition.js b/2212-maximum-points-in-an-archery-competition.js new file mode 100644 index 00000000..fd5ede74 --- /dev/null +++ b/2212-maximum-points-in-an-archery-competition.js @@ -0,0 +1,30 @@ +/** + * @param {number} numArrows + * @param {number[]} aliceArrows + * @return {number[]} + */ +const maximumBobPoints = function(numArrows, aliceArrows) { + let bestScore = 0, res = null + const sum = arr => arr.reduce((ac, e) => ac + e, 0) + bt(0, numArrows, 0, Array(12).fill(0)) + res[0] += numArrows - sum(res) + return res + + function bt(k, remain, score, bobArrows) { + if(k == 12) { + if(score > bestScore) { + bestScore = score + res = bobArrows.slice(0) + } + return + } + bt(k + 1, remain, score, bobArrows) + let arrowsNeeded = aliceArrows[k] + 1 + if(remain >= arrowsNeeded) { + let bak = bobArrows[k] + bobArrows[k] = arrowsNeeded + bt(k + 1, remain - arrowsNeeded, score + k, bobArrows) + bobArrows[k] = bak + } + } +}; From 2980bc358ca874624e4e46f2a4f1fba79e145ffb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Mar 2022 10:04:41 +0800 Subject: [PATCH 0628/2039] Update 882-reachable-nodes-in-subdivided-graph.js --- 882-reachable-nodes-in-subdivided-graph.js | 109 +++++++++++++++++++++ 1 file changed, 109 insertions(+) diff --git a/882-reachable-nodes-in-subdivided-graph.js b/882-reachable-nodes-in-subdivided-graph.js index 89c1afbe..b0e08400 100644 --- a/882-reachable-nodes-in-subdivided-graph.js +++ b/882-reachable-nodes-in-subdivided-graph.js @@ -196,3 +196,112 @@ class PriorityQueue { } } } + +// another + +/** + * @param {number[][]} edges + * @param {number} M + * @param {number} N + * @return {number} + */ +const reachableNodes = function(edges, M, N) { + const graph = {} + for(const [u,v,c] of edges) { + if(graph[u] == null) graph[u] = {} + if(graph[v] == null) graph[v] = {} + graph[u][v] = c + graph[v][u] = c + } + const pq = new PriorityQueue((a, b) => a[0] > b[0]) + pq.push([M, 0]) + const visited = {} + while(!pq.isEmpty()) { + const [moves, i] = pq.pop() + if(visited[i] == null) { + visited[i] = moves + for(const k of Object.keys(graph[i] || {})) { + const remain = moves - graph[i][k] - 1 + if(visited[k] == null && remain >= 0) { + pq.push([remain, k]) + } + } + } + } + let res = 0 + res += Object.keys(visited).length + for(const [u, v, c] of edges) { + const a = visited[u] || 0, b = visited[v] || 0 + res += Math.min(a + b, c) + } + + return res +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From e6a1fda9575543369992ae86d197570345f6e71b Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Mar 2022 11:04:45 +0800 Subject: [PATCH 0629/2039] Update 882-reachable-nodes-in-subdivided-graph.js --- 882-reachable-nodes-in-subdivided-graph.js | 3 +++ 1 file changed, 3 insertions(+) diff --git a/882-reachable-nodes-in-subdivided-graph.js b/882-reachable-nodes-in-subdivided-graph.js index b0e08400..f83ea6f7 100644 --- a/882-reachable-nodes-in-subdivided-graph.js +++ b/882-reachable-nodes-in-subdivided-graph.js @@ -199,6 +199,9 @@ class PriorityQueue { // another +// time complexity: +// Dijkstra + Heap is O(E log E) +// worst case: O(N ^ 2 * log (N ^ 2)) /** * @param {number[][]} edges * @param {number} M From 98490531c699b4214132060592c46ccc78cfb4f2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Mar 2022 15:10:28 +0800 Subject: [PATCH 0630/2039] Create 2215-find-the-difference-of-two-arrays.js --- 2215-find-the-difference-of-two-arrays.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2215-find-the-difference-of-two-arrays.js diff --git a/2215-find-the-difference-of-two-arrays.js b/2215-find-the-difference-of-two-arrays.js new file mode 100644 index 00000000..07a46f8d --- /dev/null +++ b/2215-find-the-difference-of-two-arrays.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number[][]} + */ +var findDifference = function(nums1, nums2) { + const set1 = new Set(nums1), set2 = new Set(nums2) + const res = [new Set(), new Set()] + for(let e of nums1) { + if(set2.has(e)) continue + else res[0].add(e) + } + for(let e of nums2) { + if(set1.has(e)) continue + else res[1].add(e) + } + res[0] = Array.from(res[0]) + res[1] = Array.from(res[1]) + return res +}; From 1ac77bc062ae87825c6a8ba0cb8e27ac225de484 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Mar 2022 15:10:53 +0800 Subject: [PATCH 0631/2039] Create 2216-minimum-deletions-to-make-array-beautiful.js --- ...inimum-deletions-to-make-array-beautiful.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2216-minimum-deletions-to-make-array-beautiful.js diff --git a/2216-minimum-deletions-to-make-array-beautiful.js b/2216-minimum-deletions-to-make-array-beautiful.js new file mode 100644 index 00000000..f53288d5 --- /dev/null +++ b/2216-minimum-deletions-to-make-array-beautiful.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minDeletion = function(nums) { + let res = 0, i = 0 + for(i = 0, n = nums.length; i < n - 1;) { + if(nums[i] === nums[i + 1]) { + res++ + i++ + }else{ + i += 2 + } + } + if((nums.length - res) % 2 === 1) res++ + + return res +}; From 658308f60060d9e22df67f228f7195f5b43dea13 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Mar 2022 15:11:32 +0800 Subject: [PATCH 0632/2039] Create 2217-find-palindrome-with-fixed-length.js --- 2217-find-palindrome-with-fixed-length.js | 45 +++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 2217-find-palindrome-with-fixed-length.js diff --git a/2217-find-palindrome-with-fixed-length.js b/2217-find-palindrome-with-fixed-length.js new file mode 100644 index 00000000..400bc1a3 --- /dev/null +++ b/2217-find-palindrome-with-fixed-length.js @@ -0,0 +1,45 @@ +/** + * @param {number[]} queries + * @param {number} intLength + * @return {number[]} + */ +var kthPalindrome = function(queries, intLength) { + if (intLength == 1) { + let res = [] + for (let item of queries) { + if (item <= 9) res.push(item) + else res.push(-1) + } + return res + } + + let n = Math.floor(intLength / 2) + let ref = +("1"+"0".repeat(n-1)) + + if (intLength % 2 == 0) { + let res = [] + for (let item of queries) res.push(gen_even(item)) + return res + } else { + let res = [] + for (let item of queries) res.push(gen_odd(item)) + return res + } + + function gen_even(val) { + let part = ref + val - 1 + part = '' + part + if (part.length != n) return -1 + return +(part + part.split('').reverse().join('')) + } + + + function gen_odd(val) { + let mod = (val - 1) % 10 + let div = Math.floor((val - 1) / 10) + let part = ref + div + mod = '' + mod, part = '' + part + if (part.length != n) return -1 + return +(part + mod + part.split('').reverse().join('')) + } +}; From 44b7cd7b00dcd6f9eaff0b23d7c2c5f1bd41c36f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Mar 2022 15:12:00 +0800 Subject: [PATCH 0633/2039] Create 2218-maximum-value-of-k-coins-from-piles.js --- 2218-maximum-value-of-k-coins-from-piles.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2218-maximum-value-of-k-coins-from-piles.js diff --git a/2218-maximum-value-of-k-coins-from-piles.js b/2218-maximum-value-of-k-coins-from-piles.js new file mode 100644 index 00000000..73b66dfe --- /dev/null +++ b/2218-maximum-value-of-k-coins-from-piles.js @@ -0,0 +1,21 @@ +/** + * @param {number[][]} piles + * @param {number} k + * @return {number} + */ +var maxValueOfCoins = function(piles, k) { + let dp = Array(k + 1).fill(0); + for (let i = 0; i < piles.length; i++) { + const next = Array(k + 1).fill(0); + for (let l = 1; l <= k; l++) { + let sum = 0; + next[l] = dp[l]; + for (let j = 0; j < Math.min(piles[i].length, l); j++) { + sum += piles[i][j]; + next[l] = Math.max(next[l], dp[l - j - 1] + sum); + } + } + dp = next; + } + return dp[k]; +}; From ee3e5e00d1c156eddcdaaa03c66e5d4ac1999ca8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Mar 2022 15:42:20 +0800 Subject: [PATCH 0634/2039] Create 2188-minimum-time-to-finish-the-race.js --- 2188-minimum-time-to-finish-the-race.js | 59 +++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 2188-minimum-time-to-finish-the-race.js diff --git a/2188-minimum-time-to-finish-the-race.js b/2188-minimum-time-to-finish-the-race.js new file mode 100644 index 00000000..a5870ebc --- /dev/null +++ b/2188-minimum-time-to-finish-the-race.js @@ -0,0 +1,59 @@ +/** + * @param {number[][]} tires + * @param {number} changeTime + * @param {number} numLaps + * @return {number} + */ + const minimumFinishTime = function (tires, changeTime, numLaps) { + tires = preprocess(tires) + let n = tires.length + const { max, min } = Math + // to handle the cases where numLaps is small + // pre[i][j]: the total time to run j laps consecutively with tire i + const pre = Array.from({ length: n }, () => + Array(20).fill(Infinity) + ) + for (let i = 0; i < n; i++) { + pre[i][1] = tires[i][0] + for (let j = 2; j < 20; j++) { + if (pre[i][j - 1] * tires[i][1] >= 2e9) break + pre[i][j] = pre[i][j - 1] * tires[i][1] + } + // since we define it as the total time, rather than just the time for the j-th lap + // we have to make it prefix sum + for (let j = 2; j < 20; j++) { + if (pre[i][j - 1] + pre[i][j] >= 2e9) break + pre[i][j] += pre[i][j - 1] + } + } + + // dp[x]: the minimum time to finish x laps + const dp = Array(numLaps + 1).fill(Infinity) + for (let i = 0; i < n; i++) { + dp[1] = min(dp[1], tires[i][0]) + } + for (let x = 1; x <= numLaps; x++) { + if (x < 20) { + // x is small enough, so an optimal solution might never changes tires! + for (let i = 0; i < n; i++) { + dp[x] = min(dp[x], pre[i][x]) + } + } + for (let j = x - 1; j > 0 && j >= x - 18; j--) { + dp[x] = min(dp[x], dp[j] + changeTime + dp[x - j]) + } + } + + return dp[numLaps] +} + +function preprocess(tires) { + tires.sort((a, b) => (a[0] === b[0] ? a[1] - b[1] : a[0] - b[0])) + const res = [] + for (let t of tires) { + if (res.length === 0 || res[res.length - 1][1] > t[1]) { + res.push(t) + } + } + return res +} From 295a39a4e7f9e2047ca9b936e0db113d5fe56ac6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Mar 2022 18:45:34 +0800 Subject: [PATCH 0635/2039] Update 2188-minimum-time-to-finish-the-race.js --- 2188-minimum-time-to-finish-the-race.js | 44 +++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/2188-minimum-time-to-finish-the-race.js b/2188-minimum-time-to-finish-the-race.js index a5870ebc..2e995cff 100644 --- a/2188-minimum-time-to-finish-the-race.js +++ b/2188-minimum-time-to-finish-the-race.js @@ -57,3 +57,47 @@ function preprocess(tires) { } return res } + +// another + +/** + * @param {number[][]} tires + * @param {number} changeTime + * @param {number} numLaps + * @return {number} + */ +var minimumFinishTime = function (tires, changeTime, numLaps) { + let N = tires.length, + len = 0 + const { max, min } = Math + const best = Array(numLaps).fill(Infinity), + dp = Array(numLaps + 1).fill(Infinity) + for (let i = 0; i < N; ++i) { + // We assume we also need `changeTime` time to use the first tire + // so that we don't need to treat the first tire as a special case + let f = tires[i][0], + r = tires[i][1], + sum = changeTime, + p = 1 + for (let j = 0; j < numLaps; ++j) { + sum += f * p + // If using the same tire takes no less time than changing the tire, + // stop further using the current tire + if (f * p >= f + changeTime) break + best[j] = min(best[j], sum) + len = max(len, j + 1) + p *= r + } + } + // dp[i + 1] is the minimum time to finish `numLaps` laps + dp[0] = 0 + for (let i = 0; i < numLaps; ++i) { + for (let j = 0; j < len && i - j >= 0; ++j) { + // try using the same tire in the last `j+1` laps + dp[i + 1] = min(dp[i + 1], dp[i - j] + best[j]) + } + } + // minus the `changeTime` we added to the first tire + return dp[numLaps] - changeTime +} + From db80dd52c3b13c93a181bcd5fe3120b04e0b852b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 29 Mar 2022 09:45:11 +0800 Subject: [PATCH 0636/2039] Create 2209-minimum-white-tiles-after-covering-with-carpets.js --- ...white-tiles-after-covering-with-carpets.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2209-minimum-white-tiles-after-covering-with-carpets.js diff --git a/2209-minimum-white-tiles-after-covering-with-carpets.js b/2209-minimum-white-tiles-after-covering-with-carpets.js new file mode 100644 index 00000000..a3176f97 --- /dev/null +++ b/2209-minimum-white-tiles-after-covering-with-carpets.js @@ -0,0 +1,23 @@ +/** + * @param {string} floor + * @param {number} numCarpets + * @param {number} carpetLen + * @return {number} + */ +const minimumWhiteTiles = function(floor, numCarpets, carpetLen) { + // 0: black, 1: white + const n = floor.length + // dp[i][j]: the minimum number of white tiles still visible + // when using j tiles to cover the first i tiles + const dp = Array.from({ length: n + 1 }, () => Array(numCarpets + 1).fill(0)) + + for(let i = 1; i <= n; i++) { + for(let j = 0; j <= numCarpets; j++) { + const skip = dp[i - 1][j] + (floor[i - 1] === '1' ? 1 : 0) + const cover = j > 0 ? dp[Math.max(i - carpetLen, 0)][j - 1] : 1000 + dp[i][j] = Math.min(skip, cover) + } + } + + return dp[n][numCarpets] +}; From d6a84aa171e84eba1ce9d64a79170f5a76eda780 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 29 Mar 2022 09:53:54 +0800 Subject: [PATCH 0637/2039] Update 2209-minimum-white-tiles-after-covering-with-carpets.js --- 2209-minimum-white-tiles-after-covering-with-carpets.js | 9 +++++++-- 1 file changed, 7 insertions(+), 2 deletions(-) diff --git a/2209-minimum-white-tiles-after-covering-with-carpets.js b/2209-minimum-white-tiles-after-covering-with-carpets.js index a3176f97..a964a6c8 100644 --- a/2209-minimum-white-tiles-after-covering-with-carpets.js +++ b/2209-minimum-white-tiles-after-covering-with-carpets.js @@ -11,10 +11,15 @@ const minimumWhiteTiles = function(floor, numCarpets, carpetLen) { // when using j tiles to cover the first i tiles const dp = Array.from({ length: n + 1 }, () => Array(numCarpets + 1).fill(0)) + const ones = Array(n + 1).fill(0) for(let i = 1; i <= n; i++) { - for(let j = 0; j <= numCarpets; j++) { + ones[i] = ones[i - 1] + (floor[i - 1] === '1' ? 1 : 0) + } + for(let i = 1; i <= n; i++) { + dp[i][0] = ones[i] + for(let j = 1; j <= numCarpets; j++) { const skip = dp[i - 1][j] + (floor[i - 1] === '1' ? 1 : 0) - const cover = j > 0 ? dp[Math.max(i - carpetLen, 0)][j - 1] : 1000 + const cover = dp[Math.max(i - carpetLen, 0)][j - 1] dp[i][j] = Math.min(skip, cover) } } From 4dc7c3bc85d20e80e7e2e7005a86913423efeca2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 30 Mar 2022 10:01:02 +0800 Subject: [PATCH 0638/2039] Update 2218-maximum-value-of-k-coins-from-piles.js --- 2218-maximum-value-of-k-coins-from-piles.js | 26 +++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/2218-maximum-value-of-k-coins-from-piles.js b/2218-maximum-value-of-k-coins-from-piles.js index 73b66dfe..a31a94da 100644 --- a/2218-maximum-value-of-k-coins-from-piles.js +++ b/2218-maximum-value-of-k-coins-from-piles.js @@ -19,3 +19,29 @@ var maxValueOfCoins = function(piles, k) { } return dp[k]; }; + +// another + +/** + * @param {number[][]} piles + * @param {number} k + * @return {number} + */ +const maxValueOfCoins = function(piles, k) { + const n = piles.length + const memo = Array.from({ length: n + 1 }, () => Array(k + 1).fill(null)) + return helper(0, k) + + function helper(i, k) { + if(k == 0 || i === n) return 0 + if(memo[i][k] != null) return memo[i][k] + let res = helper(i + 1, k) + let cur = 0 + + for(let j = 0; j < Math.min(piles[i].length, k); j++) { + cur += piles[i][j] + res = Math.max(res, cur + helper(i + 1, k - j - 1)) + } + return memo[i][k] = res + } +}; From 89c8431e5cd84370aca9d746ac687a2f28977b89 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 30 Mar 2022 11:08:49 +0800 Subject: [PATCH 0639/2039] Update 2218-maximum-value-of-k-coins-from-piles.js --- 2218-maximum-value-of-k-coins-from-piles.js | 3 +++ 1 file changed, 3 insertions(+) diff --git a/2218-maximum-value-of-k-coins-from-piles.js b/2218-maximum-value-of-k-coins-from-piles.js index a31a94da..26b960fa 100644 --- a/2218-maximum-value-of-k-coins-from-piles.js +++ b/2218-maximum-value-of-k-coins-from-piles.js @@ -32,6 +32,9 @@ const maxValueOfCoins = function(piles, k) { const memo = Array.from({ length: n + 1 }, () => Array(k + 1).fill(null)) return helper(0, k) + // TC: O(n * m) + // n: length of piles + // m: sum(piles[i]), total elements of all piles function helper(i, k) { if(k == 0 || i === n) return 0 if(memo[i][k] != null) return memo[i][k] From 6b0a7f342a0efaf85524797d347ec45fda99d1bb Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 30 Mar 2022 11:55:28 +0800 Subject: [PATCH 0640/2039] Update 2218-maximum-value-of-k-coins-from-piles.js --- 2218-maximum-value-of-k-coins-from-piles.js | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/2218-maximum-value-of-k-coins-from-piles.js b/2218-maximum-value-of-k-coins-from-piles.js index 26b960fa..10f29d22 100644 --- a/2218-maximum-value-of-k-coins-from-piles.js +++ b/2218-maximum-value-of-k-coins-from-piles.js @@ -32,7 +32,8 @@ const maxValueOfCoins = function(piles, k) { const memo = Array.from({ length: n + 1 }, () => Array(k + 1).fill(null)) return helper(0, k) - // TC: O(n * m) + // TC: O(k * m) + // k: k // n: length of piles // m: sum(piles[i]), total elements of all piles function helper(i, k) { From e948ebe4d01b1755484f2be4be0aebaeb6e45756 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 31 Mar 2022 09:40:09 +0800 Subject: [PATCH 0641/2039] Create 2189-number-of-ways-to-build-house-of-cards.js --- 2189-number-of-ways-to-build-house-of-cards.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2189-number-of-ways-to-build-house-of-cards.js diff --git a/2189-number-of-ways-to-build-house-of-cards.js b/2189-number-of-ways-to-build-house-of-cards.js new file mode 100644 index 00000000..986c2152 --- /dev/null +++ b/2189-number-of-ways-to-build-house-of-cards.js @@ -0,0 +1,18 @@ +/** + * @param {number} n + * @return {number} + */ +const houseOfCards = function(n) { + const memo = Array.from({ length: n + 1 }, () => Array(n + 2).fill(null)) + return helper(n, n + 1) + + function helper(remain, preRow) { + if(remain === 0 || remain === 2) return 1 + if(memo[remain][preRow] != null) return memo[remain][preRow] + let res = 0 + for(let i = 5; i <= remain && i < preRow; i += 3) { + res += helper(remain - i, i) + } + return memo[remain][preRow] = res + } +}; From d1c8f76a88ec3f2e8e8d38093e7e08e46fdb9ffa Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Apr 2022 10:49:39 +0800 Subject: [PATCH 0642/2039] Update 479-largest-palindrome-product.js --- 479-largest-palindrome-product.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/479-largest-palindrome-product.js b/479-largest-palindrome-product.js index 43fb57ef..429c8aa4 100644 --- a/479-largest-palindrome-product.js +++ b/479-largest-palindrome-product.js @@ -1,3 +1,28 @@ +/** + * @param {number} n + * @return {number} + */ +function largestPalindrome(n) { + if(n === 1) return 9 + let max = BigInt(10 ** n - 1), min = max / 10n + 1n + for(let h = max; h >= min; h--) { + let left = h, right = 0n + for(let i = h; i !== 0n; ) { + right = right * 10n + i % 10n + i = i / 10n + left *= 10n + } + let pal = left + right + for(let i = max; i >= min; i--) { + let j = pal / i + if(j > i) break + if(pal % i === 0n) return pal % 1337n + } + } +} + +// another + /** * @param {number} n * @return {number} From 6e33cab422e22044cd38ee321f27376402b1dd67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Apr 2022 15:14:09 +0800 Subject: [PATCH 0643/2039] Update 866-prime-palindrome.js --- 866-prime-palindrome.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/866-prime-palindrome.js b/866-prime-palindrome.js index 1b2652f4..78d70c50 100644 --- a/866-prime-palindrome.js +++ b/866-prime-palindrome.js @@ -44,3 +44,30 @@ function isPrime(x) { } return true } + +// another + + +/** + * @param {number} n + * @return {number} + */ +const primePalindrome = function(n) { + if(n >= 8 && n <= 11) return 11 + + const rev = num => `${num}`.split('').reverse().join('') + for(let i = 1; i < 1e5; i++) { + let left = i, right = rev(left).slice(1) + const tmp = +(left + right) + if(tmp >= n && isPrime(tmp)) return tmp + } + + function isPrime(num) { + if(num <= 2) return num === 2 + if(num % 2 === 0) return false + for(let i = 3; i ** 2 <= num; i += 2) { + if(num % i === 0) return false + } + return true + } +}; From e7c6e75d0561f6cd679ad02a241d93e77413b404 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Apr 2022 21:57:32 +0800 Subject: [PATCH 0644/2039] Create 2224-minimum-number-of-operations-to-convert-time.js --- ...um-number-of-operations-to-convert-time.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 2224-minimum-number-of-operations-to-convert-time.js diff --git a/2224-minimum-number-of-operations-to-convert-time.js b/2224-minimum-number-of-operations-to-convert-time.js new file mode 100644 index 00000000..6b25bb4b --- /dev/null +++ b/2224-minimum-number-of-operations-to-convert-time.js @@ -0,0 +1,41 @@ +/** + * @param {string} current + * @param {string} correct + * @return {number} + */ +var convertTime = function(current, correct) { + const s = current.split(':').map(e => +e) + const t = correct.split(':').map(e => +e) + let res = 0 + // hour + if(s[0] < t[0]) res += t[0] - s[0] + else if(s[0] > t[0]) res += (24 - (s[0] - t[0])) + + // min + let delta = t[1] - s[1] + if(delta > 0) { + if(delta >= 15) { + res += ~~(delta / 15) + delta %= 15 + } + if(delta >= 5) { + res += ~~(delta / 5) + delta %= 5 + } + res += delta + } else if(delta < 0) { + res-- + delta += 60 + if(delta >= 15) { + res += ~~(delta / 15) + delta %= 15 + } + if(delta >= 5) { + res += ~~(delta / 5) + delta %= 5 + } + res += delta + } + + return res +}; From ab40986e1e98cd0e1167008b53e5ed19cc60d081 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Apr 2022 21:59:39 +0800 Subject: [PATCH 0645/2039] Create 2225-find-players-with-zero-or-one-losses.js --- 2225-find-players-with-zero-or-one-losses.js | 29 ++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2225-find-players-with-zero-or-one-losses.js diff --git a/2225-find-players-with-zero-or-one-losses.js b/2225-find-players-with-zero-or-one-losses.js new file mode 100644 index 00000000..7023be33 --- /dev/null +++ b/2225-find-players-with-zero-or-one-losses.js @@ -0,0 +1,29 @@ +/** + * @param {number[][]} matches + * @return {number[][]} + */ +var findWinners = function(matches) { + const win = {}, lose = {}, total = new Set(), ls = new Set() + for(const [w, l] of matches) { + if(win[w] == null) win[w] = 0 + win[w]++ + if(lose[l] == null) lose[l] = 0 + lose[l]++ + total.add(l) + total.add(w) + ls.add(l) + } + + const loseKeys = Object.keys(lose) + const a0 = [] + for(const e of total) { + if(!ls.has(e)) a0.push(e) + } + const a1 = [] + for(const e of loseKeys) { + if(lose[e] === 1) a1.push(e) + } + a0.sort((a, b) => a - b) + a1.sort((a, b) => a - b) + return [a0, a1] +}; From ca7645b1618b8500ada7d89ef5e090ab2b72dc1c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Apr 2022 22:03:48 +0800 Subject: [PATCH 0646/2039] Create 2226-maximum-candies-allocated-to-k-children.js --- ...maximum-candies-allocated-to-k-children.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2226-maximum-candies-allocated-to-k-children.js diff --git a/2226-maximum-candies-allocated-to-k-children.js b/2226-maximum-candies-allocated-to-k-children.js new file mode 100644 index 00000000..b744dc71 --- /dev/null +++ b/2226-maximum-candies-allocated-to-k-children.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} candies + * @param {number} k + * @return {number} + */ +const maximumCandies = function(candies, k) { + let max = 1e12; + let min = 0; + while (min != max) { + let mid = ~~((min + max + 1) / 2); + let cnt = 0; + for (let cand of candies) { + cnt += ~~(cand / mid); + }pnjj + if (cnt < k) { + max = mid - 1; + } else { + min = mid; + } + } + return min; +}; From 11eec63a7199f7470b3d808e5b65c762699ce155 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Apr 2022 22:34:24 +0800 Subject: [PATCH 0647/2039] Update 2226-maximum-candies-allocated-to-k-children.js --- 2226-maximum-candies-allocated-to-k-children.js | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/2226-maximum-candies-allocated-to-k-children.js b/2226-maximum-candies-allocated-to-k-children.js index b744dc71..51a205b3 100644 --- a/2226-maximum-candies-allocated-to-k-children.js +++ b/2226-maximum-candies-allocated-to-k-children.js @@ -4,14 +4,14 @@ * @return {number} */ const maximumCandies = function(candies, k) { - let max = 1e12; + let max = candies.reduce((ac, e) => ac + e, 0); let min = 0; - while (min != max) { - let mid = ~~((min + max + 1) / 2); + while (min < max) { + let mid = max - Math.floor((max - min) / 2); let cnt = 0; for (let cand of candies) { cnt += ~~(cand / mid); - }pnjj + } if (cnt < k) { max = mid - 1; } else { From fed23952182bd47c354582290051e13bf8358a5e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Apr 2022 20:05:52 +0800 Subject: [PATCH 0648/2039] Create 2223-sum-of-scores-of-built-strings.js --- 2223-sum-of-scores-of-built-strings.js | 28 ++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2223-sum-of-scores-of-built-strings.js diff --git a/2223-sum-of-scores-of-built-strings.js b/2223-sum-of-scores-of-built-strings.js new file mode 100644 index 00000000..18cc57f1 --- /dev/null +++ b/2223-sum-of-scores-of-built-strings.js @@ -0,0 +1,28 @@ +/** + * @param {string} s + * @return {number} + */ +var sumScores = function(s) { + function z_function(s) { + let n = s.length + let z = Array(n).fill(0) + let l = 0, r = 0 + for (let i = 1; i < n; i++) { + if (i <= r) z[i] = Math.min(r - i + 1, z[i - l]) + while (i + z[i] < n && s[z[i]] == s[i + z[i]]) { + z[i] += 1 + } + + if (i + z[i] - 1 > r) { + l = i + r = i + z[i] - 1 + } + + } + return z + } + + const sum = z_function(s).reduce((ac, e) => ac + e, 0) + return sum + s.length +}; + From 2927963c744ef0726c47f7209d2832d217959733 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 12 Apr 2022 22:19:32 +0800 Subject: [PATCH 0649/2039] Update 2226-maximum-candies-allocated-to-k-children.js --- ...maximum-candies-allocated-to-k-children.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/2226-maximum-candies-allocated-to-k-children.js b/2226-maximum-candies-allocated-to-k-children.js index 51a205b3..38ed2088 100644 --- a/2226-maximum-candies-allocated-to-k-children.js +++ b/2226-maximum-candies-allocated-to-k-children.js @@ -20,3 +20,23 @@ const maximumCandies = function(candies, k) { } return min; }; + +// another + +/** + * @param {number[]} candies + * @param {number} k + * @return {number} + */ +const maximumCandies = function(candies, k) { + let max = candies.reduce((ac, e) => ac + e, 0) + let min = 0 + while(min < max) { + const mid = max - Math.floor((max - min) /2) + let num = 0 + for(let e of candies) num += ~~(e / mid) + if(num < k) max = mid - 1 + else min = mid + } + return min +}; From e4b35875c5b31b8d751611079f3c7517678f1c24 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Apr 2022 13:06:53 +0800 Subject: [PATCH 0650/2039] Create 1011-capacity-to-ship-packages-within-d-days.js --- ...capacity-to-ship-packages-within-d-days.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 1011-capacity-to-ship-packages-within-d-days.js diff --git a/1011-capacity-to-ship-packages-within-d-days.js b/1011-capacity-to-ship-packages-within-d-days.js new file mode 100644 index 00000000..86b274e7 --- /dev/null +++ b/1011-capacity-to-ship-packages-within-d-days.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} weights + * @param {number} days + * @return {number} + */ +const shipWithinDays = function(weights, days) { + let l = Math.max(...weights) + let r = weights.reduce((ac, e) => ac + e, 0) + while(l < r) { + const mid = Math.floor((l + r) / 2) + if(valid(mid)) { + r = mid + } else l = mid + 1 + } + + return l + + function valid(mid) { + let res = 1, cur = 0 + for(let w of weights) { + if(cur + w > mid) { + cur = 0 + res++ + } + cur += w + } + return res <= days + } +}; From d7f68737eb07fbb34c592cad49edd8f435aeac66 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 14 Apr 2022 20:16:10 +0800 Subject: [PATCH 0651/2039] Create 1891-cutting-ribbons.js --- 1891-cutting-ribbons.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1891-cutting-ribbons.js diff --git a/1891-cutting-ribbons.js b/1891-cutting-ribbons.js new file mode 100644 index 00000000..23cd8b8c --- /dev/null +++ b/1891-cutting-ribbons.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} ribbons + * @param {number} k + * @return {number} + */ +const maxLength = function(ribbons, k) { + let l = 0, r = Math.max(...ribbons) + while(l < r) { + const mid = r - Math.floor((r - l) / 2) + if(valid(mid)) { + l = mid + } else r = mid - 1 + } + return l + + function valid(mid) { + let res = 0 + for(let e of ribbons) { + res += ~~(e / mid) + } + return res >= k + } +}; From 26530bc1436d35a1abdd16c15e4a4c0d3573d63e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 15 Apr 2022 16:00:03 +0800 Subject: [PATCH 0652/2039] Update 1608-special-array-with-x-elements-greater-than-or-equal-x.js --- ...with-x-elements-greater-than-or-equal-x.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1608-special-array-with-x-elements-greater-than-or-equal-x.js b/1608-special-array-with-x-elements-greater-than-or-equal-x.js index b9b51023..9866bd82 100644 --- a/1608-special-array-with-x-elements-greater-than-or-equal-x.js +++ b/1608-special-array-with-x-elements-greater-than-or-equal-x.js @@ -1,3 +1,29 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const specialArray = function(nums) { + let l = -1, r = 1001 + while(l <= r) { + const mid = r - Math.floor((r - l) / 2) + const tmp = valid(mid) + if(tmp === mid) return mid + else if(tmp > mid) l = mid + 1 + else r = mid - 1 + } + return -1 + + function valid(mid) { + let res = 0 + for(let e of nums) { + if(e >= mid) res++ + } + return res + } +}; + +// another + /** * @param {number[]} nums * @return {number} From 73847e3906cfe4fe2ecf317fccdcc052d22a0229 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 16 Apr 2022 23:37:57 +0800 Subject: [PATCH 0653/2039] Create 1283-find-the-smallest-divisor-given-a-threshold.js --- ...-the-smallest-divisor-given-a-threshold.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1283-find-the-smallest-divisor-given-a-threshold.js diff --git a/1283-find-the-smallest-divisor-given-a-threshold.js b/1283-find-the-smallest-divisor-given-a-threshold.js new file mode 100644 index 00000000..09a7a187 --- /dev/null +++ b/1283-find-the-smallest-divisor-given-a-threshold.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} threshold + * @return {number} + */ +const smallestDivisor = function(nums, threshold) { + let l = 1, r = 1e6 + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(valid(mid)) r = mid + else l = mid + 1 + } + return l + + function valid(mid) { + let res = 0 + for(let e of nums) res += Math.ceil(e / mid) + return res <= threshold + } +}; From 5af003430e64684b5985f22a99fbb301d380cec8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Apr 2022 16:50:03 +0800 Subject: [PATCH 0654/2039] Create 2246-longest-path-with-different-adjacent-characters.js --- ...path-with-different-adjacent-characters.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2246-longest-path-with-different-adjacent-characters.js diff --git a/2246-longest-path-with-different-adjacent-characters.js b/2246-longest-path-with-different-adjacent-characters.js new file mode 100644 index 00000000..62fbe3a2 --- /dev/null +++ b/2246-longest-path-with-different-adjacent-characters.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} parent + * @param {string} s + * @return {number} + */ +var longestPath = function(parent, s) { + let n = s.length, res = 0; + const {max} = Math + let children = Array.from({ length: n}, () => Array()); + for (let i = 1; i < n; ++i) children[parent[i]].push(i); + dfs(children, s, 0); + return res; + + function dfs(children, s, i) { + let big1 = 0, big2 = 0; + for (let j of (children[i] || [])) { + let cur = dfs(children, s, j); + if (s[i] == s[j]) continue; + if (cur > big2) big2 = cur; + if (big2 > big1) { + let tmp = big1 + big1 = big2 + big2 = tmp + }; + } + res = max(res, big1 + big2 + 1); + return big1 + 1; + } +}; + + From 3a1665dbad3f68113c06ac5702638c0b93344049 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Apr 2022 16:51:02 +0800 Subject: [PATCH 0655/2039] Create 2245-maximum-trailing-zeros-in-a-cornered-path.js --- ...ximum-trailing-zeros-in-a-cornered-path.js | 57 +++++++++++++++++++ 1 file changed, 57 insertions(+) create mode 100644 2245-maximum-trailing-zeros-in-a-cornered-path.js diff --git a/2245-maximum-trailing-zeros-in-a-cornered-path.js b/2245-maximum-trailing-zeros-in-a-cornered-path.js new file mode 100644 index 00000000..b2004bcb --- /dev/null +++ b/2245-maximum-trailing-zeros-in-a-cornered-path.js @@ -0,0 +1,57 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const maxTrailingZeros = function(grid) { + const g = grid + const m = g.length; + const n = g[0].length; + const ta = [...Array(m)].map(i => Array(n).fill(1)); + const tb = [...Array(m)].map(i => Array(n).fill(1)); + const tc = [...Array(m)].map(i => Array(n).fill(1)); + const td = [...Array(m)].map(i => Array(n).fill(1)); + + const c52 = (s) => { + let c5 = 0; + let c2 = 0; + while (s % 2 === 0) { + s = s / 2; + c2++; + } + while (s % 5 === 0) { + s = s / 5; + c5++; + } + return [c5, c2]; + } + + const c10 = ([c5, c2]) => { + return Math.min(c5, c2); + } + + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + ta[i][j] = (j === 0) ? c52(g[i][j]) : [c52(g[i][j])[0] + ta[i][j-1][0], c52(g[i][j])[1] + ta[i][j-1][1]]; + tb[i][j] = (i === 0) ? c52(g[i][j]) : [c52(g[i][j])[0] + tb[i-1][j][0], c52(g[i][j])[1] + tb[i-1][j][1]]; + } + } + + for (let i = m-1; i >= 0; i--) { + for (let j = n-1; j >= 0; j--) { + tc[i][j] = (j === n-1) ? c52(g[i][j]) : [c52(g[i][j])[0] + tc[i][j+1][0], c52(g[i][j])[1] + tc[i][j+1][1]]; // : ctz(hg(g[i][j]) * tc[i][j+1][0], tc[i][j+1][1]); // hg(g[i][j]) * tc[i][j+1]; + td[i][j] = (i === m-1) ? c52(g[i][j]) : [c52(g[i][j])[0] + td[i+1][j][0], c52(g[i][j])[1] + td[i+1][j][1]]; // : ctz(hg(g[i][j]) * td[i+1][j][0], td[i+1][j][1]); // hg(g[i][j]) * td[i+1][j]; + } + } + + let ret = 0; + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + let s1 = i === 0 ? c10(ta[i][j]) : c10([ta[i][j][0] + tb[i-1][j][0], ta[i][j][1] + tb[i-1][j][1]]); + let s2 = i === m - 1 ? c10(ta[i][j]) : c10([ta[i][j][0] + td[i+1][j][0], ta[i][j][1] + td[i+1][j][1]]); + let s3 = i === 0 ? c10(tc[i][j]) : c10([tc[i][j][0] + tb[i-1][j][0], tc[i][j][1] + tb[i-1][j][1]]); + let s4 = i === m - 1 ? c10(tc[i][j]) : c10([tc[i][j][0] + td[i+1][j][0], tc[i][j][1] + td[i+1][j][1]]); + ret = Math.max(ret, s1, s2, s3, s4); + } + } + return ret; +}; From 114e7056929ef229d31cedf9eb50ea0e1c2fcd60 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Apr 2022 16:51:30 +0800 Subject: [PATCH 0656/2039] Create 2244-minimum-rounds-to-complete-all-tasks.js --- 2244-minimum-rounds-to-complete-all-tasks.js | 23 ++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2244-minimum-rounds-to-complete-all-tasks.js diff --git a/2244-minimum-rounds-to-complete-all-tasks.js b/2244-minimum-rounds-to-complete-all-tasks.js new file mode 100644 index 00000000..102e1e54 --- /dev/null +++ b/2244-minimum-rounds-to-complete-all-tasks.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} tasks + * @return {number} + */ +const minimumRounds = function(tasks) { + let res = 0 + const hash = {} + for(let e of tasks) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const keys = Object.keys(hash).map(e => +e) + for(const k of keys) { + if(hash[k] / 3 >= 1) res += ~~(hash[k] / 3) + if(hash[k] % 3 === 2) res++ + if(hash[k] % 3 === 1) { + if(hash[k] >= 4) res++ + else return -1 + } + } + + return res +}; From 80370942bd632a63df7b406114a33bb463e62365 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Apr 2022 16:52:13 +0800 Subject: [PATCH 0657/2039] Create 2243-calculate-digit-sum-of-a-string.js --- 2243-calculate-digit-sum-of-a-string.js | 26 +++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2243-calculate-digit-sum-of-a-string.js diff --git a/2243-calculate-digit-sum-of-a-string.js b/2243-calculate-digit-sum-of-a-string.js new file mode 100644 index 00000000..f322e42c --- /dev/null +++ b/2243-calculate-digit-sum-of-a-string.js @@ -0,0 +1,26 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const digitSum = function(s, k) { + let cur = s + while(cur.length > k) { + const arr = [] + for(let i = 0; i < cur.length; i += k) { + let tmp = '' + for(let j = 0; j < k && i + j < cur.length; j++) { + tmp += cur[i + j] + } + arr.push(tmp) + } + arr.forEach((e, i) => { + let res = 0 + for(let ch of e) res += +ch + arr[i] = '' +res + }) + cur = arr.join('') + + } + return cur +}; From 7adf7e40006e58db77293b8d817baa266269f6e1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Apr 2022 20:58:42 +0800 Subject: [PATCH 0658/2039] Create 1300-sum-of-mutated-array-closest-to-target.js --- ...-sum-of-mutated-array-closest-to-target.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1300-sum-of-mutated-array-closest-to-target.js diff --git a/1300-sum-of-mutated-array-closest-to-target.js b/1300-sum-of-mutated-array-closest-to-target.js new file mode 100644 index 00000000..dd4a35f3 --- /dev/null +++ b/1300-sum-of-mutated-array-closest-to-target.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} arr + * @param {number} target + * @return {number} + */ +const findBestValue = function(arr, target) { + let l, r, mi, s = 0, m = -1; + for(let v of arr) { s += v; m = Math.max(m, v); } + if(s <= target) return m; + + for(l = 1, r = m; l < r;) { + mi = ~~((l+r)/2); + s = 0; + for(let v of arr) s += (v > mi) ? mi : v; + if(s >= target) r = mi; + else l = mi + 1; + } + // check if we are 1 step off the target + let s1=0,s2=0; + for(let v of arr) { + s1 += (v>l)?(l):v; + s2 += (v>l-1)?(l-1):v; + } + + return (Math.abs(s2-target) <= Math.abs(s1-target)) ? l-1 : l; +}; From bdc4cdbfe4143f6d1707a74d092218ebb40e00be Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Apr 2022 10:21:09 +0800 Subject: [PATCH 0659/2039] Update 1870-minimum-speed-to-arrive-on-time.js --- 1870-minimum-speed-to-arrive-on-time.js | 27 +++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1870-minimum-speed-to-arrive-on-time.js b/1870-minimum-speed-to-arrive-on-time.js index df7be0e5..9eebca9b 100644 --- a/1870-minimum-speed-to-arrive-on-time.js +++ b/1870-minimum-speed-to-arrive-on-time.js @@ -73,3 +73,30 @@ const minSpeedOnTime = function(dist, hour) { }; +// another + +/** + * @param {number[]} dist + * @param {number} hour + * @return {number} + */ +const minSpeedOnTime = function(dist, hour) { + let l = 1, r = 1e7 + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(!valid(mid)) l = mid + 1 + else r = mid + } + // console.log(l) + return valid(l) ? l : -1 + + function valid(mid) { + let res = 0 + for(let i = 0, n = dist.length; i < n; i++) { + const d = dist[i] + res += (i === n - 1 ? d / mid : Math.ceil(d / mid)) + } + return res <= hour + } +}; + From 741ad74273f77801d84ec77722a63fa8e3fd5a85 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Apr 2022 20:48:43 +0800 Subject: [PATCH 0660/2039] Create 1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.js --- ...ith-sum-less-than-or-equal-to-threshold.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.js diff --git a/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.js b/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.js new file mode 100644 index 00000000..6e3157ba --- /dev/null +++ b/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.js @@ -0,0 +1,30 @@ +/** + * @param {number[][]} mat + * @param {number} threshold + * @return {number} + */ +const maxSideLength = function (mat, threshold) { + let m = mat.length + let n = mat[0].length + const sum = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0)) + + let res = 0 + let len = 1 // square side length + + for (let i = 1; i <= m; i++) { + for (let j = 1; j <= n; j++) { + sum[i][j] = + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + mat[i - 1][j - 1] + + if ( + i >= len && + j >= len && + sum[i][j] - sum[i - len][j] - sum[i][j - len] + sum[i - len][j - len] <= + threshold + ) + res = len++ + } + } + + return res +} From 02f6470bd762036cf39cb1b163df79b7f09bc777 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Apr 2022 15:41:11 +0800 Subject: [PATCH 0661/2039] Update 2064-minimized-maximum-of-products-distributed-to-any-store.js --- ...um-of-products-distributed-to-any-store.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/2064-minimized-maximum-of-products-distributed-to-any-store.js b/2064-minimized-maximum-of-products-distributed-to-any-store.js index ac753600..577fe013 100644 --- a/2064-minimized-maximum-of-products-distributed-to-any-store.js +++ b/2064-minimized-maximum-of-products-distributed-to-any-store.js @@ -1,3 +1,32 @@ +/** + * @param {number} n + * @param {number[]} quantities + * @return {number} + */ +const minimizedMaximum = function(n, quantities) { + const m = quantities.length + let l = 0, r = Math.max(...quantities) + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(valid(mid)) r = mid + else l = mid + 1 + } + + return l + + function valid(mid) { + if(m > n) return false + let res = 0 + for (let i = 0; i < m; i++) { + res += Math.ceil(quantities[i] / mid) + } + return res <= n + } +}; + +// another + + /** * @param {number} n * @param {number[]} quantities From d7c576171c3f0dc4244e9d46800d1780fba850fe Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 21 Apr 2022 14:30:13 +0800 Subject: [PATCH 0662/2039] Update 1898-maximum-number-of-removable-characters.js --- ...-maximum-number-of-removable-characters.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1898-maximum-number-of-removable-characters.js b/1898-maximum-number-of-removable-characters.js index 77c297ac..043796cc 100644 --- a/1898-maximum-number-of-removable-characters.js +++ b/1898-maximum-number-of-removable-characters.js @@ -32,3 +32,34 @@ function is_valid(s, p, removable, cnt) { } return ind2 == len2 } + +// another + +/** + * @param {string} s + * @param {string} p + * @param {number[]} removable + * @return {number} + */ +const maximumRemovals = function(s, p, removable) { + let l = 0, r = removable.length + while(l < r) { + const mid = r - Math.floor((r - l) / 2) + if(valid(mid)) l = mid + else r = mid - 1 + } + return l + + function valid(mid) { + let arr = s.split('') + for (let i = 0; i < mid; i++) arr[removable[i]] = null + arr = arr.filter(e => e !== null) + + for(let i = 0, j = 0; i < arr.length && j < p.length;) { + if(arr[i] === p[j]) i++, j++ + else i++ + if(j === p.length) return true + } + return false + } +}; From 89403f4013e563b38a4f03018e9c12358c9e2695 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Apr 2022 09:36:54 +0800 Subject: [PATCH 0663/2039] Create 1552-magnetic-force-between-two-balls.js --- 1552-magnetic-force-between-two-balls.js | 34 ++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1552-magnetic-force-between-two-balls.js diff --git a/1552-magnetic-force-between-two-balls.js b/1552-magnetic-force-between-two-balls.js new file mode 100644 index 00000000..8596a31a --- /dev/null +++ b/1552-magnetic-force-between-two-balls.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} position + * @param {number} m + * @return {number} + */ +const maxDistance = function(position, m) { + position.sort((a, b) => a - b) + const n = position.length + let l = Infinity, r = 1 + for (let i = 1; i < n; i++) { + if (position[i] - position[i - 1] < l) l = position[i] - position[i - 1] + } + r = position[n - 1] - position[0] + while(l < r) { + const mid = r - Math.floor((r - l) / 2) + if(valid(mid)) l = mid + else r = mid - 1 + } + return l + + function valid(mid) { + let res = 1, cur = 0 + for (let i = 1; i < n; i++) { + const delta = position[i] - position[i - 1] + cur += delta + if (cur >= mid) { + res++ + cur = 0 + } + if(res === m) return true + } + return false + } +}; From d481da81ff4c3218995be5df090465f3f00aada5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 23 Apr 2022 21:38:44 +0800 Subject: [PATCH 0664/2039] Update 1802-maximum-value-at-a-given-index-in-a-bounded-array.js --- ...lue-at-a-given-index-in-a-bounded-array.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js index 8788b9cf..d9243f96 100644 --- a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js +++ b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js @@ -1,3 +1,31 @@ +/** + * @param {number} n + * @param {number} index + * @param {number} maxSum + * @return {number} + */ +const maxValue = function (n, index, maxSum) { + maxSum -= n; + let left = 0, right = maxSum, mid; + while (left < right) { + mid = Math.floor((left + right + 1) / 2); + if (v2(mid) <= maxSum)left = mid; + else right = mid - 1; + } + return left + 1; + + function v2(a) { + let b = Math.max(a - index, 0); + let res = (a + b) * (a - b + 1) / 2; + b = Math.max(a - ((n - 1) - index), 0); + res += (a + b) * (a - b + 1) / 2; + return res - a; + } +} + +// another + + /** * @param {number} n * @param {number} index From be10a57c9a4c6f2815771f3b021c3c45dbe02daa Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 23 Apr 2022 22:02:40 +0800 Subject: [PATCH 0665/2039] Update 1802-maximum-value-at-a-given-index-in-a-bounded-array.js --- ...alue-at-a-given-index-in-a-bounded-array.js | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js index d9243f96..64d18833 100644 --- a/1802-maximum-value-at-a-given-index-in-a-bounded-array.js +++ b/1802-maximum-value-at-a-given-index-in-a-bounded-array.js @@ -8,18 +8,18 @@ const maxValue = function (n, index, maxSum) { maxSum -= n; let left = 0, right = maxSum, mid; while (left < right) { - mid = Math.floor((left + right + 1) / 2); - if (v2(mid) <= maxSum)left = mid; - else right = mid - 1; + const mid = right - Math.floor((right - left) / 2); + if (valid(mid))left = mid; + else right = mid - 1; } return left + 1; - function v2(a) { - let b = Math.max(a - index, 0); - let res = (a + b) * (a - b + 1) / 2; - b = Math.max(a - ((n - 1) - index), 0); - res += (a + b) * (a - b + 1) / 2; - return res - a; + function valid(mid) { + let b = Math.max(mid - index, 0); + let res = (mid + b) * (mid - b + 1) / 2; + b = Math.max(mid - ((n - 1) - index), 0); + res += (mid + b) * (mid - b + 1) / 2; + return res - mid <= maxSum; } } From 68da763a38858c296adf763000169bf5d92d9d15 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Apr 2022 09:14:27 +0800 Subject: [PATCH 0666/2039] Create 1482-minimum-number-of-days-to-make-m-bouquets.js --- ...nimum-number-of-days-to-make-m-bouquets.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 1482-minimum-number-of-days-to-make-m-bouquets.js diff --git a/1482-minimum-number-of-days-to-make-m-bouquets.js b/1482-minimum-number-of-days-to-make-m-bouquets.js new file mode 100644 index 00000000..15c4c10c --- /dev/null +++ b/1482-minimum-number-of-days-to-make-m-bouquets.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} bloomDay + * @param {number} m + * @param {number} k + * @return {number} + */ +const minDays = function(bloomDay, m, k) { + const n = bloomDay.length + let l = -1, r = Math.max(...bloomDay) + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(valid(mid)) r = mid + else l = mid + 1 + } + return valid(l) ? l : -1 + + function valid(mid) { + let res = 0, cur = 0 + for (let i = 0; i < n; i++) { + const e = bloomDay[i] + if(e <= mid) { + cur++ + if(cur >= k) { + res++ + cur = 0 + } + } else { + cur = 0 + } + } + return res >= m + } +}; From 1eb89d4b4a2a599ce3f85ddf156c5ff8e70b0cb6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Apr 2022 13:38:34 +0800 Subject: [PATCH 0667/2039] Create 2250-count-number-of-rectangles-containing-each-point.js --- ...ber-of-rectangles-containing-each-point.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 2250-count-number-of-rectangles-containing-each-point.js diff --git a/2250-count-number-of-rectangles-containing-each-point.js b/2250-count-number-of-rectangles-containing-each-point.js new file mode 100644 index 00000000..bd1e3a91 --- /dev/null +++ b/2250-count-number-of-rectangles-containing-each-point.js @@ -0,0 +1,47 @@ +/** + * @param {number[][]} rectangles + * @param {number[][]} points + * @return {number[]} + */ +function countRectangles(rect, points) { + const hash = {} + for(let [y, x] of rect) { + if(hash[x] == null) hash[x] = [] + hash[x].push(y) + } + const keys = Object.keys(hash).map(e => +e) + for(const k of keys) { + hash[k].sort((a, b) => a - b) + } + keys.sort((a, b) => a - b) + const res = [] + const n = keys.length + // console.log(keys, hash) + for(const [y, x] of points) { + let v = 0 + const idx = helper(keys, x) + for(let i = idx; i < n; i++) { + const k = keys[i] + const p = helper(hash[k], y) + v += p === hash[k].length ? 0 : hash[k].length - p + } + res.push(v) + } + + return res + + function helper(arr, val) { + let l = 0, r = arr.length + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(valid(mid)) r = mid + else l = mid + 1 + } + // console.log(arr, val, l) + return l + + function valid(mid) { + return arr[mid] >= val + } + } +} From d4e2bdafe962dc11d721cc11389d3119853cabd6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Apr 2022 14:55:08 +0800 Subject: [PATCH 0668/2039] Create 2251-number-of-flowers-in-full-bloom.js --- 2251-number-of-flowers-in-full-bloom.js | 27 +++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2251-number-of-flowers-in-full-bloom.js diff --git a/2251-number-of-flowers-in-full-bloom.js b/2251-number-of-flowers-in-full-bloom.js new file mode 100644 index 00000000..13158e59 --- /dev/null +++ b/2251-number-of-flowers-in-full-bloom.js @@ -0,0 +1,27 @@ +/** + * @param {number[][]} flowers + * @param {number[]} persons + * @return {number[]} + */ +const fullBloomFlowers = function(flowers, persons) { + const arr = [] + for(const [s, e] of flowers) { + arr.push([s, 1]) + arr.push([e, 3]) + } + for(let i = 0; i < persons.length; i++) { + arr.push([persons[i], 2, i]) + } + arr.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + const res = [] + let cnt = 0 + for(let e of arr) { + if(e[1] === 1) cnt++ + else if(e[1] === 3) cnt-- + else { + res[e[2]] = cnt + } + } + + return res +}; From d8d4564b8c516404568ce26a12dbbb06811c6d49 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Apr 2022 16:22:57 +0800 Subject: [PATCH 0669/2039] Create 2249-count-lattice-points-inside-a-circle.js --- 2249-count-lattice-points-inside-a-circle.js | 22 ++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2249-count-lattice-points-inside-a-circle.js diff --git a/2249-count-lattice-points-inside-a-circle.js b/2249-count-lattice-points-inside-a-circle.js new file mode 100644 index 00000000..273add11 --- /dev/null +++ b/2249-count-lattice-points-inside-a-circle.js @@ -0,0 +1,22 @@ +/** + * @param {number[][]} circles + * @return {number} + */ +var countLatticePoints = function(circles) { + const set = new Set() + for(let arr of circles) helper(arr) + return set.size + + function helper(arr) { + const [cx, cy, r] = arr + let bottomLeftX = cx - r, bottomLeftY = cy - r + let topRightX = cx + r, topRightY = cy + r + for(let i = bottomLeftX; i <= topRightX; i++) { + for(let j = bottomLeftY; j <= topRightY; j++) { + if (Math.sqrt((i - cx) ** 2 + (j - cy) ** 2) <= r) { + set.add(`${i},${j}`) + } + } + } + } +}; From 12877c17d22e03c7f88a184c688314fc1e769322 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Apr 2022 16:24:34 +0800 Subject: [PATCH 0670/2039] Create 2248-intersection-of-multiple-arrays.js --- 2248-intersection-of-multiple-arrays.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2248-intersection-of-multiple-arrays.js diff --git a/2248-intersection-of-multiple-arrays.js b/2248-intersection-of-multiple-arrays.js new file mode 100644 index 00000000..14f26787 --- /dev/null +++ b/2248-intersection-of-multiple-arrays.js @@ -0,0 +1,16 @@ +/** + * @param {number[][]} nums + * @return {number[]} + */ +var intersection = function(nums) { + let set = new Set(nums[0]) + for (let i = 1; i < nums.length; i++) { + const r = nums[i] + const tmp = new Set() + for(let e of r) { + if(set.has(e)) tmp.add(e) + } + set = tmp + } + return Array.from(set).sort((a, b) => a - b) +}; From 7b87f2fd38f913d5dab161cb1be61977f1e3a1f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Apr 2022 11:33:22 +0800 Subject: [PATCH 0671/2039] Update 1231-divide-chocolate.js --- 1231-divide-chocolate.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1231-divide-chocolate.js b/1231-divide-chocolate.js index 3170ce2c..ea4d1768 100644 --- a/1231-divide-chocolate.js +++ b/1231-divide-chocolate.js @@ -21,3 +21,34 @@ const maximizeSweetness = function (sweetness, K) { } return left } + +// another + +/** + * @param {number[]} sweetness + * @param {number} K + * @return {number} + */ +const maximizeSweetness = function(sweetness, K) { + let l = 1, r = 10 ** 9 + while(l < r) { + const mid = r - Math.floor((r - l) / 2) + if(valid(mid)) l = mid + else r = mid - 1 + } + return l + + function valid(mid) { + let res = 0, cur = 0 + const n = sweetness.length + for(let i = 0; i < n; i++) { + const e = sweetness[i] + cur += e + if(cur >= mid) { + res++ + cur = 0 + } + } + return res >= K + 1 + } +}; From 8e206ddf97c33119a00a758e20c46efd97f1b254 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Apr 2022 10:17:02 +0800 Subject: [PATCH 0672/2039] Create 1201-ugly-number-iii.js --- 1201-ugly-number-iii.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 1201-ugly-number-iii.js diff --git a/1201-ugly-number-iii.js b/1201-ugly-number-iii.js new file mode 100644 index 00000000..b2d7011a --- /dev/null +++ b/1201-ugly-number-iii.js @@ -0,0 +1,30 @@ +/** + * @param {number} n + * @param {number} a + * @param {number} b + * @param {number} c + * @return {number} + */ +const nthUglyNumber = function(n, a, b, c) { + let lo = 1, hi = 2 * 1e9; + const { floor: f } = Math + let ab = a * b / gcd(a, b); + let bc = b * c / gcd(b, c); + let ac = a * c / gcd(a, c); + let abc = a * bc / gcd(a, bc); + while(lo < hi) { + let mid = lo + Math.floor((hi - lo) / 2); + if(valid(mid)) hi = mid; + else lo = mid + 1; + } + return lo; + + function valid(mid) { + let res = f(mid / a) + f(mid / b) + f(mid / c) - f(mid / ab) - f(mid / bc) - f(mid / ac) + f(mid / abc) + return res >= n + } + + function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) + } +}; From 533bc708343446f4192f91b99470c86f61886f7c Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Apr 2022 13:30:13 +0800 Subject: [PATCH 0673/2039] Update 1648-sell-diminishing-valued-colored-balls.js --- 1648-sell-diminishing-valued-colored-balls.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1648-sell-diminishing-valued-colored-balls.js b/1648-sell-diminishing-valued-colored-balls.js index b0d3d636..62ecf6ee 100644 --- a/1648-sell-diminishing-valued-colored-balls.js +++ b/1648-sell-diminishing-valued-colored-balls.js @@ -65,3 +65,34 @@ const maxProfit = function (inventory, orders) { return sum % mod } + +// another + +/** + * @param {number[]} inventory + * @param {number} orders + * @return {number} + */ +var maxProfit = function(inventory, orders) { + inventory.sort((a, b) => b - a) + const mod = BigInt(1e9 + 7), n = BigInt(inventory.length) + inventory = inventory.map(e => BigInt(e)) + orders = BigInt(orders) + let cur = BigInt(inventory[0]), res = 0n, i = 0n + const min = (a, b) => a > b ? b : a + while(orders) { + while(i < n && inventory[i] === cur) i++ + let next = i === n ? 0n : inventory[i] + let h = cur - next, r = 0n, cnt = min(orders, i * h) + if (orders < i * h) { + h = orders / i + r = orders % i + } + let val = cur - h + res = (res + (cur + val + 1n) * h / 2n * i + val * r) % mod + orders -= cnt + cur = next + } + + return res +}; From 81c315e0391d16b34abfb7d93e35cb5e4ec0543b Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Apr 2022 17:01:34 +0800 Subject: [PATCH 0674/2039] Update 1648-sell-diminishing-valued-colored-balls.js --- 1648-sell-diminishing-valued-colored-balls.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/1648-sell-diminishing-valued-colored-balls.js b/1648-sell-diminishing-valued-colored-balls.js index 62ecf6ee..9707f929 100644 --- a/1648-sell-diminishing-valued-colored-balls.js +++ b/1648-sell-diminishing-valued-colored-balls.js @@ -96,3 +96,39 @@ var maxProfit = function(inventory, orders) { return res }; + +// another + +/** + * @param {number[]} inventory + * @param {number} orders + * @return {number} + */ +const maxProfit = function (inventory, orders) { + inventory.sort((a, b) => b - a) + const mod = BigInt(1e9 + 7), + n = BigInt(inventory.length) + inventory = inventory.map((e) => BigInt(e)) + orders = BigInt(orders) + let cur = BigInt(inventory[0]), + res = 0n, + i = 0n + const min = (a, b) => (a > b ? b : a) + while (orders) { + while (i < n && inventory[i] === cur) i++ + let next = i === n ? 0n : inventory[i] + let h = cur - next, + r = 0n, + cnt = min(orders, i * h) + if (orders < i * h) { + h = orders / i + r = orders % i + } + let val = cur - h + res = (res + (((cur + val + 1n) * h) / 2n) * i + val * r) % mod + orders -= cnt + cur = next + } + + return res +} From cdab9788e76ec950c84b61105d576245c14e5863 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Apr 2022 22:42:17 +0800 Subject: [PATCH 0675/2039] Update 1648-sell-diminishing-valued-colored-balls.js --- 1648-sell-diminishing-valued-colored-balls.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1648-sell-diminishing-valued-colored-balls.js b/1648-sell-diminishing-valued-colored-balls.js index 9707f929..662d9cbb 100644 --- a/1648-sell-diminishing-valued-colored-balls.js +++ b/1648-sell-diminishing-valued-colored-balls.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} inventory + * @param {number} orders + * @return {number} + */ +const maxProfit = function(inventory, orders) { + inventory = inventory.map(e => BigInt(e)) + orders = BigInt(orders) + let l = 0n, r = BigInt(1e9 + 7) + while(l < r) { + const mid = l + (r - l) / 2n + if(valid(mid)) l = mid + 1n + else r = mid + } + + // console.log(l) + const mod = BigInt(1e9 + 7) + let t = l, res = 0n, cnt = 0n + for(const e of inventory) { + if(e <= t) continue + cnt += e - t + res = (res + (t + 1n + e) * (e - t) / 2n) % mod + } + + res = (res + (orders - cnt) * t) % mod + + return res + function valid(mid) { + let res = 0n + for(const e of inventory) { + if(e > mid) res += e - mid + } + return res > orders + } +}; + +// another + /** * @param {number[]} inventory * @param {number} orders From 16a872cc8f8959ac2dbaa4d0b4fc2c4ea6dd89ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Apr 2022 22:55:41 +0800 Subject: [PATCH 0676/2039] Update 1648-sell-diminishing-valued-colored-balls.js --- 1648-sell-diminishing-valued-colored-balls.js | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/1648-sell-diminishing-valued-colored-balls.js b/1648-sell-diminishing-valued-colored-balls.js index 662d9cbb..f38bf0b2 100644 --- a/1648-sell-diminishing-valued-colored-balls.js +++ b/1648-sell-diminishing-valued-colored-balls.js @@ -4,9 +4,10 @@ * @return {number} */ const maxProfit = function(inventory, orders) { + const bigIntMax = (...args) => args.reduce((m, e) => e > m ? e : m); inventory = inventory.map(e => BigInt(e)) orders = BigInt(orders) - let l = 0n, r = BigInt(1e9 + 7) + let l = 0n, r = bigIntMax(...inventory) while(l < r) { const mid = l + (r - l) / 2n if(valid(mid)) l = mid + 1n @@ -25,6 +26,7 @@ const maxProfit = function(inventory, orders) { res = (res + (orders - cnt) * t) % mod return res + function valid(mid) { let res = 0n for(const e of inventory) { From 55bde14e2fa2bb62832e809c731fbe572ce02f7c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Apr 2022 11:52:27 +0800 Subject: [PATCH 0677/2039] Update 2141-maximum-running-time-of-n-computers.js --- 2141-maximum-running-time-of-n-computers.js | 32 +++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2141-maximum-running-time-of-n-computers.js b/2141-maximum-running-time-of-n-computers.js index 762b70b4..d71ebb67 100644 --- a/2141-maximum-running-time-of-n-computers.js +++ b/2141-maximum-running-time-of-n-computers.js @@ -1,3 +1,35 @@ +/** + * @param {number} n + * @param {number[]} batteries + * @return {number} + */ +const maxRunTime = function(n, batteries) { + n = BigInt(n) + batteries = batteries.map(e => BigInt(e)) + const sum = batteries.reduce((ac, e) => ac + e, 0n) + let l = 0n, r = sum / n + while(l < r) { + const mid = r - (r - l) / 2n + if(valid(mid)) l = mid + else r = mid - 1n + } + + return l + + function valid(mid) { + let curSum = 0n, target = mid * n + for(const e of batteries) { + curSum += e > mid ? mid : e + if(curSum >= target) return true + } + return false + } +}; + + +// another + + /** * @param {number} n * @param {number[]} batteries From 97e019e5fc4b7760fe076808076a14c8ee1f3653 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 29 Apr 2022 23:01:45 +0800 Subject: [PATCH 0678/2039] Update 2250-count-number-of-rectangles-containing-each-point.js --- ...ber-of-rectangles-containing-each-point.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/2250-count-number-of-rectangles-containing-each-point.js b/2250-count-number-of-rectangles-containing-each-point.js index bd1e3a91..b76d92e0 100644 --- a/2250-count-number-of-rectangles-containing-each-point.js +++ b/2250-count-number-of-rectangles-containing-each-point.js @@ -1,3 +1,39 @@ +/** + * @param {number[][]} rectangles + * @param {number[][]} points + * @return {number[]} + */ +const countRectangles = function(rectangles, points) { + const rect = rectangles + const matrix = Array.from({ length: 101 }, () => []) + for(const [x, y] of rect) { + matrix[y].push(x) + } + for(const row of matrix) row.sort((a, b) => a - b) + const res = [] + + for(const [x, y] of points) { + + let cnt = 0 + for(let i = y; i <= 100; i++) { + const arr = matrix[i], n = arr.length + let l = 0, r = n + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(mid === n || arr[mid] >= x) r = mid + else l = mid + 1 + } + cnt += n - l + } + + res.push(cnt) + } + + return res +}; + +// another + /** * @param {number[][]} rectangles * @param {number[][]} points From 0b70750ce6820d79a24d54744ab59773cdd37137 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 30 Apr 2022 19:44:10 +0800 Subject: [PATCH 0679/2039] Update 1996-the-number-of-weak-characters-in-the-game.js --- ...e-number-of-weak-characters-in-the-game.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1996-the-number-of-weak-characters-in-the-game.js b/1996-the-number-of-weak-characters-in-the-game.js index e5ea1f78..383d457e 100644 --- a/1996-the-number-of-weak-characters-in-the-game.js +++ b/1996-the-number-of-weak-characters-in-the-game.js @@ -1,3 +1,35 @@ +/** + * @param {number[][]} properties + * @return {number} + */ +const numberOfWeakCharacters = function(properties) { + const props = properties, n = props.length, maxDefFromRight = Array(n) + props.sort((a, b) => a[0] - b[0]) + for(let max = 0, i = n - 1; i >= 0; i--) { + max = Math.max(max, props[i][1]) + maxDefFromRight[i] = max + } + let res = 0 + + for(let i = 0; i < n; i++) { + const cur = props[i] + let l = i, r = n + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(props[mid][0] > props[i][0]) r = mid + else l = mid + 1 + } + + if(l < n && maxDefFromRight[l] > props[i][1]) { + res++ + } + } + + return res +}; + +// another + /** * @param {number[][]} properties * @return {number} From 4e060428ba85e46755c12fc5df8df37ab079b064 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 May 2022 12:12:15 +0800 Subject: [PATCH 0680/2039] Create 2262-total-appeal-of-a-string.js --- 2262-total-appeal-of-a-string.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2262-total-appeal-of-a-string.js diff --git a/2262-total-appeal-of-a-string.js b/2262-total-appeal-of-a-string.js new file mode 100644 index 00000000..799c6884 --- /dev/null +++ b/2262-total-appeal-of-a-string.js @@ -0,0 +1,18 @@ +/** + * @param {string} s + * @return {number} + */ +var appealSum = function(s) { + const cnt = Array(26).fill(-1); + let ans = 0; + let n = s.length; + const a = 'a'.charCodeAt(0) + for (let i = 0; i < n; i++) { + let tmp = n - i; + if (cnt[s[i].charCodeAt(0) - a] !== -1) tmp += (i - cnt[s[i].charCodeAt(0) - a] - 1) * (n - i); + else tmp += i * (n - i); + ans += tmp; + cnt[s[i].charCodeAt(0) - a] = i; + } + return ans; +}; From c604488863bc6808829def8a8408785555d818fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 May 2022 12:12:58 +0800 Subject: [PATCH 0681/2039] Create 2261-k-divisible-elements-subarrays.js --- 2261-k-divisible-elements-subarrays.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2261-k-divisible-elements-subarrays.js diff --git a/2261-k-divisible-elements-subarrays.js b/2261-k-divisible-elements-subarrays.js new file mode 100644 index 00000000..8b930531 --- /dev/null +++ b/2261-k-divisible-elements-subarrays.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} p + * @return {number} + */ +const countDistinct = function(nums, k, p) { + let ans = 0; + const se = new Set(); + let n = nums.length; + for (let i = 0; i < n; i++) { + let tmp = ""; + let cnt = 0; + for (let j = i; j < n; j++) { + if (nums[j] % p == 0) + cnt++; + if (cnt <= k) { + tmp = tmp + (nums[j]) + "-"; + se.add(tmp); + } else break; + } + } + return se.size; +}; From 1f8bf1f3839d72a18e4884d40ac645e03a58d93d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 May 2022 12:16:10 +0800 Subject: [PATCH 0682/2039] Create 2260-minimum-consecutive-cards-to-pick-up.js --- 2260-minimum-consecutive-cards-to-pick-up.js | 25 ++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2260-minimum-consecutive-cards-to-pick-up.js diff --git a/2260-minimum-consecutive-cards-to-pick-up.js b/2260-minimum-consecutive-cards-to-pick-up.js new file mode 100644 index 00000000..bb2bc53e --- /dev/null +++ b/2260-minimum-consecutive-cards-to-pick-up.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} cards + * @return {number} + */ +var minimumCardPickup = function(cards) { + const hash = {}, n = cards.length + for(let i = 0; i < n; i++) { + const cur = cards[i] + if(hash[cur] == null) hash[cur] = [] + hash[cur].push(i) + } + let res = Infinity + + Object.keys(hash).forEach(k => { + const arr = hash[k] + const len = arr.length + for(let i = 1; i < len; i++) { + res = Math.min(res, arr[i] - arr[i - 1] + 1) + } + + }) + + + return res === Infinity ? -1 : res +}; From b956349754766a25938b9c78fc0eca7f69ad5231 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 May 2022 12:16:42 +0800 Subject: [PATCH 0683/2039] Create 2259-remove-digit-from-number-to-maximize-result.js --- ...ve-digit-from-number-to-maximize-result.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2259-remove-digit-from-number-to-maximize-result.js diff --git a/2259-remove-digit-from-number-to-maximize-result.js b/2259-remove-digit-from-number-to-maximize-result.js new file mode 100644 index 00000000..d7bc3daa --- /dev/null +++ b/2259-remove-digit-from-number-to-maximize-result.js @@ -0,0 +1,19 @@ +/** + * @param {string} number + * @param {character} digit + * @return {string} + */ +const removeDigit = function(number, digit) { + const arr = number.split('') + const idxArr = [] + arr.forEach((e,i) => { + if(e === digit) idxArr.push(i) + }) + const res = [] + for(const i of idxArr) { + const clone = arr.slice() + clone.splice(i, 1) + res.push(clone.join('')) + } + return res.reduce((ac, e) => e > ac ? e : ac, res[0]) +}; From 5c46a06ebefaa0a692e636bcf10ad03397ed56c4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 May 2022 20:09:37 +0800 Subject: [PATCH 0684/2039] Update 354-russian-doll-envelopes.js --- 354-russian-doll-envelopes.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/354-russian-doll-envelopes.js b/354-russian-doll-envelopes.js index bb10c078..efdd4fa9 100644 --- a/354-russian-doll-envelopes.js +++ b/354-russian-doll-envelopes.js @@ -1,3 +1,32 @@ +/** + * @param {number[][]} envelopes + * @return {number} + */ +const maxEnvelopes = function(envelopes) { + const env = envelopes + env.sort((a, b) => a[0] - b[0] || b[1] - a[1]) + const stk = [] + for(const e of env) { + if(stk.length === 0 || e[1] > stk[stk.length - 1][1]) { + stk.push(e) + continue + } + let l = 0, r = stk.length - 1 + while(l < r) { + const mid = l + Math.floor((r - l) / 2) + if(stk[mid][1] < e[1]) l = mid + 1 + else r = mid + } + + stk[l] = e + } + + return stk.length +}; + +// another + + /** * @param {number[][]} envelopes * @return {number} From e007b7d797ac7b135d45ece0253fb179bd0bac5d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 2 May 2022 20:11:25 +0800 Subject: [PATCH 0685/2039] Update 543-diameter-of-binary-tree.js --- 543-diameter-of-binary-tree.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/543-diameter-of-binary-tree.js b/543-diameter-of-binary-tree.js index aa2efec2..acf2deac 100755 --- a/543-diameter-of-binary-tree.js +++ b/543-diameter-of-binary-tree.js @@ -50,3 +50,30 @@ const diameterOfBinaryTree = function(root) { } }; +// another + +/** + * 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} + */ +const diameterOfBinaryTree = function(root) { + let res = -Infinity + dfs(root) + return res + function dfs(node) { + if(node == null) return -1 + const left = dfs(node.left) + const right = dfs(node.right) + res = Math.max(res, left + right + 2) + return Math.max(left, right) + 1 + } +}; + From 88d16d907078269aa3094865adde8d16e73e81e6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 3 May 2022 20:01:56 +0800 Subject: [PATCH 0686/2039] Create 1522-diameter-of-n-ary-tree.js --- 1522-diameter-of-n-ary-tree.js | 36 ++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 1522-diameter-of-n-ary-tree.js diff --git a/1522-diameter-of-n-ary-tree.js b/1522-diameter-of-n-ary-tree.js new file mode 100644 index 00000000..e573be5e --- /dev/null +++ b/1522-diameter-of-n-ary-tree.js @@ -0,0 +1,36 @@ +/** + * // Definition for a Node. + * function Node(val, children) { + * this.val = val === undefined ? 0 : val; + * this.children = children === undefined ? [] : children; + * }; + */ + +/** + * @param {Node} root + * @return {number} + */ +var diameter = function(root) { + let res = 0 + dfs(root) + return res + function dfs(node) { + if(node == null) return 0 + const arr = [] + for(const child of node.children) { + const tmp = dfs(child) + arr.push(tmp) + } + let max1 = 0, max2 = 0 + for(const e of arr) { + if(e > max1) { + max2 = max1 + max1 = e + } else if(e > max2) { + max2 = e + } + } + res = Math.max(res, max1 + max2) + return max1 + 1 + } +}; From 64529983792b5e4325bbeab34b12547639bfce9a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 3 May 2022 20:06:47 +0800 Subject: [PATCH 0687/2039] Update 1522-diameter-of-n-ary-tree.js --- 1522-diameter-of-n-ary-tree.js | 16 +++++++--------- 1 file changed, 7 insertions(+), 9 deletions(-) diff --git a/1522-diameter-of-n-ary-tree.js b/1522-diameter-of-n-ary-tree.js index e573be5e..864b1c25 100644 --- a/1522-diameter-of-n-ary-tree.js +++ b/1522-diameter-of-n-ary-tree.js @@ -14,22 +14,20 @@ var diameter = function(root) { let res = 0 dfs(root) return res + function dfs(node) { if(node == null) return 0 - const arr = [] + let max1 = 0, max2 = 0 for(const child of node.children) { const tmp = dfs(child) - arr.push(tmp) - } - let max1 = 0, max2 = 0 - for(const e of arr) { - if(e > max1) { + if(tmp > max1) { max2 = max1 - max1 = e - } else if(e > max2) { - max2 = e + max1 = tmp + } else if(tmp > max2) { + max2 = tmp } } + res = Math.max(res, max1 + max2) return max1 + 1 } From 8a3b68a8e01aea766cb6639bf90b12bb6f9bbd69 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 5 May 2022 22:42:04 +0800 Subject: [PATCH 0688/2039] Update 2049-count-nodes-with-the-highest-score.js --- 2049-count-nodes-with-the-highest-score.js | 32 ++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2049-count-nodes-with-the-highest-score.js b/2049-count-nodes-with-the-highest-score.js index cc8176fc..5be74015 100644 --- a/2049-count-nodes-with-the-highest-score.js +++ b/2049-count-nodes-with-the-highest-score.js @@ -24,3 +24,35 @@ const countHighestScoreNodes = function(parents) { const maxKey = Math.max(...Object.keys(hash)) return hash[maxKey] }; + +// another + +/** + * @param {number[]} parents + * @return {number} + */ +const countHighestScoreNodes = function(parents) { + const n = parents.length, hash = {}, graph = {} + for(let i = 1; i < n; i++) { + if(graph[parents[i]] == null) graph[parents[i]] = [] + graph[parents[i]].push(i) + } + + dfs(0) + const mk = Math.max(...Object.keys(hash)) + return hash[mk] + + function dfs(i) { + let num = 0, prod = 1 + for(const e of (graph[i] || []) ) { + const tmp = dfs(e) + num += tmp + prod *= tmp + } + + if(n - 1 - num > 0) prod *= (n - 1 - num) + hash[prod] = (hash[prod] || 0) + 1 + + return num + 1 + } +}; From 4270cf9fd8f9bff63e6d923cb20ac5eced6c4205 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 May 2022 21:25:02 +0800 Subject: [PATCH 0689/2039] Create 1211-queries-quality-and-percentage.sql --- 1211-queries-quality-and-percentage.sql | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 1211-queries-quality-and-percentage.sql diff --git a/1211-queries-quality-and-percentage.sql b/1211-queries-quality-and-percentage.sql new file mode 100644 index 00000000..904006a7 --- /dev/null +++ b/1211-queries-quality-and-percentage.sql @@ -0,0 +1,9 @@ +# Write your MySQL query statement below +SELECT + query_name, + ROUND(AVG(rating / position), 2) AS quality, + ROUND(AVG(rating < 3) * 100, 2) AS poor_query_percentage +FROM + Queries +GROUP BY + query_name; From ed20b77dc5b0589bbce1f46c0dcc290b7a6193d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 May 2022 21:34:12 +0800 Subject: [PATCH 0690/2039] Create 1417-reformat-the-string.js --- 1417-reformat-the-string.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1417-reformat-the-string.js diff --git a/1417-reformat-the-string.js b/1417-reformat-the-string.js new file mode 100644 index 00000000..b822d836 --- /dev/null +++ b/1417-reformat-the-string.js @@ -0,0 +1,28 @@ +/** + * @param {string} s + * @return {string} + */ +var reformat = function(s) { + let str = '', num = '' + const isDigit = ch => ch >= '0' && ch <= '9' + for(const ch of s) { + if(isDigit(ch)) num += ch + else str += ch + } + if(Math.abs(str.length - num.length) > 1) return '' + if(str.length > num.length) { + let res = '' + for (let i = 0; i < str.length; i++) { + res += str[i] + if(i < num.length) res += num[i] + } + return res + } else { + let res = '' + for (let i = 0; i < num.length; i++) { + res += num[i] + if(i < str.length) res += str[i] + } + return res + } +}; From 510ee904a8015b30431d7d98d5d1ddef6d1606a1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 May 2022 21:28:52 +0800 Subject: [PATCH 0691/2039] Update 2246-longest-path-with-different-adjacent-characters.js --- ...path-with-different-adjacent-characters.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2246-longest-path-with-different-adjacent-characters.js b/2246-longest-path-with-different-adjacent-characters.js index 62fbe3a2..0b9e53e7 100644 --- a/2246-longest-path-with-different-adjacent-characters.js +++ b/2246-longest-path-with-different-adjacent-characters.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} parent + * @param {string} s + * @return {number} + */ +var longestPath = function(parent, s) { + const n = parent.length + const hash = {} + for(let i = 1; i < n; i++) { + if(hash[parent[i]] == null) hash[parent[i]] = [] + hash[parent[i]].push(i) + } + + let res = 0 + dfs(0) + return res + + function dfs(i) { + let max1 = 0, max2 = 0 + for(const j of (hash[i] || [])) { + const len = dfs(j) + if(s[i] === s[j]) continue + if(len > max1) { + const tmp = max1 + max1 = len + max2 = tmp + } else if(len > max2) { + max2 = len + } + } + res = Math.max(res, max1 + max2 + 1) + return max1 + 1 + } +}; + + +// another + /** * @param {number[]} parent * @param {string} s From c4ee3aa7a9c0cea668261e37db44dd87fe46fc67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 May 2022 15:19:30 +0800 Subject: [PATCH 0692/2039] Create 2264-largest-3-same-digit-number-in-string.js --- 2264-largest-3-same-digit-number-in-string.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2264-largest-3-same-digit-number-in-string.js diff --git a/2264-largest-3-same-digit-number-in-string.js b/2264-largest-3-same-digit-number-in-string.js new file mode 100644 index 00000000..62acf554 --- /dev/null +++ b/2264-largest-3-same-digit-number-in-string.js @@ -0,0 +1,20 @@ +/** + * @param {string} num + * @return {string} + */ +var largestGoodInteger = function(num) { + let res = '' + const n = num.length + const isDigit = ch => ch >= '0' && ch <= '9' + for(let i = 1; i < n - 1; i++) { + const ch = num[i] + if(!isDigit(ch)) continue + if(!isDigit(num[i - 1])) continue + if(!isDigit(num[i + 1])) continue + if(num[i - 1] == num[i] && num[i] === num[i + 1]) { + if(ch.repeat(3) > res) res = ch.repeat(3) + } + } + + return res +}; From 487ca64e315c52861a99a0f068e9bfcf4737fa8b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 May 2022 15:19:55 +0800 Subject: [PATCH 0693/2039] Create 2265-count-nodes-equal-to-average-of-subtree.js --- ...count-nodes-equal-to-average-of-subtree.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2265-count-nodes-equal-to-average-of-subtree.js diff --git a/2265-count-nodes-equal-to-average-of-subtree.js b/2265-count-nodes-equal-to-average-of-subtree.js new file mode 100644 index 00000000..6e8ba21f --- /dev/null +++ b/2265-count-nodes-equal-to-average-of-subtree.js @@ -0,0 +1,27 @@ +/** + * 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 averageOfSubtree = function(root) { + let res = 0 + dfs(root) + return res + + function dfs(node) { + if(node == null) return [0, 0] + let [lSum, lNum] = dfs(node.left) + let [rSum, rNum] = dfs(node.right) + if(node.val === Math.floor((node.val + lSum + rSum) / (lNum + rNum + 1))) { + res++ + } + return [node.val + lSum + rSum, lNum + rNum + 1] + } +}; From 51c70259a5a98d3c85fccff45c7bb6b80332ee7e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 May 2022 15:23:20 +0800 Subject: [PATCH 0694/2039] Create 2266-count-number-of-texts.js --- 2266-count-number-of-texts.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2266-count-number-of-texts.js diff --git a/2266-count-number-of-texts.js b/2266-count-number-of-texts.js new file mode 100644 index 00000000..09320bf4 --- /dev/null +++ b/2266-count-number-of-texts.js @@ -0,0 +1,33 @@ +/** + * @param {string} pressedKeys + * @return {number} + */ +var countTexts = function(pressedKeys) { + const s = pressedKeys + const mod = 1e9 + 7 + + let n = s.length + let dp = Array(n + 1).fill(0) + dp[0] = 1 + dp[1] = 1 + let counter = Array(10).fill(3) + counter[0] = 0 + counter[1] = 0 + counter[7] = 4 + counter[9] = 4 + for(let i = 2; i <= n; i++) { + let x = +(s[i - 1]) + let j = 0 + while (j < counter[x] && i - 1 >= j && s[i - 1 - j] == s[i - 1]) { + dp[i] += dp[i - 1 - j] + j += 1 + } + + dp[i] %= mod + } + + return dp[n] + +}; + + From 58d28fc93ed6d410db28973bcb5a7a871d9b96ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 May 2022 15:24:57 +0800 Subject: [PATCH 0695/2039] Create 2267-check-if-there-is-a-valid-parentheses-string-path.js --- ...here-is-a-valid-parentheses-string-path.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 2267-check-if-there-is-a-valid-parentheses-string-path.js diff --git a/2267-check-if-there-is-a-valid-parentheses-string-path.js b/2267-check-if-there-is-a-valid-parentheses-string-path.js new file mode 100644 index 00000000..429c229d --- /dev/null +++ b/2267-check-if-there-is-a-valid-parentheses-string-path.js @@ -0,0 +1,43 @@ +/** + * @param {character[][]} grid + * @return {boolean} + */ +var hasValidPath = function(grid) { + if (grid[0][0] == ")") return false + let m = grid.length, n = grid[0].length + const dirs = [[0, 1], [1, 0]] + + if ((m + n - 1) % 2 == 1) return false + const a = Array.from({ length: m }, () => Array(n).fill(null)) + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] === '(') a[i][j] = 1 + else a[i][j] = -1 + } + } + + + const visited = new Set([`0,0,1`]) + let q = [[0, 0, 1]] + + while (q.length){ + const tmp = [] + for (const [x, y, v] of q) { + if (`${x},${y},${v}` == `${m - 1},${n - 1},0`) return true + for (const [dx, dy] of dirs) { + let i= x + dx, j = y + dy + if (0 <= i && i < m && 0 <= j && j < n) { + let v2 = v + a[i][j] + if (v2 >= 0 && !visited.has(`${i},${j},${v2}`) ) { + tmp.push([i, j, v2]) + visited.add(`${i},${j},${v2}`) + } + + } + } + } + q = tmp + } + return false +}; + From 17a596f92fed6a3cea363f28b736b8e0500a22f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 May 2022 21:34:09 +0800 Subject: [PATCH 0696/2039] Update 2245-maximum-trailing-zeros-in-a-cornered-path.js --- ...ximum-trailing-zeros-in-a-cornered-path.js | 86 +++++++++++++++++++ 1 file changed, 86 insertions(+) diff --git a/2245-maximum-trailing-zeros-in-a-cornered-path.js b/2245-maximum-trailing-zeros-in-a-cornered-path.js index b2004bcb..b4914d6d 100644 --- a/2245-maximum-trailing-zeros-in-a-cornered-path.js +++ b/2245-maximum-trailing-zeros-in-a-cornered-path.js @@ -1,3 +1,89 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const maxTrailingZeros = function maxTrailingZeros(grid) { + const m = grid.length + const n = grid[0].length + + const factors = (num, k) => { + let sum = 0 + while (!(num % k)) { + num /= k + sum += 1 + } + + return sum + } + + const getRowPrefixSum = (k) => { + const rowPrefixSum = [] + for (let i = 0; i < m; i++) { + rowPrefixSum.push([factors(grid[i][0], k)]) + for (let j = 1; j < n; j++) { + rowPrefixSum[i][j] = factors(grid[i][j], k) + rowPrefixSum[i][j - 1] + } + } + + return rowPrefixSum + } + + const getColPrefixSum = (k) => { + const colPrefixSum = [[factors(grid[0][0], k)]] + for (let i = 1; i < m; i++) { + colPrefixSum.push([factors(grid[i][0], k) + colPrefixSum[i - 1][0]]) + } + + for (let j = 1; j < n; j++) { + colPrefixSum[0][j] = factors(grid[0][j], k) + for (let i = 1; i < m; i++) { + colPrefixSum[i][j] = factors(grid[i][j], k) + colPrefixSum[i - 1][j] + } + } + + return colPrefixSum + } + + const twoRow = getRowPrefixSum(2) + const fiveRow = getRowPrefixSum(5) + const twoCol = getColPrefixSum(2) + const fiveCol = getColPrefixSum(5) + + let max = 0 + + // now check every cell in the whole grid + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + const twoLeft = twoRow[i][j] + const twoRight = twoRow[i][n - 1] - (j && twoRow[i][j - 1]) + const twoUp = i && twoCol[i - 1][j] + const twoDown = twoCol[m - 1][j] - twoCol[i][j] + + const fiveLeft = fiveRow[i][j] + const fiveRight = fiveRow[i][n - 1] - (j && fiveRow[i][j - 1]) + const fiveUp = i && fiveCol[i - 1][j] + const fiveDown = fiveCol[m - 1][j] - fiveCol[i][j] + + const corneredPaths = [ + Math.min(twoLeft + twoUp, fiveLeft + fiveUp), + Math.min(twoLeft + twoDown, fiveLeft + fiveDown), + Math.min(twoRight + twoUp, fiveRight + fiveUp), + Math.min(twoRight + twoDown, fiveRight + fiveDown), + ] + + const trailingZeros = Math.max(...corneredPaths) + + if (trailingZeros > max) { + max = trailingZeros + } + } + } + + return max +} + +// another + /** * @param {number[][]} grid * @return {number} From 1f09f11541b83bcc04fbeca15927c8925df19411 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 11 May 2022 18:35:10 +0800 Subject: [PATCH 0697/2039] Update 56-merge-intervals.js --- 56-merge-intervals.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/56-merge-intervals.js b/56-merge-intervals.js index 89a5fb3e..a772b911 100644 --- a/56-merge-intervals.js +++ b/56-merge-intervals.js @@ -1,3 +1,25 @@ +/** + * @param {number[][]} intervals + * @return {number[][]} + */ +const merge = function(intervals) { + intervals.sort((a, b) => a[0] - b[0] || a[1] - b[1]) + const res = [intervals[0]] + for(let i = 1, n = intervals.length; i < n; i++) { + const [s, e] = intervals[i] + const pre = res[res.length - 1] + if(s <= pre[1]) { + pre[1] = Math.max(pre[1], e) + } else { + res.push(intervals[i]) + } + } + return res +}; + +// another + + /** * @param {number[][]} intervals * @return {number[][]} From 3f3d2116802a6512be539083ef27779e30153945 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 12 May 2022 11:21:59 +0800 Subject: [PATCH 0698/2039] Update 732-my-calendar-iii.js --- 732-my-calendar-iii.js | 77 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 77 insertions(+) diff --git a/732-my-calendar-iii.js b/732-my-calendar-iii.js index 952ba97d..ad5f21cc 100644 --- a/732-my-calendar-iii.js +++ b/732-my-calendar-iii.js @@ -41,3 +41,80 @@ MyCalendarThree.prototype.book = function(start, end) { * var obj = new MyCalendarThree() * var param_1 = obj.book(start,end) */ + +// another + + +var MyCalendarThree = function() { + this.st = new SegmentTree(0, 10 ** 9); +}; + +/** + * @param {number} start + * @param {number} end + * @return {number} + */ +MyCalendarThree.prototype.book = function(start, end) { + this.st.add(start, end); + return this.st.getMax(); +}; + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * var obj = new MyCalendarThree() + * var param_1 = obj.book(start,end) + */ + +class SegmentTree { + constructor(start, end) { + this.root = new TreeNode(start, end); + } + + add(qs, qe, node=this.root) { + + // completely outside of query range + if(qs > node.end || qe <= node.start) { + return node.val; + } + + // completely covered by query range + if(qs <= node.start && qe > node.end) { + node.booked += 1; + node.val += 1; + return node.val; + } + + let mid = (node.start + node.end)/2 >> 0; + + if(!node.left) { + node.left = new TreeNode(node.start, mid); + } + + if(!node.right) { + node.right = new TreeNode(mid+1, node.end); + } + + node.val = Math.max( + this.add(qs, qe, node.left), + this.add(qs, qe, node.right), + ) + node.booked; + + return node.val; + + } + + getMax() { + return this.root.val; + } + +} + +class TreeNode { + constructor(start, end) { + this.start = start; + this.end = end; + this.val = 0; + this.booked = 0; + this.left = this.right = null; + } +} From ae9e24aed9482023662ba3cae5ffc909f1d36b3d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 13 May 2022 14:08:24 +0800 Subject: [PATCH 0699/2039] Update 253-meeting-rooms-ii.js --- 253-meeting-rooms-ii.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/253-meeting-rooms-ii.js b/253-meeting-rooms-ii.js index ea7bcd27..62a74dde 100644 --- a/253-meeting-rooms-ii.js +++ b/253-meeting-rooms-ii.js @@ -37,3 +37,33 @@ const minMeetingRooms = function(intervals) { return res } + + +// another + +/** + * @param {number[][]} intervals + * @return {number} + */ +const minMeetingRooms = function(intervals) { + let res = 0 + const sArr = [], eArr = [], n = intervals.length + for(const [s, e] of intervals) { + sArr.push(s) + eArr.push(e) + } + sArr.sort((a, b) => a - b) + eArr.sort((a, b) => a - b) + for(let i = 0, j = 0; i < n && j < n;) { + const s = sArr[i], e = eArr[j] + if(s < e) { + res++ + i++ + } else { + j++ + i++ + } + } + + return res +} From 9d69acb7db21e9b48f42f5ce63dc6b4b1c3b89e3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 13 May 2022 14:50:49 +0800 Subject: [PATCH 0700/2039] Update 253-meeting-rooms-ii.js --- 253-meeting-rooms-ii.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/253-meeting-rooms-ii.js b/253-meeting-rooms-ii.js index 62a74dde..e7f58ed9 100644 --- a/253-meeting-rooms-ii.js +++ b/253-meeting-rooms-ii.js @@ -67,3 +67,25 @@ const minMeetingRooms = function(intervals) { return res } + +// another + +/** + * @param {number[][]} intervals + * @return {number} + */ +const minMeetingRooms = function(intervals) { + intervals.sort((a, b) => a[0] - b[0] || a[1] - b[1]) + const n = intervals.length + const pq = new MinPriorityQueue() + let res = 0 + for(const [s, e] of intervals) { + while(!pq.isEmpty() && s >= pq.front().element) { + pq.dequeue() + } + pq.enqueue(e) + res = Math.max(res, pq.size()) + } + + return res +} From 45a5e1d9e20d7013d2fad7b88fc28b1c2175fde2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 13 May 2022 19:44:27 +0800 Subject: [PATCH 0701/2039] Update 253-meeting-rooms-ii.js --- 253-meeting-rooms-ii.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/253-meeting-rooms-ii.js b/253-meeting-rooms-ii.js index e7f58ed9..5fb05b3a 100644 --- a/253-meeting-rooms-ii.js +++ b/253-meeting-rooms-ii.js @@ -89,3 +89,25 @@ const minMeetingRooms = function(intervals) { return res } + +// another + +/** + * @param {number[][]} intervals + * @return {number} + */ +const minMeetingRooms = function(intervals) { + const hash = {} + for(const [s, e] of intervals) { + hash[s] = (hash[s] || 0) + 1 + hash[e] = (hash[e] || 0) - 1 + } + let res = 0, cur = 0 + const keys = Object.keys(hash).map(e => +e) + keys.sort((a, b) => a - b) + for(const k of keys) { + cur += hash[k] + res = Math.max(res, cur) + } + return res +}; From c5bf290c70787bcf734ebc7bc0b1d9a12cb1c3cc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 14 May 2022 21:14:14 +0800 Subject: [PATCH 0702/2039] Update 1893-check-if-all-the-integers-in-a-range-are-covered.js --- ...all-the-integers-in-a-range-are-covered.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1893-check-if-all-the-integers-in-a-range-are-covered.js b/1893-check-if-all-the-integers-in-a-range-are-covered.js index 1aff5dee..34d23efe 100644 --- a/1893-check-if-all-the-integers-in-a-range-are-covered.js +++ b/1893-check-if-all-the-integers-in-a-range-are-covered.js @@ -38,3 +38,28 @@ const isCovered = function(ranges, left, right) { } return true; }; + +// another + +/** + * @param {number[][]} ranges + * @param {number} left + * @param {number} right + * @return {boolean} + */ +const isCovered = function(ranges, left, right) { + const arr = Array(52).fill(0) + for(let [s, e] of ranges) { + arr[s]++ + arr[e + 1]-- + } + + let overlaps = 0 + for(let i = 1; i <= right; i++) { + overlaps += arr[i]; + if (i >= left && overlaps == 0) return false; + } + + return true +}; + From f479af219210c88afcbbdeabb36ff4d55fd9dce4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 May 2022 19:03:06 +0800 Subject: [PATCH 0703/2039] Create 2273-find-resultant-array-after-removing-anagrams.js --- ...resultant-array-after-removing-anagrams.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2273-find-resultant-array-after-removing-anagrams.js diff --git a/2273-find-resultant-array-after-removing-anagrams.js b/2273-find-resultant-array-after-removing-anagrams.js new file mode 100644 index 00000000..c9775eff --- /dev/null +++ b/2273-find-resultant-array-after-removing-anagrams.js @@ -0,0 +1,32 @@ +/** + * @param {string[]} words + * @return {string[]} + */ +const removeAnagrams = function(words) { + const res = [] + const n = words.length + + for(let i = 0; i < n;) { + let j = i + 1 + while(j < n && isAna(words[i], words[j])) j++ + res.push(words[i]) + i = j + } + return res + + function isAna(s1, s2) { + const arr = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for(let i = 0; i < s1.length; i++) { + arr[s1.charCodeAt(i) - a]++ + } + for(let i = 0; i < s2.length; i++) { + arr[s2.charCodeAt(i) - a]-- + } + for(const e of arr) { + if(e !== 0) return false + } + return true + } +}; + From 3c768111fb57d67e207852d41d886dfc43459064 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 May 2022 19:33:03 +0800 Subject: [PATCH 0704/2039] Create 2274-maximum-consecutive-floors-without-special-floors.js --- ...nsecutive-floors-without-special-floors.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2274-maximum-consecutive-floors-without-special-floors.js diff --git a/2274-maximum-consecutive-floors-without-special-floors.js b/2274-maximum-consecutive-floors-without-special-floors.js new file mode 100644 index 00000000..aa9e7b72 --- /dev/null +++ b/2274-maximum-consecutive-floors-without-special-floors.js @@ -0,0 +1,22 @@ +/** + * @param {number} bottom + * @param {number} top + * @param {number[]} special + * @return {number} + */ +var maxConsecutive = function(bottom, top, special) { + special.sort((a, b) => a - b) + let res = 0 + + if(bottom < special[0]) { + res = special[0] - bottom + } + for(let i = 1; i < special.length; i++) { + res = Math.max(res, special[i] - special[i - 1] - 1) + } + if(top > special[special.length - 1]) { + res = Math.max(res, top - special[special.length - 1]) + } + + return res +}; From 196758fa2ddf46621d364616f0d96e9e1589c08a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 May 2022 21:59:05 +0800 Subject: [PATCH 0705/2039] Update 1094-car-pooling.js --- 1094-car-pooling.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1094-car-pooling.js b/1094-car-pooling.js index 3d987e2d..a37547cf 100644 --- a/1094-car-pooling.js +++ b/1094-car-pooling.js @@ -1,3 +1,26 @@ +/** + * @param {number[][]} trips + * @param {number} capacity + * @return {boolean} + */ +const carPooling = function(trips, capacity) { + const arr = Array(1001).fill(0) + for(const [num, s, e] of trips) { + arr[s] += num + arr[e] -= num + } + for(let i = 1; i < 1001; i++) { + arr[i] += arr[i - 1] + } + + for(let e of arr) { + if(e > capacity) return false + } + return true +}; + +// another + /** * @param {number[][]} trips * @param {number} capacity From 630689135e79c462cf56bea9d32a5b36a67871b3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 May 2022 22:47:28 +0800 Subject: [PATCH 0706/2039] Create 2275-largest-combination-with-bitwise-and-greater-than-zero.js --- ...bination-with-bitwise-and-greater-than-zero.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2275-largest-combination-with-bitwise-and-greater-than-zero.js diff --git a/2275-largest-combination-with-bitwise-and-greater-than-zero.js b/2275-largest-combination-with-bitwise-and-greater-than-zero.js new file mode 100644 index 00000000..615ce874 --- /dev/null +++ b/2275-largest-combination-with-bitwise-and-greater-than-zero.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} candidates + * @return {number} + */ +const largestCombination = function(candidates) { + let res = 0 + for(let i = 0; i < 25; i++) { + let tmp = 0, bit = 1 << i + for(const e of candidates) { + if((e & bit) !== 0) tmp++ + } + res = Math.max(res, tmp) + } + return res +}; From bca3f783e078b21520607797729577c440996600 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 16 May 2022 10:21:53 +0800 Subject: [PATCH 0707/2039] Update 1109-corporate-flight-bookings.js --- 1109-corporate-flight-bookings.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1109-corporate-flight-bookings.js b/1109-corporate-flight-bookings.js index bb980cc8..8fe83d1c 100644 --- a/1109-corporate-flight-bookings.js +++ b/1109-corporate-flight-bookings.js @@ -1,3 +1,24 @@ +/** + * @param {number[][]} bookings + * @param {number} n + * @return {number[]} + */ +const corpFlightBookings = function(bookings, n) { + const arr = Array(n + 2).fill(0) + for(const [s, e, num] of bookings) { + arr[s] += num + arr[e + 1] -= num + } + for(let i = 1; i < n + 2; i++) { + arr[i] += arr[i - 1] + } + arr.pop() + arr.shift() + return arr +}; + +// another + /** * @param {number[][]} bookings * @param {number} n From dc18d3a4f1147836e155842469f811612caeaec8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 16 May 2022 11:11:36 +0800 Subject: [PATCH 0708/2039] Create 2276-count-integers-in-intervals.js --- 2276-count-integers-in-intervals.js | 78 +++++++++++++++++++++++++++++ 1 file changed, 78 insertions(+) create mode 100644 2276-count-integers-in-intervals.js diff --git a/2276-count-integers-in-intervals.js b/2276-count-integers-in-intervals.js new file mode 100644 index 00000000..27e49fca --- /dev/null +++ b/2276-count-integers-in-intervals.js @@ -0,0 +1,78 @@ +var CountIntervals = function () { + this.root = new Node(1, 10 ** 9) +} + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +CountIntervals.prototype.add = function (left, right) { + this.root.addInterval(left, right) +} + +/** + * @return {number} + */ +CountIntervals.prototype.count = function () { + return this.root.total +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * var obj = new CountIntervals() + * obj.add(left,right) + * var param_2 = obj.count() + */ + +class Node { + constructor(min, max) { + this.min = min + this.max = max + this.currentMin = -1 + this.currentMax = -1 + this.total = 0 + this.left = null + this.right = null + } + + addInterval(left, right) { + if (this.currentMin < 0) { + this.currentMin = left + this.currentMax = right + this.total = right - left + 1 + return this.total + } + + const mid = (this.min + this.max) >> 1 + + if (this.left) { + if (left <= mid) this.left.addInterval(left, Math.min(mid, right)) + if (right > mid) this.right.addInterval(Math.max(mid + 1, left), right) + + this.total = this.left.total + this.right.total + return + } + + if (left <= this.currentMax + 1 && right >= this.currentMin - 1) { + this.currentMin = Math.min(this.currentMin, left) + this.currentMax = Math.max(this.currentMax, right) + this.total = this.currentMax - this.currentMin + 1 + return + } + this.left = new Node(this.min, mid) + this.right = new Node(mid + 1, this.max) + + if (left <= mid) this.left.addInterval(left, Math.min(mid, right)) + if (right > mid) this.right.addInterval(Math.max(left, mid + 1), right) + if (this.currentMin <= mid) + this.left.addInterval(this.currentMin, Math.min(mid, this.currentMax)) + if (this.currentMax > mid) + this.right.addInterval( + Math.max(mid + 1, this.currentMin), + this.currentMax + ) + + this.total = this.left.total + this.right.total + } +} From a197b4fe8302c7ddf910227d23eda18bb04275ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 17 May 2022 12:14:14 +0800 Subject: [PATCH 0709/2039] Update 759-employee-free-time.js --- 759-employee-free-time.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/759-employee-free-time.js b/759-employee-free-time.js index ff19b672..1bb666d6 100644 --- a/759-employee-free-time.js +++ b/759-employee-free-time.js @@ -145,3 +145,37 @@ const employeeFreeTime = function (schedule) { return res } +// another + +/** + * // Definition for an Interval. + * function Interval(start, end) { + * this.start = start; + * this.end = end; + * }; + */ + +/** + * @param {Interval[][]} schedule + * @return {Interval[]} + */ +var employeeFreeTime = function(schedule) { + const arr = schedule.reduce((ac, e) => { + ac.push(...e) + return ac + }, []) + arr.sort((a, b) => a.start - b.start || b.end - a.end) + const n = arr.length + const res = [] + let end = arr[0].end + for(let i = 1; i < n; i++) { + const cur = arr[i] + if(cur.start > end) { + res.push(new Interval(end, cur.start)) + } + + end = Math.max(end, cur.end) + } + + return res +}; From 03867fff4a1aa017d64aa9db6a425ebebc4dd9c7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 May 2022 12:29:19 +0800 Subject: [PATCH 0710/2039] Update 1871-jump-game-vii.js --- 1871-jump-game-vii.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1871-jump-game-vii.js b/1871-jump-game-vii.js index ace67d12..55fd6fcf 100644 --- a/1871-jump-game-vii.js +++ b/1871-jump-game-vii.js @@ -74,3 +74,26 @@ const canReach = function(s, minJump, maxJump) { } return dp[n - 1] }; + +// another + +/** + * @param {string} s + * @param {number} minJump + * @param {number} maxJump + * @return {boolean} + */ +const canReach = function(s, minJump, maxJump) { + const n = s.length + const dp = Array(n).fill(0) + dp[0] = 1 + let pre = 0 + for(let i = 1; i < n; i++) { + if(i < minJump) continue + if(i >= minJump) pre += dp[i - minJump] + if(i > maxJump) pre -= dp[i - maxJump - 1] + dp[i] = pre > 0 && s[i] === '0' ? 1 : 0 + } + + return dp[n - 1] ? true : false +}; From 841839f369d99e702576bfecb397fd0412195d8a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 May 2022 16:46:56 +0800 Subject: [PATCH 0711/2039] Create 1271-hexspeak.js --- 1271-hexspeak.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1271-hexspeak.js diff --git a/1271-hexspeak.js b/1271-hexspeak.js new file mode 100644 index 00000000..446c5713 --- /dev/null +++ b/1271-hexspeak.js @@ -0,0 +1,15 @@ +/** + * @param {string} num + * @return {string} + */ +var toHexspeak = function(num) { + const hex = ((+num)).toString(16).toUpperCase() + let res = '' + for(let ch of hex) { + if(ch > '1' && ch <= '9') return 'ERROR' + else if(ch === '0') res += 'O' + else if(ch === '1') res += 'I' + else res += ch + } + return res +}; From 4dc5c7291e39ee92a1a2383d11d65e346b05c4f8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 May 2022 16:52:07 +0800 Subject: [PATCH 0712/2039] Create 2235-add-two-integers.js --- 2235-add-two-integers.js | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 2235-add-two-integers.js diff --git a/2235-add-two-integers.js b/2235-add-two-integers.js new file mode 100644 index 00000000..f90c2657 --- /dev/null +++ b/2235-add-two-integers.js @@ -0,0 +1,8 @@ +/** + * @param {number} num1 + * @param {number} num2 + * @return {number} + */ +var sum = function(num1, num2) { + return num1 + num2 +}; From af5dcf041da331f349af3132b71fd3c6868c8c72 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 May 2022 17:37:52 +0800 Subject: [PATCH 0713/2039] Create 2270-number-of-ways-to-split-array.js --- 2270-number-of-ways-to-split-array.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2270-number-of-ways-to-split-array.js diff --git a/2270-number-of-ways-to-split-array.js b/2270-number-of-ways-to-split-array.js new file mode 100644 index 00000000..ac92367e --- /dev/null +++ b/2270-number-of-ways-to-split-array.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var waysToSplitArray = function(nums) { + let res = 0, sum = 0 + const n = nums.length + if(n === 0) return res + const pre = Array(n).fill(0) + pre[0] = nums[0] + sum += nums[0] + for(let i = 1; i < n; i++) { + pre[i] = nums[i] + pre[i - 1] + sum += nums[i] + } + for(let i = 0; i < n - 1; i++) { + if(pre[i] >= sum - pre[i]) res++ + } + + return res +}; From 3c4b7ce9e7d8a8891e24caa6a70dfc3e6da0e2ce Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 19 May 2022 13:58:39 +0800 Subject: [PATCH 0714/2039] Update 1589-maximum-sum-obtained-of-any-permutation.js --- ...maximum-sum-obtained-of-any-permutation.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1589-maximum-sum-obtained-of-any-permutation.js b/1589-maximum-sum-obtained-of-any-permutation.js index 0baa6812..54b7f955 100644 --- a/1589-maximum-sum-obtained-of-any-permutation.js +++ b/1589-maximum-sum-obtained-of-any-permutation.js @@ -46,3 +46,34 @@ const maxSumRangeQuery = function (nums, requests) { } return res } + +// another + +/** + * @param {number[]} nums + * @param {number[][]} requests + * @return {number} + */ +const maxSumRangeQuery = function (nums, requests) { + const n = nums.length + + const arr = Array(n + 1).fill(0) + for(const [s, e] of requests) { + arr[s] += 1 + arr[e + 1] -= 1 + } + for(let i = 1; i <= n; i++) { + arr[i] += arr[i - 1] + } + arr.sort((a, b) => b - a) + nums.sort((a, b) => b - a) + let res = 0 + const mod = 1e9 + 7 + + for (let i = 0; i < n; i++) { + if(arr[i] <= 0) break + res = (res + nums[i] * arr[i]) % mod + } + + return res +} From 822980d8f86b77832db0a61597485cd210198c5f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 20 May 2022 12:54:08 +0800 Subject: [PATCH 0715/2039] Create 2015-average-height-of-buildings-in-each-segment.js --- ...age-height-of-buildings-in-each-segment.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 2015-average-height-of-buildings-in-each-segment.js diff --git a/2015-average-height-of-buildings-in-each-segment.js b/2015-average-height-of-buildings-in-each-segment.js new file mode 100644 index 00000000..9a33b888 --- /dev/null +++ b/2015-average-height-of-buildings-in-each-segment.js @@ -0,0 +1,41 @@ +/** + * @param {number[][]} buildings + * @return {number[][]} + */ +const averageHeightOfBuildings = function (buildings) { + const hash = {}, + cnt = {} + for (const [s, e, h] of buildings) { + if (hash[s] == null) hash[s] = 0 + if (hash[e] == null) hash[e] = 0 + if (cnt[s] == null) cnt[s] = 0 + if (cnt[e] == null) cnt[e] = 0 + hash[s] += h + hash[e] -= h + cnt[s]++ + cnt[e]-- + } + + const res = [] + const keys = Object.keys(hash).map((e) => +e) + keys.sort((a, b) => a - b) + + let h = 0, + c = 0 + for (let i = 0; i < keys.length; i++) { + const p = keys[i], + hc = cnt[p] + if (h) res[res.length - 1][1] = p + h += hash[p] + c += cnt[p] + if ( + h && + (res.length === 0 || + res[res.length - 1][1] != p || + res[res.length - 1][2] != ~~(h / c)) + ) + res.push([p, p, ~~(h / c)]) + } + + return res +} From 33ac4f4290fce6c9bb028a0635ed2833862ac582 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 20 May 2022 12:57:28 +0800 Subject: [PATCH 0716/2039] Update 2015-average-height-of-buildings-in-each-segment.js --- ...verage-height-of-buildings-in-each-segment.js | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/2015-average-height-of-buildings-in-each-segment.js b/2015-average-height-of-buildings-in-each-segment.js index 9a33b888..9d50ac58 100644 --- a/2015-average-height-of-buildings-in-each-segment.js +++ b/2015-average-height-of-buildings-in-each-segment.js @@ -23,18 +23,18 @@ const averageHeightOfBuildings = function (buildings) { let h = 0, c = 0 for (let i = 0; i < keys.length; i++) { - const p = keys[i], - hc = cnt[p] - if (h) res[res.length - 1][1] = p - h += hash[p] - c += cnt[p] + const k = keys[i], + hc = cnt[k] + if (h) res[res.length - 1][1] = k + h += hash[k] + c += cnt[k] if ( h && (res.length === 0 || - res[res.length - 1][1] != p || - res[res.length - 1][2] != ~~(h / c)) + res[res.length - 1][1] !== k || + res[res.length - 1][2] !== ~~(h / c)) ) - res.push([p, p, ~~(h / c)]) + res.push([k, k, ~~(h / c)]) } return res From 2173a6f2ac9887f7fe67283c77f7b259882f452e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 20 May 2022 21:16:52 +0800 Subject: [PATCH 0717/2039] Update 2015-average-height-of-buildings-in-each-segment.js --- ...age-height-of-buildings-in-each-segment.js | 47 +++++++++---------- 1 file changed, 21 insertions(+), 26 deletions(-) diff --git a/2015-average-height-of-buildings-in-each-segment.js b/2015-average-height-of-buildings-in-each-segment.js index 9d50ac58..c58a3b4f 100644 --- a/2015-average-height-of-buildings-in-each-segment.js +++ b/2015-average-height-of-buildings-in-each-segment.js @@ -2,40 +2,35 @@ * @param {number[][]} buildings * @return {number[][]} */ -const averageHeightOfBuildings = function (buildings) { - const hash = {}, - cnt = {} - for (const [s, e, h] of buildings) { - if (hash[s] == null) hash[s] = 0 - if (hash[e] == null) hash[e] = 0 - if (cnt[s] == null) cnt[s] = 0 - if (cnt[e] == null) cnt[e] = 0 +const averageHeightOfBuildings = function(buildings) { + const hash = {}, cnt = {} + for(const [s, e, h] of buildings) { + if(hash[s] == null) hash[s] = 0 + if(hash[e] == null) hash[e] = 0 + if(cnt[s] == null) cnt[s] = 0 + if(cnt[e] == null) cnt[e] = 0 hash[s] += h hash[e] -= h cnt[s]++ cnt[e]-- } - + const res = [] - const keys = Object.keys(hash).map((e) => +e) + const keys = Object.keys(hash).map(e => +e) keys.sort((a, b) => a - b) - - let h = 0, - c = 0 - for (let i = 0; i < keys.length; i++) { - const k = keys[i], - hc = cnt[k] - if (h) res[res.length - 1][1] = k + let h = 0, c = 0 + for(const k of keys) { + if(h) res[res.length - 1][1] = k h += hash[k] c += cnt[k] - if ( - h && - (res.length === 0 || - res[res.length - 1][1] !== k || - res[res.length - 1][2] !== ~~(h / c)) - ) - res.push([k, k, ~~(h / c)]) + const avg = ~~(h / c) + if(h && ( + res.length === 0 || + res[res.length - 1][1] !== k || + res[res.length - 1][2] !== avg + )) { + res.push([k, k, avg]) + } } - return res -} +}; From 8d89d6d87173f1db17573d3b080197aaeeccfb11 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 21 May 2022 10:51:08 +0800 Subject: [PATCH 0718/2039] Update 1943-describe-the-painting.js --- 1943-describe-the-painting.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1943-describe-the-painting.js b/1943-describe-the-painting.js index 872b3bc2..59191bb1 100644 --- a/1943-describe-the-painting.js +++ b/1943-describe-the-painting.js @@ -22,3 +22,34 @@ const splitPainting = function(segments) { } return res }; + +// another + +/** + * @param {number[][]} segments + * @return {number[][]} + */ +const splitPainting = function(segments) { + const sum = {} + for(const [s, e, v] of segments) { + if(sum[s] == null) sum[s] = 0 + if(sum[e] == null) sum[e] = 0 + sum[s] += v + sum[e] -= v + } + const keys = Object.keys(sum).map(e => +e) + keys.sort((a, b) => a - b) + const res = [] + let pre = 0, s = 0, n = keys.length + for(let i = 0; i < n; i++) { + const k = keys[i] + + if(s) { + res.push([pre, k, s]) + } + s += sum[k] + pre = k + } + + return res +}; From d3400258ec85508c41353a0712d2d60b00ba4d1b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 May 2022 21:30:01 +0800 Subject: [PATCH 0719/2039] Create 2237-count-positions-on-street-with-required-brightness.js --- ...ions-on-street-with-required-brightness.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2237-count-positions-on-street-with-required-brightness.js diff --git a/2237-count-positions-on-street-with-required-brightness.js b/2237-count-positions-on-street-with-required-brightness.js new file mode 100644 index 00000000..8ee6b11e --- /dev/null +++ b/2237-count-positions-on-street-with-required-brightness.js @@ -0,0 +1,25 @@ +/** + * @param {number} n + * @param {number[][]} lights + * @param {number[]} requirement + * @return {number} + */ +var meetRequirement = function(n, lights, requirement) { + const arr = Array(n + 1).fill(0) + for(const [pos, ra] of lights) { + const start = Math.max(0, pos - ra) + const end = Math.min(n - 1, pos + ra) + arr[start]++ + arr[end + 1]-- + } + for(let i = 1; i <= n; i++) { + arr[i] += arr[i - 1] + } + + let res = 0 + for(let i = 0; i < n; i++) { + if(arr[i] >= requirement[i]) res++ + } + + return res +}; From 5b4cfd52c7faa9bc16c404963c0d804e14dc82d3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 May 2022 21:36:21 +0800 Subject: [PATCH 0720/2039] Create 2280-minimum-lines-to-represent-a-line-chart.js --- ...minimum-lines-to-represent-a-line-chart.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2280-minimum-lines-to-represent-a-line-chart.js diff --git a/2280-minimum-lines-to-represent-a-line-chart.js b/2280-minimum-lines-to-represent-a-line-chart.js new file mode 100644 index 00000000..96ae3aa4 --- /dev/null +++ b/2280-minimum-lines-to-represent-a-line-chart.js @@ -0,0 +1,29 @@ +/** + * @param {number[][]} stockPrices + * @return {number} + */ +var minimumLines = function(stockPrices) { + let res = 1 + const ma = stockPrices + const n = ma.length + if(n === 0 || n === 1) return 0 + ma.sort((a, b) => a[0] - b[0]) + const eps = 1e-30 + let dx = ma[1][0] - ma[0][0], dy = ma[1][1] - ma[0][1] + for(let i = 2; i < n; i++) { + const cur = ma[i], pre = ma[i - 1] + const dxx = cur[0] - pre[0], dyy = cur[1] - pre[1] + if(BigInt(dxx) * BigInt(dy) !== BigInt(dx) * BigInt(dyy)) res++ + dx = dxx + dy = dyy + } + + return res +}; + +function product(p1, p2, p3) { + // 首先根据坐标计算p1p2和p1p3的向量，然后再计算叉乘 + // p1p2 向量表示为 (p2.x-p1.x,p2.y-p1.y) + // p1p3 向量表示为 (p3.x-p1.x,p3.y-p1.y) + return (p2.x-p1.x)*(p3.y-p1.y) - (p2.y-p1.y)*(p3.x-p1.x); +} From 721e107d2b4a3c18b7cdfaaa228c4a6ff3e794be Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 May 2022 20:41:02 +0800 Subject: [PATCH 0721/2039] Update 995-minimum-number-of-k-consecutive-bit-flips.js --- ...nimum-number-of-k-consecutive-bit-flips.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/995-minimum-number-of-k-consecutive-bit-flips.js b/995-minimum-number-of-k-consecutive-bit-flips.js index 4b26d18b..90a4ad92 100644 --- a/995-minimum-number-of-k-consecutive-bit-flips.js +++ b/995-minimum-number-of-k-consecutive-bit-flips.js @@ -1,3 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minKBitFlips = function(nums, k) { + let cur = 0, res = 0 + const n = nums.length + for(let i = 0; i < n; i++) { + if(i >= k && nums[i - k] === 2) cur-- + if(cur % 2 === nums[i]) { + if(i + k > n) return -1 + nums[i] = 2 + cur++ + res++ + } + } + return res +}; + +// another + /** * @param {number[]} A * @param {number} K From 1180f9e8579cbb39fc1d23a73103ac916e97ae4a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 May 2022 21:10:01 +0800 Subject: [PATCH 0722/2039] Update 1674-minimum-moves-to-make-array-complementary.js --- ...nimum-moves-to-make-array-complementary.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1674-minimum-moves-to-make-array-complementary.js b/1674-minimum-moves-to-make-array-complementary.js index 2fbf8c14..a8b1835b 100644 --- a/1674-minimum-moves-to-make-array-complementary.js +++ b/1674-minimum-moves-to-make-array-complementary.js @@ -56,3 +56,31 @@ const minMoves = function (nums, limit) { return res } + +// another + +/** + * @param {number[]} nums + * @param {number} limit + * @return {number} + */ +const minMoves = function (nums, limit) { + const n = nums.length, { min, max } = Math + const arr = Array(2 * limit + 2).fill(0) + for(let i = 0, r = n / 2; i < r; i++) { + const a = nums[i], b = nums[n - 1 - i] + arr[2] += 2 + arr[min(a, b) + 1]-- + arr[a + b]-- + arr[a + b + 1]++ + arr[max(a, b) + limit + 1]++ + } + let res = Infinity, cur = 0 + for(let i = 2, r = 2 * limit; i <= r; i++) { + cur += arr[i] + res = min(res, cur) + } + + return res +} + From 044aca28b086f1be48d23ee3dc037ee29ff9d07b Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 May 2022 21:34:59 +0800 Subject: [PATCH 0723/2039] Update 1674-minimum-moves-to-make-array-complementary.js --- ...nimum-moves-to-make-array-complementary.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/1674-minimum-moves-to-make-array-complementary.js b/1674-minimum-moves-to-make-array-complementary.js index a8b1835b..c257d2e2 100644 --- a/1674-minimum-moves-to-make-array-complementary.js +++ b/1674-minimum-moves-to-make-array-complementary.js @@ -84,3 +84,36 @@ const minMoves = function (nums, limit) { return res } +// another + +/** + * @param {number[]} nums + * @param {number} limit + * @return {number} + */ +const minMoves = function (nums, limit) { + const n = nums.length, { min, max } = Math + const arr = Array(2 * limit + 2).fill(0) + for(let i = 0, r = n / 2; i < r; i++) { + const a = nums[i], b = nums[n - 1 - i] + // [2, 2 * limit] + arr[2] += 2 + arr[2 * limit + 1] -= 2 + // [min(a, b) + 1, max(a, b) + limit] + arr[min(a, b) + 1]-- + arr[max(a, b) + limit + 1]++ + // a + b + arr[a + b]-- + arr[a + b + 1]++ + + } + let res = Infinity, cur = 0 + for(let i = 2, r = 2 * limit; i <= r; i++) { + cur += arr[i] + res = min(res, cur) + } + + return res +} + + From ada43cb63cc647bd7a174fe2d0dff0f80325c409 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 May 2022 20:42:31 +0800 Subject: [PATCH 0724/2039] Update 798-smallest-rotation-with-highest-score.js --- 798-smallest-rotation-with-highest-score.js | 32 ++++++++++++--------- 1 file changed, 19 insertions(+), 13 deletions(-) diff --git a/798-smallest-rotation-with-highest-score.js b/798-smallest-rotation-with-highest-score.js index fcb6fb0f..a76fca03 100644 --- a/798-smallest-rotation-with-highest-score.js +++ b/798-smallest-rotation-with-highest-score.js @@ -28,16 +28,22 @@ const bestRotation = function(A) { // another -const bestRotation = function(A) { - let n = A.length; - let c = new Array(n).fill(0); - for(let i = 0; i < n; i++) { - c[(i - A[i] + 1 + n) % n] -= 1; - } - let max = 0; - for(let i = 1; i < n; i++) { - c[i] += c[i-1] + 1; - max = c[i] > c[max] ? i : max; - } - return max; -} +/** + * @param {number[]} nums + * @return {number} + */ +var bestRotation = function(nums) { + const n = nums.length + const arr = Array(n).fill(0) + for(let i = 0; i < n; i++) { + arr[(i - nums[i] + 1 + n) % n] -= 1 + } + let res = 0 + for(let i = 1; i < n; i++) { + arr[i] += arr[i - 1] + 1 + if(arr[i] > arr[res]) res = i + } + return res +}; + + From bbc58d54c074dc65de6139d45e3e8ea3aa7699d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 May 2022 13:57:34 +0800 Subject: [PATCH 0725/2039] Create 2290-minimum-obstacle-removal-to-reach-corner.js --- ...inimum-obstacle-removal-to-reach-corner.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2290-minimum-obstacle-removal-to-reach-corner.js diff --git a/2290-minimum-obstacle-removal-to-reach-corner.js b/2290-minimum-obstacle-removal-to-reach-corner.js new file mode 100644 index 00000000..84e799ff --- /dev/null +++ b/2290-minimum-obstacle-removal-to-reach-corner.js @@ -0,0 +1,23 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumObstacles = function(grid) { + const m = grid.length, n = grid[0].length + const dist = Array.from({ length: m }, () => Array(n).fill(Infinity)) + const pq = new MinPriorityQueue({ priority: (x) => x[0] }) + const dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]] + dist[0][0] = 0 + pq.enqueue([dist[0][0], 0, 0]) + while(pq.size()) { + const [v, i, j] = pq.dequeue().element + if(i === m - 1 && j === n - 1) return v + for(const [dx, dy] of dirs) { + const nx = i + dx, ny = j + dy + if(nx >= 0 && nx < m && ny >= 0 && ny < n && v + grid[nx][ny] < dist[nx][ny]) { + dist[nx][ny] = v + grid[nx][ny] + pq.enqueue([dist[nx][ny], nx, ny]) + } + } + } +}; From 881ef4058b4cbc6ecc47871f8f54d74510f9c1a5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 May 2022 14:02:51 +0800 Subject: [PATCH 0726/2039] Create 2288-apply-discount-to-prices.js --- 2288-apply-discount-to-prices.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2288-apply-discount-to-prices.js diff --git a/2288-apply-discount-to-prices.js b/2288-apply-discount-to-prices.js new file mode 100644 index 00000000..c353d5c3 --- /dev/null +++ b/2288-apply-discount-to-prices.js @@ -0,0 +1,16 @@ +/** + * @param {string} sentence + * @param {number} discount + * @return {string} + */ +var discountPrices = function(sentence, discount) { + const arr = sentence.split(' '), n = arr.length + for(let i = 0; i < n; i++) { + const cur = arr[i] + const rest = cur.slice(1) + if(cur.startsWith('$') && rest.length && !Number.isNaN(+rest)) { + arr[i] = '$' + ((+rest) * (100 - discount) / 100).toFixed(2) + } + } + return arr.join(' ') +}; From 92d492ffe30e9a55808cd915d2c23a08a183bc3c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 May 2022 14:03:24 +0800 Subject: [PATCH 0727/2039] Create 2287-rearrange-characters-to-make-target-string.js --- ...rrange-characters-to-make-target-string.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2287-rearrange-characters-to-make-target-string.js diff --git a/2287-rearrange-characters-to-make-target-string.js b/2287-rearrange-characters-to-make-target-string.js new file mode 100644 index 00000000..d7eb46f9 --- /dev/null +++ b/2287-rearrange-characters-to-make-target-string.js @@ -0,0 +1,26 @@ +/** + * @param {string} s + * @param {string} target + * @return {number} + */ +var rearrangeCharacters = function(s, target) { + const a = 'a'.charCodeAt(0), arr = Array(26).fill(0) + for(let ch of target) { + arr[ch.charCodeAt(0) - a]++ + } + let min = Math.min(...arr.filter(e => e > 0)) + const sa = Array(26).fill(0) + for(const e of s) { + sa[e.charCodeAt(0) - a]++ + } + let res = -1 + for(let i = 0; i < 26; i++) { + const sv = sa[i], tv = arr[i] + if(tv === 0) continue + const v = ~~(sv / tv) + if(res === -1) res = v + else res = Math.min(res, v) + } + + return res +}; From 1e058a855de9506205665c3218e02759a8b55c47 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 May 2022 14:14:31 +0800 Subject: [PATCH 0728/2039] Create 2289-steps-to-make-array-non-decreasing.js --- 2289-steps-to-make-array-non-decreasing.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2289-steps-to-make-array-non-decreasing.js diff --git a/2289-steps-to-make-array-non-decreasing.js b/2289-steps-to-make-array-non-decreasing.js new file mode 100644 index 00000000..9e61e117 --- /dev/null +++ b/2289-steps-to-make-array-non-decreasing.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var totalSteps = function(nums) { + const n = nums.length + let res = 0, j = -1; + const dp = Array(n).fill(0), stack = Array(n).fill(0); + for (let i = n - 1; i >= 0; --i) { + while (j >= 0 && nums[i] > nums[stack[j]]) { + dp[i] = Math.max(++dp[i], dp[stack[j--]]) + res = Math.max(res, dp[i]) + } + stack[++j] = i + } + return res +}; From 47cdc19372b5970635ad3b711aa4eac07418ccb8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 May 2022 20:38:07 +0800 Subject: [PATCH 0729/2039] Update 2262-total-appeal-of-a-string.js --- 2262-total-appeal-of-a-string.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/2262-total-appeal-of-a-string.js b/2262-total-appeal-of-a-string.js index 799c6884..5c49b49f 100644 --- a/2262-total-appeal-of-a-string.js +++ b/2262-total-appeal-of-a-string.js @@ -1,3 +1,25 @@ +/** + * @param {string} s + * @return {number} + */ +var appealSum = function (s) { + const pos = Array(26).fill(-1) + let ans = 0 + const n = s.length + const a = 'a'.charCodeAt(0) + for (let i = 0; i < n; i++) { + let tmp = n - i + if (pos[s.charCodeAt(i) - a] !== -1) + tmp += (i - pos[s.charCodeAt(i) - a] - 1) * (n - i) + else tmp += i * (n - i) + ans += tmp + pos[s.charCodeAt(i) - a] = i + } + return ans +} + +// another + /** * @param {string} s * @return {number} From e1fbc0db0fd0ffd8ab614515b1ec4185bd6c733d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 May 2022 20:53:52 +0800 Subject: [PATCH 0730/2039] Update 2262-total-appeal-of-a-string.js --- 2262-total-appeal-of-a-string.js | 25 +++++++++++++------------ 1 file changed, 13 insertions(+), 12 deletions(-) diff --git a/2262-total-appeal-of-a-string.js b/2262-total-appeal-of-a-string.js index 5c49b49f..96fdec98 100644 --- a/2262-total-appeal-of-a-string.js +++ b/2262-total-appeal-of-a-string.js @@ -2,22 +2,23 @@ * @param {string} s * @return {number} */ -var appealSum = function (s) { - const pos = Array(26).fill(-1) - let ans = 0 - const n = s.length +const appealSum = function (s) { + const n = s.length, pos = Array(26).fill(-1) + let res = 0 const a = 'a'.charCodeAt(0) - for (let i = 0; i < n; i++) { - let tmp = n - i - if (pos[s.charCodeAt(i) - a] !== -1) - tmp += (i - pos[s.charCodeAt(i) - a] - 1) * (n - i) - else tmp += i * (n - i) - ans += tmp - pos[s.charCodeAt(i) - a] = i + for(let i = 0; i < n; i++) { + let tmp = n - i, idx = s.charCodeAt(i) - a + if(pos[idx] !== -1) { + tmp += (i - pos[idx] - 1) * (n - i) + } else tmp += i * (n - i) + res += tmp + pos[idx] = i } - return ans + + return res } + // another /** From 2808f120bf47dad7eadcbac083b1256af96cf710 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 30 May 2022 20:58:34 +0800 Subject: [PATCH 0731/2039] Update 828-unique-letter-string.js --- 828-unique-letter-string.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/828-unique-letter-string.js b/828-unique-letter-string.js index aa19ae71..62fa088a 100644 --- a/828-unique-letter-string.js +++ b/828-unique-letter-string.js @@ -1,3 +1,27 @@ +/** + * @param {string} s + * @return {number} + */ +const uniqueLetterString = function(s) { + const n = s.length + const arr = Array.from({ length: 26 }, () => Array(2).fill(-1)) + const A = 'A'.charCodeAt(0) + let res = 0 + for(let i = 0; i < n; i++) { + const idx = s.charCodeAt(i) - A + res += (i - arr[idx][1]) * (arr[idx][1] - arr[idx][0]) + arr[idx] = [arr[idx][1], i] + } + + for(let i = 0; i < 26; i++) { + res += (n - arr[i][1]) * (arr[i][1] - arr[i][0]) + } + + return res +}; + +// another + /** * @param {string} S * @return {number} From fce34a391d773b59cea3f1c8d5ad9bc7401163af Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 31 May 2022 22:09:33 +0800 Subject: [PATCH 0732/2039] Update 907-sum-of-subarray-minimums.js --- 907-sum-of-subarray-minimums.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/907-sum-of-subarray-minimums.js b/907-sum-of-subarray-minimums.js index c3c785c8..52e0a139 100644 --- a/907-sum-of-subarray-minimums.js +++ b/907-sum-of-subarray-minimums.js @@ -1,3 +1,35 @@ + +/** + * @param {number[]} arr + * @return {number} + */ + const sumSubarrayMins = function (arr) { + const n = arr.length + const mod = 1e9 + 7, stk = [] + const left = Array(n), right = Array(n) + for(let i = 0; i< n; i++) { + left[i] = i + 1 + right[i] = n - i + } + let res = 0 + for(let i = 0; i < n; i++) { + while(stk.length && arr[stk[stk.length - 1]] > arr[i]) { + const idx = stk.pop() + right[idx] = i - idx + } + if (stk.length) left[i] = i - stk[stk.length - 1] + stk.push(i) + + } + for(let i = 0; i < n; i++) { + res = (res + arr[i] * left[i] * right[i]) % mod + } + + return res +} + +// another + /** * @param {number[]} arr * @return {number} From 303f4de76de28ab017cd23b8c388b7953baedb91 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 1 Jun 2022 21:02:23 +0800 Subject: [PATCH 0733/2039] Update 1856-maximum-subarray-min-product.js --- 1856-maximum-subarray-min-product.js | 47 ++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1856-maximum-subarray-min-product.js b/1856-maximum-subarray-min-product.js index 163784e3..aef4a778 100644 --- a/1856-maximum-subarray-min-product.js +++ b/1856-maximum-subarray-min-product.js @@ -1,3 +1,50 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxSumMinProduct = function(nums) { + const n = nums.length, left = Array(n).fill(0), right = Array(n).fill(n - 1) + const mod = BigInt(1e9 + 7) + let res = 0n + let stk = [] + for(let i = 0; i < n; i++) { + while(stk.length && nums[stk[stk.length - 1]] >= nums[i]) { + stk.pop() + } + left[i] = stk.length ? stk[stk.length - 1] + 1 : 0 + stk.push(i) + } + + stk = [] + for(let i = n - 1; i >= 0; i--) { + while(stk.length && nums[stk[stk.length - 1]] >= nums[i]) { + stk.pop() + } + right[i] = stk.length ? stk[stk.length - 1] - 1 : n - 1 + stk.push(i) + } + + const preSum = [] + for(let i = 0; i < n; i++) { + preSum[i] = (i === 0 ? 0n : preSum[i - 1]) + BigInt(nums[i]) + } + for(let i = 0; i < n; i++) { + res = max(res, fn(nums[i], left[i], right[i])) + } + + return res % mod + + function max(a, b) { + return a > b ? a : b + } + function fn(v, l, r) { + return BigInt(v) * (l === 0 ? preSum[r] : preSum[r] - preSum[l - 1]) + } +}; + +// another + + /** * @param {number[]} nums * @return {number} From 2d3c5ba09b0329d3d724b39ceee9c0c09fd163fb Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Jun 2022 22:31:22 +0800 Subject: [PATCH 0734/2039] Update 2104-sum-of-subarray-ranges.js --- 2104-sum-of-subarray-ranges.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/2104-sum-of-subarray-ranges.js b/2104-sum-of-subarray-ranges.js index c3fae69d..2feb3f2e 100644 --- a/2104-sum-of-subarray-ranges.js +++ b/2104-sum-of-subarray-ranges.js @@ -16,3 +16,22 @@ const subArrayRanges = function(nums) { } return res }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const subArrayRanges = function(nums) { + let res = 0, n = nums.length + for(let i = 0; i < n; i++) { + let max = nums[i], min = nums[i] + for(let j = i; j < n; j++) { + max = Math.max(max, nums[j]) + min = Math.min(min, nums[j]) + res += max - min + } + } + return res +}; From 53c020ba130298f96b4100b78e285ab987aa3d81 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Jun 2022 18:41:22 +0800 Subject: [PATCH 0735/2039] Create 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js --- ...es-that-satisfy-the-given-sum-condition.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js diff --git a/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js b/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js new file mode 100644 index 00000000..8803f183 --- /dev/null +++ b/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +const numSubseq = function(nums, target) { + const n = nums.length, pow = Array(n), mod = 1e9 + 7 + pow[0] = 1 + for(let i = 1; i < n; i++) { + pow[i] = (pow[i - 1] * 2) % mod + } + nums.sort((a, b) => a - b) + let l = 0, r = n - 1, res = 0 + while(l <= r) { + if(nums[l] + nums[r] > target) r-- + else { + res = (res + pow[r - l]) % mod + l++ + } + } + + return res +}; From 2bb34c6d01715b4f5eb071161b323006572fcb5e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Jun 2022 22:42:31 +0800 Subject: [PATCH 0736/2039] Create 799-champagne-tower.js --- 799-champagne-tower.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 799-champagne-tower.js diff --git a/799-champagne-tower.js b/799-champagne-tower.js new file mode 100644 index 00000000..fba3c3bd --- /dev/null +++ b/799-champagne-tower.js @@ -0,0 +1,22 @@ +/** + * @param {number} poured + * @param {number} query_row + * @param {number} query_glass + * @return {number} + */ +const champagneTower = function(poured, query_row, query_glass) { + let curRow = [poured] + for(let i = 0; i <= query_row; i++) { + const nxtRow = Array(i + 2).fill(0) + for(let j = 0; j <= i; j++) { + if(curRow[j] > 1) { + nxtRow[j] += (curRow[j] - 1) / 2 + nxtRow[j + 1] += (curRow[j] - 1) / 2 + curRow[j] = 1 + } + } + if(i !== query_row) curRow = nxtRow + } + + return curRow[query_glass] +}; From 7b266620321fe3323bf92a1474afdd95cc4c228e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Jun 2022 23:20:42 +0800 Subject: [PATCH 0737/2039] Create 789-escape-the-ghosts.js --- 789-escape-the-ghosts.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 789-escape-the-ghosts.js diff --git a/789-escape-the-ghosts.js b/789-escape-the-ghosts.js new file mode 100644 index 00000000..56e18c45 --- /dev/null +++ b/789-escape-the-ghosts.js @@ -0,0 +1,15 @@ +/** + * @param {number[][]} ghosts + * @param {number[]} target + * @return {boolean} + */ +var escapeGhosts = function(ghosts, target) { + let res = true + const { abs } = Math, steps = abs(target[0]) + abs(target[1]) + const [tx, ty] = target + for(const [x, y] of ghosts) { + if(abs(tx - x) + abs(ty - y) <= steps) return false + } + + return res +}; From 6216f1cac449f172de105ff3ff1aeae77a974291 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 4 Jun 2022 21:53:41 +0800 Subject: [PATCH 0738/2039] Create 2281-sum-of-total-strength-of-wizards.js --- 2281-sum-of-total-strength-of-wizards.js | 53 ++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 2281-sum-of-total-strength-of-wizards.js diff --git a/2281-sum-of-total-strength-of-wizards.js b/2281-sum-of-total-strength-of-wizards.js new file mode 100644 index 00000000..5c6e9e1f --- /dev/null +++ b/2281-sum-of-total-strength-of-wizards.js @@ -0,0 +1,53 @@ +/** + * @param {number[]} strength + * @return {number} + */ +const totalStrength = function (strength) { + const mod = BigInt(1e9 + 7) + let res = 0n + const n = strength.length + strength = strength.map(e => BigInt(e)) + const leftsum = Array(n + 1).fill(0n), + rightsum = Array(n + 1).fill(0n), + leftmul = Array(n + 1).fill(0n), + rightmul = Array(n + 1).fill(0n) + const asc = [] + const big = BigInt + + for (let i = 0; i < n; i++) { + leftsum[i + 1] = (leftsum[i] + strength[i]) % mod + leftmul[i + 1] = (leftmul[i] + big(i + 1) * strength[i]) % mod + } + + for (let i = n - 1; i >= 0; i--) { + rightsum[i] = (rightsum[i + 1] + strength[i]) % mod + rightmul[i] = (rightmul[i + 1] + big(n - i) * strength[i]) % mod + } + + // j is the exclusive right index + for (let j = 0; j <= n; j++) { + while ( + asc.length && + (j === n || strength[asc[asc.length - 1]] >= strength[j]) + ) { + const k = asc.pop() + const i = asc.length === 0 ? 0 : asc[asc.length - 1] + 1 + const left = + (mod + + leftmul[k + 1] - + leftmul[i] - + ((big(i) * (leftsum[k + 1] - leftsum[i])) % mod)) % + mod + const right = + (mod + + rightmul[k + 1] - + rightmul[j] - + ((big(n - j) * (rightsum[k + 1] - rightsum[j])) % mod)) % + mod + const sum = (left * big(j - k) + right * big(k - i + 1)) % mod + res = (res + sum * strength[k]) % mod + } + asc.push(j) + } + return res +} From 005aaf41b70377379acb4a6390b2343b2ad536d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Jun 2022 12:26:26 +0800 Subject: [PATCH 0739/2039] Create 2293-min-max-game.js --- 2293-min-max-game.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2293-min-max-game.js diff --git a/2293-min-max-game.js b/2293-min-max-game.js new file mode 100644 index 00000000..ba574743 --- /dev/null +++ b/2293-min-max-game.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minMaxGame = function(nums) { + let cur = nums + while(cur.length > 1) { + const n = cur.length + const tmp = Array(n / 2) + for(let i = 0; i < n / 2; i++) { + const odd = i % 2 === 1 + if(odd) { + tmp[i] = Math.max(cur[2 * i], cur[2 * i + 1]) + } else { + tmp[i] = Math.min(cur[2 * i], cur[2 * i + 1]) + } + } + cur = tmp + } + + return cur[0] +}; From 4685af942a30289fc57d09fae7771819fe62f04d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Jun 2022 12:26:55 +0800 Subject: [PATCH 0740/2039] Create 2294-partition-array-such-that-maximum-difference-is-k.js --- ...-array-such-that-maximum-difference-is-k.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2294-partition-array-such-that-maximum-difference-is-k.js diff --git a/2294-partition-array-such-that-maximum-difference-is-k.js b/2294-partition-array-such-that-maximum-difference-is-k.js new file mode 100644 index 00000000..86db6794 --- /dev/null +++ b/2294-partition-array-such-that-maximum-difference-is-k.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var partitionArray = function(nums, k) { + nums.sort((a, b) => a - b) + let res = 1, pre = nums[0], n = nums.length + for(let i = 1; i < n; i++) { + const cur = nums[i] + if(cur - pre > k) { + res++ + pre = cur + } + } + + return res +}; From 67e3454e9302e9be71dca8cce98212a4cbe66de9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Jun 2022 12:27:20 +0800 Subject: [PATCH 0741/2039] Create 2295-replace-elements-in-an-array.js --- 2295-replace-elements-in-an-array.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2295-replace-elements-in-an-array.js diff --git a/2295-replace-elements-in-an-array.js b/2295-replace-elements-in-an-array.js new file mode 100644 index 00000000..97a9fd71 --- /dev/null +++ b/2295-replace-elements-in-an-array.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @param {number[][]} operations + * @return {number[]} + */ +var arrayChange = function(nums, operations) { + const map = new Map(), n = nums.length + const res = Array(n) + for(let i = 0; i < n; i++) { + const cur = nums[i] + map.set(cur, i) + res[i] = cur + } + + for(const [v, vv] of operations) { + const idx = map.get(v) + res[idx] = vv + map.set(vv, idx) + } + + return res +}; From bd78e5056835b30b32ce32f7448dbd4d3a3e531e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Jun 2022 12:27:48 +0800 Subject: [PATCH 0742/2039] Create 2296-design-a-text-editor.js --- 2296-design-a-text-editor.js | 73 ++++++++++++++++++++++++++++++++++++ 1 file changed, 73 insertions(+) create mode 100644 2296-design-a-text-editor.js diff --git a/2296-design-a-text-editor.js b/2296-design-a-text-editor.js new file mode 100644 index 00000000..d7e1b392 --- /dev/null +++ b/2296-design-a-text-editor.js @@ -0,0 +1,73 @@ +class Node { + constructor(val) { + this.val = val + this.prev = null + this.next = null + } +} + +var TextEditor = function() { + this.left = [] + this.right = [] + this.idx = 0 +}; + +/** + * @param {string} text + * @return {void} + */ +TextEditor.prototype.addText = function(text) { + for(const ch of text) this.left.push(ch) +}; + +/** + * @param {number} k + * @return {number} + */ +TextEditor.prototype.deleteText = function(k) { + let res = 0 + while(this.left.length && k) { + res++ + this.left.pop() + k-- + } + return res +}; + +/** + * @param {number} k + * @return {string} + */ +TextEditor.prototype.cursorLeft = function(k) { + while(k && this.left.length) { + const tmp = this.left.pop() + this.right.push(tmp) + k-- + } + + return this.left.slice(Math.max(0, this.left.length - 10), this.left.length).join('') +}; + +/** + * @param {number} k + * @return {string} + */ +TextEditor.prototype.cursorRight = function(k) { + while(k && this.right.length) { + const tmp = this.right.pop() + this.left.push(tmp) + k-- + } + + return this.left.slice(Math.max(0, this.left.length - 10), this.left.length).join('') +}; + + +/** + * Your TextEditor object will be instantiated and called as such: + * var obj = new TextEditor() + * obj.addText(text) + * var param_2 = obj.deleteText(k) + * var param_3 = obj.cursorLeft(k) + * var param_4 = obj.cursorRight(k) + */ From dda0512f46b59fa1f179a3de72c9b4413351c665 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Jun 2022 21:42:49 +0800 Subject: [PATCH 0743/2039] Update 715-range-module.js --- 715-range-module.js | 84 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 84 insertions(+) diff --git a/715-range-module.js b/715-range-module.js index 3b9e4b9f..abeb83e4 100644 --- a/715-range-module.js +++ b/715-range-module.js @@ -198,3 +198,87 @@ RangeModule.prototype.removeRange = function (left, right) { * var param_2 = obj.queryRange(left,right) * obj.removeRange(left,right) */ + +// another + +const RangeModule = function () { + this.intervals = [] +} + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.addRange = function (left, right) { + const tmp = [] + const n = this.intervals.length + for(let i = 0; i <= n; i++) { + const cur = this.intervals[i] + if(i === n || cur[0] > right) { + tmp.push([left, right]) + while(i < n) tmp.push(this.intervals[i++]) + }else if(cur[1] < left) { + tmp.push(cur) + }else { + // cur[0] <= right + // left <= cur[1] + left = Math.min(left, cur[0]) + right = Math.max(right, cur[1]) + } + } + // console.log(tmp) + this.intervals = tmp +} + +/** + * @param {number} left + * @param {number} right + * @return {boolean} + */ +RangeModule.prototype.queryRange = function (left, right) { + const n = this.intervals.length, arr = this.intervals + let l = 0, r = n - 1 + while(l <= r) { + const mid = ~~(l + (r - l) / 2) + if(arr[mid][0] >= right) r = mid - 1 + else if(arr[mid][1] <= left) l = mid + 1 + else return arr[mid][0] <= left && arr[mid][1] >= right + } + + return false +} + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.removeRange = function (left, right) { + const tmp = [] + const n = this.intervals.length + + for(let i = 0; i < n; i++) { + const cur = this.intervals[i] + if(cur[1] < left) { + tmp.push(cur) + }else if(cur[0] > right) tmp.push(cur) + else { + // left <= cur[1] + // cur[0] <= right + if(left > cur[0]) tmp.push([cur[0], left]) + if(right < cur[1]) tmp.push([right, cur[1]]) + } + } + // console.log(tmp) + this.intervals = tmp +} + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = new RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */ + From 73e0fdd8800dcb1700339bd949a1bbce2baf6459 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Jun 2022 10:38:13 +0800 Subject: [PATCH 0744/2039] Update 2276-count-integers-in-intervals.js --- 2276-count-integers-in-intervals.js | 80 +++++++++++++++++++++++++++++ 1 file changed, 80 insertions(+) diff --git a/2276-count-integers-in-intervals.js b/2276-count-integers-in-intervals.js index 27e49fca..1fb492ad 100644 --- a/2276-count-integers-in-intervals.js +++ b/2276-count-integers-in-intervals.js @@ -1,3 +1,83 @@ +function binarySearch(l, r, fn) { + while (l <= r) { + const m = Math.floor((l + r) / 2) + if (fn(m)) { + l = m + 1 + } else { + r = m - 1 + } + } + return r +} + +var CountIntervals = function () { + this.intervals = [] + this.size = 0 +} + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +CountIntervals.prototype.add = function (left, right) { + const intervals = this.intervals + if (!intervals.length) { + intervals.push({ left, right }) + this.size += right - left + 1 + } else if (left > intervals[intervals.length - 1].right) { + intervals.push({ left, right }) + this.size += right - left + 1 + } else if (right < intervals[0].left) { + intervals.unshift({ left, right }) + this.size += right - left + 1 + } else { + const i = binarySearch(0, intervals.length - 1, (x) => { + return intervals[x].left < left + }) + let j, + start, + end, + sum = 0 + if (i < 0 || intervals[i].right < left) { + j = i + 1 + start = left + end = right + } else { + j = i + start = intervals[j].left + end = right + } + let first = -1 + while (j < intervals.length && right >= intervals[j].left) { + if (first < 0) first = j + end = Math.max(end, intervals[j].right) + sum += intervals[j].right - intervals[j].left + 1 + j++ + } + // delete [first, j) + // console.log('delete', j - first, '-', first, j) + this.size += end - start + 1 - sum + if (first < 0) { + this.intervals.splice(i + 1, 0, { left: start, right: end }) + } else { + this.intervals.splice(first, j - first, { left: start, right: end }) + } + } +} + +/** + * @return {number} + */ +CountIntervals.prototype.count = function () { + return this.size +} + + +// another + + + var CountIntervals = function () { this.root = new Node(1, 10 ** 9) } From 26c9daa1a599915276f90151ac9ada8de2cee967 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Jun 2022 21:00:00 +0800 Subject: [PATCH 0745/2039] Update 2276-count-integers-in-intervals.js --- 2276-count-integers-in-intervals.js | 42 +++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/2276-count-integers-in-intervals.js b/2276-count-integers-in-intervals.js index 1fb492ad..2647fd6b 100644 --- a/2276-count-integers-in-intervals.js +++ b/2276-count-integers-in-intervals.js @@ -1,3 +1,45 @@ +var CountIntervals = function() { + this.intervals = [] + this.ans = 0 +}; + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +CountIntervals.prototype.add = function(left, right) { + let l = 0, r = this.intervals.length + while (l < r) { + const m = Math.floor((l + r) / 2) + if (this.intervals[m][1] >= left) { + r = m + } else { + l = m + 1 + } + } + + let index = l + while (index < this.intervals.length && this.intervals[index][0] <= right) { + left = Math.min(left, this.intervals[index][0]) + right = Math.max(right, this.intervals[index][1]) + this.ans -= this.intervals[index][1] - this.intervals[index][0] + 1 + index += 1 + } + this.ans += right - left + 1 + this.intervals.splice(l, index - l, [left, right]) +}; + + +/** + * @return {number} + */ +CountIntervals.prototype.count = function() { + return this.ans +}; + +// another + function binarySearch(l, r, fn) { while (l <= r) { const m = Math.floor((l + r) / 2) From e75e86a02398a81cfc2a9bd6ea87436cb3e3bfb6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Jun 2022 22:13:25 +0800 Subject: [PATCH 0746/2039] Create 1825-finding-mk-average.js --- 1825-finding-mk-average.js | 109 +++++++++++++++++++++++++++++++++++++ 1 file changed, 109 insertions(+) create mode 100644 1825-finding-mk-average.js diff --git a/1825-finding-mk-average.js b/1825-finding-mk-average.js new file mode 100644 index 00000000..a6936047 --- /dev/null +++ b/1825-finding-mk-average.js @@ -0,0 +1,109 @@ +/** + * @param {number} m + * @param {number} k + */ +const MKAverage = function (m, k) { + this.sum = 0 + this.dataBuff = [] + this.dataM = [] + this.m = m + this.k = k + this.count = m - k - k +} +/** + * @param {number} num + * @return {void} + */ +MKAverage.prototype.addElement = function (num) { + const total = this.dataBuff.length + this.dataBuff.push(num) + if (total >= this.m) { + let index = binarySearch( + this.dataBuff, + this.dataM, + this.dataBuff[total - this.m] + ) + this.dataM[index] = this.dataBuff.length - 1 + if (index === 0 || num > this.dataBuff[this.dataM[index - 1]]) { + move2End(this.dataBuff, this.dataM, index) + } else if ( + index === this.m - 1 || + num < this.dataBuff[this.dataM[index - 1]] + ) { + move2Start(this.dataBuff, this.dataM, index) + } + + this.sum = 0 + } else { + this.dataM.push(this.dataBuff.length - 1) + move2Start(this.dataBuff, this.dataM, this.dataBuff.length - 1) + } +} + +/** + * @return {number} + */ +MKAverage.prototype.calculateMKAverage = function () { + if (this.dataM.length < this.m) { + return -1 + } else { + if (!this.sum) { + this.sum = calcSum(this.dataBuff, this.dataM, this.k, this.count) + } + return Math.floor(this.sum / this.count) + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * var obj = new MKAverage(m, k) + * obj.addElement(num) + * var param_2 = obj.calculateMKAverage() + */ +function binarySearch(numArr, indexArr, tar) { + let left = 0 + let right = indexArr.length - 1 + + while (left <= right) { + let mid = (left + right) >>> 1 + + if (numArr[indexArr[mid]] > tar) { + right = mid - 1 + } else if (numArr[indexArr[mid]] < tar) { + left = mid + 1 + } else { + return mid + } + } +} +function move2Start(numArr, indexArr, index) { + let tmp + + while (index > 0 && numArr[indexArr[index]] < numArr[indexArr[index - 1]]) { + tmp = indexArr[index] + indexArr[index] = indexArr[index - 1] + indexArr[index - 1] = tmp + index-- + } +} +function move2End(numArr, indexArr, index) { + let tmp + + while ( + index < indexArr.length - 1 && + numArr[indexArr[index]] > numArr[indexArr[index + 1]] + ) { + tmp = indexArr[index] + indexArr[index] = indexArr[index + 1] + indexArr[index + 1] = tmp + index++ + } +} + +function calcSum(numArr, indexArr, start, count) { + let sum = 0 + for (let i = 0; i < count; i++) { + sum += numArr[indexArr[i + start]] + } + return sum +} From 0b760be5440fb25f314045fc51e7f36cc81859b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Jun 2022 21:13:34 +0800 Subject: [PATCH 0747/2039] Create 2102-sequentially-ordinal-rank-tracker.js --- 2102-sequentially-ordinal-rank-tracker.js | 112 ++++++++++++++++++++++ 1 file changed, 112 insertions(+) create mode 100644 2102-sequentially-ordinal-rank-tracker.js diff --git a/2102-sequentially-ordinal-rank-tracker.js b/2102-sequentially-ordinal-rank-tracker.js new file mode 100644 index 00000000..dd976e51 --- /dev/null +++ b/2102-sequentially-ordinal-rank-tracker.js @@ -0,0 +1,112 @@ +const maxComp = (a, b) => { + return a[1] === b[1] ? b[0].localeCompare(a[0]) > 0 : a[1] > b[1] +} + +const minComp = (a, b) => { + return a[1] === b[1] ? a[0].localeCompare(b[0]) > 0: a[1] < b[1] +} + +const SORTracker = function() { + // max + this.pq = new PriorityQueue(maxComp) + // min + this.best = new PriorityQueue(minComp) +}; + +/** + * @param {string} name + * @param {number} score + * @return {void} + */ +SORTracker.prototype.add = function(name, score) { + this.pq.push([name, score]) + while(!this.best.isEmpty() && maxComp(this.pq.peek(), this.best.peek())) { + const a = this.best.pop(), b = this.pq.pop() + this.best.push(b) + this.pq.push(a) + } +}; + +/** + * @return {string} + */ +SORTracker.prototype.get = function() { + const tmp = this.pq.pop() + this.best.push(tmp) + return tmp[0] +}; + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = new SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */ + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From dee7d338e400e4392706b8d34ab069af00115856 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 9 Jun 2022 19:19:55 +0800 Subject: [PATCH 0748/2039] Create 2213-longest-substring-of-one-repeating-character.js --- ...st-substring-of-one-repeating-character.js | 105 ++++++++++++++++++ 1 file changed, 105 insertions(+) create mode 100644 2213-longest-substring-of-one-repeating-character.js diff --git a/2213-longest-substring-of-one-repeating-character.js b/2213-longest-substring-of-one-repeating-character.js new file mode 100644 index 00000000..cb527cb1 --- /dev/null +++ b/2213-longest-substring-of-one-repeating-character.js @@ -0,0 +1,105 @@ +/** + * @param {string} s + * @param {string} queryCharacters + * @param {number[]} queryIndices + * @return {number[]} + */ +const longestRepeating = function(s, queryCharacters, queryIndices) { + let n = queryCharacters.length + const ans = [] + + const segmentTree = new SegmentTree(s) + for (let i = 0; i < n; i++) { + segmentTree.update(1, 0, s.length - 1, queryIndices[i], queryCharacters[i]) + ans.push(segmentTree.getMax()) + } + + return ans +}; + +class TreeNode { + constructor(max, preStart, preEnd, sufStart, sufEnd) { + this.max = max + this.preStart = preStart + this.preEnd = preEnd + this.sufStart = sufStart + this.sufEnd = sufEnd + } +} + +class SegmentTree { + constructor(s) { + this.n = s.length + this.s = s.split('') + this.tree = new Array(4 * s.length) + this.build(s, 1, 0, s.length - 1) + } + + build(s, treeIndex, left, right) { + if (left === right) { + this.tree[treeIndex] = new TreeNode(1, left, left, right, right) + return + } + + let mid = left + Math.floor((right - left) / 2) + this.build(s, treeIndex * 2, left, mid) + this.build(s, treeIndex * 2 + 1, mid + 1, right) + + this.tree[treeIndex] = this.merge( + this.tree[treeIndex * 2], + this.tree[treeIndex * 2 + 1], + left, + mid, + right + ) + } + + update(treeIndex, left, right, index, val) { + if (left === right) { + this.tree[treeIndex] = new TreeNode(1, left, left, right, right) + this.s[index] = val + return + } + + let mid = left + Math.floor((right - left) / 2) + if (mid < index) { + this.update(treeIndex * 2 + 1, mid + 1, right, index, val) + } else { + this.update(treeIndex * 2, left, mid, index, val) + } + + this.tree[treeIndex] = this.merge( + this.tree[treeIndex * 2], + this.tree[treeIndex * 2 + 1], + left, + mid, + right + ) + } + + merge(l, r, left, mid, right) { + let max = Math.max(l.max, r.max) + let preStart = l.preStart + let preEnd = l.preEnd + let sufStart = r.sufStart + let sufEnd = r.sufEnd + + if (this.s[mid] === this.s[mid + 1]) { + max = Math.max(max, r.preEnd - l.sufStart + 1) + if (l.preEnd - l.preStart + 1 === mid - left + 1) { + preEnd = r.preEnd + } + if (r.sufEnd - r.sufStart + 1 === right - mid) { + sufStart = l.sufStart + } + } + + return new TreeNode(max, preStart, preEnd, sufStart, sufEnd) + } + + getMax() { + return this.tree[1].max + } +} + + From 2fba763f234526a6aa5798dd122366c27a6cb57d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 10 Jun 2022 19:57:53 +0800 Subject: [PATCH 0749/2039] Create 2286-booking-concert-tickets-in-groups.js --- 2286-booking-concert-tickets-in-groups.js | 123 ++++++++++++++++++++++ 1 file changed, 123 insertions(+) create mode 100644 2286-booking-concert-tickets-in-groups.js diff --git a/2286-booking-concert-tickets-in-groups.js b/2286-booking-concert-tickets-in-groups.js new file mode 100644 index 00000000..231a0e73 --- /dev/null +++ b/2286-booking-concert-tickets-in-groups.js @@ -0,0 +1,123 @@ +/** + * @param {number} n + * @param {number} m + */ +function BookMyShow(n, m) { + let a = Array(n).fill(0), st = new SegmentTreeRMQ(a), fen = new Fenwick(n + 3); + for (let i = 0; i < n; i++) fen.update(i, m); + return { gather, scatter } + function gather(k, maxRow) { + let idx = st.indexOf(0, m - k); + if (idx == -1 || idx > maxRow) return []; + let min = st.minx(idx, idx + 1); + st.update(idx, min + k); + fen.update(idx, -k); + return [idx, min]; + } + function scatter(k, maxRow) { + let totToMaxRow = fen.query(maxRow); + if (totToMaxRow < k) return false; + while (k > 0) { + let idx = st.indexOf(0, m - 1); + if (idx == -1 || idx > maxRow) break; + let min = st.minx(idx, idx + 1); + let use = Math.min(k, m - min); + k -= use; + st.update(idx, min + use); + fen.update(idx, -use); + } + return true; + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * var obj = new BookMyShow(n, m) + * var param_1 = obj.gather(k,maxRow) + * var param_2 = obj.scatter(k,maxRow) + */ +////////////////////////////////////////////////// Template //////////////////////////////////////////////////////////////////// +function Fenwick(n) { + let a = Array(n).fill(0); + return { query, update, rangeSum, tree } + function query(i) { // [0, i] prefix sum + let sum = 0; + for (i++; i > 0; i = parent(i)) sum += a[i]; + return sum; + } + function update(i, v) { + for (i++; i < n; i = next(i)) a[i] += v; + } + function rangeSum(l, r) { + return query(r) - query(l - 1); + } + function parent(x) { + return x - lowestOneBit(x); + } + function next(x) { + return x + lowestOneBit(x); + } + function lowestOneBit(x) { + return x & -x; + } + function tree() { + return a; + } +} + +function SegmentTreeRMQ(A) { + let n = A.length, h = Math.ceil(Math.log2(n)), len = 2 * 2 ** h, a = Array(len).fill(Number.MAX_SAFE_INTEGER); + h = 2 ** h; + initializeFromArray(); + return { update, minx, indexOf, tree } + function initializeFromArray() { + for (let i = 0; i < n; i++) a[h + i] = A[i]; + for (let i = h - 1; i >= 1; i--) propagate(i); + } + function update(pos, v) { + a[h + pos] = v; + for (let i = parent(h + pos); i >= 1; i = parent(i)) propagate(i); + } + function propagate(i) { + a[i] = Math.min(a[left(i)], a[right(i)]); + } + function minx(l, r) { + let min = Number.MAX_SAFE_INTEGER; + if (l >= r) return min; + l += h; + r += h; + for (; l < r; l = parent(l), r = parent(r)) { + if (l & 1) min = Math.min(min, a[l++]); + if (r & 1) min = Math.min(min, a[--r]); + } + return min; + } + function indexOf(l, v) { + if (l >= h) return -1; + let cur = h + l; + while (1) { + if (a[cur] <= v) { + if (cur >= h) return cur - h; + cur = left(cur); + } else { + cur++; + if ((cur & cur - 1) == 0) return -1; + if (cur % 2 == 0) cur = parent(cur); + } + } + } + function parent(i) { + return i >> 1; + } + function left(i) { + return 2 * i; + } + function right(i) { + return 2 * i + 1; + } + function tree() { + return a; + } +} +////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + From 5857549cfda071aed60c4efe0e63f7718986802b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 11 Jun 2022 21:02:45 +0800 Subject: [PATCH 0750/2039] Create 2271-maximum-white-tiles-covered-by-a-carpet.js --- ...maximum-white-tiles-covered-by-a-carpet.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2271-maximum-white-tiles-covered-by-a-carpet.js diff --git a/2271-maximum-white-tiles-covered-by-a-carpet.js b/2271-maximum-white-tiles-covered-by-a-carpet.js new file mode 100644 index 00000000..18c428b1 --- /dev/null +++ b/2271-maximum-white-tiles-covered-by-a-carpet.js @@ -0,0 +1,29 @@ +/** + * @param {number[][]} tiles + * @param {number} carpetLen + * @return {number} + */ +const maximumWhiteTiles = function (tiles, carpetLen) { + const sorted = tiles.sort((a, b) => a[0] - b[0]) + let res = 0 + + let total = 0 + let right = 0 + + for (let tile of sorted) { + const start = tile[0] + const end = start + carpetLen - 1 + while (right < sorted.length && tiles[right][1] < end) { + total += tiles[right][1] - tiles[right][0] + 1 + right++ + } + if (right === sorted.length || sorted[right][0] > end) { + res = Math.max(res, total) + } else { + res = Math.max(res, total + (end - tiles[right][0] + 1)) + } + total -= tile[1] - tile[0] + 1 + } + + return res +} From ada8e8049acb424fedbe338c103db6044a48093a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 11 Jun 2022 21:22:27 +0800 Subject: [PATCH 0751/2039] Update 2271-maximum-white-tiles-covered-by-a-carpet.js --- ...maximum-white-tiles-covered-by-a-carpet.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2271-maximum-white-tiles-covered-by-a-carpet.js b/2271-maximum-white-tiles-covered-by-a-carpet.js index 18c428b1..f19e23d8 100644 --- a/2271-maximum-white-tiles-covered-by-a-carpet.js +++ b/2271-maximum-white-tiles-covered-by-a-carpet.js @@ -27,3 +27,34 @@ const maximumWhiteTiles = function (tiles, carpetLen) { return res } + +// another + +/** + * @param {number[][]} tiles + * @param {number} carpetLen + * @return {number} + */ +const maximumWhiteTiles = function (tiles, carpetLen) { + tiles.sort((a, b) => a[0] - b[0]) + let res = 0, total = 0, right = 0 + const n = tiles.length + for(let i = 0; i < n; i++) { + const [l, r] = tiles[i] + const end = l + carpetLen - 1 + while(right < n && tiles[right][1] <= end) { + total += tiles[right][1] - tiles[right][0] + 1 + right++ + } + + if(right === n || tiles[right][0] > end) { + res = Math.max(res, total) + } else { + res = Math.max(res, total + end - tiles[right][0] + 1) + } + + total -= r - l + 1 + } + + return res +} From 6879876322971801516a1beb8c5fc2f2f1c0aada Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Jun 2022 21:30:38 +0800 Subject: [PATCH 0752/2039] Create 2304-minimum-path-cost-in-a-grid.js --- 2304-minimum-path-cost-in-a-grid.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2304-minimum-path-cost-in-a-grid.js diff --git a/2304-minimum-path-cost-in-a-grid.js b/2304-minimum-path-cost-in-a-grid.js new file mode 100644 index 00000000..65d117c1 --- /dev/null +++ b/2304-minimum-path-cost-in-a-grid.js @@ -0,0 +1,29 @@ +/** + * @param {number[][]} grid + * @param {number[][]} moveCost + * @return {number} + */ +var minPathCost = function(grid, moveCost) { + const m = grid.length, n = grid[0].length + const memo = Array.from({ length: 2 }, () => Array(n)) + for(let i = 0; i < n; i++) { + memo[0][i] = grid[0][i] + } + let cur = 0 + for(let i = 0; i < m - 1; i++) { + const nxt = cur ^ 1 + for(let t = 0; t < n; t++) { + memo[nxt][t] = Infinity + } + for(let j = 0; j < n; j++) { + const v = grid[i][j] + for(let k = 0; k < n; k++) { + const cost = moveCost[v][k] + memo[nxt][k] = Math.min(memo[nxt][k], memo[cur][j] + grid[i + 1][k] + cost) + } + } + cur ^= 1 + } + + return Math.min(...memo[cur]) +}; From a9eed43e3bc05697257b5ac1900dd4b803537679 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Jun 2022 21:31:13 +0800 Subject: [PATCH 0753/2039] Create 2303-calculate-amount-paid-in-taxes.js --- 2303-calculate-amount-paid-in-taxes.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2303-calculate-amount-paid-in-taxes.js diff --git a/2303-calculate-amount-paid-in-taxes.js b/2303-calculate-amount-paid-in-taxes.js new file mode 100644 index 00000000..fd731f22 --- /dev/null +++ b/2303-calculate-amount-paid-in-taxes.js @@ -0,0 +1,22 @@ +/** + * @param {number[][]} brackets + * @param {number} income + * @return {number} + */ +var calculateTax = function(brackets, income) { + let res = 0 + const arr = brackets + let first = Math.min(income, arr[0][0]) + res = first * arr[0][1] / 100 + let remain = income - first + for(let i = 1; i < arr.length; i++) { + if(remain === 0) break + const [cur, r] = arr[i] + const gap = cur - arr[i - 1][0] + const real = Math.min(gap, remain) + res += real * r / 100 + remain -= real + } + + return res +}; From f6c894f3c02369826c2b834af346b9fa2b4fe7a1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Jun 2022 22:09:58 +0800 Subject: [PATCH 0754/2039] Create 2233-maximum-product-after-k-increments.js --- 2233-maximum-product-after-k-increments.js | 90 ++++++++++++++++++++++ 1 file changed, 90 insertions(+) create mode 100644 2233-maximum-product-after-k-increments.js diff --git a/2233-maximum-product-after-k-increments.js b/2233-maximum-product-after-k-increments.js new file mode 100644 index 00000000..d65aa854 --- /dev/null +++ b/2233-maximum-product-after-k-increments.js @@ -0,0 +1,90 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumProduct = function (nums, k) { + const pq = new PriorityQueue((a, b) => a < b) + let res = 1 + for(const e of nums) pq.push(e) + const mod = 1e9 + 7 + while(k) { + const e = pq.pop() + pq.push(e + 1) + k-- + } + while(!pq.isEmpty()) { + const e = pq.pop() + res = (res * e) % mod + } + + return res +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 0c30db186e97217ffcf64fdb3a16519adb6a9a97 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 13 Jun 2022 19:23:58 +0800 Subject: [PATCH 0755/2039] Create 2234-maximum-total-beauty-of-the-gardens.js --- 2234-maximum-total-beauty-of-the-gardens.js | 93 +++++++++++++++++++++ 1 file changed, 93 insertions(+) create mode 100644 2234-maximum-total-beauty-of-the-gardens.js diff --git a/2234-maximum-total-beauty-of-the-gardens.js b/2234-maximum-total-beauty-of-the-gardens.js new file mode 100644 index 00000000..01af8481 --- /dev/null +++ b/2234-maximum-total-beauty-of-the-gardens.js @@ -0,0 +1,93 @@ +/** + * @param {number[]} flowers + * @param {number} newFlowers + * @param {number} target + * @param {number} full + * @param {number} partial + * @return {number} + */ +const maximumBeauty = function (flowers, newFlowers, target, full, partial) { + flowers.sort((x, y) => x - y) + flowers = flowers.map((x) => Math.min(x, target)) + let a = flowers, + n = a.length, + k = newFlowers, + pre = preSum(a), + bi = new Bisect() + let res = 0 + for (let i = 0; i <= n; i++) { + if (i < n && a[n - 1 - i] == target) continue + let step = i * target - (pre[n] - pre[n - i]) + if (step <= k) { + let beauty + if (i == n) { + beauty = i * full + } else { + let minPartial = BinarySearch(a[0], target, step, i) + beauty = i * full + minPartial * partial + } + if (beauty > res) res = beauty + } + } + return res + + function BinarySearch (low, high, step, i) { + while (low < high - 1) { + let mid = low + parseInt((high - low) / 2) + if (possible(mid, step, i)) { + low = mid + } else { + high = mid + } + } + return low + } + + function possible (m, step, i) { + let idx = bi.bisect_left(a, m, 0, n - i) + let need = m * idx - pre[idx] + return need <= k - step + } +} + +/////////////////// Template ///////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_right(a, x, lo = 0, hi = null) { + // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] > x ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_left(a, x, lo = 0, hi = null) { + // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } +} + +const preSum = (a) => { + let pre = [0] + for (let i = 0; i < a.length; i++) { + pre.push(pre[i] + a[i]) + } + return pre +} +////////////////////////////////////////////////////////////////// From bf9013997876f726c02b582efeec6d390763efdb Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Jun 2022 20:28:19 +0800 Subject: [PATCH 0756/2039] Update 2216-minimum-deletions-to-make-array-beautiful.js --- ...nimum-deletions-to-make-array-beautiful.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/2216-minimum-deletions-to-make-array-beautiful.js b/2216-minimum-deletions-to-make-array-beautiful.js index f53288d5..4c7f09dd 100644 --- a/2216-minimum-deletions-to-make-array-beautiful.js +++ b/2216-minimum-deletions-to-make-array-beautiful.js @@ -1,3 +1,22 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minDeletion = function(nums) { + let res = 0, n = nums.length + + for(let i = 0; i < n; i += 2) { + while(i < n - 1 && nums[i] === nums[i + 1]) { + i++ + res++ + } + } + if((n - res) % 2 === 1) res++ + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From df308a8e3037c03c2bea1b3e081128db71047de9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Jun 2022 17:34:51 +0800 Subject: [PATCH 0757/2039] Update 2275-largest-combination-with-bitwise-and-greater-than-zero.js --- ...tion-with-bitwise-and-greater-than-zero.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/2275-largest-combination-with-bitwise-and-greater-than-zero.js b/2275-largest-combination-with-bitwise-and-greater-than-zero.js index 615ce874..e08649e4 100644 --- a/2275-largest-combination-with-bitwise-and-greater-than-zero.js +++ b/2275-largest-combination-with-bitwise-and-greater-than-zero.js @@ -13,3 +13,29 @@ const largestCombination = function(candidates) { } return res }; + +// another + +/** + * @param {number[]} candidates + * @return {number} + */ +const largestCombination = function(candidates) { + const arr = Array(24).fill(0), len = 24 + for(const e of candidates) { + const str = toBin(e) + for(let n = str.length, i = n - 1; i >= 0; i--) { + const cur = str[i] + if(cur === '1') { + arr[len - 1 - (n - 1 - i)]++ + } + } + } + + return Math.max(...arr) + + function toBin(num) { + return (num >>> 0).toString(2) + } +}; + From bbc49a3d17a55b197012a92ffae035076c0a6714 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Jun 2022 19:40:17 +0800 Subject: [PATCH 0758/2039] Create 1762-buildings-with-an-ocean-view.js --- 1762-buildings-with-an-ocean-view.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1762-buildings-with-an-ocean-view.js diff --git a/1762-buildings-with-an-ocean-view.js b/1762-buildings-with-an-ocean-view.js new file mode 100644 index 00000000..85122399 --- /dev/null +++ b/1762-buildings-with-an-ocean-view.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} heights + * @return {number[]} + */ +const findBuildings = function(heights) { + const n = heights.length, suffix = Array(n).fill(0) + let max = 0 + const res = [n - 1] + for(let i = n - 2; i >= 0; i--) { + max = Math.max(max, heights[i + 1]) + suffix[i] = max + if(max < heights[i]) res.push(i) + } + res.reverse() + return res +}; From e37f67a35ba11ce1f28a33a4fea632d756c95288 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Jun 2022 21:38:38 +0800 Subject: [PATCH 0759/2039] Create 1396-design-underground-system.js --- 1396-design-underground-system.js | 49 +++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 1396-design-underground-system.js diff --git a/1396-design-underground-system.js b/1396-design-underground-system.js new file mode 100644 index 00000000..49f3866d --- /dev/null +++ b/1396-design-underground-system.js @@ -0,0 +1,49 @@ + +const UndergroundSystem = function() { + this.h = new Map() + this.routeMap = new Map() +}; + +/** + * @param {number} id + * @param {string} stationName + * @param {number} t + * @return {void} + */ +UndergroundSystem.prototype.checkIn = function(id, stationName, t) { + this.h.set(id, [stationName, t]) +}; + +/** + * @param {number} id + * @param {string} stationName + * @param {number} t + * @return {void} + */ +UndergroundSystem.prototype.checkOut = function(id, stationName, t) { + const [sn, st] = this.h.get(id) + this.h.delete(id) + const route = `${sn},${stationName}` + const duration = t - st + const [totalTime, totalValue] = this.routeMap.get(route) || ([0, 0]) + this.routeMap.set(route, [totalTime + duration, totalValue + 1]) +}; + +/** + * @param {string} startStation + * @param {string} endStation + * @return {number} + */ +UndergroundSystem.prototype.getAverageTime = function(startStation, endStation) { + const k = `${startStation},${endStation}` + const [time, number] = this.routeMap.get(k) + return time / number +}; + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * var obj = new UndergroundSystem() + * obj.checkIn(id,stationName,t) + * obj.checkOut(id,stationName,t) + * var param_3 = obj.getAverageTime(startStation,endStation) + */ From 5014622e39e9c95ab9aba5e36a704a033d566f4e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Jun 2022 22:21:07 +0800 Subject: [PATCH 0760/2039] Create 1268-search-suggestions-system.js --- 1268-search-suggestions-system.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 1268-search-suggestions-system.js diff --git a/1268-search-suggestions-system.js b/1268-search-suggestions-system.js new file mode 100644 index 00000000..a583dd0f --- /dev/null +++ b/1268-search-suggestions-system.js @@ -0,0 +1,20 @@ +/** + * @param {string[]} products + * @param {string} searchWord + * @return {string[][]} + */ +const suggestedProducts = function(products, searchWord) { + const res = [] + for(let i = 0, n = searchWord.length; i < n; i++) { + const tmp = [], pre = searchWord.slice(0, i + 1) + for(const e of products) { + if(e.startsWith(pre)) { + tmp.push(e) + tmp.sort((a, b) => a.localeCompare(b)) + if(tmp.length > 3) tmp.pop() + } + } + res.push(tmp) + } + return res +}; From 2c1121ca70907ddc7a69fee9151f257cecceb292 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Jun 2022 22:56:53 +0800 Subject: [PATCH 0761/2039] Update 1268-search-suggestions-system.js --- 1268-search-suggestions-system.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/1268-search-suggestions-system.js b/1268-search-suggestions-system.js index a583dd0f..c2b9ba09 100644 --- a/1268-search-suggestions-system.js +++ b/1268-search-suggestions-system.js @@ -1,3 +1,23 @@ +/** + * @param {string[]} products + * @param {string} searchWord + * @return {string[][]} + */ +const suggestedProducts = function(products, searchWord) { + products.sort() + let res = [], left = 0, right = products.length - 1 + for (let i = 0; i < searchWord.length; i++) { + let c = searchWord.charAt(i), tmp = [] + while (products[left]?.charAt(i) < c) left++ + while (products[right]?.charAt(i) > c) right-- + for (let j = 0; j < 3 && left + j <= right; j++) tmp.push(products[left+j]) + res.push(tmp) + } + return res +}; + +// another + /** * @param {string[]} products * @param {string} searchWord From 1e122fca29951145a0e7f45709a1320f19c65c8c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 Jun 2022 20:33:56 +0800 Subject: [PATCH 0762/2039] Create 2306-naming-a-company.js --- 2306-naming-a-company.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2306-naming-a-company.js diff --git a/2306-naming-a-company.js b/2306-naming-a-company.js new file mode 100644 index 00000000..626417ca --- /dev/null +++ b/2306-naming-a-company.js @@ -0,0 +1,22 @@ +/** + * @param {string[]} ideas + * @return {number} + */ +const distinctNames = function (ideas) { + let smap = Array.from({ length: 26 }, (_) => new Set()), + ans = 0 + for (let i = 0; i < ideas.length; i++) { + let word = ideas[i] + smap[word.charCodeAt(0) - 97].add(word.slice(1)) + } + for (let i = 0; i < 25; i++) { + let a = smap[i] + for (let j = i + 1; j < 26; j++) { + let b = smap[j], + count = 0 + for (let w of a) if (b.has(w)) count++ + ans += (a.size - count) * (b.size - count) * 2 + } + } + return ans +} From f377ac3e309f43ab5345d16eafe8e88113507f9c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 17 Jun 2022 21:14:12 +0800 Subject: [PATCH 0763/2039] Update 490-the-maze.js --- 490-the-maze.js | 41 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/490-the-maze.js b/490-the-maze.js index ff002f72..11942f9a 100644 --- a/490-the-maze.js +++ b/490-the-maze.js @@ -138,3 +138,44 @@ function isValid(maze, row, col) { maze[row][col] !== 1 ) } + +// another + +/** + * @param {number[][]} maze + * @param {number[]} start + * @param {number[]} destination + * @return {boolean} + */ +const hasPath = function(maze, start, destination) { + const m = maze.length, n = maze[0].length + const dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]] + const visited = new Set() + let res = false + dfs(start[0], start[1]) + return res + + function dfs(i, j) { + if(i < 0 || i >= m || j < 0 || j >= n || maze[i][j] === 1 || visited.has(`${i},${j}`)) return + if(i === destination[0] && j === destination[1]) { + res = true + return + } + visited.add(`${i},${j}`) + const ib = i, jb = j + for(const [dx, dy] of dirs) { + let ii = i, jj = j + while( + ii + dx >= 0 && + ii + dx < m && + jj + dy >= 0 && + jj + dy < n && + maze[ii + dx][jj + dy] === 0 + ) { + ii += dx + jj += dy + } + dfs(ii, jj) + } + } +}; From 656f155584174b2d8193743b2ff2a6ced4700b37 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 17 Jun 2022 22:06:37 +0800 Subject: [PATCH 0764/2039] Update 490-the-maze.js --- 490-the-maze.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/490-the-maze.js b/490-the-maze.js index 11942f9a..a19f6cb2 100644 --- a/490-the-maze.js +++ b/490-the-maze.js @@ -179,3 +179,37 @@ const hasPath = function(maze, start, destination) { } } }; + +// another + +/** + * @param {number[][]} maze + * @param {number[]} start + * @param {number[]} destination + * @return {boolean} + */ +const hasPath = function(maze, start, destination) { + const m = maze.length, n = maze[0].length + const dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]] + const visited = new Set() + const q = [start] + while(q.length) { + const [i, j] = q.pop() + if(i === destination[0] && j === destination[1]) return true + visited.add(`${i},${j}`) + for(const [dx, dy] of dirs) { + let ni = i, nj = j + while(valid(ni + dx, nj + dy)) { + ni += dx + nj += dy + } + if(!visited.has(`${ni},${nj}`)) q.push([ni, nj]) + } + } + + return false + + function valid(i, j) { + return i >= 0 && i < m && j >= 0 && j < n && maze[i][j] === 0 + } +}; From ac2e78eb7426e22255881fd68ad096f61c190d2f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 18 Jun 2022 22:58:50 +0800 Subject: [PATCH 0765/2039] Create 2258-escape-the-spreading-fire.js --- 2258-escape-the-spreading-fire.js | 103 ++++++++++++++++++++++++++++++ 1 file changed, 103 insertions(+) create mode 100644 2258-escape-the-spreading-fire.js diff --git a/2258-escape-the-spreading-fire.js b/2258-escape-the-spreading-fire.js new file mode 100644 index 00000000..b5520376 --- /dev/null +++ b/2258-escape-the-spreading-fire.js @@ -0,0 +1,103 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const maximumMinutes = function (grid) { + const [m, n] = [grid.length, grid[0].length] + const dir = [ + [-1, 0], + [1, 0], + [0, -1], + [0, 1], + ] + + function isValidCell(x, y) { + return x >= 0 && x < m && y >= 0 && y < n + } + + const fireDist = new Array(m) + for (let i = 0; i < m; i++) { + fireDist[i] = new Array(n).fill(Infinity) + } + + const firePoints = [] + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (grid[i][j] === 1) { + firePoints.push([i, j]) + fireDist[i][j] = 0 + } + } + } + + while (firePoints.length) { + const [x0, y0] = firePoints.shift() + + for (const [dx, dy] of dir) { + const [x1, y1] = [x0 + dx, y0 + dy] + + if ( + isValidCell(x1, y1) && + grid[x1][y1] === 0 && + fireDist[x0][y0] + 1 < fireDist[x1][y1] + ) { + fireDist[x1][y1] = fireDist[x0][y0] + 1 + firePoints.push([x1, y1]) + } + } + } + + function canEscape(delay) { + const visited = new Array(m) + for (let i = 0; i < m; i++) { + visited[i] = new Array(n).fill(false) + } + + const queue = [[0, 0]] + let currMinutes = delay + + while (queue.length) { + currMinutes++ + + for (let i = queue.length; i > 0; i--) { + const [i0, j0] = queue.shift() + visited[i0][j0] = true + + for (const [di, dj] of dir) { + const [i1, j1] = [i0 + di, j0 + dj] + + if ( + isValidCell(i1, j1) && + grid[i1][j1] === 0 && + !visited[i1][j1] && + (currMinutes < fireDist[i1][j1] || + (currMinutes === fireDist[i1][j1] && + i1 === m - 1 && + j1 === n - 1)) + ) { + if (i1 === m - 1 && j1 === n - 1) { + return true + } + queue.push([i1, j1]) + } + } + } + } + + return false + } + + let [left, right] = [-1, 1_000_000_000] + + while (left < right) { + const middle = Math.floor((left + right + 1) / 2) + + if (canEscape(middle)) { + left = middle + } else { + right = middle - 1 + } + } + + return left +} From cd66066f09057fe88c62e30d0ed2da34994a5edf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Jun 2022 15:25:11 +0800 Subject: [PATCH 0766/2039] Create 2312-selling-pieces-of-wood.js --- 2312-selling-pieces-of-wood.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2312-selling-pieces-of-wood.js diff --git a/2312-selling-pieces-of-wood.js b/2312-selling-pieces-of-wood.js new file mode 100644 index 00000000..073b0b4f --- /dev/null +++ b/2312-selling-pieces-of-wood.js @@ -0,0 +1,24 @@ +/** + * @param {number} m + * @param {number} n + * @param {number[][]} prices + * @return {number} + */ +const sellingWood = function(m, n, prices) { + const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0)) + for(const [h, w, p] of prices) { + dp[h][w] = p + } + + for (let i = 1; i <= m; ++i) { + for (let j = 1; j <= n; ++j) { + for (let k = 1; k <= i / 2; ++k) { + dp[i][j] = Math.max(dp[i][j], dp[k][j] + dp[i - k][j]); + } + for (let k = 1; k <= j / 2; ++k) { + dp[i][j] = Math.max(dp[i][j], dp[i][k] + dp[i][j - k]); + } + } + } + return dp[m][n]; +}; From 29d9d8c7f71ea52873649f2e3d02845c9f577875 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Jun 2022 20:17:35 +0800 Subject: [PATCH 0767/2039] Update 2289-steps-to-make-array-non-decreasing.js --- 2289-steps-to-make-array-non-decreasing.js | 25 ++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2289-steps-to-make-array-non-decreasing.js b/2289-steps-to-make-array-non-decreasing.js index 9e61e117..a4b4c08f 100644 --- a/2289-steps-to-make-array-non-decreasing.js +++ b/2289-steps-to-make-array-non-decreasing.js @@ -15,3 +15,28 @@ var totalSteps = function(nums) { } return res }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const totalSteps = function(nums) { + let res = 0, stk = [] + stk.push([nums[0], 0]) + for(let i = 1, n = nums.length; i < n; i++) { + let steps = 0 + while(stk.length && stk[stk.length - 1][0] <= nums[i]) { + const peek = stk.pop() + steps = Math.max(steps, peek[1]) + } + if(stk.length === 0) steps = 0 + else steps++ + + res = Math.max(res, steps) + stk.push([nums[i], steps]) + } + + return res +}; From 03733ab84e684f557594b9d8aa22a2aa3447e259 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Jun 2022 20:57:52 +0800 Subject: [PATCH 0768/2039] Update 2289-steps-to-make-array-non-decreasing.js --- 2289-steps-to-make-array-non-decreasing.js | 26 ++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/2289-steps-to-make-array-non-decreasing.js b/2289-steps-to-make-array-non-decreasing.js index a4b4c08f..1fdfc322 100644 --- a/2289-steps-to-make-array-non-decreasing.js +++ b/2289-steps-to-make-array-non-decreasing.js @@ -40,3 +40,29 @@ const totalSteps = function(nums) { return res }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const totalSteps = function(nums) { + let res = 0 + const stk = [] + for(const e of nums) { + let steps = 1 + while(stk.length && e >= stk[stk.length - 1][0]) { + const tmp = stk.pop() + steps = Math.max(tmp[1] + 1, steps) + } + if(stk.length === 0) steps = 0 + else { + res = Math.max(res, steps) + } + stk.push([e, steps]) + } + return res +}; + + From 71618eb935a9d7f8500b28edec6d287bd8c54500 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Jun 2022 10:58:02 +0800 Subject: [PATCH 0769/2039] Update 2101-detonate-the-maximum-bombs.js --- 2101-detonate-the-maximum-bombs.js | 44 ++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/2101-detonate-the-maximum-bombs.js b/2101-detonate-the-maximum-bombs.js index 8955bd15..7abf5737 100644 --- a/2101-detonate-the-maximum-bombs.js +++ b/2101-detonate-the-maximum-bombs.js @@ -36,3 +36,47 @@ function bombAdj(source, target) { const { abs } = Math return abs(x1 - x2) ** 2 + abs(y1 - y2) ** 2 <= r1 ** 2 } + +// another + +/** + * @param {number[][]} bombs + * @return {number} + */ +const maximumDetonation = function(bombs) { + const n = bombs.length, graph = {} + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + if(i === j) continue + if(adjValid(bombs[i], bombs[j])) { + if(graph[i] == null) graph[i] = [] + graph[i].push(j) + } + } + } + + let res = 0 + for(let i = 0; i < n; i++) { + const set = new Set([i]) + dfs(i, set) + res = Math.max(res, set.size) + } + return res + + function dfs(node, visited){ + for (const e of (graph[node] || [])) { + if(!visited.has(e)) { + visited.add(e) + dfs(e, visited) + } + } + } + + function adjValid(start, target) { + const [sx, sy, r] = start + const [ex, ey] = target + return Math.abs(sx - ex) ** 2 + Math.abs(sy - ey) ** 2 <= r ** 2 + } +}; + + From e33725c40197983c78e5bfcabb171f00f23a0f70 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Jun 2022 21:26:11 +0800 Subject: [PATCH 0770/2039] Create 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js --- ...ed-pieces-if-both-neighbors-are-the-same-color.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js diff --git a/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js b/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js new file mode 100644 index 00000000..e1dc029f --- /dev/null +++ b/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js @@ -0,0 +1,12 @@ +/** + * @param {string} colors + * @return {boolean} + */ +const winnerOfGame = function(colors) { + let ac = 0, bc = 0 + for(let i = 1, n = colors.length; i < n - 1; i++) { + if(colors[i] === 'A' && colors[i - 1] === 'A' && colors[i + 1] === 'A') ac++ + if(colors[i] === 'B' && colors[i - 1] === 'B' && colors[i + 1] === 'B') bc++ + } + return ac > bc +}; From 3e65329176e9ebd78244947d8891fa730eb4162a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Jun 2022 22:12:55 +0800 Subject: [PATCH 0771/2039] Create 926-flip-string-to-monotone-increasing.js --- 926-flip-string-to-monotone-increasing.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 926-flip-string-to-monotone-increasing.js diff --git a/926-flip-string-to-monotone-increasing.js b/926-flip-string-to-monotone-increasing.js new file mode 100644 index 00000000..22a94654 --- /dev/null +++ b/926-flip-string-to-monotone-increasing.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @return {number} + */ +const minFlipsMonoIncr = function(s) { + const n = s.length + const arr = Array(n).fill(0) + let oneCnt = 0 + for(let i = 0; i < n; i++) { + if(s[i] === '1') oneCnt++ + arr[i] = oneCnt + } + const zeroCnt = n - oneCnt + let res = Infinity + + for(let i = 0; i < n; i++) { + const cnt = arr[i] + const tmp = cnt + (zeroCnt - (i + 1 - cnt)) + res = Math.min(res, tmp) + } + res = Math.min(res, oneCnt, zeroCnt) + return res +}; From c6c5b8f88abd8d86811e43d923c3dfd3f6ef6fa4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Jun 2022 22:23:46 +0800 Subject: [PATCH 0772/2039] Update 926-flip-string-to-monotone-increasing.js --- 926-flip-string-to-monotone-increasing.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/926-flip-string-to-monotone-increasing.js b/926-flip-string-to-monotone-increasing.js index 22a94654..71f6bfff 100644 --- a/926-flip-string-to-monotone-increasing.js +++ b/926-flip-string-to-monotone-increasing.js @@ -1,3 +1,25 @@ +/** + * @param {string} s + * @return {number} + */ +const minFlipsMonoIncr = function(s) { + const n = s.length + let res = 0, oneCnt = 0 + for(const e of s) { + if(e === '1') oneCnt++ + else { + const stayZero = oneCnt + const flipToOne = res + 1 + res = Math.min(stayZero, flipToOne) + } + } + + return res +}; + +// another + + /** * @param {string} s * @return {number} From 6f123558b1c565bd4291a9e90f0f74d786e99596 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 22 Jun 2022 14:28:29 +0800 Subject: [PATCH 0773/2039] Update 2045-second-minimum-time-to-reach-destination.js --- ...econd-minimum-time-to-reach-destination.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/2045-second-minimum-time-to-reach-destination.js b/2045-second-minimum-time-to-reach-destination.js index d77c8c8c..bec00cad 100644 --- a/2045-second-minimum-time-to-reach-destination.js +++ b/2045-second-minimum-time-to-reach-destination.js @@ -49,3 +49,46 @@ const secondMinimum = (n, edges, time, change) => { } return cost[n][1] } + +// another + +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} time + * @param {number} change + * @return {number} + */ + var secondMinimum = function (n, edges, time, change) { + const graph = new Map() + for (let i = 1; i <= n; i++) graph.set(i, []) + for (const [u, v] of edges) { + graph.get(u).push(v) + graph.get(v).push(u) + } + const first = Array(n + 1).fill(Infinity) + const second = Array(n + 1).fill(Infinity) + first[1] = 0 + + const q = new MinPriorityQueue() + q.enqueue(1, 0) + + while (q.size()) { + let {element: node, priority: cur} = q.dequeue() + cur += time // cur: arrival time + let leave = cur + if (~~(cur / change) & 1) leave += change - (cur % change) + for (let nei of graph.get(node)) { + if (second[nei] <= cur) continue + if (first[nei] === cur) continue + if (first[nei] > cur) { + second[nei] = first[nei] + first[nei] = cur + } else { + second[nei] = cur + } + q.enqueue(nei, leave) + } + } + return second[n] +} From bab4d27ba43734db15780ec2ad2b63c209f8c774 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 24 Jun 2022 11:05:55 +0800 Subject: [PATCH 0774/2039] Update 1263-minimum-moves-to-move-a-box-to-their-target-location.js --- ...-to-move-a-box-to-their-target-location.js | 96 +++++++++++++++++++ 1 file changed, 96 insertions(+) diff --git a/1263-minimum-moves-to-move-a-box-to-their-target-location.js b/1263-minimum-moves-to-move-a-box-to-their-target-location.js index b92dbab3..2ec22d2d 100644 --- a/1263-minimum-moves-to-move-a-box-to-their-target-location.js +++ b/1263-minimum-moves-to-move-a-box-to-their-target-location.js @@ -1,3 +1,99 @@ +/** + * @param {character[][]} grid + * @return {number} + */ +const minPushBox = function (grid) { + let box, person, target + const m = grid.length, + n = grid[0].length + const dirs = [ + [-1, 0], + [1, 0], + [0, -1], + [0, 1], + ] + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + const e = grid[i][j] + if (e === 'B') box = [i, j] + else if (e === 'T') target = [i, j] + else if (e === 'S') person = [i, j] + } + } + + const valid = ([i, j]) => { + return i >= 0 && i < m && j >= 0 && j < n && grid[i][j] !== '#' + } + const key = ([i, j]) => `${i},${j}` + + const chk = (person, newPerson, box) => { + const set = new Set() + set.add(key(box)) + let q = [person] + while (q.length) { + const tmp = [] + const size = q.length + for (let i = 0; i < size; i++) { + const [x, y] = q[i] + if (key([x, y]) === key(newPerson)) return true + for (const [dx, dy] of dirs) { + const [nx, ny] = [x + dx, y + dy] + if (valid([nx, ny]) && !set.has(key([nx, ny]))) { + set.add(key([nx, ny])) + tmp.push([nx, ny]) + } + } + } + q = tmp + } + return false + } + + + let q = [[0, box, person]] + const dkey = (a, b) => `${a[0]},${a[1]}_${b[0]},${b[1]}` + const set = new Set() + set.add(dkey(box, person)) + while (q.length) { + const size = q.length + const tmp = [] + for (let i = 0; i < size; i++) { + const [v, b, p] = q[i] + if (key(b) === key(target)) return v + const bArr = [ + [b[0], b[1] + 1], + [b[0], b[1] - 1], + [b[0] + 1, b[1]], + [b[0] - 1, b[1]], + ] + const pArr = [ + [b[0], b[1] - 1], + [b[0], b[1] + 1], + [b[0] - 1, b[1]], + [b[0] + 1, b[1]], + ] + + for (let j = 0; j < 4; j++) { + const nb = bArr[j], + np = pArr[j] + const nk = dkey(nb, b) + + if (set.has(nk)) continue + if (valid(nb) && valid(np) && chk(p, np, b)) { + tmp.push([v + 1, nb, b]) + set.add(nk) + } + } + } + q = tmp + } + + return -1 +} + +// another + + /** * @param {character[][]} grid * @return {number} From d1eb3180b965a66480135a7f800cfdb360f96ddc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Jun 2022 00:51:08 +0800 Subject: [PATCH 0775/2039] Update 1654-minimum-jumps-to-reach-home.js --- 1654-minimum-jumps-to-reach-home.js | 47 +++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1654-minimum-jumps-to-reach-home.js b/1654-minimum-jumps-to-reach-home.js index 6969ab4a..11ce519d 100644 --- a/1654-minimum-jumps-to-reach-home.js +++ b/1654-minimum-jumps-to-reach-home.js @@ -1,3 +1,50 @@ +/** + * @param {number[]} forbidden + * @param {number} a + * @param {number} b + * @param {number} x + * @return {number} + */ +const minimumJumps = function (forbidden, a, b, x) { + const bad = new Set() + const set = new Set() + for (let i of forbidden) { + bad.add(i) + } + let q = [] + q.push([0, 0, 0]) + set.add('0,0') + while (q.length) { + const tmp = [] + const size = q.length + for(let i = 0; i < size; i++) { + const [pos, level, state] = q[i] + + if (pos === x) return level + if (state >= 0) { + if (pos <= 4000 && !set.has(pos + a + ',0') && !bad.has(pos + a)) { + set.add(pos + a + ',0') + tmp.push([pos + a, level + 1, 0]) + } + if (!set.has(pos - b + ',-1') && !bad.has(pos - b) && pos - b >= 0) { + set.add(pos - b + ',-1') + tmp.push([pos - b, level + 1, -1]) + } + } else if (state < 0) { + if (pos <= 4000 && !set.has(pos + a + ',0') && !bad.has(pos + a)) { + set.add(pos + a + ',0') + tmp.push([pos + a, level + 1, 0]) + } + } + } + + q = tmp + } + return -1 +} + +// another + /** * @param {number[]} forbidden * @param {number} a From 46a6a07cca8025acf982761db268bc36d671e30e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Jun 2022 19:57:02 +0800 Subject: [PATCH 0776/2039] Update 1617-count-subtrees-with-max-distance-between-cities.js --- ...btrees-with-max-distance-between-cities.js | 67 +++++++++++++++++++ 1 file changed, 67 insertions(+) diff --git a/1617-count-subtrees-with-max-distance-between-cities.js b/1617-count-subtrees-with-max-distance-between-cities.js index aa468b83..3cc321c8 100644 --- a/1617-count-subtrees-with-max-distance-between-cities.js +++ b/1617-count-subtrees-with-max-distance-between-cities.js @@ -49,3 +49,70 @@ const countSubgraphsForEachDiameter = function (n, edges) { return ans; } }; + +// another + +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +const countSubgraphsForEachDiameter = function(n, edges) { + const graph = {} + for(const [u, v] of edges) { + if(graph[u - 1] == null) graph[u - 1] = [] + if(graph[v - 1] == null) graph[v - 1] = [] + graph[u - 1].push(v - 1) + graph[v - 1].push(u - 1) + } + const res = Array(n - 1).fill(0) + + for(let i = 0, len = 2 ** n; i < len; i++) { + const dis = maxDistance(i) + if(dis > 0) res[dis - 1]++ + } + + return res + + function bfs(src, cities) { + const visited = new Set([src]) + let q = [[src, 0]] + let maxDist = 0 + while(q.length) { + const tmp = [] + const size = q.length + for(let i = 0; i < size; i++) { + const [u, d] = q[i] + maxDist = d + for(const v of (graph[u] || [])) { + if(cities.has(v) && !visited.has(v)) { + visited.add(v) + tmp.push([v, d + 1]) + } + } + } + + q = tmp + } + + return [maxDist, visited] + } + + function maxDistance(state) { + const cities = new Set() + for(let i = 0; i < n; i++) { + if(state & (1 << i)) cities.add(i) + } + + let res = 0 + for(const e of cities) { + const [maxDist, visited] = bfs(e, cities) + if(visited.size < cities.size) return 0 + res = Math.max(res, maxDist) + } + + return res + } +}; + + From f60861577527bcc4fd725cd4b14d81ca445ca8b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Jun 2022 18:05:17 +0800 Subject: [PATCH 0777/2039] Create 2322-minimum-score-after-removals-on-a-tree.js --- ...-minimum-score-after-removals-on-a-tree.js | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 2322-minimum-score-after-removals-on-a-tree.js diff --git a/2322-minimum-score-after-removals-on-a-tree.js b/2322-minimum-score-after-removals-on-a-tree.js new file mode 100644 index 00000000..def6f468 --- /dev/null +++ b/2322-minimum-score-after-removals-on-a-tree.js @@ -0,0 +1,60 @@ +/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +var minimumScore = function (nums, edges) { + let n = nums.length, + ans = Infinity + let visited = Array(n).fill(0) + let pc = [] + let adj = Array.from({ length: n }, () => []) + let child_xor = Array(n).fill(0) + let childs = Array.from({ length: n }, () => Array(n).fill(false)) + const { min, max } = Math + let par = Array(n).fill(0) + + // Creating an adjacency matrix + for (const edge of edges) + adj[edge[0]].push(edge[1]), adj[edge[1]].push(edge[0]) + + dfs(0) + + // console.log(childs) + // console.log(pc) + for (let i = 0; i < pc.length; i++) + for (let j = i + 1; j < pc.length; j++) { + // removing an edge i and j + let a = pc[i][1], + b = pc[j][1] // node that will come below when you delete an edge i and j + let xa = child_xor[a], + xb = child_xor[b], + xc = child_xor[0] + // console.log(a,b) + if (childs[a][b]) (xc ^= xa), (xa ^= xb) + else (xc ^= xa), (xc ^= xb) + + ans = min(max(xa, max(xb, xc)) - min(xa, min(xb, xc)), ans) + } + + return ans + + function dfs(i) { + let ans = nums[i] + visited[i] = true + + for (let p of par) childs[p][i] = true // Defining this node as the child of all its parents + + par.push(i) + + for (let child of adj[i] || []) + if (!visited[child]) { + pc.push([i, child]) + ans ^= dfs(child) // Recurcively calculating xors + } + + par.pop() + + return (child_xor[i] = ans) + } +} From f51cf4d4f8d7f4bb22fd6893e14cfc77cc392ee7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Jun 2022 18:09:39 +0800 Subject: [PATCH 0778/2039] Create 2321-maximum-score-of-spliced-array.js --- 2321-maximum-score-of-spliced-array.js | 34 ++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2321-maximum-score-of-spliced-array.js diff --git a/2321-maximum-score-of-spliced-array.js b/2321-maximum-score-of-spliced-array.js new file mode 100644 index 00000000..7f1fec21 --- /dev/null +++ b/2321-maximum-score-of-spliced-array.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maximumsSplicedArray = function(nums1, nums2) { + let n = nums1.length; + let arr = new Array(n).fill(0); + let s1 = 0, s2 = 0; + for (let i = 0; i < n; i++) { + s1 += nums1[i]; + s2 += nums2[i]; + } + for (let i = 0; i < n; i++) { + arr[i] = nums1[i] - nums2[i]; + } + let sum = 0; + let min1 = 0; + let max1 = 0; + for (let i = 0; i < n; i++) { + sum += arr[i]; + max1 = Math.max(sum - min1, max1); + min1 = Math.min(min1, sum); + } + sum = 0; + let min2 = 0; + let max2 = 0; + for (let i = 0; i < n; i++) { + sum += arr[i]; + min2 = Math.min(sum - max2, min2); + max2 = Math.max(max2, sum); + } + return Math.max(s2 + max1, s1 - min2); +}; From bb1c838e92fa1b1782cb9fab759891463feab350 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Jun 2022 18:10:09 +0800 Subject: [PATCH 0779/2039] Create 2320-count-number-of-ways-to-place-houses.js --- 2320-count-number-of-ways-to-place-houses.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2320-count-number-of-ways-to-place-houses.js diff --git a/2320-count-number-of-ways-to-place-houses.js b/2320-count-number-of-ways-to-place-houses.js new file mode 100644 index 00000000..2b8f6052 --- /dev/null +++ b/2320-count-number-of-ways-to-place-houses.js @@ -0,0 +1,17 @@ +/** + * @param {number} n + * @return {number} + */ +var countHousePlacements = function(n) { + const mod = 1e9 + 7 + let f0 = 1; + let f1 = 1; + for (let i = 1; i < n; i++) { + let nf0 = (f0 + f1) % mod; + let nf1 = f0; + f0 = nf0; + f1 = nf1; + } + let m = (f0 + f1) % mod; + return BigInt(m) * BigInt(m) % BigInt(mod) +}; From 261f2d0e3c48cec65f229494c40af4c50b03b7d9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Jun 2022 18:10:38 +0800 Subject: [PATCH 0780/2039] Create 2319-check-if-matrix-is-x-matrix.js --- 2319-check-if-matrix-is-x-matrix.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2319-check-if-matrix-is-x-matrix.js diff --git a/2319-check-if-matrix-is-x-matrix.js b/2319-check-if-matrix-is-x-matrix.js new file mode 100644 index 00000000..65bbdc79 --- /dev/null +++ b/2319-check-if-matrix-is-x-matrix.js @@ -0,0 +1,22 @@ +/** + * @param {number[][]} grid + * @return {boolean} + */ +var checkXMatrix = function(grid) { + const n = grid.length + const onDiag = (i, j) => { + return i === j || j === n - 1 - i + } + for(let i = 0; i < n; i++) { + for(let j = 0;j < n; j++) { + const valid = onDiag(i, j) + if(valid) { + if(grid[i][j] === 0) return false + }else { + if(grid[i][j] !== 0) return false + } + } + } + + return true +}; From 27385835f2d9c8acb1408f44df623d5894052721 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Jun 2022 18:21:33 +0800 Subject: [PATCH 0781/2039] Create 2227-encrypt-and-decrypt-strings.js --- 2227-encrypt-and-decrypt-strings.js | 30 +++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2227-encrypt-and-decrypt-strings.js diff --git a/2227-encrypt-and-decrypt-strings.js b/2227-encrypt-and-decrypt-strings.js new file mode 100644 index 00000000..8178208e --- /dev/null +++ b/2227-encrypt-and-decrypt-strings.js @@ -0,0 +1,30 @@ +class Encrypter { + constructor(keys, values, dictionary) { + this.mapKeyToValue = {}; + this.mapCount = {}; + const n = keys.length; + + for (let i = 0; i < n; i++) { + const key = keys[i]; + const value = values[i]; + this.mapKeyToValue[key] = value; + } + + for (const dict of dictionary) { + const encrypted = this.encrypt(dict); + this.mapCount[encrypted] = (this.mapCount[encrypted] || 0) + 1; + } + } + + encrypt(word1) { + let res = ''; + for (const char of word1) { + res += this.mapKeyToValue[char]; + } + return res; + } + + decrypt(word2) { + return this.mapCount[word2] || 0; + } +} From 6fbc803ac54599e73bf4697df59139ef06707190 Mon Sep 17 00:00:00 2001 From: Fayez Baig <59474861+fayez-baig@users.noreply.github.com> Date: Mon, 27 Jun 2022 00:54:20 +0530 Subject: [PATCH 0782/2039] 1481 Least Number of Unique Integers after K Removals --- ...ber-of-unique-integers-after k-removals.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1481-least-number-of-unique-integers-after k-removals.js diff --git a/1481-least-number-of-unique-integers-after k-removals.js b/1481-least-number-of-unique-integers-after k-removals.js new file mode 100644 index 00000000..3c5796af --- /dev/null +++ b/1481-least-number-of-unique-integers-after k-removals.js @@ -0,0 +1,41 @@ +// Given an array of integers arr and an integer k. Find the least number of unique integers +// after removing exactly k elements. + + +// Example 1: + +// Input: arr = [5,5,4], k = 1 +// Output: 1 +// Explanation: Remove the single 4, only 5 is left. +// Example 2: +// Input: arr = [4,3,1,1,3,3,2], k = 3 +// Output: 2 +// Explanation: Remove 4, 2 and either one of the two 1s or three 3s. 1 and 3 will be left. + + +// Constraints: + +// 1 <= arr.length <= 10^5 +// 1 <= arr[i] <= 10^9 +// 0 <= k <= arr.length + + +const findLeastNumOfUniqueInts = function (arr, k) { + const map = {} + + for (const num of arr) { + map[num] = map[num] || 0 + map[num] += 1 + } + const keys = Object.keys(map).sort((a, b) => map[a] - map[b]) + for (const key of keys) { + while (map[key] > 0 && k > 0) { + k-- + map[key] -= 1 + if (map[key] === 0) { + delete map[key] + } + } + } + return Object.keys(map).length +} \ No newline at end of file From df36e50cfa7e23817b0bfb4c358ae7fb0dac8262 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 28 Jun 2022 15:58:18 +0800 Subject: [PATCH 0783/2039] Update 2166-design-bitset.js --- 2166-design-bitset.js | 83 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 83 insertions(+) diff --git a/2166-design-bitset.js b/2166-design-bitset.js index d38a595a..4c177ba6 100644 --- a/2166-design-bitset.js +++ b/2166-design-bitset.js @@ -1,3 +1,86 @@ +/** + * @param {number} size + */ +const Bitset = function (size) { + this.arr = Array.from({ length: 2 }, (el, idx) => + Array(size).fill(idx === 0 ? 0 : 1) + ) + this.cur = 0 + this.cnt = 0 +} + +/** + * @param {number} idx + * @return {void} + */ +Bitset.prototype.fix = function (idx) { + if(this.arr[this.cur][idx] === 1) return + this.arr[this.cur][idx] = 1 + this.arr[this.cur ^ 1][idx] = 0 + this.cnt++ +} + +/** + * @param {number} idx + * @return {void} + */ +Bitset.prototype.unfix = function (idx) { + if(this.arr[this.cur][idx] === 0) return + this.arr[this.cur][idx] = 0 + this.arr[this.cur ^ 1][idx] = 1 + this.cnt-- +} + +/** + * @return {void} + */ +Bitset.prototype.flip = function () { + this.cur ^= 1 + this.cnt = this.arr[this.cur].length - this.cnt +} + +/** + * @return {boolean} + */ +Bitset.prototype.all = function () { + return this.cnt === this.arr[this.cur].length +} + +/** + * @return {boolean} + */ +Bitset.prototype.one = function () { + return this.cnt > 0 +} + +/** + * @return {number} + */ +Bitset.prototype.count = function () { + return this.cnt +} + +/** + * @return {string} + */ +Bitset.prototype.toString = function () { + return this.arr[this.cur].join('') +} + +/** + * Your Bitset object will be instantiated and called as such: + * var obj = new Bitset(size) + * obj.fix(idx) + * obj.unfix(idx) + * obj.flip() + * var param_4 = obj.all() + * var param_5 = obj.one() + * var param_6 = obj.count() + * var param_7 = obj.toString() + */ + +// another + /** * @param {number} size */ From 53a5323136ea74a260c2ab9ff2b9fdeff8eba8cf Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 28 Jun 2022 20:42:36 +0800 Subject: [PATCH 0784/2039] Create 1291-sequential-digits.js --- 1291-sequential-digits.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 1291-sequential-digits.js diff --git a/1291-sequential-digits.js b/1291-sequential-digits.js new file mode 100644 index 00000000..280eed23 --- /dev/null +++ b/1291-sequential-digits.js @@ -0,0 +1,38 @@ +/** + * @param {number} low + * @param {number} high + * @return {number[]} + */ +const sequentialDigits = function(low, high) { + const set = new Set() + let start = 0, end = 0 + for(let i = 10; i >= 0; i--) { + if (low / (10 ** i) >= 1) { + start = ~~(low / (10 ** i)) + break + } + } + for(let i = 10; i >= 0; i--) { + if (high / (10 ** i) >= 1) { + end = ~~(high / (10 ** i)) + break + } + } + for(let i = 1; i <= 9; i++) { + helper(`${i}`) + } + + const res = Array.from(set) + res.sort((a, b) => a- b) + return res + + function helper(s) { + // console.log(s) + if(+s > high) return + if(+s >= low && +s <= high) { + set.add(+s) + } + if(s[s.length - 1] === '9') return + helper(`${s}${+s[s.length - 1] + 1}`) + } +}; From 5279809e8e9d317d08151220041b74ba4e6555b9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 28 Jun 2022 21:48:26 +0800 Subject: [PATCH 0785/2039] Update 1291-sequential-digits.js --- 1291-sequential-digits.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/1291-sequential-digits.js b/1291-sequential-digits.js index 280eed23..3cd7049b 100644 --- a/1291-sequential-digits.js +++ b/1291-sequential-digits.js @@ -1,3 +1,36 @@ +/** + * @param {number} low + * @param {number} high + * @return {number[]} + */ +const sequentialDigits = function(low, high) { + const res = [] + + let q = [] + for(let i = 1; i <= 9; i++) q.push(i) + + while(q.length) { + const tmp = [] + const size = q.length + for(let i = 0; i < size; i++) { + const cur = q[i] + if(cur >= low && cur <= high) { + res.push(cur) + } + if(cur > high) break + const last = cur % 10 + if(last === 9) continue + tmp.push(cur * 10 + last + 1) + } + + q = tmp + } + + return res +}; + +// another + /** * @param {number} low * @param {number} high From 573bf16c9c86e018fa73702ac3859e1311c901f2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Jun 2022 17:20:40 +0800 Subject: [PATCH 0786/2039] Update 2296-design-a-text-editor.js --- 2296-design-a-text-editor.js | 73 ++++++++++++++++++++++++++++++++++++ 1 file changed, 73 insertions(+) diff --git a/2296-design-a-text-editor.js b/2296-design-a-text-editor.js index d7e1b392..7df5b5ae 100644 --- a/2296-design-a-text-editor.js +++ b/2296-design-a-text-editor.js @@ -1,3 +1,76 @@ +const TextEditor = function () { + this.stk1 = [] + this.stk2 = [] +} + +/** + * @param {string} text + * @return {void} + */ +TextEditor.prototype.addText = function (text) { + for(const ch of text) { + this.stk1.push(ch) + } +} + +/** + * @param {number} k + * @return {number} + */ +TextEditor.prototype.deleteText = function (k) { + let res = 0 + while(this.stk1.length && k) { + k-- + res++ + this.stk1.pop() + } + return res +} + +/** + * @param {number} k + * @return {string} + */ +TextEditor.prototype.cursorLeft = function (k) { + let res = '' + while(this.stk1.length && k) { + const tmp = this.stk1.pop() + this.stk2.push(tmp) + k-- + } + + + for(let len = this.stk1.length, size = Math.min(10, this.stk1.length), i = 0; i < size; i++) { + res = this.stk1[len - 1 - i] + res + } + + + return res +} + +/** + * @param {number} k + * @return {string} + */ +TextEditor.prototype.cursorRight = function (k) { + let res = '' + + while(this.stk2.length && k) { + const tmp = this.stk2.pop() + this.stk1.push(tmp) + k-- + } + + for(let len = this.stk1.length, size = Math.min(10, this.stk1.length), i = 0; i < size; i++) { + res = this.stk1[len - 1 - i] + res + } + + return res +} + +// another + + class Node { constructor(val) { this.val = val From c6cf4af7269be3e9cdc9937e0927fa5b9940b5a7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Jun 2022 17:30:44 +0800 Subject: [PATCH 0787/2039] Update 2296-design-a-text-editor.js --- 2296-design-a-text-editor.js | 32 ++++++++++++++++---------------- 1 file changed, 16 insertions(+), 16 deletions(-) diff --git a/2296-design-a-text-editor.js b/2296-design-a-text-editor.js index 7df5b5ae..1e953e41 100644 --- a/2296-design-a-text-editor.js +++ b/2296-design-a-text-editor.js @@ -8,9 +8,7 @@ const TextEditor = function () { * @return {void} */ TextEditor.prototype.addText = function (text) { - for(const ch of text) { - this.stk1.push(ch) - } + for (const ch of text) this.stk1.push(ch) } /** @@ -19,7 +17,7 @@ TextEditor.prototype.addText = function (text) { */ TextEditor.prototype.deleteText = function (k) { let res = 0 - while(this.stk1.length && k) { + while (this.stk1.length && k) { k-- res++ this.stk1.pop() @@ -33,19 +31,13 @@ TextEditor.prototype.deleteText = function (k) { */ TextEditor.prototype.cursorLeft = function (k) { let res = '' - while(this.stk1.length && k) { + while (this.stk1.length && k) { const tmp = this.stk1.pop() this.stk2.push(tmp) k-- } - - for(let len = this.stk1.length, size = Math.min(10, this.stk1.length), i = 0; i < size; i++) { - res = this.stk1[len - 1 - i] + res - } - - - return res + return this.slice() } /** @@ -55,16 +47,24 @@ TextEditor.prototype.cursorLeft = function (k) { TextEditor.prototype.cursorRight = function (k) { let res = '' - while(this.stk2.length && k) { + while (this.stk2.length && k) { const tmp = this.stk2.pop() this.stk1.push(tmp) k-- } - for(let len = this.stk1.length, size = Math.min(10, this.stk1.length), i = 0; i < size; i++) { - res = this.stk1[len - 1 - i] + res - } + return this.slice() +} +TextEditor.prototype.slice = function() { + let res = '' + for ( + let len = this.stk1.length, size = Math.min(10, this.stk1.length), i = 0; + i < size; + i++ + ) { + res = this.stk1[len - i - 1] + res + } return res } From 61b3b3acd454624faaf97ce39350d9f805104aaa Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Jun 2022 21:45:25 +0800 Subject: [PATCH 0788/2039] Create 979-distribute-coins-in-binary-tree.js --- 979-distribute-coins-in-binary-tree.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 979-distribute-coins-in-binary-tree.js diff --git a/979-distribute-coins-in-binary-tree.js b/979-distribute-coins-in-binary-tree.js new file mode 100644 index 00000000..ba29ee10 --- /dev/null +++ b/979-distribute-coins-in-binary-tree.js @@ -0,0 +1,25 @@ +/** + * 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} + */ +const distributeCoins = function(root) { + let res = 0 + helper(root) + return res + + function helper(node) { + if(node == null) return 0 + const left = helper(node.left) + const right = helper(node.right) + res += Math.abs(left) + Math.abs(right) + return node.val + left + right - 1 + } +}; From 769769008e3486059530f356b827400121a00ee9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Jun 2022 10:57:56 +0800 Subject: [PATCH 0789/2039] Update 642-design-search-autocomplete-system.js --- 642-design-search-autocomplete-system.js | 151 +++++++++++++++++++++++ 1 file changed, 151 insertions(+) diff --git a/642-design-search-autocomplete-system.js b/642-design-search-autocomplete-system.js index d00efdb3..1f4a5657 100644 --- a/642-design-search-autocomplete-system.js +++ b/642-design-search-autocomplete-system.js @@ -105,3 +105,154 @@ Trie.prototype.stringsStartingWith = function (prefix) { traverse(curr, prefix) return results } + +// another + +class TrieNode { + constructor() { + this.children = new Map() + this.counts = new Map() + this.isWord = false + } +} + +class Pair { + constructor(s, c) { + this.str = s + this.cnt = c + } +} + +/** + * @param {string[]} sentences + * @param {number[]} times + */ +const AutocompleteSystem = function (sentences, times) { + this.root = new TrieNode() + this.prefix = '' + for (let i = 0, n = sentences.length; i < n; i++) { + this.add(sentences[i], times[i]) + } +} + +AutocompleteSystem.prototype.add = function (str, cnt) { + let cur = this.root + for (const ch of str) { + let next = cur.children.get(ch) + if (next == null) { + next = new TrieNode() + cur.children.set(ch, next) + } + cur = next + cur.counts.set(str, (cur.counts.get(str) || 0) + cnt) + } + cur.isWord = true +} + +/** + * @param {character} c + * @return {string[]} + */ +AutocompleteSystem.prototype.input = function (c) { + if (c === '#') { + this.add(this.prefix, 1) + this.prefix = '' + return [] + } + this.prefix += c + let cur = this.root + for (const ch of this.prefix) { + const next = cur.children.get(ch) + if (next == null) { + return [] + } + cur = next + } + const pq = new PriorityQueue((a, b) => + a.cnt === b.cnt ? a.str.localeCompare(b.str) < 0 : a.cnt > b.cnt + ) + + for(const s of cur.counts.keys()) { + pq.push(new Pair(s, cur.counts.get(s))) + } + const res = [] + for(let i = 0; i < 3 && pq.size(); i++) { + res.push(pq.pop().str) + } + + return res +} + +/** + * Your AutocompleteSystem object will be instantiated and called as such: + * var obj = new AutocompleteSystem(sentences, times) + * var param_1 = obj.input(c) + */ + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 869784e80fcdc443d0ad4bfd3735cabf16d33a78 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Jun 2022 21:28:34 +0800 Subject: [PATCH 0790/2039] Create 2178-maximum-split-of-positive-even-integers.js --- ...-maximum-split-of-positive-even-integers.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2178-maximum-split-of-positive-even-integers.js diff --git a/2178-maximum-split-of-positive-even-integers.js b/2178-maximum-split-of-positive-even-integers.js new file mode 100644 index 00000000..8efc231c --- /dev/null +++ b/2178-maximum-split-of-positive-even-integers.js @@ -0,0 +1,18 @@ +/** + * @param {number} finalSum + * @return {number[]} + */ +const maximumEvenSplit = function(finalSum) { + if(finalSum % 2 === 1) return [] + const res = [] + let i = 2 + while(i <= finalSum) { + res.push(i) + finalSum -= i + i += 2 + } + + const last = res.pop() + res.push(finalSum + last) + return res +}; From a9be3c104f58641822c42229ec7cf44d4f9171b9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Jun 2022 22:02:13 +0800 Subject: [PATCH 0791/2039] Create 1219-path-with-maximum-gold.js --- 1219-path-with-maximum-gold.js | 40 ++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 1219-path-with-maximum-gold.js diff --git a/1219-path-with-maximum-gold.js b/1219-path-with-maximum-gold.js new file mode 100644 index 00000000..ae7b9552 --- /dev/null +++ b/1219-path-with-maximum-gold.js @@ -0,0 +1,40 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const getMaximumGold = function(grid) { + const m = grid.length, n = grid[0].length + const arr = [] + const dirs = [[-1, 0], [1, 0], [0, 1], [0, -1]] + const visited = new Set() + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] !== 0) arr.push([i, j]) + } + } + let res = 0 + + for(const [i, j] of arr) { + visited.clear() + visited.add(`${i},${j}`) + dfs(i, j, grid[i][j]) + } + + return res + + function dfs(i, j, cur) { + + res = Math.max(res, cur) + for(const [dx, dy] of dirs) { + const nx = i + dx + const ny = j + dy + const key = `${nx},${ny}` + if(nx >= 0 && nx < m && ny >= 0 && ny < n && !visited.has(key) && grid[nx][ny] !== 0) { + visited.add(key) + dfs(nx, ny, cur + grid[nx][ny]) + visited.delete(key) + } + } + } + +}; From 3c33190c669e60ffce546227d7e169503fd76fc3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Jun 2022 22:06:23 +0800 Subject: [PATCH 0792/2039] Update 1219-path-with-maximum-gold.js --- 1219-path-with-maximum-gold.js | 43 ++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1219-path-with-maximum-gold.js b/1219-path-with-maximum-gold.js index ae7b9552..150b85e8 100644 --- a/1219-path-with-maximum-gold.js +++ b/1219-path-with-maximum-gold.js @@ -38,3 +38,46 @@ const getMaximumGold = function(grid) { } }; + +// another + +/** + * @param {number[][]} grid + * @return {number} + */ +var getMaximumGold = function (grid) { + const m = grid.length + const n = grid[0].length + let max = 0 + + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (grid[i][j] != 0) { + const sum = backtrack(grid, i, j, m, n) + max = Math.max(sum, max) + } + } + } + + return max +} + +function backtrack(grid, row, col, m, n) { + if (outOfBound(row, col, m, n) || grid[row][col] === 0) return 0 + + let sum = grid[row][col] + grid[row][col] = 0 // mark as being visited already + + const top = backtrack(grid, row - 1, col, m, n) + const right = backtrack(grid, row, col + 1, m, n) + const bot = backtrack(grid, row + 1, col, m, n) + const left = backtrack(grid, row, col - 1, m, n) + + grid[row][col] = sum // backtrack to the original form + + return sum + Math.max(top, right, bot, left) +} + +function outOfBound(row, col, m, n) { + return row < 0 || col < 0 || row >= m || col >= n +} From 46a8a03839e95f08e39b2117c092c14c86c9774f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Jul 2022 09:46:13 +0800 Subject: [PATCH 0793/2039] Update 1268-search-suggestions-system.js --- 1268-search-suggestions-system.js | 59 +++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) diff --git a/1268-search-suggestions-system.js b/1268-search-suggestions-system.js index c2b9ba09..6b5750cc 100644 --- a/1268-search-suggestions-system.js +++ b/1268-search-suggestions-system.js @@ -38,3 +38,62 @@ const suggestedProducts = function(products, searchWord) { } return res }; + +// another + +/** + * @param {string[]} products + * @param {string} searchWord + * @return {string[][]} + */ + const suggestedProducts = function(products, searchWord) { + const root = new Node() + for(const str of products) { + addProduct(str) + } + + const res = [] + + let cur = root + for(const ch of searchWord) { + const tmp = [] + if(cur == null) { + res.push(tmp) + continue + } + const map = cur.children.get(ch) + if(map != null) { + const arr = [...map.words] + arr.sort() + tmp.push(...arr.slice(0, 3)) + } + + res.push(tmp) + cur = map + } + + + return res + + function addProduct(str) { + let cur = root + for(const ch of str) { + let next = cur.children.get(ch) + if(next == null) { + next = new Node() + cur.children.set(ch, next) + } + next.words.add(str) + cur = next + } + cur.isWord = true + } +}; + +class Node { + constructor() { + this.children = new Map() + this.words = new Set() + this.isWord = false + } +} From e15f15f5ad62b73e56d6851412d7a2e122e5b9cf Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Jul 2022 09:57:18 +0800 Subject: [PATCH 0794/2039] Update 1268-search-suggestions-system.js --- 1268-search-suggestions-system.js | 43 ++++++++++++++++++------------- 1 file changed, 25 insertions(+), 18 deletions(-) diff --git a/1268-search-suggestions-system.js b/1268-search-suggestions-system.js index 6b5750cc..2e8ea666 100644 --- a/1268-search-suggestions-system.js +++ b/1268-search-suggestions-system.js @@ -46,40 +46,46 @@ const suggestedProducts = function(products, searchWord) { * @param {string} searchWord * @return {string[][]} */ - const suggestedProducts = function(products, searchWord) { + const suggestedProducts = function (products, searchWord) { + products.sort() const root = new Node() - for(const str of products) { + for (const str of products) { addProduct(str) } const res = [] let cur = root - for(const ch of searchWord) { + for (const ch of searchWord) { const tmp = [] - if(cur == null) { - res.push(tmp) - continue + if (cur == null) { + res.push(tmp) + continue } const map = cur.children.get(ch) - if(map != null) { - const arr = [...map.words] - arr.sort() - tmp.push(...arr.slice(0, 3)) + if (map != null) { + addThree(map.words.values(), tmp) } res.push(tmp) cur = map } - return res - + + function addThree(it, arr) { + + for(let i = 0; i < 3; i++) { + const res = it.next() + if(res.value) arr.push(res.value) + } + } + function addProduct(str) { let cur = root - for(const ch of str) { + for (const ch of str) { let next = cur.children.get(ch) - if(next == null) { + if (next == null) { next = new Node() cur.children.set(ch, next) } @@ -88,12 +94,13 @@ const suggestedProducts = function(products, searchWord) { } cur.isWord = true } -}; +} class Node { constructor() { - this.children = new Map() - this.words = new Set() - this.isWord = false + this.children = new Map() + this.words = new Set() + this.isWord = false } } + From 49d50d8dabf003201d4c0e02dc8ad4b50ec9a747 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Jul 2022 14:09:11 +0800 Subject: [PATCH 0795/2039] Create 974-subarray-sums-divisible-by-k.js --- 974-subarray-sums-divisible-by-k.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 974-subarray-sums-divisible-by-k.js diff --git a/974-subarray-sums-divisible-by-k.js b/974-subarray-sums-divisible-by-k.js new file mode 100644 index 00000000..34fc0a41 --- /dev/null +++ b/974-subarray-sums-divisible-by-k.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const subarraysDivByK = function (nums, k) { + const memo = {0: 1} + let sum = 0, res = 0 + for(const e of nums) { + sum += e + const remain = ( sum % k + k) % k + res += memo[remain] ?? 0 + memo[remain] = (memo[remain] ?? 0) + 1 + } + return res +} From 987d4d0c5bb3c3676a89946c7a9436ff55efb4fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Jul 2022 21:09:00 +0800 Subject: [PATCH 0796/2039] Create 1302-deepest-leaves-sum.js --- 1302-deepest-leaves-sum.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 1302-deepest-leaves-sum.js diff --git a/1302-deepest-leaves-sum.js b/1302-deepest-leaves-sum.js new file mode 100644 index 00000000..0e7d364b --- /dev/null +++ b/1302-deepest-leaves-sum.js @@ -0,0 +1,29 @@ +/** + * 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} + */ +const deepestLeavesSum = function(root) { + let res= 0 + let q = [root] + while(q.length) { + const size = q.length + const tmp = [] + res = 0 + for(let i = 0; i < size; i++) { + res += q[i].val + if(q[i].left) tmp.push(q[i].left) + if(q[i].right) tmp.push(q[i].right) + } + + q = tmp + } + return res +}; From ade6f75b6b2efc0600c39689989c728cdad754df Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Jul 2022 21:47:54 +0800 Subject: [PATCH 0797/2039] Create 1151-minimum-swaps-to-group-all-1s-together.js --- ...-minimum-swaps-to-group-all-1s-together.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1151-minimum-swaps-to-group-all-1s-together.js diff --git a/1151-minimum-swaps-to-group-all-1s-together.js b/1151-minimum-swaps-to-group-all-1s-together.js new file mode 100644 index 00000000..392f6012 --- /dev/null +++ b/1151-minimum-swaps-to-group-all-1s-together.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} data + * @return {number} + */ +const minSwaps = function(data) { + let num = 0, n = data.length + const arr = Array(n).fill(0) + for(let i = 0; i < n; i++) { + const e = data[i] + if(e === 1) { + num++ + } + arr[i] = num + } + if(num === 0) return 0 + let res = num - arr[num - 1] + for(let i = num; i < n; i++) { + res = Math.min(res, num - (arr[i] - arr[i - num])) + } + return res +}; From be711b975ab4ceccace0d41b66444f6794d2653c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Jul 2022 22:57:13 +0800 Subject: [PATCH 0798/2039] Create 1376-time-needed-to-inform-all-employees.js --- 1376-time-needed-to-inform-all-employees.js | 35 +++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 1376-time-needed-to-inform-all-employees.js diff --git a/1376-time-needed-to-inform-all-employees.js b/1376-time-needed-to-inform-all-employees.js new file mode 100644 index 00000000..c6d50ad2 --- /dev/null +++ b/1376-time-needed-to-inform-all-employees.js @@ -0,0 +1,35 @@ +/** + * @param {number} n + * @param {number} headID + * @param {number[]} manager + * @param {number[]} informTime + * @return {number} + */ +const numOfMinutes = function(n, headID, manager, informTime) { + const hash = {} + const len = manager.length + for(let i = 0; i < len; i++) { + const m = manager[i] + if(hash[m] == null) hash[m] = new Set() + hash[m].add(i) + } + let res = 0 + let q = [[headID, 0]] + while(q.length) { + const tmp = [] + let t = 0 + const size = q.length + for(let i = 0; i < size; i++) { + const [cur, time] = q[i] + if(hash[cur]) { + for(const e of hash[cur]) { + res = Math.max(res, time + informTime[cur]) + tmp.push([e, time + informTime[cur]]) + } + } + } + q = tmp + res += t + } + return res +}; From d4f50c44513396c6a809c047ceae460a056c1171 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Jul 2022 11:46:36 +0800 Subject: [PATCH 0799/2039] Update 1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js --- ...cake-after-horizontal-and-vertical-cuts.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js b/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js index 204580c6..12701fe7 100644 --- a/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js +++ b/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js @@ -18,3 +18,27 @@ function getMax(limit, cuts) { } return max } + +// another + +/** + * @param {number} h + * @param {number} w + * @param {number[]} horizontalCuts + * @param {number[]} verticalCuts + * @return {number} + */ +const maxArea = function(h, w, horizontalCuts, verticalCuts) { + return (BigInt(maxGap(h, horizontalCuts)) * BigInt(maxGap(w, verticalCuts))) % BigInt(1e9 + 7) + function maxGap(limit, arr) { + let res = 0 + arr.sort((a, b) => a - b) + for(let i = 0, n = arr.length; i < n; i++) { + let tmp = i === 0 ? arr[0] : arr[i] - arr[i - 1] + res = Math.max(res, tmp) + } + res = Math.max(res, limit - arr[arr.length - 1]) + + return res + } +}; From 1d02857df1647d6b3ec47e211f0541f7edbeecad Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Jul 2022 12:55:22 +0800 Subject: [PATCH 0800/2039] Update 1146-snapshot-array.js --- 1146-snapshot-array.js | 56 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/1146-snapshot-array.js b/1146-snapshot-array.js index 31164a7e..28e93963 100644 --- a/1146-snapshot-array.js +++ b/1146-snapshot-array.js @@ -1,3 +1,59 @@ +/** + * @param {number} length + */ +const SnapshotArray = function(length) { + this.snaps = Array(length) + this.snapId = 0 +}; + +/** + * @param {number} index + * @param {number} val + * @return {void} + */ +SnapshotArray.prototype.set = function(index, val) { + if(this.snaps[index] == null) { + this.snaps[index] = {} + } + this.snaps[index][this.snapId] = val +}; + +/** + * @return {number} + */ +SnapshotArray.prototype.snap = function() { + return this.snapId++ +}; + +/** + * @param {number} index + * @param {number} snap_id + * @return {number} + */ +SnapshotArray.prototype.get = function(index, snap_id) { + let res = 0 + let id = snap_id + while(id >= 0) { + if(this.snaps[index] == null || this.snaps[index][id] == null) id-- + else { + res = this.snaps[index][id] + break + } + } + + return res +}; + +/** + * Your SnapshotArray object will be instantiated and called as such: + * var obj = new SnapshotArray(length) + * obj.set(index,val) + * var param_2 = obj.snap() + * var param_3 = obj.get(index,snap_id) + */ + +// another + /** * @param {number[]} nums * @param {number} target From a45e6b0764b029c3c8c3ebadb44a96e7152e9c3f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Jul 2022 22:46:39 +0800 Subject: [PATCH 0801/2039] Create 1524-number-of-sub-arrays-with-odd-sum.js --- 1524-number-of-sub-arrays-with-odd-sum.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1524-number-of-sub-arrays-with-odd-sum.js diff --git a/1524-number-of-sub-arrays-with-odd-sum.js b/1524-number-of-sub-arrays-with-odd-sum.js new file mode 100644 index 00000000..671df32f --- /dev/null +++ b/1524-number-of-sub-arrays-with-odd-sum.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const numOfSubarrays = function(arr) { + const n = arr.length, mod = 1e9 + 7 + + let oc = 0, ec = 1 + let sum = 0 + let res = 0 + for(let i = 0; i < n; i++) { + sum += arr[i] + if(sum % 2 === 1) { + res += ec + oc++ + } else { + res += oc + ec++ + } + } + + return res % mod +}; From f831fdf0bc22577aa90e4799809b685f4f4cc67d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 13:02:09 +0800 Subject: [PATCH 0802/2039] Create 2325-decode-the-message.js --- 2325-decode-the-message.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2325-decode-the-message.js diff --git a/2325-decode-the-message.js b/2325-decode-the-message.js new file mode 100644 index 00000000..f6673016 --- /dev/null +++ b/2325-decode-the-message.js @@ -0,0 +1,31 @@ +/** + * @param {string} key + * @param {string} message + * @return {string} + */ +var decodeMessage = function(key, message) { + const set = new Set() + for(const ch of key) { + if(ch !== ' ') set.add(ch) + if(set.size === 26) break + } + const arr = Array.from(set).map((e, i) => [e, i]) + const hash = {} + for(const [e, i] of arr) { + hash[e] = i + } + // console.log(arr) + const a = 'a'.charCodeAt(0) + let res = '' + for(const ch of message) { + if(ch === ' ') { + res += ' ' + continue + } + const idx = hash[ch] + const tmp = String.fromCharCode(a + idx) + res += tmp + } + + return res +}; From b9fe4e60333edbb68f421771aa3fbd8dbd29f77d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 13:02:39 +0800 Subject: [PATCH 0803/2039] Create 2326-spiral-matrix-iv.js --- 2326-spiral-matrix-iv.js | 51 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2326-spiral-matrix-iv.js diff --git a/2326-spiral-matrix-iv.js b/2326-spiral-matrix-iv.js new file mode 100644 index 00000000..66ad0233 --- /dev/null +++ b/2326-spiral-matrix-iv.js @@ -0,0 +1,51 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {number} m + * @param {number} n + * @param {ListNode} head + * @return {number[][]} + */ +const spiralMatrix = function (m, n, head) { + const mat = Array.from({ length: m }, () => Array(n).fill(-1)); + let cur = head; + const dirs = [ + [0, 1], + [1, 0], + [0, -1], + [-1, 0], + ]; + let i = 0, + j = 0, + left = 0, + right = n - 1, + top = 0, + bottom = m - 1, + idx = 0; + while (cur) { + mat[i][j] = cur.val; + if (idx === 0 && j === right) { + idx = (idx + 1) % 4; + right--; + } else if (idx === 1 && i === bottom) { + idx = (idx + 1) % 4; + bottom--; + } else if (idx === 2 && j === left) { + idx = (idx + 1) % 4; + left++; + } else if (idx === 3 && i === top + 1) { + idx = (idx + 1) % 4; + top++; + } + i += dirs[idx][0]; + j += dirs[idx][1]; + cur = cur.next; + } + + return mat; +}; From 3d81dc919aee0e2c07d581c506757b2a5d4c2918 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 13:03:05 +0800 Subject: [PATCH 0804/2039] Create 2327-number-of-people-aware-of-a-secret.js --- 2327-number-of-people-aware-of-a-secret.js | 23 ++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2327-number-of-people-aware-of-a-secret.js diff --git a/2327-number-of-people-aware-of-a-secret.js b/2327-number-of-people-aware-of-a-secret.js new file mode 100644 index 00000000..890bc5d9 --- /dev/null +++ b/2327-number-of-people-aware-of-a-secret.js @@ -0,0 +1,23 @@ +/** + * @param {number} n + * @param {number} delay + * @param {number} forget + * @return {number} + */ +const peopleAwareOfSecret = function(n, delay, forget) { + let cnt = new Array(n+1).fill(0); + cnt[1] = 1; + let i = 1; + let MOD = 1_000_000_007; + while (i+delay <= n) { + for (let j = i+delay; j <= Math.min(n, i+forget-1); j++) { + cnt[j] = (cnt[j]+cnt[i])%MOD; + } + i++; + } + let res = 0; + for (let j = n; j > n-forget; j--) { + res = (res + cnt[j])%MOD; + } + return res; +}; From df2bef3337eeb86820daa306ac1344ebc22c83e7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 13:03:27 +0800 Subject: [PATCH 0805/2039] Create 2328-number-of-increasing-paths-in-a-grid.js --- 2328-number-of-increasing-paths-in-a-grid.js | 37 ++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 2328-number-of-increasing-paths-in-a-grid.js diff --git a/2328-number-of-increasing-paths-in-a-grid.js b/2328-number-of-increasing-paths-in-a-grid.js new file mode 100644 index 00000000..0c3ca851 --- /dev/null +++ b/2328-number-of-increasing-paths-in-a-grid.js @@ -0,0 +1,37 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var countPaths = function(grid) { + let MOD = 1e9 + 7; + let res = 0; + let M = grid.length, N = grid[0].length; + + const dp = Array.from({ length: M }, () => Array(N)) + + for (let r = 0; r < M; r++) { + for (let c = 0; c < N; c++) { + res = (res + dfs(grid, r, c, dp)) % MOD; + } + } + return res; + + function dfs(grid, r, c, dp) { + if (dp[r][c] != null) { + return dp[r][c]; + } + let MOD = 1e9 + 7; + let res = 1; + let M = grid.length, N = grid[0].length; + + for (const dir of [[-1, 0], [0, -1], [1, 0], [0, 1]]) { + let nr = r + dir[0], nc = c + dir[1]; + if (nr < 0 || nr >= M || nc < 0 || nc >= N || grid[nr][nc] <= grid[r][c]) { + continue; + } + res = (res + dfs(grid, nr, nc, dp))%MOD; + } + dp[r][c] = res; + return res; + } +}; From 02e44142fa84b3a79445b93f122425093decf756 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 16:50:40 +0800 Subject: [PATCH 0806/2039] Create 2098-subsequence-of-size-k-with-the-largest-even-sum.js --- ...nce-of-size-k-with-the-largest-even-sum.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2098-subsequence-of-size-k-with-the-largest-even-sum.js diff --git a/2098-subsequence-of-size-k-with-the-largest-even-sum.js b/2098-subsequence-of-size-k-with-the-largest-even-sum.js new file mode 100644 index 00000000..e78fd154 --- /dev/null +++ b/2098-subsequence-of-size-k-with-the-largest-even-sum.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const largestEvenSum = function(nums, k) { + nums.sort((a, b) => b - a) + let sum = 0 + for(let i = 0; i < k; i++) sum += nums[i] + if(sum % 2 === 0) return sum + + const INF = 10 ** 6 + let minOdd = INF, minEven = INF + for(let i = 0; i < k; i++) { + if(nums[i] % 2 === 0) minEven = Math.min(minEven, nums[i]) + else minOdd = Math.min(minOdd, nums[i]) + } + + const n = nums.length + let res = -1 + for(let i = k; i < n; i++) { + if(nums[i] % 2 === 0 && minOdd !== INF) { + res = Math.max(res, sum - minOdd + nums[i]) + } + if(nums[i] % 2 === 1 && minEven !== INF) { + res = Math.max(res, sum - minEven + nums[i]) + } + } + + return res +}; From 3efdede1e1371c534b4d22d5cddef1a13bfa9989 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 19:42:57 +0800 Subject: [PATCH 0807/2039] Create 2302-count-subarrays-with-score-less-than-k.js --- 2302-count-subarrays-with-score-less-than-k.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2302-count-subarrays-with-score-less-than-k.js diff --git a/2302-count-subarrays-with-score-less-than-k.js b/2302-count-subarrays-with-score-less-than-k.js new file mode 100644 index 00000000..4125da43 --- /dev/null +++ b/2302-count-subarrays-with-score-less-than-k.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countSubarrays = function(nums, k) { + let sum = 0 + let res = 0 + for(let i = 0, j = 0, n = nums.length; i < n; i++) { + sum += nums[i] + while(sum * (i - j + 1) >= k) sum -= nums[j++] + res += i - j + 1 + } + + return res +}; From c663f630a4cf324c565d6de6af53b566e8ccc907 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 20:32:30 +0800 Subject: [PATCH 0808/2039] Update 2327-number-of-people-aware-of-a-secret.js --- 2327-number-of-people-aware-of-a-secret.js | 26 ++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/2327-number-of-people-aware-of-a-secret.js b/2327-number-of-people-aware-of-a-secret.js index 890bc5d9..2ef272bd 100644 --- a/2327-number-of-people-aware-of-a-secret.js +++ b/2327-number-of-people-aware-of-a-secret.js @@ -21,3 +21,29 @@ const peopleAwareOfSecret = function(n, delay, forget) { } return res; }; + +// another + +/** + * @param {number} n + * @param {number} delay + * @param {number} forget + * @return {number} + */ +const peopleAwareOfSecret = function(n, delay, forget) { + const dp = Array(n + 1).fill(0) + dp[1] = 1 + const mod = 1e9 + 7 + const { min, max } = Math + let share = 0 + for(let i = 2; i <= n; i++) { + share = (share + dp[max(i - delay, 0)] - dp[max(i - forget, 0)] + mod) % mod + dp[i] = share + } + let res = 0 + for(let i = n - forget + 1; i <= n; i++) { + res = (res + dp[i]) % mod + } + + return res +}; From 1dc19b598c17c57fbaaa412daef3b2ae815208f5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Jul 2022 21:07:18 +0800 Subject: [PATCH 0809/2039] Update 2328-number-of-increasing-paths-in-a-grid.js --- 2328-number-of-increasing-paths-in-a-grid.js | 65 ++++++++++++-------- 1 file changed, 38 insertions(+), 27 deletions(-) diff --git a/2328-number-of-increasing-paths-in-a-grid.js b/2328-number-of-increasing-paths-in-a-grid.js index 0c3ca851..54212bc0 100644 --- a/2328-number-of-increasing-paths-in-a-grid.js +++ b/2328-number-of-increasing-paths-in-a-grid.js @@ -2,36 +2,47 @@ * @param {number[][]} grid * @return {number} */ -var countPaths = function(grid) { - let MOD = 1e9 + 7; - let res = 0; - let M = grid.length, N = grid[0].length; +var countPaths = function (grid) { + const MOD = 1e9 + 7 + let res = 0 + const M = grid.length, + N = grid[0].length const dp = Array.from({ length: M }, () => Array(N)) - for (let r = 0; r < M; r++) { - for (let c = 0; c < N; c++) { - res = (res + dfs(grid, r, c, dp)) % MOD; - } - } - return res; + for (let r = 0; r < M; r++) { + for (let c = 0; c < N; c++) { + res = (res + dfs(r, c)) % MOD + } + } + return res - function dfs(grid, r, c, dp) { - if (dp[r][c] != null) { - return dp[r][c]; - } - let MOD = 1e9 + 7; - let res = 1; - let M = grid.length, N = grid[0].length; - - for (const dir of [[-1, 0], [0, -1], [1, 0], [0, 1]]) { - let nr = r + dir[0], nc = c + dir[1]; - if (nr < 0 || nr >= M || nc < 0 || nc >= N || grid[nr][nc] <= grid[r][c]) { - continue; - } - res = (res + dfs(grid, nr, nc, dp))%MOD; + function dfs(r, c) { + if (dp[r][c] != null) { + return dp[r][c] + } + let res = 1 + + for (const dir of [ + [-1, 0], + [0, -1], + [1, 0], + [0, 1], + ]) { + const nr = r + dir[0], + nc = c + dir[1] + if ( + nr < 0 || + nr >= M || + nc < 0 || + nc >= N || + grid[nr][nc] <= grid[r][c] + ) { + continue } - dp[r][c] = res; - return res; + res = (res + dfs(nr, nc)) % MOD } -}; + dp[r][c] = res + return res + } +} From 26bfa38e7307a8ff370ed3813070ee4afca34e98 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Jul 2022 10:23:37 +0800 Subject: [PATCH 0810/2039] Create 1102-path-with-maximum-minimum-value.js --- 1102-path-with-maximum-minimum-value.js | 65 +++++++++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 1102-path-with-maximum-minimum-value.js diff --git a/1102-path-with-maximum-minimum-value.js b/1102-path-with-maximum-minimum-value.js new file mode 100644 index 00000000..ef6b6ca6 --- /dev/null +++ b/1102-path-with-maximum-minimum-value.js @@ -0,0 +1,65 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const maximumMinimumPath = function (grid) { + const m = grid.length, + n = grid[0].length + const dirs = [ + [0, 1], + [0, -1], + [1, 0], + [-1, 0], + ] + + const set = new Set() + + let ceil = Math.min(grid[0][0], grid[m - 1][n - 1]) + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (grid[i][j] <= ceil) { + set.add(grid[i][j]) + } + } + } + const arr = Array.from(set) + arr.sort((a, b) => a - b) + let l = 0, + r = arr.length - 1 + while (l < r) { + const mid = r - ((r - l) >> 1) + if (valid(arr[mid])) { + l = mid + } else { + r = mid - 1 + } + } + + return arr[l] + + function valid(v) { + const memo = Array.from({ length: m }, () => Array(n).fill(0)) + + function dfs(x, y) { + if (x === m - 1 && y === n - 1) return true + memo[x][y] = 1 + for (const [dx, dy] of dirs) { + const nx = x + dx, + ny = y + dy + if ( + nx >= 0 && + nx < m && + ny >= 0 && + ny < n && + memo[nx][ny] === 0 && + grid[nx][ny] >= v && + dfs(nx, ny) + ) + return true + } + return false + } + + return dfs(0, 0) + } +} From 53a7f4b695a697a80564cd4648486f729066d69c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Jul 2022 21:24:28 +0800 Subject: [PATCH 0811/2039] Update 227-basic-calculator-ii.js --- 227-basic-calculator-ii.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/227-basic-calculator-ii.js b/227-basic-calculator-ii.js index 57be3ffd..e0f174ae 100644 --- a/227-basic-calculator-ii.js +++ b/227-basic-calculator-ii.js @@ -1,3 +1,36 @@ +/** + * @param {string} s + * @return {number} + */ +const calculate = function(s) { + const stk = [] + let op = '+', num = 0 + s = s.trim() + const isDigit = ch => ch >= '0' && ch <= '9' + for(let i = 0, n = s.length; i < n; i++) { + const ch = s[i] + if(ch === ' ') continue + if(isDigit(ch)) { + num = (+num) * 10 + (+ch) + } + if(!isDigit(ch) || i === n - 1) { + if(op === '-') stk.push(-num) + else if(op === '+') stk.push(num) + else if(op === '*') stk.push(stk.pop() * num) + else if(op === '/') stk.push(~~(stk.pop() / num)) + + op = ch + num = 0 + } + } + let res = 0 + for(const e of stk) res += e + + return res +}; + +// another + /** * @param {string} s * @return {number} From 067879763309aadf5ab55130cce3d730e0b6c35b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Jul 2022 22:43:34 +0800 Subject: [PATCH 0812/2039] Update 224-basic-calculator.js --- 224-basic-calculator.js | 46 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) diff --git a/224-basic-calculator.js b/224-basic-calculator.js index 002c0d40..cf886088 100644 --- a/224-basic-calculator.js +++ b/224-basic-calculator.js @@ -77,3 +77,49 @@ const calculate = function(s) { return res + op * num }; + +// another +/** + * @param {string} s + * @return {number} + */ +const calculate = function(s) { + s = s.trim() + + let res = 0, num = 0, op = 1 + const isDigit = ch => ch >= '0' && ch <= '9' + const stk = [] + for(let i = 0, n = s.length; i < n; i++) { + + const e = s[i] + if(e === ' ') continue + if(isDigit(e)) num = num * 10 + (+e) + else { + + if(e === '(') { + stk.push(res) + stk.push(op) + + res = 0 + num = 0 + op = 1 + } else if(e === ')') { + res += num * op + res *= stk.pop() + res += stk.pop() + op = 1 + num = 0 + } else if(e === '-') { + res += num * op + op = -1 + num = 0 + } else if(e === '+') { + res += num * op + op = 1 + num = 0 + } + } + } + + return res + num * op +}; From 2aa5d711e392f656d6ff1b285096953e969b69d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Jul 2022 11:12:14 +0800 Subject: [PATCH 0813/2039] Update 1631-path-with-minimum-effort.js --- 1631-path-with-minimum-effort.js | 97 ++++++++++++++++++++++++++++++++ 1 file changed, 97 insertions(+) diff --git a/1631-path-with-minimum-effort.js b/1631-path-with-minimum-effort.js index 1e07dfcb..0514873a 100644 --- a/1631-path-with-minimum-effort.js +++ b/1631-path-with-minimum-effort.js @@ -1,3 +1,100 @@ +/** + * @param {number[][]} heights + * @return {number} + */ +const minimumEffortPath = function(heights) { + const m = heights.length, n = heights[0].length + const pq = new PriorityQueue() + const dist = Array.from({ length: m }, () => Array(n).fill(Infinity)) + pq.push([0, 0, 0]) + dist[0][0] = 0 + const dirs = [[-1, 0], [1, 0], [0, 1], [0, -1]] + while(!pq.isEmpty()) { + const [v, i, j] = pq.pop() + if(i === m - 1 && j === n - 1) return v + for(const [dx, dy] of dirs) { + const nx = i + dx, ny = j + dy + if(nx < 0 || nx >= m || ny < 0 || ny >= n) continue + const diff = Math.max(v, Math.abs(heights[nx][ny] - heights[i][j])) + if(dist[nx][ny] > diff) { + dist[nx][ny] = diff + pq.push([diff, nx, ny]) + } + } + } + return -1 +}; + +class PriorityQueue { + constructor(comparator = (a, b) => a[0] < b[0]) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number[][]} heights * @return {number} From 9959091bbf2af0e4273116f5bb3520c2315d1e4d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Jul 2022 10:31:12 +0800 Subject: [PATCH 0814/2039] Update 53-maximum-subarray.js --- 53-maximum-subarray.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) diff --git a/53-maximum-subarray.js b/53-maximum-subarray.js index 8cb65d28..dde9daa9 100755 --- a/53-maximum-subarray.js +++ b/53-maximum-subarray.js @@ -1,3 +1,19 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxSubArray = function (nums) { + let res = -1e9, sum = 0 + for(const e of nums) { + sum += e + res = Math.max(res, sum) + if(sum < 0) sum = 0 + } + return res +} + +// another + /** * @param {number[]} nums * @return {number} From daf8454dceab708e1d75af6251c10f000bf1ed67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Jul 2022 12:16:42 +0800 Subject: [PATCH 0815/2039] Update 2321-maximum-score-of-spliced-array.js --- 2321-maximum-score-of-spliced-array.js | 31 ++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2321-maximum-score-of-spliced-array.js b/2321-maximum-score-of-spliced-array.js index 7f1fec21..84fbf277 100644 --- a/2321-maximum-score-of-spliced-array.js +++ b/2321-maximum-score-of-spliced-array.js @@ -32,3 +32,34 @@ var maximumsSplicedArray = function(nums1, nums2) { } return Math.max(s2 + max1, s1 - min2); }; + +// another + +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const maximumsSplicedArray = function (nums1, nums2) { + let sum1 = 0, + sum2 = 0, + max1 = 0, + max2 = 0, + ac1 = 0, + ac2 = 0 + sum1 = nums1.reduce((ac, e) => ac + e, 0) + sum2 = nums2.reduce((ac, e) => ac + e, 0) + const { max } = Math + let res = max(sum1, sum2) + for (let i = 0, n = nums1.length; i < n; i++) { + ac1 += nums1[i] - nums2[i] + ac2 += nums2[i] - nums1[i] + max1 = max(max1, ac1) + max2 = max(max2, ac2) + if(ac1 < 0) ac1 = 0 + if(ac2 < 0) ac2 = 0 + } + res = max(res, sum1 + max2, sum2 + max1) + + return res +} From 50991e6c32d1099895e038c4bff4000c5b09f527 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Jul 2022 14:38:23 +0800 Subject: [PATCH 0816/2039] Create 1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js --- ...n-largest-and-smallest-value-in-three-moves.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js diff --git a/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js b/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js new file mode 100644 index 00000000..a932dbba --- /dev/null +++ b/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number} + */ + const minDifference = function(nums) { + let res = Infinity + const n = nums.length + if(n < 5) return 0 + nums.sort((a, b) => a - b) + for(let i = 0; i < 4; i++) { + res = Math.min(res, nums[n - 4 + i] - nums[i]) + } + + return res +}; From b823831907712e423ba75e1ed59a3d60f4526862 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Jul 2022 15:13:32 +0800 Subject: [PATCH 0817/2039] Create 1329-sort-the-matrix-diagonally.js --- 1329-sort-the-matrix-diagonally.js | 39 ++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 1329-sort-the-matrix-diagonally.js diff --git a/1329-sort-the-matrix-diagonally.js b/1329-sort-the-matrix-diagonally.js new file mode 100644 index 00000000..dec33cc0 --- /dev/null +++ b/1329-sort-the-matrix-diagonally.js @@ -0,0 +1,39 @@ +/** + * @param {number[][]} mat + * @return {number[][]} + */ +const diagonalSort = function(mat) { + const m = mat.length, n = mat[0].length + + for(let j = 0; j < n; j++) { + let i = 0, jj = j + const tmp = [] + while(jj < n && i < m) { + tmp.push(mat[i++][jj++]) + } + tmp.sort((a, b) => a - b) + let idx = 0 + jj = j + let ii = 0 + while(ii < m && jj < n) { + mat[ii++][jj++] = tmp[idx++] + } + } + + for(let i = 1; i < m; i++) { + let j = 0 + let ii = i + const tmp = [] + while(j < n && ii < m) { + tmp.push(mat[ii++][j++]) + } + tmp.sort((a, b) => a - b) + let idx = 0 + ii = i + j = 0 + while(ii < m && j < n) { + mat[ii++][j++] = tmp[idx++] + } + } + return mat +}; From 6114e5011779832772f348a4a968c4f83d371902 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Jul 2022 19:35:48 +0800 Subject: [PATCH 0818/2039] Create 1424-diagonal-traverse-ii.js --- 1424-diagonal-traverse-ii.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 1424-diagonal-traverse-ii.js diff --git a/1424-diagonal-traverse-ii.js b/1424-diagonal-traverse-ii.js new file mode 100644 index 00000000..62be5634 --- /dev/null +++ b/1424-diagonal-traverse-ii.js @@ -0,0 +1,27 @@ +/** + * @param {number[][]} nums + * @return {number[]} + */ +const findDiagonalOrder = function(nums) { + const m = nums.length + const map = new Map() + let maxKey = 0 + for(let i = 0; i < m; i++) { + for(let j = 0, n = nums[i].length; j < n; j++) { + if(!map.has(i + j)) map.set(i + j, []) + map.get(i + j).push(nums[i][j]) + maxKey = Math.max(maxKey, i + j) + } + } + // console.log(map) + const res = [] + for(let i = 0; i <= maxKey; i++) { + if(map.has(i)) { + const tmp = map.get(i) + tmp.reverse() + res.push(...tmp) + } + } + + return res +}; From 96104460a74b9bebb58fb58624f52c934659e81f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Jul 2022 21:10:46 +0800 Subject: [PATCH 0819/2039] Create 2130-maximum-twin-sum-of-a-linked-list.js --- 2130-maximum-twin-sum-of-a-linked-list.js | 27 +++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2130-maximum-twin-sum-of-a-linked-list.js diff --git a/2130-maximum-twin-sum-of-a-linked-list.js b/2130-maximum-twin-sum-of-a-linked-list.js new file mode 100644 index 00000000..c1520492 --- /dev/null +++ b/2130-maximum-twin-sum-of-a-linked-list.js @@ -0,0 +1,27 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {number} + */ +const pairSum = function(head) { + const arr = [] + let cur = head + + while(cur) { + arr.push(cur.val) + cur = cur.next + } + + let res = 0 + for(let i = 0, n = arr.length; i < n / 2; i++) { + res = Math.max(res, arr[i] + arr[n - 1 - i]) + } + + return res +}; From 674cce079d8021d93949858bad7c2d6b07e07ab8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Jul 2022 22:02:22 +0800 Subject: [PATCH 0820/2039] Update 2130-maximum-twin-sum-of-a-linked-list.js --- 2130-maximum-twin-sum-of-a-linked-list.js | 38 +++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2130-maximum-twin-sum-of-a-linked-list.js b/2130-maximum-twin-sum-of-a-linked-list.js index c1520492..b1e45990 100644 --- a/2130-maximum-twin-sum-of-a-linked-list.js +++ b/2130-maximum-twin-sum-of-a-linked-list.js @@ -1,3 +1,41 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {number} + */ +const pairSum = function(head) { + let slow = head, fast = head + while(fast && fast.next) { + slow = slow.next + fast = fast.next.next + } + // reverse + let next = null, pre = null + while(slow) { + next = slow.next + slow.next = pre + pre = slow + slow = next + } + + let res = 0 + while(pre) { + res = Math.max(res, pre.val + head.val) + pre = pre.next + head = head.next + } + + return res +}; + +// another + /** * Definition for singly-linked list. * function ListNode(val, next) { From 464add11e19f5d23af066b8ce3363bf458b90a3c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Jul 2022 10:02:04 +0800 Subject: [PATCH 0821/2039] Update 1186-maximum-subarray-sum-with-one-deletion.js --- ...-maximum-subarray-sum-with-one-deletion.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1186-maximum-subarray-sum-with-one-deletion.js b/1186-maximum-subarray-sum-with-one-deletion.js index 553245f0..745a7fea 100644 --- a/1186-maximum-subarray-sum-with-one-deletion.js +++ b/1186-maximum-subarray-sum-with-one-deletion.js @@ -14,3 +14,29 @@ const maximumSum = function(arr) { } return best } + +// another + +/** + * @param {number[]} arr + * @return {number} + */ +const maximumSum = function (arr) { + const n = arr.length + let max = arr[0] + const maxEndAt = Array(n), maxStartAt = Array(n) + maxEndAt[0] = arr[0] + for(let i = 1; i < n; i++) { + maxEndAt[i] = Math.max(arr[i], maxEndAt[i - 1] + arr[i]) + max = Math.max(max, maxEndAt[i]) + } + maxStartAt[n - 1] = arr[n - 1] + for(let i = n - 2; i >= 0; i--) { + maxStartAt[i] = Math.max(arr[i], maxStartAt[i + 1] + arr[i]) + } + let res = Math.max(maxStartAt[0], maxEndAt[n - 1]) + for(let i = 1; i < n - 1; i++) { + res = Math.max(max, res, maxEndAt[i - 1] + maxStartAt[i + 1]) + } + return res +} From f238078838f68504c34fa38bb9652eb2f59a1163 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Jul 2022 10:17:08 +0800 Subject: [PATCH 0822/2039] Update 1186-maximum-subarray-sum-with-one-deletion.js --- 1186-maximum-subarray-sum-with-one-deletion.js | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/1186-maximum-subarray-sum-with-one-deletion.js b/1186-maximum-subarray-sum-with-one-deletion.js index 745a7fea..6938f589 100644 --- a/1186-maximum-subarray-sum-with-one-deletion.js +++ b/1186-maximum-subarray-sum-with-one-deletion.js @@ -2,17 +2,17 @@ * @param {number[]} arr * @return {number} */ -const maximumSum = function(arr) { +const maximumSum = function (arr) { const n = arr.length - let d1 = arr[0], - d2 = arr[0], - best = arr[0] - for (let i = 1; i < n; ++i) { - d2 = Math.max(d2 + arr[i], Math.max(d1, arr[i])) - d1 = Math.max(d1 + arr[i], arr[i]) - best = Math.max(d2, best) + let oneDel = 0, noDel = arr[0], res = arr[0] + + for(let i = 1; i < n; i++) { + oneDel = Math.max(noDel, oneDel + arr[i]) + noDel = Math.max(arr[i], noDel + arr[i]) + res = Math.max(res, oneDel, noDel) } - return best + + return res } // another From fdd9620858cd266df394445c3f60b9265ebb18bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Jul 2022 21:32:43 +0800 Subject: [PATCH 0823/2039] Create 1254-number-of-closed-islands.js --- 1254-number-of-closed-islands.js | 62 ++++++++++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 1254-number-of-closed-islands.js diff --git a/1254-number-of-closed-islands.js b/1254-number-of-closed-islands.js new file mode 100644 index 00000000..bece1302 --- /dev/null +++ b/1254-number-of-closed-islands.js @@ -0,0 +1,62 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const closedIsland = function(grid) { + const m = grid.length, n = grid[0].length + const arr = [] + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] === 0) arr.push([i, j]) + } + } + const dirs = [[0,1], [0,-1], [1,0], [-1,0]] + let num = 2 + for(const [i, j] of arr) { + if(grid[i][j] !== 0) continue + else { + bfs(i, j, num) + num++ + } + } + + let res = 0 + const set = new Set() + for(let i = 2; i < num; i++) { + set.add(i) + } + + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] > 1 && invalid(i, j)) { + set.delete(grid[i][j]) + } + } + } + return set.size + + function invalid(i,j) { + if(i === 0 || i === m - 1 || j === 0 || j === n - 1) return true + return false + } + function bfs(i, j, v) { + let q = [[i,j]] + grid[i][j] = v + while(q.length) { + const tmp = [] + const size = q.length + + for(const [x, y] of q) { + for(const [dx, dy] of dirs) { + const nx = x + dx, ny = y + dy + if(nx >= 0 && nx < m && ny >= 0 && ny < n && grid[nx][ny] === 0) { + grid[nx][ny] = v + tmp.push([nx, ny]) + } + } + } + + q = tmp + } + } +}; From 44054d052204587218667c8b8f98b79e96834dd4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Jul 2022 23:47:03 +0800 Subject: [PATCH 0824/2039] Update 1254-number-of-closed-islands.js --- 1254-number-of-closed-islands.js | 42 ++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/1254-number-of-closed-islands.js b/1254-number-of-closed-islands.js index bece1302..acf9f12e 100644 --- a/1254-number-of-closed-islands.js +++ b/1254-number-of-closed-islands.js @@ -1,3 +1,45 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const closedIsland = function(grid) { + const m = grid.length, n = grid[0].length + const dirs = [[0,1], [0,-1], [1,0], [-1,0]] + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if((i=== 0 || i === m - 1 || j === 0 || j === n - 1) && grid[i][j] === 0){ + fill(i, j) + } + } + } + + + let res = 0 + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] === 0) { + res++ + fill(i, j) + } + } + } + + return res + + + function fill(i, j) { + if(i < 0 || i >= m || j < 0 || j >= n || grid[i][j] !== 0) return + grid[i][j] = 1 + for(const [dx, dy] of dirs) { + const nx = i + dx, ny = j + dy + fill(nx, ny) + } + } +}; + +// another + + /** * @param {number[][]} grid * @return {number} From 4cecce4a1ad159d79c1ca46c2398d72c5037216d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Jul 2022 21:06:26 +0800 Subject: [PATCH 0825/2039] Update 152-maximum-product-subarray.js --- 152-maximum-product-subarray.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/152-maximum-product-subarray.js b/152-maximum-product-subarray.js index fe71634f..8effa588 100644 --- a/152-maximum-product-subarray.js +++ b/152-maximum-product-subarray.js @@ -1,3 +1,21 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxProduct = function(nums) { + let min = nums[0], max = nums[0], res = nums[0] + for(let i = 1, n = nums.length; i < n; i++) { + const e = nums[i] + if(e < 0) [min, max] = [max, min] + min = Math.min(e, min * e) + max = Math.max(e, max * e) + res = Math.max(res, max) + } + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 636e57b91fc4e3cfdf0ddbd06956b3717a1b0153 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Jul 2022 20:42:30 +0800 Subject: [PATCH 0826/2039] Create 2272-substring-with-largest-variance.js --- 2272-substring-with-largest-variance.js | 35 +++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2272-substring-with-largest-variance.js diff --git a/2272-substring-with-largest-variance.js b/2272-substring-with-largest-variance.js new file mode 100644 index 00000000..5faad2f2 --- /dev/null +++ b/2272-substring-with-largest-variance.js @@ -0,0 +1,35 @@ +/** + * @param {string} s + * @return {number} + */ +const largestVariance = function (s) { + const se = new Set(s), + n = s.length + let res = 0 + for (const x of se) { + // max + for (const y of se) { + // min + if (x != y) { + let pre = Array(n + 1).fill(0), + preX, + preY, + diff = 0 + for (let i = 0; i < n; i++) { + if (s[i] == x) { + preX = i + 1 + diff++ + } + if (s[i] == y) { + preY = i + 1 + diff-- + } + pre[i + 1] = Math.min(pre[i], diff) + if (preX == undefined || preY == undefined) continue + res = Math.max(res, diff - pre[Math.min(preX, preY) - 1]) + } + } + } + } + return res +} From dcd4c703732e14e203ea6df36241e95968076eb4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Jul 2022 21:24:50 +0800 Subject: [PATCH 0827/2039] Update 2272-substring-with-largest-variance.js --- 2272-substring-with-largest-variance.js | 58 ++++++++++++++----------- 1 file changed, 33 insertions(+), 25 deletions(-) diff --git a/2272-substring-with-largest-variance.js b/2272-substring-with-largest-variance.js index 5faad2f2..3a1d7aa1 100644 --- a/2272-substring-with-largest-variance.js +++ b/2272-substring-with-largest-variance.js @@ -3,33 +3,41 @@ * @return {number} */ const largestVariance = function (s) { - const se = new Set(s), - n = s.length - let res = 0 - for (const x of se) { - // max - for (const y of se) { - // min - if (x != y) { - let pre = Array(n + 1).fill(0), - preX, - preY, - diff = 0 - for (let i = 0; i < n; i++) { - if (s[i] == x) { - preX = i + 1 - diff++ - } - if (s[i] == y) { - preY = i + 1 - diff-- - } - pre[i + 1] = Math.min(pre[i], diff) - if (preX == undefined || preY == undefined) continue - res = Math.max(res, diff - pre[Math.min(preX, preY) - 1]) + const freq = new Array(26).fill(0) + const ac = 'a'.charCodeAt(0) + for (let i = 0; i < s.length; i++) freq[s.charCodeAt(i) - ac]++ + + // console.log(freq) + let maxVariance = 0 + for (let a = 0; a < 26; a++) { + for (let b = 0; b < 26; b++) { + let remainingA = freq[a] + let remainingB = freq[b] + if (a == b || remainingA == 0 || remainingB == 0) continue + + // run kadanes on each possible character pairs (A & B) + let currBFreq = 0, + currAFreq = 0 + for (let i = 0; i < s.length; i++) { + let c = s.charCodeAt(i) - ac + + if (c == b) currBFreq++ + if (c == a) { + currAFreq++ + remainingA-- + } + if (currAFreq > 0) { + maxVariance = Math.max(maxVariance, currBFreq - currAFreq) + } + + + if (currBFreq < currAFreq && remainingA >= 1) { + currBFreq = 0 + currAFreq = 0 } } } } - return res + + return maxVariance } From 362cca76738126048a94051cfb50fde06540a06e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Jul 2022 21:37:52 +0800 Subject: [PATCH 0828/2039] Create 2335-minimum-amount-of-time-to-fill-cups.js --- 2335-minimum-amount-of-time-to-fill-cups.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2335-minimum-amount-of-time-to-fill-cups.js diff --git a/2335-minimum-amount-of-time-to-fill-cups.js b/2335-minimum-amount-of-time-to-fill-cups.js new file mode 100644 index 00000000..7d0c385b --- /dev/null +++ b/2335-minimum-amount-of-time-to-fill-cups.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} amount + * @return {number} + */ +const fillCups = function(amount) { + amount.sort((a, b) => a- b) + let res = 0; + while (amount[2] !== 0) { + res++; + amount[2]--; + if (amount[1] > 0) { + amount[1]--; + } + amount.sort((a, b) => a- b) + } + return res; +}; From 90396951864a267c9248fdeb10d9cd908f75ff2e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Jul 2022 22:21:37 +0800 Subject: [PATCH 0829/2039] Create 2336-smallest-number-in-infinite-set.js --- 2336-smallest-number-in-infinite-set.js | 33 +++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2336-smallest-number-in-infinite-set.js diff --git a/2336-smallest-number-in-infinite-set.js b/2336-smallest-number-in-infinite-set.js new file mode 100644 index 00000000..1d550dfc --- /dev/null +++ b/2336-smallest-number-in-infinite-set.js @@ -0,0 +1,33 @@ + +const SmallestInfiniteSet = function() { + this.nums = new Set(Array.from({ length: 1001 }, (e, i) => i + 1)) + this.tmp = new Set() +}; + +/** + * @return {number} + */ +SmallestInfiniteSet.prototype.popSmallest = function() { + const min = Math.min(...this.nums) + this.nums.delete(min) + this.tmp.add(min) + return min +}; + +/** + * @param {number} num + * @return {void} + */ +SmallestInfiniteSet.prototype.addBack = function(num) { + if(this.tmp.has(num)) { + this.tmp.delete(num) + this.nums.add(num) + } +}; + +/** + * Your SmallestInfiniteSet object will be instantiated and called as such: + * var obj = new SmallestInfiniteSet() + * var param_1 = obj.popSmallest() + * obj.addBack(num) + */ From a0e36c21a2b3bd340636e66a28f2435f14e1f216 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Jul 2022 10:58:40 +0800 Subject: [PATCH 0830/2039] Update 198-house-robber.js --- 198-house-robber.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/198-house-robber.js b/198-house-robber.js index 36203a07..3ce91fff 100644 --- a/198-house-robber.js +++ b/198-house-robber.js @@ -13,3 +13,21 @@ function rob(nums) { } return prev1; } + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const rob = function(nums) { + const n = nums.length + const dp = Array(n+1).fill(0) + dp[1] = nums[0] + + for(let i = 1; i < n; i++) { + dp[i + 1] = Math.max(dp[i], dp[i - 1] + nums[i]) + } + + return dp[n] +}; From 4fe584adc6756681c650e8b963fef28c720629c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Jul 2022 22:35:42 +0800 Subject: [PATCH 0831/2039] Create 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js --- ...-number-in-binary-representation-to-one.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js diff --git a/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js b/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js new file mode 100644 index 00000000..e6c8bbb2 --- /dev/null +++ b/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @return {number} + */ +const numSteps = function(s) { + let res = 0 + let carry = 0 + for(let i = s.length - 1; i > 0; i--) { + res++ + if(s[i] === '1' && carry === 0) { + res++ + carry = 1 + }else if(s[i] === '0' && carry === 1) { + res++ + carry = 1 + } + } + return res + carry +}; From 341a30411b670dabb5aea485b23334dea4731e17 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 12 Jul 2022 11:41:32 +0800 Subject: [PATCH 0832/2039] Update 2320-count-number-of-ways-to-place-houses.js --- 2320-count-number-of-ways-to-place-houses.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/2320-count-number-of-ways-to-place-houses.js b/2320-count-number-of-ways-to-place-houses.js index 2b8f6052..b1d6f302 100644 --- a/2320-count-number-of-ways-to-place-houses.js +++ b/2320-count-number-of-ways-to-place-houses.js @@ -1,3 +1,21 @@ +/** + * @param {number} n + * @return {number} + */ +const countHousePlacements = function(n) { + const mod = BigInt(1e9 + 7) + let house = 1n, space = 1n, total = 2n + for(let i = 2; i <= n; i++) { + house = space + space = total + total = (house + space) % mod + } + + return total * total % mod +}; + +// another + /** * @param {number} n * @return {number} From c3632e412fc70d63375af1e8940d6e0ae4a555c0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Jul 2022 13:00:49 +0800 Subject: [PATCH 0833/2039] Create 2318-number-of-distinct-roll-sequences.js --- 2318-number-of-distinct-roll-sequences.js | 35 +++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2318-number-of-distinct-roll-sequences.js diff --git a/2318-number-of-distinct-roll-sequences.js b/2318-number-of-distinct-roll-sequences.js new file mode 100644 index 00000000..a47063e4 --- /dev/null +++ b/2318-number-of-distinct-roll-sequences.js @@ -0,0 +1,35 @@ +/** + * @param {number} n + * @return {number} + */ +const dp = MultidimensionalArray(0, 1e4 + 1, 7, 7) +const distinctSequences = function (n, p = 0, pp = 0) { + const mod = 1e9 + 7 + if (n === 0) return 1 + if (dp[n][p][pp] === 0) { + for (let d = 1; d < 7; d++) { + if (d !== p && d !== pp && (p === 0 || gcd(d, p) === 1)) { + dp[n][p][pp] = (dp[n][p][pp] + distinctSequences(n - 1, d, p)) % mod + } + } + } + + return dp[n][p][pp] +} + +function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) +} + +function MultidimensionalArray(defaultValue, ...args) { + if (args.length === 1) { + return Array(args[0]).fill(defaultValue) + } + const res = [] + + for (let i = 0, n = args[0]; i < n; i++) { + res.push(MultidimensionalArray(defaultValue, ...args.slice(1))) + } + + return res +} From a2fa57dad42bf5e8d4ecc722a27de573b18ef9d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Jul 2022 19:53:06 +0800 Subject: [PATCH 0834/2039] Update 2318-number-of-distinct-roll-sequences.js --- 2318-number-of-distinct-roll-sequences.js | 52 +++++++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/2318-number-of-distinct-roll-sequences.js b/2318-number-of-distinct-roll-sequences.js index a47063e4..14e19cee 100644 --- a/2318-number-of-distinct-roll-sequences.js +++ b/2318-number-of-distinct-roll-sequences.js @@ -1,3 +1,55 @@ +/** + * @param {number} n + * @return {number} + */ +const distinctSequences = function(n) { + const hash = { + 1: [2,3,4,5,6], + 2: [1,3,5], + 3: [1,2,4,5], + 4: [1,3,5], + 5: [1,2,3,4,6], + 6: [1,5], + } + + const memo = kdArr(0, [7,7,n+1]) + const mod = 1e9 + 7 + let res = 0 + for(let i = 1; i <= 6; i++) { + res = (res + dfs(i, 0, n - 1)) % mod + } + + + return res + + function dfs(s,i,j) { + if(j === 0) return 1 + if(memo[s][i][j] !== 0) return memo[s][i][j] + let res = 0 + for(let e of hash[s]) { + if(e !== i) { + res = (res + dfs(e, s, j - 1)) % mod + } + } + memo[s][i][j] = res + return res + } + + function kdArr(defaultVal, arr) { + if(arr.length === 1) return Array(arr[0]).fill(defaultVal) + + const res = [] + for(let i = 0, len = arr[0]; i < len; i++) { + res.push(kdArr(defaultVal, arr.slice(1))) + } + + return res + } +}; + +// another + + /** * @param {number} n * @return {number} From 9dfc6e1a678a0b8ae3998a9baac4114886daa091 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 14 Jul 2022 10:55:24 +0800 Subject: [PATCH 0835/2039] Update 213-house-robber-ii.js --- 213-house-robber-ii.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/213-house-robber-ii.js b/213-house-robber-ii.js index f7195425..5c76dac5 100644 --- a/213-house-robber-ii.js +++ b/213-house-robber-ii.js @@ -17,3 +17,27 @@ const rob = function(nums) { return Math.max(startFromFirst[nums.length - 1], startFromSecond[nums.length]) }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const rob = function(nums) { + const n = nums.length + nums = nums.concat(nums) + let res = 0 + for(let i = 0; i < n; i++) { + let tmp = nums[i] + let pp = 0 + let p = 0 + for(let j = i; j < n + i - 1; j++) { + tmp = Math.max(tmp, pp + nums[j], p); + [pp, p] = [p, tmp] + } + res = Math.max(res, tmp) + } + + return res +}; From 09a28deb2dca343751d6569c9b748675a17c2359 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 14 Jul 2022 13:20:38 +0800 Subject: [PATCH 0836/2039] Update 213-house-robber-ii.js --- 213-house-robber-ii.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/213-house-robber-ii.js b/213-house-robber-ii.js index 5c76dac5..c4e1037f 100644 --- a/213-house-robber-ii.js +++ b/213-house-robber-ii.js @@ -20,6 +20,27 @@ const rob = function(nums) { // another +/** + * @param {number[]} nums + * @return {number} + */ +const rob = function(nums) { + if(nums.length === 1) return nums[0] + return Math.max(helper(0, nums.length - 2), helper(1, nums.length - 1)) + + function helper(l, r) { + let inc = 0, exc = 0 + for(let i = l; i <= r; i++) { + const pi = inc, pe = exc + inc = exc + nums[i] + exc = Math.max(pi, pe) + } + return Math.max(inc, exc) + } +}; + +// another + /** * @param {number[]} nums * @return {number} From 1ba426ba917aa86362c65f380b78850865351d67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 15 Jul 2022 12:57:11 +0800 Subject: [PATCH 0837/2039] Update 1388-pizza-with-3n-slices.js --- 1388-pizza-with-3n-slices.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1388-pizza-with-3n-slices.js b/1388-pizza-with-3n-slices.js index be6db2f7..5b214871 100644 --- a/1388-pizza-with-3n-slices.js +++ b/1388-pizza-with-3n-slices.js @@ -36,3 +36,32 @@ function maxSum(arr, n) { } return dp[m][n] } + + +// another + +/** + * @param {number[]} slices + * @return {number} + */ +const maxSizeSlices = function (slices) { + const n = slices.length, m = ~~(n / 3) + const arr1 = slices.slice(1), arr2 = slices.slice(0, n - 1) + return Math.max(helper(arr1, m), helper(arr2, m)) + function helper(arr, k) { + const len = arr.length + const dp = Array.from({ length: len + 1 }, () => Array(k + 1).fill(0)) + for(let i = 1; i <= len; i++) { + for(let j = 1; j <= k; j++) { + if(i === 1) dp[i][j] = arr[i - 1] + else { + dp[i][j] = Math.max( + dp[i - 1][j], + dp[i - 2][j - 1] + arr[i - 1] + ) + } + } + } + return dp[len][k] + } +} From 8d12d8bf2a8380ed3407755aeaae9cd4a81497b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 15 Jul 2022 23:04:17 +0800 Subject: [PATCH 0838/2039] Create 1885-count-pairs-in-two-arrays.js --- 1885-count-pairs-in-two-arrays.js | 34 +++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1885-count-pairs-in-two-arrays.js diff --git a/1885-count-pairs-in-two-arrays.js b/1885-count-pairs-in-two-arrays.js new file mode 100644 index 00000000..ecc04f11 --- /dev/null +++ b/1885-count-pairs-in-two-arrays.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const countPairs = function(nums1, nums2) { + const n = nums1.length + const arr = Array(n) + for(let i = 0; i < n; i++) { + arr[i] = nums1[i] - nums2[i] + } + // console.log(arr) + arr.sort((a, b) => a - b) + // console.log(arr) + let res = 0 + for(let i = 0; i < n - 1; i++) { + const e = arr[i] + const target = -e + 1 + let l = i + 1, r = n + while(l < r) { + const mid = ((l + r) >> 1) + if(valid(mid, target)) r = mid + else l = mid + 1 + } + // console.log(l) + res += n - l + } + + return res + + function valid(mid, t) { + return arr[mid] >= t + } +}; From e3a0330698e0ce2ab85ed61153941a72f4d44554 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 16 Jul 2022 19:15:21 +0800 Subject: [PATCH 0839/2039] Update 2312-selling-pieces-of-wood.js --- 2312-selling-pieces-of-wood.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2312-selling-pieces-of-wood.js b/2312-selling-pieces-of-wood.js index 073b0b4f..8cf6f8b5 100644 --- a/2312-selling-pieces-of-wood.js +++ b/2312-selling-pieces-of-wood.js @@ -22,3 +22,30 @@ const sellingWood = function(m, n, prices) { } return dp[m][n]; }; + +// another + +/** + * @param {number} m + * @param {number} n + * @param {number[][]} prices + * @return {number} + */ +const sellingWood = function(m, n, prices) { + const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0)) + + for(const [h, w, p] of prices) dp[h][w] = p + for(let i = 1; i <= m; i++) { + for(let j = 1; j <= n; j++) { + for(let k = 1; k <= i / 2; k++) { + dp[i][j] = Math.max(dp[i][j], dp[k][j] + dp[i - k][j]) + } + + for(let k = 1; k <= j / 2; k++) { + dp[i][j] = Math.max(dp[i][j], dp[i][k] + dp[i][j - k]) + } + } + } + + return dp[m][n] +}; From 045c1ba9f58fee9c1d13a8ede8222433cc6beb44 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Jul 2022 13:13:22 +0800 Subject: [PATCH 0840/2039] Create 2341-maximum-number-of-pairs-in-array.js --- 2341-maximum-number-of-pairs-in-array.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2341-maximum-number-of-pairs-in-array.js diff --git a/2341-maximum-number-of-pairs-in-array.js b/2341-maximum-number-of-pairs-in-array.js new file mode 100644 index 00000000..98771fc3 --- /dev/null +++ b/2341-maximum-number-of-pairs-in-array.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var numberOfPairs = function(nums) { + const n = nums.length + let res = 0 + const hash = {} + for(const e of nums) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + if(hash[e] === 2) { + res++ + hash[e] = 0 + } + } + + return [res, n - res * 2] +}; From cef7477f016bba0a69216d8c25d9ca2ce46137f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Jul 2022 13:13:58 +0800 Subject: [PATCH 0841/2039] Create 2342-max-sum-of-a-pair-with-equal-sum-of-digits.js --- ...-sum-of-a-pair-with-equal-sum-of-digits.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2342-max-sum-of-a-pair-with-equal-sum-of-digits.js diff --git a/2342-max-sum-of-a-pair-with-equal-sum-of-digits.js b/2342-max-sum-of-a-pair-with-equal-sum-of-digits.js new file mode 100644 index 00000000..1c9f1b10 --- /dev/null +++ b/2342-max-sum-of-a-pair-with-equal-sum-of-digits.js @@ -0,0 +1,48 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maximumSum = function(nums) { + const map = new Map() + for(const e of nums) { + const k = dSum(e) + add(map, k, e) + } + // console.log(map) + let res = -1 + for(const [k, v] of map) { + if(v.length === 2) { + res = Math.max(res, v[0] + v[1]) + } + } + + return res + + + function add(map, k, v) { + if(!map.has(k)) { + map.set(k, [v]) + } else { + if(map.get(k).length === 1) { + map.get(k).push(v) + } else { + const arr = map.get(k) + arr.push(v) + arr.sort((a, b) => b - a) + arr.splice(2, 1) + } + } + } + + function dSum(num) { + let res = 0 + + let cur = num + while(cur) { + res += cur % 10 + cur = ~~(cur / 10) + } + + return res + } +}; From 46327bfcb1560dc15f21f06b3015713ad27903c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Jul 2022 13:14:28 +0800 Subject: [PATCH 0842/2039] Create 2343-query-kth-smallest-trimmed-number.js --- 2343-query-kth-smallest-trimmed-number.js | 32 +++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2343-query-kth-smallest-trimmed-number.js diff --git a/2343-query-kth-smallest-trimmed-number.js b/2343-query-kth-smallest-trimmed-number.js new file mode 100644 index 00000000..5d0b7085 --- /dev/null +++ b/2343-query-kth-smallest-trimmed-number.js @@ -0,0 +1,32 @@ +/** + * @param {string[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +const smallestTrimmedNumbers = function(nums, queries) { + const m = nums.length, n = queries.length, len = nums[0].length + const res = [] + + for(const [k, trim] of queries) { + const tmp = nums.map(e => e.slice(trim>len?0:len - trim)) + // console.log(trim, tmp) + const clone = tmp.slice().map((e,i) => ({v:e,i})) + clone.sort((a, b) => { + a = BigInt(a.v) + b = BigInt(b.v) + if(a > b) { + return 1; + } else if (a < b){ + return -1; + } else { + return 0; + } + }) + // console.log(clone) + const el = clone[k - 1] + // const idx = tmp.lastIndexOf(el) + res.push(el.i) + } + + return res +}; From d5da56f7dfada1053f802c5f13286be09fec5135 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Jul 2022 13:14:57 +0800 Subject: [PATCH 0843/2039] Create 2344-minimum-deletions-to-make-array-divisible.js --- ...nimum-deletions-to-make-array-divisible.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2344-minimum-deletions-to-make-array-divisible.js diff --git a/2344-minimum-deletions-to-make-array-divisible.js b/2344-minimum-deletions-to-make-array-divisible.js new file mode 100644 index 00000000..466d2bd8 --- /dev/null +++ b/2344-minimum-deletions-to-make-array-divisible.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums + * @param {number[]} numsDivide + * @return {number} + */ +var minOperations = function(nums, numsDivide) { + let div = numsDivide[0], min = Infinity + for(let i = 1, n = numsDivide.length; i < n; i++) { + div = Math.min(div, gcd(numsDivide[i], div)) + min = Math.min(min, numsDivide[i]) + } + // console.log(div) + + nums.sort((a, b) => a - b) + if(div === 1 && nums[0] !== 1) return -1 + let res = 0 + for(const e of nums) { + if(e > min) break + if(div % e === 0) { + return res + } + if(e % div !== 0) res++ + else { + return res + } + } + + return -1 + + function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) + } +}; From d3686016cc72060958980ba3df135a3c49d7d291 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Jul 2022 19:39:13 +0800 Subject: [PATCH 0844/2039] Create 2222-number-of-ways-to-select-buildings.js --- 2222-number-of-ways-to-select-buildings.js | 27 ++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2222-number-of-ways-to-select-buildings.js diff --git a/2222-number-of-ways-to-select-buildings.js b/2222-number-of-ways-to-select-buildings.js new file mode 100644 index 00000000..02572411 --- /dev/null +++ b/2222-number-of-ways-to-select-buildings.js @@ -0,0 +1,27 @@ +/** + * @param {string} s + * @return {number} + */ +const numberOfWays = function(s) { + let one = 0, zero = 0 + for(const ch of s) { + if(ch === '1') one++ + else zero++ + } + let preOne = 0, preZero = 0 + let res = 0 + + for(const ch of s) { + if(ch === '1') { + res += preZero * zero + preOne++ + one-- + } else { + res += preOne * one + preZero++ + zero-- + } + } + + return res +}; From 7d4dc20ca63bb691125dac20b74175e9efffbbc4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Jul 2022 20:47:35 +0800 Subject: [PATCH 0845/2039] Update 2267-check-if-there-is-a-valid-parentheses-string-path.js --- ...here-is-a-valid-parentheses-string-path.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/2267-check-if-there-is-a-valid-parentheses-string-path.js b/2267-check-if-there-is-a-valid-parentheses-string-path.js index 429c229d..bafe3949 100644 --- a/2267-check-if-there-is-a-valid-parentheses-string-path.js +++ b/2267-check-if-there-is-a-valid-parentheses-string-path.js @@ -1,3 +1,40 @@ +/** + * @param {character[][]} grid + * @return {boolean} + */ +const hasValidPath = function (grid) { + const m = grid.length + const n = grid[0].length + if (grid[0][0] != '(' || grid[m - 1][n - 1] != ')') return false + const dp = kdArr(-1, [m, n, ~~((m + n) / 2) + 1]) + + + function dfs(i, j, left) { + if (i >= m || j >= n) return false + if (grid[i][j] === '(') left++ + else left-- + if (left < 0 || left > Math.floor((m + n) / 2)) return false + if (dp[i][j][left] != -1) return dp[i][j][left] + if (i == m - 1 && j == n - 1 && left == 0) return (dp[i][j][left] = true) + return (dp[i][j][left] = dfs(i, j + 1, left) || dfs(i + 1, j, left)) + } + return dfs(0, 0, 0) + + function kdArr(defaultVal, arr) { + if(arr.length === 1) return Array(arr[0]).fill(defaultVal) + + const res = [] + for(let i = 0, len = arr[0]; i < len; i++) { + res.push(kdArr(defaultVal, arr.slice(1))) + } + + return res + } +} + + +// another + /** * @param {character[][]} grid * @return {boolean} From fd22dfce70d5cccfb008ca7e9f8b6dae3afd09fe Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Jul 2022 09:23:18 +0800 Subject: [PATCH 0846/2039] Update 2327-number-of-people-aware-of-a-secret.js --- 2327-number-of-people-aware-of-a-secret.js | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/2327-number-of-people-aware-of-a-secret.js b/2327-number-of-people-aware-of-a-secret.js index 2ef272bd..83cf4e8f 100644 --- a/2327-number-of-people-aware-of-a-secret.js +++ b/2327-number-of-people-aware-of-a-secret.js @@ -30,20 +30,19 @@ const peopleAwareOfSecret = function(n, delay, forget) { * @param {number} forget * @return {number} */ -const peopleAwareOfSecret = function(n, delay, forget) { + const peopleAwareOfSecret = function(n, delay, forget) { + const mod = 1e9 + 7 const dp = Array(n + 1).fill(0) + const { max } = Math dp[1] = 1 - const mod = 1e9 + 7 - const { min, max } = Math let share = 0 for(let i = 2; i <= n; i++) { - share = (share + dp[max(i - delay, 0)] - dp[max(i - forget, 0)] + mod) % mod + share = (share + dp[max(0, i - delay)] - dp[max(i - forget, 0)] + mod) % mod dp[i] = share } let res = 0 for(let i = n - forget + 1; i <= n; i++) { res = (res + dp[i]) % mod } - return res }; From ceea55de45c5823c899b55247fa5688769be6c30 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Jul 2022 20:38:54 +0800 Subject: [PATCH 0847/2039] Create 1573-number-of-ways-to-split-a-string.js --- 1573-number-of-ways-to-split-a-string.js | 28 ++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1573-number-of-ways-to-split-a-string.js diff --git a/1573-number-of-ways-to-split-a-string.js b/1573-number-of-ways-to-split-a-string.js new file mode 100644 index 00000000..951172e8 --- /dev/null +++ b/1573-number-of-ways-to-split-a-string.js @@ -0,0 +1,28 @@ +/** + * @param {string} s + * @return {number} + */ +const numWays = function(s) { + const n = s.length + const cnt = Array(n).fill(0) + let num = 0 + for(let i = 0; i < n; i++) { + if(s[i] === '1') num++ + cnt[i] = num + } + const mod = 1e9 + 7 + let i0 = -1, i1 = -1, i2 = -1, i3 = -1 + for(let i = 0; i < n; i++) { + if(cnt[i] === num / 3) { + if(i0 === -1) i0 = i1 = i + else i1 = i + } else if(cnt[i] === 2 * num / 3) { + if(i2 === -1) i2 = i3 = i + else i3 = i + } + } + if(num === 0) return (n - 1) * (n - 2) / 2 % mod + if(i0 === -1 || i1 === -1 || i2 === -1 || i3 === -1) return 0 + + return (i1 - i0 + 1) * (i3 - i2 + 1) % mod +}; From ef9451e7b04a58e68dd109363744bdb1d8c80f56 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Jul 2022 19:42:13 +0800 Subject: [PATCH 0848/2039] Create 2184-number-of-ways-to-build-sturdy-brick-wall.js --- ...mber-of-ways-to-build-sturdy-brick-wall.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 2184-number-of-ways-to-build-sturdy-brick-wall.js diff --git a/2184-number-of-ways-to-build-sturdy-brick-wall.js b/2184-number-of-ways-to-build-sturdy-brick-wall.js new file mode 100644 index 00000000..1d53cd50 --- /dev/null +++ b/2184-number-of-ways-to-build-sturdy-brick-wall.js @@ -0,0 +1,49 @@ +/** + * @param {number} height + * @param {number} width + * @param {number[]} bricks + * @return {number} + */ +const buildWall = function (height, width, bricks) { + const MOD = 1e9 + 7 + const rowPerms = new Set() // save all possible permutations of a row as a bitmask + const memo = [] + for (let i = 0; i <= height; ++i) { + memo[i] = new Array(2 ** 10).fill(0) + } + findAllPossRowPerms(rowPerms, 0, 0 | 0) + return countWaysToBuildSturdyWall(height, 0) + + function countWaysToBuildSturdyWall(currHeight, prevRowPerm) { + if (currHeight === 0) return 1 + if (memo[currHeight][prevRowPerm] != 0) { + return memo[currHeight][prevRowPerm] + } + let totCount = 0 + for (const rowPerm of rowPerms) { + if ((rowPerm & prevRowPerm) === 0) { + totCount = + (totCount + countWaysToBuildSturdyWall(currHeight - 1, rowPerm)) % MOD + } + } + memo[currHeight][prevRowPerm] = totCount + return totCount + } + + function findAllPossRowPerms(rowPerms, currWidth, mask) { + if (currWidth === width) { + rowPerms.add(mask) + return + } + // The reason why we don't want to mark the 0 index is that we are going from right to left + // when creating the wall and unlike other points of a row, the all rows will be flushed + // against the 0 index. + if (currWidth > 0) mask |= 1 << currWidth + for (const brick of bricks) { + if (currWidth + brick <= width) { + findAllPossRowPerms(rowPerms, currWidth + brick, mask) + } + } + return + } +} From 96ace54866f451a9a30433c08550645483830264 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Jul 2022 08:55:46 +0800 Subject: [PATCH 0849/2039] Update 767-reorganize-string.js --- 767-reorganize-string.js | 44 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/767-reorganize-string.js b/767-reorganize-string.js index 8cbc6901..be449e84 100644 --- a/767-reorganize-string.js +++ b/767-reorganize-string.js @@ -1,3 +1,47 @@ +/** + * @param {string} s + * @return {string} + */ +const reorganizeString = function (s) { + const freq = Array(26).fill(0) + const a = 'a'.charCodeAt(0), n = s.length + for(const e of s) { + freq[e.charCodeAt(0) - a]++ + } + let max = 0, maxIdx = 0 + for(let i = 0; i < 26; i++) { + if(freq[i] > max) { + max = freq[i] + maxIdx = i + } + } + + if(max > (n + 1) / 2) return '' + + const res = Array(n) + + let idx = 0 + while(freq[maxIdx]) { + res[idx] = String.fromCharCode(a + maxIdx) + idx += 2 + freq[maxIdx]-- + } + + for(let i = 0; i < 26; i++) { + while(freq[i]) { + if(idx >= n) idx = 1 + res[idx] = String.fromCharCode(i + a) + idx += 2 + freq[i]-- + } + } + + return res.join('') +} + +// another + + /** * @param {string} S * @return {string} From e647bdd6af018adbfb4991e3689c38bd83a6b507 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Jul 2022 22:26:29 +0800 Subject: [PATCH 0850/2039] Create 2338-count-the-number-of-ideal-arrays.js --- 2338-count-the-number-of-ideal-arrays.js | 50 ++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 2338-count-the-number-of-ideal-arrays.js diff --git a/2338-count-the-number-of-ideal-arrays.js b/2338-count-the-number-of-ideal-arrays.js new file mode 100644 index 00000000..5c64c355 --- /dev/null +++ b/2338-count-the-number-of-ideal-arrays.js @@ -0,0 +1,50 @@ +const ll = BigInt, mod = ll(1e9 + 7), N = 1e4 + 15; + +const hcomb = (p, q) => p == 0 && q == 0 ? 1 : comb(p + q - 1, q); +const comb_init = () => { + fact[0] = ifact[0] = inv[1] = 1n; // factorial, inverse factorial + for (let i = 2; i < N; i++) inv[i] = (mod - mod / ll(i)) * inv[mod % ll(i)] % mod; + for (let i = 1; i < N; i++) { + fact[i] = fact[i - 1] * ll(i) % mod; + ifact[i] = ifact[i - 1] * inv[i] % mod; + } +}; + +// combination mod pick k from n +const comb = (n, k) => { + if (n < k || k < 0) return 0; + return fact[n] * ifact[k] % mod * ifact[n - k] % mod; +}; + +/* +prerequisite: +(number of factors) +https://www.codechef.com/LTIME01/problems/NUMFACT +my solution: https://www.codechef.com/viewsolution/67461009 +*/ +const number_factor = (n) => { + let m = new Map(); + for (let i = 2; i * i <= n; i++) { + while (n % i == 0) { + n /= i; + m.set(i, m.get(i) + 1 || 1); + } + } + if (n > 1) m.set(n, m.get(n) + 1 || 1); + return m; +}; + +let fact, ifact, inv; +const idealArrays = (n, maxValue) => { + fact = Array(N).fill(0), ifact = Array(N).fill(0), inv = Array(N).fill(0); + comb_init(); + let res = 0n; + for (let x = 1; x <= maxValue; x++) { + let perm = 1n, m = number_factor(x); + for (const [x, occ] of m) { + perm = perm * hcomb(n, occ) % mod; + } + res += perm; + } + return res % mod; +}; From 39472ee7e1c9d1d085f390c1d1544b06577907ad Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Jul 2022 22:31:03 +0800 Subject: [PATCH 0851/2039] Update 2338-count-the-number-of-ideal-arrays.js --- 2338-count-the-number-of-ideal-arrays.js | 1 - 1 file changed, 1 deletion(-) diff --git a/2338-count-the-number-of-ideal-arrays.js b/2338-count-the-number-of-ideal-arrays.js index 5c64c355..2de50cd1 100644 --- a/2338-count-the-number-of-ideal-arrays.js +++ b/2338-count-the-number-of-ideal-arrays.js @@ -20,7 +20,6 @@ const comb = (n, k) => { prerequisite: (number of factors) https://www.codechef.com/LTIME01/problems/NUMFACT -my solution: https://www.codechef.com/viewsolution/67461009 */ const number_factor = (n) => { let m = new Map(); From a1d42132f16118d4d557037916798a558b500881 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 23 Jul 2022 20:10:52 +0800 Subject: [PATCH 0852/2039] Update 1953-maximum-number-of-weeks-for-which-you-can-work.js --- ...m-number-of-weeks-for-which-you-can-work.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/1953-maximum-number-of-weeks-for-which-you-can-work.js b/1953-maximum-number-of-weeks-for-which-you-can-work.js index fc834574..c981ef69 100644 --- a/1953-maximum-number-of-weeks-for-which-you-can-work.js +++ b/1953-maximum-number-of-weeks-for-which-you-can-work.js @@ -1,3 +1,21 @@ +/** + * @param {number[]} milestones + * @return {number} + */ +const numberOfWeeks = function(milestones) { + let max = -Infinity + let res = 0, sum = 0 + for(const e of milestones) { + max = Math.max(e, max) + sum += e + } + + return Math.min(sum, (sum - max) * 2 + 1) +}; + + +// another + /** * @param {number[]} milestones * @return {number} From 21fe03bd1908649f79b4db14b525fdc26d68f8f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Jul 2022 14:13:10 +0800 Subject: [PATCH 0853/2039] Create 2351-first-letter-to-appear-twice.js --- 2351-first-letter-to-appear-twice.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 2351-first-letter-to-appear-twice.js diff --git a/2351-first-letter-to-appear-twice.js b/2351-first-letter-to-appear-twice.js new file mode 100644 index 00000000..4304af5f --- /dev/null +++ b/2351-first-letter-to-appear-twice.js @@ -0,0 +1,12 @@ +/** + * @param {string} s + * @return {character} + */ +var repeatedCharacter = function(s) { + const set = new Set() + + for(const e of s) { + if(set.has(e)) return e + else set.add(e) + } +}; From ab3db4c8ff3071b22f92bda14aefc588a3d81657 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Jul 2022 14:13:42 +0800 Subject: [PATCH 0854/2039] Create 2352-equal-row-and-column-pairs.js --- 2352-equal-row-and-column-pairs.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2352-equal-row-and-column-pairs.js diff --git a/2352-equal-row-and-column-pairs.js b/2352-equal-row-and-column-pairs.js new file mode 100644 index 00000000..75c12119 --- /dev/null +++ b/2352-equal-row-and-column-pairs.js @@ -0,0 +1,23 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var equalPairs = function(grid) { + let res = 0 + + const n = grid.length + for(let i = 0; i Date: Sun, 24 Jul 2022 14:16:40 +0800 Subject: [PATCH 0855/2039] Create 2353-design-a-food-rating-system.js --- 2353-design-a-food-rating-system.js | 42 +++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2353-design-a-food-rating-system.js diff --git a/2353-design-a-food-rating-system.js b/2353-design-a-food-rating-system.js new file mode 100644 index 00000000..3c0b54b1 --- /dev/null +++ b/2353-design-a-food-rating-system.js @@ -0,0 +1,42 @@ +/** + * @param {string[]} foods + * @param {string[]} cuisines + * @param {number[]} ratings + */ +var FoodRatings = function(foods, cuisines, ratings) { + let n = foods.length, cm = new Map(), fm = new Map(); // cm: cuisine map {cuisine: pq}, fm: food map {food: [cuisine, rating]} + for (let i = 0; i < n; i++) { + fm.set(foods[i], [cuisines[i], ratings[i]]); + if (!cm.has(cuisines[i])) { + let pq = new MaxPriorityQueue({ + compare: (x, y) => { + if (x[0] != y[0]) return y[0] - x[0]; // first priority: high rate comes first + return x[1].localeCompare(y[1]); // second priority: lexical smaller comes first + } + }); + cm.set(cuisines[i], pq); + } + cm.get(cuisines[i]).enqueue([ratings[i], foods[i]]) + } + return { changeRating, highestRated } + function changeRating(food, newRating) { + let cur = fm.get(food), cuisine = cur[0]; + cur[1] = newRating; + fm.set(food, cur); + cm.get(cuisine).enqueue([newRating, food]); + } + function highestRated(cuisine) { + let pq = cm.get(cuisine); + while (fm.get(pq.front()[1])[1] != pq.front()[0]) pq.dequeue(); // lazy remove + return pq.front()[1]; + } +}; + + +/** + * Your FoodRatings object will be instantiated and called as such: + * var obj = new FoodRatings(foods, cuisines, ratings) + * obj.changeRating(food,newRating) + * var param_2 = obj.highestRated(cuisine) + */ + From a20e690ff11b4ca3211acfa504633fe6617266cd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Jul 2022 14:35:41 +0800 Subject: [PATCH 0856/2039] Create 2354-number-of-excellent-pairs.js --- 2354-number-of-excellent-pairs.js | 35 +++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2354-number-of-excellent-pairs.js diff --git a/2354-number-of-excellent-pairs.js b/2354-number-of-excellent-pairs.js new file mode 100644 index 00000000..5f66e7a2 --- /dev/null +++ b/2354-number-of-excellent-pairs.js @@ -0,0 +1,35 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countExcellentPairs = function(nums, k) { + const map = new Map(); + const set = new Set(); + const l = nums.length; + let res = 0; + for (let num of nums) { + let temp = num.toString(2).split("1").length - 1; + if (!map.has(temp)) { + map.set(temp, new Set([num])); + } else { + map.get(temp).add(num); + } + } + + for (let num of nums) { + let temp = num.toString(2).split("1").length - 1; + if(!set.has(num)) { + let gap = Math.max(0, k - temp) + for (let key of map.keys()) { + if (key >= gap) { + res += map.get(key).size; + } + } + set.add(num); + }else { + continue; + } + } + return res; +}; From 40d45ad2a0eb2904b847fac5076516914bd5f57c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Jul 2022 23:09:10 +0800 Subject: [PATCH 0857/2039] Update 2354-number-of-excellent-pairs.js --- 2354-number-of-excellent-pairs.js | 55 +++++++++++++++++-------------- 1 file changed, 30 insertions(+), 25 deletions(-) diff --git a/2354-number-of-excellent-pairs.js b/2354-number-of-excellent-pairs.js index 5f66e7a2..aec51380 100644 --- a/2354-number-of-excellent-pairs.js +++ b/2354-number-of-excellent-pairs.js @@ -4,32 +4,37 @@ * @return {number} */ const countExcellentPairs = function(nums, k) { - const map = new Map(); - const set = new Set(); - const l = nums.length; - let res = 0; - for (let num of nums) { - let temp = num.toString(2).split("1").length - 1; - if (!map.has(temp)) { - map.set(temp, new Set([num])); - } else { - map.get(temp).add(num); - } + const arr = [], set = new Set(nums) + for(const e of set) { + arr.push(setBits(e)) + } + + arr.sort((a, b) => a - b) + let res = 0 + for(let i = 0, n = arr.length; i < n; i++) { + const idx = bs(arr, k - arr[i]) + res += n - idx + } + return res + + + function bs(arr, target) { + let l = 0, r = arr.length + + while(l < r) { + const mid = (l + r) >> 1 + if(arr[mid] < target) l = mid + 1 + else r = mid } - for (let num of nums) { - let temp = num.toString(2).split("1").length - 1; - if(!set.has(num)) { - let gap = Math.max(0, k - temp) - for (let key of map.keys()) { - if (key >= gap) { - res += map.get(key).size; - } - } - set.add(num); - }else { - continue; - } + return l + } + function setBits(num) { + let res = 0 + while(num) { + res += num % 2 + num = num >> 1 } - return res; + return res + } }; From 1456888c7f6d0e82ee31dcac58757dc05f5190f7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Jul 2022 13:41:17 +0800 Subject: [PATCH 0858/2039] Update 1054-distant-barcodes.js --- 1054-distant-barcodes.js | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/1054-distant-barcodes.js b/1054-distant-barcodes.js index f214d14a..c0930553 100644 --- a/1054-distant-barcodes.js +++ b/1054-distant-barcodes.js @@ -1,3 +1,42 @@ +/** + * @param {number[]} barcodes + * @return {number[]} + */ +const rearrangeBarcodes = function(barcodes) { + const hash = {} + let maxFreq = 0, max = 0 + for(const e of barcodes) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + if(hash[e] > maxFreq) { + maxFreq = hash[e] + max = e + } + } + const n = barcodes.length + const entries = Object.entries(hash) + const res = Array(n) + let idx = 0 + while(maxFreq) { + res[idx] = max + idx += 2 + maxFreq-- + } + for(let [v, f] of entries) { + if(+v === max) continue + while(f) { + if(idx >= n) idx = 1 + res[idx] = +v + idx += 2 + f-- + } + } + + return res +}; + +// another + /** * @param {number[]} barcodes * @return {number[]} From d41117975416d86803fd064a5f1582feb399b707 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Jul 2022 18:29:57 +0800 Subject: [PATCH 0859/2039] Create 2347-best-poker-hand.js --- 2347-best-poker-hand.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2347-best-poker-hand.js diff --git a/2347-best-poker-hand.js b/2347-best-poker-hand.js new file mode 100644 index 00000000..15e5e320 --- /dev/null +++ b/2347-best-poker-hand.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} ranks + * @param {character[]} suits + * @return {string} + */ +const bestHand = function(ranks, suits) { + let isFlush = false + const freq = {} + for(const e of suits) { + if(freq[e] == null) freq[e] = 0 + freq[e]++ + if(freq[e] >= 5) return 'Flush' + } + const rankHash = {} + for(const e of ranks) { + if(rankHash[e] == null) rankHash[e] = 0 + rankHash[e]++ + if(rankHash[e] >= 3) return 'Three of a Kind' + } + const rankKeys = Object.keys(rankHash) + for(const k of rankKeys) { + if(rankHash[k] >= 2) return 'Pair' + } + return 'High Card' +}; From 9c9d80546f9bd362691bfbb3c21fa827a2978a3e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Jul 2022 19:33:28 +0800 Subject: [PATCH 0860/2039] Create 2348-number-of-zero-filled-subarrays.js --- 2348-number-of-zero-filled-subarrays.js | 34 +++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2348-number-of-zero-filled-subarrays.js diff --git a/2348-number-of-zero-filled-subarrays.js b/2348-number-of-zero-filled-subarrays.js new file mode 100644 index 00000000..98d5fc95 --- /dev/null +++ b/2348-number-of-zero-filled-subarrays.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const zeroFilledSubarray = function(nums) { + let res = 0 + let idx = -1 + const n = nums.length + for(let i = 0; i < n; i++) { + const e = nums[i] + if(e !== 0) { + const len = (i - 1) - idx + res += helper(len) + idx = i + } else { + continue + } + } + if(idx !== n - 1) { + res += helper(n - 1 - idx) + } + + + return res + + function helper(n) { + let res = 0 + for(let i = 1; i <= n; i++) { + res += i + } + + return res + } +}; From dc6ee84a43c0f49c0a1545c64a6d2d4598c37faf Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Jul 2022 20:42:28 +0800 Subject: [PATCH 0861/2039] Create 1347-minimum-number-of-steps-to-make-two-strings-anagram.js --- ...er-of-steps-to-make-two-strings-anagram.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1347-minimum-number-of-steps-to-make-two-strings-anagram.js diff --git a/1347-minimum-number-of-steps-to-make-two-strings-anagram.js b/1347-minimum-number-of-steps-to-make-two-strings-anagram.js new file mode 100644 index 00000000..c568b573 --- /dev/null +++ b/1347-minimum-number-of-steps-to-make-two-strings-anagram.js @@ -0,0 +1,21 @@ +/** + * @param {string} s + * @param {string} t + * @return {number} + */ +const minSteps = function(s, t) { + const as = Array(26).fill(0), ts = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for(const e of s){ + as[e.charCodeAt(0) - a]++ + } + for(const e of t){ + ts[e.charCodeAt(0) - a]++ + } + + let com = 0 + for(let i = 0; i < 26; i++) { + com += Math.min(as[i], ts[i]) + } + return t.length - com +}; From 55694ef53d389bd50b79b7daf0e58a3309523ff9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Jul 2022 21:05:54 +0800 Subject: [PATCH 0862/2039] Create 958-check-completeness-of-a-binary-tree.js --- 958-check-completeness-of-a-binary-tree.js | 49 ++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 958-check-completeness-of-a-binary-tree.js diff --git a/958-check-completeness-of-a-binary-tree.js b/958-check-completeness-of-a-binary-tree.js new file mode 100644 index 00000000..577628a0 --- /dev/null +++ b/958-check-completeness-of-a-binary-tree.js @@ -0,0 +1,49 @@ +/** + * 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 {boolean} + */ +const isCompleteTree = function(root) { + let cur = [root] + let depth = 1 + while(cur.length) { + const nxt = [] + // console.log(cur) + for(let i = 0; i < cur.length; i++) { + const e = cur[i] + if(e == null) nxt.push(null, null) + else if(e) nxt.push(e.left, e.right) + } + + if(!valid(cur) || (cur[cur.length - 1] == null && valid(nxt))) { + return false + } + + if(nxt.some(e => e != null)) { + cur = nxt + } else { + cur = [] + } + depth++ + } + + return true + + function valid(arr) { + let firstNull = arr.length, lastNonNull = arr.length + for(let i = 0; i < arr.length; i++) { + const e = arr[i] + if(firstNull === arr.length && e == null) firstNull = i + if(e != null) lastNonNull = i + } + // console.log(firstNull, lastNonNull) + return firstNull >= lastNonNull + } +}; From 338ba10056009a2f760dafaa07c9b57569069302 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Jul 2022 14:07:40 +0800 Subject: [PATCH 0863/2039] Update 358-rearrange-string-k-distance-apart.js --- 358-rearrange-string-k-distance-apart.js | 104 +++++++++++++++++++++++ 1 file changed, 104 insertions(+) diff --git a/358-rearrange-string-k-distance-apart.js b/358-rearrange-string-k-distance-apart.js index f0f22313..825883f5 100644 --- a/358-rearrange-string-k-distance-apart.js +++ b/358-rearrange-string-k-distance-apart.js @@ -61,3 +61,107 @@ function findValidMax(count, valid, index) { return candidatePos } +// another + +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const rearrangeString = function(s, k) { + const freq = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for(const e of s) { + freq[e.charCodeAt(0) - a]++ + } + const pq = new PriorityQueue((a, b) => a[1] > b[1]) + for(let i = 0; i < 26; i++) { + if(freq[i]) pq.push([i, freq[i]]) + } + let res = '' + + // console.log(pq) + const q = [] + while(!pq.isEmpty()) { + const cur = pq.pop() + cur[1]-- + res += String.fromCharCode(a + cur[0]) + q.push(cur) + if(q.length >= k) { + const p = q.shift() + if(p[1] > 0) pq.push(p) + } + } + // console.log(res) + return res.length === s.length ? res : '' +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + + From 125b6ce8f4879f295d6a4cfde8a963e96462c662 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Jul 2022 17:17:15 +0800 Subject: [PATCH 0864/2039] Create 826-most-profit-assigning-work.js --- 826-most-profit-assigning-work.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 826-most-profit-assigning-work.js diff --git a/826-most-profit-assigning-work.js b/826-most-profit-assigning-work.js new file mode 100644 index 00000000..a2acbac0 --- /dev/null +++ b/826-most-profit-assigning-work.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} difficulty + * @param {number[]} profit + * @param {number[]} worker + * @return {number} + */ +const maxProfitAssignment = function(difficulty, profit, worker) { + let res = 0 + const n = profit.length + const jobs = [] + for(let i = 0; i < n; i++) { + jobs.push([difficulty[i], profit[i]]) + } + jobs.sort((a,b) => a[0] - b[0]) + worker.sort((a, b) => a - b) + let i = 0, tmp = 0 + for(let w of worker) { + while(i < n && w >= jobs[i][0]) { + tmp = Math.max(tmp, jobs[i++][1]) + } + res += tmp + } + + return res +}; + From bdefe38deb7e22b4c6b11d437e5676e51f6e8213 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Jul 2022 21:53:24 +0800 Subject: [PATCH 0865/2039] Create 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js --- ...solute-diff-less-than-or-equal-to-limit.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js diff --git a/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js b/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js new file mode 100644 index 00000000..74c87355 --- /dev/null +++ b/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} limit + * @return {number} + */ +const longestSubarray = function(nums, limit) { + let maxd = [], mind = []; + let i = 0, j; + for (j = 0; j < nums.length; ++j) { + // non-increase + while (maxd.length && nums[j] > maxd[maxd.length - 1]) maxd.pop(); + // non-decrease + while (mind.length && nums[j] < mind[mind.length - 1]) mind.pop(); + + maxd.push(nums[j]); + mind.push(nums[j]); + + if (maxd[0] - mind[0] > limit) { + if (maxd[0] == nums[i]) maxd.shift(); + if (mind[0] == nums[i]) mind.shift(); + ++i; + } + } + return j - i; +}; From 1069629366230aa0a1a56f67c8c6683003551d71 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Jul 2022 09:16:27 +0800 Subject: [PATCH 0866/2039] Update 621-task-scheduler.js --- 621-task-scheduler.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/621-task-scheduler.js b/621-task-scheduler.js index fc6cefe3..7f24d89e 100755 --- a/621-task-scheduler.js +++ b/621-task-scheduler.js @@ -1,3 +1,36 @@ +/** + * @param {character[]} tasks + * @param {number} n + * @return {number} + */ +const leastInterval = function(tasks, n) { + const counter = new Array(26).fill(0); + let max = 0; + let maxCount = 0; + const A = 'A'.charCodeAt(0) + for(let ch of tasks) { + const task = ch.charCodeAt(0) + counter[task - A]++; + if(max == counter[task - A]) { + maxCount++; + } + else if(max < counter[task - A]) { + max = counter[task - A]; + maxCount = 1; + } + } + + const partCount = max - 1; + const partLength = n - (maxCount - 1); + const emptySlots = partCount * partLength; + const availableTasks = tasks.length - max * maxCount; + const idles = Math.max(0, emptySlots - availableTasks); + + return tasks.length + idles; +}; + +// another + /** * @param {character[]} tasks * @param {number} n From 297ce135a015caa239f6bd4e873730613d7d5b38 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Jul 2022 09:57:44 +0800 Subject: [PATCH 0867/2039] Update 621-task-scheduler.js --- 621-task-scheduler.js | 44 +++++++++++++++++++++---------------------- 1 file changed, 22 insertions(+), 22 deletions(-) diff --git a/621-task-scheduler.js b/621-task-scheduler.js index 7f24d89e..1c07d12c 100755 --- a/621-task-scheduler.js +++ b/621-task-scheduler.js @@ -3,31 +3,31 @@ * @param {number} n * @return {number} */ -const leastInterval = function(tasks, n) { - const counter = new Array(26).fill(0); - let max = 0; - let maxCount = 0; - const A = 'A'.charCodeAt(0) - for(let ch of tasks) { - const task = ch.charCodeAt(0) - counter[task - A]++; - if(max == counter[task - A]) { - maxCount++; - } - else if(max < counter[task - A]) { - max = counter[task - A]; - maxCount = 1; - } +const leastInterval = function (tasks, n) { + const len = tasks.length + const cnt = Array(26).fill(0) + + const A = 'A'.charCodeAt(0) + let maxFreq = 0, + maxFreqCnt = 0 + for (const ch of tasks) { + const idx = ch.charCodeAt(0) - A + cnt[idx]++ + if (maxFreq === cnt[idx]) { + maxFreqCnt++ + } else if (maxFreq < cnt[idx]) { + maxFreqCnt = 1 + maxFreq = cnt[idx] } + } - const partCount = max - 1; - const partLength = n - (maxCount - 1); - const emptySlots = partCount * partLength; - const availableTasks = tasks.length - max * maxCount; - const idles = Math.max(0, emptySlots - availableTasks); + const slot = maxFreq - 1 + const numOfPerSlot = n - (maxFreqCnt - 1) + const available = len - maxFreq * maxFreqCnt + const idles = Math.max(0, slot * numOfPerSlot - available) + return len + idles +} - return tasks.length + idles; -}; // another From f2b57b9c68771c9f8dca020ea7ddc0541cdcc42f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Jul 2022 16:29:37 +0800 Subject: [PATCH 0868/2039] Create 904-fruit-into-baskets.js --- 904-fruit-into-baskets.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 904-fruit-into-baskets.js diff --git a/904-fruit-into-baskets.js b/904-fruit-into-baskets.js new file mode 100644 index 00000000..4936d3d0 --- /dev/null +++ b/904-fruit-into-baskets.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} fruits + * @return {number} + */ +const totalFruit = function (fruits) { + let n = fruits.length + let i = 0, j = 0 + const map = new Map() + let res = 0 + for(;j < n; j++) { + const e = fruits[j] + if(!map.has(e)) map.set(e, 1) + else map.set(e, map.get(e) + 1) + + while(map.size > 2 && i < n) { + const tmp = fruits[i++] + map.set(tmp, map.get(tmp) - 1) + if(map.get(tmp) === 0) { + map.delete(tmp) + } + } + res = Math.max(res, j - i + 1) + } + + return res +} From fe425d32f952d7d5c7c81654aedd72f8b724bcea Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Jul 2022 20:52:09 +0800 Subject: [PATCH 0869/2039] Create 1375-number-of-times-binary-string-is-prefix-aligned.js --- ...ber-of-times-binary-string-is-prefix-aligned.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1375-number-of-times-binary-string-is-prefix-aligned.js diff --git a/1375-number-of-times-binary-string-is-prefix-aligned.js b/1375-number-of-times-binary-string-is-prefix-aligned.js new file mode 100644 index 00000000..b3f90fed --- /dev/null +++ b/1375-number-of-times-binary-string-is-prefix-aligned.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} flips + * @return {number} + */ +const numTimesAllBlue = function(flips) { + let res = 0, right = 0, n = flips.length + + for(let i = 0; i < n; i++) { + right = Math.max(right, flips[i]) + if(right === i + 1) res++ + } + + return res +}; From b858c2abdec1d18582fcb68b962262c0101e22be Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Jul 2022 10:15:56 +0800 Subject: [PATCH 0870/2039] Update 984-string-without-aaa-or-bbb.js --- 984-string-without-aaa-or-bbb.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/984-string-without-aaa-or-bbb.js b/984-string-without-aaa-or-bbb.js index bd4832b1..4b41b90a 100644 --- a/984-string-without-aaa-or-bbb.js +++ b/984-string-without-aaa-or-bbb.js @@ -22,3 +22,26 @@ const strWithout3a3b = function(a, b) { } return res }; + +// another + +/** + * @param {number} a + * @param {number} b + * @return {string} + */ +const strWithout3a3b = function (a, b, ac = 'a', bc = 'b') { + const delta = a - b + let res = '' + if (delta < 0) { + return strWithout3a3b(b, a, 'b', 'a') + } else { + while(a-- > 0) { + res += ac + if(a > b) res += ac, a-- + if(b-- > 0) res += bc + } + } + + return res +} From 3744bb57a28c1bbd0571bfc021b1052ff228fc43 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Jul 2022 10:49:01 +0800 Subject: [PATCH 0871/2039] Update 984-string-without-aaa-or-bbb.js --- 984-string-without-aaa-or-bbb.js | 40 ++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/984-string-without-aaa-or-bbb.js b/984-string-without-aaa-or-bbb.js index 4b41b90a..b5996159 100644 --- a/984-string-without-aaa-or-bbb.js +++ b/984-string-without-aaa-or-bbb.js @@ -1,3 +1,43 @@ +/** + * @param {number} a + * @param {number} b + * @return {string} + */ +const strWithout3a3b = function (a, b) { + let res = '' + + while(a > 0 || b > 0) { + if(endsWith(res, 'aa')) { + res += 'b' + b-- + } else if(endsWith(res, 'bb')) { + res += 'a' + a-- + } else if(a >= b) { + res += 'a' + a-- + } else { + res += 'b' + b-- + } + } + + return res + + function endsWith(str, sub) { + let i = str.length - 1, j = sub.length - 1 + for(; i >=0 && j >= 0;i--,j--) { + if(str[i] !== sub[j]) return false + } + if(j >= 0) return false + + return true + } +} + +// another + + /** * @param {number} a * @param {number} b From e4acf9819314dcb994cd593b2ad633557e7acb18 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Jul 2022 21:07:28 +0800 Subject: [PATCH 0872/2039] Create 2128-remove-all-ones-with-row-and-column-flips.js --- ...move-all-ones-with-row-and-column-flips.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2128-remove-all-ones-with-row-and-column-flips.js diff --git a/2128-remove-all-ones-with-row-and-column-flips.js b/2128-remove-all-ones-with-row-and-column-flips.js new file mode 100644 index 00000000..0de7dfbb --- /dev/null +++ b/2128-remove-all-ones-with-row-and-column-flips.js @@ -0,0 +1,32 @@ +/** + * @param {number[][]} grid + * @return {boolean} + */ +const removeOnes = function(grid) { + + const m = grid.length + const n = grid[0].length + const first = grid[0] + for(let i = 1; i < m; i++) { + if(!equal(first, grid[i]) && !equal(first, flip(grid[i]))) return false + } + + return true + + function flip(arr) { + const res = [] + for(const e of arr) { + res.push(e === 1 ? 0 : 1) + } + return res + } + + function equal(a, b) { + const n = a.length + for(let i = 0; i < n; i++) { + if(a[i] !== b[i]) return false + } + + return true + } +}; From df4dfad5ba9688545d15c2f771d7e00b971cd0f3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Jul 2022 21:21:14 +0800 Subject: [PATCH 0873/2039] Update 2128-remove-all-ones-with-row-and-column-flips.js --- 2128-remove-all-ones-with-row-and-column-flips.js | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/2128-remove-all-ones-with-row-and-column-flips.js b/2128-remove-all-ones-with-row-and-column-flips.js index 0de7dfbb..55b28358 100644 --- a/2128-remove-all-ones-with-row-and-column-flips.js +++ b/2128-remove-all-ones-with-row-and-column-flips.js @@ -3,12 +3,11 @@ * @return {boolean} */ const removeOnes = function(grid) { - const m = grid.length const n = grid[0].length - const first = grid[0] + const first = grid[0], firstFliped = flip(first) for(let i = 1; i < m; i++) { - if(!equal(first, grid[i]) && !equal(first, flip(grid[i]))) return false + if(!equal(first, grid[i]) && !equal(firstFliped, grid[i])) return false } return true From ac154cb5576911b0cd91a9898d1b05141a704750 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 29 Jul 2022 22:56:00 +0800 Subject: [PATCH 0874/2039] Update 1405-longest-happy-string.js --- 1405-longest-happy-string.js | 38 ++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1405-longest-happy-string.js b/1405-longest-happy-string.js index 9da22977..d86f669f 100644 --- a/1405-longest-happy-string.js +++ b/1405-longest-happy-string.js @@ -53,3 +53,41 @@ function generate(a, b, c, ac, bc, cc) { ); } +// another + +/** + * @param {number} a + * @param {number} b + * @param {number} c + * @return {string} + */ +const longestDiverseString = function (a, b, c) { + const n = a + b + c + let res = '' + let A = 0, B = 0, C = 0 + for(let i = 0; i < n; i++) { + if((a >= c && a >= b && A !== 2) || (B === 2 && a > 0) || (C === 2 && a > 0)) { + A++ + res += 'a' + a-- + B = 0 + C = 0 + } else if((b >= c && b >= a && B !== 2) || (A === 2 && b > 0) || (C === 2 && b)) { + B++ + res += 'b' + b-- + A = 0 + C = 0 + } else if((c >= a && c >= b && C !== 2) || (A === 2 && c) || (B === 2 && c)) { + C++ + res += 'c' + c-- + A = 0 + B = 0 + } + } + + return res +}; + + From 630297a3944bbd873b13698fd5282477bd1ff700 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 30 Jul 2022 20:06:59 +0800 Subject: [PATCH 0875/2039] Create 945-minimum-increment-to-make-array-unique.js --- 945-minimum-increment-to-make-array-unique.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 945-minimum-increment-to-make-array-unique.js diff --git a/945-minimum-increment-to-make-array-unique.js b/945-minimum-increment-to-make-array-unique.js new file mode 100644 index 00000000..8133c9d1 --- /dev/null +++ b/945-minimum-increment-to-make-array-unique.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minIncrementForUnique = function(nums) { + const seen = new Set() + const queue = [] + let res = 0 + for(const e of nums) { + if(!seen.has(e)) seen.add(e) + else queue.push(e) + } + queue.sort((a, b) => b - a) + for(let i = 0; i <= 1e5 || queue.length; i++) { + if(!seen.has(i) && i > last(queue)) { + res += i - queue.pop() + } + } + + return res + + + function last(arr) { + return arr[arr.length - 1] + } +}; From 652a2e08b036f4a800f546335277c86f54e4490a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 30 Jul 2022 20:40:43 +0800 Subject: [PATCH 0876/2039] Update 945-minimum-increment-to-make-array-unique.js --- 945-minimum-increment-to-make-array-unique.js | 20 +++++++++++++++++-- 1 file changed, 18 insertions(+), 2 deletions(-) diff --git a/945-minimum-increment-to-make-array-unique.js b/945-minimum-increment-to-make-array-unique.js index 8133c9d1..0ce8f909 100644 --- a/945-minimum-increment-to-make-array-unique.js +++ b/945-minimum-increment-to-make-array-unique.js @@ -18,9 +18,25 @@ const minIncrementForUnique = function(nums) { } return res - - + function last(arr) { return arr[arr.length - 1] } }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const minIncrementForUnique = function(nums) { + let res = 0, nxt = 0 + nums.sort((a, b) => a - b) + for(const e of nums) { + res += Math.max(0, nxt - e) + nxt = Math.max(nxt, e) + 1 + } + + return res +}; From 17b25141615fccf3924e6e91a1718603abf1f413 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 30 Jul 2022 21:45:57 +0800 Subject: [PATCH 0877/2039] Create 1239-maximum-length-of-a-concatenated-string-with-unique-characters.js --- ...catenated-string-with-unique-characters.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1239-maximum-length-of-a-concatenated-string-with-unique-characters.js diff --git a/1239-maximum-length-of-a-concatenated-string-with-unique-characters.js b/1239-maximum-length-of-a-concatenated-string-with-unique-characters.js new file mode 100644 index 00000000..7572f0d6 --- /dev/null +++ b/1239-maximum-length-of-a-concatenated-string-with-unique-characters.js @@ -0,0 +1,41 @@ +/** + * @param {string[]} arr + * @return {number} + */ +const maxLength = function(arr) { + let maxLen = 0; + arr = arr.filter(isUnique); + const mem = {}; + maxLen = dfs(arr, "", 0, maxLen, mem); + + return maxLen; +}; + +function dfs(arr, path, i, maxLen, mem) { + if (mem[path]) return mem[path]; + let pathIsUnique = isUnique(path); + if (pathIsUnique) { + maxLen = Math.max(path.length, maxLen); + } + if (i === arr.length || !pathIsUnique) { + mem[path] = maxLen; + return maxLen; + } + for (let j = i; j < arr.length; j++) { + maxLen = dfs(arr, path + arr[j], j + 1, maxLen, mem); + } + + + mem[path] = maxLen; + return maxLen; +} + +function isUnique(str) { + const map = {} + for (let i = 0; i < str.length; i++) { + if (map[str[i]]) return false; + map[str[i]] = 1; + } + + return true; +} From 687debc43621983fd87ae848a109b749dee29804 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Jul 2022 16:28:23 +0800 Subject: [PATCH 0878/2039] Create 2359-find-closest-node-to-given-two-nodes.js --- 2359-find-closest-node-to-given-two-nodes.js | 62 ++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 2359-find-closest-node-to-given-two-nodes.js diff --git a/2359-find-closest-node-to-given-two-nodes.js b/2359-find-closest-node-to-given-two-nodes.js new file mode 100644 index 00000000..8de57cc7 --- /dev/null +++ b/2359-find-closest-node-to-given-two-nodes.js @@ -0,0 +1,62 @@ +/** + * @param {number[]} edges + * @param {number} node1 + * @param {number} node2 + * @return {number} + */ +const closestMeetingNode = function(edges, node1, node2) { + const graph = {} + const n = edges.length + for(let i = 0; i < n; i++) { + const e = edges[i] + if(graph[i] == null) graph[i] = new Set() + if(e !== -1) graph[i].add(e) + } + + const dis1 = bfs(node1), dis2 = bfs(node2) + // console.log(dis1, dis2) + let min = Infinity, res= -1 + + for(let i = 0; i < n; i++) { + const disa = dis1[i], disb = dis2[i] + if(disa !== Infinity && disb !== Infinity) { + const tmp = Math.min(min, Math.max(disa, disb)) + if(tmp < min) { + res = i + min = tmp + } + } + + } + + return res + + function bfs(node) { + const dis1 = Array(n).fill(Infinity) + dis1[node] = 0 + const visited = new Set() + visited.add(node) + let q = [node], dis = 0 + + while(q.length) { + const size = q.length + const nxt = [] + dis++ + for(let i = 0; i < size; i++) { + const cur = q[i] + const tmp = graph[cur] + if(tmp) { + for(const e of tmp) { + if(visited.has(e)) continue + nxt.push(e) + visited.add(e) + dis1[e] = dis + } + } + } + q = nxt + } + return dis1 + } + +}; From 05321eda6215a69a81902de50d5a0dc015427ec6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Jul 2022 16:29:23 +0800 Subject: [PATCH 0879/2039] Create 2358-maximum-number-of-groups-entering-a-competition.js --- ...number-of-groups-entering-a-competition.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2358-maximum-number-of-groups-entering-a-competition.js diff --git a/2358-maximum-number-of-groups-entering-a-competition.js b/2358-maximum-number-of-groups-entering-a-competition.js new file mode 100644 index 00000000..3813ab8d --- /dev/null +++ b/2358-maximum-number-of-groups-entering-a-competition.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} grades + * @return {number} + */ +const maximumGroups = function(grades) { + grades.sort((a, b) => a - b) + let res = 0 + let pre = 0, preNum = 0, cur = 0, curNum = 0 + const n = grades.length + for(let i = 0; i < n; i++) { + cur += grades[i] + curNum++ + if(cur > pre && curNum > preNum) { + res++ + pre = cur + preNum = curNum + cur = 0 + curNum = 0 + } + } + + + return res +}; From 77c0837e74a82f92a28922d01c4423bbc5d23480 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Jul 2022 16:29:58 +0800 Subject: [PATCH 0880/2039] Create 2357-make-array-zero-by-subtracting-equal-amounts.js --- ...array-zero-by-subtracting-equal-amounts.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2357-make-array-zero-by-subtracting-equal-amounts.js diff --git a/2357-make-array-zero-by-subtracting-equal-amounts.js b/2357-make-array-zero-by-subtracting-equal-amounts.js new file mode 100644 index 00000000..8a733003 --- /dev/null +++ b/2357-make-array-zero-by-subtracting-equal-amounts.js @@ -0,0 +1,32 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumOperations = function(nums) { + + let res = 0 + + while(!allZero(nums)) { + const sub = minNonZero(nums) + nums = nums.map(e => e - sub) + + res++ + } + + return res + + function minNonZero(arr) { + let res = 0 + const f = arr.filter(e => e > 0) + + + return Math.min(...f) + } + + function allZero(arr) { + for(const e of arr) { + if(e > 0) return false + } + return true + } +}; From 067823c50db6a0caefe3a834127af342145329b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Jul 2022 16:52:39 +0800 Subject: [PATCH 0881/2039] Create 2360-longest-cycle-in-a-graph.js --- 2360-longest-cycle-in-a-graph.js | 33 ++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2360-longest-cycle-in-a-graph.js diff --git a/2360-longest-cycle-in-a-graph.js b/2360-longest-cycle-in-a-graph.js new file mode 100644 index 00000000..da87392d --- /dev/null +++ b/2360-longest-cycle-in-a-graph.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} edges + * @return {number} + */ +const longestCycle = function(edges) { + const n = edges.length, colors = Array(n).fill(0), dis = Array(n).fill(0) + let res = -1 + + for(let i = 0; i < n; i++) { + if(colors[i] === 0) { + res = Math.max(res, dfs(i, 0)) + } + } + + return res + + function dfs(u, d) { + let ans = -1 + dis[u] = d + colors[u] = 1 + + if(edges[u] !== -1) { + if(colors[edges[u]] == 1) { + return dis[u] - dis[edges[u]] + 1 + } else if(colors[edges[u]] === 0) { + ans = Math.max(ans, dfs(edges[u], d + 1)) + } + } + + colors[u] = 2 + return ans + } +}; From a6ac1c14c47a2ab4b811de010fab022bb698baa4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Jul 2022 19:52:49 +0800 Subject: [PATCH 0882/2039] Create 2333-minimum-sum-of-squared-difference.js --- 2333-minimum-sum-of-squared-difference.js | 33 +++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2333-minimum-sum-of-squared-difference.js diff --git a/2333-minimum-sum-of-squared-difference.js b/2333-minimum-sum-of-squared-difference.js new file mode 100644 index 00000000..fe9a2a9b --- /dev/null +++ b/2333-minimum-sum-of-squared-difference.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k1 + * @param {number} k2 + * @return {number} + */ +const minSumSquareDiff = function (nums1, nums2, k1, k2) { + const n = nums1.length + const diff = Array(n).fill(0) + for (let i = 0; i < n; ++i) { + diff[i] = Math.abs(nums1[i] - nums2[i]) + } + const M = Math.max(...diff) + const bucket = Array(M + 1).fill(0) + for (let i = 0; i < n; i++) { + bucket[diff[i]]++ + } + let k = k1 + k2 + for (let i = M; i > 0; i--) { + if (bucket[i] > 0) { + const minus = Math.min(bucket[i], k) + bucket[i] -= minus + bucket[i - 1] += minus + k -= minus + } + } + let res = 0 + for (let i = M; i > 0; --i) { + res += bucket[i] * i * i + } + return res +} From 282ca9301a5b6752247aebce3110b91b6412ae36 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Jul 2022 20:36:39 +0800 Subject: [PATCH 0883/2039] Update 2333-minimum-sum-of-squared-difference.js --- 2333-minimum-sum-of-squared-difference.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/2333-minimum-sum-of-squared-difference.js b/2333-minimum-sum-of-squared-difference.js index fe9a2a9b..0837f9ac 100644 --- a/2333-minimum-sum-of-squared-difference.js +++ b/2333-minimum-sum-of-squared-difference.js @@ -17,7 +17,7 @@ const minSumSquareDiff = function (nums1, nums2, k1, k2) { bucket[diff[i]]++ } let k = k1 + k2 - for (let i = M; i > 0; i--) { + for (let i = M; i > 0 && k; i--) { if (bucket[i] > 0) { const minus = Math.min(bucket[i], k) bucket[i] -= minus From 638f94a7364ecd3627b07db8de1edf28853a0cf3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Aug 2022 21:02:33 +0800 Subject: [PATCH 0884/2039] Create 2350-shortest-impossible-sequence-of-rolls.js --- 2350-shortest-impossible-sequence-of-rolls.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2350-shortest-impossible-sequence-of-rolls.js diff --git a/2350-shortest-impossible-sequence-of-rolls.js b/2350-shortest-impossible-sequence-of-rolls.js new file mode 100644 index 00000000..d7bcc54d --- /dev/null +++ b/2350-shortest-impossible-sequence-of-rolls.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} rolls + * @param {number} k + * @return {number} + */ +const shortestSequence = function (rolls, k) { + let res = 1 + let set = new Set() + + for (let i of rolls) { + set.add(i) + if (set.size === k) { + res++ + set = new Set() + } + } + return res +} From 6c3790b26c0568648b7dc3340f2c6e07a9896b19 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Aug 2022 14:25:04 +0800 Subject: [PATCH 0885/2039] Create 2242-maximum-score-of-a-node-sequence.js --- 2242-maximum-score-of-a-node-sequence.js | 140 +++++++++++++++++++++++ 1 file changed, 140 insertions(+) create mode 100644 2242-maximum-score-of-a-node-sequence.js diff --git a/2242-maximum-score-of-a-node-sequence.js b/2242-maximum-score-of-a-node-sequence.js new file mode 100644 index 00000000..0494ea71 --- /dev/null +++ b/2242-maximum-score-of-a-node-sequence.js @@ -0,0 +1,140 @@ +class Heap { + constructor(data = []) { + this.data = data + this.comparator = (a, b) => a[1] - b[1] + this.heapify() + } + + // O(nlog(n)). In fact, O(n) + heapify() { + if (this.size() < 2) return + for (let i = 1; i < this.size(); i++) { + this.bubbleUp(i) + } + } + + // O(1) + peek() { + if (this.size() === 0) return null + return this.data[0] + } + + // O(log(n)) + offer(value) { + this.data.push(value) + this.bubbleUp(this.size() - 1) + } + + // O(log(n)) + poll() { + if (this.size() === 0) return null + const result = this.data[0] + const last = this.data.pop() + if (this.size() !== 0) { + this.data[0] = last + this.bubbleDown(0) + } + return result + } + + // O(log(n)) + bubbleUp(index) { + while (index > 0) { + const parentIndex = (index - 1) >> 1 + if (this.comparator(this.data[index], this.data[parentIndex]) < 0) { + this.swap(index, parentIndex) + index = parentIndex + } else { + break + } + } + } + + // O(log(n)) + bubbleDown(index) { + const lastIndex = this.size() - 1 + while (true) { + const leftIndex = index * 2 + 1 + const rightIndex = index * 2 + 2 + let findIndex = index + if ( + leftIndex <= lastIndex && + this.comparator(this.data[leftIndex], this.data[findIndex]) < 0 + ) { + findIndex = leftIndex + } + if ( + rightIndex <= lastIndex && + this.comparator(this.data[rightIndex], this.data[findIndex]) < 0 + ) { + findIndex = rightIndex + } + if (index !== findIndex) { + this.swap(index, findIndex) + index = findIndex + } else { + break + } + } + } + + // O(1) + swap(index1, index2) { + ;[this.data[index1], this.data[index2]] = [ + this.data[index2], + this.data[index1], + ] + } + + // O(1) + size() { + return this.data.length + } + + toArray() { + return this.data.reverse().map((dt) => dt.index) + } +} + +/** + * @param {number[]} scores + * @param {number[][]} edges + * @return {number} + */ +const maximumScore = (scores, edges) => { + const n = scores.length + + let top3 = new Array(n).fill().map(() => new Heap()) + + for (let [u, v] of edges) { + top3[u].offer([v, scores[v]]) + if (top3[u].size() > 3) top3[u].poll() + top3[v].offer([u, scores[u]]) + if (top3[v].size() > 3) top3[v].poll() + } + + let top3Array = new Array(n) + + for (let i = 0; i < n; i++) { + top3Array[i] = [...top3[i].data] + } + + let ans = -1 + for (let [b, c] of edges) { + if (top3[b].size() < 2 || top3[c].size() < 2) { + continue + } + + let score = scores[b] + scores[c] + + for (let [a, scoreA] of top3Array[b]) { + for (let [d, scoreD] of top3Array[c]) { + if (a !== b && a !== c && d !== b && d !== c && a !== d) { + ans = Math.max(ans, scoreA + score + scoreD) + } + } + } + } + + return ans +} From 8fc55dc6b6eafcd430f5954d46acc6174a6ada8d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Aug 2022 14:36:03 +0800 Subject: [PATCH 0886/2039] Update 2242-maximum-score-of-a-node-sequence.js --- 2242-maximum-score-of-a-node-sequence.js | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/2242-maximum-score-of-a-node-sequence.js b/2242-maximum-score-of-a-node-sequence.js index 0494ea71..983fb9f8 100644 --- a/2242-maximum-score-of-a-node-sequence.js +++ b/2242-maximum-score-of-a-node-sequence.js @@ -103,17 +103,16 @@ class Heap { */ const maximumScore = (scores, edges) => { const n = scores.length + const top3 = new Array(n).fill().map(() => new Heap()) - let top3 = new Array(n).fill().map(() => new Heap()) - - for (let [u, v] of edges) { + for (const [u, v] of edges) { top3[u].offer([v, scores[v]]) if (top3[u].size() > 3) top3[u].poll() top3[v].offer([u, scores[u]]) if (top3[v].size() > 3) top3[v].poll() } - let top3Array = new Array(n) + const top3Array = new Array(n) for (let i = 0; i < n; i++) { top3Array[i] = [...top3[i].data] @@ -125,7 +124,7 @@ const maximumScore = (scores, edges) => { continue } - let score = scores[b] + scores[c] + const score = scores[b] + scores[c] for (let [a, scoreA] of top3Array[b]) { for (let [d, scoreD] of top3Array[c]) { From 8fd1178bf13912df829c6d57359f3286015b6c8f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Aug 2022 12:05:47 +0800 Subject: [PATCH 0887/2039] Create 2332-the-latest-time-to-catch-a-bus.js --- 2332-the-latest-time-to-catch-a-bus.js | 42 ++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2332-the-latest-time-to-catch-a-bus.js diff --git a/2332-the-latest-time-to-catch-a-bus.js b/2332-the-latest-time-to-catch-a-bus.js new file mode 100644 index 00000000..8b99c6bf --- /dev/null +++ b/2332-the-latest-time-to-catch-a-bus.js @@ -0,0 +1,42 @@ +/** + * @param {number[]} buses + * @param {number[]} passengers + * @param {number} capacity + * @return {number} + */ +const latestTimeCatchTheBus = function(buses, passengers, capacity) { + buses.sort((b1, b2) => b1 - b2) + passengers.sort((p1, p2) => p1 - p2) + + const passengersSet = new Set(passengers) + + let j = 0 + let lastBus = [] + for (let i = 0; i < buses.length; i++) { + let k = j + let currentBus = [] + while (k - j < capacity && passengers[k] <= buses[i]) { + currentBus.push(passengers[k]) + k++ + } + lastBus = currentBus + j = k + } + + let lastArrival + if (lastBus.length == capacity) { + lastArrival = lastBus[capacity - 1] + while (passengersSet.has(lastArrival)) { + lastArrival-- + } + } else { + lastArrival = buses[buses.length - 1] + + while (passengersSet.has(lastArrival)) { + lastArrival-- + } + } + + + return lastArrival +}; From e96cf19739bc5d6bb26ea046b55ee15354938934 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Aug 2022 09:44:07 +0800 Subject: [PATCH 0888/2039] Create 2311-longest-binary-subsequence-less-than-or-equal-to-k.js --- ...ary-subsequence-less-than-or-equal-to-k.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2311-longest-binary-subsequence-less-than-or-equal-to-k.js diff --git a/2311-longest-binary-subsequence-less-than-or-equal-to-k.js b/2311-longest-binary-subsequence-less-than-or-equal-to-k.js new file mode 100644 index 00000000..8ff9dddd --- /dev/null +++ b/2311-longest-binary-subsequence-less-than-or-equal-to-k.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const longestSubsequence = function(s, k) { + let val = 0, pow = 1, oneNum = 0 + for(let i = s.length - 1; i >= 0 && val + pow <= k; i--) { + if(s[i] === '1') { + oneNum++ + val += pow + } + pow <<= 1 + } + return cnt(s, '0') + oneNum + function cnt(s, t) { + let res = 0 + for(const e of s) { + if(e === '0') res++ + } + return res + } +}; From 7a42bfde133cadb5d8635b1f9712e6c7afd27ee5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 6 Aug 2022 20:48:16 +0800 Subject: [PATCH 0889/2039] Create 2263-make-array-non-decreasing-or-non-increasing.js --- ...-array-non-decreasing-or-non-increasing.js | 93 +++++++++++++++++++ 1 file changed, 93 insertions(+) create mode 100644 2263-make-array-non-decreasing-or-non-increasing.js diff --git a/2263-make-array-non-decreasing-or-non-increasing.js b/2263-make-array-non-decreasing-or-non-increasing.js new file mode 100644 index 00000000..63b4d19b --- /dev/null +++ b/2263-make-array-non-decreasing-or-non-increasing.js @@ -0,0 +1,93 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var convertArray = function (nums) { + function helper(nums) { + let que = new PriorityQueue((a, b)=>a > b) + let res = 0 + for (let num of nums) { + if (!que.isEmpty() && num < que.peek()) { + res += que.pop() - num + que.push(num) + } + que.push(num) + } + return res + } + + + let nums2 = Array(nums.length).fill(0) + for (let i = 0; i < nums.length; i++) { + nums2[nums.length - 1 - i] = nums[i] + } + return Math.min(helper(nums), helper(nums2)) +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From d309c37e3cefa8083eb2ed120edc1f7c29b57faf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Aug 2022 12:28:15 +0800 Subject: [PATCH 0890/2039] Create 2370-longest-ideal-subsequence.js --- 2370-longest-ideal-subsequence.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2370-longest-ideal-subsequence.js diff --git a/2370-longest-ideal-subsequence.js b/2370-longest-ideal-subsequence.js new file mode 100644 index 00000000..d08cb5b2 --- /dev/null +++ b/2370-longest-ideal-subsequence.js @@ -0,0 +1,18 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const longestIdealString = function(s, k) { + const n = s.length + const arr = [], a = 'a'.charCodeAt(0) + for(const ch of s) { + arr.push(ch.charCodeAt(0) - a) + } + const dp = Array(26).fill(0) + for(const e of arr) { + dp[e] = 1 + Math.max(...dp.slice(Math.max(0, e - k), e + k + 1)) + } + return Math.max(...dp) +}; + From cb46b9dcc692188874b3353a8f7b443a516536f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Aug 2022 12:28:48 +0800 Subject: [PATCH 0891/2039] Create 2369-check-if-there-is-a-valid-partition-for-the-array.js --- ...here-is-a-valid-partition-for-the-array.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2369-check-if-there-is-a-valid-partition-for-the-array.js diff --git a/2369-check-if-there-is-a-valid-partition-for-the-array.js b/2369-check-if-there-is-a-valid-partition-for-the-array.js new file mode 100644 index 00000000..bd17e045 --- /dev/null +++ b/2369-check-if-there-is-a-valid-partition-for-the-array.js @@ -0,0 +1,51 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +var validPartition = function(nums) { + const n = nums.length + const memo = {} + function dfs(i, cur) { + // console.log(i,cur) + if(i === n) { + if(chk1(cur) || chk2(cur) || chk3(cur) || cur.length === 0) return true + return false + } + const k = `${i}_${cur.join(',')}` + if(memo[k] != null) return memo[k] + let res + if(cur.length === 0) { + cur.push(nums[i]) + res = dfs(i + 1, cur) + } else if(cur.length === 1) { + cur.push(nums[i]) + res = dfs(i + 1, cur) + } else if(cur.length === 2) { + let r1 = false + if(chk1(cur)) { + r1 = dfs(i + 1, [nums[i]]) + } + cur.push(nums[i]) + let r2 = dfs(i + 1, cur) + res = r1 || r2 + } else if(cur.length === 3) { + if(chk2(cur) || chk3(cur)) { + res = dfs(i + 1, [nums[i]]) + }else res = false + } + memo[k] = res + return res + } + + return dfs(0, []) + + function chk1(arr) { + return arr.length === 2 && arr[0] === arr[1] + } + function chk2(arr) { + return arr.length === 3 && arr[0] === arr[1] && arr[2] === arr[1] + } + function chk3(arr) { + return arr.length === 3 && arr[1] - arr[0] === 1 && arr[2] - arr[1] === 1 + } +}; From 9cd9403e524538ceea4ed8757da1b51ec2102a5a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Aug 2022 12:29:13 +0800 Subject: [PATCH 0892/2039] Create 2368-reachable-nodes-with-restrictions.js --- 2368-reachable-nodes-with-restrictions.js | 41 +++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 2368-reachable-nodes-with-restrictions.js diff --git a/2368-reachable-nodes-with-restrictions.js b/2368-reachable-nodes-with-restrictions.js new file mode 100644 index 00000000..2cdc408f --- /dev/null +++ b/2368-reachable-nodes-with-restrictions.js @@ -0,0 +1,41 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} restricted + * @return {number} + */ +const reachableNodes = function(n, edges, restricted) { + const graph = {} + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = new Set() + if(graph[v] == null) graph[v] = new Set() + graph[u].add(v) + graph[v].add(u) + } + const forbid = new Set(restricted) + const visited = new Set() + let res = 0 + let q = [] + if(!forbid.has(0)) q.push(0) + visited.add(0) + while(q.length) { + const size = q.length + const tmp = [] + for(let i = 0; i < size; i++) { + const cur = q[i] + res++ + for(const e of (graph[cur] || [])) { + if(!forbid.has(e) && !visited.has(e)) { + tmp.push(e) + visited.add(e) + } + } + + } + + q = tmp + } + + + return res +}; From caa79de56c297f86538af34a2d45f90a5c46d958 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Aug 2022 12:29:45 +0800 Subject: [PATCH 0893/2039] Create 2367-number-of-arithmetic-triplets.js --- 2367-number-of-arithmetic-triplets.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2367-number-of-arithmetic-triplets.js diff --git a/2367-number-of-arithmetic-triplets.js b/2367-number-of-arithmetic-triplets.js new file mode 100644 index 00000000..bbfec1db --- /dev/null +++ b/2367-number-of-arithmetic-triplets.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} diff + * @return {number} + */ +var arithmeticTriplets = function(nums, diff) { + let res = 0 + const n = nums.length + for(let i = 0;i < n - 2; i++) { + for(let j = i + 1; j < n - 1; j++) { + for(let k = j + 1; k < n; k++) { + if(nums[j] - nums[i] === diff && nums[k] - nums[j] === diff) { + res++ + } + } + } + } + return res +}; From d97b7a29663db42f586bfb1ca92c8fffb3e16d59 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Aug 2022 21:15:40 +0800 Subject: [PATCH 0894/2039] Update 2127-maximum-employees-to-be-invited-to-a-meeting.js --- ...um-employees-to-be-invited-to-a-meeting.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/2127-maximum-employees-to-be-invited-to-a-meeting.js b/2127-maximum-employees-to-be-invited-to-a-meeting.js index c0247001..bcaa93f1 100644 --- a/2127-maximum-employees-to-be-invited-to-a-meeting.js +++ b/2127-maximum-employees-to-be-invited-to-a-meeting.js @@ -1,3 +1,54 @@ +/** + * @param {number[]} favorite + * @return {number} + */ +const maximumInvitations = function (favorite) { + const n = favorite.length + const indegree = Array(n).fill(0) + for (let i = 0; i < n; i++) indegree[favorite[i]]++ + const { max } = Math + let q = [] + const visited = Array(n).fill(0) + const depth = Array(n).fill(1) + for (let i = 0; i < n; i++) { + if (indegree[i] === 0) { + depth[i] = 1 + visited[i] = 1 + q.push(i) + } + } + + while (q.length) { + const cur = q.shift() + const nxt = favorite[cur] + indegree[nxt]-- + if (indegree[nxt] == 0) { + q.push(nxt) + visited[nxt] = 1 + } + depth[nxt] = depth[cur] + 1 + } + + let max_circle_size = 0 + let max_link_size = 0 + for (let i = 0; i < n; i++) { + if (visited[i] === 1) continue + let j = i + let count = 0 + while (visited[j] == 0) { + count++ + visited[j] = 1 + j = favorite[j] + } + if (count > 2) max_circle_size = max(max_circle_size, count) + else if (count == 2) max_link_size += depth[i] + depth[favorite[i]] + } + + return max(max_circle_size, max_link_size) +} + +// another + /** * @param {number[]} favorite * @return {number} From 07b7c48d3901913067a3553700120b8fdeb432b5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 9 Aug 2022 18:56:00 +0800 Subject: [PATCH 0895/2039] Update 792-number-of-matching-subsequences.js --- 792-number-of-matching-subsequences.js | 31 ++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/792-number-of-matching-subsequences.js b/792-number-of-matching-subsequences.js index bf440135..0fc3d939 100644 --- a/792-number-of-matching-subsequences.js +++ b/792-number-of-matching-subsequences.js @@ -54,3 +54,34 @@ const numMatchingSubseq = function(S, words) { return res }; +// another + +/** + * @param {string} s + * @param {string[]} words + * @return {number} + */ +const numMatchingSubseq = function(s, words) { + const hash = {} + for(const w of words) { + const ch = w[0], it = w[Symbol.iterator]() + if(hash[ch] == null) hash[ch] = [] + hash[ch].push(it) + it.next() + } + let res = 0 + for(const e of s) { + const arr = hash[e] || [] + hash[e] = [] + for(const it of arr) { + const { value, done } = it.next() + if(done) res++ + else { + if(hash[value] == null) hash[value] = [] + hash[value].push(it) + } + } + } + + return res +}; From 39fa4f477de0d05a4572db1f88c9f153f6877066 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 10 Aug 2022 19:51:46 +0800 Subject: [PATCH 0896/2039] Update 1055-shortest-way-to-form-string,js --- 1055-shortest-way-to-form-string,js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1055-shortest-way-to-form-string,js b/1055-shortest-way-to-form-string,js index 1628fb07..886c670c 100644 --- a/1055-shortest-way-to-form-string,js +++ b/1055-shortest-way-to-form-string,js @@ -1,3 +1,30 @@ +/** + * @param {string} source + * @param {string} target + * @return {number} + */ +const shortestWay = function(source, target) { + const a = 'a'.charCodeAt(0), arr = Array(26).fill(0) + for(const ch of source) arr[ch.charCodeAt(0) - a] = 1 + let res = 0, j = 0 + for(let i = 0, n = source.length; i < n; i++) { + if(arr[target[j].charCodeAt(0) - a] === 0) return -1 + if(source[i] === target[j]) j++ + if(j === target.length) { + res++ + break + } + if(i === n - 1) { + res++ + i = -1 + } + } + + return res +}; + +// another + /** * @param {string} source * @param {string} target From b3394c8432549f68efbc4504fb5f9fca006a748a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Aug 2022 10:41:33 +0800 Subject: [PATCH 0897/2039] Update 524-longest-word-in-dictionary-through-deleting.js --- ...est-word-in-dictionary-through-deleting.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/524-longest-word-in-dictionary-through-deleting.js b/524-longest-word-in-dictionary-through-deleting.js index 70141249..bfe2742f 100644 --- a/524-longest-word-in-dictionary-through-deleting.js +++ b/524-longest-word-in-dictionary-through-deleting.js @@ -19,6 +19,38 @@ return res }; +// another + +/** + * @param {string} s + * @param {string[]} dictionary + * @return {string} + */ +const findLongestWord = function (s, dictionary) { + const n = dictionary.length + const idxArr = Array(n).fill(0) + let res = '' + for (const ch of s) { + for (let i = 0; i < n; i++) { + const idx = idxArr[i] + if (idx >= dictionary[i].length) continue + if (ch === dictionary[i][idx]) { + idxArr[i]++ + } + + if ( + idxArr[i] === dictionary[i].length && + (dictionary[i].length > res.length || + (dictionary[i].length === res.length && dictionary[i] < res)) + ) { + res = dictionary[i] + } + } + } + return res +} + + // another /** From 388dbb57366d8342ece6a4894f165de265343e9a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Aug 2022 12:32:55 +0800 Subject: [PATCH 0898/2039] Create 1804-implement-trie-ii-prefix-tree.js --- 1804-implement-trie-ii-prefix-tree.js | 75 +++++++++++++++++++++++++++ 1 file changed, 75 insertions(+) create mode 100644 1804-implement-trie-ii-prefix-tree.js diff --git a/1804-implement-trie-ii-prefix-tree.js b/1804-implement-trie-ii-prefix-tree.js new file mode 100644 index 00000000..2e2ecc84 --- /dev/null +++ b/1804-implement-trie-ii-prefix-tree.js @@ -0,0 +1,75 @@ +class Node { + constructor(val) { + this.val = val + this.cnt = 0 + this.children = {} + this.wordCnt = 0 + } +} + +const Trie = function () { + this.root = new Node(null) +} + +/** + * @param {string} word + * @return {void} + */ +Trie.prototype.insert = function (word) { + let cur = this.root + for(const ch of word) { + if(cur.children[ch] == null) cur.children[ch] = new Node(ch) + cur.children[ch].cnt++ + cur = cur.children[ch] + } + cur.wordCnt++ +} + +/** + * @param {string} word + * @return {number} + */ +Trie.prototype.countWordsEqualTo = function (word) { + let cur = this.root + for(const ch of word) { + if(cur.children[ch] == null) return 0 + cur = cur.children[ch] + } + return cur.wordCnt +} + +/** + * @param {string} prefix + * @return {number} + */ +Trie.prototype.countWordsStartingWith = function (prefix) { + let cur = this.root + for(const ch of prefix) { + if(cur.children[ch] == null) return 0 + cur = cur.children[ch] + } + return cur.cnt +} + +/** + * @param {string} word + * @return {void} + */ +Trie.prototype.erase = function (word) { + let cur = this.root + for(const ch of word) { + if(cur.children[ch] == null) break + cur.children[ch].cnt-- + cur = cur.children[ch] + } + cur.wordCnt-- +} + +/** + * Your Trie object will be instantiated and called as such: + * var obj = new Trie() + * obj.insert(word) + * var param_2 = obj.countWordsEqualTo(word) + * var param_3 = obj.countWordsStartingWith(prefix) + * obj.erase(word) + */ From ce25b5714b58fc2f34540f5d950f5ebcf0f601c9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Aug 2022 12:54:53 +0800 Subject: [PATCH 0899/2039] Create 1324-print-words-vertically.js --- 1324-print-words-vertically.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 1324-print-words-vertically.js diff --git a/1324-print-words-vertically.js b/1324-print-words-vertically.js new file mode 100644 index 00000000..9bf30f31 --- /dev/null +++ b/1324-print-words-vertically.js @@ -0,0 +1,30 @@ +/** + * @param {string} s + * @return {string[]} + */ +const printVertically = function(s) { + const arr = s.split(' ').filter(e => e !== '') + const m = arr.length + let n = 0 + for(const e of arr) { + n = Math.max(n, e.length) + } + + const mat = Array.from({ length: m }, () => Array(n).fill(' ')) + for(let i = 0; i < arr.length; i++) { + const cur = mat[i] + for(let j = 0; j < arr[i].length; j++) { + mat[i][j] = arr[i][j] + } + } + const res = [] + for(let j = 0; j < n; j++) { + const col = [] + for(let i = 0; i < m; i++) { + col.push(mat[i][j]) + } + res.push(col.join('').trimEnd()) + } + + return res +}; From dc463a1d90d31804198b2bcd4bc69322fb88888a Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Aug 2022 21:58:21 +0800 Subject: [PATCH 0900/2039] Update 2055-plates-between-candles.js --- 2055-plates-between-candles.js | 43 ++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/2055-plates-between-candles.js b/2055-plates-between-candles.js index a5f6cc3a..be63d3b9 100644 --- a/2055-plates-between-candles.js +++ b/2055-plates-between-candles.js @@ -36,3 +36,46 @@ const platesBetweenCandles = function(s, queries) { return res } + +// another + +/** + * @param {string} s + * @param {number[][]} queries + * @return {number[]} + */ +const platesBetweenCandles = function (s, queries) { + const n = s.length + const leftArr = Array(n).fill(-1), + rightArr = Array(n).fill(n), + candleCnt = Array(n).fill(0) + let candle = -1 + for (let i = 0; i < n; i++) { + if (s[i] === '|') candle = i + leftArr[i] = candle + } + candle = n + for (let i = n - 1; i >= 0; i--) { + if (s[i] === '|') candle = i + rightArr[i] = candle + } + let cnt = 0 + for (let i = 0; i < n; i++) { + if (s[i] === '|') cnt++ + candleCnt[i] = cnt + } + // console.log(leftArr, rightArr) + const res = [] + for (const [s, e] of queries) { + const l = rightArr[s] + const r = leftArr[e] + const diff = r - l + if (diff > 1) { + const e = r - l + 1 - (candleCnt[r] - candleCnt[l] + 1) + res.push(e) + } else res.push(0) + } + + return res +} + From 417993b847f72496cf8ce057d0e1c99325346898 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Aug 2022 21:58:41 +0800 Subject: [PATCH 0901/2039] Update 2055-plates-between-candles.js --- 2055-plates-between-candles.js | 49 ++++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/2055-plates-between-candles.js b/2055-plates-between-candles.js index be63d3b9..bca0a066 100644 --- a/2055-plates-between-candles.js +++ b/2055-plates-between-candles.js @@ -1,3 +1,52 @@ +/** + * @param {string} s + * @param {number[][]} queries + * @return {number[]} + */ +const platesBetweenCandles = function (s, queries) { + const candleIdxArr = [] + const n = s.length + for(let i = 0; i < n; i++) { + if(s[i] === '|') candleIdxArr.push(i) + } + // console.log(candleIdxArr) + const res = [] + for(const [s, e] of queries) { + const l = lower(candleIdxArr, s, e) + const r = upper(candleIdxArr, s ,e) + const tmp = (candleIdxArr[r] - candleIdxArr[l] + 1) - (r - l + 1) + res.push(tmp >= 0 ? tmp : 0) + } + + return res + + + function lower(arr,s,e) { + let l = 0, r = arr.length - 1 + while(l < r) { + // console.log('lower',l, r) + const mid = ~~(l + (r - l)/2) + if(arr[mid] < s) l = mid + 1 + else r = mid + } + return l + } + + function upper(arr,s, e) { + let l = 0, r = arr.length - 1 + while(l < r) { + + const mid = r - ~~((r - l)/2) + // console.log('upper', l, r, mid, e) + if(arr[mid] > e) r = mid - 1 + else l = mid + } + return l + } +} + +// another + /** * @param {string} s * @param {number[][]} queries From 780ccf02b2c2845228ae4695be24fe6f1731c451 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 13 Aug 2022 15:14:15 +0800 Subject: [PATCH 0902/2039] Update 2370-longest-ideal-subsequence.js --- 2370-longest-ideal-subsequence.js | 32 +++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2370-longest-ideal-subsequence.js b/2370-longest-ideal-subsequence.js index d08cb5b2..b9f66ca6 100644 --- a/2370-longest-ideal-subsequence.js +++ b/2370-longest-ideal-subsequence.js @@ -1,3 +1,35 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const longestIdealString = function(s, k) { + const n = s.length, a = 'a'.charCodeAt(0) + const dp = Array(26).fill(0) + let res = 0 + + for(let i = 0; i < n; i++) { + const cur = s[i], curCode = cur.charCodeAt(0) + const tmp = helper(curCode - a) + 1 + dp[curCode - a] = tmp + res = Math.max(res, tmp) + } + // console.log(dp) + return res + + function helper(end) { + let res = 0 + for(let i = Math.max(0, end - k), e = Math.min(25, end + k); i <= e; i++) { + if(dp[i] > res) res = dp[i] + } + + return res + } +}; + + +// another + /** * @param {string} s * @param {number} k From eb0d5d24cb9f706a43da858d51205c4ce019bdb0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 13 Aug 2022 21:59:16 +0800 Subject: [PATCH 0903/2039] Create 1381-design-a-stack-with-increment-operation.js --- ...design-a-stack-with-increment-operation.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 1381-design-a-stack-with-increment-operation.js diff --git a/1381-design-a-stack-with-increment-operation.js b/1381-design-a-stack-with-increment-operation.js new file mode 100644 index 00000000..e9ee6f60 --- /dev/null +++ b/1381-design-a-stack-with-increment-operation.js @@ -0,0 +1,51 @@ +/** + * @param {number} maxSize + */ +const CustomStack = function(maxSize) { + this.stk = [] + this.size = maxSize + this.inc = [] +}; + +/** + * @param {number} x + * @return {void} + */ +CustomStack.prototype.push = function(x) { + if(this.stk.length === this.size) return + this.stk.push(x) + this.inc.push(0) +}; + +/** + * @return {number} + */ +CustomStack.prototype.pop = function() { + if(this.stk.length === 0) return -1 + const e = this.stk.pop() + const inc = this.inc.pop() + if(this.inc.length) { + this.inc[this.inc.length - 1] += inc + } + return e + inc +}; + +/** + * @param {number} k + * @param {number} val + * @return {void} + */ +CustomStack.prototype.increment = function(k, val) { + const last = Math.min(k, this.inc.length) - 1 + if(last !== -1) { + this.inc[last] += val + } +}; + +/** + * Your CustomStack object will be instantiated and called as such: + * var obj = new CustomStack(maxSize) + * obj.push(x) + * var param_2 = obj.pop() + * obj.increment(k,val) + */ From 891ded4b6eac04d6b26f8915b3b63db25a662401 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Aug 2022 14:42:52 +0800 Subject: [PATCH 0904/2039] Create 2373-largest-local-values-in-a-matrix.js --- 2373-largest-local-values-in-a-matrix.js | 29 ++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2373-largest-local-values-in-a-matrix.js diff --git a/2373-largest-local-values-in-a-matrix.js b/2373-largest-local-values-in-a-matrix.js new file mode 100644 index 00000000..59874826 --- /dev/null +++ b/2373-largest-local-values-in-a-matrix.js @@ -0,0 +1,29 @@ +/** + * @param {number[][]} grid + * @return {number[][]} + */ +var largestLocal = function(grid) { + const n = grid.length + const res = Array.from({ length: n - 2 }, () => Array(n - 2).fill(0)) + + for(let i = 0; i < n - 2; i++) { + for(let j = 0; j < n - 2; j++) { + res[i][j] = helper(i, j) + } + } + + return res + + function helper(i, j) { + let res = 0 + for(let ii = i; ii < 3 + i; ii++) { + for(let jj = j; jj < 3 + j; jj++) { + if(grid[ii][jj] > res) { + res = grid[ii][jj] + } + } + } + + return res + } +}; From c584d9c66113a67990bcc2fda4f52b4ac876e30b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Aug 2022 14:43:28 +0800 Subject: [PATCH 0905/2039] Create 2374-node-with-highest-edge-score.js --- 2374-node-with-highest-edge-score.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2374-node-with-highest-edge-score.js diff --git a/2374-node-with-highest-edge-score.js b/2374-node-with-highest-edge-score.js new file mode 100644 index 00000000..41b5d73a --- /dev/null +++ b/2374-node-with-highest-edge-score.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} edges + * @return {number} + */ +var edgeScore = function(edges) { + const n = edges.length + const score = Array(n).fill(0) + for(let i = 0; i < n; i++) { + const from = i, to = edges[i] + score[to] += from + } + const max = Math.max(...score) + for(let i = 0; i < n; i++) { + const e = score[i] + if(e === max) return i + } +}; From f8a0930472750cabeb9e676e8cd0a09307768096 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Aug 2022 14:44:08 +0800 Subject: [PATCH 0906/2039] Create 2375-construct-smallest-number-from-di-string.js --- ...onstruct-smallest-number-from-di-string.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2375-construct-smallest-number-from-di-string.js diff --git a/2375-construct-smallest-number-from-di-string.js b/2375-construct-smallest-number-from-di-string.js new file mode 100644 index 00000000..425f2116 --- /dev/null +++ b/2375-construct-smallest-number-from-di-string.js @@ -0,0 +1,39 @@ +/** + * @param {string} pattern + * @return {string} + */ +var smallestNumber = function(pattern) { + const n = pattern.length + let res = '' + dfs('', new Set()) + + return res + + function dfs(str, set) { + if(str.length === n + 1) { + if(valid(str)) { + if(res === '') res = str + else if(str < res) res = str + } + return + } + + for(let i = 1; i <= 9; i++) { + if(set.has(i)) continue + set.add(i) + dfs(str + i, set) + set.delete(i) + } + + } + + + function valid(str) { + for(let i = 0; i < n; i++) { + if(pattern[i] === 'I' && str[i] >= str[i + 1]) return false + if(pattern[i] === 'D' && str[i] <= str[i + 1]) return false + } + + return true + } +}; From dc07b82a4972dcccb87a14163bd47161760c2411 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Aug 2022 14:44:44 +0800 Subject: [PATCH 0907/2039] Create 2376-count-special-integers.js --- 2376-count-special-integers.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2376-count-special-integers.js diff --git a/2376-count-special-integers.js b/2376-count-special-integers.js new file mode 100644 index 00000000..ac7e3eb6 --- /dev/null +++ b/2376-count-special-integers.js @@ -0,0 +1,27 @@ +/** + * @param {number} n + * @return {number} + */ +var countSpecialNumbers = function(n) { + const L = []; + for (let x = n + 1; x > 0; x = Math.floor(x / 10)) L.unshift(x % 10); + + // Count the number with digits < N + let res = 0, + limit = L.length; + for (let i = 1; i < limit; ++i) res += 9 * A(9, i - 1); + + const seen = new Set(); + for (let i = 0; i < limit; ++i) { + for (let j = i > 0 ? 0 : 1; j < L[i]; ++j) + if (!seen.has(j)) res += A(9 - i, limit - i - 1); + if (seen.has(L[i])) break; + seen.add(L[i]); + } + return res; +}; + + +function A(m, n) { + return n === 0 ? 1 : A(m, n - 1) * (m - n + 1); +} From 329147bdab90b31d99f53ad1d5fe61aeb1f61988 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Aug 2022 21:24:41 +0800 Subject: [PATCH 0908/2039] Update 727-minimum-window-subsequence.js --- 727-minimum-window-subsequence.js | 36 +++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/727-minimum-window-subsequence.js b/727-minimum-window-subsequence.js index ce26ad1b..635bc00f 100644 --- a/727-minimum-window-subsequence.js +++ b/727-minimum-window-subsequence.js @@ -1,3 +1,39 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {string} + */ +const minWindow = function (s1, s2) { + const S = s1,T=s2 + let m = T.length, n = S.length; + let dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0)); + for (let j = 0; j <= n; j++) { + dp[0][j] = j + 1; + } + for (let i = 1; i <= m; i++) { + for (let j = 1; j <= n; j++) { + if (T.charAt(i - 1) == S.charAt(j - 1)) { + dp[i][j] = dp[i - 1][j - 1]; + } else { + dp[i][j] = dp[i][j - 1]; + } + } + } + + let start = 0, len = n + 1; + for (let j = 1; j <= n; j++) { + if (dp[m][j] != 0) { + if (j - dp[m][j] + 1 < len) { + start = dp[m][j] - 1; + len = j - dp[m][j] + 1; + } + } + } + return len == n + 1 ? "" : S.substring(start, start + len); +} + +// another + /** * @param {string} s1 * @param {string} s2 From 725d1b1fa30dcdf66c5db726d93b08c58eace8bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Aug 2022 19:53:19 +0800 Subject: [PATCH 0909/2039] Update 357-count-numbers-with-unique-digits.js --- 357-count-numbers-with-unique-digits.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/357-count-numbers-with-unique-digits.js b/357-count-numbers-with-unique-digits.js index 3534107e..89c6f50b 100755 --- a/357-count-numbers-with-unique-digits.js +++ b/357-count-numbers-with-unique-digits.js @@ -16,3 +16,27 @@ const countNumbersWithUniqueDigits = function(n) { return res; }; + + +// another + +/** + * @param {number} n + * @return {number} + */ +const countNumbersWithUniqueDigits = function(n) { + const limit = 10 ** n + let res = 1 + let m = 1 + if(n === 0) return 1 + while(10**m <= limit) { + res += 9 * helper(9, m - 1) + m++ + } + + return res + + function helper(m, n) { + return n === 0 ? 1 : helper(m, n - 1) * (m - n + 1) + } +}; From d413c53794589d4ef7416ebfc46c2c906fa47df0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Aug 2022 20:15:57 +0800 Subject: [PATCH 0910/2039] Update 357-count-numbers-with-unique-digits.js --- 357-count-numbers-with-unique-digits.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/357-count-numbers-with-unique-digits.js b/357-count-numbers-with-unique-digits.js index 89c6f50b..9aca0ff3 100755 --- a/357-count-numbers-with-unique-digits.js +++ b/357-count-numbers-with-unique-digits.js @@ -40,3 +40,23 @@ const countNumbersWithUniqueDigits = function(n) { return n === 0 ? 1 : helper(m, n - 1) * (m - n + 1) } }; + +// another + +/** + * @param {number} n + * @return {number} + */ +const countNumbersWithUniqueDigits = function(n) { + if(n === 0) return 1 + let res = 10 + let tmp = 9, digits = 9 + while(n > 1 && digits > 0) { + tmp *= digits + res += tmp + n-- + digits-- + } + + return res +}; From cc45ae037a69d27d62217780190172869d9148d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Aug 2022 21:53:03 +0800 Subject: [PATCH 0911/2039] Create 855-exam-room.js --- 855-exam-room.js | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 855-exam-room.js diff --git a/855-exam-room.js b/855-exam-room.js new file mode 100644 index 00000000..e5025e9f --- /dev/null +++ b/855-exam-room.js @@ -0,0 +1,35 @@ +/** + * @param {number} n + */ +const ExamRoom = function(n) { + let a = []; + return { seat, leave } + function seat() { + if (a.length == 0) { + a.push(0); + return 0; + } + let dis = Math.max(a[0], n - 1 - a[a.length - 1]); + for (let i = 1; i < a.length; i++) dis = Math.max(dis, a[i] - a[i - 1] >> 1); + if (a[0] == dis) { + a.unshift(0); + return 0; + } + for (let i = 1; i < a.length; i++) { + if (a[i] - a[i - 1] >> 1 == dis) { + a.splice(i, 0, a[i] + a[i - 1] >> 1); + return a[i]; + } + } + a.push(n - 1); + return n - 1; + } + function leave(p) { + for (let i = 0; i < a.length; i++) { + if (a[i] == p) { + a.splice(i, 1); + break; + } + } + } +}; From 890aeb9523a082f5857b3f2f9b7ddad3d918c7a0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Aug 2022 16:36:49 +0800 Subject: [PATCH 0912/2039] Update 2376-count-special-integers.js --- 2376-count-special-integers.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/2376-count-special-integers.js b/2376-count-special-integers.js index ac7e3eb6..c2f74b4f 100644 --- a/2376-count-special-integers.js +++ b/2376-count-special-integers.js @@ -25,3 +25,36 @@ var countSpecialNumbers = function(n) { function A(m, n) { return n === 0 ? 1 : A(m, n - 1) * (m - n + 1); } + +// another + +/** + * @param {number} n + * @return {number} + */ +const countSpecialNumbers = function (n) { + const s = '' + n + const dp = Array.from({ length: 11 }, () => + Array.from({ length: 2 }, () => Array(1024).fill(-1)) + ) + + return helper(0, 1, 0, s) + function helper(idx, tight = 1, mask = 0, digits) { + if (idx == digits.length) return mask !== 0 ? 1 : 0 + + if (dp[idx][tight][mask] != -1) return dp[idx][tight][mask] + + let k = tight ? +digits[idx] : 9 + let ans = 0 + + for (let i = 0; i <= k; i++) { + if (mask & (1 << i)) continue + let newMask = mask == 0 && i == 0 ? mask : mask | (1 << i) + + let nextTight = tight && i == digits[idx] ? 1 : 0 + ans += helper(idx + 1, nextTight, newMask, digits) + } + + return (dp[idx][tight][mask] = ans) + } +} From d43e96b05f906d5f92ee14994a22c88c0e50226b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 19 Aug 2022 13:44:57 +0800 Subject: [PATCH 0913/2039] Create 1390-four-divisors.js --- 1390-four-divisors.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1390-four-divisors.js diff --git a/1390-four-divisors.js b/1390-four-divisors.js new file mode 100644 index 00000000..14be97bd --- /dev/null +++ b/1390-four-divisors.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var sumFourDivisors = function(nums) { + let res = 0 + + for(const e of nums) { + const set = helper(e) + if(set.size === 4) { + for(const i of set) res += i + } + } + + return res + + function helper(num) { + const set = new Set() + const r = ~~(Math.sqrt(num) + 1) + for(let i = 1; i < r; i++) { + if(num % i === 0) { + set.add(i) + set.add(num / i) + } + } + return set + } +}; From 9878d9f520f2c8d048892597daa21cc7e35acafc Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 19 Aug 2022 14:35:08 +0800 Subject: [PATCH 0914/2039] Create 2367-count-number-of-bad-pairs.js --- 2367-count-number-of-bad-pairs.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2367-count-number-of-bad-pairs.js diff --git a/2367-count-number-of-bad-pairs.js b/2367-count-number-of-bad-pairs.js new file mode 100644 index 00000000..f7c8997d --- /dev/null +++ b/2367-count-number-of-bad-pairs.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countBadPairs = function (nums) { + let cnt = 0 + const n = nums.length + const mp = {} + for (let i = 0; i < n; i++) { + const prev = mp[i - nums[i]] || 0 + cnt += prev + mp[i - nums[i]] = prev + 1 + } + return (n * (n - 1)) / 2 - cnt +} From f66ef849fd0d1c7777890bda3d582c39c036ae27 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 18:37:09 +0800 Subject: [PATCH 0915/2039] Update 902-numbers-at-most-n-given-digit-set.js --- 902-numbers-at-most-n-given-digit-set.js | 37 ++++++++++++++---------- 1 file changed, 21 insertions(+), 16 deletions(-) diff --git a/902-numbers-at-most-n-given-digit-set.js b/902-numbers-at-most-n-given-digit-set.js index 82d157dd..c45b9fef 100644 --- a/902-numbers-at-most-n-given-digit-set.js +++ b/902-numbers-at-most-n-given-digit-set.js @@ -1,21 +1,26 @@ /** - * @param {string[]} D - * @param {number} N + * @param {string[]} digits + * @param {number} n * @return {number} */ -const atMostNGivenDigitSet = function (D, N) { - const NS = '' + N - const digit = NS.length, - dsize = D.length - let rtn = 0 - for (let i = 1; i < digit; ++i) rtn += Math.pow(dsize, i) - for (let i = 0; i < digit; ++i) { - let hasSameNum = false - for (let d of D) { - if (d < NS[i]) rtn += Math.pow(dsize, digit - i - 1) - else if (d == NS[i]) hasSameNum = true +const atMostNGivenDigitSet = function(digits, n) { + const str = '' + n, { pow } = Math + const len = str.length, dsize = digits.length + let res = 0 + + for(let i = 1; i < len; i++) { + res += pow(dsize, i) + } + + for(let i = 0; i < len; i++) { + let sameNum = false + for(const d of digits) { + if(+d < +str[i]) { + res += pow(dsize, len - i - 1) + } else if(+d === +str[i]) sameNum = true } - if (!hasSameNum) return rtn + if(sameNum === false) return res } - return rtn + 1 -} + + return res + 1 +}; From 5d5349bb338f0f5e4874aa674b81b1832d13ed42 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:02:19 +0800 Subject: [PATCH 0916/2039] Create 1265-print-immutable-linked-list-in-reverse.js --- ...-print-immutable-linked-list-in-reverse.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 1265-print-immutable-linked-list-in-reverse.js diff --git a/1265-print-immutable-linked-list-in-reverse.js b/1265-print-immutable-linked-list-in-reverse.js new file mode 100644 index 00000000..66a405a0 --- /dev/null +++ b/1265-print-immutable-linked-list-in-reverse.js @@ -0,0 +1,31 @@ +/** + * // This is the ImmutableListNode's API interface. + * // You should not implement it, or speculate about its implementation. + * function ImmutableListNode() { + * @ return {void} + * this.printValue = function() { // print the value of this node. + * ... + * }; + * + * @return {ImmutableListNode} + * this.getNext = function() { // return the next node. + * ... + * }; + * }; + */ + +/** + * @param {ImmutableListNode} head + * @return {void} + */ +var printLinkedListInReverse = function(head) { + dfs(head) + function dfs(node) { + if(node.getNext() == null) { + node.printValue() + return + } + dfs(node.getNext()) + node.printValue() + } +}; From 9c1ab07713942c5c111be77dfb93a043c822f5b9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:06:29 +0800 Subject: [PATCH 0917/2039] Create 2084-drop-type-1-orders-for-customers-with-type-0-orders.sql --- ...-drop-type-1-orders-for-customers-with-type-0-orders.sql | 6 ++++++ 1 file changed, 6 insertions(+) create mode 100644 2084-drop-type-1-orders-for-customers-with-type-0-orders.sql diff --git a/2084-drop-type-1-orders-for-customers-with-type-0-orders.sql b/2084-drop-type-1-orders-for-customers-with-type-0-orders.sql new file mode 100644 index 00000000..113dc39f --- /dev/null +++ b/2084-drop-type-1-orders-for-customers-with-type-0-orders.sql @@ -0,0 +1,6 @@ +# Write your MySQL query statement below +SELECT * FROM Orders +WHERE (customer_id, order_type) +IN (SELECT customer_id, MIN(order_type) + FROM Orders + GROUP BY customer_id); From d0f5dc58c91edd082e8c466ecd7a33ff06ed8e84 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:17:20 +0800 Subject: [PATCH 0918/2039] Create 1445-apples-oranges.sql --- 1445-apples-oranges.sql | 4 ++++ 1 file changed, 4 insertions(+) create mode 100644 1445-apples-oranges.sql diff --git a/1445-apples-oranges.sql b/1445-apples-oranges.sql new file mode 100644 index 00000000..e921ad4e --- /dev/null +++ b/1445-apples-oranges.sql @@ -0,0 +1,4 @@ +# Write your MySQL query statement below +select sale_date, sum(case when fruit='apples' then sold_num else -sold_num end) as diff +from sales +group by sale_date; From 14ca1aad306df02c79b9e5791b645381e8d64fb9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:21:42 +0800 Subject: [PATCH 0919/2039] Create 1393-capital-gainloss.sql --- 1393-capital-gainloss.sql | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 1393-capital-gainloss.sql diff --git a/1393-capital-gainloss.sql b/1393-capital-gainloss.sql new file mode 100644 index 00000000..9f81342f --- /dev/null +++ b/1393-capital-gainloss.sql @@ -0,0 +1,9 @@ +# Write your MySQL query statement below +SELECT stock_name, SUM( + CASE + WHEN operation = 'Buy' THEN -price + ELSE price + END +) AS capital_gain_loss +FROM Stocks +GROUP BY stock_name From e8f53bafd3996bd720bff5b49db5d0371816475d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:37:17 +0800 Subject: [PATCH 0920/2039] Create 1874-minimize-product-sum-of-two-arrays.js --- 1874-minimize-product-sum-of-two-arrays.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1874-minimize-product-sum-of-two-arrays.js diff --git a/1874-minimize-product-sum-of-two-arrays.js b/1874-minimize-product-sum-of-two-arrays.js new file mode 100644 index 00000000..556095cb --- /dev/null +++ b/1874-minimize-product-sum-of-two-arrays.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const minProductSum = function(nums1, nums2) { + nums1.sort((a, b) => a - b) + nums2.sort((a, b) => b - a) + + const n = nums1.length + let res = 0 + for(let i = 0; i < n; i++) { + res += nums1[i] * nums2[i] + } + + return res +}; From 266aa5bdc728ad0f4b99bbdb7d0bcaa7e73f6257 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:43:23 +0800 Subject: [PATCH 0921/2039] Create 2372-calculate-the-influence-of-each-salesperson.sql --- 2372-calculate-the-influence-of-each-salesperson.sql | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 2372-calculate-the-influence-of-each-salesperson.sql diff --git a/2372-calculate-the-influence-of-each-salesperson.sql b/2372-calculate-the-influence-of-each-salesperson.sql new file mode 100644 index 00000000..5ff847f0 --- /dev/null +++ b/2372-calculate-the-influence-of-each-salesperson.sql @@ -0,0 +1,9 @@ +# Write your MySQL query statement below +SELECT + sp.salesperson_id, + name, + SUM(IF(price IS NULL, 0, price)) AS total +FROM Salesperson sp +LEFT JOIN Customer c ON sp.salesperson_id = c.salesperson_id +LEFT JOIN Sales s ON c.customer_id = s.customer_id +GROUP BY sp.salesperson_id, name From 7a1a18852af0ea95889900481b978cc83647ca58 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:51:36 +0800 Subject: [PATCH 0922/2039] Create 1783-grand-slam-titles.sql --- 1783-grand-slam-titles.sql | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 1783-grand-slam-titles.sql diff --git a/1783-grand-slam-titles.sql b/1783-grand-slam-titles.sql new file mode 100644 index 00000000..5107ee09 --- /dev/null +++ b/1783-grand-slam-titles.sql @@ -0,0 +1,8 @@ +# Write your MySQL query statement below +SELECT player_id,player_name, +SUM(player_id=Wimbledon)+SUM(player_id=Fr_open)+SUM(player_id=US_open)+SUM(player_id=Au_open) +as grand_slams_count +FROM Players +JOIN Championships +ON player_id=Wimbledon or player_id=Fr_open or player_id=US_open or player_id=Au_open +GROUP BY player_id; From c79250e9c673a921f6065c0cc0901d04efd5bf7a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 22:57:24 +0800 Subject: [PATCH 0923/2039] Create 2298-tasks-count-in-the-weekend.sql --- 2298-tasks-count-in-the-weekend.sql | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 2298-tasks-count-in-the-weekend.sql diff --git a/2298-tasks-count-in-the-weekend.sql b/2298-tasks-count-in-the-weekend.sql new file mode 100644 index 00000000..9ad50b93 --- /dev/null +++ b/2298-tasks-count-in-the-weekend.sql @@ -0,0 +1,5 @@ +# Write your MySQL query statement below +# Write your MySQL query statement below +SELECT SUM(WEEKDAY(submit_date)>=5) AS weekend_cnt, +SUM(WEEKDAY(submit_date)<5) AS working_cnt +FROM Tasks; From 049503bb22bd1bb73a0811e8a11de1db169ea480 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Aug 2022 23:31:33 +0800 Subject: [PATCH 0924/2039] Create 1828-queries-on-number-of-points-inside-a-circle.js --- ...ies-on-number-of-points-inside-a-circle.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1828-queries-on-number-of-points-inside-a-circle.js diff --git a/1828-queries-on-number-of-points-inside-a-circle.js b/1828-queries-on-number-of-points-inside-a-circle.js new file mode 100644 index 00000000..f4a8176d --- /dev/null +++ b/1828-queries-on-number-of-points-inside-a-circle.js @@ -0,0 +1,26 @@ +/** + * @param {number[][]} points + * @param {number[][]} queries + * @return {number[]} + */ +var countPoints = function(points, queries) { + const res = [] + + for(const [x, y, r] of queries) { + const square = r ** 2 + const center = [x, y] + let cnt = 0 + for(const d of points) { + if(disSquare(d, center) <= square) { + cnt++ + } + } + res.push(cnt) + } + + return res + + function disSquare(a, b) { + return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2 + } +}; From 1818c57bffea10e4bdba358e4e195f95ba3201ce Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 14:58:06 +0800 Subject: [PATCH 0925/2039] Create 2383-minimum-hours-of-training-to-win-a-competition.js --- ...-hours-of-training-to-win-a-competition.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2383-minimum-hours-of-training-to-win-a-competition.js diff --git a/2383-minimum-hours-of-training-to-win-a-competition.js b/2383-minimum-hours-of-training-to-win-a-competition.js new file mode 100644 index 00000000..120f96bd --- /dev/null +++ b/2383-minimum-hours-of-training-to-win-a-competition.js @@ -0,0 +1,27 @@ +/** + * @param {number} initialEnergy + * @param {number} initialExperience + * @param {number[]} energy + * @param {number[]} experience + * @return {number} + */ +const minNumberOfHours = function(initialEnergy, initialExperience, energy, experience) { + let hours = 0 + + for(let i = 0; i < energy.length; i++) { + if (initialEnergy > energy[i]) { + initialEnergy -= energy[i] + } else { + hours += energy[i] - initialEnergy + 1 + initialEnergy = 1 + } + + if (initialExperience <= experience[i]) { + hours += experience[i] - initialExperience + 1 + initialExperience += experience[i] - initialExperience + 1 + } + + initialExperience += experience[i] + } + return hours +}; From b986450f8aa373ce6ab5ab7056edcd32e68db04e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 14:58:31 +0800 Subject: [PATCH 0926/2039] Create 2384-largest-palindromic-number.js --- 2384-largest-palindromic-number.js | 36 ++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2384-largest-palindromic-number.js diff --git a/2384-largest-palindromic-number.js b/2384-largest-palindromic-number.js new file mode 100644 index 00000000..fcf5da00 --- /dev/null +++ b/2384-largest-palindromic-number.js @@ -0,0 +1,36 @@ +/** + * @param {string} num + * @return {string} + */ +const largestPalindromic = function(num) { + let cnt = new Array(10).fill(0); + for (let i = 0; i < num.length; i++) { + let c = +num[i]; + cnt[c]++; + } + + let list = []; + for (let i = 9; i >= 0; i--) { + if (i == 0 && list.length == 0) { + break; + } + while (cnt[i] >= 2) { + list.push(i); + cnt[i] -= 2; + } + } + let sb = ''; + for (let n of list) { + sb += n; + } + for (let i = 9; i >= 0; i--) { + if (cnt[i] > 0) { + sb += i; + break; + } + } + for (let i = list.length - 1; i >= 0; i--) { + sb += list[i]; + } + return sb; +}; From 759ead30a30061717b829930033bdc27c2b83d5f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 14:58:52 +0800 Subject: [PATCH 0927/2039] Create 2385-amount-of-time-for-binary-tree-to-be-infected.js --- ...-of-time-for-binary-tree-to-be-infected.js | 58 +++++++++++++++++++ 1 file changed, 58 insertions(+) create mode 100644 2385-amount-of-time-for-binary-tree-to-be-infected.js diff --git a/2385-amount-of-time-for-binary-tree-to-be-infected.js b/2385-amount-of-time-for-binary-tree-to-be-infected.js new file mode 100644 index 00000000..0b8b48a1 --- /dev/null +++ b/2385-amount-of-time-for-binary-tree-to-be-infected.js @@ -0,0 +1,58 @@ +/** + * 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} start + * @return {number} + */ +var amountOfTime = function(root, start) { + const graph = new Map() + dfs(root) + + // console.log(graph) + const visited = new Set([start]) + let q = [start] + let res = 0 + while(q.length) { + const tmp = [] + const size = q.length + // console.log(q) + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const nxt of (graph.get(cur) || [])) { + if(visited.has(nxt)) continue + tmp.push(nxt) + visited.add(nxt) + } + } + + q = tmp + res++ + } + + return res - 1 + + function dfs(node) { + if(node == null) return + if(node.left) { + if(!graph.has(node.left.val)) graph.set(node.left.val, new Set()) + if(!graph.has(node.val)) graph.set(node.val, new Set()) + graph.get(node.val).add(node.left.val) + graph.get(node.left.val).add(node.val) + dfs(node.left) + } + if(node.right) { + if(!graph.has(node.right.val)) graph.set(node.right.val, new Set()) + if(!graph.has(node.val)) graph.set(node.val, new Set()) + graph.get(node.val).add(node.right.val) + graph.get(node.right.val).add(node.val) + dfs(node.right) + } + } +}; From b729bfb31b2d8d22e5247e9a100c0b3d571a9348 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 14:59:15 +0800 Subject: [PATCH 0928/2039] Create 2386-find-the-k-sum-of-an-array.js --- 2386-find-the-k-sum-of-an-array.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2386-find-the-k-sum-of-an-array.js diff --git a/2386-find-the-k-sum-of-an-array.js b/2386-find-the-k-sum-of-an-array.js new file mode 100644 index 00000000..5d7b62bd --- /dev/null +++ b/2386-find-the-k-sum-of-an-array.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var kSum = function(nums, k) { + let sum = 0, n = nums.length, pq = new MaxPriorityQueue({ compare: (x, y) => y[0] - x[0] }); + for (let i = 0; i < n; i++) { + if (nums[i] < 0) { + nums[i] *= -1; + } else { + sum += nums[i]; + } + } + if (k == 1) return sum; + nums.sort((x, y) => x - y); + pq.enqueue([sum - nums[0], 0]); + for (let i = 2; i < k; i++) { + let [x, idx] = pq.dequeue(); + if (idx + 1 < n) { + pq.enqueue([x + nums[idx] - nums[idx + 1], idx + 1]); + pq.enqueue([x - nums[idx + 1], idx + 1]); + } + } + return pq.front()[0]; +}; From 0182f5b40ac9f96fe2eb1093ad2d8177239c54cf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 20:17:51 +0800 Subject: [PATCH 0929/2039] Update 31-next-permutation.js --- 31-next-permutation.js | 43 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/31-next-permutation.js b/31-next-permutation.js index baf10d95..17797b5a 100644 --- a/31-next-permutation.js +++ b/31-next-permutation.js @@ -1,3 +1,46 @@ +/** + * @param {number[]} nums + * @return {void} Do not return anything, modify nums in-place instead. + */ +const nextPermutation = function(nums) { + const n = nums.length + let k + for(let i = n - 2; i >= 0; i--) { + if(nums[i] < nums[i + 1]) { + k = i + break + } + } + if(k == null) { + reverse(nums, 0, n - 1) + } else { + let end + for(let i = n - 1; i >= 0; i--) { + if(nums[i] > nums[k]) { + end = i + break + } + } + swap(nums, k, end) + reverse(nums, k + 1, n - 1) + } + + function reverse(arr, start, end) { + while(start < end) { + swap(arr, start, end) + start++ + end-- + } + } + + function swap(arr, i, j) { + ;[arr[i], arr[j]] = [arr[j], arr[i]]; + } +}; + +// another + + /** * @param {number[]} nums * @return {void} Do not return anything, modify nums in-place instead. From 5f1de8724769d79104767269a84a4fecedca13a0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 21:43:27 +0800 Subject: [PATCH 0930/2039] Create 1282-group-the-people-given-the-group-size-they-belong-to.js --- ...ple-given-the-group-size-they-belong-to.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 1282-group-the-people-given-the-group-size-they-belong-to.js diff --git a/1282-group-the-people-given-the-group-size-they-belong-to.js b/1282-group-the-people-given-the-group-size-they-belong-to.js new file mode 100644 index 00000000..0081f3fb --- /dev/null +++ b/1282-group-the-people-given-the-group-size-they-belong-to.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} groupSizes + * @return {number[][]} + */ +const groupThePeople = function(groupSizes) { + const hash = {} + const n = groupSizes.length + + for(let i = 0; i < n; i++) { + const size = groupSizes[i] + if(hash[size] == null) hash[size] = [] + hash[size].push(i) + } + + const keys = Object.keys(hash) + // console.log(hash) + const res = [] + for(let size of keys) { + size = +size + const arr = hash[size] + for(let i = 0; i < arr.length; i += size) { + res.push(arr.slice(i, i + size)) + } + } + + return res +}; From 76cd794d1cdc45d5990bf4329ef4f114e140d31d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Aug 2022 21:54:44 +0800 Subject: [PATCH 0931/2039] Create 1315-sum-of-nodes-with-even-valued-grandparent.js --- ...m-of-nodes-with-even-valued-grandparent.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1315-sum-of-nodes-with-even-valued-grandparent.js diff --git a/1315-sum-of-nodes-with-even-valued-grandparent.js b/1315-sum-of-nodes-with-even-valued-grandparent.js new file mode 100644 index 00000000..6c7de73f --- /dev/null +++ b/1315-sum-of-nodes-with-even-valued-grandparent.js @@ -0,0 +1,28 @@ +/** + * 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} + */ +const sumEvenGrandparent = function(root) { + let res = 0 + dfs(root, null, null) + return res + + + function dfs(node, parent, gp) { + if(node == null) return + if(parent && gp && gp.val % 2 === 0) { + res += node.val + } + dfs(node.left, node, parent) + dfs(node.right, node, parent) + } + +}; From 5b6b238e0086b4646eb2441eb637654f81350e2a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Aug 2022 12:11:50 +0800 Subject: [PATCH 0932/2039] Update 60-permutation-sequence.js --- 60-permutation-sequence.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/60-permutation-sequence.js b/60-permutation-sequence.js index 9711d3d2..e43e7b06 100644 --- a/60-permutation-sequence.js +++ b/60-permutation-sequence.js @@ -1,3 +1,31 @@ +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +const getPermutation = function(n, k) { + const factorial = Array(n + 1).fill(0) + factorial[0] = 1 + for(let i = 1, pre = 1; i <= n; i++) { + factorial[i] = pre * i + pre = factorial[i] + } + const nums = Array.from({length: n}, (_, i) => i + 1) + + let res = '' + k-- + for(let i = 1; i <= n; i++) { + const idx = ~~(k / factorial[n - i]) + res += nums[idx] + nums.splice(idx, 1) + k -= idx * factorial[n - i] + } + + return res +}; + +// another + /** * @param {number} n * @param {number} k From 815f2444913f904088cedbb1939ced2e252f8b9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Aug 2022 15:59:31 +0800 Subject: [PATCH 0933/2039] Update 60-permutation-sequence.js --- 60-permutation-sequence.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/60-permutation-sequence.js b/60-permutation-sequence.js index e43e7b06..f25ea1a4 100644 --- a/60-permutation-sequence.js +++ b/60-permutation-sequence.js @@ -1,3 +1,39 @@ +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +const getPermutation = function(n, k) { + const factorial = Array(n + 1).fill(0) + factorial[0] = 1 + for(let i = 1; i <= n; i++) { + factorial[i] = factorial[i - 1] * i + } + let res = '' + const visited = Array(n + 1).fill(0) + dfs(0) + return res + + function dfs(idx) { + if(idx === n) return + + const cnt = factorial[n - idx - 1] + for(let i = 1; i <= n; i++) { + if(visited[i]) continue + if(cnt < k) { + k -= cnt + continue + } + res += i + visited[i] = 1 + dfs(idx + 1) + return + } + } +}; + +// another + /** * @param {number} n * @param {number} k From 8302bdb110f95c782250a702326ee56f6a4a7e9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Aug 2022 20:22:45 +0800 Subject: [PATCH 0934/2039] Create 2161-partition-array-according-to-given-pivot.js --- 2161-partition-array-according-to-given-pivot.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2161-partition-array-according-to-given-pivot.js diff --git a/2161-partition-array-according-to-given-pivot.js b/2161-partition-array-according-to-given-pivot.js new file mode 100644 index 00000000..e3bf6995 --- /dev/null +++ b/2161-partition-array-according-to-given-pivot.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @param {number} pivot + * @return {number[]} + */ +var pivotArray = function(nums, pivot) { + const less = [], greater = [], mid = [] + for(const e of nums) { + if(e < pivot) less.push(e) + else if(e === pivot) mid.push(e) + else greater.push(e) + } + + return less.concat(mid, greater) +}; From 44f7b17abb313f8f71e1cd355c8ff0adfa38a074 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Aug 2022 20:37:37 +0800 Subject: [PATCH 0935/2039] Create 1409-queries-on-a-permutation-with-key.js --- 1409-queries-on-a-permutation-with-key.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 1409-queries-on-a-permutation-with-key.js diff --git a/1409-queries-on-a-permutation-with-key.js b/1409-queries-on-a-permutation-with-key.js new file mode 100644 index 00000000..c8edacfe --- /dev/null +++ b/1409-queries-on-a-permutation-with-key.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} queries + * @param {number} m + * @return {number[]} + */ +var processQueries = function(queries, m) { + const nums = Array.from({ length: m }, (_, i) => i + 1) + const res = [] + for(const q of queries) { + const idx = nums.indexOf(q) + nums.splice(idx, 1) + nums.unshift(q) + res.push(idx) + } + return res +}; From 7bd8125957f8fed85a0890a49830afeed60a7ddd Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Aug 2022 22:22:15 +0800 Subject: [PATCH 0936/2039] Create 1551-minimum-operations-to-make-array-equal.js --- ...-minimum-operations-to-make-array-equal.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1551-minimum-operations-to-make-array-equal.js diff --git a/1551-minimum-operations-to-make-array-equal.js b/1551-minimum-operations-to-make-array-equal.js new file mode 100644 index 00000000..d57d8369 --- /dev/null +++ b/1551-minimum-operations-to-make-array-equal.js @@ -0,0 +1,22 @@ +/** + * @param {number} n + * @return {number} + */ +var minOperations = function(n) { + let l = 1, r = 2 * (n - 1) + 1 + + // [1, 3] + // [1, 3, 5, 7] + + // [1] + // [1, 3, 5] + // [1, 3, 5, 7, 9] + const target = l + (r - l) / 2 + let res = 0 + const num = ~~((n + 1) / 2) + for(let i = 1; i <= num; i++) { + res += target - (2 * (i -1) + 1) + } + + return res +}; From 6fd38791b39c7802389389193d53d307258b74a3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 24 Aug 2022 16:17:13 +0800 Subject: [PATCH 0937/2039] Create 2277-closest-node-to-path-in-tree.js --- 2277-closest-node-to-path-in-tree.js | 48 ++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2277-closest-node-to-path-in-tree.js diff --git a/2277-closest-node-to-path-in-tree.js b/2277-closest-node-to-path-in-tree.js new file mode 100644 index 00000000..275e550d --- /dev/null +++ b/2277-closest-node-to-path-in-tree.js @@ -0,0 +1,48 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[][]} query + * @return {number[]} + */ +const closestNode = function (n, edges, query) { + const graph = {} + for (const [a, b] of edges) { + if (graph[a] == null) graph[a] = [] + if (graph[b] == null) graph[b] = [] + graph[a].push(b) + graph[b].push(a) + } + + const dis = Array.from({ length: n }, () => Array(n).fill(Infinity)) + for (let i = 0; i < n; i++) { + let que = [i] + dis[i][i] = 0 + while (que.length) { + const tmp = [] + for (const q of que) { + for (const nxt of graph[q] || []) { + if (dis[i][nxt] === Infinity) { + dis[i][nxt] = dis[i][q] + 1 + tmp.push(nxt) + } + } + } + que = tmp + } + } + + const arr = [] + + for (const [a, b, q] of query) { + let tmp = Infinity, res = -1 + for (let idx = 0; idx < n; idx++) { + const d= dis[idx][a] + dis[idx][b] + dis[idx][q] + if(d < tmp) { + tmp = d + res = idx + } + } + arr.push(res) + } + return arr +} From 3487c2f8478383ea20db3eb2bbb1436abb63189a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Aug 2022 12:39:35 +0800 Subject: [PATCH 0938/2039] Update 2322-minimum-score-after-removals-on-a-tree.js --- ...-minimum-score-after-removals-on-a-tree.js | 81 +++++++++++++++++++ 1 file changed, 81 insertions(+) diff --git a/2322-minimum-score-after-removals-on-a-tree.js b/2322-minimum-score-after-removals-on-a-tree.js index def6f468..fe2fc586 100644 --- a/2322-minimum-score-after-removals-on-a-tree.js +++ b/2322-minimum-score-after-removals-on-a-tree.js @@ -1,3 +1,84 @@ +/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +const minimumScore = function (nums, edges) { + const n = nums.length, m = edges.length + const graph = {} + const children = {} + const xor = nums.slice(0) + const degree = Array(n).fill(0) + + for(const [p, q] of edges) { + if(graph[p] == null) graph[p] = [] + if(graph[q] == null) graph[q] = [] + graph[p].push(q) + graph[q].push(p) + degree[p]++ + degree[q]++ + } + + let val = 0 + const seen = new Set() + const queue = [] + for(let i = 0; i < n; i++) { + val ^= nums[i] + if(degree[i] === 1) { + queue.push(i) + seen.add(i) + } + } + + while(queue.length) { + const cur = queue.shift() + for(const nxt of (graph[cur] || [])) { + if(!seen.has(nxt)) { + if(children[nxt] == null) children[nxt] = new Set() + children[nxt].add(cur) + for(const e of (children[cur] || [])) { + children[nxt].add(e) + } + xor[nxt] ^= xor[cur] + } + degree[nxt]-- + if(degree[nxt] === 1) { + seen.add(nxt) + queue.push(nxt) + } + } + } + + let res = Infinity + + for(let i = 0; i < m - 1; i++) { + for(let j = i + 1; j < m; j++) { + let [a, b] = edges[i] + // Let a, c be the lower break points + if(children[a]?.has(b)) { + ;[a, b] = [b, a] + } + let [c, d] = edges[j] + if(children[c]?.has(d)) { + ;[c, d] = [d, c] + } + let cur + if(children[a]?.has(c)) { + cur = [xor[c], xor[a] ^ xor[c], val ^ xor[a]] + } else if(children[c]?.has(a)) { + cur = [xor[a], xor[c] ^ xor[a], val ^ xor[c]] + } else { + cur = [xor[a], xor[c], val ^ xor[a] ^ xor[c]] + } + res = Math.min(res, Math.max(...cur) - Math.min(...cur)) + } + } + + return res +} + +// another + /** * @param {number[]} nums * @param {number[][]} edges From 9a60e06f459607cbd1f432b51d8391ad4015dccb Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Aug 2022 21:44:25 +0800 Subject: [PATCH 0939/2039] Create 1877-minimize-maximum-pair-sum-in-array.js --- 1877-minimize-maximum-pair-sum-in-array.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1877-minimize-maximum-pair-sum-in-array.js diff --git a/1877-minimize-maximum-pair-sum-in-array.js b/1877-minimize-maximum-pair-sum-in-array.js new file mode 100644 index 00000000..1c27a9d4 --- /dev/null +++ b/1877-minimize-maximum-pair-sum-in-array.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minPairSum = function(nums) { + nums.sort((a, b) => a - b) + let res = 0 + for(let i = 0, limit = nums.length / 2; i < limit; i++) { + res = Math.max(res, nums[i] + nums[nums.length - 1 - i]) + } + + return res +}; From 5bf9a19b3e94c961391fae00922aa07f0c48ba3c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Aug 2022 22:11:58 +0800 Subject: [PATCH 0940/2039] Create 1305-all-elements-in-two-binary-search-trees.js --- ...all-elements-in-two-binary-search-trees.js | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 1305-all-elements-in-two-binary-search-trees.js diff --git a/1305-all-elements-in-two-binary-search-trees.js b/1305-all-elements-in-two-binary-search-trees.js new file mode 100644 index 00000000..df715040 --- /dev/null +++ b/1305-all-elements-in-two-binary-search-trees.js @@ -0,0 +1,60 @@ +/** + * 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} root1 + * @param {TreeNode} root2 + * @return {number[]} + */ +var getAllElements = function(root1, root2) { + const set1 = new Set(), set2 = new Set() + traverse(root1, set1) + traverse(root2, set2) + const res = [] + const it1 = set1[Symbol.iterator]() + const it2 = set2[Symbol.iterator]() + let { value: value1, done: done1 } = it1.next() + let { value: value2, done: done2 } = it2.next() + while(done1 === false && done2 === false) { + if(value1 < value2) { + res.push(value1) + const obj = it1.next() + value1 = obj.value + done1 = obj.done + }else { + res.push(value2) + const obj = it2.next() + value2 = obj.value + done2 = obj.done + } + } + + while(done1 === false) { + res.push(value1) + const obj = it1.next() + value1 = obj.value + done1 = obj.done + } + + while(done2 === false) { + res.push(value2) + const obj = it2.next() + value2 = obj.value + done2 = obj.done + } + + return res + + + function traverse(node, set) { + if(node == null) return + traverse(node.left, set) + set.add(node.val) + traverse(node.right, set) + } +}; From 8574aeef7a001a0010971394808604b617a22747 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Aug 2022 22:17:13 +0800 Subject: [PATCH 0941/2039] Update 1305-all-elements-in-two-binary-search-trees.js --- 1305-all-elements-in-two-binary-search-trees.js | 17 ++--------------- 1 file changed, 2 insertions(+), 15 deletions(-) diff --git a/1305-all-elements-in-two-binary-search-trees.js b/1305-all-elements-in-two-binary-search-trees.js index df715040..1c4d3929 100644 --- a/1305-all-elements-in-two-binary-search-trees.js +++ b/1305-all-elements-in-two-binary-search-trees.js @@ -20,8 +20,8 @@ var getAllElements = function(root1, root2) { const it2 = set2[Symbol.iterator]() let { value: value1, done: done1 } = it1.next() let { value: value2, done: done2 } = it2.next() - while(done1 === false && done2 === false) { - if(value1 < value2) { + while(done1 === false || done2 === false) { + if(done2 || value1 < value2) { res.push(value1) const obj = it1.next() value1 = obj.value @@ -34,19 +34,6 @@ var getAllElements = function(root1, root2) { } } - while(done1 === false) { - res.push(value1) - const obj = it1.next() - value1 = obj.value - done1 = obj.done - } - - while(done2 === false) { - res.push(value2) - const obj = it2.next() - value2 = obj.value - done2 = obj.done - } return res From 9ab9ab2242e779740656082e6d74473205536f32 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 27 Aug 2022 13:02:19 +0800 Subject: [PATCH 0942/2039] Create 2313-minimum-flips-in-binary-tree-to-get-result.js --- ...imum-flips-in-binary-tree-to-get-result.js | 63 +++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 2313-minimum-flips-in-binary-tree-to-get-result.js diff --git a/2313-minimum-flips-in-binary-tree-to-get-result.js b/2313-minimum-flips-in-binary-tree-to-get-result.js new file mode 100644 index 00000000..4354aee3 --- /dev/null +++ b/2313-minimum-flips-in-binary-tree-to-get-result.js @@ -0,0 +1,63 @@ +/** + * 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 {boolean} result + * @return {number} + */ +const minimumFlips = function (root, result) { + const [FALSE, TRUE, OR, AND, XOR, NOT] = [0, 1, 2, 3, 4, 5] + const costs = new Map() + + const getMin = (node, target) => { + if (node.val === FALSE || node.val === TRUE) + return Math.abs(target - node.val) + + const nodeCosts = costs.get(node) || [-1, -1] + if (nodeCosts[target] >= 0) return nodeCosts[target] + + if (node.val === NOT) { + nodeCosts[target] = getMin(node.left || node.right, 1 - target) + } else if (node.val === OR) { + nodeCosts[target] = + target === FALSE + ? getMin(node.left, 0) + getMin(node.right, 0) + : Math.min( + getMin(node.left, 0) + getMin(node.right, 1), + getMin(node.left, 1) + getMin(node.right, 0), + getMin(node.left, 1) + getMin(node.right, 1) + ) + } else if (node.val === AND) { + nodeCosts[target] = + target === TRUE + ? getMin(node.left, 1) + getMin(node.right, 1) + : Math.min( + getMin(node.left, 0) + getMin(node.right, 1), + getMin(node.left, 1) + getMin(node.right, 0), + getMin(node.left, 0) + getMin(node.right, 0) + ) + } else { + nodeCosts[target] = + target === FALSE + ? Math.min( + getMin(node.left, 0) + getMin(node.right, 0), + getMin(node.left, 1) + getMin(node.right, 1) + ) + : Math.min( + getMin(node.left, 0) + getMin(node.right, 1), + getMin(node.left, 1) + getMin(node.right, 0) + ) + } + + costs.set(node, nodeCosts) + return nodeCosts[target] + } + + return getMin(root, result ? 1 : 0) +} From fd5d1d74fc200d570431335afcee22ab120ded25 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 15:25:35 +0800 Subject: [PATCH 0943/2039] Create 2389-longest-subsequence-with-limited-sum.js --- 2389-longest-subsequence-with-limited-sum.js | 22 ++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2389-longest-subsequence-with-limited-sum.js diff --git a/2389-longest-subsequence-with-limited-sum.js b/2389-longest-subsequence-with-limited-sum.js new file mode 100644 index 00000000..def2fdd4 --- /dev/null +++ b/2389-longest-subsequence-with-limited-sum.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @param {number[]} queries + * @return {number[]} + */ +var answerQueries = function(nums, queries) { + const n = nums, m = queries.length + const arr = Array(n).fill(0) + nums.sort((a, b) => a - b) + + const res = [] + for(const e of queries) { + let sum = 0, i = 0 + while(sum <= e) { + sum += nums[i] + i++ + } + res.push(i===0? 0 :i - 1) + } + + return res +}; From f31510cb10cc31ffd2aed528ac554269b7008685 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 15:26:03 +0800 Subject: [PATCH 0944/2039] Create 2390-removing-stars-from-a-string.js --- 2390-removing-stars-from-a-string.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2390-removing-stars-from-a-string.js diff --git a/2390-removing-stars-from-a-string.js b/2390-removing-stars-from-a-string.js new file mode 100644 index 00000000..f79f8abf --- /dev/null +++ b/2390-removing-stars-from-a-string.js @@ -0,0 +1,14 @@ +/** + * @param {string} s + * @return {string} + */ +var removeStars = function(s) { + const stk = [] + for(const e of s) { + if(e !== '*') stk.push(e) + else { + stk.pop() + } + } + return stk.join('') +}; From 3d25df36fc97f8ed47172b2d4f37f1bff92eba5f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 15:26:30 +0800 Subject: [PATCH 0945/2039] Create 2391-minimum-amount-of-time-to-collect-garbage.js --- ...nimum-amount-of-time-to-collect-garbage.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2391-minimum-amount-of-time-to-collect-garbage.js diff --git a/2391-minimum-amount-of-time-to-collect-garbage.js b/2391-minimum-amount-of-time-to-collect-garbage.js new file mode 100644 index 00000000..153f1846 --- /dev/null +++ b/2391-minimum-amount-of-time-to-collect-garbage.js @@ -0,0 +1,35 @@ +/** + * @param {string[]} garbage + * @param {number[]} travel + * @return {number} + */ +const garbageCollection = function(garbage, travel) { + let res1 = 0, res2 = 0, res3 = 0 + const n = garbage.length + // P + res1 = helper('P') + res2 = helper('M') + res3 = helper('G') + return res1 + res2 + res3 + + function helper(target) { + const arr = [] + for(let i = 0; i < n; i++) { + const str = garbage[i] + for(const e of str) { + if(e === target) arr.push(e) + } + if(i + 1 < n) arr.push(travel[i]) + } + const idx = arr.indexOf(target) + const lastIdx =arr.lastIndexOf(target) + let tmp = 0 + // console.log(arr, idx, lastIdx) + for(let i = 0; i >= 0 && i<=lastIdx; i++) { + const e = arr[i] + if(e === target) tmp += 1 + else tmp += e + } + return tmp + } +}; From 473f1d0a18ef8d5665ad32f0e0f70b8e8c44d3c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 15:27:32 +0800 Subject: [PATCH 0946/2039] Create 2392-build-a-matrix-with-conditions.js --- 2392-build-a-matrix-with-conditions.js | 72 ++++++++++++++++++++++++++ 1 file changed, 72 insertions(+) create mode 100644 2392-build-a-matrix-with-conditions.js diff --git a/2392-build-a-matrix-with-conditions.js b/2392-build-a-matrix-with-conditions.js new file mode 100644 index 00000000..8245627d --- /dev/null +++ b/2392-build-a-matrix-with-conditions.js @@ -0,0 +1,72 @@ +/** + * @param {number} k + * @param {number[][]} rowConditions + * @param {number[][]} colConditions + * @return {number[][]} + */ +const initializeGraph = (n) => { + let g = [] + for (let i = 0; i < n; i++) { + g.push([]) + } + return g +} +const packDGInDegree = (g, edges, indegree) => { + for (const [u, v] of edges) { + g[u].unshift(v) + indegree[v]++ + } +} +const initialize2DArray = (n, m) => { + let d = [] + for (let i = 0; i < n; i++) { + let t = Array(m).fill(0) + d.push(t) + } + return d +} + +const buildMatrix = (k, rowConditions, colConditions) => { + let gr = make(k, rowConditions), + gc = make(k, colConditions), + d = initialize2DArray(k, 2), + res = initialize2DArray(k, k) + if (gr.length == 0 || gc.length == 0) return [] + for (let i = 0; i < k; i++) { + d[gr[i] - 1][0] = i + d[gc[i] - 1][1] = i + } + for (let i = 0; i < k; i++) { + let [x, y] = d[i] + res[x][y] = i + 1 + } + return res +} + +const make = (n, edges) => { + let g = initializeGraph(n + 1), + deg = Array(n + 1).fill(0) + packDGInDegree(g, edges, deg) + return topologicalSort_start_1(g, deg) +} + +const topologicalSort_start_1 = (g, indegree) => { + let res = [], + q = [], + n = g.length - 1 + for (let i = 1; i <= n; i++) { + if (indegree[i] == 0) q.push(i) + } + while (q.length) { + let cur = q.shift() + res.push(cur) + for (const child of g[cur]) { + indegree[child]-- + if (indegree[child] == 0) q.push(child) + } + } + for (let i = 1; i <= n; i++) { + if (indegree[i] > 0) return [] + } + return res +} From 095007b2730fe458edce2c621bc02a4ad2caa6e3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 16:39:43 +0800 Subject: [PATCH 0947/2039] Update 2392-build-a-matrix-with-conditions.js --- 2392-build-a-matrix-with-conditions.js | 56 ++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/2392-build-a-matrix-with-conditions.js b/2392-build-a-matrix-with-conditions.js index 8245627d..1379236c 100644 --- a/2392-build-a-matrix-with-conditions.js +++ b/2392-build-a-matrix-with-conditions.js @@ -1,3 +1,59 @@ +/** + * @param {number} k + * @param {number[][]} rowConditions + * @param {number[][]} colConditions + * @return {number[][]} + */ +var buildMatrix = function(k, rowConditions, colConditions) { + const res = Array.from({ length: k }, () => Array(k).fill(0)); + + const row = khansAlgo(rowConditions, k); + if(row.length!=k) return []; + + const col = khansAlgo(colConditions, k); + if(col.length!=k) return []; + + const idx = Array(k+1).fill(0); + for(let j=0;j Array()) + + for(let x of r){ + cnt[x[1]]++; + adj[x[0]].push(x[1]); + } + const row = []; + const q = []; + for(let i=1;i<=k;i++){ + if(cnt[i]==0){ + q.push(i); + } + } + while(q.length){ + let t = q.pop(); + + row.push(t); + for(let x of (adj[t] || [])) { + cnt[x]--; + if(cnt[x]==0){ + q.push(x); + } + } + } + return row; + } +}; + +// another + /** * @param {number} k * @param {number[][]} rowConditions From 6e6292d49bea701a96a5e4a3119810489f71af71 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 19:36:25 +0800 Subject: [PATCH 0948/2039] Update 1723-find-minimum-time-to-finish-all-jobs.js --- 1723-find-minimum-time-to-finish-all-jobs.js | 34 ++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/1723-find-minimum-time-to-finish-all-jobs.js b/1723-find-minimum-time-to-finish-all-jobs.js index e402f90d..8b5ff85e 100644 --- a/1723-find-minimum-time-to-finish-all-jobs.js +++ b/1723-find-minimum-time-to-finish-all-jobs.js @@ -1,3 +1,37 @@ +/** + * @param {number[]} jobs + * @param {number} k + * @return {number} + */ +const minimumTimeRequired = function(jobs, k) { + const workers = Array(k).fill(0) + let res = Infinity + const n = jobs.length + + dfs(0) + + return res + + function dfs(idx) { + if(idx === n) { + res = Math.min(res, Math.max(...workers)) + return + } + const visited = new Set() + const e = jobs[idx] + for(let i = 0; i < k; i++) { + if(visited.has(workers[i])) continue + if(workers[i] + e >= res) continue + visited.add(workers[i]) + workers[i] += e + dfs(idx + 1) + workers[i] -= e + } + } +}; + +// another + /** * @param {number[]} jobs * @param {number} k From 2e89930652016b7faa9e9131eef4928a6235c171 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Aug 2022 21:55:46 +0800 Subject: [PATCH 0949/2039] Update 2392-build-a-matrix-with-conditions.js --- 2392-build-a-matrix-with-conditions.js | 90 +++++++++++++------------- 1 file changed, 46 insertions(+), 44 deletions(-) diff --git a/2392-build-a-matrix-with-conditions.js b/2392-build-a-matrix-with-conditions.js index 1379236c..e1f8141e 100644 --- a/2392-build-a-matrix-with-conditions.js +++ b/2392-build-a-matrix-with-conditions.js @@ -4,53 +4,55 @@ * @param {number[][]} colConditions * @return {number[][]} */ -var buildMatrix = function(k, rowConditions, colConditions) { - const res = Array.from({ length: k }, () => Array(k).fill(0)); - - const row = khansAlgo(rowConditions, k); - if(row.length!=k) return []; - - const col = khansAlgo(colConditions, k); - if(col.length!=k) return []; - - const idx = Array(k+1).fill(0); - for(let j=0;j Array()) +var buildMatrix = function (k, rowConditions, colConditions) { + const res = Array.from({ length: k }, () => Array(k).fill(0)) - for(let x of r){ - cnt[x[1]]++; - adj[x[0]].push(x[1]); - } - const row = []; - const q = []; - for(let i=1;i<=k;i++){ - if(cnt[i]==0){ - q.push(i); - } - } - while(q.length){ - let t = q.pop(); - - row.push(t); - for(let x of (adj[t] || [])) { - cnt[x]--; - if(cnt[x]==0){ - q.push(x); - } - } + const row = khansAlgo(rowConditions, k) + if (row.length != k) return [] + + const col = khansAlgo(colConditions, k) + if (col.length != k) return [] + + // console.log(row, col) + const idx = Array(k + 1).fill(0) + for (let j = 0; j < col.length; j++) { + idx[col[j]] = j + } + for (let i = 0; i < k; i++) { + res[i][idx[row[i]]] = row[i] + } + return res + + function khansAlgo(r, k) { + const indegree = Array(k + 1).fill(0) + const adj = Array.from({ length: k + 1 }, () => Array()) + + for (let x of r) { + indegree[x[1]]++ + adj[x[0]].push(x[1]) + } + const row = [] + const q = [] + for (let i = 1; i <= k; i++) { + if (indegree[i] == 0) { + q.push(i) + } + } + while (q.length) { + let t = q.pop() + + row.push(t) + for (let x of adj[t] || []) { + indegree[x]-- + if (indegree[x] == 0) { + q.push(x) } - return row; + } } -}; + return row + } +} + // another From b1884a8989af43a909d501f86614d67e81ad6ae4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Aug 2022 18:21:38 +0800 Subject: [PATCH 0950/2039] Create 2305-fair-distribution-of-cookies.js --- 2305-fair-distribution-of-cookies.js | 32 ++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2305-fair-distribution-of-cookies.js diff --git a/2305-fair-distribution-of-cookies.js b/2305-fair-distribution-of-cookies.js new file mode 100644 index 00000000..8f7f8936 --- /dev/null +++ b/2305-fair-distribution-of-cookies.js @@ -0,0 +1,32 @@ +/** + * @param {number[]} cookies + * @param {number} k + * @return {number} + */ +const distributeCookies = function(cookies, k) { + const n = cookies.length + let res = Infinity + const arr = Array(n).fill(0) + + bt(0) + return res + + function bt(idx) { + if(idx === n) { + res = Math.min(res, Math.max(...arr)) + return + } + const cur = cookies[idx] + // const visited = new Set() + for(let i = 0; i < k; i++) { + const e = arr[i] + // if(visited.has(i)) continue + if(cur + e >= res) continue + + arr[i] += cur + bt(idx + 1) + arr[i] -= cur + if(arr[i] === 0) break + } + } +}; From 6013cbb61d27d742dc508fee9ecce5645e6dfb99 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Aug 2022 18:23:36 +0800 Subject: [PATCH 0951/2039] Update 2305-fair-distribution-of-cookies.js --- 2305-fair-distribution-of-cookies.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/2305-fair-distribution-of-cookies.js b/2305-fair-distribution-of-cookies.js index 8f7f8936..38eae083 100644 --- a/2305-fair-distribution-of-cookies.js +++ b/2305-fair-distribution-of-cookies.js @@ -17,12 +17,12 @@ const distributeCookies = function(cookies, k) { return } const cur = cookies[idx] - // const visited = new Set() + const visited = new Set() for(let i = 0; i < k; i++) { const e = arr[i] - // if(visited.has(i)) continue + if(visited.has(arr[i])) continue if(cur + e >= res) continue - + visited.add(arr[i]) arr[i] += cur bt(idx + 1) arr[i] -= cur From f49b6434f8bde51d6d02e3401c0856e4dc641559 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Aug 2022 18:25:32 +0800 Subject: [PATCH 0952/2039] Update 1723-find-minimum-time-to-finish-all-jobs.js --- 1723-find-minimum-time-to-finish-all-jobs.js | 1 + 1 file changed, 1 insertion(+) diff --git a/1723-find-minimum-time-to-finish-all-jobs.js b/1723-find-minimum-time-to-finish-all-jobs.js index 8b5ff85e..40f5824e 100644 --- a/1723-find-minimum-time-to-finish-all-jobs.js +++ b/1723-find-minimum-time-to-finish-all-jobs.js @@ -26,6 +26,7 @@ const minimumTimeRequired = function(jobs, k) { workers[i] += e dfs(idx + 1) workers[i] -= e + if(workers[i] === 0) break } } }; From 4f2102e858a28f8229f9591f8c96eaf7da6c97ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Aug 2022 21:20:48 +0800 Subject: [PATCH 0953/2039] Create 2317-maximum-xor-after-operations.js --- 2317-maximum-xor-after-operations.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 2317-maximum-xor-after-operations.js diff --git a/2317-maximum-xor-after-operations.js b/2317-maximum-xor-after-operations.js new file mode 100644 index 00000000..44a60632 --- /dev/null +++ b/2317-maximum-xor-after-operations.js @@ -0,0 +1,10 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maximumXOR = function(nums) { + let res = 0 + for(const e of nums) res |= e + + return res +}; From d0b28c20211bafc7c547fe6e812edde8fab5128c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Aug 2022 21:33:42 +0800 Subject: [PATCH 0954/2039] Create 1557-minimum-number-of-vertices-to-reach-all-nodes.js --- ...um-number-of-vertices-to-reach-all-nodes.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1557-minimum-number-of-vertices-to-reach-all-nodes.js diff --git a/1557-minimum-number-of-vertices-to-reach-all-nodes.js b/1557-minimum-number-of-vertices-to-reach-all-nodes.js new file mode 100644 index 00000000..89430b28 --- /dev/null +++ b/1557-minimum-number-of-vertices-to-reach-all-nodes.js @@ -0,0 +1,18 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +var findSmallestSetOfVertices = function(n, edges) { + const indegree = Array(n).fill(0) + for(const [from, to] of edges) { + indegree[to]++ + } + let res = [] + for(let i = 0; i Date: Tue, 30 Aug 2022 17:00:57 +0800 Subject: [PATCH 0955/2039] Update 329-longest-increasing-path-in-a-matrix.js --- 329-longest-increasing-path-in-a-matrix.js | 38 ++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/329-longest-increasing-path-in-a-matrix.js b/329-longest-increasing-path-in-a-matrix.js index c71b8477..6cce9611 100644 --- a/329-longest-increasing-path-in-a-matrix.js +++ b/329-longest-increasing-path-in-a-matrix.js @@ -1,3 +1,41 @@ +/** + * @param {number[][]} matrix + * @return {number} + */ +const longestIncreasingPath = function(matrix) { + const m = matrix.length, n = matrix[0].length + let res = 1 + + const dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]] + const memo = Array.from({ length: m }, () => Array(n).fill(0)) + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + const len = dfs(i, j) + res = Math.max(res, len) + } + } + + return res + + function dfs(i, j) { + const v = matrix[i][j] + if(memo[i][j] !== 0) return memo[i][j] + let len = 1 + for(const [dx, dy] of dirs) { + const nx = i + dx, ny = j + dy + if(nx >= 0 && nx < m && ny >= 0 && ny < n && matrix[nx][ny] > v) { + const tmp = 1 + dfs(nx, ny) + len = Math.max(len, tmp) + } + } + + memo[i][j] = len + return len + } +}; + +// another + /** * @param {number[][]} matrix * @return {number} From 929978ce83340391a546f402d89068a68541e0d7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 Aug 2022 21:09:03 +0800 Subject: [PATCH 0956/2039] Create 1829-maximum-xor-for-each-query.js --- 1829-maximum-xor-for-each-query.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1829-maximum-xor-for-each-query.js diff --git a/1829-maximum-xor-for-each-query.js b/1829-maximum-xor-for-each-query.js new file mode 100644 index 00000000..18bb6c49 --- /dev/null +++ b/1829-maximum-xor-for-each-query.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @param {number} maximumBit + * @return {number[]} + */ +const getMaximumXor = function(nums, maximumBit) { + const n = nums.length + let xor = nums.reduce((ac, e) => ac ^ e, 0) + let limit = 2 ** maximumBit - 1 + const res = [] + for(let i = n - 1; i >= 0; i--) { + const tmp = limit ^ xor + res.push(tmp) + xor ^= nums[i] + } + + return res +}; From 729aa713eaf8b3a5665915e371c0cfe59b1abd8b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 Aug 2022 21:19:01 +0800 Subject: [PATCH 0957/2039] Create 2221-find-triangular-sum-of-an-array.js --- 2221-find-triangular-sum-of-an-array.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2221-find-triangular-sum-of-an-array.js diff --git a/2221-find-triangular-sum-of-an-array.js b/2221-find-triangular-sum-of-an-array.js new file mode 100644 index 00000000..561102a5 --- /dev/null +++ b/2221-find-triangular-sum-of-an-array.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const triangularSum = function(nums) { + while(nums.length > 1) { + const arr = [] + for(let i = 0, n = nums.length; i < n - 1; i++) { + arr.push((nums[i] + nums[i + 1]) % 10) + } + nums = arr + } + return nums[0] +}; From f51019b65210e2f376851dab5c09450f81ca79a2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 Aug 2022 21:50:40 +0800 Subject: [PATCH 0958/2039] Create 1261-find-elements-in-a-contaminated-binary-tree.js --- ...-elements-in-a-contaminated-binary-tree.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 1261-find-elements-in-a-contaminated-binary-tree.js diff --git a/1261-find-elements-in-a-contaminated-binary-tree.js b/1261-find-elements-in-a-contaminated-binary-tree.js new file mode 100644 index 00000000..a6b4d4ad --- /dev/null +++ b/1261-find-elements-in-a-contaminated-binary-tree.js @@ -0,0 +1,49 @@ +/** + * 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 + */ +const FindElements = function(root) { + this.root = root + this.set = new Set() + if(root) this.set.add(0) + + dfs(root, 0, this.set) + + // console.log(this.set) + function dfs(node, cur, set) { + if(node == null) return + + if(node.left) { + const child = cur * 2 + 1 + set.add(child) + dfs(node.left, child, set) + } + if(node.right) { + const child = cur * 2 + 2 + set.add(child) + dfs(node.right, child, set) + } + } +}; + +/** + * @param {number} target + * @return {boolean} + */ +FindElements.prototype.find = function(target) { + return this.set.has(target) +}; + + +/** + * Your FindElements object will be instantiated and called as such: + * var obj = new FindElements(root) + * var param_1 = obj.find(target) + */ From c2b5e4a367f24f29b718f35cb3179279590626f6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 31 Aug 2022 21:09:58 +0800 Subject: [PATCH 0959/2039] Update 2328-number-of-increasing-paths-in-a-grid.js --- 2328-number-of-increasing-paths-in-a-grid.js | 35 ++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/2328-number-of-increasing-paths-in-a-grid.js b/2328-number-of-increasing-paths-in-a-grid.js index 54212bc0..e6b76dd6 100644 --- a/2328-number-of-increasing-paths-in-a-grid.js +++ b/2328-number-of-increasing-paths-in-a-grid.js @@ -1,3 +1,38 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const countPaths = function (grid) { + const mod = 1e9 + 7 + const m = grid.length, n = grid[0].length + let res = 0 + const dirs = [[1,0], [-1,0], [0, 1], [0, -1]] + const memo = Array.from({ length: m }, () => Array(n).fill(0)) + for(let i = 0; i = 0 && nx < m && ny >= 0 && ny < n && grid[nx][ny] > grid[i][j]) { + res = (res + dfs(nx, ny)) % mod + } + } + + memo[i][j] = res + + return res + } +} + +// another + /** * @param {number[][]} grid * @return {number} From bbc37b184d691cfcd2fe39649edbb132c78c5d96 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Sep 2022 11:31:55 +0800 Subject: [PATCH 0960/2039] Update 232-implement-queue-using-stacks.js --- 232-implement-queue-using-stacks.js | 30 ++++++++++++++--------------- 1 file changed, 15 insertions(+), 15 deletions(-) diff --git a/232-implement-queue-using-stacks.js b/232-implement-queue-using-stacks.js index cd50590d..5477a853 100644 --- a/232-implement-queue-using-stacks.js +++ b/232-implement-queue-using-stacks.js @@ -1,46 +1,46 @@ -/** - * Initialize your data structure here. - */ -const MyQueue = function() { - this.queue = [] + +var MyQueue = function() { + this.input = [] + this.output = [] }; -/** - * Push element x to the back of queue. +/** * @param {number} x * @return {void} */ MyQueue.prototype.push = function(x) { - this.queue.push(x) + this.input.push(x) }; /** - * Removes the element from in front of queue and returns that element. * @return {number} */ MyQueue.prototype.pop = function() { - return this.queue.shift() + if(this.output.length === 0) { + while(this.input.length) { + this.output.push(this.input.pop()) + } + } + return this.output.pop() }; /** - * Get the front element. * @return {number} */ MyQueue.prototype.peek = function() { - return this.queue[0] + return this.output[this.output.length - 1] || this.input[0] }; /** - * Returns whether the queue is empty. * @return {boolean} */ MyQueue.prototype.empty = function() { - return this.queue.length === 0 + return this.input.length === 0 && this.output.length === 0 }; /** * Your MyQueue object will be instantiated and called as such: - * var obj = Object.create(MyQueue).createNew() + * var obj = new MyQueue() * obj.push(x) * var param_2 = obj.pop() * var param_3 = obj.peek() From 346632cec07dfb2235d65b8d918574255d477215 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Sep 2022 15:52:01 +0800 Subject: [PATCH 0961/2039] Update 351-android-unlock-patterns.js --- 351-android-unlock-patterns.js | 40 ++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/351-android-unlock-patterns.js b/351-android-unlock-patterns.js index 749c4cf6..e8fc35eb 100644 --- a/351-android-unlock-patterns.js +++ b/351-android-unlock-patterns.js @@ -38,3 +38,43 @@ function DFS(vis, skip, cur, remain) { vis[cur] = false return rst } + +// another + +/** + * @param {number} m + * @param {number} n + * @return {number} + */ +const numberOfPatterns = function (m, n) { + const skip = Array.from({ length: 10 }, () => Array(10).fill(0)) + let res = 0 + skip[1][3] = skip[3][1] = 2 + skip[1][7] = skip[7][1] = 4 + skip[9][7] = skip[7][9] = 8 + skip[9][3] = skip[3][9] = 6 + skip[1][9] = skip[9][1] = skip[2][8] = skip[8][2] = skip[3][7] = skip[7][3] = skip[4][6] = skip[6][4] = 5 + const visited = new Set() + for(let i = m ;i <= n; i++) { + res += dfs(1, i - 1) * 4 // 1, 3, 7, 9 + res += dfs(2, i - 1) * 4 // 2, 4, 6, 8 + res += dfs(5, i - 1) // 5 + } + + return res + + function dfs(cur, remain) { + if(remain === 0) return 1 + let res = 0 + visited.add(cur) + for(let i = 1; i <= 9; i++) { + if(!visited.has(i) && (skip[cur][i] === 0 || visited.has(skip[cur][i]))) { + res += dfs(i, remain - 1) + } + } + visited.delete(cur) + + return res + } +} + From 907481d8349ebee222a01d39be3b44d4753cb431 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Sep 2022 19:34:58 +0800 Subject: [PATCH 0962/2039] Create 861-score-after-flipping-matrix.js --- 861-score-after-flipping-matrix.js | 46 ++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 861-score-after-flipping-matrix.js diff --git a/861-score-after-flipping-matrix.js b/861-score-after-flipping-matrix.js new file mode 100644 index 00000000..ef82cbfa --- /dev/null +++ b/861-score-after-flipping-matrix.js @@ -0,0 +1,46 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const matrixScore = function(grid) { + const m = grid.length, n = grid[0].length + for(let i = 0; i < m; i++) { + if(grid[i][0] === 0) flipRow(i) + } + + for(let i = 0; i < n; i++) { + if(cntCol(i, 0) > cntCol(i, 1)) flipCol(i) + } + + let res = 0 + // console.log(grid) + for(const row of grid) { + res += parseInt(row.join(''), 2) + } + + return res + + + function flipRow(idx) { + for(let i = 0; i < n; i++) { + if(grid[idx][i] === 0) grid[idx][i] = 1 + else grid[idx][i] = 0 + } + } + + function cntCol(idx, target) { + let res = 0 + for(let i = 0; i < m; i++) { + if(grid[i][idx] === target) res++ + } + // console.log(res) + return res + } + + function flipCol(idx) { + for(let i = 0; i < m; i++) { + if(grid[i][idx] === 0) grid[i][idx] = 1 + else grid[i][idx] = 0 + } + } +}; From 5e2f01145b33e4b9fce18b46704b8e3ab913237f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Sep 2022 22:40:32 +0800 Subject: [PATCH 0963/2039] Update 861-score-after-flipping-matrix.js --- 861-score-after-flipping-matrix.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/861-score-after-flipping-matrix.js b/861-score-after-flipping-matrix.js index ef82cbfa..4c57cb6c 100644 --- a/861-score-after-flipping-matrix.js +++ b/861-score-after-flipping-matrix.js @@ -1,3 +1,24 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const matrixScore = function(grid) { + const m = grid.length, n = grid[0].length + let res = 0 + res += m * (1 << (n - 1)) + for(let j = 1; j < n; j++) { + let same = 0 + for(let i = 0; i < m; i++) { + if(grid[i][0] === grid[i][j]) same++ + } + res += Math.max(same, m - same) * (1 << (n - 1 - j)) + } + + return res +}; + +// another + /** * @param {number[][]} grid * @return {number} From 834c26ed10a4448b9f1631310891cd975281e5fb Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Sep 2022 13:24:39 +0800 Subject: [PATCH 0964/2039] Update 942-di-string-match.js --- 942-di-string-match.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) diff --git a/942-di-string-match.js b/942-di-string-match.js index e8530c2f..8e35e923 100644 --- a/942-di-string-match.js +++ b/942-di-string-match.js @@ -19,3 +19,20 @@ const diStringMatch = function(S) { res.push(arr.pop()) return res }; + +// another + +/** + * @param {string} s + * @return {number[]} + */ +const diStringMatch = function(s) { + const n = s.length + let l = 0, r = n + const res = [] + for(let i = 0; i < n; i++) { + res.push(s[i] === 'I' ? l++ : r--) + } + res.push(r) + return res +}; From 673b725917c5c56017a0500d6696c45880c47987 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Sep 2022 13:34:32 +0800 Subject: [PATCH 0965/2039] Update 942-di-string-match.js --- 942-di-string-match.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/942-di-string-match.js b/942-di-string-match.js index 8e35e923..7fee2f08 100644 --- a/942-di-string-match.js +++ b/942-di-string-match.js @@ -22,6 +22,18 @@ const diStringMatch = function(S) { // another +/* + +it is greedy and one pass !! +so every time when we meet an I, we need to keep in mind that we may meet another I later, +so the safest way is use the smallest number available. same idea when we meet D, +so in order to keep us safe, we always take largest one available, until we traverse the whole string. +And since the available numbers are sorted(from 0 to S.length()), +so we can set two pointers one starts from the head(smallest number), +another from the ends(largest number), then we begin to fill the res array. + +*/ + /** * @param {string} s * @return {number[]} From 707e4a9c81fb065f5e2b9a089ba9b15b2e88876f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Sep 2022 17:33:42 +0800 Subject: [PATCH 0966/2039] Create 2399-check-distances-between-same-letters.js --- 2399-check-distances-between-same-letters.js | 21 ++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2399-check-distances-between-same-letters.js diff --git a/2399-check-distances-between-same-letters.js b/2399-check-distances-between-same-letters.js new file mode 100644 index 00000000..5c877a9b --- /dev/null +++ b/2399-check-distances-between-same-letters.js @@ -0,0 +1,21 @@ +/** + * @param {string} s + * @param {number[]} distance + * @return {boolean} + */ +var checkDistances = function(s, distance) { + const hash = {} + const a = 'a'.charCodeAt(0) + const n = s.length + for(let i = 0; i < n; i++) { + if(hash[s[i]] == null) hash[s[i]] = [] + hash[s[i]].push(i) + } + const keys = Object.keys(hash) + for(let i = 0; i < keys.length; i++) { + const k = keys[i] + const idx = k.charCodeAt(0) - a + if(hash[k][1] - hash[k][0] !== distance[idx] + 1) return false + } + return true +}; From 7529ce62926ee0ba63c7766cfac7686c68834622 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Sep 2022 17:36:59 +0800 Subject: [PATCH 0967/2039] Create 2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js --- ...-reach-a-position-after-exactly-k-steps.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js diff --git a/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js b/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js new file mode 100644 index 00000000..2a7481e2 --- /dev/null +++ b/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js @@ -0,0 +1,36 @@ +/** + * @param {number} startPos + * @param {number} endPos + * @param {number} k + * @return {number} + */ +var numberOfWays = function(startPos, endPos, k) { + const ll = BigInt, mod = ll(1e9 + 7), N = 1005; + + let fact, ifact, inv; + const comb_init = () => { + fact = Array(N).fill(0); + ifact = Array(N).fill(0); + inv = Array(N).fill(0); + fact[0] = ifact[0] = inv[1] = 1n; + for (let i = 2; i < N; i++) inv[i] = (mod - mod / ll(i)) * inv[mod % ll(i)] % mod; + for (let i = 1; i < N; i++) { + fact[i] = fact[i - 1] * ll(i) % mod; + ifact[i] = ifact[i - 1] * inv[i] % mod; + } + }; + + const comb = (n, k) => { + if (n < k || k < 0) return 0; + return fact[n] * ifact[k] % mod * ifact[n - k] % mod; + }; + + comb_init(); + let res = 0n; + for (let i = 0; i <= k; i++) { + let moveRight = i, moveLeft = k - i; + if (startPos + moveRight - moveLeft == endPos) res += comb(k, i); + } + return res; + +}; From 60a48708e2baf8427fecdfe197959fe2a2c01d29 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Sep 2022 17:38:23 +0800 Subject: [PATCH 0968/2039] Create 2401-longest-nice-subarray.js --- 2401-longest-nice-subarray.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2401-longest-nice-subarray.js diff --git a/2401-longest-nice-subarray.js b/2401-longest-nice-subarray.js new file mode 100644 index 00000000..0af71e12 --- /dev/null +++ b/2401-longest-nice-subarray.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var longestNiceSubarray = function(nums) { + let max = 1; + let stack = []; + for(let i =0;i Date: Sun, 4 Sep 2022 17:48:23 +0800 Subject: [PATCH 0969/2039] Create 2402-meeting-rooms-iii.js --- 2402-meeting-rooms-iii.js | 40 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2402-meeting-rooms-iii.js diff --git a/2402-meeting-rooms-iii.js b/2402-meeting-rooms-iii.js new file mode 100644 index 00000000..aa3ab2fc --- /dev/null +++ b/2402-meeting-rooms-iii.js @@ -0,0 +1,40 @@ +/** + * @param {number} n + * @param {number[][]} meetings + * @return {number} + */ +var mostBooked = function(n, meetings) { + const count = new Array(n).fill(0); + const freeTime = new Array(n).fill(0); + meetings.sort((a, b) => a[0] - b[0]); + for(let i = 0 ; i < meetings.length ; i++){ + let minRoom = -1; + let minTime = Number.MAX_SAFE_INTEGER; + for(let j = 0 ; j < n ; j++){ + if(freeTime[j] <= meetings[i][0]){ + count[j]++; + freeTime[j] = meetings[i][1]; + minRoom = -1; + break; + } + if(freeTime[j] < minTime){ + minTime = freeTime[j]; + minRoom = j; + } + } + if(minRoom !== -1){ + count[minRoom]++; + freeTime[minRoom] += meetings[i][1] - meetings[i][0]; + } + } + + let ans = 0; + let maxCount = count[0]; + for(let i = 1 ; i < n ; i++){ + if(count[i] > maxCount){ + ans = i; + maxCount = count[i]; + } + } + return ans; +}; From 921d2d5e583bfcd59e29b8698a5888e5018430fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Sep 2022 20:43:11 +0800 Subject: [PATCH 0970/2039] Update 484-find-permutation.js --- 484-find-permutation.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/484-find-permutation.js b/484-find-permutation.js index 024f433f..5ed6cda9 100644 --- a/484-find-permutation.js +++ b/484-find-permutation.js @@ -1,3 +1,25 @@ +/** + * @param {string} s + * @return {number[]} + */ +const findPermutation = function(s) { + const n = s.length + const res = Array(n + 1) + res[n] = n + 1 + for (let i = 0, len = n; i < len;) { + let j = i; + while (j < len && s.charAt(j) === 'D') { + j++; + } + for (let k = j - i; k >= 0; k--, j--) { + res[i++] = j + 1; + } + } + return res; +}; + +// another + /** * @param {string} s * @return {number[]} From e21aad22d73a06609bc3f71da782e494090b691d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Sep 2022 21:00:10 +0800 Subject: [PATCH 0971/2039] Update 484-find-permutation.js --- 484-find-permutation.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/484-find-permutation.js b/484-find-permutation.js index 5ed6cda9..18d3d441 100644 --- a/484-find-permutation.js +++ b/484-find-permutation.js @@ -18,6 +18,31 @@ const findPermutation = function(s) { return res; }; +// another + +/** + * @param {string} s + * @return {number[]} + */ +const findPermutation = function(s) { + const n = s.length + const res = Array(n) + res[n] = n + 1 + for(let i = 0; i < n;) { + let j = i + while(j < n && s[j] === 'D') j++ + // console.log(j) + for(let k = j - i + 1; k > 0; k--) { + res[i] = j + 1 + i++ + j-- + } + } + + return res +}; + + // another /** From a2d165155860cbee701cc9bee3916a2dfd03755b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 5 Sep 2022 21:50:15 +0800 Subject: [PATCH 0972/2039] Update 903-valid-permutations-for-di-sequence.js --- 903-valid-permutations-for-di-sequence.js | 41 +++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/903-valid-permutations-for-di-sequence.js b/903-valid-permutations-for-di-sequence.js index 8e5aaa60..13844712 100644 --- a/903-valid-permutations-for-di-sequence.js +++ b/903-valid-permutations-for-di-sequence.js @@ -1,3 +1,44 @@ +/** + * @param {string} s + * @return {number} + */ +const numPermsDISequence = function(s) { + const mod = 1e9 + 7 + const n = s.length + const dp = Array.from({ length: n + 1 }, () => Array(n + 1).fill(0)) + s = '#' + s + dp[0][0] = 1 + for(let i = 1; i <= n; i++) { + const ch = s[i] + for(let j = 0; j <= i; j++) { + if(ch === 'I') { + for(let k = 0; k < j; k++) { + dp[i][j] += dp[i - 1][k] + dp[i][j] %= mod + } + } else { + for(let k = j; k < i; k++) { + dp[i][j] += dp[i - 1][k] + dp[i][j] %= mod + } + } + } + } + + + let res = 0 + + for(let i = 0; i <= n; i++) { + res = (res + dp[n][i]) % mod + } + + return res +}; + + +// another + + /** * @param {string} s * @return {number} From 5119e34a00a5d562ba867985857b5cba03fa9e31 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Sep 2022 20:07:53 +0800 Subject: [PATCH 0973/2039] Update 239-sliding-window-maximum.js --- 239-sliding-window-maximum.js | 32 +++++++++++++++----------------- 1 file changed, 15 insertions(+), 17 deletions(-) diff --git a/239-sliding-window-maximum.js b/239-sliding-window-maximum.js index e34610a7..7f765ee7 100644 --- a/239-sliding-window-maximum.js +++ b/239-sliding-window-maximum.js @@ -4,24 +4,22 @@ * @return {number[]} */ const maxSlidingWindow = function(nums, k) { - let n = nums.length - if (n === 0) { - return nums - } - let result = [] - - let dq = [] - for (let i = 0; i < n; i++) { - if (dq.length && dq[0] < i - k + 1) { - dq.shift() + const n = nums.length + const stk = [] + const res = [] + + for(let i = 0; i < n; i++) { + while(stk.length && stk[0] < i - k + 1) { + stk.shift() } - while (dq.length && nums[i] >= nums[dq[dq.length - 1]]) { - dq.pop() + while(stk.length && nums[stk[stk.length - 1]] <= nums[i]) { + stk.pop() } - dq.push(i) - if (i - k + 1 >= 0) { - result[i - k + 1] = nums[dq[0]] + stk.push(i) + if(i >= k - 1) { + res.push(nums[stk[0]]) } } - return result -} + + return res +}; From cb5b1dbdd07f483b96446be6e0cd2ee6861fd0aa Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Sep 2022 20:09:45 +0800 Subject: [PATCH 0974/2039] Update 239-sliding-window-maximum.js --- 239-sliding-window-maximum.js | 67 +++++++++++++++++++++++++++++++++++ 1 file changed, 67 insertions(+) diff --git a/239-sliding-window-maximum.js b/239-sliding-window-maximum.js index 7f765ee7..3fdf50a4 100644 --- a/239-sliding-window-maximum.js +++ b/239-sliding-window-maximum.js @@ -23,3 +23,70 @@ const maxSlidingWindow = function(nums, k) { return res }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var maxSlidingWindow = function (nums, k) { + if (k === 0) return [] + const deque = new Deque() + for (let i = 0; i < k - 1; i++) { + while (!deque.isEmpty() && deque.last().val <= nums[i]) deque.pop() + deque.enqueue({ val: nums[i], idx: i }) + } + const result = [] + for (let i = k - 1; i < nums.length; i++) { + if (!deque.isEmpty() && deque.first().idx <= i - k) deque.dequeue() + while (!deque.isEmpty() && deque.last().val <= nums[i]) deque.pop() + deque.enqueue({ val: nums[i], idx: i }) + result.push(deque.first().val) + } + return result +} + +class Deque { + constructor() { + this.head = new Node() + this.tail = this.head + } + + isEmpty() { + return this.head.next === null + } + + first() { + return this.head.next.value + } + + last() { + return this.tail.value + } + + dequeue() { + this.head = this.head.next + this.head.prev = null + } + + enqueue(value) { + this.tail.next = new Node(value) + this.tail.next.prev = this.tail + this.tail = this.tail.next + } + + pop() { + this.tail = this.tail.prev + this.tail.next = null + } +} + +class Node { + constructor(value) { + this.value = value + this.next = null + this.prev = null + } +} From 9827f0394ddbeec07e31d723b45c3692ee069693 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Sep 2022 19:40:46 +0800 Subject: [PATCH 0975/2039] Update 1425-constrained-subsequence-sum.js --- 1425-constrained-subsequence-sum.js | 77 +++++++++++++++++++++++++++++ 1 file changed, 77 insertions(+) diff --git a/1425-constrained-subsequence-sum.js b/1425-constrained-subsequence-sum.js index 1fb3cb59..aad59bcf 100644 --- a/1425-constrained-subsequence-sum.js +++ b/1425-constrained-subsequence-sum.js @@ -20,3 +20,80 @@ const constrainedSubsetSum = function(nums, k) { } return max; }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const constrainedSubsetSum = function (nums, k) { + const dll = new DLL() + dll.push([0, nums[0]]) + let max = nums[0] + for (let i = 1; i < nums.length; i++) { + // console.log(dll, dll.peek()) + let [index, lastKsum] = dll.peek().val + + if (index == i - k) { + dll.shift() + } + const sum = Math.max(lastKsum, 0) + nums[i] + max = Math.max(max, sum) + while (!dll.isEmpty() && dll.peekLast().val[1] < sum) { + dll.pop() + } + dll.push([i, sum]) + } + return max +} + +class Node { + constructor(val) { + this.val = val + this.prev = null + this.next = null + } +} +class DLL { + constructor() { + this.head = new Node() + this.tail = null + } + peek() { + return this.head.next + } + peekLast() { + return this.tail + } + isEmpty() { + return this.head.next == null + } + shift() { + const h = this.head.next + if (h) { + this.head.next = h.next + if (h.next) { + h.next.prev = this.head + } else { + this.tail = null + } + } + } + pop() { + if (this.tail == null) return + const newTail = this.tail.prev + if (newTail) { + newTail.next = null + this.tail.prev = null + this.tail = newTail + } + } + push(val) { + const node = new Node(val) + node.prev = this.tail ?? this.head + node.prev.next = node + this.tail = node + } +} From dccdcd5d63ce947bfd412cfdb5412cb7fd4dd925 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Sep 2022 21:45:49 +0800 Subject: [PATCH 0976/2039] Update 1425-constrained-subsequence-sum.js --- 1425-constrained-subsequence-sum.js | 12 +++++++----- 1 file changed, 7 insertions(+), 5 deletions(-) diff --git a/1425-constrained-subsequence-sum.js b/1425-constrained-subsequence-sum.js index aad59bcf..81ac967e 100644 --- a/1425-constrained-subsequence-sum.js +++ b/1425-constrained-subsequence-sum.js @@ -33,13 +33,10 @@ const constrainedSubsetSum = function (nums, k) { dll.push([0, nums[0]]) let max = nums[0] for (let i = 1; i < nums.length; i++) { - // console.log(dll, dll.peek()) - let [index, lastKsum] = dll.peek().val - - if (index == i - k) { + if (!dll.isEmpty() && i - dll.peek().val[0] > k) { dll.shift() } - const sum = Math.max(lastKsum, 0) + nums[i] + const sum = Math.max(dll.peek().val[1], 0) + nums[i] max = Math.max(max, sum) while (!dll.isEmpty() && dll.peekLast().val[1] < sum) { dll.pop() @@ -60,6 +57,7 @@ class DLL { constructor() { this.head = new Node() this.tail = null + this.size = 0 } peek() { return this.head.next @@ -79,6 +77,7 @@ class DLL { } else { this.tail = null } + this.size-- } } pop() { @@ -88,12 +87,15 @@ class DLL { newTail.next = null this.tail.prev = null this.tail = newTail + this.size-- } + } push(val) { const node = new Node(val) node.prev = this.tail ?? this.head node.prev.next = node this.tail = node + this.size++ } } From db31e083629c986d86923e899cda604a613bdf67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 8 Sep 2022 10:41:26 +0800 Subject: [PATCH 0977/2039] Update 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js --- ...solute-diff-less-than-or-equal-to-limit.js | 75 +++++++++++++++++++ 1 file changed, 75 insertions(+) diff --git a/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js b/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js index 74c87355..ffc4ed5c 100644 --- a/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js +++ b/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js @@ -23,3 +23,78 @@ const longestSubarray = function(nums, limit) { } return j - i; }; + +// another + +/** + * @param {number[]} nums + * @param {number} limit + * @return {number} + */ +const longestSubarray = function (nums, limit) { + const maxDq = new Deque(), minDq = new Deque(), n = nums.length + let l = 0, r = 0 + let res = 0 + for(r = 0; r < n; r++) { + const cur = nums[r] + while(!maxDq.isEmpty() && maxDq.last() < cur) { + maxDq.pop() + } + maxDq.enqueue(cur) + while(!minDq.isEmpty() && minDq.last() > cur) { + minDq.pop() + } + minDq.enqueue(cur) + + while(maxDq.first() - minDq.first() > limit) { + if(nums[l] === maxDq.first()) maxDq.dequeue() + if(nums[l] === minDq.first()) minDq.dequeue() + l++ + } + res = Math.max(res, r - l + 1) + } + return res +} + +class Deque { + constructor() { + this.head = new Node() + this.tail = this.head + } + + isEmpty() { + return this.head.next === null + } + + first() { + return this.head.next.value + } + + last() { + return this.tail.value + } + + dequeue() { + this.head = this.head.next + this.head.prev = null + } + + enqueue(value) { + this.tail.next = new Node(value) + this.tail.next.prev = this.tail + this.tail = this.tail.next + } + + pop() { + this.tail = this.tail.prev + this.tail.next = null + } +} + +class Node { + constructor(value) { + this.value = value + this.next = null + this.prev = null + } +} From 44aaf6a65155c7eea07108d2951638b6e44acbce Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 8 Sep 2022 21:22:46 +0800 Subject: [PATCH 0978/2039] Create 1338-reduce-array-size-to-the-half.js --- 1338-reduce-array-size-to-the-half.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1338-reduce-array-size-to-the-half.js diff --git a/1338-reduce-array-size-to-the-half.js b/1338-reduce-array-size-to-the-half.js new file mode 100644 index 00000000..a9b504af --- /dev/null +++ b/1338-reduce-array-size-to-the-half.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} arr + * @return {number} + */ +var minSetSize = function(arr) { + const hash = {} + for(const e of arr) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const n = arr.length + const entries = Object.entries(hash) + entries.sort((a, b) => b[1] - a[1]) + let res= 0 + let cnt = 0 + for(const [k, v] of entries) { + cnt += v + res++ + if(cnt >= n / 2) break + } + + return res +}; From 71be2d935fe800d34fbf0ecc304e7d7302813482 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 10 Sep 2022 20:13:40 +0800 Subject: [PATCH 0979/2039] Create 1562-find-latest-group-of-size-m.js --- 1562-find-latest-group-of-size-m.js | 80 +++++++++++++++++++++++++++++ 1 file changed, 80 insertions(+) create mode 100644 1562-find-latest-group-of-size-m.js diff --git a/1562-find-latest-group-of-size-m.js b/1562-find-latest-group-of-size-m.js new file mode 100644 index 00000000..ca889669 --- /dev/null +++ b/1562-find-latest-group-of-size-m.js @@ -0,0 +1,80 @@ +/** + * @param {number[]} arr + * @param {number} m + * @return {number} + */ +const findLatestStep = function(arr, m) { + const uF = new UnionFind(arr); + const mRecords = new Set(); // This contains parents whose rank is m + const visited = new Set(); + let res = -1; + + for (let i = 0; i < arr.length; i++) { + let val = arr[i]; + visited.add(val); + + if (visited.has(val - 1)) { + let parent1 = uF.find(val); + let parent2 = uF.find(val - 1); + // Since merging, the rank for val - 1 & val has changed, + // they are no longer m. Hence removed them from set. + mRecords.delete(parent1); + mRecords.delete(parent2); + uF.union(val, val - 1); + } + + if (visited.has(val + 1)) { + let parent1 = uF.find(val); + let parent2 = uF.find(val + 1); + mRecords.delete(parent1); + mRecords.delete(parent2); + uF.union(val, val + 1); + } + + let parent = uF.find(val); + if (uF.ranks.get(parent) === m) mRecords.add(parent); + if (mRecords.size > 0) res = i + 1; + } + + return res; +}; + +class UnionFind { + constructor(arr) { + [this.parents, this.ranks] = this.initialise(arr); + } + + initialise(arr) { + const parents = new Map(); + const ranks = new Map(); + arr.forEach(val => { + parents.set(val, val); + ranks.set(val, 1); + }) + + return [parents, ranks]; + } + + find(val) { + if (this.parents.get(val) === val) return val; + this.parents.set(val, this.find(this.parents.get(val))); + return this.parents.get(val); + } + + union(m, n) { + const rootM = this.find(m); + const rootN = this.find(n); + + if (rootM === rootN) return; + if (rootM > rootN) { + this.updateParent(rootN, rootM); + } else { + this.updateParent(rootM, rootN); + } + } + + updateParent(child, parent) { + this.ranks.set(parent, this.ranks.get(parent) + this.ranks.get(child)); + this.parents.set(child, parent); + } +} From 7fb32164ffc4d124e9196faa194b737e02c5f01a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Sep 2022 16:29:39 +0800 Subject: [PATCH 0980/2039] Create 2404-most-frequent-even-element.js --- 2404-most-frequent-even-element.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2404-most-frequent-even-element.js diff --git a/2404-most-frequent-even-element.js b/2404-most-frequent-even-element.js new file mode 100644 index 00000000..608206cd --- /dev/null +++ b/2404-most-frequent-even-element.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var mostFrequentEven = function(nums) { + const hash = {} + for(const e of nums) { + if(e % 2 === 0) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + } + const entries = Object.entries(hash) + if(entries.length === 0) return -1 + entries.sort((a, b) => b[1] - a[1]) + const v = entries[0][1] + const keys = Object.keys(hash).map(e => +e).sort((a, b) => a - b) +// console.log(hash) + for(const k of keys) { + if(hash[k] === v) return k + } + + return -1 +}; From a9f28a4a040ebf293bb1b27e023dcf12613118b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Sep 2022 16:30:06 +0800 Subject: [PATCH 0981/2039] Create 2405-optimal-partition-of-string.js --- 2405-optimal-partition-of-string.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2405-optimal-partition-of-string.js diff --git a/2405-optimal-partition-of-string.js b/2405-optimal-partition-of-string.js new file mode 100644 index 00000000..0faa98e7 --- /dev/null +++ b/2405-optimal-partition-of-string.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @return {number} + */ +var partitionString = function(s) { + let res = 0, n = s.length + let i = 0, j = 0, num = 0 + const set = new Set() + for(let i = 0; i < n; i++) { + const ch = s[i] + if(set.has(ch)) { + res++ + num = 1 + set.clear() + } else { + + } + set.add(ch) + } + + return res + 1 +}; From 099445768133c24b4190f34836a03eb1fd5c9e1a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Sep 2022 16:31:43 +0800 Subject: [PATCH 0982/2039] Create 2406.divide-intervals-into-minimum-number-of-groups.js --- ...intervals-into-minimum-number-of-groups.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2406.divide-intervals-into-minimum-number-of-groups.js diff --git a/2406.divide-intervals-into-minimum-number-of-groups.js b/2406.divide-intervals-into-minimum-number-of-groups.js new file mode 100644 index 00000000..e55dd03d --- /dev/null +++ b/2406.divide-intervals-into-minimum-number-of-groups.js @@ -0,0 +1,20 @@ +/** + * @param {number[][]} intervals + * @return {number} + */ +var minGroups = function(intervals) { + const hash = {} + for(let [s, e] of intervals) { + e = e + 1 + hash[s] = (hash[s] || 0) + 1 + hash[e] = (hash[e] || 0) - 1 + } + let res = 0, cur = 0 + const keys = Object.keys(hash).map(e => +e) + keys.sort((a, b) => a - b) + for(const k of keys) { + cur += hash[k] + res = Math.max(res, cur) + } + return res +}; From 9eea8a21a79f914e61f1d44eb663ada8bacb7936 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Sep 2022 16:34:09 +0800 Subject: [PATCH 0983/2039] Create 2407.longest-increasing-subsequence-ii.js --- 2407.longest-increasing-subsequence-ii.js | 70 +++++++++++++++++++++++ 1 file changed, 70 insertions(+) create mode 100644 2407.longest-increasing-subsequence-ii.js diff --git a/2407.longest-increasing-subsequence-ii.js b/2407.longest-increasing-subsequence-ii.js new file mode 100644 index 00000000..f84fe50b --- /dev/null +++ b/2407.longest-increasing-subsequence-ii.js @@ -0,0 +1,70 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const lengthOfLIS = (nums, k) => { + const a = nums + let max = Math.max(...a), st = new SegmentTreeRMQ(max + 3), res = 0; + for (const x of a) { + let l = Math.max(x-k, 0), r = x; + let min = st.minx(l, r), maxL = min == Number.MAX_SAFE_INTEGER ? 0 : -min; + maxL++; + res = Math.max(res, maxL); + st.update(x, -maxL); + } + return res; +}; +///////////////////////////////////////////// Template /////////////////////////////////////////////////////////// +// using array format +function SegmentTreeRMQ(n) { + let h = Math.ceil(Math.log2(n)), len = 2 * 2 ** h, a = Array(len).fill(Number.MAX_SAFE_INTEGER); + h = 2 ** h; + return { update, minx, indexOf, tree } + function update(pos, v) { + a[h + pos] = v; + for (let i = parent(h + pos); i >= 1; i = parent(i)) propagate(i); + } + function propagate(i) { + a[i] = Math.min(a[left(i)], a[right(i)]); + } + function minx(l, r) { + let min = Number.MAX_SAFE_INTEGER; + if (l >= r) return min; + l += h; + r += h; + for (; l < r; l = parent(l), r = parent(r)) { + if (l & 1) min = Math.min(min, a[l++]); + if (r & 1) min = Math.min(min, a[--r]); + } + return min; + } + function indexOf(l, v) { + if (l >= h) return -1; + let cur = h + l; + while (1) { + if (a[cur] <= v) { + if (cur >= h) return cur - h; + cur = left(cur); + } else { + cur++; + if ((cur & cur - 1) == 0) return -1; + if (cur % 2 == 0) cur = parent(cur); + } + } + } + function parent(i) { + return i >> 1; + } + function left(i) { + return 2 * i; + } + function right(i) { + return 2 * i + 1; + } + function tree() { + return a; + } +} +////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + From d0b1f9dbc5af7cf13bf799c82c713fb033763872 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Sep 2022 16:56:05 +0800 Subject: [PATCH 0984/2039] Create 2398-maximum-number-of-robots-within-budget.js --- ...-maximum-number-of-robots-within-budget.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2398-maximum-number-of-robots-within-budget.js diff --git a/2398-maximum-number-of-robots-within-budget.js b/2398-maximum-number-of-robots-within-budget.js new file mode 100644 index 00000000..da24351b --- /dev/null +++ b/2398-maximum-number-of-robots-within-budget.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} chargeTimes + * @param {number[]} runningCosts + * @param {number} budget + * @return {number} + */ +var maximumRobots = function(chargeTimes, runningCosts, budget) { + let times = chargeTimes + let costs = runningCosts + let sum = 0; + let i = 0, n = times.length; + const d = []; + for (let j = 0; j < n; ++j) { + sum += costs[j]; + while (d.length && times[d[d.length - 1]] <= times[j]) d.pop(); + d.push(j); + if (times[d[0]] + (j - i + 1) * sum > budget) { + if (d[0] == i) d.shift(); + sum -= costs[i++]; + } + } + return n - i; +}; + From 299963e6dfa102a101c0350ec1d5529384276304 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Sep 2022 17:29:57 +0800 Subject: [PATCH 0985/2039] Update 2398-maximum-number-of-robots-within-budget.js --- ...-maximum-number-of-robots-within-budget.js | 32 ++++++++++--------- 1 file changed, 17 insertions(+), 15 deletions(-) diff --git a/2398-maximum-number-of-robots-within-budget.js b/2398-maximum-number-of-robots-within-budget.js index da24351b..9e33245e 100644 --- a/2398-maximum-number-of-robots-within-budget.js +++ b/2398-maximum-number-of-robots-within-budget.js @@ -4,21 +4,23 @@ * @param {number} budget * @return {number} */ -var maximumRobots = function(chargeTimes, runningCosts, budget) { - let times = chargeTimes - let costs = runningCosts - let sum = 0; - let i = 0, n = times.length; - const d = []; - for (let j = 0; j < n; ++j) { - sum += costs[j]; - while (d.length && times[d[d.length - 1]] <= times[j]) d.pop(); - d.push(j); - if (times[d[0]] + (j - i + 1) * sum > budget) { - if (d[0] == i) d.shift(); - sum -= costs[i++]; - } +const maximumRobots = function(chargeTimes, runningCosts, budget) { + const times = chargeTimes, costs = runningCosts + let sum = 0, res = 0, j = 0 + const q = [], n = times.length + for(let i = 0; i < n; i++) { + sum += costs[i] + while(q.length && times[q[q.length - 1]] <= times[i]) q.pop() + q.push(i) + + if(q.length && times[q[0]] + (i - j + 1) * sum > budget) { + if(q[0] === j) q.shift() + sum -= costs[j] + j++ + } + res = Math.max(res, i - j + 1) } - return n - i; + + return res }; From 17d4382dee6cc51ad9521d15a9569c493076cbe4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Sep 2022 21:14:16 +0800 Subject: [PATCH 0986/2039] Create 1104.path-in-zigzag-labelled-binary-tree.js --- 1104.path-in-zigzag-labelled-binary-tree.js | 37 +++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 1104.path-in-zigzag-labelled-binary-tree.js diff --git a/1104.path-in-zigzag-labelled-binary-tree.js b/1104.path-in-zigzag-labelled-binary-tree.js new file mode 100644 index 00000000..0b1c7c41 --- /dev/null +++ b/1104.path-in-zigzag-labelled-binary-tree.js @@ -0,0 +1,37 @@ +/** + * @param {number} label + * @return {number[]} + */ +const pathInZigZagTree = function(label) { + const res = [], { log2, floor, ceil } = Math + + res.push(label) + + // check last row + const lev = ceil(log2(label + 1)) + const reverse = lev % 2 === 0 ? true : false + // console.log(reverse, lev) + if(reverse) { + const idx = 2 ** lev - 1 - label + label = 2 ** (lev - 1) + idx + } + // console.log(label) + + while(label > 1) { + const level = floor(log2(label)) + const parent = floor(label / 2) + const parentLevelNum = 2 ** (level - 1) + const parentReverse = level % 2 === 0 ? true : false + const parentStart = 2 ** (level - 1) + const parentEnd = 2 ** level - 1 + // console.log(parentStart, parentEnd, parent) + const idx = parent - parentStart + res.push(parentReverse ? parentEnd - idx : parentStart + idx) + + label = parent + } + + + res.reverse() + return res +}; From d1eaffa781b26dca9ca90e9bd837a6e3bf9df8ea Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 Sep 2022 21:56:56 +0800 Subject: [PATCH 0987/2039] Update 1104.path-in-zigzag-labelled-binary-tree.js --- 1104.path-in-zigzag-labelled-binary-tree.js | 24 +++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1104.path-in-zigzag-labelled-binary-tree.js b/1104.path-in-zigzag-labelled-binary-tree.js index 0b1c7c41..7f5f3c54 100644 --- a/1104.path-in-zigzag-labelled-binary-tree.js +++ b/1104.path-in-zigzag-labelled-binary-tree.js @@ -1,3 +1,27 @@ +/** + * @param {number} label + * @return {number[]} + */ +const pathInZigZagTree = function(label) { + const res = [], { log2, floor, ceil } = Math + const level = floor(log2(label)) + let compl = 2 ** (level + 1) - 1 + 2 ** level - label + + while(label) { + res.push(label) + label = floor(label / 2) + compl = floor(compl / 2) + ;[label, compl] = [compl, label] + } + + res.reverse() + + return res +}; + +// another + + /** * @param {number} label * @return {number[]} From f25c5974db17d12b86a03ec8a2ee648933e6277f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 17:13:43 +0800 Subject: [PATCH 0988/2039] Update 862-shortest-subarray-with-sum-at-least-k.js --- 862-shortest-subarray-with-sum-at-least-k.js | 30 ++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/862-shortest-subarray-with-sum-at-least-k.js b/862-shortest-subarray-with-sum-at-least-k.js index a45d8c5f..a11a21f6 100644 --- a/862-shortest-subarray-with-sum-at-least-k.js +++ b/862-shortest-subarray-with-sum-at-least-k.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const shortestSubarray = function(nums, k) { + const q = [], n = nums.length + let res = Infinity, sum = 0 + const prefix = [] + for(let i = 0; i < n; i++) { + sum += nums[i] + prefix.push(sum) + if(sum >= k) res = Math.min(res, i + 1) + } + // console.log(prefix) + for(let i = 0; i < n; i++) { + + while(q.length && prefix[i] - prefix[q[0]] >= k) { + res = Math.min(res, i - q[0]) + q.shift() + } + while(q.length && prefix[i] <= prefix[q[q.length - 1]]) q.pop() + q.push(i) + } + + return res === Infinity ? -1 : res +}; + +// another + /** * @param {number[]} A * @param {number} K From f7ed06b2236a1647420697812da53a3660f87920 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 19:00:18 +0800 Subject: [PATCH 0989/2039] Update 862-shortest-subarray-with-sum-at-least-k.js --- 862-shortest-subarray-with-sum-at-least-k.js | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/862-shortest-subarray-with-sum-at-least-k.js b/862-shortest-subarray-with-sum-at-least-k.js index a11a21f6..e09e2839 100644 --- a/862-shortest-subarray-with-sum-at-least-k.js +++ b/862-shortest-subarray-with-sum-at-least-k.js @@ -12,14 +12,14 @@ const shortestSubarray = function(nums, k) { prefix.push(sum) if(sum >= k) res = Math.min(res, i + 1) } - // console.log(prefix) - for(let i = 0; i < n; i++) { + for(let i = 0; i < n; i++) { + while(q.length && prefix[i] <= prefix[q[q.length - 1]]) q.pop() while(q.length && prefix[i] - prefix[q[0]] >= k) { - res = Math.min(res, i - q[0]) - q.shift() + res = Math.min(res, i - q[0]) + q.shift() } - while(q.length && prefix[i] <= prefix[q[q.length - 1]]) q.pop() + q.push(i) } From c8310a61ba04529b743edbadfef8a3e741552008 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 19:34:46 +0800 Subject: [PATCH 0990/2039] Create 1669-merge-in-between-linked-lists.js --- 1669-merge-in-between-linked-lists.js | 56 +++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 1669-merge-in-between-linked-lists.js diff --git a/1669-merge-in-between-linked-lists.js b/1669-merge-in-between-linked-lists.js new file mode 100644 index 00000000..583ff451 --- /dev/null +++ b/1669-merge-in-between-linked-lists.js @@ -0,0 +1,56 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} list1 + * @param {number} a + * @param {number} b + * @param {ListNode} list2 + * @return {ListNode} + */ +const mergeInBetween = function(list1, a, b, list2) { + const dummy = new ListNode() + dummy.next = list1 + let cur = dummy + let tail + let idx = -1 + while(cur) { + if(cur.next && idx + 1 === a) { + tail = cur + const tmp = cur.next + cur.next = null + cur = tmp + break + } + cur = cur.next + idx++ + } + let head + // console.log(idx) + while(cur) { + if(idx + 1 === b) { + head = cur.next + cur.next = null + break + } + cur = cur.next + idx++ + } + + tail.next = list2 + cur = list2 + while(cur) { + if(cur.next == null) { + cur.next = head + break + } + cur = cur.next + } + + + return dummy.next +}; From dfa5665c6a656fd23a18435c3c2898cb824e4eba Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 19:37:25 +0800 Subject: [PATCH 0991/2039] Update 1669-merge-in-between-linked-lists.js --- 1669-merge-in-between-linked-lists.js | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/1669-merge-in-between-linked-lists.js b/1669-merge-in-between-linked-lists.js index 583ff451..1bf4d09f 100644 --- a/1669-merge-in-between-linked-lists.js +++ b/1669-merge-in-between-linked-lists.js @@ -24,6 +24,7 @@ const mergeInBetween = function(list1, a, b, list2) { const tmp = cur.next cur.next = null cur = tmp + idx++ break } cur = cur.next @@ -32,7 +33,7 @@ const mergeInBetween = function(list1, a, b, list2) { let head // console.log(idx) while(cur) { - if(idx + 1 === b) { + if(idx === b) { head = cur.next cur.next = null break From b35cf64d3edbdb7b6e5fca8434d5c1b08c117b4a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 20:00:01 +0800 Subject: [PATCH 0992/2039] Create 1910-remove-all-occurrences-of-a-substring.js --- 1910-remove-all-occurrences-of-a-substring.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 1910-remove-all-occurrences-of-a-substring.js diff --git a/1910-remove-all-occurrences-of-a-substring.js b/1910-remove-all-occurrences-of-a-substring.js new file mode 100644 index 00000000..97b46c74 --- /dev/null +++ b/1910-remove-all-occurrences-of-a-substring.js @@ -0,0 +1,13 @@ +/** + * @param {string} s + * @param {string} part + * @return {string} + */ +var removeOccurrences = function(s, part) { + while(s.indexOf(part) !== -1) { + const idx = s.indexOf(part) + s = s.slice(0, idx) + s.slice(idx + part.length) + // console.log(s) + } + return s +}; From 7f9f2f04935c493efac3f0ce0dffbeb7783f31fc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 20:23:11 +0800 Subject: [PATCH 0993/2039] Create 1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js --- ...-depth-of-two-valid-parentheses-strings.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js diff --git a/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js b/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js new file mode 100644 index 00000000..5027f160 --- /dev/null +++ b/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js @@ -0,0 +1,26 @@ +/** + * @param {string} seq + * @return {number[]} + */ +var maxDepthAfterSplit = function(seq) { + let A = 0, B = 0, n = seq.length; + let res = Array(n).fill(0); + for (let i = 0; i < n; ++i) { + if (seq.charAt(i) == '(') { + if (A < B) { + ++A; + } else { + ++B; + res[i] = 1; + } + } else { + if (A > B) { + --A; + } else { + --B; + res[i] = 1; + } + } + } + return res; +}; From 425b307899f56df0d61081ee0902380c1256bf95 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Sep 2022 21:44:26 +0800 Subject: [PATCH 0994/2039] Update 1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js --- ...-depth-of-two-valid-parentheses-strings.js | 32 +++++++------------ 1 file changed, 12 insertions(+), 20 deletions(-) diff --git a/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js b/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js index 5027f160..436fbc27 100644 --- a/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js +++ b/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.js @@ -2,25 +2,17 @@ * @param {string} seq * @return {number[]} */ -var maxDepthAfterSplit = function(seq) { - let A = 0, B = 0, n = seq.length; - let res = Array(n).fill(0); - for (let i = 0; i < n; ++i) { - if (seq.charAt(i) == '(') { - if (A < B) { - ++A; - } else { - ++B; - res[i] = 1; - } - } else { - if (A > B) { - --A; - } else { - --B; - res[i] = 1; - } - } +const maxDepthAfterSplit = function(seq) { + const n = seq.length + const res = Array(n).fill(0) + let depth = 0 + for(let i = 0; i < n; i++) { + const ch = seq[i] + if(ch === '(') { + depth++ + } + res[i] = depth % 2 + if(ch === ')') depth-- } - return res; + return res }; From 753265e890e44cf07192bbfa9404295953668a94 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Sep 2022 20:27:24 +0800 Subject: [PATCH 0995/2039] Update 1801-number-of-orders-in-the-backlog.js --- 1801-number-of-orders-in-the-backlog.js | 2 -- 1 file changed, 2 deletions(-) diff --git a/1801-number-of-orders-in-the-backlog.js b/1801-number-of-orders-in-the-backlog.js index c5bcd0af..82b7e23d 100644 --- a/1801-number-of-orders-in-the-backlog.js +++ b/1801-number-of-orders-in-the-backlog.js @@ -8,8 +8,6 @@ const getNumberOfBacklogOrders = function (orders) { const P = 10 ** 9 + 7 const { min } = Math - while (!h0.isEmpty()) h0.pop() - while (!h1.isEmpty()) h1.pop() let i, j, i1, From 8d02d2c3daf9af1004311d3659cc980298cdd540 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Sep 2022 20:45:41 +0800 Subject: [PATCH 0996/2039] Update 1801-number-of-orders-in-the-backlog.js --- 1801-number-of-orders-in-the-backlog.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/1801-number-of-orders-in-the-backlog.js b/1801-number-of-orders-in-the-backlog.js index 82b7e23d..b9678076 100644 --- a/1801-number-of-orders-in-the-backlog.js +++ b/1801-number-of-orders-in-the-backlog.js @@ -4,7 +4,7 @@ */ const getNumberOfBacklogOrders = function (orders) { const h0 = new PriorityQueue((a, b) => a[0] > b[0]) - const h1 = new PriorityQueue((a, b) => a[0] > b[0]) + const h1 = new PriorityQueue((a, b) => a[0] < b[0]) const P = 10 ** 9 + 7 const { min } = Math @@ -29,9 +29,9 @@ const getNumberOfBacklogOrders = function (orders) { break } } - if (j) h1.push([-i, j]) + if (j) h1.push([i, j]) } else { - while (!h1.isEmpty() && -h1.peek()[0] <= i) { + while (!h1.isEmpty() && h1.peek()[0] <= i) { i1 = h1.peek()[0] j1 = h1.peek()[1] h1.pop() From b5f08f6594a241b113c0df7a7798b2a2551a8fc2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 15 Sep 2022 19:49:40 +0800 Subject: [PATCH 0997/2039] Update 1942-the-number-of-the-smallest-unoccupied-chair.js --- ...number-of-the-smallest-unoccupied-chair.js | 108 ++++++++++++++++++ 1 file changed, 108 insertions(+) diff --git a/1942-the-number-of-the-smallest-unoccupied-chair.js b/1942-the-number-of-the-smallest-unoccupied-chair.js index 4ad49cf1..65b9cd46 100644 --- a/1942-the-number-of-the-smallest-unoccupied-chair.js +++ b/1942-the-number-of-the-smallest-unoccupied-chair.js @@ -1,3 +1,111 @@ +/** + * @param {number[][]} times + * @param {number} targetFriend + * @return {number} + */ +const smallestChair = function (times, targetFriend) { + const targetArrival = times[targetFriend][0] + let seatNum = 0 + let res = 0 + const n = times.length + + times.sort((a, b) => a[0] - b[0]) + + const occupied = new PriorityQueue((a, b) => a[0] < b[0]) + const available = new PriorityQueue((a, b) => a < b) + + for(let i = 0; i < n; i++) { + const [arrival, leaving] = times[i] + while(!occupied.isEmpty() && occupied.peek()[0] <= arrival) { + available.push(occupied.pop()[1]) + } + let seat + if(!available.isEmpty()) { + seat = available.pop() + } else { + seat = seatNum + seatNum++ + } + occupied.push([leaving, seat]) + if(arrival === targetArrival) { + res = seat + break + } + } + + return res +} +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + + /** * @param {number[][]} times * @param {number} targetFriend From 20734df10bdb0c9b8ec542fbe308ca3e6ea05c1d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Sep 2022 11:49:47 +0800 Subject: [PATCH 0998/2039] Update 1882-process-tasks-using-servers.js --- 1882-process-tasks-using-servers.js | 119 ++++++++++++++++++++++++++++ 1 file changed, 119 insertions(+) diff --git a/1882-process-tasks-using-servers.js b/1882-process-tasks-using-servers.js index 17b515bc..311fafc7 100644 --- a/1882-process-tasks-using-servers.js +++ b/1882-process-tasks-using-servers.js @@ -1,3 +1,122 @@ +/** + * @param {number[]} servers + * @param {number[]} tasks + * @return {number[]} + */ +const assignTasks = function (servers, tasks) { + const available = new PriorityQueue((a, b) => + a[0] === b[0] ? a[1] < b[1] : a[0] < b[0] + ) + const occupied = new PriorityQueue((a, b) => + a[0] === b[0] ? (a[1] === b[1] ? a[2] < b[2] : a[1] < b[1]) : a[0] < b[0] + ) + + const res = [], + m = tasks.length, + n = servers.length + for (let i = 0; i < n; i++) { + const w = servers[i] + available.push([w, i]) + } + let now = 0 + for (let i = 0; i < m; i++) { + const t = tasks[i] + + while (!occupied.isEmpty() && occupied.peek()[0] <= now) { + const [end, weight, index] = occupied.pop() + available.push([weight, index]) + } + + let idx + if (!available.isEmpty()) { + const [weight, index] = available.pop() + idx = index + occupied.push([now + t, weight, index]) + if(i >= now) now++ + } else { + let [endTime, weight, index] = occupied.pop() + idx = index + occupied.push([endTime + t, weight, index]) + now = endTime + } + + res.push(idx) + } + + return res +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + + /** * @param {number[]} servers * @param {number[]} tasks From c927930fad21481b103c0e3a2ba06d4e08f1763e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Sep 2022 13:42:10 +0800 Subject: [PATCH 0999/2039] Create 1529-minimum-suffix-flips.js --- 1529-minimum-suffix-flips.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1529-minimum-suffix-flips.js diff --git a/1529-minimum-suffix-flips.js b/1529-minimum-suffix-flips.js new file mode 100644 index 00000000..b50905b8 --- /dev/null +++ b/1529-minimum-suffix-flips.js @@ -0,0 +1,17 @@ +/** + * @param {string} target + * @return {number} + */ +const minFlips = function (target) { + const n = target.length + let res = 0, flip = 0 + + for(let i = 0; i < n; i++) { + if(target[i] === '0' && flip % 2 === 0) continue + if(target[i] === '1' && flip % 2 === 1) continue + flip++ + res++ + } + + return res +} From b7b7cb4edc8cacd428c8832ba70abb995140e7fc Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Sep 2022 14:00:29 +0800 Subject: [PATCH 1000/2039] Create 2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.js --- ...trings-with-concatenation-equal-to-target.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.js diff --git a/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.js b/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.js new file mode 100644 index 00000000..89b09319 --- /dev/null +++ b/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.js @@ -0,0 +1,17 @@ +/** + * @param {string[]} nums + * @param {string} target + * @return {number} + */ +const numOfPairs = function(nums, target) { + let res = 0 + + const n = nums.length + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + if(i !== j && nums[i] + nums[j] === target) res++ + } + } + + return res +}; From 2502ed728dc7e116c566701e7973923595c1e588 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Sep 2022 19:47:48 +0800 Subject: [PATCH 1001/2039] Create 919-complete-binary-tree-inserter.js --- 919-complete-binary-tree-inserter.js | 53 ++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 919-complete-binary-tree-inserter.js diff --git a/919-complete-binary-tree-inserter.js b/919-complete-binary-tree-inserter.js new file mode 100644 index 00000000..2187f8bb --- /dev/null +++ b/919-complete-binary-tree-inserter.js @@ -0,0 +1,53 @@ +/** + * 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 + */ +var CBTInserter = function(root) { + this.r = root +}; + +/** + * @param {number} val + * @return {number} + */ +CBTInserter.prototype.insert = function(val) { + let q = [this.r] + + while(q.length) { + const tmp = [] + for(let i = 0; i < q.length; i++) { + const cur = q[i] + if(cur.left == null) { + cur.left = new TreeNode(val) + return cur.val + } else tmp.push(cur.left) + if(cur.right == null) { + cur.right = new TreeNode(val) + return cur.val + } else tmp.push(cur.right) + } + + q = tmp + } +}; + +/** + * @return {TreeNode} + */ +CBTInserter.prototype.get_root = function() { + return this.r +}; + +/** + * Your CBTInserter object will be instantiated and called as such: + * var obj = new CBTInserter(root) + * var param_1 = obj.insert(val) + * var param_2 = obj.get_root() + */ From 155bb56b81da77b8e4ebcc1be1163f4bbc92fba0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Sep 2022 20:23:16 +0800 Subject: [PATCH 1002/2039] Create 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js --- ...string-of-all-happy-strings-of-length-n.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js diff --git a/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js b/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js new file mode 100644 index 00000000..98711011 --- /dev/null +++ b/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js @@ -0,0 +1,22 @@ +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +var getHappyString = function(n, k) { + const res = [] + dfs() + return res.length === k ? res[res.length - 1] : '' + function dfs(path = '') { + if(res.length === k) return + if(path.length === n) { + res.push(path) + return + } + for(const e of 'abc') { + if(path === '' || e !== path[path.length - 1]) { + dfs(path + e) + } + } + } +}; From cf0ffd74e41377c5c34587768e6dc8722589d487 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Sep 2022 22:09:41 +0800 Subject: [PATCH 1003/2039] Update 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js --- ...string-of-all-happy-strings-of-length-n.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js b/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js index 98711011..03581889 100644 --- a/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js +++ b/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js @@ -1,3 +1,23 @@ +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +const getHappyString = function(n, k) { + const hash = {a: 'bc', b: 'ac', c: 'ab'} + const q = ['a', 'b', 'c'] + while(q[0].length !== n) { + const pre = q.shift() + for(const ch of hash[pre[pre.length - 1]]) { + q.push(pre + ch) + } + } + + return q.length >= k ? q[k - 1] : '' +}; + +// another + /** * @param {number} n * @param {number} k From d625124ad6146e4d526ccdce19d1a4b14e4af8bd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Sep 2022 13:03:07 +0800 Subject: [PATCH 1004/2039] Create 2413-smallest-even-multiple.js --- 2413-smallest-even-multiple.js | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 2413-smallest-even-multiple.js diff --git a/2413-smallest-even-multiple.js b/2413-smallest-even-multiple.js new file mode 100644 index 00000000..fe2f27b0 --- /dev/null +++ b/2413-smallest-even-multiple.js @@ -0,0 +1,7 @@ +/** + * @param {number} n + * @return {number} + */ +var smallestEvenMultiple = function(n) { + return n % 2 === 0 ? n : 2 * n +}; From 37ec20d0c4077e3af3e2f73a4600ae0b8817ef94 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Sep 2022 13:03:45 +0800 Subject: [PATCH 1005/2039] Create 2414-length-of-the-longest-alphabetical-continuous-substring.js --- ...ngest-alphabetical-continuous-substring.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2414-length-of-the-longest-alphabetical-continuous-substring.js diff --git a/2414-length-of-the-longest-alphabetical-continuous-substring.js b/2414-length-of-the-longest-alphabetical-continuous-substring.js new file mode 100644 index 00000000..6abbe1e4 --- /dev/null +++ b/2414-length-of-the-longest-alphabetical-continuous-substring.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @return {number} + */ +var longestContinuousSubstring = function(s) { + let res = 1 + let tmp = 1 + const n = s.length + let pre = s[0] + for(let i = 1;i < n; i++) { + const ch = s[i] + if(ch.charCodeAt(0) - pre.charCodeAt(0) === 1) { + tmp++ + pre = ch + res = Math.max(res, tmp) + } else { + pre = ch + tmp = 1 + } + } + + return res +}; From dca594b63a24e4d1ca54dad91b7f978ec60fe5c7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Sep 2022 13:04:32 +0800 Subject: [PATCH 1006/2039] Create 2415-reverse-odd-levels-of-binary-tree.js --- 2415-reverse-odd-levels-of-binary-tree.js | 40 +++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2415-reverse-odd-levels-of-binary-tree.js diff --git a/2415-reverse-odd-levels-of-binary-tree.js b/2415-reverse-odd-levels-of-binary-tree.js new file mode 100644 index 00000000..8a7e57e1 --- /dev/null +++ b/2415-reverse-odd-levels-of-binary-tree.js @@ -0,0 +1,40 @@ +/** + * 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 {TreeNode} + */ +var reverseOddLevels = function(root) { + + let q = [root] + let level = 0 + + while(q.length) { + const nxt = [] + for(let i = 0; i < q.length; i++) { + const cur = q[i] + if(cur.left) nxt.push(cur.left) + if(cur.right) nxt.push(cur.right) + } + if(level % 2 === 1) { + const arr = q.map(e => e.val) + arr.reverse() + for(let i = 0; i < q.length; i++) { + q[i].val = arr[i] + } + } + + level++ + q = nxt + } + + // dfs(root, 0) + return root + +}; From 6c629e46493ae537230c00f8be81e397860dcbbb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Sep 2022 13:05:12 +0800 Subject: [PATCH 1007/2039] Create 2416-sum-of-prefix-scores-of-strings.js --- 2416-sum-of-prefix-scores-of-strings.js | 50 +++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 2416-sum-of-prefix-scores-of-strings.js diff --git a/2416-sum-of-prefix-scores-of-strings.js b/2416-sum-of-prefix-scores-of-strings.js new file mode 100644 index 00000000..11ea9edf --- /dev/null +++ b/2416-sum-of-prefix-scores-of-strings.js @@ -0,0 +1,50 @@ +/** + * @param {string[]} words + * @return {number[]} + */ +const sumPrefixScores = function(words) { + let trie = new Trie(); + for (let word of words) { + trie.add(word); + } + + let n = words.length, res = Array(n); + for (let i = 0; i < words.length; i++) { + res[i] = trie.getScore(words[i]); + } + return res; +}; + +class TrieNode { + constructor() { + this.children = {}; + this.count = 0; + } +} + +class Trie { + constructor() { + this.root = new TrieNode(); + } + add(word) { + let node = this.root; + for (let i = 0; i < word.length; i++) { + node = node.children; + let char = word[i]; + if (!node[char]) node[char] = new TrieNode(); + node = node[char]; + node.count++; + } + } + getScore(word) { + let node = this.root, score = 0; + for (let i = 0; i < word.length; i++) { + node = node.children; + let char = word[i]; + if (!node[char]) return score; + node = node[char]; + score += node.count; + } + return score; + } +}; From ea466adf513dcb18121e1b1510f5ac78fdf6cabd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Sep 2022 21:23:28 +0800 Subject: [PATCH 1008/2039] Update 2102-sequentially-ordinal-rank-tracker.js --- 2102-sequentially-ordinal-rank-tracker.js | 112 ++++++++++++++++++++++ 1 file changed, 112 insertions(+) diff --git a/2102-sequentially-ordinal-rank-tracker.js b/2102-sequentially-ordinal-rank-tracker.js index dd976e51..6a33689b 100644 --- a/2102-sequentially-ordinal-rank-tracker.js +++ b/2102-sequentially-ordinal-rank-tracker.js @@ -110,3 +110,115 @@ class PriorityQueue { } } } + + +// another + +const SORTracker = function() { + this.maxCmp = (a, b) => a[1] === b[1] ? a[0] < b[0] : a[1] > b[1] + this.minCmp = (a, b) => a[1] === b[1] ? a[0] > b[0] : a[1] < b[1] + this.maxQ = new PriorityQueue(this.maxCmp) + this.minQ = new PriorityQueue(this.minCmp) + this.cnt = 0 +}; + +/** + * @param {string} name + * @param {number} score + * @return {void} + */ +SORTracker.prototype.add = function(name, score) { + this.maxQ.push([name, score]) +}; + +/** + * @return {string} + */ +SORTracker.prototype.get = function() { + if(this.cnt) { + this.minQ.push(this.maxQ.pop()) + while(this.minCmp(this.minQ.peek(), this.maxQ.peek())) { + const tmp = this.maxQ.pop() + this.maxQ.push(this.minQ.pop()) + this.minQ.push(tmp) + } + } + this.cnt++ + + return this.maxQ.peek()[0] +}; + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = new SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */ + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From b22d958e15248f8e9cc2fb18c79d886ae2296640 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Sep 2022 21:29:02 +0800 Subject: [PATCH 1009/2039] Update 2102-sequentially-ordinal-rank-tracker.js --- 2102-sequentially-ordinal-rank-tracker.js | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/2102-sequentially-ordinal-rank-tracker.js b/2102-sequentially-ordinal-rank-tracker.js index 6a33689b..745f2173 100644 --- a/2102-sequentially-ordinal-rank-tracker.js +++ b/2102-sequentially-ordinal-rank-tracker.js @@ -137,10 +137,10 @@ SORTracker.prototype.add = function(name, score) { SORTracker.prototype.get = function() { if(this.cnt) { this.minQ.push(this.maxQ.pop()) - while(this.minCmp(this.minQ.peek(), this.maxQ.peek())) { - const tmp = this.maxQ.pop() - this.maxQ.push(this.minQ.pop()) - this.minQ.push(tmp) + while(this.maxCmp(this.maxQ.peek(), this.minQ.peek())) { + const tmp = this.minQ.pop() + this.minQ.push(this.maxQ.pop()) + this.maxQ.push(tmp) } } this.cnt++ From b2aa6fa301fbe148b6b0574fdab9c6bbbf1410d8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Sep 2022 11:25:49 +0800 Subject: [PATCH 1010/2039] Update 253-meeting-rooms-ii.js --- 253-meeting-rooms-ii.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/253-meeting-rooms-ii.js b/253-meeting-rooms-ii.js index 5fb05b3a..61a6a0db 100644 --- a/253-meeting-rooms-ii.js +++ b/253-meeting-rooms-ii.js @@ -111,3 +111,30 @@ const minMeetingRooms = function(intervals) { } return res }; + +// another + +/** + * @param {number[][]} intervals + * @return {number} + */ +const minMeetingRooms = function(intervals) { + const n = intervals.length + const limit = 1e6 + 1 + const arr = Array(limit).fill(0) + let res = 0 + + for(const [start, end] of intervals) { + arr[start]++ + arr[end]-- + } + + for(let i = 1; i < limit; i++) { + arr[i] += arr[i - 1] + } + for(let i = 0; i < limit; i++) { + res = Math.max(res, arr[i]) + } + + return res +}; From 80740afc7fa7ec272ebee0c001c2a669a64e86ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Sep 2022 21:46:17 +0800 Subject: [PATCH 1011/2039] Create 1884-egg-drop-with-2-eggs-and-n-floors.js --- 1884-egg-drop-with-2-eggs-and-n-floors.js | 24 +++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1884-egg-drop-with-2-eggs-and-n-floors.js diff --git a/1884-egg-drop-with-2-eggs-and-n-floors.js b/1884-egg-drop-with-2-eggs-and-n-floors.js new file mode 100644 index 00000000..09c729a1 --- /dev/null +++ b/1884-egg-drop-with-2-eggs-and-n-floors.js @@ -0,0 +1,24 @@ +/** + * @param {number} n + * @return {number} + */ +const twoEggDrop = function (n) { + const dp = Array(n + 1).fill(0) + + helper(n) +// console.log(dp) + return dp[n] + + function helper(k) { + if(k === 0) return 0 + if (dp[k] === 0) { + for (let i = 1; i <= k; i++) { + dp[k] = Math.min( + dp[k] === 0 ? k : dp[k], + 1 + Math.max(i - 1, helper(k - i)) + ) + } + } + return dp[k] + } +} From c78a5180ee78bff1eb0e9781f7e3c0d6fd1ef160 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Sep 2022 11:18:56 +0800 Subject: [PATCH 1012/2039] Update 2406.divide-intervals-into-minimum-number-of-groups.js --- ...intervals-into-minimum-number-of-groups.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2406.divide-intervals-into-minimum-number-of-groups.js b/2406.divide-intervals-into-minimum-number-of-groups.js index e55dd03d..aaecb9aa 100644 --- a/2406.divide-intervals-into-minimum-number-of-groups.js +++ b/2406.divide-intervals-into-minimum-number-of-groups.js @@ -18,3 +18,31 @@ var minGroups = function(intervals) { } return res }; + +// another + +/** + * @param {number[][]} intervals + * @return {number} + */ +const minGroups = function(intervals) { + const hash = {} + for(const [s, e] of intervals) { + if(hash[s] == null) hash[s] = 0 + if(hash[e + 1] == null) hash[e + 1] = 0 + hash[s]++ + hash[e + 1]-- + } + const keys = Object.keys(hash) + keys.sort((a, b) => a - b) + const n = keys.length + + const arr = Array(n).fill(0) + arr[0] = hash[keys[0]] + let res = arr[0] + for(let i = 1; i < n; i++) { + arr[i] = hash[keys[i]] + arr[i - 1] + res = Math.max(res, arr[i]) + } + return res +}; From 05bc8c51febd3793a9a2c6e6dcee6156d20a3b2d Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Sep 2022 19:52:33 +0800 Subject: [PATCH 1013/2039] Create 1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js --- ...rage-greater-than-or-equal-to-threshold.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js diff --git a/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js b/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js new file mode 100644 index 00000000..52743a02 --- /dev/null +++ b/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} arr + * @param {number} k + * @param {number} threshold + * @return {number} + */ +const numOfSubarrays = function(arr, k, threshold) { + const n = arr.length + const pre = Array(n).fill(0) + pre[0] = arr[0] + for(let i = 1; i < n; i++) { + pre[i] = pre[i - 1] + arr[i] + } + + let res = 0 + if(pre[k - 1] / k >= threshold) res++ + for(let i = k; i < n; i++) { + if(pre[i] - pre[i - k] >= k * threshold) res++ + } + return res +}; From 5d9a5b3a4a804cdfd5a6e2c2cfe2b41aa60c86aa Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Sep 2022 20:59:35 +0800 Subject: [PATCH 1014/2039] Create 1387-sort-integers-by-the-power-value.js --- 1387-sort-integers-by-the-power-value.js | 29 ++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 1387-sort-integers-by-the-power-value.js diff --git a/1387-sort-integers-by-the-power-value.js b/1387-sort-integers-by-the-power-value.js new file mode 100644 index 00000000..a756859b --- /dev/null +++ b/1387-sort-integers-by-the-power-value.js @@ -0,0 +1,29 @@ +/** + * @param {number} lo + * @param {number} hi + * @param {number} k + * @return {number} + */ +const getKth = function(lo, hi, k) { + const arr = [] + + for(let i = lo; i <= hi; i++) { + arr.push([helper(i), i]) + } + + arr.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + + return arr[k - 1][1] + + + function helper(num) { + let res = 0 + while(num !== 1) { + if(num % 2 === 0) num /= 2 + else num = num * 3 + 1 + res++ + } + + return res + } +}; From fd833f6691e97ef8797900ac1fab7aa7ef2b1ad1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Sep 2022 22:31:31 +0800 Subject: [PATCH 1015/2039] Create 1836-remove-duplicates-from-an-unsorted-linked-list.js --- ...duplicates-from-an-unsorted-linked-list.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 1836-remove-duplicates-from-an-unsorted-linked-list.js diff --git a/1836-remove-duplicates-from-an-unsorted-linked-list.js b/1836-remove-duplicates-from-an-unsorted-linked-list.js new file mode 100644 index 00000000..62bb0226 --- /dev/null +++ b/1836-remove-duplicates-from-an-unsorted-linked-list.js @@ -0,0 +1,44 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const deleteDuplicatesUnsorted = function(head) { + const set = new Set() + const del = new Set() + let cur = head + + while(cur) { + if(set.has(cur.val)) { + del.add(cur.val) + } else { + set.add(cur.val) + + } + cur = cur.next + } + + const dummy = new ListNode() + dummy.next = head + cur = dummy + + while(cur) { + if(cur.next) { + if(del.has(cur.next.val)) { + cur.next = cur.next.next + } else { + cur = cur.next + } + } else { + cur = cur.next + } + } + + return dummy.next +}; From 40b4c961a8469e25d6d9880c7c5493d1a84f0c62 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Sep 2022 22:46:37 +0800 Subject: [PATCH 1016/2039] Create 1244-design-a-leaderboard.js --- 1244-design-a-leaderboard.js | 120 +++++++++++++++++++++++++++++++++++ 1 file changed, 120 insertions(+) create mode 100644 1244-design-a-leaderboard.js diff --git a/1244-design-a-leaderboard.js b/1244-design-a-leaderboard.js new file mode 100644 index 00000000..769076b8 --- /dev/null +++ b/1244-design-a-leaderboard.js @@ -0,0 +1,120 @@ + +const Leaderboard = function() { + this.hash = {} +}; + +/** + * @param {number} playerId + * @param {number} score + * @return {void} + */ +Leaderboard.prototype.addScore = function(playerId, score) { + if(this.hash[playerId] == null) this.hash[playerId] = 0 + this.hash[playerId] += score +}; + +/** + * @param {number} K + * @return {number} + */ +Leaderboard.prototype.top = function(K) { + const pq = new PriorityQueue((a, b) => a < b) + const values = Object.values(this.hash) + // console.log(values) + for(const v of values) { + pq.push(v) + if(pq.size() > K) pq.pop() + } + // console.log(pq.heap) + let sum = 0 + while(!pq.isEmpty()) { + sum += pq.pop() + + } + + return sum +}; + +/** + * @param {number} playerId + * @return {void} + */ +Leaderboard.prototype.reset = function(playerId) { + delete this.hash[playerId] +}; + +/** + * Your Leaderboard object will be instantiated and called as such: + * var obj = new Leaderboard() + * obj.addScore(playerId,score) + * var param_2 = obj.top(K) + * obj.reset(playerId) + */ + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 1ffeb41abc8cb97ccf2dc29fed136a09a55d68ca Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Sep 2022 11:29:16 +0800 Subject: [PATCH 1017/2039] Update 2386-find-the-k-sum-of-an-array.js --- 2386-find-the-k-sum-of-an-array.js | 99 ++++++++++++++++++++++++++++++ 1 file changed, 99 insertions(+) diff --git a/2386-find-the-k-sum-of-an-array.js b/2386-find-the-k-sum-of-an-array.js index 5d7b62bd..491ad86b 100644 --- a/2386-find-the-k-sum-of-an-array.js +++ b/2386-find-the-k-sum-of-an-array.js @@ -24,3 +24,102 @@ var kSum = function(nums, k) { } return pq.front()[0]; }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const kSum = function (nums, k) { + let sum = 0, + n = nums.length, + pq = new PriorityQueue((x, y) => y[0] < x[0]) + for (let i = 0; i < n; i++) { + if (nums[i] < 0) { + nums[i] *= -1 + } else { + sum += nums[i] + } + } + if (k == 1) return sum + nums.sort((x, y) => x - y) + pq.push([sum - nums[0], 0]) + for (let i = 2; i < k; i++) { + let [x, idx] = pq.pop() + if (idx + 1 < n) { + pq.push([x + nums[idx] - nums[idx + 1], idx + 1]) + pq.push([x - nums[idx + 1], idx + 1]) + } + } + return pq.peek()[0] +} + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 5912ca5a30bd2f4224e52de4e6d6430fe5f8f8bd Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Sep 2022 19:51:58 +0800 Subject: [PATCH 1018/2039] Create 2083-substrings-that-begin-and-end-with-the-same-letter.js --- ...that-begin-and-end-with-the-same-letter.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2083-substrings-that-begin-and-end-with-the-same-letter.js diff --git a/2083-substrings-that-begin-and-end-with-the-same-letter.js b/2083-substrings-that-begin-and-end-with-the-same-letter.js new file mode 100644 index 00000000..3e1522a9 --- /dev/null +++ b/2083-substrings-that-begin-and-end-with-the-same-letter.js @@ -0,0 +1,28 @@ +/** + * @param {string} s + * @return {number} + */ +const numberOfSubstrings = function(s) { + const hash = {} + const n = s.length + for(let i = 0; i < n; i++) { + const ch = s[i] + if(hash[ch] == null) hash[ch] = [] + hash[ch].push(i) + } + + let res = 0 + const keys = Object.keys(hash) + keys.forEach(k => { + res += helper(k) + }) + + return res + + + function helper(k) { + const arr = hash[k] + const len = arr.length + return len * (len + 1) / 2 + } +}; From ff72fce27825940aeefe84ed63e8a8c84a5481e7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Sep 2022 21:27:41 +0800 Subject: [PATCH 1019/2039] Create 1247-minimum-swaps-to-make-strings-equal.js --- 1247-minimum-swaps-to-make-strings-equal.js | 45 +++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 1247-minimum-swaps-to-make-strings-equal.js diff --git a/1247-minimum-swaps-to-make-strings-equal.js b/1247-minimum-swaps-to-make-strings-equal.js new file mode 100644 index 00000000..b0619b9d --- /dev/null +++ b/1247-minimum-swaps-to-make-strings-equal.js @@ -0,0 +1,45 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @return {number} + */ +const minimumSwap = function (s1, s2) { + let x1 = 0 // number of 'x' in s1 (skip equal chars at same index) + let y1 = 0 // number of 'y' in s1 (skip equal chars at same index) + let x2 = 0 // number of 'x' in s2 (skip equal chars at same index) + let y2 = 0 // number of 'y' in s2 (skip equal chars at same index) + + for (let i = 0; i < s1.length; i++) { + let c1 = s1.charAt(i) + let c2 = s2.charAt(i) + if (c1 == c2) { + // skip chars that are equal at the same index in s1 and s2 + continue + } + if (c1 == 'x') { + x1++ + } else { + y1++ + } + if (c2 == 'x') { + x2++ + } else { + y2++ + } + } // end for + + // After skip "c1 == c2", check the number of 'x' and 'y' left in s1 and s2. + if ((x1 + x2) % 2 != 0 || (y1 + y2) % 2 != 0) { + return -1 // if number of 'x' or 'y' is odd, we can not make s1 equals to s2 + } + + let swaps = Math.floor(x1 / 2) + Math.floor(y1 / 2) + (x1 % 2) * 2 + // Cases to do 1 swap: + // "xx" => x1 / 2 => how many pairs of 'x' we have ? + // "yy" => y1 / 2 => how many pairs of 'y' we have ? + // + // Cases to do 2 swaps: + // "xy" or "yx" => x1 % 2 + + return swaps +} From 09ab7f1e5c4fcc382225ea7ccdb5734dc4252b03 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Sep 2022 19:37:10 +0800 Subject: [PATCH 1020/2039] Update 774-minimize-max-distance-to-gas-station.js --- 774-minimize-max-distance-to-gas-station.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/774-minimize-max-distance-to-gas-station.js b/774-minimize-max-distance-to-gas-station.js index 32bc695b..9eecda2b 100644 --- a/774-minimize-max-distance-to-gas-station.js +++ b/774-minimize-max-distance-to-gas-station.js @@ -24,7 +24,7 @@ const minmaxGasDist = function (stations, K) { const possible = (dis, res, K) => { let need = 0 for (let i = 0; i < dis.length; i++) { - need += Math.floor(dis[i] / res) + need += dis[i] <= res ? 0 : Math.floor(dis[i] / res) } return need <= K } From 88674e2b3c4b64eaed1add4cff334dd1788a76f4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 22 Sep 2022 21:12:15 +0800 Subject: [PATCH 1021/2039] Update 774-minimize-max-distance-to-gas-station.js --- 774-minimize-max-distance-to-gas-station.js | 102 ++++++++++++++++++++ 1 file changed, 102 insertions(+) diff --git a/774-minimize-max-distance-to-gas-station.js b/774-minimize-max-distance-to-gas-station.js index 9eecda2b..20ee5131 100644 --- a/774-minimize-max-distance-to-gas-station.js +++ b/774-minimize-max-distance-to-gas-station.js @@ -28,3 +28,105 @@ const possible = (dis, res, K) => { } return need <= K } + +// another + +/** + * @param {number[]} stations + * @param {number} k + * @return {number} + */ +const minmaxGasDist = function(stations, k) { + const pq = new PriorityQueue((a, b) => a[0] > b[0]) + for(let i = 1, n = stations.length; i < n; i++) { + const delta = stations[i] - stations[i - 1] + pq.push([delta, delta, 1]) + } + const limit = (stations[stations.length - 1] - stations[0]) / k + // console.log(pq.heap) + while(k>0) { + let [delta, gap, num] = pq.pop() + + let v = gap / (num + 1) + while(k > 0 && gap / (num + 1) > limit) { + k-- + num++ + } + + v = gap / ++num + k-- + + pq.push([v, gap, num]) + } + + return pq.peek()[0] +}; + + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From dd72980412fac8650215e03c8ff6a340566ad583 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Sep 2022 10:11:57 +0800 Subject: [PATCH 1022/2039] Update 207-course-schedule.js --- 207-course-schedule.js | 43 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/207-course-schedule.js b/207-course-schedule.js index 26831e37..09233baa 100644 --- a/207-course-schedule.js +++ b/207-course-schedule.js @@ -1,3 +1,46 @@ +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @return {boolean} + */ +const canFinish = function (numCourses, prerequisites) { + const set = new Set() + const indegree = Array(numCourses).fill(0) + const graph = {} + + for (const [s, e] of prerequisites) { + indegree[e]++ + if (graph[s] == null) graph[s] = [] + graph[s].push(e) + } + + let q = [] + for (let i = 0; i < numCourses; i++) { + if (indegree[i] === 0) q.push(i) + } + + while (q.length) { + const nxt = [] + for (let i = 0, size = q.length; i < size; i++) { + const cur = q[i] + set.add(cur) + for (const e of graph[cur] || []) { + indegree[e]-- + if (indegree[e] === 0 && !set.has(e)) { + nxt.push(e) + } + } + } + + q = nxt + } + + return set.size === numCourses +} + +// another + + /** * @param {number} numCourses * @param {number[][]} prerequisites From 91f1fe69146d1e5e9743c318728fb1efb5da67f1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 24 Sep 2022 11:10:46 +0800 Subject: [PATCH 1023/2039] Update 210-course-schedule-ii.js --- 210-course-schedule-ii.js | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/210-course-schedule-ii.js b/210-course-schedule-ii.js index f9c01679..350c4d33 100644 --- a/210-course-schedule-ii.js +++ b/210-course-schedule-ii.js @@ -1,3 +1,40 @@ +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @return {number[]} + */ +const findOrder = function(numCourses, prerequisites) { + const graph = {}, inDegree = Array(numCourses).fill(0) + for(const [s, e] of prerequisites) { + inDegree[s]++ + if(graph[e] == null) graph[e] = [] + graph[e].push(s) + } + + const res = [] + let q = [] + for(let i = 0; i < numCourses; i++) { + if(inDegree[i] === 0) q.push(i) + } + + while(q.length) { + const nxt = [] + for(let i = 0; i < q.length; i++) { + const cur = q[i] + res.push(cur) + for(const e of (graph[cur] || [])) { + inDegree[e]-- + if(inDegree[e] === 0) nxt.push(e) + } + } + q = nxt + } + + return res.length === numCourses ? res : [] +} + +// another + /** * @param {number} numCourses * @param {number[][]} prerequisites From d3d7ba2a2b36efb3dbccb5d892427cdfd194493b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 24 Sep 2022 21:43:50 +0800 Subject: [PATCH 1024/2039] Create 1584-min-cost-to-connect-all-points.js --- 1584-min-cost-to-connect-all-points.js | 36 ++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 1584-min-cost-to-connect-all-points.js diff --git a/1584-min-cost-to-connect-all-points.js b/1584-min-cost-to-connect-all-points.js new file mode 100644 index 00000000..b493e888 --- /dev/null +++ b/1584-min-cost-to-connect-all-points.js @@ -0,0 +1,36 @@ +/** + * @param {number[][]} points + * @return {number} + */ +const minCostConnectPoints = function(points) { + let minIndex,minDistance=Number.MAX_SAFE_INTEGER,sum=0; + let distanceMap={}; + let prevouslyTakenIndex = 0,taken=1,takenMap={}; + for(let i=1;i Date: Sun, 25 Sep 2022 13:44:12 +0800 Subject: [PATCH 1025/2039] Create 2421-number-of-good-paths.js --- 2421-number-of-good-paths.js | 66 ++++++++++++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 2421-number-of-good-paths.js diff --git a/2421-number-of-good-paths.js b/2421-number-of-good-paths.js new file mode 100644 index 00000000..cc0cd7f1 --- /dev/null +++ b/2421-number-of-good-paths.js @@ -0,0 +1,66 @@ + +///////////////////////////////////////////////////// Template /////////////////////////////////////////////////////////////////////// +const packUG = (g, edges) => { for (const [u, v] of edges) { g[u].push(v); g[v].push(u); } }; +const initializeGraph = (n) => { let g = []; for (let i = 0; i < n; i++) { g.push([]); } return g; }; + +function DJSet(n) { + // parent[i] < 0, -parent[i] is the group size which root is i. example: (i -> parent[i] -> parent[parent[i]] -> parent[parent[parent[i]]] ...) + // parent[i] >= 0, i is not the root and parent[i] is i's parent. example: (... parent[parent[parent[i]]] -> parent[parent[i]] -> parent[i] -> i) + let parent = Array(n).fill(-1); + return { find, union, count, equiv, par } + function find(x) { + return parent[x] < 0 ? x : parent[x] = find(parent[x]); + } + function union(x, y) { + x = find(x); + y = find(y); + if (x == y) return false; + if (parent[x] < parent[y]) [x, y] = [y, x]; + parent[x] += parent[y]; + parent[y] = x; + return true; + } + function count() { // total groups + return parent.filter(v => v < 0).length; + } + function equiv(x, y) { // isConnected + return find(x) == find(y); + } + function par() { + return parent; + } +} +////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// +/** + * @param {number[]} vals + * @param {number[][]} edges + * @return {number} + */ +const numberOfGoodPaths = (a, edges) => { + let n = a.length, g = initializeGraph(n), f = Array(n).fill(0), ds = new DJSet(n), res = 0; + packUG(g, edges); + let d = a.map((x, i) => [x, i]); + d.sort((x, y) => { + if (x[0] != y[0]) return x[0] - y[0]; + return x[1] - y[1]; + }) + for (let r = 0; r < n;) { // l: start node r: end node + let l = r; + while (r < n && d[l][0] == d[r][0]) r++; // condition 1 + for (let i = l; i < r; i++) { + let cur = d[i][1]; + for (const child of g[cur]) { + if (a[child] <= d[l][0]) ds.union(child, cur); // condition 2 + } + } + for (let i = l; i < r; i++) { // loop the path + let cur = d[i][1]; + res += ++f[ds.find(cur)]; + } + for (let i = l; i < r; i++) { + let cur = d[i][1]; + f[ds.find(cur)]--; + } + } + return res; +}; From 0780568bc936f331bc6f2cf61a52028bd70f5d60 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Sep 2022 13:44:48 +0800 Subject: [PATCH 1026/2039] Create 2420-find-all-good-indices.js --- 2420-find-all-good-indices.js | 38 +++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2420-find-all-good-indices.js diff --git a/2420-find-all-good-indices.js b/2420-find-all-good-indices.js new file mode 100644 index 00000000..e2e4ded1 --- /dev/null +++ b/2420-find-all-good-indices.js @@ -0,0 +1,38 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +const goodIndices = function(nums, k) { + const n = nums.length + const pre = Array(n).fill(1), post = Array(n).fill(1) + + let preV = nums[0], cnt = 1 + for(let i = 1; i < n; i++) { + if(nums[i] <= preV) cnt++ + else { + cnt = 1 + } + pre[i] = cnt + preV = nums[i] + } + + preV = nums[n - 1], cnt = 1 + for(let i = n - 2; i >= 0; i--) { + if(nums[i] <= preV) cnt++ + else { + cnt = 1 + } + post[i] = cnt + preV = nums[i] + } + // console.log(pre, post) + + const res = [] + + for(let i = 1; i < n; i++) { + if(pre[i - 1] >= k && post[i + 1] >= k) res.push(i) + } + + return res +}; From 34b185e8b9ac3d3f796443e3b606c875644a6659 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Sep 2022 13:45:13 +0800 Subject: [PATCH 1027/2039] Create 2419-longest-subarray-with-maximum-bitwise-and.js --- ...ngest-subarray-with-maximum-bitwise-and.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2419-longest-subarray-with-maximum-bitwise-and.js diff --git a/2419-longest-subarray-with-maximum-bitwise-and.js b/2419-longest-subarray-with-maximum-bitwise-and.js new file mode 100644 index 00000000..9decbac8 --- /dev/null +++ b/2419-longest-subarray-with-maximum-bitwise-and.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const longestSubarray = function(nums) { + const max = Math.max(...nums) + const arr = [] + for(let i = 0; i < nums.length; i++) { + if(nums[i] === max) arr.push(i) + } + let res = 1, cur = 1 + for(let i = 1; i < arr.length; i++) { + if(arr[i] - arr[i - 1] === 1) cur++ + else { + cur = 1 + } + + res = Math.max(res, cur) + } + + return res +}; From a215ded17416cc8c31dc35a1a9c41f43fa83fd93 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Sep 2022 13:45:38 +0800 Subject: [PATCH 1028/2039] Create 2418-sort-the-people.js --- 2418-sort-the-people.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2418-sort-the-people.js diff --git a/2418-sort-the-people.js b/2418-sort-the-people.js new file mode 100644 index 00000000..5eebafe6 --- /dev/null +++ b/2418-sort-the-people.js @@ -0,0 +1,16 @@ +/** + * @param {string[]} names + * @param {number[]} heights + * @return {string[]} + */ +var sortPeople = function(names, heights) { + const n = names.length + const arr = [] + for(let i = 0; i a[1] - b[1]) + arr.reverse() + return arr.map(e => e[0]) +}; From 65b3b74a093ab83215edd511e0aa1ee7e6a2fe6c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Sep 2022 19:35:54 +0800 Subject: [PATCH 1029/2039] Update 1462-course-schedule-iv.js --- 1462-course-schedule-iv.js | 58 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 58 insertions(+) diff --git a/1462-course-schedule-iv.js b/1462-course-schedule-iv.js index 3d882210..abbcaf55 100644 --- a/1462-course-schedule-iv.js +++ b/1462-course-schedule-iv.js @@ -1,3 +1,61 @@ +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @param {number[][]} queries + * @return {boolean[]} + */ +const checkIfPrerequisite = function (numCourses, prerequisites, queries) { + const n = numCourses, m = prerequisites.length + const graph = {}, inDegree = Array(n).fill(0) + + for(const [s, e] of prerequisites) { + if(graph[s] == null) graph[s] = [] + inDegree[e]++ + graph[s].push(e) + } + + let q = [] + + for(let i = 0; i < n; i++) { + if(inDegree[i] === 0) q.push(i) + } + + const hash = {} + + while(q.length) { + const size = q.length + const nxt = [] + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const e of (graph[cur] || [])) { + inDegree[e]-- + if(hash[e] == null) hash[e] = new Set() + hash[e].add(cur) + for(const dep of (hash[cur] || [])) { + hash[e].add(dep) + } + + if(inDegree[e] === 0) { + nxt.push(e) + } + } + } + + q = nxt + } + + const res = [] + for(const [p, e] of queries) { + if(hash[e] && hash[e].has(p)) res.push(true) + else res.push(false) + } + + return res +} + +// another + + /** * @param {number} numCourses * @param {number[][]} prerequisites From 0243cddaf8000ec497105146531c51792df419c9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Sep 2022 14:43:20 +0800 Subject: [PATCH 1030/2039] Update 1136-parallel-courses.js --- 1136-parallel-courses.js | 47 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1136-parallel-courses.js b/1136-parallel-courses.js index 4b6b6db5..6f727b6e 100644 --- a/1136-parallel-courses.js +++ b/1136-parallel-courses.js @@ -1,3 +1,50 @@ +/** + * @param {number} n + * @param {number[][]} relations + * @return {number} + */ +const minimumSemesters = function (n, relations) { + const inDegree = Array(n + 1).fill(0) + const graph = {} + for(const [prev, nxt] of relations) { + if(graph[prev] == null) graph[prev] = [] + graph[prev].push(nxt) + + inDegree[nxt]++ + } + + let q = [] + for(let i = 1; i <= n; i++) { + if(inDegree[i] === 0) q.push(i) + } + +// console.log(inDegree) + let res = 0, cnt = 0 + while(q.length) { + const size = q.length, nxt = [] + + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const e of (graph[cur] || [])) { + inDegree[e]-- + if(inDegree[e] === 0) { + nxt.push(e) + } + } + } + res++ + cnt += size + q = nxt + // console.log(nxt) + } +// console.log(cnt, res) + + return cnt === n ? res : -1 +} + + +// another + /** * @param {number} N * @param {number[][]} relations From 7d37a0616735ecb3229d691cb3d4b9c704ae6b99 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 Sep 2022 20:03:41 +0800 Subject: [PATCH 1031/2039] Update 105-construct-binary-tree-from-preorder-and-inorder-traversal.js --- ...ree-from-preorder-and-inorder-traversal.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/105-construct-binary-tree-from-preorder-and-inorder-traversal.js b/105-construct-binary-tree-from-preorder-and-inorder-traversal.js index a7c58a06..beebb4af 100644 --- a/105-construct-binary-tree-from-preorder-and-inorder-traversal.js +++ b/105-construct-binary-tree-from-preorder-and-inorder-traversal.js @@ -1,3 +1,36 @@ +/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ +/** + * @param {number[]} preorder + * @param {number[]} inorder + * @return {TreeNode} + */ +const buildTree = function(preorder, inorder) { + if(preorder.length === 0 && inorder.length === 0) return null + const val = preorder[0] + const node = new TreeNode(val) + const inIdx = inorder.indexOf(val) + const leftIn = inorder.slice(0, inIdx) + const rightIn = inorder.slice(inIdx + 1) + + const leftPre = preorder.slice(1, leftIn.length + 1) + const rightPre = preorder.slice(leftIn.length + 1) + + // console.log(leftIn, rightIn, leftPre, rightPre) + node.left = buildTree(leftPre, leftIn) + node.right = buildTree(rightPre, rightIn) + return node +}; + + +// another + + /** * Definition for a binary tree node. * function TreeNode(val) { From 2757785b3ce2aaa48d84131572b5cee32c4c8a04 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Sep 2022 10:27:37 +0800 Subject: [PATCH 1032/2039] Update 2050-parallel-courses-iii.js --- 2050-parallel-courses-iii.js | 45 ++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/2050-parallel-courses-iii.js b/2050-parallel-courses-iii.js index 97ad7213..1be35f37 100644 --- a/2050-parallel-courses-iii.js +++ b/2050-parallel-courses-iii.js @@ -1,3 +1,48 @@ +/** + * @param {number} n + * @param {number[][]} relations + * @param {number[]} time + * @return {number} + */ +const minimumTime = function (n, relations, time) { + const inDegree = Array(n + 1).fill(0) + const graph = {}, dist = Array(n + 1).fill(0) + + for(const [pre, nxt] of relations) { + if(graph[pre] == null) graph[pre] = [] + graph[pre].push(nxt) + inDegree[nxt]++ + } + + let q = [] + for(let i = 1;i <=n;i++) { + if(inDegree[i]===0) { + q.push(i) + dist[i] = time[i - 1] + } + } + while(q.length) { + const size = q.length, nxt = [] + + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const e of (graph[cur] || [])) { + dist[e] = Math.max(dist[e], dist[cur] + time[e - 1]) + inDegree[e]-- + if(inDegree[e] === 0) { + nxt.push(e) + } + } + } + + q = nxt + } + + return Math.max(...dist) +} + +// another + /** * @param {number} n * @param {number[][]} relations From c32ea2fd39ca7a86c3cf057f0a9db38d207454ed Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Sep 2022 12:33:37 +0800 Subject: [PATCH 1033/2039] Create 2268-minimum-number-of-keypresses.js --- 2268-minimum-number-of-keypresses.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2268-minimum-number-of-keypresses.js diff --git a/2268-minimum-number-of-keypresses.js b/2268-minimum-number-of-keypresses.js new file mode 100644 index 00000000..c2db66f7 --- /dev/null +++ b/2268-minimum-number-of-keypresses.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @return {number} + */ +var minimumKeypresses = function (s) { + const freq = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for (const e of s) { + freq[e.charCodeAt(0) - a]++ + } + let res = 0 + freq.sort((a, b) => b - a) + + // console.log(freq) + for (let i = 0; i < 26; i++) { + if (freq[i] === 0) break + const step = 1 + Math.floor(i / 9) + const val = step * freq[i] + res += val + } + + return res +} From 9a96c5d2694609d5bb93db8faf61d4885e3798a5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Sep 2022 13:32:40 +0800 Subject: [PATCH 1034/2039] Create 2340-minimum-adjacent-swaps-to-make-a-valid-array.js --- ...um-adjacent-swaps-to-make-a-valid-array.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2340-minimum-adjacent-swaps-to-make-a-valid-array.js diff --git a/2340-minimum-adjacent-swaps-to-make-a-valid-array.js b/2340-minimum-adjacent-swaps-to-make-a-valid-array.js new file mode 100644 index 00000000..9163ca49 --- /dev/null +++ b/2340-minimum-adjacent-swaps-to-make-a-valid-array.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumSwaps = function (nums) { + const mi = Math.min(...nums) + const ma = Math.max(...nums) + let minIdx = -1, maxIdx = -1 + const n = nums.length + for(let i = 0; i < n; i++) { + if(nums[i] === mi) { + minIdx = i + break + } + } + for(let i = n - 1; i >= 0; i--) { + if(nums[i] === ma) { + maxIdx = i + break + } + } + + const num = minIdx + n - 1 - maxIdx + return minIdx > maxIdx ? num - 1 : num +} From 46be45ba38c271febe148b3c9a08b6f5911b3b2d Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Sep 2022 15:21:14 +0800 Subject: [PATCH 1035/2039] Create 1061-lexicographically-smallest-equivalent-string.js --- ...ographically-smallest-equivalent-string.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 1061-lexicographically-smallest-equivalent-string.js diff --git a/1061-lexicographically-smallest-equivalent-string.js b/1061-lexicographically-smallest-equivalent-string.js new file mode 100644 index 00000000..8672746c --- /dev/null +++ b/1061-lexicographically-smallest-equivalent-string.js @@ -0,0 +1,47 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @param {string} baseStr + * @return {string} + */ +var smallestEquivalentString = function (s1, s2, baseStr) { + if (s1.length === 0 || s2.length === 0) return '' + const uf = new UnionFind() + for (let i = 0; i < s1.length; i++) { + uf.union(s1[i], s2[i]) + } + let res = '' + for (const ch of baseStr) { + res += uf.find(ch) || ch // some letters don't have connected component + } + return res +} +class UnionFind { + constructor() { + this.parents = new Map() + } + find(x) { + if (this.parents.get(x) === x) return x + this.parents.set(x, this.find(this.parents.get(x))) // path compression + return this.parents.get(x) + } + union(u, v) { + // init + if (!this.parents.has(u)) { + this.parents.set(u, u) + } + if (!this.parents.has(v)) { + this.parents.set(v, v) + } + // find root + const rootU = this.find(u) + const rootV = this.find(v) + if (rootU === rootV) return // connected already + // set smallest lex as the root + if (rootU > rootV) { + this.parents.set(rootU, rootV) + } else { + this.parents.set(rootV, rootU) + } + } +} From 71678f3ebe2131566349d09b04863bc627504917 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 10:14:47 +0800 Subject: [PATCH 1036/2039] Update 310-minimum-height-trees.js --- 310-minimum-height-trees.js | 39 +++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/310-minimum-height-trees.js b/310-minimum-height-trees.js index 2a49c6ff..cb725c28 100644 --- a/310-minimum-height-trees.js +++ b/310-minimum-height-trees.js @@ -1,3 +1,42 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +const findMinHeightTrees = function (n, edges) { + const hash = {} + + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = new Set() + if(graph[v] == null) graph[v] = new Set() + graph[u].add(v) + graph[v].add(u) + } + + let q = [] + for(let i = 0; i < n; i++) { + if(hash[i].size === 1) q.push(i) + } + + while(n > 2) { + const size = q.length, nxt = [] + n -= size + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const e of (hash[cur] || [])) { + graph[e].delete(cur) + if(graph[e].size === 1) nxt.push(e) + } + } + + q = nxt + } + + return q +} + +// another + /** * @param {number} n * @param {number[][]} edges From 1b7a2d0a8a3e6220020361f12ec21b08d5b75557 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 10:16:59 +0800 Subject: [PATCH 1037/2039] Update 310-minimum-height-trees.js --- 310-minimum-height-trees.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/310-minimum-height-trees.js b/310-minimum-height-trees.js index cb725c28..eeaa1111 100644 --- a/310-minimum-height-trees.js +++ b/310-minimum-height-trees.js @@ -4,7 +4,7 @@ * @return {number[]} */ const findMinHeightTrees = function (n, edges) { - const hash = {} + const graph = {} for(const [u, v] of edges) { if(graph[u] == null) graph[u] = new Set() @@ -15,7 +15,7 @@ const findMinHeightTrees = function (n, edges) { let q = [] for(let i = 0; i < n; i++) { - if(hash[i].size === 1) q.push(i) + if(graph[i].size === 1) q.push(i) } while(n > 2) { @@ -23,7 +23,7 @@ const findMinHeightTrees = function (n, edges) { n -= size for(let i = 0; i < size; i++) { const cur = q[i] - for(const e of (hash[cur] || [])) { + for(const e of (graph[cur] || [])) { graph[e].delete(cur) if(graph[e].size === 1) nxt.push(e) } From 61068fcae8c3a19293da7dd770ea749bf29ffc7d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 10:49:13 +0800 Subject: [PATCH 1038/2039] Add files via upload --- images/310.jpeg | Bin 0 -> 41496 bytes 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 images/310.jpeg diff --git a/images/310.jpeg b/images/310.jpeg new file mode 100644 index 0000000000000000000000000000000000000000..94f48a59e9c8a1ce4ae7f3b1384e4e09a02b0cb2 GIT binary patch literal 41496 zcmb4qbx<5n)a~LB+!l8YEE+U;@Zj!lfyLb=xVyW%%Ob(uLI@gI+=2#odHlYw>ec)A z-KpuCuG`anYo^-HIsLZ$wh6%cDkUogfPsMl$h=>Gw^e{R0QNl#1M^=B`=7zX{g)!Z z!^6QNA|N9E&y9qFjEIDSgoucYij4B%KYM>dL;ZmEU*^9`{`XZ_1UNW^4@ihe|5N1u zD|zb!U?an9!hC~+p$5QW!@yy~ybS?J0RUK7xc6xPuff6rVBisv5Rl)!(pc}Y|JUYw z%m_%Z@Q83Q?`~{(1VkJvBn~lLY87M?JWi(|nlFj?s)dcSD8Nsq{afeG7qsGP-w6om zBwUir%!A)6BK)5(@c*;|fC0e5A-sF2vH#Zv19*?(-QMGX!KUI6gT+xXp?3O$8}zmU zK!bZPjSYtl5CJ^Z3?1FN^-d4#N?P0c{kSKcvm+r(gN(i~E{Mf^3R(>mW}bwA=bq2Y z)J!bfukOl+Lby9V`07@g8O^yJ{GY#8H4Oz zBvq)U+c5YKy7{S~qHFEGxL_3yNrV`_wE$A1R(2HFmAl3lzUq&yXZVu6wHyGwW{j7A z!{78mDYlmF5#IoK!;#W^%Kp+ehE$p9w%{4Wo!}Si45uS3qME6mGiIHdF&ioLF&O_L zucBS5S4QBaD0MoaEAP5e|LGf`mE&c57yBU5J7y-@9IdKt1=Gdktb!MUkZxDwd18}- zdP=+U?6gwQcDzjT02>7@cIGo)>)L2#p>6+>zSb4*;LWy`CkJ4;vMGU}f)gCfbokM> z#+^PuR~=iiI`oX<<2JUwYU!n#ubT8D*4^z{wsyT7tHt=~K5Ssq>}KVa4G;n^Mu$a<(Qg3OGd6Gc_#L`sC(k>w8XuqbN?iTuKRsXH0E;0k*^Y`1j|-zj z;?5y{(e5=6MkxG>M7EFPTWhDyTTZF}u}Tl>Yqs1NkO%RawQD(f`QZ&vOM*ZPxAF$yVkOO^doJ64)|e0oh1aD1jn(%$ z__&a2j70hIUt7l3{C6)%pg>fNvX1sy_lak9!ZHFCfH@!!s!XA|FV5E1r|oPVQagy< z>M*VD94XE;CXk0hs`kTBRReBJNV2i@OaXoiNkA5AjA|EsHWNy6AZT5QLFT2kvHvb_!n+;*m3vNW1l-D0~iiy|^|`zES0 z!5ct8J&KO}HemgFdB=HRf2%8bKbwCz13O%F)HKld6yI5@+>T4WrWDRb%iw!lhgRAcwz{ifGc=dr`2A+JoYNp+(kJ|&4Xu)v( z7s9K+9CZ-B{qc+?!5L#dh8`55@18V@TV~-yN^6(jv0jZ#)K~Nhh@O)J-q*W$`}L6! zgy*i>3o}h#2Oc9wQtgHEd2mhJ>T~P2{U-qRL68j(hCV*3GrukZf^vgEe814&R_06L z?U$!D8`k628G^H(Z@<4B`;}lONXpEH^9nsj(P%n05~o6^ik&VlRItvdh$6^NR}w2+ zYPu-LoU($sj5BNzf%1yf%51IJa=iC&Mgo7=sBSD4W28uG87lbgQwR2ObELG=%o|D~4K2j7UF>R`>xAP_AH|| z6bdP8LPH;WgXMI#5|Lf$cj5$pF%O+#9P52Aagppqql$-l_2E__i8S`m>&_q-zUJie zSg-f-6vY0DBi^~|Z#KR$EI)(JG1`urAbRSJLe1hJksY=tR#D2*UifcKiRXn$>ad+c z_3jM06`VLnP2jebwet`<{1^M@?{Tu*hh8VCqpBJ|Tw`Hthe*ewNjFmMTA*oFmbJqV zM7Z{YEZwh7u@QNjtm3>Pt?Xxs{DW)4FTE3$evG57fG3!hGT6pUplO4WzlqDHr8}ou4!u~$5d?( z?0zCn83bob2=&rLr3NrFi{w1o%2WkLzYIT=iz5Tl8VF8&RnzAvvD@DOo@yGpPdlp8 z2{JW{HHSwPCHR`{X9!%?Ol!(_Z-5V@vAfZkk;;Xu$gG=b9ei-nMi?_9J_jyrLTMe$(tvi-Hl@;88Vl+}mT$X(u`jbS`zBA|ad-M3#o*VO^Q`&}0bh^k0ef!4kyDMoDx|)E2g$&^u z?5ZFz3HPyKH83RgIZdeEUs5M@&0X8$ zpTEs)TkW!kVDv(zNNNVYNVk!+SZl(mKM)GDU6Tr=ULuR&sWu+iLl~}|7Q^*uho{&# zWRWrus584s%u!19`*c*JNCb1!uxtwo&0CDK)yL}CdDRm1I{o@MJ4GPlN9p#7EO@Z1 z3`u++2A}?Vxgw;HzF0n(h-+QEv?dd3@Wev&B7A4iKP{q1}eT^R+F5%wi~NMiOm-~5`!}Q zX%x0UW5$kiq;qalO_cgTx7l6Hf1bKP{}jf)0aOe!*&5hCERjYpQ6ApXFfVi)Pjc2g zQID8A9~v-m=!z>^V*MHUp!v+OLwc#H+?dhLyrwFum$p+o88fhD9wjLMtN82JzS2M| zN?emmTLH`{hhWww_%tY*^XtJ3{&!B@&0>d>5(TUx`)UFQN@cwC>kgjCufI2|7n=!YWFe~?5+Ve7gH zkt00R zjA@;SyCyr{L$WHzjR})SO~FG)ioJ6$OustPdKMV)mIXTjGl&=zs@7|{s(i&_lU-d* zjF;M)L7Cf+$vMXFQ_%=(<*uLbprxJ!5syJc%+9uSJN9@~?!aR@C50>qxxs9`UfRHD zDGDSLG7+Zsv!8+C_RM-p9Q$Y$jA6?hZ!RK9hTr#-V|g&s?0|_Sc4WsPQVYHz(MnII z*2kITLDEi$ZJwx&LhIm#cBb*ltYofXi@t9^S%zHS5a{OE(;E27#HCpBu$d=YMt>S0 zd&ly+1T40d_u(yPfK022maKD_3Iy7Dw}q<1vbE>Q7~X)@B1s(N?%*jLY=G(x6T3zb z#Cc;rUTMUgAb%T?N*d(5I3+NN21~0E$}&v{_+#%rS*&cX`zi7w&37dmGwS5SG{`W< zFb#Npanr8*@5m=VP=P8>(8{j58g)e@_^$mzeU{OvfGY#Hl)U~6ej@>z z@r!~qlp?i8RYzZI(kb9KZVN5#Z#O;hnCj{$5|FaAmck+L-{e&2O&{X-JN#cZaIl06e7INkLn5WjuZs{ zRB};xk@nNpv+Mp~Enj)_qAl?~M$UE?$#N>Tx^@AUyVZ*6lhh}MvIE+h{@C6B_>nxa zuc1TD(9&2xUQfb$*pvSly_gknB!7cT#v>OzfYRb_kYXy2f^owPnu|7CqHVGLVY{r= zbM*ItUZ-M7+lqhPEN9}uw=yi8u}>R5L@H#G4V>-)*3W}Q^?S%mkGRG?62PAO8xj50 zjqZZKEGLA!xX((3p)ziO@l_*FOe=w;gp@?O64qk~rD#m#MWlM8Z}!t5NUNpkDZuTig^{u4N+3!A2&W zwv(*GW4}yYK=GInvg}Q#pty^+e_M?tteCACo~P~75!d&P^w05GBEzM%B=9`1H-?Qj z@gYB*W6YC=zmG`L48dg4`ZO7}jym~}7;Wc}_#hgIP)6--sPm7Ymg%w)EydKc6UtvH zYz~TQ%)J5T9Z$LZ%Wx#jo+a&%q&tv1ACOqdAyz9Z8qviDT+^TA1&Z;1UM0Td2Ew~H zf9_2hKg}|5*Cu`D7qIW*M~d@Vgw%Dm&M9UxYKn;GAqcZ_z%%;AB4pS+ɕFZ? zThK6nrz!F2^<=`5+7B}<+&gG_N_cx|WM?Q7fh1p7Djag|5DNu(Ij3)q9H z`^-Ucq!?kpmz%Q=lBz1yKm9C_4%5^i$%)2Ls?KQT_UvQq2QY#Kqa`f zN5ZoTXBiNUp&kU)z{&TQB(96w{oIWMa5w(-&;7=lWpTO5MV~fcF&^Q!Tpr5CO7{ln zrj3ys^FLAWAqhl0HVshx2qAie!QwRPGV0a?c4x`yzp4r>aDez4cwcW|G7DTf#T+Q} zHWr(Q(G3d48gI{iSE~Lo>x<-VUcE5tDua&u>DQ|6k|4_@|*&3$+gjM^wwl@IySF)D}^VKd4*ni%nWYx28 z)x`|_x*#P>0`-Di**(WvFmtgNG=i*D47UG?Bz;mi49P^l)yH^Ac>}B$m_T*( zUY$(8tyhdP#_%*i0RHyZY^W?Dl3pSybL;Gq(eJxjvI-#piCg_0V)f6e!A#hvWv2C| z+lPlrrEfv-KaBnFDz$rSDlPZ=NxFQ(&KMV^)J#X;0LR|C9!)_34gVxb1Ss6XHjco4 zQEEjv>;0n+(eoD6a;M$B+{?O^NM(Qxe~12RWP=B1F`>WRHYnQMnd3W+|Gaw#i_aXC zSvr8U8ri49)!Fepq#9USYhBmepQ4c^qvhEG;*g721*A><`Ku604a%(>+q-qdyEYtI zM)5190>q=FmzB$TPSD|y^mrzNcU?3rHCF(e&f;pyz;^hn&A0^v&OflR_Oq`c(YhIE zfq{e9TrlQ_q_CJKq82GnVn9P%OzIl&183iEbkHv98z59oriS->8+;gjW3ic|IxI={ zdb~40_vO@QAz7#8*KTyN`^6U$A3RR%OE!P&FSGe7zzqb+zcGP94q$R0<#<&HG(&vR@Ygq?Sg%mjGO7}v#Lu+wo9GkzSp_|-r#!1h=)jZ}jKOKuq zho|VI;~Y!#dt1%KMSgpi)H)K(BZb(Z;ug8@F*u;*cMNZ2r#RLUaaOZtrnTwvC>`S^I1#QHY?V=eDPEwldhO!c2SxwyqO%z%0ZR5VO*-rM|K-fzmDbSQ(A7ewA>lOBVOnv#Xf6=wi5eepkZ!_9d#tAEX zKaHsh$vXRe21}cp(Ov?(DgUaI0l4zBn)or9z)NENxwf_Q!qBkriE5=xsZ^&(SM+yV zw*Kx2-a6T9C)SkTk6o3z#Pa1RNnom)gDIEia0JX!*sTa{N4}cR0K7q3>_XP!*N={i zlq!Cfw_wK!|H{u!)z~J7^Imb4!yM|itdi-1Wekvy%-Pb|hSMFPu|DER3v1vY^z51N z-`KtT;Vc#-X0WTNoDJ6ruTi%T^}L6FOa_g){pC_j(m)WH`YV~Hy;wZv5gl3|?WeYh zOO_eoRnNKzgGd7E4Zz%)AaDQOvL@~LCPw%Rd#6P+|o;r@hIj@sj88x~CzDvoqNg>rGyj0~lBki9@P zPC#9lP8S-lzqFHN)1)?6Mi#qK2||NYprYqKuc`3%n`g0go_DhdqE#9KUO4Vmv6c6= z{rbg~^c&qeE7N@kao1F+MsY~reJH47GxX7+E1R?7Vob6mD%#Nc68r9YmA=Sl^wCHtbbdOjJBtx5IUT!VkO*#Z-$w1=q4UI z0WHBh+Ony`D0Jbu1RN{IinaR~{nOY=N}+}j^pYm|%py2~F4BP8F}R%*Fyvxang>>B zBZGZ{v&UL}w1!X1$@YCv6#(s?FnywA%ftpCfgN;KEUW@{+mVyuX* zD?#eKzl-Xgcf#6CjL}i==hn9S2WneR_+zoge`U0FMFcvC#Em#Rjq7_(9 z^4zOzZv{%x2BtyG?3w0Ud^s!0l>*jlzbvmTUQMfTI?& zP0i_*B@I|Vt0&OIn>y(fbJlPmTB?irn>(wY_oiqkkJT$g0sl;|Hgs3X{8VQ>(`r51 zrwPD;Jr&+`a1*u(xugpokr5#msij$P-6~dl18@_j)VEOnb6l!YACGfawGF@WKy3fF za3(-B_Y6#Xj2<*888Y$q$QR~SHrY0qp;w6vYG`khe6@-ZbPg1VSn1rTm{`AX2=?C2 z)r$(KSg+giMoRCLEpO6EIpHw6F&MIQ*9t zPILQ;%}8#aFm!|}o!l`=oSs}0&_x4B!d!czH0b$M_H)*Z(@>OOjm?ns$M{4L8_CnP{gtD=qF zSR?+UH%d#q(kw(&*6c?Y{i}J`(_(@n)3u$*5o>F~^qTfdToB*`;-a8#<%=$VJ#VRQ zfSh$)o&}L%)Q~K_zT?M;!R<1;naG>)Dl3;gXotJ7oMs;c15QSX{ERvL1;gske$L^# z$YHv!sX;4}?8Odcp7g(%$$@{97vEpfI__db?1pIg(zO1kEn4uAxN7A^IkZt{XyVFX~xAHo`e}?36sEH$j;q$vNs7@q826(Yw(YA@Q7I1|J z%Pv`>Fy!9I<nb(htLa_hiVwEJXMo?1*>wP>{R`CR~O^A^;Od)v?wxAhoXz8-3wOPHN%+JHwoc zR(=!+3G(U{mL!xsK^PrAGL-Wd9e7@eiwR216}m{i+YZenRu~Vyh~;gW6lS& z?~2qM#z=yv-vCp-zw@R<1^u3hA*y%?E{{>JTY1gZ0Ck^m?}C$;k`7W1yck0!G;+e3 zh*W&7t5583&puk2Wi9J)j8j*(ZvdqDVN<%F7uFG}jY>|$Ae%^HjEO)*nzIun@0L#{ z<4ra64v{lO1FJ+aQGEL;jkGl$t0v3-WKs})N-{7Ox~#gI4#lXf&qooY(B1da&3`xMq{GfDl!LNF=O6roo) zW*4TB#R(iN!wGyfd1!B}!f6mWUxffv&iSnL3*P|e@kh<&WUd3-FKFa-nJx4+V#Z0{ z6ZbJ~mc1!MQWr)~&AMG-H|-XBNg%H}p_`Y)H-PO6gAMeRu;|%7ZLq(Rb2Np*l9?@+ zL&jb}Uux26E7p8pL{~)KOR#~}YEeIyLwgF%bMX7X_8S1}Vw4&M#v+14#q!Fgc6sTY znQV4nCKRgkw_zs13il8ZI#xP-N6{Y@=I=hvod%>?CWHKow;I|5%~4nO&@(W*YxNxJ z+6WpT*F{oFHy$oOHb%KHc2To2d`VPaj8187>YES%gMMRskHp9D$GD}ER!_+Q8D zu*D0EJ7sd+N1DFFdNODY+JBC5TegFlwX>JG_}aGREargt^4G85UZ!C;t2Zg8=^SCzXIb~QvA`l$sY!}5 zd-?9Q1=gh5k)YTATTy1;3TcCg|AN(gy>?|Y9M~VMdkvIDF;AM<@cu}fs17PfWe8gx ztHPnA7;u_7)zpAt6lf#C?0%jvvV`)&K;rDKRCCf7?V8Rb%$)&f?@-^CqSS6AQKSgE znHUj5T_ON^7fwPI^)g$bD=WKf)r=(XopD^r>@e)t-WY2&8;NxeaTZ+9Z2gshO5$}Y zM}z4yh~=BD0h@ToWb5T7EPPGdj8kQAZ86r_Na{<>K3(1g5*?d4eRBDFGj7+n+6N)P z*Y=76qD*(`wW^KwD0#O3vx8KZ?AhHK_mM2T&jZS@P-Sn~BYcYvn$CwJwgx-%-b1Zv zDu#sY{`Tjx*mUd7jT@fc)qgUs7>LU+1y72{OQCgc7}b*(I>K@#m!Zk{S(d^v?KKh> zh5daMhO&l>9V=bx`u3Kji;|hz{3AKjZdO{3+CSFfpL!Gac5uT6wNr;JaReASjlNUI zdN3ZWQHo43JDHZ=HW~N}i=4_qi|=zV_*JG=I1rjdPOp?23DbGi?UDLUwLj;7o^0t6 zi(4T2$#2|manJ9hJr4b27RSXp^cqM!_GRjI9dyVU%3z=u(wR^cMwgg;bfkk*$S z{CO;tQ0}7y5(G`GySn0fr`mwx*hq=<)S|Q%Q7L}H$y0kT?&CWBGY2voT4OKASWY!F zKs{LBM`yeF>V_q5u~&X2n{uAN&br*uOV}k@I)sy6hn(Dt7N?Gt=eptOwQ{|Va1F1j zaT~&L{p03$!!ig1_bAI(QHisTnW9itK_YM(57Z@3|4Arv|WxySxL9DJ&D|;r3K5m(y;#K zzcmUEF-aohPt1{Hsz3sFN_QoQb@2*4)E*aoj+VLcIh<6qBm^;;Hs#EG?GGN_{BU0C zxPuun(3$8sc1$Z@HiXYT(DU6pxunyf&PA!jk3Vjr@qvH9)D1Cq+PM@ZLZ32M)fd7M z=uH&t(nfKkTyUh6|K$);yH|IMq^Tf%bu3*7(ath|BZ& zRFsM5c-zv0GT8Z-cQe8~8Fn%_27^!<(IwU7VpeK2V`vtXjX4d`yR8ej;a!|s`g(X` zq|hl@!a)o%wCwN=Mk+stCm1lv{VL4qH^d}W@FdR8$^CsJNpOvK(XhnYjw+*y-ssK^=|ih_cow{%G;>8^FkN zWITvMf_MyH@3FSRIW;DCNSh;nZIs*dXX}fC1m;#xI^TWfl&PlLB9`Q(g)yiu z7y3N6{4?v&wqD>cMArd5ZSR7X__LSkka%k6pD&F{=2L;NBzdxCXSBb5Wb0qiK8`Iu zymAdDymP0ZHvlXz@|Ao(FbqZCa3VHBCQa1tAtf;Y!eDn;zd#?iM7Yf9`y_vmCH-mG zv}9oG@wbK8v2PKzZu?BYi;PhR7;Z~M^Vpn0W_Q8U>bV~OHwkBJFS zNcOqW)I1D3-pkY@OImv(y@TJ0D%x}YDXlIiZ-Jh!k5=0m53?V4IiiU;q~rURSBN3)`4Ap}IL^4*ca=*ffW z3%+MWS{#NRYO5@nU9w0m7b_%ai9Rg1m7(D z`Sx}!pVpJ}ELTPpyAEqPg0s*6pm|}KWbB-<-cNn~p*)NtG7&*%jhSZGgEzbE&--_3 z(owRf&#-D&3QHX2;YC~g9e)Z41pgI3t-m>|lI8zf4@ zg=(-pb0PouO1r|8=#f4b(93(c>{7S$LYWd^PvT zS9~NfM)rA9*er65cJ9HhtHzV(gd0P9g)4tyL(DDa7iqa}r^$u0ZU4?irun@uE7g5d z$tC5Nk(WrsPTdJ24|}9je{lSZFt`@=2C3Xl(JuY(H^&aHj-d`sht#w%c^)<*tTq~K z+!3C!*lu+hkapP_^YWv~@PYE-)RmZ(PD=Y>i+$zrZo94JN5~{AKCEo`4Q3kl*T}Ap zWt9DDky1a`_KC3&>?bdLYCVoGgPYF_@X$?6VOGzI{y)gE5s=jVcAGl-??sv$D0LMec}G&p{_MhpRI8`Y1%s(%XvFv4+zp^(wbm>GStB zK(=lv$(La5v)gBiZn$m3r&Rm$emn~@7)D+gD6abC$QEJu!$B*D1_~>yiL#Qtz5jxx zl$xU)#vS5<)ZOj}tn_B)_3g!8{1R^&nI?~O2l)?oEB<_|+Q)q#WZ}I|rLucJ(rjw~ zDlgL+)LuP7dYrfFfKJ&9Un9yaMCvs@2x|Yz)CgOvewu}-uFK`F!a)3LU#UadSJ0gE zueL)z75l4=CM*_k4qyy|A80y?+wx&D%^EuFG4u!7hepG{6RyaXCH%n_?cxvyz~1b* zUTN)ck7NuUJuB+ogMy3~aZ25y`*ZSgIw1ZJY6nE*>gdE{eAs zF4{K^QDAl{_UuZPzN6qDopH3o(0o8@L;|pl9_l6#Ig2nm-2tn0>e`f9kqEB7g8F6Y zw8p5zuM)%)*w&-5lX|Fj*8JCEU5qMzR@sn=B=5bj9S)6g*R^Cey$F&Tor58+_jeR8 zj5J*o2vKZTnj7_QBe{op$y3~m4bw&adzqGGWy7ZCCk5^R4@>%q0_UMXe(ssq+-uE> znPyvu`Em_T_kklnSwJ+?L?dmpIT0UkIC8L#_7v6H$IyInNDW@R0-uDPyL3*Q5 znPO#Od{KORvT%^+l@t`M^Gz}vUtl`8Cg#@J z8en<{$b8ngL8-eglbkm!cB7EnM;b$FPgW{4j6uEBQnpq)YL=H@3nL6%8aV86i#$aA#BQ@_> zeIoAFQO9m~^y#(HpW5z2)qd(Ym4oFA97@CzX4@~?#@zK3CAhkh(Xp^*4MDs|w=w$> zJ9+Bx;2VFeP&w99cqI?{a&u5(ptitSqJu}22TnA-xLlV0KD5tgE)R-32*IQkj@udD zQ}GAa95`C4?ea|lWux?2jqhdE5F#>pL24<~JQi1$jWnm)-d$4PUW=^t{lk|s5h-{k zKJn?I`NNSQd+x_vwT3S*e+P*Hz9ZN9q`&aFp~`N(0U94&ZnUZ|pX)x^(i`M%He@yq zjvB*T3mzXW>&2c7VF;?6@{=aZxe6RLOAIEFCtQ~!l-|%2lM3qQtL=L~3Myi%Cg?Qc zY@a6%>FSW>{-HxK7j-{tfbC?{x+!BO%h>BCeKcKMu4uK_`nEgCb&WNdZt*JtPc~z0 zY!cpj5@aJ$I<&_#lLvqT=j`NT+y!a3eS1=k}4a`p3V zg+nIi?Mkw$r0FnNQnbyVDHI~QK2f;u%+UWh@tC`QD61s?#Qs=*lyg6qPHHCO$|`9sL^iw9jDpBeVIVt_*(&S}Gu(#<(y=Ep z$RfoP#o;LcH{ZKNY*=FOFF1ECUk37^qk!Zt29Rbx|=?(cS zNm`w@_a7a}#59iKP{Gk&v0-$9;E7AV>W{Qs@Kd+UfUh}x6EUGNysm3q;i>%ITa7NSz(LC!FkyY$GOrzdKt$L2I zcXi>{H)S`%aEex+XLQU@)Am1ishT#IO;TjCtH@weMV=^K2r>R@IG>V^nwm2}9&^;` z!PNktTv1eCK}px^a5-m?|AZvBod}b$;34%gb#?sH>r6sHTsvyfD{c9*eu(_?JnsTB zmTiH#@;}&)8QbYI7Wqgaf|zv4-Cg$dCf20u3t*fXo_EoL9vm3$?8$7JWq zbB<&K?;fSvgo;Rjc>PmD-W2PP=8;0s+E}G%zkvt*zjGT6FRjZ#c!fU%yHMVHl@fFG z0t|nf7cOODc2S<{h7+HSBqXjOoU-RU$uIHtBsV=MuIfL}7U47oL<*G73N}0($((LE z(P^{F+s2@w$hP{l&4FVN1!ApI#$q}~6W3FKHn^L5ZpnY;&Gq-%EIeveUB#Leo@d1i zgqjX-m*mWZX`kLZH-GkK*h{vH_7Z9JncMzNYfYP|p^kIv13=<^()^)2+fyK1=qf$8 zo*6H+&|rG84Asv|Q%STSbP@i>}__gQN)_l0zAzbrau$pt4Q!|*;x5;1>74$15VdzX~ zRgSDQ=!DICKFP3--(4kUvZu~Ftpkc<;)0R$E$0_0oP>vD{((xsmBWJ(dRY64za2cCS$4-X}obV)4ykFuG*v%faa-esa zXxH|_vIoBKg`;PC(NraDVSF|PPq(rv@zUniOcaVPwP+*UCi#Nc9;F>%*&XrjwKXHo zRGXyj__^HMASx_kXpyG7LVax79fWYd3RM@F5m?TLWI0rzqd06!)zpFsx+_HRV^9x! z==3YwS)3)Mn*W46Kl5H`@I|2SjX!KhZ#%`;=M1us`Uy*xIF1o3h}T~4t3%!i3>STV zlYq{5RFn9W^FSrjV1);!)U-Crz!k(`ur>uYq{3)Vt-rb*EOJqdg?TO`EY4Cde%yWc80C+LN<0#}5UIVlx)J=2 zQd;f~N>~iZ1mWSFP4NU>IxPGBy(XXhChKn^mczv|hq3$-@_)!IF|J549~Oow5W3q)a-v>YZ}`-Vv%nY6BHu6j}@)C7c; zgPmysHAgg^nwp}QT5r14RAdkvwA$z~zT4%6KmSG2=2_llUr1owRnu_vzIUZ#={8NU z{<+blFO=lKHP#_m&)=ntdOphoyR2D%gLpC`2Gm}|`tdw@<*suaTa9Sv!R|tnt>z6d zL~R;Is`O!sz%g!`M{#*pXVtm^VAym`@wJ6O-tl*TG1pH5#5tF!p)_kJ+$4Kl*%B7okUTH@n?`|j zg`kPmMw(V(?o&?#;qlLj;X{-8H=oouF9YK;TLBWAJ`PMo11KXW;SOg`xNO zkMF;u$v10-;K3Hy-+hcur7N@Iy6U?<;C`;dR8l2o1mMBgBlLVkrH$-M8*&zdjh>e> za%#Wu-&_QmQBLrz+55&fR&(-;ocF`c44c+W7t z*GE%ud-{J&m0bz7_f@Z$LfNuMa&ow+)R@g0kA(rV8!H9c2;f?RKawMtMlLArqmKqk z5_f)r#z~L;lc*k!#1B1DS_vH!#5b0dqijSI_d;AOwDcSY^*yhS{*zCm9H)eR&5cj~ zGKIY6b2ScItFvonZj3(G-kAl^L66wH<>`H0a8XAE z)p=-y)^z$3cil@i2I0ovP8FLP;qR!|dYE>-0$V~;aL3NUvAqjCCBw!h^M4%X(wehr zhQ_K9O;3Zvq|s#1*ni8@o?*89X&3yka(y?C`L+3lCVsJ9!6PUbB}Jq>hn~9^lhugf z4WQ_`+bp#Xpjmq^Sy;}F+PS=U!r7u660Q9ZX%(v@Cc4zzaE_jxygt&tq}JInuh?qs zCt3KK&b3a!C!T70p3$wBF=jTIWQNO77-oKFTE@biP!z zym}?N=3^$9Ht_f0g3=_WZdeUNOlh)w1w9f>{3P7em3BDC>|s0L4q4-E?9*)OaxHW= zB(LPl3CidOLMAq7SMSYZ6}q`KoS zovVn;(Nlu9Fpy)#VRAog!|o zIlKTv9@c%TZ}2?LqcQVrPNueZ z2NNe{;oVW-cnO$(=taADSejnXl)rFPUY>;WEv_5@mPy|QroRvPV(K)Z_sE7^@t9#g zxX%(%TpRXq9OTUYFl|l;V+7^8_&gi_0*Nar6L`3e((mWX9%W2D@Y??6*}x}iCukj5 zzmL_t-{!r$?CfQG|4oCvD73u&s+)f(=FUFWBjxTmS}wOcd-dY5pE|QJm+r(su}znD zTCLXU`{^QpJ}%JP!qo_W6GxbHgyV_DM=`9#I+q|-alr}556LwO z8(i=yOl+-_P6w;OOM0+A@y>;IL4l#KCG8|ANB3j|`Z`dRrG3oGz`fuZ%UkNLQr*lw zu%m|_^^?!8F=UN5oA*UjabT{$>{6PW2;tEI^~(y<)a(-!RB zOw9tJSqRYyid545^T*Q5&N?F#{d*=p{~V1_el=}W#jb38abcRJpRO_;oQ>areJBT# z;D}k@)3T<8^JkVglyXWvR;p#KvyrDgxw5uRS2_&tjaQg*G27GFhh`S{k}i`heY;sy zoD#d5uCxAO^LXJ3QEJc?!DuJVSGSroNp2(Ip3Wu~y!8r}L3-yHAGFHj=N@=GLWV3d z*OATMJJ_sJ*bv$5SPW=la{0UPy7l4vnSr96#tL(jhxj+ZH(;yjqWAfA@7GS9LJm%| z7AqxAP@Z*rntt=gDA-#d;8f+D**x}-=D;Sod)BBmVNzAU-U**beH7m~ooy9TKYT!} z+Pt%Ef<9g7KNAf~4b%QHa3Jo@x&a*J8w6niRs*WA? zLoOaw9MmnO`qfu2*LNxK0h(hDJTTJ6KX(|f3X zPFUBZ-OxztpI@svz5Yj3lfuMI++6%el0AP%m1zVoP%zI$1`HS_1%7C4Q;MBVjb=gX|eHfoc$5ipW3|S1@!GW6#cnJ|c60Q}!EVE8$4l`opsxd}M_bv5<>=7*`lCwy)bI zJDh9&C#+)J*|z-Yi>;v{d(D_1z<~)xUNW$k^p>EU&-*OPNcnJDA%)eYC&e6fa2a<+M=5ot7Ohc5#ro~c#iT9mNnxX?aKWG5R8Aq^f%I4h54t*{E9FTQ?=yJj zqh%*mx;2B%lhVFY{$fX-`0S6nQZnq%h(NhF+!@cEFx@8HxM%1 zU;LR3j|ddG0@OJ@uW#EX_lLG{aTp}uPc?4EZ4!BXGa&p<6r}n!!Ha^ZgIqG?aPlVxTMP~zfIL|g){?)3&ppL(N%;)b zWfVU*VbEef=8a~G3}H~BxMxR)D>E% zpnMVEIAfK$=5-%PscngV|5@t?y=QzeZm8IU3VN;9z~JI%B{?@Z1v6K}n#llyw0#cb zi*|8l>Zx?}mK4h6R06;yD<=G+lw8uTw-Hk`%^VRcCTqVa3kEJ*5LG17A3T7_&q$1a zPBI%eq*1+Q245R@dd}v3rN+k0)&hj;zYL?t_Pqg4OF>bwc4-IM(Hf6FFA>NfTjYO= z^wA4(otvFrImWISslV?}RjRK%V=^_fCUTgOgY9e;>8)-}*e8@YdwsB?PKQ06z6Dgp zT8CM;LUf$%Xh<8Ic+`q7VWK_njFMx9x$j_>ON@>3qb^@#ccRs{z0(&3hl{g$=M5C5 z9Y4tr*+(O!P2Pi82}zQ$fjoZQkgp?4+~qH_t{d`_3nz1x4;xQ1+~JCQglMc3C}roL zgHgzl*is6wa~m$1xuR)4I>-DU0OCL$zqfyNjjRUeIMl{BNPdp`tI&;8tFichsJ!*ebsKn%4mfY~cyH-$=PfdwXMfux)^hxQ<{BKIf zo7^7s0&S`UyL;ciZ_=;SMU(ikmIuf;6{snKV6U~;`FOvYKUD4;4S_t3y~QhHu=cLs z0E2OAC5)gac|WHD^!O(R?9SWvSds1^4u1BlK;8E(3cP_u&CiXZgfwyj?6`z<{{T886hVk7&A2wJ5v0W4=26JKfxk3JVPU-^0f%-1 z)Rh=;;3_BnrWC@vfZ4ft@yM!pcZS4y_MN^6w|bya8@T2C!^ipnO3b-q70N~Qb(7_`h8}bb?S$A0Y`xeLCz9xZmT7fG6ZH?)d|X1)egaXS&_K zXnjJW?Gfbm0RI4;GgO%Q`xTw_1L+^AdZF`E^?##RgB7bmue@NB!8<4jn>)+TDeB z6D`z)xFfL#v7s25Rdzh`+Sjv6SQ^x^t~nHXzv@e@khT{?bn*ImluV>Ppw>!~=0qPj zd<1Ml9`>pbEz;dD$!5!R-X3{z7|cnnscl6gK)rp)oMc>g5PG{fAOLAx!lDKk77^$e$`iXU;{0@ z8&jGFrcg*Icsvq&(6!1l>^yi`4PsN@q@rn3TmT0%F4AO01$_HmsY2TKBG%2UdQTGbt0O zhp9b1n|Gv6c5{paGX%Me8B1S_oud3)+PCJ94>WBYs;-W^S!7#=2e>1*?OIcPHGMb? z-Sf8ke9D#E;S4%o#Ive!ah>xoprd;ba%yGHy zP_GV2gqs(QmUAXA8242QBv50IbH2vf1;uwRjC7w7(_E(?kJP$?O#4%3_`#0U`P`~d zVle>%szo0@mL4?$BaC)Yb8<~?I4mXuD!`^!l;x0Nu<(mThr&d$M!%vc0Djd^JW@W; z&BrFgwP*QoUd0eY6(E6YaBo0kRPq7sa!(a=LBp}u}-)U0n}^s6eX zGnU#r@p`b{-J`d`6?jfELm;}9x$a2+0LxXS_S!Z>#~hl)5s~?cBH)V-NBYzb7;RZf z+wb4@tgAJb9IhCv+VC+Fii{)-Hc4@A!1kb0);A6;NCoZ1LZG`F?gOv_ z^i@V4HaFe0-`&MrMmGgR-{4x`=R$blP#!$@sT@ZU>$#0vQj;knBWaGdTY2K^U3&O3BZch~`T{f^(PCouBQ6b6wvP)gR zh?c)9;PPnpg&T_MKQ+jxo~F{JjmhHlRl&(BD7uq>*P66vYgm>PwR0Hne}D%xKBA*=%n9#Tl^9rq z$sivhmh6Fo$tV{eHmmgs{IR#_eA0_EyG98Y?g%_q&KP8mvvLQ>y-n_Ywl@3mOZQ=gm>vR>f|oy~QcykxiQ1d1`=y3&fyv&COc^q)>-* z#(Qu_dr>pJhRa&~3tEM@xD8?t&f`iriIt3OrA_T)*wlw3Yy#2l7vv7~DxrN73Ka!ve`=j~EPRR9O^ z&BuDBWnr0Hi2ENRslK5G0!~XzXxT=y= zj93$LI0K5C_*G?le4BGZ42@tet@>W9IkDWtalzYqyCEQK#0%WZfZ1I_-`OJ;B4M|1MR)}h(~+|iBKu@^S|Yf_J_sM;~@U*7ap-b5D$+v+?^_Y$ecklAmevhOAAvOl$?Rv&p6_gKDu<(8< zmur8;xcmPA+M{lt?H`cy@qX0=vwlLI#{`}YEhI||fx7m;YGY2e*>PF4DVV=xWg!0m zcC1RSI{;6V6(eF;6_;JTdsVgETn^qrwH-J$YkRIgr3*YFh|Y1RH3biXZ+KS4;;}m9_9P}>k1|fFa_){ z?KP0c;FI!uQF?~Wv~s|M;B!G>E?ijl#r>diE#84z)(;@D;X<2=w>X9g z1G3z4dIgdqw*W1?ty7uD4n3!{3h}j`q{V5howE$TOJj4aYdB0MTbAq+&gaJI8Dot= z1eS6Dw~|0NYI{Hj9_a}9w-gc`k(o<{SjE}zz#ntt_pcjCX8NN%%2PAddOT!Urzd_| zb2P=sg8XiHz)O+fUf(t5^&g~tGwSHUVfvS%u=(6L2Y15ZanB)uGk~RABVr5wO zx4_&*&)8Rok#wV`dRs0TUYhCVPnAHi`d*G%m&b?pd|oi5kKVj}W%Sd~O?`o%E!I6J z$@3WTFse&7E)w$qq!rsE66i&{sRpYeZ-zz+Jx$7O!MAbqK+dgT4fl4s+O@u#^sh*C zmn8oHb~HNUpuhqeJSHzPmk^N~SnTylC=G|S5WfHtZ;90HeVTOUT(?u=GVjD`u`@-e zr-~iY<;uVau~rMR41dh17$= zA0y;`o#?$w#(WR8s!K~Xz+Ok*^fqGGkdS%iskaFIps^lblS?v?;7F=`ergb#`=#yi zb?kmAWgFBi=!V>lpmw74#CIzika^_sRO`E!@$to7(R?)uqHGGJc>e%87AwW9w>|;A zRB8wFbN3ZtuBF;7!^i{uXtHt~UW0>u86jyB)(0M_IL^G1bs^6aMe zA%}X$G#sHVu#;jt-?bLhSnTLXJ=*lNUSZgU|G- zLT9snUJs7esZNQtoU=TKcLhke9%#cR+W;-`Si*Ra5?F5g8fwn0000Bx^;m|?Be1Xn z{{Y>&s$&^Fh40OcEIfft?0)BwR#Vw$+7x%UYNjOI;acmu=aXwxa2Cu-BHVMuTM!5r z9Cxs)-tq9F-y`OvU#YyRF6;Aao(*Ej&B<$g-C3ZYqknu^T6fGe(0~qcz2r#M{(N{{ZT{JJehW9nq~(P3Rn`3%Mei~abTryZsVHW zdZm?X-0MVUI8K@BEFMd!F=~s0&9S&KJa8TBy^8iN>F*10Kw=35aa==9V|tf@`n=1! zOQJgEsx<}|P36sx>V#U7Tr*)KgAogU3M@J-Ya-0@S@$V1s-XtufUV5*w|M@bH8zLM zaG5vMA57%aF=E*x!|HqvVlmk{l=g~Qf~(<4>>5-EPaCdlsJnnY_c!?Fv9r8`B-Ob- zD@*EZwhV3qFvB(*9fp~1lS1Qbp$EOeHKu(u<{5@7qgiGHIK@dmBPgF2l(s5H+;Izp z#K{6kNGAJ{6Zfpy{HCV-j;aAg?0g>7IFz}KlF9lw`<{HOfuT#u$%1{bJvbu%oH@YwurT)0fiIA$R+YK#n0I`%Gua)$4< zh&_dBc$*Ar5EA5D#m(r$qc14GV@NIwY${&daYWll*ouUYma(QUObKNs0SqbLE~fQ~u%{*-B)8Z*WZsG!*LLGklP7!C_5A8U3r761m21LRwa zkJ5|?*zXEY`BUoHArRULWxtCGvX)B%3GHw{)~B&-qnn;DL=%e^x9{KgtD2&gPf3Ev zz#D#GDVO7VfOz?#2+7$<`0@=}@(;70(y9Hbj~JChmIvc+CZ!1+p9kSZO23wPr2OAm zJ43g*O}-P4{pbcUl21qrfOrOoEP$QlgKGj$1NN+0W09W9R`>ZLky)uXH@64oz|jJ{ zpccP>y)G#R!RlJzTbh85!rvRd^l~LUvTiZPLAN#lUW;>nViGEf}~l$@zQS_N%I{2cNWu zj~C*dzt}dfpYKvIdu3);7G*u#vHR0yx{vs0p7s|N1-saS&#)2CYPMh(cX7qN)T^J$ z7yvt+-2VWDRE|R2Dd&LK;E&d;n9r2YRY=_!9l4~+?ycC7_B9;4jind->ZMiKY&M?Y zlSjk7DpEn-iq}2~y}wGj@aP5E z7nxYuh(JSUWqQ+2=bD!^(s>ST9wQr)G)tSu1Me7FBvQ!>k;2GU&#;??Do7iJdQvm( z=Xkm8=8nQ@m=Yz56;wrABF3Nq2Wt-iRr-K|woTtAyo^4s(-^GgO+AFvd2HE)0JOLm z@zK2Tk0qlGxqop7;@kD_azvR+fEo}_s#@+Y7$hB^0dt(r*?Ic_`JGkTY zu08d^nx=#4eofc;LYTT|tZ*8SGXmE+a4&|&ZSq^t#JdF?u}gWiZ(UF7=TAB(qH!HU z>RzkE;C{k8eEU**H!7P(?^+^^6ee15_sDt48@upCNcoc z_;5|qDG|0`Xl_MXbr}eb)Cco-tMWu56;Nox^BLwr}XIp>6IILCuA^!k0aqhQb zJJT{$zPfdbTx5BEGpAh#(>QGRsT1JKU^3}RI4rS9IW{jg9m*z-MtY!;s!bjgC$OhL9$75YLLiF=R^v@z1 zcSU3|;IQS)v%0fME+#|yrJ7eI=8*Y!B>n4{{Yd>hYRyNeu%A%BPWjFkB}nMd9|-x&!Hbvx<9R} zjM7-#vlFHDzDzc1eGi@4aoK!>yQu9v2fEIeRs?oDS4ECZ(u8+z2egL0V#@{AS&*9& zEI{o-C9(Hj_uz!wf5Mk56mhacb|T@JcB#1sw98}To+#;RU4A;I4x3_i9*e_EHfNDy z@Y$p=Vc%=wW5dj^G$ZGHKBC*r?OSdW9R@cE7Gs55Lp(_&Z7SH6U>IM>HX?>cc$o>9)4TFr7X(Gc7DUTs}4tH zED7vQtw*#Ng&B6Y1a~zQw{?@Zf+=jrXeK^>-RO~v0;+BL&_?ZHc?(>309e(DAmpnX z{1ZdAOZU0BrA+gv5`fXeUHTuGDbGddjsCyC=_i?#eZ8-GcdRd z|~m>y|sCe^%%6kD(tqZ0?R-r(P!Y0vDN5es1BO=Vs`Z~ImBUM<-jfFy!=@8+dbN@Y*srN}oR8(a3NM$`F| z^vY=+($>Emu{DJ5Oq);}?zg(L7+h}MO>j8yS7X`;Faj9 z<}+X?j{%K!46shou#QU`+$)u9SoW-z1QNt60z8{v?^=cfsZ(dYTgC>w6Dyx|vdH_How+3ZSPn^>YAt>BZL6~lAJd&g@mn$4 zj};l)h{53GU-%ewZ)BK&Lo;qg>`iTdSUpD6eI)v3)*8n};#o7l?7zU|Qe53J__-4c zhhc9kB+A0y-4)6HtGb`1{)m2)vJa;H1*!1Z4O^Pzv1EE@c4(L(41g-)vpMH`h++<8 zk)%H6c`Ux}M!z!EuQ#mSHva%;Mp2BH>3UsJmgt>Jig;qnXVXwRU%7uc943FItiParddmKw zGfdA5ooVOQM*)>-tilI;K9h$T>BWb{;6#r5XA^+3zhaYnHf`tW^nJ2>h`sq1=Jm~b zxi)XDx|5_jL#9yv9}kE|+!Mtx)92xkoo2D+>4nX)hH3I#M7Izar*paR?%+r1xg}ZDfqKM?gekcGW z^!76t`3eo~f7iulKaEVGBNQ>1!jNo1KjlN~J*)s9d-kLkiLAj0UOmfN zQU3slN<%YQ!58nhpX=s}ej|B591wi{>qFLmQN1G3I;3bEUaI_FpewlP{FezPHyESF z_@P!YUgF#K-u2^ZPpfX7Xe_*Dn)gj>ESn1MBN*Ivki{5-5*0%{VS4O z7Pbh`w|)s6Q&Mzsv;%(EtxKn!SkOIH%bzsR8n+3V#SEUFB_U!Y!^k)(ENlbD!{LB6 zv_!!7Ja_@ByQz@hm@re%-icZ$$MF;ZeBaF>9iw|F79+VdMHsg2pnb2!I9V$%7e>9i zfNIRlEQAB`VM=aN@MyDp6D5BrX#9MO)u}9-SP^c-ccjATeCIEDZSFzA>C3noyZsbwT+3zivZEB{sHESK_ajS-HrI>)SO=_wo};O+ePJ8iX1@^`;z?e zb3uxD<%sS=PyU|Y>qUh0f(tEy_!cz0K-^8s8+M@z9o+6G>_`IC(ds3ch&=gQQWVA% z+s9&0YA;jNk7~Z={{TAFrvw}!C|1V)2LPI}#1IUH zO@|%()zpsac__9#A2$A#q4Zx^=>2b;>wIoerDw@=oEEBlzfwVpv6@+M@g#VBM;+pm z4iTdxf~5Dct>#=&a72FIdx6b!U23`~p}N0OeM;($Vlu3veLRtB_QlA3GH|5+7HHSZ zfIN`wTeO~{0mv0ev0l7C_JBj7^IxT%OQto4P%s*E6PP3ePG&iXF0GqGGGZ`sq9`vR zX`w;2K{h1X!m_#}uKu5Xv2?yo)jaz{>AZfd$?(60&GM}O04j!D$4_Gp(}=?~b1$h7 zG7ZXX11VM=>&NJqPW5M6x`#K_CtmcFm^WBP8>bpiH;gmn7!twGE!U8k%tx`Dk-9L7 zg1{T^JxTgi`f%$OaUQ1XPeyWV$2ExrX`7f{99tka3e&>NBdz(f6Hg?-)U%bkksQd7dpWkQe5#hjn% zlSs~(89);C8&hSk7F!CR{$>^j+a^7&*!v>n63hjUp`bpD{+4=ennj-Jeu`xuj(`yk zKQ;Ap31Yv5Y*WZ%{jFU@xdQSNz}h*zfbq|YZ|Wwk(q58eeIm$b%WyfaJ2uR799v^E zy+xc)>f>`vOLvx2`BuWpv7iWw0;mJN(TR!n{{X`V{xAMi7a&;~Y&@RSDLaO=pa4a# z4QG3yOB9#g>T%=|+Kc##JBxhUmx!Ijf;Db!+SH_&?XfLu{Bio#3G%oi=Yj_tDGuW0 zY)SD%(jg|%7au3ZP+-7W2)~A{4ZywHBekt>H?9-YTnrlL>x-zm%Rk#J+7~0rbpAmU zfPe7GjES+BnNyzf5{ON^M{ki`-gQ|3RzS)-f30xNuH_v~=yzH1Us7E*(75eckmtEZ z9|5nlzDnwG@wODd;j=6xY(SaTH)y1a;IaiP$f|gKFa4p~7ckc!Po_45ImcufUT+3r ztTJqZc8?X9WoVKK6*haEM$H`M0R@BvbJ+WTPMrt(Y||Y&(|U`gSq4*`LH&^fW!kF} z1~V0mjHeTN^6qP~Cg2fn))uvE8jI@J>3gjjU;W(5{;L~6=P*c^l#?5XT(2>}$iK-n z7}X0R8`+~^Re=`pMve60)UJm8En@X{QJj5VWIEm*OP&7!Xk@xiL*ymST{EfmQxAv2 zw4i#YYZOwb7!m;7Y0doN7E=CS5)=($905BO&5>LS1lh2eX7bq-I4X!iP?M1!45IqRn&Mhw8Vh zF#iB+Lx)^@wxfKw~2{?XOiq~X0mrm}KM31U{@<0fxxDsC3V$gmZXzeRXw!5lVq z^*`2Jb>8M#HQPpQ&4r_hNBwJ3`U}uGE|TguTm$2CIdfbeQh&08=b5zF>_E$)!NS-; zWSNN}gpxQuZ*IU_GEZQauEEi+iS+*fp&CjpBh$Q`!h{ybW>}~7ak-4gmY)?l_s=5} za?DS_umDyLzU#l!u344Or}~A|{WUgc!Jj$@zgHGde zEKKi)j~#-W4D#XL&Wj=xB}nW*YlB}FXZ>)W>6=Pq{{TgL(NPeJCYKM3 zP&TF$5sOi_c4fBZEY6n>Y-^`<%Una$Jr#r1QQ$udG=bvBVB{B*3yF!$b3%T0y0HB% zT-)gz?G1yHMOfug+$5fvlzfN3nr>q;)Z${GF++Cb+|yxn zJ&7aDzv)=$${3@!o&ZvBO;_AUrpNSiYR8Rf%OFRvJP#ElyC`GrH@G6H3}JhdV|pUd zpaT3iHl=8T$Nj(<4mtBc<;w2br}nE>MQiT|>(&2=ibwZ&r978$Q~05SMmRjlPs z+0=kXe-#GXa1Hw!t?XXx6oRL@s%=IFL$vx_ABOKzlzk?$gaF&IJ?c|`kJUE#&z3HXsg>g|Ivku4fp^c!KeXF@a>;>&qJlruPV&Kal3%837 z^xst^1Ov#WxN`SZgWu__(+MpcOLIJFzG=X(pEDmkoq zOi`W2PjDXH-}S1Bat(?sp#8ufG%^U3?XVxKP=2|o98!gAa8ZM(|7?;&JoIUr&klAs8BpH^D4EBb-!u0f8;w3bneIGqdAOy30X%@!s%Au~+L8;NEkn4z&q!QIPq zT^pqtHm2$yLbANO>K`S_GYr;jGsl}@pv%N~e^F#~x<_&&HUpGvc~-TJWAqmtnCaZx zRPN^L2#HQ1Jed^d5q}*&pAfDV+A)QIM}}es4?51}eN{H>z>q~= ztlCb0r1W;MiSXLDN#%KCis3p|_z1hZd(@_F%EPfz;kqxz|-aoT@DVKYq6377GS)G=kOnOnWT;l+q@ z1nfNeVU&E)ww$car}c|S^u%TPJ|szu&hzQp52p0~41++4$7)M&m&n;Zb_}9 zFZ@zrqZrjgC_(EO{{SxQb8of#ewE{4G!B} zd%ol`1TX z`=xSxU9WHJO#Nl!Smc-U26>v9}5Ioc3%W=Vd05mf(T;@k)nVCs9wMT1-t+%dyHX=UcZa;b;#nkP4k>9bRRfy6wChfPkd(nxUaCVg= zfo|WWW0?#4eMUU+Uc;aI(*%kX65RH^uWFH`fy05c_U832cCsXP1Cehuu+jtVg={-A zp8o)~6mFqGJK815;w0F26^fXVJeFkx zy^a3>=}rcBs)4~G;P)c2G5DWLgiCTg!Fa1_BraAqBpY7D+)z#=aLCp-9oYDydW?${ zj~cT^Sa!L$AJT^qWtETdSw*jVTo2xY1t_E`Ad$+799|ePR#zt87n;{KGb4{+9;4s> zecmd?w(yoW;{DIwl@pDdBO=HJi94yWmXp{`l=2N96>#pUVqnq#0A1ZS)tZ`k@c0b( zMQ2)fF2qVKtC+O-d`d;Q@ES$<)Y@$Jxa-28Gw>hn-1|x(9MR# zCn-EKsofN+c@C!I^dwg?gXv@HM<FC$dzeXQU**;Cw{b843*9NizxFI1JtW?sppM}7{STpU11Gq@XAQJ5h~pIw-vuk#2$Yx>l>{qj4}ae41f zdj9~Ta_pD!0rLEhGSE^?;vhfa%R1r%F(%h#0>iNJTkeT%b&AOqdX1Llcx=smlRig? zl3Xc&x$W9Gt)R9IZY5>bQ&ima?aAr!DG3lX@21?^j;QOSpJvr4;f!&|Yb zCJzfMNjqRLvb(5B9pX~Xpxgp&$QL{wD3si4+Gnc0E!G7;-EO61IiQio)ywmUXD0lQ z_-uR-e|p*0A5|^|!R&3tCj*q^`D9Kqysr&|c07ze86yP$0QP}dYcKG}sN(j$lw4on z+MDY-S8)?r11I1Z6-1(QVd>XFpxxyPU)q45>-IH)diT41-Uij^yen)UR#-Baot_& zUQd~<_BdRxBGaFPhY9DIWRc{U__^9V+P5P-iigvP18Zypy)4L*J4U?==^`jtkyHgm9hE@f549#{Dm_VY zD5|`MQN{i*QaOaKx07|dZbCVss>}7?aZSzt052VhsEZ-~DCWZU2bvrDsp@)Q@o+)C z5(P_G*d9gu57xDe)ugBtHP6_C-lwRp`&LWe!4|5-JSr4zCj4ACV^L(1;IUEUT-xu&7m# zh69^-9jUT_#@^*8ixGNX;qClXDgolad7|1CvFu$W;P>}bakk9TTn_uVxT0m8ju?He zC`#}dq(84Vy&I7Y7@}>C+~2oq8?&v%fZc7j{%Vp-u>p?J;4NE`{msJPHX^BY4)YDA zTWB`AExXl8B&asLYFohPwE>Ve)3@9>{ptzJf_9z2^I`t9$P8J1P(e^Z`8#by#47*+ z7ZD>5s zG4{lNh^FJ(pm+U^Rt{~>1fhYj?!W>1P)zYOcWy=PeYHtEMqf>2+DPqkYdSMJ%xM>r z6!HAP+VqItS9|Rne&*Nv)rlkt>CAWExIK+3Io3&RtK)?n{{TulnMEA(jG!OPEl8Qz z65t-+nN9CbX&5N7ji>F+=@MbfNPRa^xN>dZ{`IfouMAD>H_YvC3ww$QU-*QH3n;f@ zDT@sEB<7fNaf@nLvw09?|qlOxwxRi?g*+mBa+s&=tH*a z0B)zAK{a3Sm`uvQnQeR9X(Eequ`UAM-!`ExSr0w?8VMvV$$uOT+*8%*g_Vg?sVv9yX0kXQb-c}PQH z0+KIp zwKg@4h;YgW&faSo)>lBg?rtteAGJCs3XCq-@GZymqWS|kNR-_BZ@}4c`_~w{VL{}mM&DSt#B%$k|$uIPTv3$58kUytccP`fNnpQPd?LYRht5l_b%33-?Fi(B%YVKjmO+} zzs&1o7{J(PUR01^T!9ZWf)wz7En+AaX=Lq8v=R!hqY8qxkmG2e{VhL*xhbI z^T{UN>sW$4D3@`K{{TQqy;aqSAhL^E%xZ%Gmo9t!aa6>h+Ogb|=AI9zV|PYFAD+lf zs6cW6XXJ}=Kf;A1e$5%V?`~~ERl=7<($}y+?Hll6a55-hs#; z@giWr@Wk*bh~c)fDE$u<3i03Fxxc8T6zoabkJx@vJJO|-eUwfvqp$?to+L|>hyeq* z?`lN*0NWWi?{KxB^$H-;#;mJuIoxmiRpLPO_YkK2h@~N&uIn%>egh8_!tMq4UgMG8 zt2f3;+ua*KqFi;D$PUP3HF@GZ$Bi~635#(iUEaJJk> zBkfe5+Ur--IF761@#hznk~y4+V-CnDXpIt@wA8D=NH*qzN|eB|}^Wv9-W8&9!INE=`Qjb1fV6@zY%EshQ?g zb<88vg(AzajtRO;j+BVRoFCz)_9u#9>L1nIxpoIrVEQGb^E?(a4IIsc%XJneJXCwG zcAr`xps27nADfF-vf$TP!DRS6r!9jm%RNZ&@IZX#` z__f9ANVNu+%yE10aAKk)$my84&4A`QTvK#@1w+@i5`S6T91U7UZp+Lt5DbiSta zcebC;Rb!G=02Y%D>PljxTiCK5Jb_!r74D!(`hVVz&(l|@NUEai9oz1=HBm;MnKL!p zcg2XUH%4k~#}U?zZ=thn%1c2OSD57yIpJ`!;ml4`{{Z{K`@ZZeaspVDNnO`#gMLj` ze_~w($zfpcYxpFVO zaomsytBNrQR>3 z7d(sH3S=yWi5PpP^KokfZ;AzEhzQuQ9f4|6u~yn|^ZL-F{-J37GsVaq`Tgq5Q1Y=Y z%pmT+9_k(oZ7!sqEI_3uEL-@I_VS~f)RI`(Z6ktiJ)DC|8lxrl#s<@17qwCZCza$L z#?pA@f9pb2q@JNux3M%{Mc)*$#2A(& z-up@7)hbA;2HQU#L8(V+{#a`}f;Vz)&o`;=YadZ;-`)eC+M}Jv(^ea;#mz-eaAt4X z_cZqc%d=njfY|p_-k-Ud6qe@Kx%i}{Vp2AhYj`R}5kkl#y^nFnYQ5_4aiA z!l)iilH>cM;)h^B3f!v zqiGlBkK{EFv`#nh4+=g%O16?$Z%vl#ZW%oP07?NgavKr4-IxyFy;x}Pe^3iv%Dio> zP~LyxmI&7JN19))85b%@w{|ovT~6RGzXpOreKN?vdAj_0`%$~mHMI>o>|E^iDegkYjPbiNVIs6{J^SOu{g3_CdfbE&&y}EQ|ST z=Hg_%9ZMov7 zP5Qq+tj=Z8dfP}(r?mt)VTg|fE-E?T#=w91*jdnlIu0*j8E!5-*3qd>nv+iA@Y=Hx zhKnr3VV(?O$I7w7(Xy3gW^x6HBvB>PGRLWbSVT)aC0o@+XL7b_4$)$5=GLw$^^cnB z9bJggpG&$gP)(L%`j?!|26vcXMis@y0e^$nLu#4dc}|uA8K~i=ef7G&(O+ zVRLx!{=+U-T3As}-7(K|NXUaW&^n7J%gYcIF^et}6hI{M z&k8uV!XLeB^V_V}=a`O_eJXTPS+adC9#f`t<`F$SzbU})VRl&5Dvnv%*+%2!+>k4o zY2T|(xo00xx?`jHm(v4e_zeF54K^Lq6tau%^a~Y?b~ZFTEiKyx>u%k&S!*3@fprRgvR0`j1a2wLXO~H zu(>w-SB3Rit1I%5e3GD(ZY4@-C+79?ktnDDBXJ}a7NzpKov zqMH8zAN1$-C#9s&_$-!4uo@p$;^3HNS^f?*2^)Is3Pmo^w+z4%PXgSZ$Nm>TlfIol zl{TmU0DDdfKga(7XABXSoyGwnlWp(F+;3irNKtl#AfCW6Ad1)Y4!+WTOVfi^^!q!D zHOiY2BrxVUMkX1GHr6QL&bPP>I5svUSF+N`tbBq#d)95SsK{9&ET&g+yNmt*0BR(T zFhPvmTb^qb@px=J4~d#ZNYE1UNhN~*r1q^xQ+-Bse@DsqT8`!Y^LU~mXa3Kd zb3}XxLuNz4{J?pwk!8iKfE|HLdx<~i@mar`u;w$W4XhOM1^a)6M35r_$`!xPgYhGA z7X^=Dekv4MM{Eplp+UL7Eg!a*V3-)Q3h0O?ZCv_2kdaqbrGC<7>KF#iAnVIZF0 z3xDlGUO-DHdIt#7Sf1B3M97WmCejGtG5-Jx&ix#rZ&+SM zYc=jh>x!jeviptvfDIq5y!-5+^1FOe(pX;bnJjy7DYse_K~+Ek-tTD_t94Dx)>HBT zwYi}zhyjs-v9FZ? ziB&-+LT%UzC1_p!L~YmP6W*9l3n3y!l=ibO?gbcEYXXW0`14rJD-a1lfAuxErZn5v z-SNerkMgRcOHLRz(X<~Xp;6?M`*t*v#gJ}r4fvytfF7Kjk@uqdr}(trA96`Q%SRi8 zJKb0Hx#E+&l6^u$Ti82+R}(U(=62`)VQ>3Y{{W`ib2jE12=CnUP)#d>1lAz=6q4w& z0UO@qo;d#iy;913L1S=#n%(}@ozYH4n|9Cz&zt$H^$EJjRY|`WwJglB9h((LdxOu~ zs#yb&R01#C%|p0gHoN>U8_k-*rI>4a^AA($+M{$Zi5bIc-7zjQ7gsG zKZ(Di@w)UYqnR&3dTWQ#`C(~u37N5)i#Ei*`Lj&MPj({}E4MCL?`xYXg;8KDPU#oc zR)OocSM^^=^xmGwHXBdlCCl*okf3}9Z9Gw{Vq%Gu5DF}cY)#x;fniy{TsmW}+RLCA z-7U~GmR#2rnqec&aJVeSJSHm>mI*)jsBrU1?21=QC}ZHYaL=JWmv!4O%C*NzGTe_T z>4s5}bvF}>{08LBvy3BRFwjXHQAmG)phUol$dIHUjep!~~*_Ik0@~Yz4;N5-K;G=`h#nDZTtzNc=`dQOCUQ36=^{+jfsM*@? zIK10ZhMFlF{B6U#G;x4C06tHe^7A;by?yFtoYA^hJCiZf{XWz&=Gvz`mG_KZWrjyw zE(KjcS9Ot$(v{(MD)3snM7E3pAhGf<-mSlw&o_-rq?-Q#B-QJwG~QK`$CZsGs&N?` zU|`sxL`fT@n-p0VMUXm=?vQKB`jhC!W7Yj5mtwSTa|Ttbw61d&ccZg;q4guf<6;DC zkwF`wnl^Zxe|7FTQC`AywV3#WrP{#_5UHTFWh5iwq+y3282e7l;RHouNhS zIThX07c779#kuaJi+$`WEQUa=W;}eK{JkH`{AbpO(;kW9vMog?RJxz5Ki+L!h{O6R zjW~Zx36(;7!GeU}(L?;sNs<2mnXScbnx{+Y?Q5p94I!y;G2<{9juuQlFAp*Ttd6Bm z$OgpN_&nE7t%~trRm-~4xv*Mp|u?NG<$h?8+Pty$_Q zYa<1btXY7#TUxk3(KK>r*p908M>K#YZ=UsMH^O3GL%G)vfMvpAp(DbqXh=|hoS!wR zzO$X<+{67iXR_o@`nT#UUgkN=y2#ni8!(RwkVrdvcvOtUBfZYY4{=~gwd;D*dGcWL ztR`2ebv9QfXXymR3^eH&oz#`wv6i^Kf!aF~MSS=5;iWV_KdRb0H2Q+hbNnw&^K7#b zl4dykuQZnpgUhoCBv*z^SEtG>qzKkibsI{XUiH^B@6z|vWx z6`DYx4Xm;`VtBE*Jol|x{{TLQBAjD+owDLj;KYpwaS3)a;N zVX&~GMGR<>ji4{FP!I3`3gw?j*{(NO=v_h7kcDu1pIzqpj#li}65%~z3{nmSg9vvI zkU_sSpMMQZmDHwJcL6v(!2`GLPQ#?AHq6)OfPO0;RcDYDWBGXjxWCOk8RI)lyO^)# zBaiDu*%#4I8ayY{l~s>Byj5MoZEzoeZX248>_*m(P0xUT^7TwT;O#6Aa8DIp+YihE?N(iY?qj7~9A` z1z%72V3d>mK)~A9JX}=3Y-*LatYkMpTP zEV8RAgaYI9cNHr;j(@57-quW*wO``z+{E$`yMDA#NE>N4u{_+4DNi)O7g7%4!5oWx zRqP*@UA!BGTaVj{)UCB%dO}r95PM#r=u^ zKl65`EP$=iiTMCq{Ob|sxe=oRq<(GJBkgK|)UMWI#XDR6wR=k}l#(!1TIceSdIV)v zvo*jy?Q$tXQnmpsJTM?6(nhaIjivX6jC=G8%V4Xiicu{?1~MkW36 zaDSTg=9U=d*jSKHe~+~@u_otN{Km(NlW+5{6RI6H(tTv<=5f;fX@mS$Rh{5l4U3L8 z*&>2LS4SMHqXl(g*_0m@?OcLMJYK@*xBck1$j4zlhdgj9@X5}&W=W0u^66{?Mq>JX zrTUYC!v6pZEY&~nD9UlOLZZlVkh(G%KmaqwY{%VhO%7G`{{Yuss%M$5sq0pAy-(&BOc%~ovpB#6-iJRcLKY&s9AlIGn?Gp@k^1V;H;o~z1JQq zQ}tvy@q?rER+G@0X9=V9R!4`*^2`JxJRTDZ8C69C`jUH=Hze{&HJs8ilDpQ!{65ub zGcefT+rNG-LfE0mWL8!jt1amDEtyEMkAvRFiq?9Y()~Bptu!>osLZpxBnya1p~U1_ z)Yu8qMeS)JAdo-0ZVkIu#M45C$-uv0DQxOVDvm)nAhpNq-r|oa<#X*9(XOI&-LTkA zE%gtmGd!{qM45K6!o!)fDgOZdk?G72$0U7?bY+=+A5Rfy_MP^qp)5K0)HHu`NwQDuKAhrk$>8wYy*budxPGM*1w77?`7IW&uj22=Urcp)W1gk zZq(gY#$phH{!n|?zc$7!*C*;$6D9hd=}?EFU2n+>Pk98%1|K%dvC%Yat%k;7SpNVL zCJo5Cx-x1>k;ru60l91aHohD<&W2@ka) zi4-cR9smFe%oZ(Rp-;nkKVw4BD>*Wj{f}zRw8x~Ssehs9hnBUyb?=g!m0 z{?#08m(wWMBExmSH5@dSc3^}NVxzqqaecwMr>VK6=fN%Br>fu^C{+i78|IY7Vmp>V zSoc@|0M06wV<~Oqa5&@;X_T@(LVc1S*X{SK^wn1BD|6Ueip6paV3xhSc&k?`1*9Zj z@`24|92wriSrhD5gd|6anQ!ESdr*me+Y!`!acfm6R~!-;p9jSr-9H8p@K$1N*xJ-D zVk|(o@@lsw$}^4L4d{S2u`BWgs?A&dgfaqd!<&oqdL4xqa^@#07_>lrTU$TB>Y?Esl8F|S-kQOH4C(Wu#V*X3JBCYU4d2~6|Ufd zEXsjIug_ugQj;i^0A-o2$SZF3D9X?3er@Y9ThdaS?l0P)W@GM%-?2Q_Ih2Pi4&dJg zuhmgtX6@(os+_fwuEgv~xl_%@HAUquv82C%NU^1j$bF1Rza-VG`ouQje%A3v&Y3ct zjHO2R1%c%M0H?(pIsjQi8}M59tafrghPJt@5tkcTkKbswYNt%23$^`(t^1l{ptq`7 zn%~RbmF_2kY^ROw=l-<9z(=^S0>btN^{-6qL3?f`Kpz9g$)iaKGX6lnzXS@h21~}GM|^ z)?)2&J&j|}Zhyw3&u8?)?YC{!iwv8V!NDiL-2Rkbide|It%n15gGXBBhBh&F?71g( zhTCyMXMOkFt;Z(R4DrZ?goJ{4+6OgCR9&{*_8j)D9fz^E@mfnC7VS#JO)86(P$b1Hsq(?qP>ZLL`{cl(7fis!i7?7NMGKU z_>~6!t8s7(4hPR_GF2uT&t^Q8VApSXs|+kyxViJ%^^VMUf@KE&e)SF15L*8LziOL| zp(ggazQghjf&FN08GF2eiSkYB7kPHv7~1?2-Twfk6HYI7_YvOwSk?ZW$jM#?)ZOvP zqgN$EG~A92iRQ5*#|I!OD&Gz-O^#4k_>%+sRX@gUr^|>Sjjk9E&B)@RX(dl-OMTCJ z#$$3-2`2p8;-QQP!=sU7nA&wVH}Vui*d7y{`9+;$#9Er7dF4!np$E7%P_D} z-;f9GRrsV0>IsJ1^KeMF{(qewt2Awh7dM2j_lI#+3)zbiIq~oD!3{L+uQV_ zhG)NRipRmfKYC{1%%-%i&%!A~-`&Mnb78a(&>Mf132@OHckN;aKY9@%waF&@kN~|~ z*GOw3FDiU?+$zM@7TiVt1?@`?mMTTdayRo(`tjN$5POf!;{O18uV|>V*p*TVBZg(U zsQaXh6L0?jty1r~5)KD&7Qoe`uwtsB-R?NGUHB!G8%ql#5y-Vtynq#CB(KFaq9HB4 ze!!0umfWlwIYQWePfe;{GacvtM_+&55WzMn*RcaD4I& zW@*qV#0xl#f%Y64GbF8LvVu<+pkGoW{4K=T7P+c_S8yUB&&P_?T+ANX3Wz+=EzaF^QGf6&Dw|CiLZ!79oHwZg&Gvn0jJeiBo0r zK4{f_PzLoD=HY7++lQzwp!|QWNZ2xZiEzaC2faOu)?}+Bh#S`fo;d#i3R>M*7nqQu zzytk1dQ!|W3Axp_lkE&Ve9@~ao#EJVh zP@IFXoEBzFG*S~VcpO7|Wtzvo%iF0x7&UAH2~g&t^? zRb$#>B&oN0$KJ=-B-%i@Uk(Y(_Grt?(CXBv|>C;KBx z>HII^^9*4A_=pkd#x2Z_RYkkeeM@zz`UTPK%cvP{Qga;L-W&#=%EQ^Q*_I*1Sa><` zU4cLHs~Yk?pZ=NGrn*-dn)L%w$)D?eOrsI4wKJWQ%H1=;MW0_%B=5YiE4+~oNMwa*E?_S=L`sC@p zeU@Q0HmcA%(@13a>{!F$^W9UCdN?5|;48|G!YiHuYbic!8>;^RQ`nEE+|xA3vJa*$ zQ;XADYY7%JJJeZXVX(LuFswI8G+WplM$hI8X1F4{)ER!8)OtyB)WPAgxh7?S7KafS zcySO)yR1~)6=2Xy>ld+I^uAXLQV;<5C`P|mx zv2s?Y>Q-=`J6h{;$-kPvSUZZ{_$LV@Rw}!YSvQWjAs4;2fy^JWQ!1zG==Vf@P)2TFv!T;S&g{mPc^LS z;inVr*>BL1=A*v;Q;}nEK&*C}GKE7Qu_A!87X&y`Ma|ED>skF|qfR?P-*JBfZLLG= z8~c=B;ZKUknn~46m)pR$-e?mN#ZL#0LEGF_E;Pt_0dLMl`!xi!Nqxps$ob&bJhR!o zt`m=S{!I~;0tEF1_VQ~s{V;CIz?%c`K)tF`Qbr7U7Po8EqT5{T{Qil8bqRJ`{0q@6 z(Sx)hE#!*BTtV7fNdH{yf#VyBTsj$Lwh=r@rG>Cqz)oC9lTS=CGxm_O{@^01-ijkcS2^3wN<`{{V)y z$ZODwPfQ6GRV0gE{F-V?UOkdWaoWb?kJhmt5JLti0lme%RY#2|cT5JtIX3>3;b+G2 zg$PrSZMYhSPI)rpaqq1=S_UwbYb|4>GM#VIybL&vU!n8pbGGa7WL8P=g@N|^(6gW?joWWthe5uj zdSBPyY~zy1FJ&pwj1 zo}1}jk&{s78Ma*ceAo;%nd8Gq+i?=cx3rQXZYq}qk@78DU(@!q(c1T+`d?Ob^Dvtm zlTVUC9tvDcUYz!c1SMos`D6@?7AtXZu3v%PU|k2AOPGM1D*h$~h@0_!_XE#*-8zjXX@byM z=08tj-w%z0C&f#Hl_3R^RfUQW4+g{z4;7~LFQ@v*XL+|=`mu&=KBv@>$A^z8Oi!sE zQI^Ea&|v}WUhG~*9o*ZHE2f-28yOM8;^QtENRl#c9Z0bRdE<&dT(L^xeG~e=={}_T zc+(wI>MvIG{sS3}$RM9JT*EekIZ|*ozUYHo62O}Q=ZaoW_4)MotFu4sy#a~T+L^9Y zOQy7jHx~{3`@#kOmFnpqpnsy>4V}%XwEqCpwx0ZJ$Yc`Zu&szNvGW?rSx|kH0bOe^ zi!aNv^vm*WJUDzjDiI;V#v_dscnY=xoBsgk>_7E=VCnqY9Yd4BoME#3W*IS2hg?2k zhG-^B_-NnUjq(j;fKiVQZT!IVO?Fmq%W!!d_x`n8x7mwWp9Ead%G`l7OZl2z!@0QT zi+PL&9)ITG)-3Wwk_(Wwz1#h7MIIq;2OX|R?0)vF%vRP)yajd$i+qZN?-z}%K_d2` zU5ooP z@viW!2J`k70)}fP5e@9YugKiGMK&v(!HaQfb3gt;08=DWe+Npg&8)Jev;GX7| zU)}si0lxld8cmKbC+oMh6~9-AnIf@~IW1tsaZt$|n^-lCxVtQeP8h z1ru$#{pgqA{T(`)BRhSJdwtDHL&(fMKtoxtbLORMbxg)Hvr0ixV}AGVMH}q6DsFp{ zZ(eI+!I&v>r*|Iv0a-HR7Y`VcTM&4<)1S&{%Wj_2qZ0d+5J$KE^w{NAUD7vh;5W^A zSc$`p#0&k6g=Jw$^!dG%i*6N-?jM-+K~CyyZE=3b^{f0-BG>>8``WP8P<~PiD{`B= zP_&O={;6AkDdV4tyk~1S5hT(;O3oYnDRDG0o3fQ4a(4Hid_h#)$UVc{qp_fm8xW8u zrLxC?+2FAd0y;3DKUi>Wsnb*2H;V|@q!&CZQlUX%P~(+hFDR{AZ^F(P7^Nc zM#P`_hy5!Tb=vDL;yiESt>k;}jzG-6%lGY1_^4wk>;&+C(3ndtA+9#w=GJooCaQsS_Pwm4khtg-}j_&a4*BloM& zon8L`XLmq7OczZxPLjf6Nwo6iUZy`6F(B|}0pxS`-ChEJvp*k?!!l<5UCMI&#z$-B z89so^gAjSQ@uOzB{{Yonr%t|rI(wk7>xk6dPS%=(7LtctRN2#Dl^ftkh1tg(0!SRz z{{Z9rUz`3q$4CvC)ypNqNJ^chy*X4cQ{k;*J66IPHBiy1 zx$n;gu*Mtk@W+ILR%Ap~23KZc2NxugN#nUUG~ZMz`bzt)&lkOOvR3~9!8SVM_^d^{ zT>1Y1T3X_m-N3#6Ta#2}j%2m0ZNY9oPH9lGUuu(a;g|l@e;et^8ByX!+ZY=E0L>+~BRhdNm@}+N2*K_oXb+>;rdk zZPq51@}X-#2m8bR)t}WYkg7Zr`_;Rzr*O9b*ly;r+{_TN+}pQ}YP7=$! zk56#7a(qydh`e04!8EBcP7`;g+_yh!jfhiWYq9yF@~NX)JtQ`dYVt_!Rd!?Se*LY@ zPs9mPLxM+Ze9%0b6WYS}>Pv`}jm>o+_#9A6H>kH>N%BPtNRBp4O^4+_A8H3XtWrV1?eST=4O_g65iD#i YemSX1c?I@3vGaPAU)B8I1?A)a+59b@tN;K2 literal 0 HcmV?d00001 From 1554d4be8cf1a93e2ccf02af435a877d0b393d42 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 13:09:56 +0800 Subject: [PATCH 1039/2039] Create 969-pancake-sorting.js --- 969-pancake-sorting.js | 41 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 969-pancake-sorting.js diff --git a/969-pancake-sorting.js b/969-pancake-sorting.js new file mode 100644 index 00000000..2404c612 --- /dev/null +++ b/969-pancake-sorting.js @@ -0,0 +1,41 @@ +/** + * @param {number[]} arr + * @return {number[]} + */ + const pancakeSort = function (arr) { + const res = [] + let n = arr.length + while(n) { + const idx = indexOf(0, n - 1, n) + if(idx === n - 1) { + n-- + } else { + flip(0, idx) + flip(0, n - 1) + res.push(idx + 1, n) + n-- + } + } + return res + + function flip(l, r) { + while(l < r) { + const tmp = arr[l] + arr[l] = arr[r] + arr[r] = tmp + l++ + r-- + } + } + + function indexOf(start, end, target) { + let res = -1 + for(let i = start; i <= end; i++) { + if(arr[i]===target) { + res = i + break + } + } + return res + } +} From aa13f37fba7e820d9e55fc0d4a88560a22e7f5ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 14:57:24 +0800 Subject: [PATCH 1040/2039] Create 1257-smallest-common-region.js --- 1257-smallest-common-region.js | 40 ++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 1257-smallest-common-region.js diff --git a/1257-smallest-common-region.js b/1257-smallest-common-region.js new file mode 100644 index 00000000..304e4175 --- /dev/null +++ b/1257-smallest-common-region.js @@ -0,0 +1,40 @@ +/** + * @param {string[][]} regions + * @param {string} region1 + * @param {string} region2 + * @return {string} + */ +const findSmallestRegion = function (regions, region1, region2) { + const hash = {} + for(const arr of regions) { + const p = arr[0] + const size = arr.length + for(let i = 1; i < size; i++) { + const e = arr[i] + if(hash[e] == null) hash[e] = [] + hash[e].push(p) + } + } + + const path1 = [region1], path2 = [region2] + traverse(region1, path1) + traverse(region2, path2) + + let i = path1.length - 1, j = path2.length - 1 + while(i >= 0 && j >= 0) { + if(path1[i] !== path2[j]) break + else { + i-- + j-- + } + } + + return path1[i + 1] + + function traverse(node, res) { + if(hash[node] == null) return + res.push(hash[node][0]) + traverse(hash[node][0], res) + } + +} From c74ef858a3d0c2a8598f9173dc57d90130607c8f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 15:28:29 +0800 Subject: [PATCH 1041/2039] Create 1492-the-kth-factor-of-n.js --- 1492-the-kth-factor-of-n.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1492-the-kth-factor-of-n.js diff --git a/1492-the-kth-factor-of-n.js b/1492-the-kth-factor-of-n.js new file mode 100644 index 00000000..e6f49916 --- /dev/null +++ b/1492-the-kth-factor-of-n.js @@ -0,0 +1,25 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const kthFactor = function (n, k) { + let d = 1 + for (; d * d <= n; ++d) { + if (n % d == 0) { + if (--k == 0) { + return d + } + } + } + for (d = d - 1; d >= 1; d--) { + if (d * d == n) continue + if (n % d == 0) { + k-- + if (k == 0) { + return n / d + } + } + } + return -1 +} From 61194de8d42ae8f91c883db258c343a583451ec9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 16:37:00 +0800 Subject: [PATCH 1042/2039] Update 1492-the-kth-factor-of-n.js --- 1492-the-kth-factor-of-n.js | 21 ++++++++++----------- 1 file changed, 10 insertions(+), 11 deletions(-) diff --git a/1492-the-kth-factor-of-n.js b/1492-the-kth-factor-of-n.js index e6f49916..82dde379 100644 --- a/1492-the-kth-factor-of-n.js +++ b/1492-the-kth-factor-of-n.js @@ -5,21 +5,20 @@ */ const kthFactor = function (n, k) { let d = 1 - for (; d * d <= n; ++d) { - if (n % d == 0) { - if (--k == 0) { - return d - } + for (let i = 1; i * i < n; i++) { + if (n % i === 0) { + k-- + if (k === 0) return i } } - for (d = d - 1; d >= 1; d--) { - if (d * d == n) continue - if (n % d == 0) { + + for (let i = ~~Math.sqrt(n); i >= 1; i--) { + if (n % ~~(n / i) === 0) { k-- - if (k == 0) { - return n / d - } + // console.log(n, i, n/i, n % (n / i)) + if (k === 0) return n / i } } + return -1 } From 48ec339114063128f40e1c5de8a9a40eeb2c0ee8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 21:38:03 +0800 Subject: [PATCH 1043/2039] Create 1530-number-of-good-leaf-nodes-pairs.js --- 1530-number-of-good-leaf-nodes-pairs.js | 34 +++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1530-number-of-good-leaf-nodes-pairs.js diff --git a/1530-number-of-good-leaf-nodes-pairs.js b/1530-number-of-good-leaf-nodes-pairs.js new file mode 100644 index 00000000..e46cf854 --- /dev/null +++ b/1530-number-of-good-leaf-nodes-pairs.js @@ -0,0 +1,34 @@ +/** + * 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} distance + * @return {number} + */ +const countPairs = function(root, distance) { + let res = 0 + traverse(root) + return res + + + function traverse(node) { + if(node == null) return [] + if(node.left == null && node.right == null) return [0] + + const left = traverse(node.left) + const right = traverse(node.right) + for(let i = 0; i < left.length; i++) { + for(let j = 0; j < right.length; j++) { + if(left[i] + right[j] + 2 <= distance) res++ + } + } + + return [...left.map(e => e + 1), ...right.map(e => e + 1)] + } +}; From bc735c90b48236fb9cb390088a1a96c4bd39d93f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Sep 2022 22:38:52 +0800 Subject: [PATCH 1044/2039] Create 1493-longest-subarray-of-1s-after-deleting-one-element.js --- ...barray-of-1s-after-deleting-one-element.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 1493-longest-subarray-of-1s-after-deleting-one-element.js diff --git a/1493-longest-subarray-of-1s-after-deleting-one-element.js b/1493-longest-subarray-of-1s-after-deleting-one-element.js new file mode 100644 index 00000000..b0395643 --- /dev/null +++ b/1493-longest-subarray-of-1s-after-deleting-one-element.js @@ -0,0 +1,47 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const longestSubarray = function(nums) { + const n = nums.length + let res = 0 + const pre = Array(n).fill(0) + const suf = Array(n).fill(0) + + let cnt = 0, hasZero = false + for(let i = 0; i < n; i++) { + if(nums[i] === 1) { + cnt++ + pre[i] = cnt + res = Math.max(res, cnt) + } else { + hasZero = true + cnt = 0 + pre[i] = cnt + } + } + if(!hasZero) res-- + + cnt = 0 + + for(let i = n - 1; i >= 0; i--) { + if(nums[i] === 1) { + cnt++ + suf[i] = cnt + + } else { + cnt = 0 + suf[i] = cnt + + } + } + // console.log(pre,suf) + for(let i = 1; i < n - 1; i++) { + if(nums[i] === 0) { + res = Math.max(res, pre[i - 1] + suf[i + 1]) + } + } + + + return res +}; From b142dbe6e4f0294bb502d38ddf8dea99bf1ec780 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Sep 2022 10:35:11 +0800 Subject: [PATCH 1045/2039] Update 802-find-eventual-safe-states.js --- 802-find-eventual-safe-states.js | 33 ++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/802-find-eventual-safe-states.js b/802-find-eventual-safe-states.js index d55d224e..f1d74624 100644 --- a/802-find-eventual-safe-states.js +++ b/802-find-eventual-safe-states.js @@ -1,3 +1,36 @@ +/** + * @param {number[][]} graph + * @return {number[]} + */ +const eventualSafeNodes = function (graph) { + const ing = {}, + n = graph.length + const outDegree = Array(n).fill(0) + let q = [] + for (let i = 0; i < n; i++) { + outDegree[i] = graph[i].length + if (outDegree[i] === 0) { + q.push(i) + } + for (const e of graph[i]) { + if (ing[e] == null) ing[e] = [] + ing[e].push(i) + } + } + + for (const term of q) { + for (const come of ing[term] || []) { + outDegree[come]-- + if (outDegree[come] === 0) q.push(come) + } + } + q.sort((a, b) => a - b) + return q +} + +// another + + /** * @param {number[][]} graph * @return {number[]} From d908f88637e6478e6c7bd71fe894a19128d59b1d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Sep 2022 12:01:33 +0800 Subject: [PATCH 1046/2039] Update 322-coin-change.js --- 322-coin-change.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/322-coin-change.js b/322-coin-change.js index 3dadaa50..0c795775 100644 --- a/322-coin-change.js +++ b/322-coin-change.js @@ -13,3 +13,29 @@ const coinChange = function(coins, amount) { } return dp[amount] === amount + 1 ? -1 : dp[amount] } + + +// another + +/** + * @param {number[]} coins + * @param {number} amount + * @return {number} + */ +const coinChange = function (coins, amount) { + const n = coins.length + const dp = Array.from({ length: n }, () => + Array(amount + 1).fill(Infinity) + ) + + for (let i = 0; i < n; i++) { + dp[i][0] = 0 + for (let j = 1; j <= amount; j++) { + if(i > 0) dp[i][j] = dp[i - 1][j] + if (j >= coins[i]) { + dp[i][j] = Math.min(dp[i][j], dp[i][j - coins[i]] + 1) + } + } + } + return dp[n - 1][amount] === Infinity ? -1 : dp[n - 1][amount] +} From fcf2f3f17eca7f22550cd2a060c2c7caba7d01ce Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Sep 2022 13:57:28 +0800 Subject: [PATCH 1047/2039] Create 1461-check-if-a-string-contains-all-binary-codes-of-size-k.js --- ...a-string-contains-all-binary-codes-of-size-k.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1461-check-if-a-string-contains-all-binary-codes-of-size-k.js diff --git a/1461-check-if-a-string-contains-all-binary-codes-of-size-k.js b/1461-check-if-a-string-contains-all-binary-codes-of-size-k.js new file mode 100644 index 00000000..f05d3edf --- /dev/null +++ b/1461-check-if-a-string-contains-all-binary-codes-of-size-k.js @@ -0,0 +1,14 @@ +/** + * @param {string} s + * @param {number} k + * @return {boolean} + */ +const hasAllCodes = function (s, k) { + if (s.length < k) return false + const set = new Set() + for (let i = 0; i <= s.length - k; i++) { + set.add(s.slice(i, i + k)) + } + + return set.size == Math.pow(2, k) +} From 237c48505bbb8e87a2f17b03e5938bf0f1d970ba Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Sep 2022 14:20:10 +0800 Subject: [PATCH 1048/2039] Create 967-numbers-with-same-consecutive-differences.js --- ...mbers-with-same-consecutive-differences.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 967-numbers-with-same-consecutive-differences.js diff --git a/967-numbers-with-same-consecutive-differences.js b/967-numbers-with-same-consecutive-differences.js new file mode 100644 index 00000000..8bd4a423 --- /dev/null +++ b/967-numbers-with-same-consecutive-differences.js @@ -0,0 +1,29 @@ +/** + * @param {number} n + * @param {number} k + * @return {number[]} + */ +const numsSameConsecDiff = function (n, k) { + const res = [] + + for(let i = 1; i <= 9; i++) { + dfs(n - 1, [i]) + } + + return res + + function dfs(num, arr) { + if(num === 0) { + res.push(+arr.join('')) + return + } + + for(let i = 0; i <= 9; i++) { + if(Math.abs(i - arr[arr.length - 1]) === k) { + arr.push(i) + dfs(num - 1, arr) + arr.pop() + } + } + } +} From 20c00b7b08637d6ee1ef3030a5cd5deb57ea799e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Sep 2022 15:15:17 +0800 Subject: [PATCH 1049/2039] Create 1229-meeting-scheduler.js --- 1229-meeting-scheduler.js | 50 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 1229-meeting-scheduler.js diff --git a/1229-meeting-scheduler.js b/1229-meeting-scheduler.js new file mode 100644 index 00000000..4d86a9aa --- /dev/null +++ b/1229-meeting-scheduler.js @@ -0,0 +1,50 @@ +/** + * @param {number[][]} slots1 + * @param {number[][]} slots2 + * @param {number} duration + * @return {number[]} + */ +const minAvailableDuration = function (slots1, slots2, duration) { + const hash = {} + for(const [s, e] of slots1) { + if(hash[s] == null) hash[s] = 0 + if(hash[e] == null) hash[e] = 0 + + hash[s]++ + hash[e]-- + } + + for(const [s, e] of slots2) { + if(hash[s] == null) hash[s] = 0 + if(hash[e] == null) hash[e] = 0 + + hash[s]++ + hash[e]-- + } + + const keys = Object.keys(hash).map(e => +e) + keys.sort((a, b) => a - b) + for(let i = 1; i < keys.length; i++) { + hash[keys[i]] += hash[keys[i - 1]] + } + // console.log(keys, hash) + const n = keys.length + for(let i = 0; i < keys.length; i++) { + const k = keys[i] + if(hash[k] === 2 && i + 1 < n && valid(k, i)) { + return [k, k + duration] + } + } + + return [] + + function valid(k, idx) { + let l = k, r = k + duration + for(let i = idx + 1; i < keys.length && keys[i] < r; i++) { + const key = keys[i] + if(hash[key] !== 2) return false + } + + return true + } +} From 4038c09d779c014181be1a5bab6ad7b6b9a88e8d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Sep 2022 15:38:53 +0800 Subject: [PATCH 1050/2039] Update 1229-meeting-scheduler.js --- 1229-meeting-scheduler.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1229-meeting-scheduler.js b/1229-meeting-scheduler.js index 4d86a9aa..46d4c72e 100644 --- a/1229-meeting-scheduler.js +++ b/1229-meeting-scheduler.js @@ -48,3 +48,34 @@ const minAvailableDuration = function (slots1, slots2, duration) { return true } } + +// another + +/** + * @param {number[][]} slots1 + * @param {number[][]} slots2 + * @param {number} duration + * @return {number[]} + */ +const minAvailableDuration = function (slots1, slots2, duration) { + slots1.sort((a, b) => a[0] - b[0]) + slots2.sort((a, b) => a[0] - b[0]) + + const m = slots1.length, n = slots2.length + let i = 0, j = 0 + + while(i < m && j < n) { + const start = Math.max(slots1[i][0], slots2[j][0]) + const end = Math.min(slots1[i][1], slots2[j][1]) + + if(end - start >= duration) { + return [start, start + duration] + } + + if(slots1[i][1] > slots2[j][1]) j++ + else i++ + + } + + return [] +} From 2981694ea86aeb493a0d111af592f88e7f2a1be9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 30 Sep 2022 22:40:06 +0800 Subject: [PATCH 1051/2039] Update 2115-find-all-possible-recipes-from-given-supplies.js --- ...ll-possible-recipes-from-given-supplies.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/2115-find-all-possible-recipes-from-given-supplies.js b/2115-find-all-possible-recipes-from-given-supplies.js index 2704f0cd..a0487254 100644 --- a/2115-find-all-possible-recipes-from-given-supplies.js +++ b/2115-find-all-possible-recipes-from-given-supplies.js @@ -38,3 +38,59 @@ const findAllRecipes = function(recipes, ingredients, supplies) { } return res }; + +// another + +/** + * @param {string[]} recipes + * @param {string[][]} ingredients + * @param {string[]} supplies + * @return {string[]} + */ +const findAllRecipes = function(recipes, ingredients, supplies) { + const graph = {} + const n = recipes.length + + const inDegree = {} + supplies = new Set(supplies) + for(const e of recipes) inDegree[e] = 0 + + let q = [] + for(let i = 0; i < n; i++) { + const rec = recipes[i] + for(let e of ingredients[i]) { + if(!supplies.has(e)) { + if(graph[e] == null) graph[e] = [] + graph[e].push(rec) + if(inDegree[e] == null) inDegree[e] = 0 + inDegree[rec]++ + } + } + } + // console.log(inDegree) + for(let i = 0; i < n; i++) { + if(inDegree[recipes[i]] === 0) { + q.push(recipes[i]) + } + } + + // console.log(q) + const res = [] + while(q.length) { + const size = q.length + const nxt = [] + + for(let i = 0; i < size; i++) { + const cur = q[i] + res.push(cur) + for(const e of (graph[cur] || [])) { + inDegree[e]-- + if(inDegree[e] === 0) nxt.push(e) + } + } + + q = nxt + } + + return res +}; From b20972202aed3bd69c673563e829da92f160aa02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 30 Sep 2022 22:43:18 +0800 Subject: [PATCH 1052/2039] Update 2115-find-all-possible-recipes-from-given-supplies.js --- 2115-find-all-possible-recipes-from-given-supplies.js | 1 - 1 file changed, 1 deletion(-) diff --git a/2115-find-all-possible-recipes-from-given-supplies.js b/2115-find-all-possible-recipes-from-given-supplies.js index a0487254..856512dd 100644 --- a/2115-find-all-possible-recipes-from-given-supplies.js +++ b/2115-find-all-possible-recipes-from-given-supplies.js @@ -62,7 +62,6 @@ const findAllRecipes = function(recipes, ingredients, supplies) { if(!supplies.has(e)) { if(graph[e] == null) graph[e] = [] graph[e].push(rec) - if(inDegree[e] == null) inDegree[e] = 0 inDegree[rec]++ } } From 10ba14cc814c970220cf30a3c6c288f20c0872f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Oct 2022 18:38:37 +0800 Subject: [PATCH 1053/2039] Create 2204-distance-to-a-cycle-in-undirected-graph.js --- ...distance-to-a-cycle-in-undirected-graph.js | 75 +++++++++++++++++++ 1 file changed, 75 insertions(+) create mode 100644 2204-distance-to-a-cycle-in-undirected-graph.js diff --git a/2204-distance-to-a-cycle-in-undirected-graph.js b/2204-distance-to-a-cycle-in-undirected-graph.js new file mode 100644 index 00000000..a9ba46cc --- /dev/null +++ b/2204-distance-to-a-cycle-in-undirected-graph.js @@ -0,0 +1,75 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +const distanceToCycle = function(n, edges) { + const hash = {} + let graph = new Map() + for(const [u, v] of edges) { + if(graph.get(u) == null) graph.set(u, new Set()) + if(graph.get(v) == null) graph.set(v, new Set()) + graph.get(u).add(v) + graph.get(v).add(u) + } + + const clonedGraph = new Map() + for(const [k, v] of graph) { + clonedGraph.set(k, new Set(v)) + } + + let level = 0 + let q = [] + const visited = new Set() + for(const [k, v] of graph) { + if(graph.get(k).size === 1) { + q.push(k) + } + } + + while(q.length) { + const size = q.length + const nxt = [] + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const e of (graph.get(cur) || [])) { + graph.get(e).delete(cur) + if(graph.get(e).size === 1) { + nxt.push(e) + } + } + } + q = nxt + } + + q = [] + + visited.clear() + for(const [k, v] of graph) { + if(v.size === 2) { + q.push(k) + visited.add(k) + } + } + const res = Array(n).fill(0) + graph = clonedGraph + while(q.length) { + level++ + const size = q.length + const nxt = [] + for(let i = 0; i < size; i++) { + const cur = q[i] + for(const e of (graph.get(cur) || [])) { + if(!visited.has(e)) { + nxt.push(e) + res[e] = level + visited.add(e) + } + } + } + + q = nxt + } + + return res +}; From 79bdbf58e81f0adec89fdcfc36ac4c77ccca8cf8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Oct 2022 12:19:11 +0800 Subject: [PATCH 1054/2039] Create 2430-maximum-deletions-on-a-string.js --- 2430-maximum-deletions-on-a-string.js | 35 +++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2430-maximum-deletions-on-a-string.js diff --git a/2430-maximum-deletions-on-a-string.js b/2430-maximum-deletions-on-a-string.js new file mode 100644 index 00000000..77c6684b --- /dev/null +++ b/2430-maximum-deletions-on-a-string.js @@ -0,0 +1,35 @@ +/** + * @param {string} s + * @return {number} + */ +const deleteString = function (t) { + let n = t.length + const set = new Set(t.split('')) + if (set.size == 1) return n + + let s = t.split('') + if (n === 1 || (n === 2 && s[0] !== s[1])) return 1 + if (n === 2 && s[0] === s[1]) return 2 + if (n === 3 && s[0] === s[1]) return s[1] === s[2] ? 3 : 2 + else if (n === 3) return 1 + const f = new Array(n).fill(null) + dfsSearchWithMemory(0) + return f[0] + + function dfsSearchWithMemory(i) { + if (i >= n) return 0 + if (f[i] !== null) return f[i] + if (i === n - 1) return (f[i] = 1) + let max = 0, + cur = 0, + j = i + 1 + for (j = i + 1; j <= ~~((n - i) / 2 + i); j++) { + if (t.slice(j).startsWith(t.slice(i, j))) { + cur = 1 + dfsSearchWithMemory(j) + if (cur > max) max = cur + } + } + if (j > (n - i) / 2 + i && max === 0) return (f[i] = 1) + return (f[i] = max) + } +} From ccbc554863509d21ab0e6faf006240b0cbbba59d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Oct 2022 12:19:35 +0800 Subject: [PATCH 1055/2039] Create 2429-minimize-xor.js --- 2429-minimize-xor.js | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 2429-minimize-xor.js diff --git a/2429-minimize-xor.js b/2429-minimize-xor.js new file mode 100644 index 00000000..7677bf01 --- /dev/null +++ b/2429-minimize-xor.js @@ -0,0 +1,37 @@ +/** + * @param {number} num1 + * @param {number} num2 + * @return {number} + */ +const minimizeXor = function(num1, num2) { + let num = 0 + let n2 = num2 + while(n2 > 0) { + if(n2 & 1 === 1) num++ + n2 = n2 >>> 1 + } + + let arr1 = num1.toString(2).split('').map(e => +e) + // console.log(arr1) + let res = Array(arr1.length).fill(0) + for(let i = 0; i < arr1.length && num > 0; i++) { + if(arr1[i] === 1) { + num-- + res[i] = 1 + } + } + + for(let i = arr1.length - 1; i >= 0 && num > 0; i--) { + if(arr1[i] === 0) { + num-- + res[i] = 1 + } + } + + while(num) { + res.unshift(1) + num-- + } + + return Number.parseInt(res.join(''), 2) +}; From 88c1579b5bac2ecdf39b304cbb831043354ee60d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Oct 2022 12:20:01 +0800 Subject: [PATCH 1056/2039] Create 2428-maximum-sum-of-an-hourglass.js --- 2428-maximum-sum-of-an-hourglass.js | 30 +++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2428-maximum-sum-of-an-hourglass.js diff --git a/2428-maximum-sum-of-an-hourglass.js b/2428-maximum-sum-of-an-hourglass.js new file mode 100644 index 00000000..41f63b48 --- /dev/null +++ b/2428-maximum-sum-of-an-hourglass.js @@ -0,0 +1,30 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var maxSum = function(grid) { + let res = 0 + const m = grid.length, n = grid[0].length + + for(let i = 0; i < m - 2; i++) { + for(let j = 0; j < n - 2; j++) { + res = Math.max(res, helper(i, j)) + } + } + + return res + + function helper(i, j) { + let sum = 0 + for(let r = i; r < i + 3; r++) { + for(let c = j; c < j + 3; c++) { + sum += grid[r][c] + } + } + sum -= grid[i + 1][j] + sum -= grid[i + 1][j + 2] + // console.log(sum) + + return sum + } +}; From 9ad28ca4a425435ad8d7ae50e1fba0b86f32f7ca Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Oct 2022 12:20:32 +0800 Subject: [PATCH 1057/2039] Create 2427-number-of-common-factors.js --- 2427-number-of-common-factors.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2427-number-of-common-factors.js diff --git a/2427-number-of-common-factors.js b/2427-number-of-common-factors.js new file mode 100644 index 00000000..162cba4a --- /dev/null +++ b/2427-number-of-common-factors.js @@ -0,0 +1,14 @@ +/** + * @param {number} a + * @param {number} b + * @return {number} + */ +var commonFactors = function(a, b) { + let res = 0 + const r = Math.max(a, b) + for(let i = 1; i <= r; i++) { + if(a % i === 0 && b % i === 0) res++ + } + + return res +}; From 99cec441c3387ae91444a95cb61ee32d20d10d98 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Oct 2022 19:45:14 +0800 Subject: [PATCH 1058/2039] Update 2392-build-a-matrix-with-conditions.js --- 2392-build-a-matrix-with-conditions.js | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/2392-build-a-matrix-with-conditions.js b/2392-build-a-matrix-with-conditions.js index e1f8141e..8bd4d8ac 100644 --- a/2392-build-a-matrix-with-conditions.js +++ b/2392-build-a-matrix-with-conditions.js @@ -4,7 +4,7 @@ * @param {number[][]} colConditions * @return {number[][]} */ -var buildMatrix = function (k, rowConditions, colConditions) { +const buildMatrix = function (k, rowConditions, colConditions) { const res = Array.from({ length: k }, () => Array(k).fill(0)) const row = khansAlgo(rowConditions, k) @@ -13,7 +13,6 @@ var buildMatrix = function (k, rowConditions, colConditions) { const col = khansAlgo(colConditions, k) if (col.length != k) return [] - // console.log(row, col) const idx = Array(k + 1).fill(0) for (let j = 0; j < col.length; j++) { idx[col[j]] = j @@ -54,6 +53,7 @@ var buildMatrix = function (k, rowConditions, colConditions) { } + // another /** From dfc0ef621d527f24a8223184788b04ac3fab4ed4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 Oct 2022 12:12:41 +0800 Subject: [PATCH 1059/2039] Update 1857-largest-color-value-in-a-directed-graph.js --- ...largest-color-value-in-a-directed-graph.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1857-largest-color-value-in-a-directed-graph.js b/1857-largest-color-value-in-a-directed-graph.js index 3432baae..ed99ed48 100644 --- a/1857-largest-color-value-in-a-directed-graph.js +++ b/1857-largest-color-value-in-a-directed-graph.js @@ -1,3 +1,50 @@ +/** + * @param {string} colors + * @param {number[][]} edges + * @return {number} + */ +const largestPathValue = function (colors, edges) { + const graph = {} + const n = colors.length, + a = 'a'.charCodeAt(0) + const indegree = Array(colors.length).fill(0) + for (let e of edges) { + if (graph[e[0]] == null) graph[e[0]] = [] + graph[e[0]].push(e[1]) + indegree[e[1]]++ + } + // cnt[i][j] is the maximum count of j-th color from the ancester nodes to node i. + const cnt = Array.from({ length: n }, () => Array(26).fill(0)) + const q = [] + for (let i = 0; i < n; i++) { + if (indegree[i] === 0) { + q.push(i) + cnt[i][colors.charCodeAt(i) - a] = 1 + } + } + let res = 0, + seen = 0 + while (q.length) { + const u = q[0] + q.shift() + const val = Math.max(...cnt[u]) + res = Math.max(res, val) + seen++ + for (let v of (graph[u] || [])) { + for (let i = 0; i < 26; i++) { + cnt[v][i] = Math.max( + cnt[v][i], + cnt[u][i] + (i === colors.charCodeAt(v) - a) + ) + } + if (--indegree[v] === 0) q.push(v) + } + } + return seen < colors.length ? -1 : res +} + +// another + /** * @param {string} colors * @param {number[][]} edges From 162b2d7b278b4817e65a7558b237083b97cd45e0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Oct 2022 17:08:33 +0800 Subject: [PATCH 1060/2039] Update 1203-sort-items-by-groups-respecting-dependencies.js --- ...items-by-groups-respecting-dependencies.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/1203-sort-items-by-groups-respecting-dependencies.js b/1203-sort-items-by-groups-respecting-dependencies.js index e0e9ac0a..cd45660b 100644 --- a/1203-sort-items-by-groups-respecting-dependencies.js +++ b/1203-sort-items-by-groups-respecting-dependencies.js @@ -1,3 +1,52 @@ +/** + * @param {number} n + * @param {number} m + * @param {number[]} group + * @param {number[][]} beforeItems + * @return {number[]} + */ +const sortItems = function (n, m, group, beforeItems) { + const graph = Array.from({ length: m + n }, () => []) + const indegree = Array(n + m).fill(0) + for (let i = 0; i < group.length; i++) { + if (group[i] == -1) continue + graph[n + group[i]].push(i) + indegree[i]++ + } + for (let i = 0; i < beforeItems.length; i++) { + for (let e of beforeItems[i]) { + let a = group[e] === -1 ? e : n + group[e] + let b = group[i] === -1 ? i : n + group[i] + if (a === b) { + // same group, ingroup order + graph[e].push(i) + indegree[i]++ + } else { + // outgoup order + graph[a].push(b) + indegree[b]++ + } + } + } + const res = [] + for (let i = 0; i < n + m; i++) { + if (indegree[i] === 0) dfs(res, graph, indegree, n, i) + } + return res.length === n ? res : [] + + function dfs(ans, graph, indegree, n, cur) { + if (cur < n) ans.push(cur) + indegree[cur] = -1 // mark it visited + for (let next of graph[cur] || []) { + indegree[next]-- + if (indegree[next] === 0) dfs(ans, graph, indegree, n, next) + } + } +} + +// another + + /** * @param {number} n * @param {number} m From 8224571e6c2dc1dfce1ed5028228cf6256abab80 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Oct 2022 17:14:41 +0800 Subject: [PATCH 1061/2039] Update 1203-sort-items-by-groups-respecting-dependencies.js --- 1203-sort-items-by-groups-respecting-dependencies.js | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/1203-sort-items-by-groups-respecting-dependencies.js b/1203-sort-items-by-groups-respecting-dependencies.js index cd45660b..0894cd98 100644 --- a/1203-sort-items-by-groups-respecting-dependencies.js +++ b/1203-sort-items-by-groups-respecting-dependencies.js @@ -14,9 +14,9 @@ const sortItems = function (n, m, group, beforeItems) { indegree[i]++ } for (let i = 0; i < beforeItems.length; i++) { - for (let e of beforeItems[i]) { - let a = group[e] === -1 ? e : n + group[e] - let b = group[i] === -1 ? i : n + group[i] + for (const e of beforeItems[i]) { + const a = group[e] === -1 ? e : n + group[e] + const b = group[i] === -1 ? i : n + group[i] if (a === b) { // same group, ingroup order graph[e].push(i) @@ -44,6 +44,7 @@ const sortItems = function (n, m, group, beforeItems) { } } + // another From cc1f49374495c3b7cc043c9c4a932cd7f46ee976 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 Oct 2022 16:52:25 +0800 Subject: [PATCH 1062/2039] Create 2334-subarray-with-elements-greater-than-varying-threshold.js --- ...elements-greater-than-varying-threshold.js | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 2334-subarray-with-elements-greater-than-varying-threshold.js diff --git a/2334-subarray-with-elements-greater-than-varying-threshold.js b/2334-subarray-with-elements-greater-than-varying-threshold.js new file mode 100644 index 00000000..81da647a --- /dev/null +++ b/2334-subarray-with-elements-greater-than-varying-threshold.js @@ -0,0 +1,50 @@ +/** + * @param {number[]} nums + * @param {number} threshold + * @return {number} + */ +const validSubarraySize = function (nums, threshold) { + const n = nums.length + + let stk = [] + // used for storing next and previous smaller elements + const nextS = Array(n).fill(-1) + const prevS = Array(n).fill(-1) + + // firstly, let's find out the next smaller elements + for (let i = 0; i < n; i++) { + while (stk.length && nums[i] < nums[back(stk)]) { + nextS[back(stk)] = i + stk.pop() + } + stk.push(i) + } + + stk = [] + + // find out the previous smaller elements for each index + for (let i = n - 1; i >= 0; i--) { + while (stk.length && nums[i] < nums[back(stk)]) { + prevS[back(stk)] = i + stk.pop() + } + stk.push(i) + } + + for (let i = 0; i < n; i++) { + // left boundary + const left = prevS[i] + // right boundary + const right = nextS[i] == -1 ? n : nextS[i] + // length of subarray formed with nums[i] as minimum + const len = right - left - 1 + + if (nums[i] > threshold / len) return len + } + + return -1 + + function back(arr) { + return arr[arr.length - 1] + } +} From f94291d056cc32caa2ded282643e8025cd5f9ff6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Oct 2022 20:19:08 +0800 Subject: [PATCH 1063/2039] Update 85-maximal-rectangle.js --- 85-maximal-rectangle.js | 44 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/85-maximal-rectangle.js b/85-maximal-rectangle.js index 8192ef62..fd57a2d6 100644 --- a/85-maximal-rectangle.js +++ b/85-maximal-rectangle.js @@ -1,3 +1,47 @@ +/** + * @param {character[][]} matrix + * @return {number} + */ +const maximalRectangle = function(matrix) { + const m = matrix.length, n = matrix[0].length + const left = Array(n).fill(0) + const right = Array(n).fill(n - 1) + const height = Array(n).fill(0) + + let res = 0 + + for(let i = 0; i < m; i++) { + let l = 0, r = n - 1 + for(let j = 0; j < n; j++) { + if(matrix[i][j] === '1') left[j] = Math.max(left[j], l) + else { + left[j] = 0 + l = j + 1 + } + } + + for(let j = n - 1; j >= 0; j--) { + if(matrix[i][j] === '1') right[j] = Math.min(right[j], r) + else { + right[j] = n - 1 + r = j - 1 + } + } + + for(let j = 0; j < n; j++) { + height[j] = matrix[i][j] === '1' ? height[j] + 1 : 0 + res = Math.max(res, (right[j] - left[j] + 1) * height[j]) + } + + // console.log(left, right, height) + } + + return res +}; + +// another + + /** * @param {character[][]} matrix * @return {number} From fb6d0d73872d33fa426f8f1d4c6b21dea52b79b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Oct 2022 20:21:54 +0800 Subject: [PATCH 1064/2039] Create 2432-the-employee-that-worked-on-the-longest-task.js --- ...mployee-that-worked-on-the-longest-task.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2432-the-employee-that-worked-on-the-longest-task.js diff --git a/2432-the-employee-that-worked-on-the-longest-task.js b/2432-the-employee-that-worked-on-the-longest-task.js new file mode 100644 index 00000000..fd203058 --- /dev/null +++ b/2432-the-employee-that-worked-on-the-longest-task.js @@ -0,0 +1,19 @@ +/** + * @param {number} n + * @param {number[][]} logs + * @return {number} + */ +var hardestWorker = function(n, logs) { + const arr = Array(n).fill(0) + const m = logs.length + let pre = 0 + for(let i = 0; i < m; i++) { + const [id, leave] = logs[i] + arr[id] = Math.max(arr[id], leave - pre) + pre = leave + } + // console.log(arr) + const max = Math.max(...arr) + + return arr.indexOf(max) +}; From ead41a9770a7e6d1349637163b43a40f7779f9f6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Oct 2022 20:22:31 +0800 Subject: [PATCH 1065/2039] Create 2433-find-the-original-array-of-prefix-xor.js --- 2433-find-the-original-array-of-prefix-xor.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2433-find-the-original-array-of-prefix-xor.js diff --git a/2433-find-the-original-array-of-prefix-xor.js b/2433-find-the-original-array-of-prefix-xor.js new file mode 100644 index 00000000..5d86d3fe --- /dev/null +++ b/2433-find-the-original-array-of-prefix-xor.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} pref + * @return {number[]} + */ +const findArray = function(pref) { + const n = pref.length + if(n == 0 || n==1) return pref + const res = [pref[0]] + let xor = pref[0] + for(let i = 1; i < n; i++) { + const v = pref[i] + // v = xor ^ e + // v ^ xor = e + const tmp = v ^ xor + res.push(tmp) + xor = xor ^ tmp + } + + return res +}; From 8dbb2ee933f25dc8104a8f3207573ef8059e17ec Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Oct 2022 20:23:40 +0800 Subject: [PATCH 1066/2039] Create 2434-using-a-robot-to-print-the-lexicographically-smallest-string.js --- ...t-the-lexicographically-smallest-string.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2434-using-a-robot-to-print-the-lexicographically-smallest-string.js diff --git a/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js b/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js new file mode 100644 index 00000000..15535a1b --- /dev/null +++ b/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js @@ -0,0 +1,34 @@ + +const ord = (c) => c.charCodeAt(); +const char = (ascii) => String.fromCharCode(ascii); +/** + * @param {string} s + * @return {string} + */ + +const robotWithString = (s) => { + let f = Array(26).fill(0), t = [], res = ''; + for (const c of s) f[ord(c) - 97]++; + for (const c of s) { + f[ord(c) - 97]--; + t.push(c); + while (t.length) { + let find = false; + for (let i = 0; i < 26; i++) { + let curC = char(i + 97); + if (curC < t[t.length - 1]) { // check if can find smaller char < t's last char, in the rest of S + if (f[i] > 0) { + find = true; + break; + } + } + } + if (find) { // find means there is lexical smaller one, by moving much more right + break; + } else { // not find, current is lexical smaller + res += t.pop(); + } + } + } + return res; +}; From 2db0eacdd3b646cfcbadc2e7b88979e23a127964 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Oct 2022 20:25:29 +0800 Subject: [PATCH 1067/2039] Create 2435-paths-in-matrix-whose-sum-is-divisible-by-k.js --- ...s-in-matrix-whose-sum-is-divisible-by-k.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2435-paths-in-matrix-whose-sum-is-divisible-by-k.js diff --git a/2435-paths-in-matrix-whose-sum-is-divisible-by-k.js b/2435-paths-in-matrix-whose-sum-is-divisible-by-k.js new file mode 100644 index 00000000..b3954370 --- /dev/null +++ b/2435-paths-in-matrix-whose-sum-is-divisible-by-k.js @@ -0,0 +1,24 @@ +const initialize3DArray = (n, m, p) => { let r = []; for (let i = 0; i < n; i++) { let d = []; for (let j = 0; j < m; j++) { let t = Array(p).fill(0); d.push(t); } r.push(d); } return r; }; + +const mod = 1e9 + 7; +/** + * @param {number[][]} grid + * @param {number} k + * @return {number} + */ +const numberOfPaths = (grid, k) => { + const g = grid, K = k + let n = g.length, m = g[0].length, dp = initialize3DArray(n + 1, m + 1, K); + dp[0][1][0] = 1; + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + for (let k = 0; k < K; k++) { + dp[i + 1][j + 1][(k + g[i][j]) % K] += dp[i][j + 1][k]; + dp[i + 1][j + 1][(k + g[i][j]) % K] %= mod; + dp[i + 1][j + 1][(k + g[i][j]) % K] += dp[i + 1][j][k]; + dp[i + 1][j + 1][(k + g[i][j]) % K] %= mod; + } + } + } + return dp[n][m][0]; +}; From 244b485a7a0a454c6ca69d78af1cc446da4bc7e0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Oct 2022 19:47:29 +0800 Subject: [PATCH 1068/2039] Update 1944-number-of-visible-people-in-a-queue.js --- 1944-number-of-visible-people-in-a-queue.js | 26 +++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1944-number-of-visible-people-in-a-queue.js b/1944-number-of-visible-people-in-a-queue.js index 6505ef83..d74994b3 100644 --- a/1944-number-of-visible-people-in-a-queue.js +++ b/1944-number-of-visible-people-in-a-queue.js @@ -1,3 +1,29 @@ +/** + * @param {number[]} heights + * @return {number[]} + */ +const canSeePersonsCount = function(heights) { + const res = [] + if(heights.length === 0) return res + + const n = heights.length + const stk = [] + for(let i = n - 1; i >= 0; i--) { + let del = 0 + while(stk.length && heights[i] > heights[stk[stk.length - 1]]) { + stk.pop() + del++ + } + res.push(del + (stk.length ? 1 : 0)) + stk.push(i) + } + + return res.reverse() +}; + +// another + + /** * @param {number[]} heights * @return {number[]} From a14e99fb07bb6d8a9fbed8e570441435e178e2be Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Oct 2022 19:17:54 +0800 Subject: [PATCH 1069/2039] Create 2282-number-of-people-that-can-be-seen-in-a-grid.js --- ...er-of-people-that-can-be-seen-in-a-grid.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2282-number-of-people-that-can-be-seen-in-a-grid.js diff --git a/2282-number-of-people-that-can-be-seen-in-a-grid.js b/2282-number-of-people-that-can-be-seen-in-a-grid.js new file mode 100644 index 00000000..90c1fb32 --- /dev/null +++ b/2282-number-of-people-that-can-be-seen-in-a-grid.js @@ -0,0 +1,40 @@ +/** + * @param {number[][]} heights + * @return {number[][]} + */ +const seePeople = function(heights) { + const m = heights.length, n = heights[0].length + const res = Array.from({ length: m }, () => Array(n).fill(0)) + + for(let i = 0; i < m; i++) { + const stk = [] + for(let j = n - 1; j >= 0; j--) { + let del = 0 + + while(stk.length && heights[i][j] > heights[i][stk[stk.length - 1]]) { + del++ + stk.pop() + } + res[i][j] = del + (stk.length ? 1 : 0) + if(stk.length && heights[i][j] === heights[i][stk[stk.length - 1]]) continue + stk.push(j) + } + } + + for(let j = 0; j < n; j++) { + const stk = [] + for(let i = m - 1; i >= 0; i--) { + let del = 0 + + while(stk.length && heights[i][j] > heights[stk[stk.length - 1]][j]) { + del++ + stk.pop() + } + res[i][j] += del + (stk.length ? 1 : 0) + if(stk.length && heights[i][j] === heights[stk[stk.length - 1]][j]) continue + stk.push(i) + } + } + + return res +}; From a9765ac01c11099f7f3c129eaf26a6b25c395833 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Oct 2022 19:16:11 +0800 Subject: [PATCH 1070/2039] Create 2197-replace-non-coprime-numbers-in-array.js --- 2197-replace-non-coprime-numbers-in-array.js | 22 ++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2197-replace-non-coprime-numbers-in-array.js diff --git a/2197-replace-non-coprime-numbers-in-array.js b/2197-replace-non-coprime-numbers-in-array.js new file mode 100644 index 00000000..a2551d90 --- /dev/null +++ b/2197-replace-non-coprime-numbers-in-array.js @@ -0,0 +1,22 @@ +const gcd = (a, b) => (b == 0 ? a : gcd(b, a % b)); +/** + * @param {number[]} nums + * @return {number[]} + */ +const replaceNonCoprimes = function (nums) { + const stk = []; + for (let x of nums) { + if (stk.length === 0) { + stk.push(x); + } else { + while (stk.length && gcd(stk[stk.length - 1], x) !== 1) { + // check if it can be merged with the value to its left + const last = stk.pop(), + g = gcd(x, last); + x = (x / g) * last; // merge value, update lcm to x + } + stk.push(x); + } + } + return stk; +}; From 61ea90211483832982938b2af82a5028b91afbc2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 13 Oct 2022 13:31:59 +0800 Subject: [PATCH 1071/2039] Update 2434-using-a-robot-to-print-the-lexicographically-smallest-string.js --- ...t-the-lexicographically-smallest-string.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js b/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js index 15535a1b..9ffd6f29 100644 --- a/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js +++ b/2434-using-a-robot-to-print-the-lexicographically-smallest-string.js @@ -1,3 +1,44 @@ +/** + * @param {string} s + * @return {string} + */ +const robotWithString = function (s) { + const stk = [] + const freq = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for (const ch of s) { + freq[ch.charCodeAt(0) - a]++ + } + + let res = '' + + for (const ch of s) { + stk.push(ch) + freq[ch.charCodeAt(0) - a]-- + while (stk.length && stk[stk.length - 1] <= helper(freq)) { + const e = stk.pop() + res += e + } + } + + while (stk.length) { + res += stk.pop() + } + + return res + + function helper(arr) { + const a = 'a'.charCodeAt(0) + for (let i = 0; i < 26; i++) { + if (arr[i] !== 0) return String.fromCharCode(a + i) + } + + return '' + } +} + + +// another const ord = (c) => c.charCodeAt(); const char = (ascii) => String.fromCharCode(ascii); From e8d233fd69c8503866c0cffc687acf9d9920b119 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 13 Oct 2022 17:04:56 +0800 Subject: [PATCH 1072/2039] Create 1245-tree-diameter.js --- 1245-tree-diameter.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 1245-tree-diameter.js diff --git a/1245-tree-diameter.js b/1245-tree-diameter.js new file mode 100644 index 00000000..d9b83b62 --- /dev/null +++ b/1245-tree-diameter.js @@ -0,0 +1,38 @@ +/** + * @param {number[][]} edges + * @return {number} + */ +const treeDiameter = function (edges) { + const graph = {} + for (const [u, v] of edges) { + if (graph[u] == null) graph[u] = new Set() + if (graph[v] == null) graph[v] = new Set() + graph[u].add(v) + graph[v].add(u) + } + + let res = 0 + + dfs(0, -1) + + return res + + function dfs(node, parent) { + let first = 0, sec = 0 + + for(const nxt of (graph[node] || [])) { + if(nxt === parent) continue + const childNum = dfs(nxt, node) + if(childNum > first) { + sec = first + first = childNum + } else if(childNum > sec){ + sec = childNum + } + } + + const nodeNum = first + sec + 1 + res = Math.max(res, nodeNum - 1) + return first + 1 + } +} From 39bf4392271df5f3e81bcd8e11b8f1e68b052108 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 14 Oct 2022 19:35:04 +0800 Subject: [PATCH 1073/2039] Create 2355-maximum-number-of-books-you-can-take.js --- 2355-maximum-number-of-books-you-can-take.js | 49 ++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 2355-maximum-number-of-books-you-can-take.js diff --git a/2355-maximum-number-of-books-you-can-take.js b/2355-maximum-number-of-books-you-can-take.js new file mode 100644 index 00000000..585b0b78 --- /dev/null +++ b/2355-maximum-number-of-books-you-can-take.js @@ -0,0 +1,49 @@ +/** + * @param {number[]} books + * @return {number} + */ +var maximumBooks = function (books) { + const len = books.length + const dp = new Array(len).fill(0) + + // dp[i] represents max number of books that can be taken + // between shelf 0 and shelf i (both inclusive) + + // use monotonic stack to populate dp array; for every index i, + // find the nearest break point j < i such that books[i - j] < + // books[i] - i + j + + // this becomes the restraining point for picking books as now + // instead of picking (books[i] - i + j) books, we can only pick + // books[i - j] books; so we will pick the maximum dp[j] books + + // (books[i] + books[i] - 1 + books[i] - 2 + ... + books[i] - (i - j - 1)) + const stack = [] + let maxBooks = 0 + + for (let i = 0; i < len; i++) { + while (stack.length && books[peek(stack)] >= books[i] - i + peek(stack)) + stack.pop() + + // pick dp[j] books and (books[i] + books[i] - 1 + ... + books[i] - + // (i - j - 1)) books, where j is the current stack top; the latter + // expression can be rewritten as a difference of two n-summations + dp[i] = + (stack.length === 0 ? 0 : dp[peek(stack)]) + + getSummation(books[i]) - + getSummation(books[i] - i + (stack.length === 0 ? -1 : peek(stack))) + + maxBooks = Math.max(maxBooks, dp[i]) + stack.push(i) + } + + return maxBooks +} + +function getSummation(n) { + if (n < 0) return 0 + return (n * (n + 1)) / 2 +} + +function peek(arr) { + return arr[arr.length - 1] +} From 8a82391add15d8e13fc34e00538c47c44a299efc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 Oct 2022 19:46:05 +0800 Subject: [PATCH 1074/2039] Update 1631-path-with-minimum-effort.js --- 1631-path-with-minimum-effort.js | 43 ++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1631-path-with-minimum-effort.js b/1631-path-with-minimum-effort.js index 0514873a..8202a320 100644 --- a/1631-path-with-minimum-effort.js +++ b/1631-path-with-minimum-effort.js @@ -1,3 +1,46 @@ +/** + * @param {number[][]} heights + * @return {number} + */ +const minimumEffortPath = function(heights) { + const m = heights.length, n = heights[0].length + const dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]] + let l = 0, r = 1e6 - 1 + + while(l < r) { + const mid = ~~((l + r) / 2) + if(valid(mid)) { + r = mid + } else { + l = mid + 1 + } + } + + return l + + function valid(limit) { + const visited = Array.from({ length: m }, () => Array(n).fill(false)) + return dfs(0, 0, limit, visited) + } + + function dfs(i, j, limit, visited) { + if(i === m - 1 && j === n - 1) return true + visited[i][j] = true + for(const [dx, dy] of dirs) { + const nx = i + dx, ny = j + dy + if(nx < 0 || nx >= m || ny < 0 || ny >= n) continue + if(visited[nx][ny]) continue + if(Math.abs(heights[i][j] - heights[nx][ny]) <= limit && dfs(nx, ny, limit, visited)) return true + } + return false + } + +}; + +// another + + + /** * @param {number[][]} heights * @return {number} From 37de20b26c1162bef4f7d649ac7b3f18e9f451e6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 Oct 2022 19:53:21 +0800 Subject: [PATCH 1075/2039] Update 1631-path-with-minimum-effort.js --- 1631-path-with-minimum-effort.js | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/1631-path-with-minimum-effort.js b/1631-path-with-minimum-effort.js index 8202a320..aa094e96 100644 --- a/1631-path-with-minimum-effort.js +++ b/1631-path-with-minimum-effort.js @@ -9,6 +9,7 @@ const minimumEffortPath = function(heights) { while(l < r) { const mid = ~~((l + r) / 2) + // console.log(l, r, mid) if(valid(mid)) { r = mid } else { @@ -30,9 +31,10 @@ const minimumEffortPath = function(heights) { const nx = i + dx, ny = j + dy if(nx < 0 || nx >= m || ny < 0 || ny >= n) continue if(visited[nx][ny]) continue - if(Math.abs(heights[i][j] - heights[nx][ny]) <= limit && dfs(nx, ny, limit, visited)) return true + if(Math.abs(heights[i][j] - heights[nx][ny]) > limit) continue + if(dfs(nx, ny, limit, visited)) return true } - return false + // return false } }; From cb8a622d63aadb4cb2f0db62bb245696135acd75 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Oct 2022 12:15:09 +0800 Subject: [PATCH 1076/2039] Create 2444-count-subarrays-with-fixed-bounds.js --- 2444-count-subarrays-with-fixed-bounds.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2444-count-subarrays-with-fixed-bounds.js diff --git a/2444-count-subarrays-with-fixed-bounds.js b/2444-count-subarrays-with-fixed-bounds.js new file mode 100644 index 00000000..e2d969e1 --- /dev/null +++ b/2444-count-subarrays-with-fixed-bounds.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} minK + * @param {number} maxK + * @return {number} + */ +var countSubarrays = function(nums, minK, maxK) { + let res = 0, j = 0, jmin = -1, jmax = -1, n = nums.length; + for (let i = 0; i < n; ++i) { + if (nums[i] < minK || nums[i] > maxK) { + jmin = jmax = -1; + j = i + 1; + } + if (nums[i] == minK) jmin = i; + if (nums[i] == maxK) jmax = i; + res += Math.max(0, Math.min(jmin, jmax) - j + 1); + } + return res; +}; From 63ee0de014ed990b5c83367b11cef3e22dab0e94 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Oct 2022 12:15:36 +0800 Subject: [PATCH 1077/2039] Create 2443-sum-of-number-and-its-reverse.js --- 2443-sum-of-number-and-its-reverse.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2443-sum-of-number-and-its-reverse.js diff --git a/2443-sum-of-number-and-its-reverse.js b/2443-sum-of-number-and-its-reverse.js new file mode 100644 index 00000000..686d2a4c --- /dev/null +++ b/2443-sum-of-number-and-its-reverse.js @@ -0,0 +1,24 @@ +/** + * @param {number} num + * @return {boolean} + */ +var sumOfNumberAndReverse = function(num) { + // let l = 0, r = num + // while(l < r) { + // const mid = ~~((l + r) / 2) + // if(valid(mid) === 0) return true + // else if(valid(mid) < 0) l = mid + 1 + // else r = mid - 1 + // } + for(let i = 0; i <= num; i++) { + if(valid(i) === 0) { + // console.log(i) + return true + } + } + return false + + function valid(n) { + return n + (parseInt( (''+n).split('').reverse().join('') ) ) - num + } +}; From 9725f0bfdfea2fa352cd61b988a67bba974aaad1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Oct 2022 12:15:58 +0800 Subject: [PATCH 1078/2039] Create 2442-count-number-of-distinct-integers-after-reverse-operations.js --- ...-distinct-integers-after-reverse-operations.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2442-count-number-of-distinct-integers-after-reverse-operations.js diff --git a/2442-count-number-of-distinct-integers-after-reverse-operations.js b/2442-count-number-of-distinct-integers-after-reverse-operations.js new file mode 100644 index 00000000..884b1c23 --- /dev/null +++ b/2442-count-number-of-distinct-integers-after-reverse-operations.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var countDistinctIntegers = function(nums) { + const set = new Set() + + for(const e of nums) set.add(e) + for(const e of nums) set.add(reverse(e)) + return set.size + + function reverse(num) { + return parseInt(('' + num).split('').reverse().join('')) + } +}; From df336000d734e2cd7b8438c960205dac90d6ea95 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Oct 2022 12:16:20 +0800 Subject: [PATCH 1079/2039] Create 2441-largest-positive-integer-that-exists-with-its-negative.js --- ...ositive-integer-that-exists-with-its-negative.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2441-largest-positive-integer-that-exists-with-its-negative.js diff --git a/2441-largest-positive-integer-that-exists-with-its-negative.js b/2441-largest-positive-integer-that-exists-with-its-negative.js new file mode 100644 index 00000000..47214a1a --- /dev/null +++ b/2441-largest-positive-integer-that-exists-with-its-negative.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var findMaxK = function(nums) { + nums.sort((a, b) => a - b) + const n = nums.length + for(let i = n - 1; i > 0; i--) { + const cur = nums[i] + if(nums.indexOf(-cur) !== -1) return cur + } + return -1 +}; From 0d7fcd6b629ff99be16591f02a021c6d82fc76a8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Oct 2022 18:26:23 +0800 Subject: [PATCH 1080/2039] Update 1970-last-day-where-you-can-still-cross.js --- 1970-last-day-where-you-can-still-cross.js | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/1970-last-day-where-you-can-still-cross.js b/1970-last-day-where-you-can-still-cross.js index ed44df6b..6ae51821 100644 --- a/1970-last-day-where-you-can-still-cross.js +++ b/1970-last-day-where-you-can-still-cross.js @@ -9,15 +9,15 @@ const latestDayToCross = function (row, col, cells) { n = cells.length, r = n while (l < r) { - const mid = ~~((l + r) / 2) + const mid = r - (~~((r - l) / 2)) if (canWalk(mid)) { - l = mid + 1 + l = mid } else { - r = mid + r = mid - 1 } } - return l + return l + 1 function canWalk(mid) { const grid = Array.from({ length: row }, () => Array(col).fill(0)) From 484cba1609d3fd2e5b2f24fe49fa2a0ffb1af3ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Oct 2022 12:44:34 +0800 Subject: [PATCH 1081/2039] Update 1697-checking-existence-of-edge-length-limited-paths.js --- ...-existence-of-edge-length-limited-paths.js | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/1697-checking-existence-of-edge-length-limited-paths.js b/1697-checking-existence-of-edge-length-limited-paths.js index cf678002..72ef93c5 100644 --- a/1697-checking-existence-of-edge-length-limited-paths.js +++ b/1697-checking-existence-of-edge-length-limited-paths.js @@ -1,3 +1,53 @@ +/** + * @param {number} n + * @param {number[][]} edgeList + * @param {number[][]} queries + * @return {boolean[]} + */ +const distanceLimitedPathsExist = function (n, edgeList, queries) { + edgeList.sort((a, b) => a[2] - b[2]) + const m = queries.length + const res = Array(m).fill(false) + const order = Array(m).fill(0) + for (let i = 0; i < m; ++i) order[i] = i + order.sort((i, j) => queries[i][2] - queries[j][2]) + const uf = new UF(n) + let idx = 0 + for (let i of order) { + const limit = queries[i][2] + while (idx < edgeList.length && edgeList[idx][2] < limit) { + const [u, v] = edgeList[idx] + uf.union(u, v) + idx++ + } + const [u0, v0] = queries[i] + if (uf.find(u0) === uf.find(v0)) res[i] = true + } + return res +} + +class UF { + constructor(n) { + this.root = Array(n) + .fill(null) + .map((_, i) => i) + } + find(x) { + if (this.root[x] !== x) { + this.root[x] = this.find(this.root[x]) + } + return this.root[x] + } + union(x, y) { + const xr = this.find(x) + const yr = this.find(y) + this.root[yr] = xr + } +} + + +// another + /** * @param {number} n * @param {number[][]} edgeList From d067b2ae080c3b155a5ef435a59bb15ead6c80c7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Oct 2022 14:23:01 +0800 Subject: [PATCH 1082/2039] Create 1273-delete-tree-nodes.js --- 1273-delete-tree-nodes.js | 57 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 57 insertions(+) create mode 100644 1273-delete-tree-nodes.js diff --git a/1273-delete-tree-nodes.js b/1273-delete-tree-nodes.js new file mode 100644 index 00000000..7ecb9bb1 --- /dev/null +++ b/1273-delete-tree-nodes.js @@ -0,0 +1,57 @@ +/** + * @param {number} nodes + * @param {number[]} parent + * @param {number[]} value + * @return {number} + */ +const deleteTreeNodes = function (nodes, parent, value) { + const n = nodes + const hash = {} + hash[0] = new Node(value[0]) + for (let i = 1; i < n; i++) { + hash[i] = new Node(value[i]) + } + + for (let i = 1; i < n; i++) { + const p = parent[i] + hash[p].children[i] = hash[i] + } + + const r = hash[0] + dfs(r) + // console.log(n) + return cnt(r) + + function dfs(node) { + if (node == null) return 0 + let res = node.sum + + const keys = Object.keys(node.children) + for (const k of keys) { + res += dfs(hash[k]) + } + + node.sum = res + return res + } + + function cnt(node) { + if (node == null) return 0 + if (node.sum === 0) return 0 + const keys = Object.keys(node.children) + let res = 1 + for (const k of keys) { + res += cnt(hash[k]) + } + + return res + } +} + +class Node { + constructor(v) { + this.val = v + this.sum = v + this.children = {} + } +} From 9752c97e0632151a740653bdd1d6065514025231 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Oct 2022 14:31:20 +0800 Subject: [PATCH 1083/2039] Update 2421-number-of-good-paths.js --- 2421-number-of-good-paths.js | 117 +++++++++++++++++------------------ 1 file changed, 57 insertions(+), 60 deletions(-) diff --git a/2421-number-of-good-paths.js b/2421-number-of-good-paths.js index cc0cd7f1..cffbdb15 100644 --- a/2421-number-of-good-paths.js +++ b/2421-number-of-good-paths.js @@ -1,66 +1,63 @@ - -///////////////////////////////////////////////////// Template /////////////////////////////////////////////////////////////////////// -const packUG = (g, edges) => { for (const [u, v] of edges) { g[u].push(v); g[v].push(u); } }; -const initializeGraph = (n) => { let g = []; for (let i = 0; i < n; i++) { g.push([]); } return g; }; - -function DJSet(n) { - // parent[i] < 0, -parent[i] is the group size which root is i. example: (i -> parent[i] -> parent[parent[i]] -> parent[parent[parent[i]]] ...) - // parent[i] >= 0, i is not the root and parent[i] is i's parent. example: (... parent[parent[parent[i]]] -> parent[parent[i]] -> parent[i] -> i) - let parent = Array(n).fill(-1); - return { find, union, count, equiv, par } - function find(x) { - return parent[x] < 0 ? x : parent[x] = find(parent[x]); - } - function union(x, y) { - x = find(x); - y = find(y); - if (x == y) return false; - if (parent[x] < parent[y]) [x, y] = [y, x]; - parent[x] += parent[y]; - parent[y] = x; - return true; - } - function count() { // total groups - return parent.filter(v => v < 0).length; - } - function equiv(x, y) { // isConnected - return find(x) == find(y); - } - function par() { - return parent; - } -} -////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// /** * @param {number[]} vals * @param {number[][]} edges * @return {number} */ -const numberOfGoodPaths = (a, edges) => { - let n = a.length, g = initializeGraph(n), f = Array(n).fill(0), ds = new DJSet(n), res = 0; - packUG(g, edges); - let d = a.map((x, i) => [x, i]); - d.sort((x, y) => { - if (x[0] != y[0]) return x[0] - y[0]; - return x[1] - y[1]; - }) - for (let r = 0; r < n;) { // l: start node r: end node - let l = r; - while (r < n && d[l][0] == d[r][0]) r++; // condition 1 - for (let i = l; i < r; i++) { - let cur = d[i][1]; - for (const child of g[cur]) { - if (a[child] <= d[l][0]) ds.union(child, cur); // condition 2 - } - } - for (let i = l; i < r; i++) { // loop the path - let cur = d[i][1]; - res += ++f[ds.find(cur)]; - } - for (let i = l; i < r; i++) { - let cur = d[i][1]; - f[ds.find(cur)]--; - } +const numberOfGoodPaths = function (vals, edges) { + const n = vals.length + let res = 0 + const adj = Array.from({ length: n }, () => []) + const sameValues = new Map() + const valWithIdx = vals.map((v, i) => [v, i]) + valWithIdx.sort((a, b) => a[0] - b[0]) + for (let i = 0; i < n; i++) { + const [val, idx] = valWithIdx[i] + if (sameValues.get(val) == null) sameValues.set(val, []) + sameValues.get(val).push(idx) + } + for (const e of edges) { + const [u, v] = e + if (vals[u] >= vals[v]) { + adj[u].push(v) + } else if (vals[v] >= vals[u]) { + adj[v].push(u) } - return res; -}; + } + const uf = new UF(n) + for (const [_, allNodes] of sameValues) { + for (let u of allNodes) { + for (const v of adj[u]) { + uf.union(u, v) + } + } + const group = {} + for (let u of allNodes) { + const uroot = uf.find(u) + if (group[uroot] == null) group[uroot] = 0 + group[uroot]++ + } + res += allNodes.length + for (let [_, size] of Object.entries(group)) { + res += (size * (size - 1)) / 2 + } + } + return res +} +class UF { + constructor(n) { + this.root = Array(n) + .fill(null) + .map((_, i) => i) + } + find(x) { + if (this.root[x] !== x) { + this.root[x] = this.find(this.root[x]) + } + return this.root[x] + } + union(x, y) { + const xr = this.find(x) + const yr = this.find(y) + this.root[yr] = xr + } +} From e95fe685d550b761df3fa973318c6dad0c7c23e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Oct 2022 15:31:55 +0800 Subject: [PATCH 1084/2039] Create 910-smallest-range-ii.js --- 910-smallest-range-ii.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 910-smallest-range-ii.js diff --git a/910-smallest-range-ii.js b/910-smallest-range-ii.js new file mode 100644 index 00000000..6980165b --- /dev/null +++ b/910-smallest-range-ii.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const smallestRangeII = function (nums, k) { + let n = nums.length + nums.sort((a, b) => a - b) + let res = nums[n - 1] - nums[0] + + let left = nums[0] + k, right = nums[n - 1] - k + for(let i = 0; i < n - 1; i++) { + const tmax = Math.max(right, nums[i] + k) + const tmin = Math.min(left, nums[i + 1] - k) + res = Math.min(res, tmax - tmin) + } + + return res +} From 678025d4a926d688ce10658a70bed01a28e5e817 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Oct 2022 15:36:33 +0800 Subject: [PATCH 1085/2039] Update 910-smallest-range-ii.js --- 910-smallest-range-ii.js | 2 ++ 1 file changed, 2 insertions(+) diff --git a/910-smallest-range-ii.js b/910-smallest-range-ii.js index 6980165b..2c14d07f 100644 --- a/910-smallest-range-ii.js +++ b/910-smallest-range-ii.js @@ -6,8 +6,10 @@ const smallestRangeII = function (nums, k) { let n = nums.length nums.sort((a, b) => a - b) + // all elements plus k or minus k let res = nums[n - 1] - nums[0] + // left side elements plus k, right side elements minus k let left = nums[0] + k, right = nums[n - 1] - k for(let i = 0; i < n - 1; i++) { const tmax = Math.max(right, nums[i] + k) From df79c74e8e772ffef472a8389da0a85551c84cf2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 20 Oct 2022 12:34:19 +0800 Subject: [PATCH 1086/2039] Update 952-largest-component-size-by-common-factor.js --- ...largest-component-size-by-common-factor.js | 69 +++++++++++++++++++ 1 file changed, 69 insertions(+) diff --git a/952-largest-component-size-by-common-factor.js b/952-largest-component-size-by-common-factor.js index 9d9f2bef..c01f0348 100644 --- a/952-largest-component-size-by-common-factor.js +++ b/952-largest-component-size-by-common-factor.js @@ -1,3 +1,72 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const largestComponentSize = function (nums) { + const { sqrt } = Math + const n = nums.length + const uf = new UF(n) + const primes = {} + for (let i = 0; i < n; i++) { + const num = nums[i] + const prSet = primesSet(num) + for (const e of prSet) { + if (primes[e] == null) primes[e] = [] + primes[e].push(i) + } + } + + const vals = Object.values(primes) + for(const idxArr of vals) { + const len = idxArr.length + for(let i = 0; i < len - 1; i++) { + uf.union(idxArr[i], idxArr[i + 1]) + } + } + let res = 0 + const hash = {} + for(let i = 0; i < n; i++) { + const root = uf.find(i) + if(hash[root] == null) hash[root] = 0 + hash[root]++ + } + return Math.max(...Object.values(hash)) + + function primesSet(n) { + const limit = ~~(sqrt(n) + 1) + for (let i = 2; i < limit; i++) { + if (n % i === 0) { + const res = primesSet(n / i) + res.add(i) + return res + } + } + return new Set([n]) + } +} + +class UF { + constructor(n) { + this.root = Array(n) + .fill(null) + .map((_, i) => i) + } + find(x) { + if (this.root[x] !== x) { + this.root[x] = this.find(this.root[x]) + } + return this.root[x] + } + union(x, y) { + const xr = this.find(x) + const yr = this.find(y) + this.root[yr] = xr + } +} + +// another + + /** * @param {number[]} A * @return {number} From d2897c749624f6acf848d5afe852c12c0cb0d962 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 20 Oct 2022 14:14:54 +0800 Subject: [PATCH 1087/2039] Create 971-flip-binary-tree-to-match-preorder-traversal.js --- ...binary-tree-to-match-preorder-traversal.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 971-flip-binary-tree-to-match-preorder-traversal.js diff --git a/971-flip-binary-tree-to-match-preorder-traversal.js b/971-flip-binary-tree-to-match-preorder-traversal.js new file mode 100644 index 00000000..e21fd117 --- /dev/null +++ b/971-flip-binary-tree-to-match-preorder-traversal.js @@ -0,0 +1,32 @@ +/** + * 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[]} voyage + * @return {number[]} + */ +const flipMatchVoyage = function (root, voyage) { + const n = voyage.length + const res = [] + let idx = 0 + return dfs(root, 0) ? res : [-1] + + function dfs(node) { + if (node == null) return true + if (node.val !== voyage[idx]) { + return false + } + idx++ + if (node.left && node.left.val !== voyage[idx]) { + res.push(node.val) + return dfs(node.right) && dfs(node.left) + } + return dfs(node.left) && dfs(node.right) + } +} From 33c9fd6f0763fd79a1bbe3c1239b14ed6b8ed9c8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Oct 2022 20:29:41 +0800 Subject: [PATCH 1088/2039] Update 1627-graph-connectivity-with-threshold.js --- 1627-graph-connectivity-with-threshold.js | 50 +++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/1627-graph-connectivity-with-threshold.js b/1627-graph-connectivity-with-threshold.js index 05eac3ca..cafcb215 100644 --- a/1627-graph-connectivity-with-threshold.js +++ b/1627-graph-connectivity-with-threshold.js @@ -1,3 +1,53 @@ +/** + * @param {number} n + * @param {number} threshold + * @param {number[][]} queries + * @return {boolean[]} + */ +const areConnected = function(n, threshold, queries) { + const arr = [] + const uf = new UF(n) + setup(n, threshold, uf) + for(let i = 0, len = queries.length; i < len;i++) { + arr.push(uf.check(queries[i][0], queries[i][1])) + } + return arr +}; + +function setup(n, t, uf) { + for (let i = t + 1; i <= n; i++) { + let m = 1; + while (i * m <= n) { + uf.union(i, i * m); + m += 1; + } + } +} + + +class UF { + constructor(n) { + this.root = Array(n).fill(null).map((_, i) => i) + } + find(x) { + if (this.root[x] !== x) { + this.root[x] = this.find(this.root[x]) + } + return this.root[x] + } + union(x, y) { + const xr = this.find(x) + const yr = this.find(y) + this.root[yr] = xr + } + check(x, y) { + return this.find(x) === this.find(y) + } +} + + +// another + /** * @param {number} n * @param {number} threshold From 79867186a829d992bd9ff8f878c7533564cce0fc Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Oct 2022 14:32:24 +0800 Subject: [PATCH 1089/2039] Add files via upload --- images/Sieve_of_Eratosthenes_animation.gif | Bin 0 -> 157448 bytes 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 images/Sieve_of_Eratosthenes_animation.gif diff --git a/images/Sieve_of_Eratosthenes_animation.gif b/images/Sieve_of_Eratosthenes_animation.gif new file mode 100644 index 0000000000000000000000000000000000000000..cd385eecd310f0332a98f8679fba81609d5d0f7b GIT binary patch literal 157448 zcmce6-St5l1zbwHyFZ%2?Yg25cc{0 z{)uPa%{g<DhSe?!4hKEi}El@z%|A%f(~! z;AkHJ08UO%j8Bfu%ufILdwX~P$K29vVd)zmKkw7k)%UX#x3{ii6QkR^TLeV-+PYdR zYfEq<*vG{9j;{8r;W1>`2QdlJ)btdNX?|hBnZ$#{FVBT1ruifp;a9&e-$}fHGtjk} zn2gxizK(lc-&n`W&T@VKlb4Ee({Xiub4?l{rE6H7Uzlg}{6CuK6l#T9d$FEYDjIR1Wgn3B}i(Te_jrOeJ|-DjSZl6X{Hn3Z|_ zO?948fl0r?@E|+q?)H9gc!1a9d3j}-udlE7hUX7-U*lOlDH!szt1B+?U~fP6;o`@_ z^-?ci4>ul9#$ndz<&gWL%WlLLIT>sIaZw_3;`zgmjvt+`UIm{uG;(riHa4H#EG@qD zmn=BSQC5r%Wk8k{9Wm3t5EpaX{t*11fJISBVGU=E1knpmTF=|-<E0b2?S_8%{bfdxROzC!91lVnu@|44qcJ&do2jmj+K)cGJ6Kr03Ep~ta$FJ;y!~y# zxUy2u(Ox()LHUI^{APL4+xKN}uerc;{OPGnQxoo^{o9LknendYuM=W+^p;E)OiZm-?G21q*L{4!*udR`9R}w3R2EiTQNpGca~AHhDSkl` zHPYw!1WZ}1aiftiRK zCk)QyMos7GK@a%<9!!5BSmS^-022mZLqShhPDV>XkY4}{{2vkC|0DB%V*-F;0Ax@) zrN+X6a3~qK*?42oP&AB1C0D7bcqEQW$a!PDXKko+*~@5%BfpzHql%*l_~IM zGFQ2!{L3eCuhR`D9mcN(h;Tf(N^9j@iBf9+byaKCw+gKil{^)Fj&IdQEzX;hZ8giu zhM!~Ms_nI_Ev!Su=2Pu;>m3GU=seYq`pquqpQoEs9dEz&hJf+u)%>eA22o@@uL=B{ z_Q#UuL=)7ynh&c||8v=zrgl6kfKs67)w^4r<{9C+7GDAfAW1NjDf&F1ZTf1boB^8e zK?J$dYb*zlVDfj_95plqW;6Z$zMEGNa^%E>yg6HGaTz0O9=QFv17^eksu+9!o)I9J z#lLO=m2Qv6z?{Sky`Y<$p&pzhhTb6TM>ju9Zw>VhT_2$HvU%9rgd#)uQW*|95N45S z61gmavIc;4P`i<|PaV5R2)A9K1~deU^kYitD2kvr=-iIl>q1#a3(u@D0{~k_dzR7g zbel;0A9suq0`pMjC>oorgD6!4&f>&Z>^?RcaC6Sl+8Nhbw3((EQ zox$DBSGvXB&CV=WK8ld&r#z|PXG;phkuOa`60ts~(Fc80!BCWHr(rvCg=Y!gl@%ak z14`?2CjVCC=j#}s5-_#_&T!?85Re)^&NUGDg(Ni*qBrHdK?jv%o&l!W$Hg`oHw+UuAcY{OSKm2J_!TRD6 zMkFxS+ce6-iX7;wF-ZcHa+o##o+QQmdsj>6K!7;RErKy6ogJa((O>yGh1iHXwsPDdq~t`S$)Y zGyvDdZv@NEY&Y!pj`0U`$Xnv%Ab(vOMF^H`P=PEnU+GRbQa~92@h$|XV-@rWk}}KXE(CEz2lHsX?bY3CPMbGV3SJ5%|h^XrQ& z0wjW~JMWq8qO=NR03ks={WB;%>MFPTPmpnx8TJm?{7~yt5;NDQ1w05Y3?zv;*7CDg zgre1CUL8uv1s;*Vl&B4bNlr{&$dkM@<+OwJj~iXuW=Ki&%Hl-0Ba@SfWJJf0D{818nWDrW+WAi61}<#U!@#s-ijc~@}sF=)JbG25R!P{S7N zEIl@|)Hx$!xm0^*@nFJ@T@3<7sh``>KCBGie!)%pa&AB6AUl&F+7!&~>ZEA8x|HFo z)C_lX_Uc)klE`b}OS*9T@M%>#58agv|6%!c7(uS|?$c+m&F#1Yu;AB7l(^PU<~5^f zb5Tt&?*;?O5YCq$?BxYMEN|KRRt?pCJFPYU{S?A6d&OAgn$Ht*8S(l3E@O;e?r|MF z@x?~eWh`+O#AyxH~upShKtk$+C|ussz1kGHJ{P&dWO6|XFc6Ab)&?uy8CkSMEnflbcVfaF zecl;`8Ha~%ggW>gN*dUS)}KTp9pSQQW1UKQFC~bOM??ixgvE(u!U-4`7DNs5btVT; zrfX+c#%Olh*B|&RSBRFrPS7c(&ec+`Ia4-J|VgV8NGSpY2C@w2b${q7Xl#SgENd7<--TH9@ zO0ks%-+{(@j7KJmL*Am`?3oFxGBFn`Mn6$NewYZCRealunHR<}l8YL^odwStH(1&Q zjeKJqM8WM5DbSdBu3;%!0qOOoz_@Yg7y)?+>hM5cxbzMvZbTv1HdXm=vJ^>5Q-yHK z0$7s~a>S7kkO?=`!ls!8nf;EKdlxLyy)dOa`* z#9agp$jRSjMGP9gr za+uQCm{(U=;uVQHmx*(;yih5wt0;E3FVV%^OUZI48REV6I+YFm)4NvP zd0$h7S3?A=8N{n@H7V~kD4)J}nOduzjdj5ed#k{N3`mxm1Tvyg6P<1+Y3&P zSNMFa_SYJv2)#sLtABHS~-FM;)o-L|gPg=?o;e@@>fi8+)sSNTsioN)63YnnWLo3=*+ z<#S4KYP^YG2F`LfM-%dt z^WhgLenRo|luA7$zdCD>iHlWHsbq6$A&)D^GPQYWYC(V2!uYZ&D6j>&*1Aeke%0N2 zAKkuE)DD_zr=O_enQM^z4kll#$DF<&SOzT^m1r%2x7a%O@w`yk9nMZZAv~2@QCZB+ z$)|riQTWlZv_T1H_FBGJ6xkW_>jEfc3&YC}%dQ3=Q*EwG;7eOLDJm!GZv$->(!^Vo zAFc6F2^Y*3S``tijFXpt;Gy;Crm>2TXicqKeR3UjiY!aBrh6@~!lZ;EHIg2aq_0Uun z2d~2d`5uCIjZ&D`Ot=_DBNnxsaI7M*J{fVMDF5=rDhJb8C2+=+9Z;n`>P4?}e=h<3IwwSEj6d7F|Geh;v2VD$ z_zwP{tNJ~Auy8qfR2Te9sB~2u>~aVsMh=qfsfYw|Qo)9QD0;x1LMfnK0zv7PWHIst zIaLlQv>sRp-Q%R{fvrC}nhJH(yAJ8RZ0Gx)^is0q{d*AxN6xGVxHFsb zqTXOqH+)=KWI9Nx)QLPgM)2~9iRX#%l&X-wu$R(WuyVxSR~`9c>cx^J@;6-E zKK#q7nRbhd#+>SB?9)RjoMQm^S@Mv_LUg(wAjD2`N2I~UgsnH zk<|BLl~io~vdHEL*s-WzY3sZ0mATH*v|i7*ZW`Cp@Uc>4Y9r@`|F|3JBw=NtROOlT z3IX$mEoQO2Olq^UuC_z1?Q3x9oO%qqd~2;bJ2`W8

~`kh^05H-=xGydK5 zQ92^&U5NA!p8GB<(Jrq09!dW${ArKiX^&dNO)z2i>*)4e&c0afzGVLgY-TVFb|6ax zBoH`w9dZCG6eL3)sBIn0?gHfL4;7>jbu13`EDofx4mA1?73vR6-4CraWDPA2Wi1ZW zEDoAPkMu&0^y&9hpAOB4WIeVH9P8hE%^WdVY_fT7w)Ty+7jIs@SSxg`yZ%_@?y`Q5 zF|QZ5_{L<)h2(Dx>;GzgX2*F}r<}8<(zBMcvbG|%eU`UnXL=&;cM|*9X8pKTYrch4 zKPmW8c>A$9(}c+c>*eeHa$Rxuww> zpz_fCO>nOL_Qt72L&WOKU_X4%Mf}rEPvpdE%<>xFB|3m0`0-aNz1!`!Wc*(EO%skJ zCR)?$&~hjeHjPrFxjlt=Y7zH?740`+5E@DWN&m7aYDz<*K$vU_Q+PCm8MadE zz(__oAG2##z@>F~wzMJ)Gorjn@&6!0(!SBj;_nQ}a#Mq4k{nKJtuy|f*|Y2v3%^9i7ko08|Z z59&-3`ytm&Af*L2y0jY1{vegWZoYQywD3$O_WX=_ZZbovY4RNN*UBn!AQ=4b+>{+l zu0!fj^n!Y~G7icm%o_4n%SAJkpyu{q^V`_lbsXI^?a9`+5Lf}ur0U z@F#h{L<9bq+ArWcLYnCX4^J&<@~jS-2Lgo8>ed$j+Qt!|7*WWGMKnKTB`~Fw^RbkN z6JQ8EonuBf*%C{lnjUkWolxT1E5S7ej(P8 z+2EkT50qKON_1^_!0;v=zmA5kZ6{`74l&=Y zqEt%7En>liV*9?9eJefjVl$n_319*7{RnD<0K0E=^-vq+B7D_6;d!}{ZS2pwF6lI% zX``JK&2n+Oj5yJpjU>_oBl}oB>6N2!Pw5pWOjr@Sk#m^x*58Tz#M^t9#gtpG?=ceP zG*&flZY7QdUmXRWv=L(mo&^KhX%R{i)6U&mwR=Ml3(z)JKUP0L|!-^1b}H z47}$~7<+v9UG~=C-}RTz=Jh{@{yhELYqEI^@iZU%@Zss<59R~FUH$`*)e1=HkASpm zxKc_CK{B6tfU?8n#H{CbK?)vCbhkB0cj5%AH*D?%~xhUUwk)o_KjT9lb|1;H0QG zWW1r}%EjZ3*?d%dR-A*h$=i*L`LvTtL0H;0RzGN&{3=}`$ZalKwU(0Zj7>4X=lL7C z9DORL%u%}fWY<{kZ1`d1nBVs+D@#|+S#hx!FD9qF-G$!t6+)E&c!F<8SxQ&KjM@~r ziS*SUSl48$hPCPA6HQfZP6epPu}n%q;bzacL~tgVWb09YHwPq-&j0X5w{u(gqaBDoSAU+h$A?uJatO|Y!iw;Leu>lr|R@|Nvix^vky$EOd_2~Bj&=; zm1+3`p%`>v?=v7}5Mwd^1Tz*XqLM>?2Ta3AP~WceEwXh7^rkuKSbFChb!lM*Umew} zkEc9%5Pd!kA7yHOfh3x1VGwTCLI>bJlwIZ!%vBkh)GR?J#9CNyhe8vW%^JkFr-E@$ zs`Rx;fz`|ejseh}XLhE{cU%s97_;odjRws+V`=BQZG^@b7S zTSg&3t?CPv6hU7{0*(N2ku-F;RPz4sk9BR zhhL*#j}FY+2nA^Nk5qBTWV>qmR<9G!X0Q(WEUHO2nkMDgcG=pYs3FW0#HBAh$`M_IF&eneG>02Z1+{s;b| zvr1^o?VOmgJv3)++N4y=3VTOckHk%foKRBcg<^RQHmS`iJ*0C=Iz;W$km(8W^D1t=?A?fygUFkFv-?Bq#QX{AVK8azbkG(-Z|B!=s_5kF}c3S(&# z1dh?R&VB9=@nbkN;_Wd&?jx=*ixYkQJep@J>otL*CyjX3qr~r4SUx{Hv`qCKZqJkO zjZMpEO*j19QKc3B3%_h8*MWJN-tF9ArYN8H7?B#>^|9Wi_;T`O&u^X5xG*WT^#Py9XmIzRG11oho+eeE|*{dK1+v1{u-)k)lZ{mVqMySl61k6!qf z-%rfisi8wah&BC>+ToXDvOlNiYMy@oe9^b7oA`darTzx>K}zV&e=~UCanhCF&5gJiQm4n7DWWuK_!fr(1tkDB@5IBQq+yw+|p)i_L zh9m+_YlCS2_KG4%hALi0Dw~^ty+1%%{(TI`>$J}WbMgx=@`?nMO0F!*K`emQA-Ue+bKPFuQuf>5L;8Bd zuZwB52u7r+N1k{_FeUP%FMEY^<-DDkZT942tKvn|R=GI>)z8tJwSWO4D1~{d^SkchrSI5n($tGcfwv zWkjX*wLY)n?PZy@8N%=SwS6hGLqs2^~ z7FPHIx)zI!`qmOFoFuIZVctg?GlB5@n~L!jh2%QYcaRi!qE9JAcve&4m%wyKp~}>Z zw4JH1uvFbuw*5{}CoGImOU)~uBh+J>p@r1x`(&;MusxUD`*&!Ehd6Z&aN-|8yCfqY z!Sz4uZQ_7DY^SX_h|X>wH>tR$=h@4J7pkGQgqwpB=t_ z)E%)y$+Hi7tj#qHi2%%t7a;pn9y;N zg(77SrFXyD8#?g`FEf^0D<~Leo9+P&0?k8eT6jiU@+44#O06D2{+ia0&lm}K_Q{vj zG?u3u8~u5sj3!gp+5V~kcN);&G^%LRq?PgA*Mq0Ppnm#8`8wxh?E;fybFY`?S6R} znCq#qmTj#ADiF@2rT*s}|EfDIi4H`#qinlQ$?TZIWJMAO{)ma!0cJ~gAmhN18UfeD zV!Ond3tia&-Pc`!=TazQ7a%i&w2)hs*SuIn0a|Q^^2$xVL6hXi359$EB-u!OWsM2$ z0my47GAL+^^O@)_&Rb64Oi*s!|6q5%Fk*GBCFO4a5VU!BXzOm_| zaUa8aG)^|ks0$5caVH)sCwv1mgRo$&ox~nD%b0HMrFZ1(_+?CSmBv=Jij1ic6j)1H0i4y2zB~Zb*TL$^#oEqR=)9K# zd-Ze=6xP2fO16!O>LVP()?by4YzeJr$gFqiubW4_ekYHPY#oYP`1o@u6Lmf^kS@}z zKqX;+{{R`0Ud+S*9}cINVdWnE>6?oiI1(HEYN- z`?6WGqOjq8E?<0MW+iK}o;TkIAKoeJ-@Tdt`8X2HZQ(0vaq)->O#?z5E&l{tLamUu z>6UjsmX_iJ_vx1Ro7;C6mX9ATQCX2sH25{!@vCuOym+x_j4zQ2z zaYaE{+5!9qHatZ892s$Z>~An^w>H8Q`_YwQA{sVb(7o6!=93HIpHfN^kd3p8iWmKJ z&)4>U-4*?-VI3|B%N;2$!UAN=lp6PRmiC@n2rzh#qa@hxvt5q^N8 zvfJi6d@p&J$@=>2&7oe1t-Z!;Yx<-0N7F$U+wCuh3LAEIQ5BjLX2#eyHZuw$xnrL4 z9ELxrT-;wd^dCON**hI=Ikq0Y!?xU?vL8CzuY7#t3$jn}aoDK=CLaP|jca;vhY4?D4tt0HAMD--Jt9 zKnD61^UzAZ{fI6Eo-)=8Fr+yj(mEuvMtl+|I{o{jq2c_?VK zYShASFt(R5@LCN`8it~l` ziu=($Vc$|KzSZhL%mvhQ-iyza{zr@X@5FK)k5P@X0a9U#m(76L-ls_kEj!eI1sCa! zolGkPn2An_ZGNLnC8YXp+v3){yKnR10__klLWbW9Pm(<&AsiNE=|(*O*{j8S_O+YA ztIV>he*R}Qg-w#g_M1znp&8uXr26H~Fmu)K+{9zV{+FQ$GF0HKX>7;yvqT!Bci-Bb z2(qv3YB(97+C=X;2z1-JRjzVd%rdDuDYi9pU4NHdkQZjuRoUGm%q8kQx^EGr4VEgBKuzcxm2q85BQa; zECxeKrqWF3I*5(*z*Y=6I*_bCa#kwI&DWF8VVpPw0UE@U4?^!MY3 z(FBGnFYJI4MN60H<08va)hOS!KJCUOj>S6!e5we{{p0@~3!wCR zr1htD!GDga#P^dF@=cl!Cl8x77xqhi4;;(8aa1YuTK{6Lf)YG}z9IjOz0Fui3W{y~ zH@*!W8T&UphGN?NH__mKLmoWOanAJ)iLDg8Xc@fpHh9r6XgM)>SuuF!L-0c8~Y!hQKjl}^(}H8CjcLEIHbHrT0mq39;Kk`$tBY;ij+gA*71sY1cJ-SFK}|TkHE&|L-INaSc6l!v6z)A zt;&>>0Wh@icSh?kDSW`*>F*@FY6T2$L9kO#4sZ$1b3wP$Yp#V#n8-Ul6)kq<8nCuA zytAdkAX~Txdq<@`R<+q?B13&Vlvk%2Q8r)a@`wL*HQ7twk;x_3p>wr* zd%nOlPD6d|avxpKfpMq%ckNN<UB$~!#Eo3!c+a4YXC%S2&3&nejmOXZ zDaibUxQw=}KD|f#=eGgye=nZee9ICp@Np1Zr|(X1#jRe`UWk|&u(!?1Dqm82M-smc zX0?2O-Pf_MLU#usjg+k`ONk-`G3Kifyvw4KF}zONi)Fx4VvK*zU79a9PeLLC;b%o# zL1>`Bl=nch&^HiDEf^qyKgeT5al;z<29E@CDGy`x&3b^Nc&&1WakA8hhh_i zPyl!|oThbEj!=#+u%QEjdlgYbl{M!o^OXpL?~)^ArPcIlj3k05{A%=} ztSOi18Ltd+kn5}sLm&4nm})@)oIx)YSc6T=yy*nmAWd6A7ht z3;Zr+>!K#=h7Q<`W^n|*Ni>ZtQP^VFjoX~wE|^d(gpUHR(MJ;pg0E-4jfd^X;4S2P zKbIlJFJ*^n#^X0D26b@Fc7=TqZbmT5f0t$M@9$}@1iqR*?!(|l$l!6&oem5?`=>S= zXS4p48=4a!51e#*|Ev_TM=F1K7&oQvDP!k2d-3C3S^$hCE063zaF11oE_fHK&3?je z>$@N0FZ?9b@3s7qcdCMje|9ws|DXIl7T-niye<(&W*BR=Wtgie(!CLDs#mmeoupCF zR#&O!PNepC8G((|19iH|LCrocD@p2^-X*_L5|LfCm!|(9OuDcNJ0s2yoIDHbx0g(W zHdwzJ)W7O278ClYWzG66SB4W^4{$_S(W4k-HV#P`tQr_!4X2)>(9KYPF(>ZV%LE!_OeVhqB!hH& zYMMV>!x_J7&9d;JsSkr%`k7Q3<9WIU;TXG>Pv^Dsj7*>ynEpJNjA<^dPA{416_;A2 z9ti+<3imR8kFkIbKRZH4g}$LgsEDqa=eHaYW4ca{^}AHjqWBq3A6=Cq;THBKUH1L% zp;5eaRnD&S#MAiZFYfa#Oe2!z5`C3vc1NYT0umKk#Z@z|lfScHca;m{s(c9)6lVTI z;NUY)UEmWqUic%8Q-bT140(T$w-SFWOUtbjCAlExvQG3myGq-k{Tl};uTnNxM}7bD zxa5wSOG7m$FZG8|*`t}0v}q1m$kK2D&+dtq;xKK}HygRX8*FoFH0XX{uos>jGp?t)}}q;=TX-r8*F z6%9s!>D4O}`kb}vmV}Gm*j>e!omj(4ghvFJt{gSY$cm){MtGc>v{A*M<45(zmDzVv zdIa%<@kYj^^{@2XBo1=20=&V5g2u~csg3V$$}K5Ov;1P;P$>p{H4hc^EF~c0+m06Z z8x?v7|7D$;GBT}U5u>diW>?TEF?L6Ct#UGLC(iPB7F9l8e8a1uS~LH3<={H~P|~sE zS+`_9k!gO(3w;$`>Uo2V)@qsSeKE@%zMOXMYR|{hun`lkH~m+Yf6Y#9F@KlXvxSp8 zTo+j?0#_hBqRj$U!iG{vjJ4;16E(fZ=O`yr&)Gd99Pc{-`yyifnWNp-eC~xCaRg|A zOetU0G4t579Qn#@5rD7@5M0*MHI5#K=9JU*9f+@k?>`%8{+#U9l6h z$H82Z$-U%HND6W~uvL6%ciWy@B9biUPEJF zMo)&eii3z}4H_blKv)nuapR4MOlSS2mUb1k!Wo+kq$`q^e3F1xNrrbS=iTpTpMK<> zngW83d4tQ5GS4uEON53-NdcZ;^bu)x8-B@)u`aw!Wu<0G z^bTFwU>wc~{ojv$_=4svV@3-7GcjaU{#eg2Rnoz76aXZyA^nQhV}QW^G6R-^w`Hna zK^%mx5T1mYsW1dX3Q2|^)ZsEgNSe7Bp-s!DCQ}G>0H+pCzq^TOMFL(UN~To_{gqFj z4U-_rR&XQ%nZui~ z-bp+>d86!sYb!)$8t^F?jdiK>ATx!dl!9NlGYo}Iw(TIFt#32Mlq=EW=B53DMiBia zY|x97Q6tV`EkH09tnd{eTEBpkRPYLw9|;qPSs6AD^1ioWVaeDKqv@`&kawH~%*}CN zX&nKlF)qAevVY@Pwc`}eRApc$U>jT&jcP75Xr%odW2k=Oq!RZWaj+OSOcGbvatwKrxVuBdP zMW%$VyxIBzCg`v-VBGqkQ=8-n|C>4bZhGzqd4%NrW^x)Hv{Q|R+;|xUdzCSOS;%`K z8b3Iv0+AfpWuq4&g|-JE+hvl^?+CE50hg>GY_t5K&3%lvR=1~Fds$MeHWW5v-oHVs zBAwcwoJ_P^da{zzosAmLvjwp3Ab6Ry+R-$xEkmwZAIx%Ful8`O)}!u_?cZ4`N%iJz z3r4cdID$(D#P?+pEHA&9Xo%BPbLL^tA-mM(|RYej0EY8xg(4Xo;52h zlvK%=jtraS$k*YPx1>W_402Hn~ah%G)(6w-d#1Cb-S0B6+wvAQ@S%J;-g$}yUs6GCNxvZ)N)bNGPm7-N8T zvqOYD9e+4=KqZ_6O}_S6U~R3*`Whxjky zGIFK8u1eFWl2xlpw{RjqA4}12O4dMUaC0RG8i1|1vWcpa44kqvsxr#CvIUp2nz=HH ztC9z~(teDk(*Li9D>v|aqR#7&d1X~VQ08R9>}Z z^|2QExY(WB*!#4;o2K@~Y2_Z7+N@*g;IMT)d!UJPUH(Y(C`r9Z{3j>wMr@wvgf3M& z>2)*Ctuzr0YljuS?8Vi?9qt?@COo?1+^TSw;=%H|33gQ8kO49y82O_Jf3cg zi0&5-)$T`yON#x!s?pu2ML%kEuU(po?G@*0ng?C9CR~U$xIxk`9D6kb6we0PdD}@@ zNaAP7k$?wttn4ncxH|xeSqTp{6G^-#zAKt+K?^}Dj}IG=3PXsexOQdLA{GE^cINf= z&V(=-arXhTgIeAZU1EPg+co;DI}-llko&3@=c6mOy)!fH0+9wJF>;$v#=%)Y5Wj*yNu+9 zgw>vK*=~y=S&_b*WZ7;nc4HiDo1k0nX5oE~fHBm!qL@z4m5sHg?Ft4tOAsE>_)xWD zrZ|4QdNyptA?^eL!QM#o#VH-G#1gxFpw$)AalP*h9h~E=sKRn_!av0vQ6gCD<^p^Ybikz7s11ybO62b+zF8>m2F%OJ!j;kmwgg zavPuKgC6K;Jr9g+TtJ(`@+llJLd8nB5yEuXu0=PlsLsMTG(pVS7F?cUpWH0(Z+{ck zMAM9b66RT~>I=Jj3W#(C;w1M6*tGyr)-rZSm}>M^$S}A6*_&<;D?6_9#m z+NMEz@*!CV9~F*@Q|`_^ML9}d$?r8HIG1a&G*<2|y-zMd^Q5Cc+JbIxE??{fIlj^Now~3wUh}~zG zPHqR!|00|_?9EiGT`;;HVZYu+-$p|JH1wbPy!lg^j|^-Od*9LVzC}!1cVO!BiGYIzjh!w{NMA)g9Yy17j#&vibopyJ1160 zI&_Lq>XrpYH2t_m8S~;QpQ|p38qE2Q?y*IRaj3C&m_>`(`;K_vaSzPv`5AtSY!Nq` zs;f#6?FjRC?5?m|$FMh${P8*KRAJS1dFaec_OIZqHuv>^rqB_x($+;2;K?Fk{p;?{ z&|S<2(T`*P!HyjEa;_DJca^cn-JpPM)h;soqqu;-MLK_Fj03U_{fvqwD(%ivrv4vk zZ{Zi^{&fux-8ghg2}74OBGTQBgp_o5Np~pSjl|I1Af1YYNOzY4QUc05pq`^1&$)l^ z=lL71@7inawfD7`o6#K}H}S?OX|8A(hJ?ks1PiXjGal3M&#sFN6+CVLVrr*P961F% zne<#QZ5m%v@4BV9)k?Y>;x<}ky5#gRHWvjHDDPwu^+d!rIZ5&6-7`*vZ0BqejC_f} zv!P_%c=Cm+A6`N}Ra+1W-50bT0&FMJi|dGe_kzgFr(FXX%tz*Io4#!D~?9VaF&S{@p5U|v4q$eZDqrg**g15@6 z=hl5BhkmFN(-y%kloE0_s1HbjlDv0a>hwDN6gzAxENbx7ap_Gc%hoE7R50KkW3!Osc`_lI&fWtm#_69kgt(&4*e z7>Y#_@i-r!V;D(9-;)fJi6S!!3?!m~2ViuN1tP$gi)iEfbO@kuF>A9Xb&C7o(vpZB z*s`^^!*j7Fv7Y<*bs%z}CyWA*ud@UI$hdOs8ZgEHWc+r&gDAh9jx+#pPG)q)gd#}f zPFo8&4m=LHV+?-|@C)e#2xl<78$2P?@DGJe?a+(rnn=Z+ZtB_bGhb^JF0;(?80io| zN6GHpdtm54g~-NF{Dv2JsNQksF8q?7!%##RmD}0r7b4e#=hVs&r*$L?NWpH!q}}YG zFYiyPWHT~-upHMtmZ$_wecFBiqcu}nbycA>OciFVQI9!rYzrj(6>PimsLv-A|3%u`u*VgIp^X2YY zJ}=e%Nxf=bCrOc@J4egQ0E+y2c%Ntr3`3+hkumqV0&@=oDIWQuv=Pzm8KKxDXSrxt!aWv93!$bGj`8Rwm4k)7;=ovLYm_w9yt zv8L_k8D0+*09jql3lg9CPsd-WewpQjLPFrkrTN z77wkj>`E!swNI}%(ls2@JP7h>0y8gVyma?$7 zv-p1g@J-r;%@-+3aRaw{vYSkD#cvACC!H4%NoYk)zNe7Ddi77EI&N#M47 z!?CL(okWbT3Dfb##Ep$2P`I_Br;WL3sy1Z^??{aY+Rk3LzL}*y@ z3FB~R)1(6kNXT;TSJWEen~vyEOu^jY(=&9LP)8wQ2|&<5wfCKchC5!ttSRf(aI?VI z`m*Lv&6i~qo|7mz=mOsJ_jTQ71fCaLc*H;RD5R7Y%y59g$Nb%f*Lv>cK@!8Q5gOok2 z<@syqT7i}mJ1jkC`bLCuIOoH7(sAa zWY9hU6FsU?*arCq0fh_q!ljkM2A#D+Z@n7e+T2U`F^&)vcU&xeMv(+~@QAW?cN9uV znI%~TPPajK<~fD(BLtook;lzCYGG#N_diR)a@*dQr(zOX`-18=yGl$$#0ZVDiXtSD zh8-T$t6>-_ncuWlO}I!24JLnE?S)#8Z)n%+AQcjsn#z>F!wul;tu~wYe7avoU?60w z;y$suFkRs^V*J4*E-wa`4YEIc)*3Gf$txz_3a~#cXcI7a{f{X!F-)bD_-wWImJ0_g75GSP^cG1@b~WoCxXdCk$k$32$gl z6%==yb8Q|?R@J>h;0HqC0kz!5HeAvZ=gCnY&W4S)v006|Zv{{_nF#k|>)e%1p?Kv{ zC7Chqfwu=8`~)DlS4UN#=oRZ^F=e+9>hPovh-)Lx$68L}@b;~k#So$=ulTY6w7cw1 zz|dzh#tN0eM!M8^svR;9>#-hIxgLv|x(-_cOJqJEHn4CC=Al|K0@DF(QQR`aHTJ<+ zGT)Lf9_f`X$$2|a+kuRnSX7&grK{njRgcOIz?3!NgD~RcAPe%_H$K3eQzknD03khq z1lB;uGqN_KHGwMvS^s*n(oO`uy{9gr1h|hF$xYQaR1baNDM(}J zsxY@Ap4sqO+@gC$VX|%emk&Gi7PM&dq62}Kce2z`FpCF19j()t>nS34!L0aCp$a9> z*eHfXFpG5|pzkgEFabtBLanV-wKIeGKXmMLUI7gh)BIq#!@r6#ZcS&llQkT$3!U3(K}0NpK#_cLf&JAQU%%`i~{k&4FRoQE4Tm zU?y|KM)<;m(07le(#;v2iYkg?6p$W-AUO;o`Pw41A{2n63P=XQ0W9&u6*;|8zC}#A zO;P@BBdA?Kv}{{6Zw1eqD1=gEOBxuIFJM^tFqCx#pDmUm`;oK*V8)bfl3x_6M^xHz z1se0&OMS5ZHJSot_Tu9xL+QLd0sZVv0k|>U=-7use#CKsMHAoObtkF%TXd zV$4@04YFX+9%2X|qEWFHxGJVDpl0b};HH{Hh+$Z0OJHOk*cJ)kHHMC0XxagzD=-4> ziXI>0DM$M~KLkD{hB8K0j6`-vi5%}fF2NW%>DX>N1_gBt1wA!6J?1^OBQ7ST zdk@C$C5ur!Qlb&NI6cuvM_jw)F-C>}$Ope873PdO9`L*BCHT5)sD>W)2mM|A<@ znw1A8mMcZUs4vR%1r@Rpzp*s*49GRBT65KcnWV=!Nsh&neh>U1*Q}1|JIahJQ>^sr zO11nHXALHraQ0`5^!s*B+!A-yOU+;P?n@`pX*F8!y+*=W9>uSu`dd0k9KA_!nM@a?tsZ32nYtw-QK z`<{j`mayVns++)NBs1Nk!gwh~%;RlaqaEdOo`zzsE z;{>Q2R)DorD)Vlu$qxTzQ$J%D}I>W`IxOmK7lmu*I5HJ|N;ooQ?m zFB8pEFOwM+kl-D{_^0U`q3ftD0nnfFG>|@ksgm6|kqhnb!`H8=n_+efJW=8;GI`=n zqH6XeI>`B+qxVT(VZNJ}yLzG2AVG3^q13h0j&gbxCrPm$-4>3X^&3KqsG_z&i?q9K z^{eGlpWRhT4gI+GG(uyL>8lil@JqDbhN&^c_9+!FYQ4_kSs<*8v-r@smG8miZ{xP6 z3ct|%0N8T$-r{5H`9|@_HWc3Va?Wdb)Pr^@Fo&j`2GZ5XcIe5t3OIN!s>2Q#Dn8aO zRAJNuBV?T3w0q zA4_uu&+)4BVF}H@=j0v8cXyhUp%ErQY*^aRP}{ z;f28gjN~Gpd6>(q_*kHrfUD|;#V4pwTC_I62rWw6j_ZpDu@@=prMrrof+zkcav@8& zU4b7No=K()yau+X9s39=36h$iQgk5J!Fj1{XK}(yFv1{<1b8)~AP#(LPg4PKRk00! zG*4*9HD7h;AJww~P~WvUJg|F&YJhzG$*F}L`H+3O7!Cbntw=HDVTiy`B6>AU4=HD* zt~$F6j$2)izmZ+IyvS5>6QbaKcUe`msrQ1qS-pM$Ju)tfRe`X01nxl$*VvSmx-ciU zV-7tQGj>EGl$hX$8*3(>dr=ftRsB3O(PWR5Wr>l5`W}#oLg2xio6hVwG_)!e=N=D9mn8nC204o26uFa_=1is0V#KE&xAv= zy3|F%03K!fY&L4%R$7@mLW<=9A82{mv$^gVjOSXGGaH9YWXLterAfRC$E6C9CZbY4 zq7r6ksX&WOCh?}`vGDf+2=&rm+ z`G)W;p>plJWE-#DOWicV_v{-w3N|0ZXTQLo^TRkB`^M)!f&Y})cy;m7GWk?*rE{_s zc0=92Z#n^C03l=bvxVRq+mv6_2KWi>E{E)6oSuQc%DhI*u*4n%il-+awv4clVrZ%q z_mlgjpV~EXOmi^gz;ygHmM8%wk+2FUppZ|j%^_Xwq{6Ob{DphvkH@DA6w1Lwx~LyL zcajl$D$13RY~W_0-%`)Mz6ObkRv(eM6V6es&_6}giw6r8a9mfhd*L$bpG)D;ZW{Hy z;0-}g(cY@LyCxWcD-r6TG&NDUHK4PQ_3YvJ`XQ(ZbUJ!pzf&9k%4!G1cz_Wi4{u@x zyIjS&P?H@g#M3wW8DvbRpB2uTED3W?Mq^y8dcQQTAt;!;6Zbg2Rvn9rbPeigTLwo_0En#trEc%k=Dbigx8f^=PpdmAf4l2+foy1r8xsocKsuKWeb6yuiM zX8sw@tiyr_9}@hX*3rEsZ%AQEfro4tTG;NuYPXy-HUwSz*`jMry&4WAv{=?D_q`5# zCk1X$7x+3KlX|r_a(z;!$>&Azv}*4Dph($MT_%ncdZKk2A?Ash$ks>{jX1tOx7KF- z0ojXPS$y0O@E$p?$p(pBJ|lkyc- zYMl?LC2$6NL*yohtDk|3(UxoDjqAfUnrA9Bw#G;AyC=&qIJc+^%ilc8^RP{%4+vSh z=)TTa2*yUhuBOMLG7L)pfbCd( zIs5%YUi!B<8D6dU2a*S{;yNEH1yFMP(bQlT4xR3^w~ z)PatPwnJ(_Oia_PQ&Uw%cZqs@YwoAv7#{Mzrb#ZAd4ir#T=1k+gHIH(d^ZB&Iy||T zmHej2Fu|f*5%W3e%D^-insXfkvnN5LOR3SWe;f)fu{n-??4G`5rnGg$I zg%}RI94cmK9BxWrf&**D4Q#mQ`N;Gk=p5%RHV;^XkW9=a9U}}jnu^Ij=v9z;wFBNp zY(&_5E0Is$1gF;Q{r%;fCzMhJ)Q;)qe)k8{V9>LQAa7XnY#;7Pp^Cm~{n|O1Z#GM!_^LDE-wm+vg!&-8| zo|eE#L41mSALm(&hntC;RcZ4G3v$Y6x$wTXM&&s7wi;m!qNJCfj_(r^L^ z7p~o~FvwoS#>Z=%lJhu|x|*f(H9AYu%C+a&N}3Uf@!&{o$8w+fyo<>kv`a2`%v{Y) zIB5(*(#Q%V&uR?KdeA6}91@F4n2j0cV0lRFZoN)AXWNBdJYJsmaiV{A%fJhs7{`xiOX$hpj6*#sBHd!0ECnsTV42$&w{3Yur% zrF$tJmiwYR8{a*bVaEF^R1`?7_88GN0nv_=!2bSJoF<*!0WFS@tjk%N78<{8YTqE$pIA4Ri;8dyL!)I(|LT*)aT%VadD~u>1v#h>r zR^5kL>8jvN#(uM8Tw52r9FnzT z4R=^1MsDxN6>zAAWx|~i8LGmin8Gd@tb}XqO(3hV4X)*4eW0!HYNuFoeD9NjQa>Fi%sRY$csF; zXpYT;#XC~rvJ1BjBYMrTHwTNc?15THWV^{&&Sr_{VfXmN@N30<}!5yM3$sI?50UYSc}m0xxg?gVsXfL?ZM&>_q-*{RL9HI7GBj0^xa2 zpjhv%);>Y0)Aa!AHM1Ic)EO4D;`rBDYSo!*0j-AW5Gz=0hwf9w*0~nrBI?zdHnVza z-M1yG_p<={X*Kw2HCRg5xun(`G}mKYG(=tM+(Qwa3#5qG!bxloOE|-UTR4auO-)l7#4DRT6{otB{a7cbilz_jE0}@ew;NK=?MzCN;>H!vv0N)j= zfFkt38fdNn(*copAIwi@V2oO3(g8b%DunBC#=*s|F|T@xOE@dr5d`D8F~myDaOb6g z>sn3;zC4p2*b)S0cpijXT3%xMEpG-&dn8+C6yRqc;}{MEl5kKOPUGHbFsJmy?ix(v z@a{2&|Kz~G_|a^HuH{XtvG$Zq(>Eaw^4akT2-r0!>^Fqq$+Z!mr;EX>^XSRADxPt zpJiE_GZ$Ou8Q{_p;1NNHKoI?Cppa{KaH~ekqbZ2Lq(!aLeQS!anlu08F@BgKH<_mp zjABm{b-E+pkWdx=lB89oI3WfxsCc|xS#elrz|!iFHw^2+Ll^9F32E#Ic~EMn8oB#E z{j+&b<7H4a7e+|{_{~vGrxZrT^|4yX9*%g67{a0Y^;&QZ2J8?YP;Ra~DYq*RqZ>NA z4aSa30JAI5u)x*RqlUsd6sxtfmk+xHo3IqSoQ?A66YkmdYK;7Bsf}+)+vo__Xs7aW z_uI?oPx`Hrt9on%VI8YRDkTK_S>>hEdY){J!i~~$qZ+%I;ZUoN9%>U&#p_MB*o!>1 zJ6VHfF2#PCJDj0U`q~0m9rPNexx?OaFf)xgDDCwEpH1(TEO{zUZ3%W_1Ve{qUj0yF zx6EL!r%pA|p#9E3XA84aX^>0$kX?z6wUu2xa#IB3)YZ{c!hRVZXoy;UdOm{4=Gf%Q zo-On$KcZ!(#7f%x889FsvlLAyouT;wy-0pBbK1ih5w6*n;S6o5`IyPEpu{Pv{n_Z9 zELykOSD16fUxu{f23~)`whQbD6tog#^e}xhtfKfH{@OQ@-Z6n7BEH?V)3o2+*iL=( zP45$ZUcCLTs1#`biANlE1NCAfGwt{A9Y<|kLr5>XxR=KdjCjt`9tzv5mZU0-ZQ13h z%dk&C+PP3Mas!o~@o6-Ybf?TGZ}g*cc~&Ed_{UTz>I@fjfW;dc@NY`J&3N`-W|?oA ziM{biQSK_z#+t%gRfYodP{2Oa>r{nW<|G#)B2&zSDNE3wFQa@OPc_C#PSw<8NGk^{ z29Xm19?iqFtJy8fz)fzO12w#W=l(p7xO}bzD%cUiPZrh}wRr(V>m0so-Q)%W&{VDG zTybnAe34iqv8AjhIFHkLdZv}jOX8KX*ZWXJ%df4PQyh{@toq0uFayH zN%=7OGO(6I*Io*()@?qZq9veOHb36+HZ&FIi(ncO$;~hTk7Jk zNaq{3EU2NX@Em^RwqGtMSQ91#xs|D|qPMJ+RpnvSUOlwWcf&sLDi7j+QybkG9{h2N z?@(#k#Ch}qP9_%PLwZFVC;@)p!B_0Jv()VUWgV)D>MvoAd>3#LW_w;39KB0Px{`5z z{(gu@keADQocskHl?`yxkkqVfTAsXx`B7@&${}T|C4BAStS5F)wc;RK@*wz?%QA(E zm$^LoQt9f3x}~&qnuN*F?1$ORh;r&6k897K( zO;VTNuO-zCz4=`ONz+-%s@;dwkU<#QJusUv{vj$R|tr z=2ZX58fLLfr8DGIzvXnfo_83>&8hwz)A3Hnqq?&BX14f2r$*fJ#aBLPz4Nm%)=OO> zU(mf8I|IThLhng0NI-8JBx>qW>YHomM-5~NqfG2pNklWGCZ6KFX{sF_q9=k}k)N*J zpXJnlYn{_65V-Uk<+1L1vhE(Z)mrAIMD|@DZ4(E zTW~t9Ngpb9LF4xvI^12Q4wB<;y}JA~|EllpqeHif(-Z0}ooh|FMIXeNo?skQ&aEYX zAZL=IAGVt5av;7jA|^DU^VV`OSrE-i2xWrlN+?Z!;Yt`o-PTGtOE1l81pE8`Q4`LM z!qw+|r(5^5xWCe@MLmF%T#J?ff!AVWIJehg6~t)Q<5bkl*5fsd!Rray&fDvWdO@@s zNk$1~8_A~m;Efc^I-dM!>t5Q;G{^U5o9V6_;LQxr)9uYnA9%X0tN>hdQ&VD+qOF_= z&Yi8?C^5S2mvL(5+j&XGMcc8qG4HnXvw|-23mUMUDD|)X7)pDxd zo9~u3Y!vO5wVdwkmbb&x?^RGIOYK$mgNO<$iCBqJs=b9S<7yNYi}z}$jEnc{=A3u; z>z9J)KQyc*+?t!kADZ^+c0V*944PWC$h`?KYdyX(H?K~2KfVGWFdVdJjhU~)!cvzU zbfR+Y9drS?B5b;`)h!PLv7VG1_7c179rlq0GaU6(CR!d1&=iy$4Kmad8}?Fl?cG z%5p5C%ZloH?dF|^&9ci6Egq%^IZ#l)B8>q`{FgDp-=P?28{fwWw4&dUb{mSZCV&L3 zbQ6lPK8Ozb5sHDP*fckQ1sc8$#V}W|NNE4%34)~6= z!sQ_1KOhZ0z5OqwnXX21e@EKt3juiAwI~r>v;P%oSQzYXdN)Yh-bl6mhBRsHZ_a=g?nB zqc5@?5yAT#Y5T|H3gV0>?^M*SPJSS5|6~%hiCQOU@WSe}2-`*TblS3h|8&;&1)t+z zNIP5bG(m1~Ui5)Esn`A)9=MPx8#0vCzrf=rGln+!HZ!K1`<94q;bGK){v94tNI&2a zOrx_ihx94`HZ$g7l0(60qHrt(9*zd1x#Aw2H&eE;0tL6nH<>Y#C7L=?CsK7Knt^&< zRm2{UDOOY3Haem_Tg<3^aY4gD-l6*b2EyqC*+b)4wTe&`T z?~{25s<7zO*IDuAdUP6*ghau@i#S;qhI2TCDkUtVYYw}!4G6ueQ1|lCu#P%(MtBo6=diO_gT-J~@uy&+zz_h+;%H73`Zd z%#>5CA@D%AT3*PzGr)s`n7<-MS6EUvV^~zyd;Kds{vx7Vc=X?|+YuQ8c_>$-3-0dK zuuBqAl)U>-A_6%he{4Le(y{^L8eERHembQuZo@sg%&q;3`x`tM4sVG_9M(VOP=P2M z;h=~0*_B@3BoeB<1mzj+Q4Z}3Gn1kHWY445?30$C-f(aJ1rG=j-M}Mv)T>h)JSM^Q zM|g0wi49(H2+F*eH=I7se)wU~`0bGMtnJT41cAqy$Nrg$0oLa_1@r4x>*c#}3pguO zbo|=W5jHq(NwGxMpVyO2%0B;0MBe=8W$}p%Q`<%#)j>Dj6NUZdDzA+_4E>>&k_MOA?N3hPFTgL}f0FuAtu+=RDDXF3u|n{83ZVWE zJSviB65nPxvEEAz`<~$>8Lbanc$?uA&m;FO!zr2e$<8~1Z+M(}-B?W{lPv+kV^LJ$ zXpVFeWa{m-HD2(r7$OXDa>k39t0BTLVNbn+u_r-iC;^OB^B}h_U7Bl4vw?2n{rphk z+H8WjOqK??GawYiyMC(kI%#DZB$`$7F3TV=2uGjDVqxyUW(X7mN6DH!CKmlVO}UuF z6|Y8W5?TS(8SG*i?Mtt=%ej?IwMVI`Lc+7JWH)`UIgmnraGlC>h)$MLFumnsVWCsD zy~39OIj%jlH2k{2gERE=HeD>)22b0UnP%6>=FBHJ{BtwMpQvkJsI`5)7CJ=0^#b5( zU^%;j*D`%kSK`R5(8OGq{LLgymnA(lvcJ()kf-*)3d6tY%9H}m5Ndn%C%QUD8u%ZD z;oo%iM`3tFSHI%%Mi@Tj4ZWeOnY{drA9VGLFr5DhkMzorwSnETTVePOkD%h;=&ID? zm2Poqz_j(QRrtKuAB5p8UC|MIkT`q)i!l5LT`}0DPj5WuM@pJ%Uz%hXDA1_`*0q~F1 zvfRE9PX1q0%cMg^bbm@M8@S!`_&c@iR-lcCD&OvTKm?jbbx~YEK187Db$LxlId5V^ znT{9f45?X7*K@svym-8_`DFX;9Vd@^=Ajmkvx~cFn6^tz0a&r@o(-ideWV0jx+slD zVgs?`j~6^K9E^k0gr(z3C?scaWK*_q-dvCy(ty}s2HJH81>rbo?aGB{p3X27-L-k% zsHJaH$D*>vG_1X3SF4~vX03b0^O%NHO}Tu*InV}5Aq(+(p)Hja8EZ>5SN>I+r^Vak z`Q4yLnqM#9?(aL~FKWCp{TlokkI=^#se#n1lR$&Oca>HnnFx3*(4@AOAg$292(+JC zp@gSmk=*ZHS0z~Ylm0gbsuR&pqXt~*^ z(%<8=8)WJG=Zn8?LuD6cykk`(D@uCX3jM-Bf=G-8V?=h593}?tU!39|-%&eNc{u2J z8uhaR!v_!nkf0v^{{D$w_5V)o>j=XAmfF{iL-OCLeSd!c-%|T-8k8TYedQR}Sp>JK zeMZ+lIw`hhDqk7F18a)T}%8*!$dzkEbFTV zd#U;u1m(Kd$&?$fJ-A#*<`r2@n{p(J>r5{kmnSMXyq>3u1Zv~dDfR_L+8ONDv*=BQ z6bsGT&NqYoN!yfZuZkR zRsda*VdisljC6+&K}FynR=`gc|7RfZ)Pl=riCxTxD(om>T>bk6G&{7z$gsIlL5=0m@ zlKVzluiZLv=bAssUL43*fd6L^ge-gN#{~TqU5ZHxS@!(94gEQ~6lJ2_67lKx=+c4e zP0>jHTM=L?Y%GyXaO2W^k1qYC2!8ttH!jVM2)KzZ6{N~ezKJevc3R%inHKbc_@OW; z@C;Vv`mxUt=ye&ED-5GU@ucDB&MViSM^np}c{Wz}yiOtTAd$sz-0Db^EY^h-!KHV_ zhD4V87tEH^4Yi|Xj7!ee0Rp2J3R90oG20>E1z2k9I+`N;^z`-0SPdGM`BxHFUuZF` zo;L5|>-_Y2=7@DsOCP-J)T>31W>}KO^BH=_w`ZD7XY}5ehZlRxb(sM35;6fyPzfF+ z^P*HC>j|M}Ff=wYQ$q@bclA15=#l`!xbV;oF%GzLwOUro@#j;aWqE}w`V1KxE8!kJ z_%jjgolkR(xi_}nKTrKUMGzHpLbLW*Zl3B^HWpV!EhkkcyiW5F5OH)HcKnJHz&O3!) zU7Fh>Xr!zvRRe@UZ`N7ZCh;df^rj8PxbZ`^ud|7 zjK52To0aGvQrV#Ek?H;0sezaj?q9VEhZm#$HsDulL*jeDFJTQPL@Foq-lAknDpNuS zn(-DT7%xDwO|UmoAzdo{g6&2sD;}+d)tFB~P{N5SjJvH=YrC5Bbhd8u#>*6%f2|b zt7dl+<#U}3w6H)71A`)V=rm#7$Hf`3W^E|pKp#*N9HdqeH8?C)g_g^WY5GLYmt@B7 zWq$#k1^H`YUfWa|z)7R^awG*0G&EoKc3Pz-*>v(bVTGl>TD+s-`~+(MkeW>U@C&to z4Gic!-uoF`;gY{5s|KDQP;DwMz>3FoIY^A)95awOC?CxoU>BL75o%>NT53n~8>N;)xl80wekK3hRhvb)!yu4(pTYVb2kZlrQ5Lz5=--p6)hOc|;q z=-A|nj<#p@w%|K#e~=2_rv~=27@3ylgLL&jQ1ZK3WAfVm7A0lEe~`-GrUv0Dj+6Rc zXunPkZoEv0R2bxb##on$vUt~WVd;qNP3fWo!tF+K!*QFvH_(*;eAuoKFWJ1e^fG|AX@@4Z1+zB=3?7!INMsnY>4P+(&3Cg~izTE_6*HbQcL4vY%UpL$YW#5y|xCzQ0 zN@9ZqWhd`oLuCnvlgK`HG%3iGF4le4WVSO=AzQC|!Rx#?U1PP|TUt|RJ<$?-@l}?W zdu+M;DG_rRAJ5jhSado5!@Hc08!z>fMgVX%&if_hcS7#!>Ih>(O~|rCG3lB*K(VNV zaN4ywdYlz0P62f&rOz)Pkq7&EXImNgIRW4$W_)ru?8y9(PS<9UXWI3aLDXip#cg!PGFPCs3RO)BuqJ;^CUV`2mm=a~$gkBv#6A zDdx8y2iXcD$lmGqWUS5M zAoDf>CzvGi2x@!0P`OwaG8)~TtS}tPkZrEppKWm1-7pjN`MB8bk8-_lbT&cU6-&=- z-C}ODKH|$}!;j;3ygLpSul2g??z}Ib=y?6&>s?Rf!`1j;R#Kd27t8C@_twAiyLx^W z*}m32{L1f@_2F{@EGo!!q}z*dDk{zU`ZIPG;0h_r5B`-PRG{AhNB=wjS73m@jqH>H zY)~ibl%5!`-4+q5Jno?5+i3Jp z{m{1}cNN=$l6pHD{k_PsdA-eV`IOIp&ETjfc;^oTn_1NwdG&&KZ2Fq&>5nJvefMj- zZw59$Mx)<~oXhOfdV-$_9}hqRfP&)rS1hC@DZuoEqci@iEWT+@z7ziU=0xCkZ|q;2 zlb>a=?dtOhn)))G0LPEt3l&^8fJ6p@g?}kjbb>ycZy|*WeqP_<{cx^wF_YB=o%uwC zWWDp<<~o!2)!??eR$iBh`4;ij)4MpX2P0jfk2t)p9PHO+lezE?h%c13=|xQBb-wJv z6}#yZUe`l)1;FEED8>bMK3jI#6^^tK@8Ay&otnQ6de!Ki=LkhZOzwk5GiBTDoU@LQ zsW=AC5_HxyjS|6Psj1g<%mo8r++lK-ru{p0Li9}u?P&zC_K>oC0|QUg6YMrR0K#FK z5Yddm5SH}LyN|ZeP=ODAbM?g|xPjRykyE3WRuZ7b@t9hUZ6i5_6)r0O@jzE9Mb%DF z-ed2%T6j|BsBL6Yi?rnY6vO<`{1nfI%JqL+6ZlT}yseYbxe@=01<3I77s6lrZ!G-o z2LB?9|H8snele3sRN2j%!0&{AD~nsynnN)eDl*_n=af4?+%JKw3H&P-g4ZD4*ta!- z-?8x1n!x`uyu6jgmg$ztKlOun00IC4)T4iS_;*r5Zh!v!m#+L)>E1kiwzcjQZioNJ zhyOQ2Q_ULOGBj2TII%)6IOq<2LIb|VO5zJ5>5Une9}L}Cef#i9WSeTfkw9dlzt1fR z+|`2KEiNe zqVx3`6X0rpaL%kesdd54wO|s$-cjpLSZJSAw>YoAZk?R6P?8JyKxaV=?Js!+M84uv zSwgt7Wc|4A;gOK0u$(FzlDb&KMdXcyIiZ6AYR~uel6}XOZW8U}bT_mToV^I5D#OoF znl!5>N5#PP&4h=ZalNOsT8T#-A`Goc=_~=-9*-I0*rt?M;G|xU<5hK=i`Q6rnP;c% zEIFRo8AzKiV?^SXuMpEv1y5Sm4cU)zkn89pblqs&_;o+#7p40@Km411uvkf=Si5fF zm;IQZP2q1-d#loMHH*?Gjdk&isUrglw@yVL0!ogDq7^EJX zLs@+@o63urD(kS=0#@y&E4g3I-GBoWNqSzrS{yBm5 zLbxnhWCB>4H9>wMm8I&s3fgO&dV!_-h07X~T4PxiHG;Whu4v7)WXr)d zkgb02049~iS~4}MMMEcbrkC8ZNv6-yv~T)9=Z3VV9QN_sd1+xaW(8Sv7iN$(7peKe z{GS)f{)H*nv)#d!-Clu~Ra}fizpc6aLp5zFtywn7loBNXKU5Vf{q(o&AJ<%jMQ#3r zDSlcg`w1|A&GD~xy7<4(@&8&VyPcx!Gmj{lh&uhW=JL%zNqjalVO&sJCtzxb#H?sl z{+oe<_5(1;J(21^Q3@RdA;*BH|7iLo6yScCCy@Wi(O7@1T>fRADBmoC<<+4uebZ9? z_c$GPV7C>rBGYfQR1*gE|1&~vEJh2Jt-wrwEIg5t2G-Ty`zZ3yP#deBw!|?*n!eu< z@`t`+;Z1YB%|fy_!rLUr^N&TnPeC@*Y{&MAZ(c~-5a}?>jJz$dSR8I`KKr=T6@El2 z-`4W^(^h82N@rW^<=Me}!6P0~pD&l^pLY8mEgF6K0)U@-B6$sGO6CpoTxH1@0aQrl z59Fm8^8-TD=u2R$6)pynJuM{nBX(X}hTMPKQVbFm&=T7IjY#%wA22|l&r}&5&v`2wi}1ZsU@)axl70xA zsK!bdSq{y32z`QUPB;q~e>IrBw|hB~WH`xCn)Aq1Kl~9itx+&PE?6lFy2J+>Tf9U- zA4Aen;$@7qT7wW4T~<~{fUK#WaIm)C0A?(<`MqUi5H{;Zpqh#koQr80AP`_i#W?nEq3 z^X1&AuM|NDR>r>ncJsDw#@It5`TcL3w|`4&be9Z`fDM$fwqB^6kL~|(n*UZ7 zo~i9qW+epeXArx&Kk#H0qu)K7FJX|p(lWkZ@QviZE<6EWSM7(_jB*VzM2%~typA4v z(^G$JtxhU_@(xC@G=5USLr2v@)1&r8_bJ=$=IwV6?eBfS4yCu3vo0FmAJNFnC)0IQ zm;7Kr&h{bK=B_LM7`J`fymjx(jcsw=zV|RgVHI4I!PRb-`}?>JvhXy!&nsI(N^*7B zU+vh`O^o*{MQ*qp_km~^wau54DUE6)-(Q_Z^Q-(P9UZ3_unjC(D`Z z{UGzdUt8>(PUFKwxXR(oPhQ|ZT5MuvhFdRi!_*DZX@q9`{M~7MvzxYe;`aoM_NO3r z(|^{3)~1u)sp{{v&<16DMQ}?C>(@S+G=e@5T38(lUes^xKK=A*x7=ot-0KTqY%6H5v5Gag=BVs;R$-BdP!)Q=`AkZuYfit(`& zg7efh^_);#5P3KQXljWBHMKA*AOb`}nFB}_AQ!;kh338<nuahf0qK2t<<40T@NW z*)<4-i3#by1Q2S6t_uj40YS)Wegt`*(&nbipsK>9JOF)rmJk+82v0sI?qCi@_=miZ z&J@cJk{cnIgzgkMfpolU{~vqr{Ydry{*NCg^B6f+MPwewNGc(fGIOjBNl0bIF+&L@ zdsEqteH`l;S=mzdOd$y+*&~EfM&t81N9ri`?Dc*>U+?cP-~Zsjx!>>Cb=|Jp@Uhlh zMtO%yNeXyH!kjWaV(7}uJrX|f*KmdJHX@AJS(y>l%tV+AuwwcBfnfOe4+OUPUp){6 zaCl?%BpirSOUh9Lq2e=m{PAxOgkx=qW#YSGSwf%C?)UX}zLz`xKqT#PJ9fisZtBh8 z+wli=pVr89lH6!X;28H0P_ zxc7k$kRoI6pX%swK@#QYqwEBC3=l7yympIY8Fwv|dzl}@)wROU7yhkJnC41Q@7Eye z7bO8++FOv}Ru99se$j3?^rwg6z-U9*_ET5_6EphzMD@RiAR=-0cw)f2X+B-YjU~Y^ z55tco!Qb_Zghqj)+&75OC>(!mR@Nj6#sZB(RmJ<=kB>+dJgz$OVTLW)adgk|0m$;L z7cJReT{%*mmPVqBo-A`nJAQb_-&1<=ysK;A+JXeT>sJ{jjC<$GSp#_r2vVM*^RBxm zteu>bz||(p%S;R(hpo#muJo5@9e2^4gR#m|H^F#8JyFFRMX_O$16Ua zPS2sc`JOlE1pO1KU``ZXRBTyi4duyM3<1+FRk%Bq+VV#(d6HZMPYAE8nJj}~?j+KE zUoGVYsIC*rSnd-a$u@{MDnGzctzPog9SOzWdKesa!Z>Vce@lm_6a;gNToiZ(!n8$5 zhdc}eTMTYpVi8MsH-{COx>>WnH+8jR5aYk;(C-XGJ6l{ai@YiAH-PCnV+MD)2_c>W zj6rU|4v-D_jnhD1De>lFGM-`flsbe>I!yxHTPYM9&c}REDgsxK;vU3t$euZ&b1>G;LpPWuv$INPl@kWycw)-G4litl?hN0XiUBwGDOeR~S!P;p05V7g* zbe2m8XaZ~HS(r~2Vw#P(sWfniSh1;0Ssy((OpE^6bbgjbhKQj}YPMtQD<6e5S)X0# z`PWfC(65IZmNCX&Vc>OJG=g$44)}7mZ(m;gc^B~IHC|)`O7ztP4gmW#ot=O!S^&#I z*?Qp1LAN;$deZ3H@wVJzI;AL}~pcGt8wtz*_Ts8=l5a~A1Qoq0s9A8q&yCw=lrlMV5gcYptK9BAOvw=XYt*!XhgfB5pY zKtMz6f&!D*!B|yMNDbi2Vd7R0_fUBdgzXqtu4uCCB$Q3CPz zLKt8qv4+#?Bx;37>oP1NoSQY!BB-yvzTZ!0SM4+1_m(OT-S#}NI;?YPDBKSLqbu)C zA@!i-QR!hJ>Ix16kHXydN1;Oz|8M_66C+b32sVQNKw4hXb~8;(ZwB{koA{JVC4kJW zi>dz}3i-dq*ZwPyg0y~D((w#JHCVke&U%-!mw+C;ykao;WRes>4~CmAcDp{f`H^pW zpRe7iizil>ncALT-oEE}!^&Fn#6?$<#OH(V^iyYFJAUMv4DqCXa5BP+N@nNKHCoNG z5T9)|ATQb%%p_h^oSu#tUpCha4@V&g$P4oNl0UcX?ko~Ah!ACnH`NPv4ex+sYC5cb zYB=}WKsA#BcF4*4-sli3yXJwQBOjJW9QhwBjX1N8_6`TBTV#g#AcAoMD?r&p2P zUt^z4yHgbDa+T6pp$-PtMkyUA;0@-MWH+T!UgUx>A;rYBNQ`0faG99?83a@rN}_s3 zUpR&=Q7mU$-?8h`|%oliCf_LNJ1^Y22Um?|I`5{r2 z&>&9sTz3+v4;9;vix8dUWJH*+pcVLh%)KE9n{=|MSOKM}6XeLHe^D~lnC{94p?!29-=L0;n&+{FN)u_r=-=v{xrZA?dpJcx-Fjxll8D@Z>R4|ZoLo-C%+DS&fvgepgJ1?QY=lGg9! z&8&l|kCnJI+g~1xayvsVeHd*r6v9{z$8$1_8{Ia)Ya3sF7bKwe?U?Xg-S~3BV4z=c z2mbTo^|<{!O}Ckkdj`YpN9)315+bSy`!qQ=n9%_(L$G2LGm}aza;QU|kwn~T^lD#+ zd}tC)@~5MoMsRs1xD~3pT-J+xCs%-Uk%l}dI7u8MnTATqWQ|9t20NhnrnN|rszCo$ z%qP#R7IHwf%X>mEilG?%0KQXHIm+)eOuXDF)%&liy{! z;4C(CF2^SM#Npv<*7dwMSOBuzPnh&gC!S+qi)e2*Dg1KL=*Th!7-ija7Vzzfo>p~#8NHDsAXEe08GYItO;nj46#%VYS-R&y=O&_ zKW~7sHM!h(+G`T7yziXv3@_)8KO+uw2y_FK@V#da!322zD35p+HQucCpZ2wXjiTWF z3;+}*h~nX&8CBxK-xyU}4NI5&T>lPSXPL54yF6&=Nxfq(OCsq|)1ACfd2LU30;ii?Xf$AwfHAj%L#Xx+T!oo% zxkFefMX?~EqTa!PE}2dYsGl~HUP0FMmuJOBlb*YCP$nWG4qNUBncuT;rJCAC!&|u zP;Y|938oZ3LF0c5g?;-G|Be=S*NEm1Y?EI%Bm>T(o0(UCLOvdJ9U_9lfDOslZyS=Q z*%zM>HY5P@@hdcr*8=0A@!l9-%bc2%UfZR5G2Tpyl3aVIg@-jqfl7? zg;3ORAlL2Y;UG3FWm2GM;-t|nq1I)NTavE0lp9As^cn@qMlBoPkb&ga!qjZh@{EGL zI*ASxWSL+Z`0h||&`GqrC%KxZ6YmX~*nB=en7pnxt>UZRWL9xBsKHmwL_$wr37eR0@{L}q z#0c8H~8G*M6Y5T9;Zl8xe!1rk^wE)K~xbcP!*?csRfrM3I{rN!BeDH2{< zb7*=!Gr}GggEnDo3ly}Xd{!b0u#Uu4?^~Jg59nfM*6hi+-J#{i^ywVv{nI0=iC8uS%)bMq)EUn;>!z&6G_GbS-GD9R zy@2p+Tz8Bq#{w%WVqq{f)UQM>JaNqJEL#tugYNaQ`KaQXPfXV*?qJ~0Bv zT5^9H(HMeX4^wZo9{yGX#hMM*8<`>M<3(Y!<*JYTh+i~ zxjVnFfkfAgOXuC0v0m>#tC6`hwUaFl*5dW|_SX#m=!cPJa41%1Oz~_Og?`j&B4ehN zFjAW`F11+8+{|<~R60OBvk`-PfYyzfru#^|96tz5V%$V_PGbC5sZiM9VO^Z3pSbcQ zHjH}}RNHVd$u7dCkitAF7kZ|9M3|i4@3<-@B%U1xLKn5$DCy6rw-B-Te zb)h6yj0J#B_PSdnrLv;3Kx!r){7kI44sY_3tkw)F#B1|9s8g-&OkxWQY8ui#+$Vn* z98o!y=ZvkkP6XJcUb)S4jbmzUuB^GrA6cUF(%0ygFQ<`EOXjDNQ8?MAP;Dy{O`-kz z(H09`lPJie!6p-onf5n@p#_MEXQyPI?`wNm^(pO<=<`Rr+Ob2bVUNW(jF~nQ&#r15 zJ^mTl9i#CX{S0on7jMk;Gx6+NsNS2@D=+Xo8a2C9x*rW4pWMX@kzgA<8gD%DOlbTw zn}WYv#`2jvYdcm#!&S~WkL;=1izJ%94gj3Z8Bovn8DKL+wmt)#VE(_ZP&XKPfEnP) zD(!#JK4x&_{7l^cP5XE!CrKqKS6m8c9}k_&t2(w$u=#!a=;!$4JF{Zz3Z;$WI<ynStDG))1P?2+goxNE}UN-oAD)N@rJ6X(O)0?+aimoE^Ey~{#X zhf!c5!I1|RuA-unP4&j(9#|*~hoxvrOvJUQmkP(VD}S7c>6DhZi+(2MI2+w3&QHa< z&e;qUBIY*Il5CWcyF{hr@8Joclt?`SZ&PIPRWLy3+wD&SF^lfBKysbfCbv`m>?#w8 z2N8xrsEQudtRK^4V-?#C?HEl5F~M`Bt+*pIpB8F0Nb$CH$cJN3hD%2PuuOa5VaE@_ zWwLzd(KHvqESx)S4bg72`xNe%U7}M)5dfA#6J_FJ$OKdsx<6Evc%@LIn4flug{d{v zuyyWPTQrSE?Z3q1|3PQ|Mlv{PL;1*FRD<5zp;l>Ka5N!u`#;_#Ci}Zl=k45WwlHKw z`}~;A2dve2^T8u`E})4?23u7XV6r;Q{)NTk%pay|7b#H z|6z{`e{CeU10=V{NJ)Cx=e7Pm&ofEq4o2aO^~vXc@3O>aeOO)K;vL0Y)cHs?d-JjA ztYbmL!$H({U3)bznh9c#u`tbaZ(1);`0Pk%y)~T$a=gUhWOBeo;%& z?teX8?Kq-jGWj80@>ISY@0wE4bG+Rjk;~F$fON!vYPUuyn|y`-lgfz7MGldw>&or? z4ps7fj6D@+UhM1s>^HI|d2DGiBk#-VOzGP%Yx7O}zJ7ZD{K>iZ-jRbA%Y0K$c7CN= z;kW^kWcu27N}k+XH5l;PB9-!SzfDC1+wBB;+iB32!W=no89Yhk2i|4e;Qw!#cKo%1 za4Wp)n}YD~+Qi?o2>-E7{3BFC)F%GqD#&$)^X4CIn#7rmZtKoA6De`Ea&?Bh!&F74 zyu;NL%STze$2hCk{X2D}WD=P5eFf5)F9w>YM;S&qkH?y*Q;f%&rBA`)&8{EjPcUi~ z7>IMSH_y1L{b4F2R=3s2i&oG?*IU@|%dP0as-nNi|sgXu_QbB+CUx}%Z66if}3?E9DpJwyyp{`^k}{hs zUlQkkTe)(;F%R=uq)CD9u#TZ^jW)gNJi}p8mwaXw`TL}MPHO)!t+CQC;`rIW^9S8J zhp}1w7u&S=oeIM=#D#VTu;c`h@cs+{GWBkV2#8MgpN5}r(#xl&b%}rC!u=%x7_`K{ zf#TjBto@BH_TN0!(lvhr0A^j&`CSKxccsM{s&2D!I`7A_LWcF*+LadH!I^%1>VNnr zGr(1T4`y|sD1@uZu8fAOY45re?pDU{0n)$L!ng0d=hPTl{~Cr5aHX9}i?Gc!`ezj+1JYjk)(=65{ePSZXggo#SpucoB#k${aELjl03?0om!v+TJ(RtB2rn57)^(vz$ z5Me*N(o(PBw1k9u4#@Az_|=N(1O@HsM@OLTg&j(Rrtfd6@Uv??jgqMf=~my$g#qtM zyGNFo_lE^~G&O+u^OF&bypzdybA|uH3gfrvx6MhWYnw#jTR-W0*o^+D4`53j@8974 zdAh~xK-FE!7KWSes9*qdlXnwOoE7}k2UZqi+5uwtmroUsW?t6G)qmt*yzjIyY8ZR` z$+6FEOEbllj#S5`msa+^dGYqKi`&|lZUUq8sDuIZtKr!MDmV@#=Yj0SfW2M}H8Hrb z=5V^xQpR!yffRa?T<#q$U^y0D$q54%7z(~8;K_b?5EZ@bejd+#f=UUjkFCSF?|{*g z*xMcE?zOkTXih^G?(yaG4q#ai;|NJ9-9$Gz>3~ZPEV-#kZs)V!kGUGAi>2SZguQC& zVxCw8yI~zGkHEi<6AV|!GtCmO^~Y>WWFRFHl;dml_N_&*XkgHZ_+4gMIcBJ z@Rr$g=-(&uZKd}A_QN)2+5e*U|I@4XVWhDHAaoAUJ6a54JRY)$L`l9KZra57-?~=! zH9lcf&0AkcJ`TY$%N#`4O5vkT$(fmYUlkzo zfwiQj7?^xL1k(LnEX?Vcq`0OtlkBCEGjSz?0-4zrU#GLO7zzd7Wajr=7s@J9M7_yH zk53EbWA!uy(*=9oYawB|0BKRsUr^Ze*oCERkRU-ntOSvRB2b*u3=UFG)=+V$Y){Al z1k?aaQeS&rtY*TMNv_r{BmjZCSj=cYlR7h}@f>1MTO(?P%>#XE40>Hn$}9}JCz|tO zt}@e?$@UtVM5r*+D;w^hGPR}0|gZYP^tR3uNS_FD!mC@ID2jB!RX0>yn+jh8{61=w8A)RZQ^uGwoe|T*Jkj@j1 zGk^my!E1Z7mN3NagQGU_yebHyC0Pe=lR$hL{|WO2qSWO*6bRdU9GJMt$bx-Dk-Z)H zMpz|gRu)--E>RWLFgg!NaVOFXlC)i|yBp+Vs1`#P&U@I?XsRLX*x7j|5Ls(rB9gt| z-EcS)#AvIw8_1ivbUxhiR zNm0v{p|E&h%-?M>&yP%y4`&g(9+B3Sp&IAQv|41QmANNVyV&_mbs!9JB1>oJ>YI*i zAu)`*QC$ke+FHTl(3?fUz%tfmh^Squ@cCTMHAn|Ni$W;3UB;KOfT!7d@cuBIC>N+; zu)#sj^$g&5L%S1ZfP!=HxYC|$5{LXyA)9aXG)BhP7h7t~*p+6OG!uBHT7Q7X+4wW9 zezI+5eGt#lS7PP%Ubk+nxh96LXiRid=ure7Tl;|N+owz&B2VCLw^b64EOEg9XPr2h z2P)q9P5%SpAcUdNR`>dnw}YC3{&>ENoJA}jIz@9M;KJ=2w~nlE8M%8erG&# zo4p7TOTZu^`G}u#CJ+*EtET+9LEWI{;>RxT8kS!m#*m$-Hly=I-XQ-%gSuhdk{HKe zc;~JUU=#MJZ2!yp+dSL7h07O}TB8mcJ^pn={fjpU9%8(l5$8rtM9uv!-rD*pe>eG8 z8*1*T*Pg~?O$M@b((q(;s5)BThvlEWLiZRd5td+t*aV`n3y4jaioT^R9j7Ffb8i)>alhOHcqKYQ&=ZO7{Q+he@7g{y zcQ=;S2}~gPI@~=#TzMkptAb!A#`QuLf7%ya!4nK>%~V;CAX6!RCL{*5EnXbI1&_08 zZAHZkp{gyQ;OY|=Q1NC9!Mi08gKbP;u}}plEJTk#)5BM#qBl2FQ52pVkNu^-y@1}8h1|kke|25yWky<6l|vgT<{VQX}KoX0TxZD zZgG0*YH^OPpL+c(Ucij~1qTGgob>hue>v((6; zGAgUSO3Ngs;7Z9;1MzBMx2+2iEH4^U-gMLS$}^Dkkewh&NJAJ*y*38V728R!1=eB6 za+-~Xn|tTyYZ@cj9)4-ce|PG|V3O$Ur-=FmegoO%hBP1*gay~*K?%WObZErO2EFvi z;D%mI%FIJP3&2mbo(jTQQ8V;wDhL5V|3`nXA1-({XR0qnU%WPT32k~t6c%$aCcsqJ zEVnN**5*NrxG7Nhd#3O=4&v%BWMm92KXrfzuIYDYvB|nW|yx ztc)p972f9Q+}5q;N|CM*3!)_ozFGb7m%vg=lLz$pW;f*T`^W#z3->3-m%n`B{?CD> z@4+xQ9VOV$!7!VSz(6u(>RDO3E#oRK=_*_hxD>U|K6C8XV3?_KoeK{(1;gyXa#gPf z!+0#Ff-X@b#mE3RWI>RVrKF&F^59;nsnpji&Y7vNbt}wMLR_a&8CcKNg!D8zWs9sV z*Bw(yh!d5DvKVAFs3A$A+Q2gVm2<2-Lq90clNQ|T4mcI$0Au+{N>&RDD+uBR0RsaV zMuA?%JkL{cEu$3dUg=5RZSx`_V-TF>Q8=Rff;6wKA%MPO2y7wC&}_PpLG`w_Z6Le3 zA4ALZ7DghMyKI{5K`YKQWR>QgJ8#J_mfPW7_)J}21oNcOLd5a?^_K-rZn?_#ExC!0 z_SXv@kF{@m{n@Z(-T(X0yUZVsFJk74i^M_;3D6nP1fZk(X{zq_{hvWfTe^GyvxAXU zUC9q$3YiD(ZPA>84{wZ++Z-v&`<;W)FXy>Y-)X6?N7S%VMDWJ7n*Ng6;m3cHTmN;% zmUqnVxdYHvygq&QyXX#H=al^hDD{Un8#;2h;s*$9z@Drit&e7rp0aRwS7*9}cY+{T& zF5^qUc#bKsE{t)DG53Usc1yiV1HaZ2&IXGOO+nRi=!Ih=Jx}HoRL26`w(2Zk5t&yQ zFnPBblAjGiT4BLVfGrt0q{G$HnuXOss2Zw^nYYUQ7;ElR3C4xgKNM>2_l_M%EYC|v zLxeaAsHo{@9clPoY@Nfzt;XwKDFjc|kD4D9XdH0<1aBHqGi+IRFoLIqo+EmK`9b`k z(Vw2+ZETzyRd^G&{}(9e|M18HUbKWG`!T(?VzWEo){ z$zxw)yt}B(uvV;ryRpHL*OPX3xdvWTalw7wRDid|I0RX3AR80Tde)o~$+VD34#rhy zfkb)xxvC+ltB2ERvmi)sTBBNwEJK302JWuWu%1<}F0Y0+xj1Hi8lA=>fh)jUSD<0M z1ynRfvRuMN^^g;@FkS!58i=5+kb7z1G$NfAy9g12Ae+zagG_r?PNEU-g|g9cpM*>q z21|rcsdaNf`48qq9?jR#jqDPs?PQ=3NMYXYXouZJ&F{gtp3N2XsVREhbZcas@Akgq zEcZ?yl+ZqST4G<+JS>_lJXG^6m&kAN zH?)m)LyW(Eq5lPV?2iFi0<2b z{`1LHw5i_I^=Q*+fwU-B!K{?Htmjj>Sl_^`jI?ye>8!AluYs?!^F3S5@1k3;bKEV1 zV6vSPTERY4LPssO(IAgP$Y@|V`l-Azhb&nJRwkhn&=#zL7YNQ9M@sV~YZX;|8xQ#k zp=|G#!n|(?rH(@A^H|3$FuwOnVp+}ai@wgDgTBg&%gbKVqi%qKo4agS)F|nL#OJ2p z;Dp6-cKIMdpm5M2C;^cO937%iPkN*RSfPzn$}%n+y_9d_ebR54GyGW9qFr20g(I(Q z`Y6Yf;#Faej(i9^M`t!G?W;XeVg%=)&qZB9+Jt~C+F0xvd$ri-${sg)&lve>f6y=+ zi7qj-WPEn*=H<&Qr9I~Ddy@u^58aG;CA+xee9Yhx66u)NhoKxXLsMKf;lsE0a}eJZ zydNVyiPX<`F5~@y6Rkt{TYSV#dcd{zI6YzmdD(mu`a~$b({x)j`<^&fwkw z|1IzbqS(gR+nU-`nr^BZ=3`MudnWhz>Isr-q4kMk8#nPdXhK(ZMmf>7WSra=y9;h| z;X^=pVjXi}Cx%`?j|uDhTU$C)Qu9oUMAnED97DYkKDKd7mo2M1S%G4MYE9~`)A=sU zL6P?!xlS<_b$$zzBPQYYYOcM>cG(-$msFBj8B)HlKqc3D-l7rbIQN)1okw1s(qKJI zuI4bM?tCr1+)LY#?I*1kYE&d$78=2-G$swZ<>L1@aGjf3xWgG8Ki|A3TezT6MCj3h z*8M^*i&X;J`tmHu-7n=?ba&tPyaMNSS=3&vh{)4ozT8DhL%|>FO-^Cf=?&86aVa{D zXd*9!AbC`aYbe>3F zq56k;j8l5V@juIU%<3;h&XyKhqQ{Sjiz^qs(sr6Q62{f+g< zJE;EK!lW&3EWVi&FvuMUcc9g~-*(pc)dTk;m30nPrV_^-iFCXp6G}FD9=wKFc-ZXNj+D)T+th`TQ#6;p2L8}1s zid7Q>mJzR12etn4roKM|EJqVBhXf=584hjblH5lb|4m=WzQ?+lG91K3#emu9};1lV` zpYF9C+y1%mv0{e)RU;uL56>30;|XZM!Airs>*TJNaUJT}hW3nbRKBbc+$xNe=4{ga zq83&RO(4-e2IYzZl?M?$ws)TxIzC`lj8F=&DdyhC!uJJe` zFPG<4)%Izgw>3?lIOl8f&fj04;~uPBY`7;}%>|y<{Jhk|ulTv8+wsX!XX4!w-dAM` zB>(#xsr0L_3b2k1`p$*?$zJ0h43~aKGC5ZWA6(}`hS_a+8vj?6^gj&P{#-+w?$7-r zbxN=MpKB;?bM!G`ylSR*0d6FZ>`{F5@y~&*SYO#wGK#;6K3+Z(usM+Rd%|5*nkj&A zL0%?#vRJHJyP{C@L+jDUDeU^C-XMJRaeBO|MT3L(RUnX6T}NsXUgF z+p#*8Re)X1ayZ<5JuB4(*9+&xH;IRl(2G!vo#&o*a#Y|1L^P;O-5MGG?t ztc8lAD!?=Y7Odns=&TUy^g)YQ1;!y|m0ZyH^%pi!IIcq^eWa^mrW~CvR1N9tkDIPs zz_QseysibXuGmFo_H1yoCzvKK2XqoV06*gek65Cux_s{OHy6 zh=wXLKo2_!658sJ%lX2-a}EfhUjKaz0iS0BU$#cnceBagbK%+M9s^wXC!ar(Ob-6fI0xT`s&Vs^ zzgtuhHHw?_y`7V9UGQxQb2s{3qd4Uez>mB>w~_CCaM6%($l+MGV1SCXp6{*P?~xJ- zC`drjfgdN+F^c`>PD#FyY252bi>!2mprvC`kDy?BMI-Bu812k{ zQiz~@1r-FLq({mG?`;K`2E7Kd(2!gMIhK?1v1A2tl5eI`#gT00&^}pex%5)|j}~RE zQ7-_qe{_gXX{x7?Nb2ZtHc2XsxAIMCSm6XzJJ%>ZjuU~OETvu_> z;aJ}4yQ_CNxZOKL7qLZM;p+D9pZd`x5D!9l(17XJ{QB;m|0-yJMLY-`fQ(Fp7W`9! z#?}~_Or6oIPalLQp6IuEaLG)Pq0wV-`@6A%hr+NVPt;Vm*F=X#`JHO zDE6#Ng)Q$JQGmS(`SnK&Nd-Nvfc*NDcx&>2gNY%{==tcAjC z&-c~x2T+G~7~RRa)(ppRxc>wNz3UoOy}5M$j??>heL-cPy9WH0k97@s_118K zF?p`5GbvA0*5>zUKG>u^p#wsrc9Dn^N>MfuFNP>I>i?40_&>+@zD+}8w77bZ<8z=Op8S+~Nh3=9BT4d*BjaR(63$|ad%*k7o63#9I!)FR`A0Qa! z)GVYtG*z4gm_OmjeD|Tc1jI|8iyn*x!yp z0oCDM0r2bVTi$dDE#T%q_}MXzaD-a7i{GiZE1WL4d*3}={OuUeDA8X zgMG0U@$tsh?o{c|2cIdQN`qM%?&fxXj`RFn47wjYyTqmajW1*Z>IVtq%M_9X@pBv2 z9YqmM@No2QHctL|`d>84peHz5XkLm9`#x(NI92kpFS9}=ULXxo+W|6 zv}r~{wyII2RB=WRe)_-FQf%3lWlYExKBs$6s1wK*F16__wLRTh4Df|6hB>|S?OiL) zH+=9&l>CBeyIw)2_jZ-UquRHO5?hhv=M*CgC!V-%%Mk9#IXL+g_dM`I`re%;l~FZ~ z>S{NVQ4wvDJh$|3jL*EPrhY}&IkPb5bJEjKE7|3M*e#EsF*^H4SKqzqH6z#V$s6KXdhMY0%mC?qoZ>`ikN+J}2}0?BlAQ<;jt2Bh0#eDwt46TnE# zZQ#S4)4TbbL|aYclGCNRXkoN=qIZx2co!}+FyIl>>*`z{j3i4k!SO#w{Mfo&)3z65xq`! zF(;n(k%mfc!Hx*EAc+Gqj~Xg*X>woH!dPAFPA;{& zs+hODjHI6wy`>YM%}#3^hG!rvMF70+?1tI%YGM0^*>m*eFDv4Q9#kyG_OwXr zJi2%@e|}>6!4VxzH*2?>D>tf+-}xLzGedgd#Dk9QHz`R2R~eeC$))B!=z}q&{QlKD zkVIzB^vC$_^?{#-OP0vzy8Er{K~6Irp9!A#+Tmi@p*I=9FkJ7ep3H@j_L1AE=k3Hn zmAw6{pHe+H>w>>%5hp`*b3IIIApjYSWy(-$C}`<$=wxhJkj2(wOcsnONVwB69~w9! zp@MJQE^H67Z%j|su)J&ni5d1!obV8Imnp}_zxRhSiOBn@XX-OkAev=a7eoBzdnXuL zniZuMLqmd7dHE47%3-7-bWi>1y&@m(a|pd+d36W7$H6$`1r4QEHa-p6shD8HLjA0q zb}Q+r2%WHwQ#q>JOHl}hGm8gc<*A(ldl8R}Sl^+WM_+OuOUW{kdKc3XoGzAuXt&Ti zZP0s~gCnl69bCM?8MnJ-gwAQNX@Gxxsu=%8(iNt2=`b|gyO1Lq+n%I%hw}{5v>h|^ zWPJSU(G{L^si8aN7?3V>-U%0pxuN)XQkX>f=XdhQUIPfh%^;wp=moWgA0fDm6ga%s ztxD8UH;9E+^>hWZ?t%k;U%CF>+q1lPlx^uTtO%nJd}4!2wHNe^^cDbX7e|CmxktIU*0C?6T;w zxO%UL9{NFfch%*cD{8EzCnjoB7)Q-XDd_4SrCC0=*3TQBeXa85>&=y8_g5MRCZdi% z;h1--m>oH%o_DS4(;8~9wCK)5x3jB83ln?fz;y612EY^_(5J#AJx`MV5haDMvyO1x zEFxi~viM-hkz3qqNG3bUKcl3?yvi+DM*`e;Y#Jp;lx!Q#4HB-6?>cXL{qYJk@jAKS zBxdU#0q=E7z+|pXXQo_PJ&eI6;d_KYa79`cV`zV5wp`8E!0DW#9%6lJUjG#3%;xx2 z;aC@Gq1mE|7Aa`qt+sAF{7g2@?NL@dwMmJ=i%4Nc=67vB2TOiW4^b|6NoiG* zI6sRxcx11GlkzFT4seTivaT*A9yFv%`TUuWxVR2nlDt(eZ#4lySko1o%{LL4}Gdj zX#RG*J~c(S(zbz(Z4+&s4zvvVrA5JCy?@t#UT}$=5dVHm2{v7D7q28;dnZJceEfqT z^^T=VDKZbpblp}tTc1LRc-zAgeD;YuA&Zh`g=VDkwt(d;mp+^Eb_|bW?%Lt2lbu&p z;>LsZa;Kj~oU8P`sVDyOd6B{k*PtUGM+WW-c#&-DqomudsI$#%Ew=R*XUOFf+>E@= zGh;k==o_p_D@ON8iWz@3Q!lSHk&-F$-;)Da6V5-{7Yc?0<|H1h;l?f9&vl%Cef zCXflz&>On#!t*`4c_j9AUXmRPoZfHtN@`zzpxcbO%xpo);#=+vXYnrz*vS%*AG6Hm z2g&kh4$LmcF$br&pqW9=>-p1VJg4Y-m5?E_za>bu;uNEd`*e}y3yK`P;mG}-7|OQ8`AuTCa&lUDiCUCT-Ib@*gue&(s4}%mQw-2| zv_bcN5AIQ8X;+t-ec!FMp}FhgdireX(#40DipnBA5fL|ylOjJ97+(I~qNEgM1Zo;b zI1Z@3mAxA==<;2iqLr5rHk^0hcJzq<&++fT)yuv8@>*2NAlb^fw29b?yV*}2R zBVP9dN{~6w(M=VN+>48-qWutPuLH31TzJvfx|bcFJPRT1C!G7y-v`J!81Qot1lrnG z&+qMZrqLk;id(Z`5`r}MzN~Z_>l$F|5_$E|dIj=ja)+ovl^3J2u+`4I;ietCBz%K* z7LNIa@mE$o+I4UIVdRk@7<%PheU`k^?H{O_l|mlB zOuGq%XobZbC+UWdQvw4b`WA)~=Cm%HBR61o<&fR~%#oiByc@fo~ zwfLADOC>}zQ%kXBa-vJ-eI^Ov#fQ9>(Tgp@j-&-DLZw?sS-sZqQOQ-^9g6&S-*>4> z5Lhkv06F}%+7_c4m!)SsyVS6sdN=BMfY0Zp%_*WEUw-7S3LCfzRJ1gwdthQZE;HcK zL-SLvA~_=ww{d4EWrG)F-_IdfWOtMGTNo}iMtvWM@u3E~Av90?_qjpX1)u(>Ay^Ve z7SM#`V~3&Xffi$Tg2J2plTn^w+!b=63r8{YLrwb`4<>$kzJIh0&UZS|YS+Dq&{&Cm zbDzqKnmVu);o|M9+|%72XG;@l7Y@y|7F|&(x>>n!R@B_%T=88p8Us<`qTrtPmqV5Z zE{c5exw;KWzdP{KyP{rw!OK&wmv?@pkcU-1!qAmF`mKK67qsu~t!(uy*Q%!!t$x_=GYHzTb3ceq0__*Ei%VmFl5Q+Y5so$Ua~9hq$4{$asZ(O`AJb{q9J zcdp?b%#d_;zoLa}F9L;2#<{IT8&P@}t1?l>j*{a_y|>%j(R#N|7{O9e@+?$+p>cef zqlU*;C!@np&5@np&>gCF335JujnQjvl#MVTyuGGTHfkc zQOW65MJTl!2eulBx5jNP&)j(oF~gR~`dH?w&$bGkevrj#u2mCT&v~v`R!jJ7%a`eY zjENI>B+;ys?Gce{OJ~!(Z_Poyt7`GO_vHtlvX*Qff+&RN|B!xk@tGA+ZS;E@IjBkP zn|Xg96Q^&xPwJz~yNAKxn^{%TJGKbd#a|0C>RSYRt3$|(etW+U#J{8;$sYacec_e% zY{ZR^-y1!m1o20%$3>8%^rzM5E2Hj};CdcidL`N!_VYkIxB4bOgX}uK(YtXb{&eJx zm_+L0wb^QleV^v*cMyz7@;)s-k~rSctl2ICd;ho&Q5Ez2?D3wrm+hWtLP5UA!IH@}9;lPmO4SNC#pE^@8Mo=FRI%=IS#n#BZLyYVjn;uEO=avx8Oa zJ@Zo~H_w^c41_v=^j%>qn;#OnlC&SYCTSma&yIA3!CPUJO$K-M+86yXE1s+5?ygh} zK<_x4U&%N@GwwV3?!~jbJgZUi+aD+QUWvYZ!13mr<%Xtl%;%c=k+yDhWcB)f01c^Q{qr88R7u06n?A)sj1Y*-QgAbmJ+S24OjNb~|PkA+x| z4s`qV$r|H3KtkDQi1hS=?`!+rko;hBc$av!eNmcpV zuMw_|lnGNW8eW*(=4p=R6xL!Z2L)VnSdxs1+XI66TL_wTPwaLb=uG!<+x8knMGY>w zw#QYx+nb$T;V@*2#oYiN67SyuC-NkO(&fH_T3*KS~M>+pb1=V2Yi+Fs7yE*$`z8-PTv_>1a_u82w9%#`r#Oxz`9 z9r3ec(Y!v+@zEx+VtyP)Cu`E>Z8j=YCg463j zI_`VKCij^M$eW*sWMT)-zYJr3z-w9Io%`#M{LLPhCZZC&!)l%USNl)F7+uVmf3e6f^OJli-=@5AFr;&z$|0Em`A zBAeRj@BZG~*-zkww{oCggttGZCjPTE^z=bW!jwwz_x=ryPUR!KF`J=SppPKDb$J8% ztt?H!Vx{6RK95(+`DDX2;LGPQLs#@4>t4%ku**(Z}6f?_ZA}@3U-*=dg5H=^S`i>b&RcyVbS6 z_X%!YQ#)R(eoip-b|Y6N$H;1PIqad6ae#zPTi(s<{>YKjt*g^+8{OjsXuW4w0ZxaT<`|sbN`2{M(~g}|esw$g4*Bm2 zBQM|CebdZEW8})k`Lf|#;sPXq?)_Ch1}YPQ;z3g~?Bq3-HR4N;8!kXRrL^ek(~pl_ zKs<}TF3z8pAha}*o)pd{$c*s-JnNL5$Se5c_4a3Fq})k-?+e_UA@hv*>#Wl_jOVIi z`j4|u1f)wt1K#AW1L=fzn#FRapc!usZ9mYkb>Bce1(_=wUDT2*2ZG4ISwjN=(dAO- zcFVU_%bVS2iBc1fjLv8+iT_AV1g6yb#I}W|bxp+gzM)(3(PEqECgH6%$J?17dCXVs zwyTUSc5Z5?9Zn8kSOJV<<`-aN{SNg3=XRq1nK3tENm8dfuB-moo|FFeWcYGN{ zTp)G;mxTV;Z4>d#$t}n6FI*A=imLO2*_KtrRbr*eV~XE4;Zal~C}(=$g{?QCx&D$( z%QIN_d;6qDLFu4e|7%6By3#LVO)I1h4fo`()ZR{T{BXLv1PCqPk`!?z%7a{q;2k@~ zlX&o!Yt@a9Gio)bzcL?>to-<{xA^01CTZ0g$>=k-$afq!T~_4VpFecnWBzsc{p?3} zSIFnH;jUm!v)4A%2bc{!pB+--JVi-o>kCyxo;>Nh&9~{LSJy7Px*akhTAjd5T8ceb?oClsT0heOcgi?sYr5WNN`~+Qm^XG)`6Yp7v1$ ziVLTrCKo%Wj^1+~ zq8FlbAEt#(_Zi7tE|E{W#cGe5)C^!@7SJ$}mCUq{PG>Uqj2Z71K)cA6jVJr73s`uo z-&_sPl0MTakeR0W)hWv}Q?J3|R4!zBe7E+l62`n;Bx^$3uQOTZaMW|(uqtQ~r+#y< zW2>37f?2Oj?Uu^i=1Z~}%6apaxVau#Gybar@%EBU>lcwS1}7o_B`)m)wfj76H}Niu3}s1 zKILFnz{dG^UbNXCI0eM-nH`{_Q1V{T@HfL^9b#>Add#Qevrkc2(^l@E%qX&JG+pyH zvav2rNGwoZJJi(9ais0S-;qoch3p?n3)As0-w^KkupBy`n{-_0YwTOy_i=WrpGzY> z)VP!qJyqKI(e~o|DHFXu+chP5GZPy{&>LulqGJNMfrWGElj`bIHhh;#P3 zY0(#>>Qm9$VY=f=hS__?O z3|vTBKn9|#WX$T^*R@?VLQUz@rKMZIyX1%G719C<`*^7@zBC{W!M?(fWu~=$?MsDv zdrE=sh6JygUX3^P;SbRxl^M0o*E>tDNzWq2Pi^2XLxvL;RVGiXscALIN=<8H|b5a z#dvn=-H8x0Q>Tq-O>@?)?z~(0W$y5%&k+Ps+3PuTO)-K12L|ZTZcXI7(-`o?$6V1#zej z$Bq*T;hFD6k*)frp_=FlS-ZPAt`35ccpKjMhA(%228u&>8`1uTAIgL_BChhbU`EY` zq1a<}bh9cEyPhESX9i@O3|FCbMSf5 ztayaI{@h=XjVmK~wd5+_;LIGmX&ljSo#5{K4}GINR7k}yj^~w_hw-_qOpX#gsz_e3 zrz1%>kDVz%T1E5Pf2~+;BuMv#v7&b1fGS3)ChY>b3?C$1w%THkxZ+(-Foc#g9i4ho zC^IYkNQ7LBF}aDF#nSJnnA1+DtV27lc(Oyk`a+7$c!E)iM?-Ct=RJ+>R?rFk>60p$ zpXoh_wy5ky2B2a-Jp0DV5efz1j95(`<=iBTad4iz2OeEcR^)y(I8QRMpg_9(XnZ-N zw6!j}=#h#ky;99Qk3ey@{n$I%B2PhBTz3ppXcGNt7TU|i8en8=0(p;A`HopoC$>J4 zb~`eI`%FN9yU39owy8VmE~yzks!oZHLYL&kCKlnKeGle!ne>rkbJ; zR!`%3?;m~sxKMiZ<#6vZ<|p7XlW$$XoPFWz90;L(Z#k1Fg@M`Gv;c7d6`K%>ipm=9 z4%{$DCKE*OoQHlni8S3<3)=p=H_fdK1l8_Vthx;!mf#tcY3iSE3!v5uBN*=J-fS|- zD6}_NcnnqAukqQ{a;htbq}wQ-BFbo%B&tdXo2lK2NRpdD+DKVAUE-Z=iJQU3xAa8N zvpYHKHbX3fvj`Rzo002sy**}U#g}zOd{J3~a;;=AiLr0;ptOhL4(pk3)Lgll>K)O5 zn|+G_9D{-)5{aLgJ=O34Ps9Q`(ibU*MogktAyI*jLqw8Jwx?I6ZY!oNIETSVqEDmA zH;VR&!ODI&`Yp2Da9joLTO45YkfklUmOJpQV(0{#x%vrAR)(h8@KJgQzKQN_xf0nq z1379RSf&`@ky@8H1lZc+SkZDB$9e|s>prAx91hZ5Wq<1XoIUm9_TY8DipNh~_CKV7 zkn;sDNy-(cE7GKTPsl&-0n*~Fsgd5va)q^07`wLLnIm7=X<|b~zGWMx8!#z&9bLYW zBa)G{F02d<@VJBZ)xEqgmyy=ob{sl)Y*OWQed=*>hlK zz+&UeBxNe-G)C_=1-CSqQh&||!v%>$Tt5${5cb9U#daYUihbj3dJYT4e-6?85vKTR zyEyA*-)Q&uJ+AKkm>pXhhTr^LZiZa9M~_)=l23_!;pvrTxL~By?(Qy%;yOEt;X69@ zsetX`{kbs3aeK!JOmU{YBXs1^?a>Jn&m*lHH-MH-2?MEJ3;F9#o$nmH!j77nKA#u$ zm;+<&=ZQ2~p6=z)y{YYm+~kq23Z)Oo(s5It%=kfVSdywDyBp62kcQSM2hddIXZX_@ zc4P)Iw&J{11`RD{hH$A|%?hR3dihrA8l+=pxUlF>Rs;cA!kpqwwoe&R$-@idkx=f( z7wAv~Dasw9PZScXV2m7J?dg-dv!xYVBOF2^Tu;U)$Cq1mO()@EmdE1`7N@QBDp>y-h1W! zp-%S{UWnG;Qy9XdeP4YYVx#AD16vvt{7uJl0?{GpARN;hF3~MVq(zafrmW_cmMHu` z!4w1zCvLwJS^77Kj-h&$EkWewA)6B0Qy2Mx%Wuv92GJ?hirBTOb`{#3)84Ur3{&jB zw(NR1I%+K?;_yb{4RYD!f_ghL=T!2i0j%i;YmSJYHp6^=GaJeB*TAnG9 zSO+Smn`!El);YRCH#%rAT{wQD z^RpG08!}EpDk!4Fth2j7Cv?72s>i!vc@+*yz{aa?5Qq1Wc0NHRG9euc3w-S;0bI3@@lbQ-=gb zq^YmOa$;(L@t|Li-zJ-5O8d0zd_V0o-sANY2z>qZW*F?~t|%m~L(x`LG4n_i4AmlG z7!1AS@(#Qe7FY>AbC>dNirai_5|m~|72Skd!CT!d_a`=cF{3zadRVF_%G=LCE5JT? zZ;}Y0^M!8oJ(iS^!rpoIT_yAL!M1l(Oaq`5Djq`laX*#L;$e$81cf)|Cjzy-_H&_? z8VyS*?An_T_)CT+VvT+jDEuVk#g-Z5v5(pF|Fi<|mIv?8PH3mRWkXmA|J4JvM_nZ~ zACj2e9&guDH=}NM8I^wCop4w`E96~dzWI6aW#0OYgq8Js4~;fUpS#+9Xg-uU6Txpo)BL-|oivPDEtHad_|6s+2!@QL8jA{fG-%z>2L(K4eICG$J5HSS1sVCx&h zQ^W~N!WqV+%z|K11mkHlL_Sn1=jn6IT0)V8LqCD^c1gW9oB}zL4}-`6LWf2{jf4;n zHfD;ZNP?Ouo5PkDO_Yn|H7!8Ry9&FsB#_?9O(&F7K(h=6Cq7sfERH>@SB(J~=STt6+TEX^`$c*BjaWcYeP8*~u<*M-|96GHS1Tf82KzAmpNNGkX7|rmo}Lyd z@V#iGIwODkS*JrE%+}4n$FSWXe4ZfT3WeGWW|(6^!jb)st%k#QV&Mm7>bGk*VLLWp z@Dg+2P2A)P48)npatSsO}g?tB{`%?HLd0g^Q|HX)oJ7p)`6045;@<$;McbMnGc-hCJ9->BxY z&ORV#M!`U0<*aYzXS%JQbH!Yx>PFJt$87TSe>fFo8W&Q{fJ_IcR_Y?E*(K#kg>}(p z*OVjD*%mrrjy;Ai3Cg{Q1IPl}f2Y!C;hQ%*8*Z}IaMy0`4#?L?7huJ_Z5LD;w zX=l|fmvp`G|A1exL1?=(D z=9LVgBvoR7l)_0f`$<+f70AH5o-a=f2h3*-m3lq>eL!OU#d_PGoB>x-e`tQOF zuEp582OhfpeS7bLe51dfBtV!U97H62ig*Ao#s2mbxHPBJLfUzCb^O8l>@nwjKeCQ- z@{9D}PLlM>(Io0|>V3AKqH>s~&PLq2Bc92h`$|naQWYu~U~a9^4Pv%N@Af1|NamI-(lrb1Sm6QSYSqZhY(FJCT_2RIyw?i=DallX}OND`s)9bpM= zSK+#`^-(3}J#6s+eTeodFmW+#;~K@=MM88V2fFHrWV&)1P#M{-iHo5|MMA(*DB+YZ z#_(H=)8d*{v`}Vob0g4(MTZ_OQ-+C73mAuq8q1r=uiqV4&(-aP&yTySepBP5N2?# zvdHh?uG>CO?{a1RuzYkGu z72SP%)ILoQ_8^HGIN`oV4?iHGDEG_|wfIk>zeaOmX6N2$xw zW&`4A^RKvNmy0I`s@|*uDzOa>$?RA%f3*N)D|=XO!86IN^gLW$7HdLV+Xn zF80_05KFH8>0P|OFIX>DKes0*fhH52n`oZ8IG}A^b%+913tZP*z|mNrD;T);Lyqy&YT?5d zhhaC|djrrqk4m3vop;8xf6+Qq=h&&-uV&=BZS@pc_f6c)!5Tvo!Xo}D1yg*JH2b$U(-Ut^ zHjeo(+sQ3QtK$SO*Knq93 zyFPSUy(X|DAO>XS^*ZzB{8sc^tcbEcAnA%oe1o0as-P)MjI*Sn)+W3^jVpwyk;U#^ zW|(H_4c3FP_Y)zWN0-+f8oET%8nLg+x-uW^@=moi)4P2c*xy~4eX5mwH1+w*6KL)8 z!;RRum6VqaVsw0N-0hz63%v(7>rWB880}x}XnanB*RKa_PM(J7yl|shMUrHf5reog z;N@b_4#b_0Hw;WjzGr4g+4Z%Bqw|`l+dT_)z*~co|2D}5i1SW4dRF5o7u8tEeta!ZDJOO?fY!x#-rG1YZZ>yGJ~3o zkQr952}OcaOqB{w1iny1Xx><&(1HvpMUe}I5|aHU^f(Nth@HrmkrDKd1Y;mn^Odc7 zg;4cDnG7h8Q9y7MIa_3kY!{cO+Q}%33Q}Zp3rru)co0N(lQWyrsZvD+vN>SB zZr|!=ug~3*VRcBf371SBX6upOvg{f@5yFbEWW4)>>Um?K6jy)874a4%T_o+wVH3 z?{w*Rl>G-?`iqI+1Z6M9oT56bHN*h10l3-UHYiNuZ>46!XPK`5MvVUV$L#`tzzIUo z7ff<|2LJPr@?^Gu+@QWS;iPs>^`-rJ?&GY{a5)rQoc6{zC)wiB)%32@st{WH3LPS- zcEI1pF-r3m*QUW3nEOz|vwT^0X|jX)4RPiG?`XhGg!oqeoX;&zlebY=qO_DDN-DNelJJ-QZO9KwaNlC< zy8ze&tLc+gY;Ne@1aE6~M<`4vcZfxh2574zMY{=__JN85+5%{NNX;})bhH~XCsr4a z95HV6O+2+^nrk&B1s4GisHm1Ka5+-z3xYve1%l*i5sJkp$_iwBI%cI zdPVe)SuUw+I_Au}n0i3~Wv~CV-wybe8~Y*#hC9d%qJ;qSyHB`b@ogpKez#2aCJ%b zfI`#|fQQX+oW!Lhvq9~^SC_~P?sX z&JH^mAP%5%EcK_~ZX6b;-2>`Eg5s4W0L6|=Ufdq3GXf6`JM!^#FjUuhtWKaR$&_D3 z-GDaiKZB}RmB_JEcy937Y8!Y*QkyZwJKD_T#9gxA4d#AqJi;oLrFm}U*tu;GR%x__ z`=)jaxmjki>T($x-8!ZBkF-`E0t>eBlPs+hD0bsdaixjMnx06rIhtPe*NtNzppHkU zD5IvsUCQ- zboZP#eCGqRe5WEh%D_Ffkr{ z~}QtL<5($IgNy zn~Wk|2miaLqh&}>Aoko zbbJz&BQ)S!6v4Vi;me1V{*|alz7szerKEzJbo`67-WiG^O5a8L3jRf;5=g<_Wn`+%6du zm|Ec;ZHa0MpE_~?cOSq7a_rA#-NHljj$#OxUrf3MnOP8NOH(h=nU>Y*Yoz86o6!-; zJmsknPI2P1R`vH@DI3!#zI&#c8{d;; zPVlH-l4QP`a3;Xjjm8h+2|sF zW#Yc>y6U0g1CCb#CN7{ZG{uhdUT@X?l}Sc+uJ!CDH+B@J2Aa)T|FAAt7o}^~PX^Nt zf|&@Jcb0id_2LR2)(@;rz5#aKsiec1&3Ua%*>kUdx5<73<(F=(l@5!YvZI^vDjRMc&mQ4uN2jiev}Lw^gAC#(QDcF zIh{lxb@d7BvG2)9dnP}2-AU><%%m1IQi04(Rd0E&qFfV>>{I@v7AJdw@TA;e&}pu$ z86{$+;ymHWx@dh^*IqndSYO`rL+P_w@hAY&#PYj3GU-g_9z9#Bg{_7PLi}Tz6RNZ|K^X^}VuT!2- z#z5=)%>R2<{PE0xn&LuKt*4J`m@pK};kg7rxaY-aqi|`ZoLH`9-t;V-wjrJf^Y7(k zcoTSZKgrJu;h{6hl9a>i&UDK6?*X0WH`>$rGb zPITa^5}v|<%6Ww463X3WfGk8gFe^`)6@aDCundGE;hsob&I9bUP>AD}lCZc+;)wC_ z2|Ea#*Z?90O*m+Oo34xkL8=p*t1P^zE~DZ$YK`ekP*js*fEgpAAWlR{b-LXv)lzqX z)+J?pJE(i)cYR^s#!v7y4~O5)E~jl@2kqI@E%%uTiRlio<(}G3PaxbX zPqHf-yD!h@2^kk&IlZNwUvPs>>*5mk+Pn9QqwYIT7-}%xaCT$H05T*{{)E%k$ie)Y ze)^xONND9K<+6acOBpD&KI2Edcy)Q9(f>0}OB?b)c_M~&_9R;DVgiK8#O|v4wUX=A z0L#8R{Hm(Hbua{%Ykdlt5X$JfOX2^@F;#sfA!>ex}d+=Qexc;5i_~c1}w=U-eh^Cb&*BA_qYclwe(ugQ>bYAvmth$kdO=mo{x`XTPgx6@tE5)?@_h2gF`*bFY8Kz9V zG(w>j@rzl}DnADnY*89(dHZU-%+Jl0R09`ycA8$0e)?5K!r)v=R9Ga?!?f~ETcu*g zc-I6P-5=fB{550sq;Fp_!BlTXR}{e7oSL@lJko(=yKR|3{krY>K8psK*}~GMU81G+ z=IyQ5b1l%#_+=4r)DtC7ZgH+|)FED`-E4;vXwYxt4j1&rTCH$zYrwn|P=+Nq?cN4s zn;#^MsvmBy`G}nqsS|k_R;L{#>heUWAEECx6Ry@oi)Wp_`{suRJbFiKREDy2n=U8@ zLfhu|kdWKh+#u^VWIdkFeG;?H+h7)V5NEeK9v+)PMHq zZ+PzM-h_s`5<;n^RCYIC#pkZwsG>eCDBzI5>Eeh@0qSV1b|Ia#WALU#;Qbc9r?EY;PVnw!z>sDbp+@>L+*`?FnF__1>z-|b0j_dRxskFp!(vB}S%jM2RH?EDDZ2PLch z2wp<9B$dzNLO}*RMZTV@WR_O2Hu9QD9z_(Dy9`xi6l!Adnn;Q8B*7xoG%66DMjpyD zD0X?kW{bYM|FEl%pI_kZJ%v=hse6!a96RP3ZXCPju%101=Z-CCb5nvF`>WOKUk)}- zoeM|!uIpU_!D~e~XUogb1HJZ0SCfQn#|2V47?eP3ainF%_6MzDJ z0{ubKK(mS1;Uj%~OPuQFWW32LvfF}>b#snGWdHB|O{5Zyeu(r${?-@iLN8=qwYXv% z4t8@38g2BDnf|8sX)8SX%-Gc6_$=UQp_Wz(-@)D=!APLuRf~!7&*)0Gyw@lim$DNT zdOq1b=Bg9c=l5;&>n)*993-jIsqZPv`F$QfiEsO!DeJ3k?|U@9YDVLvUunC+;*)HSbje6i@`lRz3AeF0tQOi=+LU#!U4z?TARIm%|4 z8qff`$wlG>g~$yoj>V-+y^y#go*6eEL&-gXtb)0T8&}JpaeJh~ze1n`WD70$z8(q$ z30IrUB-w?nHNnD&vONw6o|X%;>C0>Z16H+vATNs^B<5jaJ27EDBu@CyL22dXl`f`C z_wXmJl~B;U=H;)(=~mo`3;Ep3cL|Hw`gbb%Y2Ih&N7VJTcW0ZhMR$ zr_V?lj+s|p^f>cdE?LTs()wB`wRaOQUA-ooc3(z)K|g}2P9{UqRsM{44g**(;r{gK zUbJ3PPKuvV2pRUpoXAlBk4?|#*aiO;+&QltFcs0T`dn;3>t~tu-g>UH*TpSOr|YHL zW6aOg)9#)#B7X*VbmU-NPsMW=4ag^8Ww)OD4cHT~(gXl^ekliR!qNpOCGe?2DDJm% zz}n;o7M)m^P4$3~Wx(-xb6K`SkyV4%(u6gqxsDLbA_!{lL{Vc=5k zwjEH4kq&gg5T zK#1r5lE*xg3p%I`J7Ct*>rpHd-g^)?v{inI*0eigUJzDaEB3exVmJ0c?!I|uou?IJ zrfBwxMO7f4AYhaNNQF`;3|@=;APuwCjE+eGn3kZ)ea)guo>iju3dsqgj$(~|qRxEN z2BNMkry`>6)WBq-o`l3;qTaOGv7XaZBUav)g#qq`qVIM=AV*o~Cxy@%A%h_LL-jL% z`tifD{ilaRyj-`H>??UH=5=C>9U=q5Y4(r*?Mn@@leAR!E3m6@t6djN|rnKE%k4Yw4-+xrq0l@NF zZyht%={wie8kzuGA}r1H`I4PuxxkzEex!HtEIw-Z5q*`3p8u!!?D&z(eOiK^wc+W- znhWKv6q_@?ey(H(_|u6$cPmC>I6B5g++l+;OgJwN_eXZ!SOEM*0q;C>f}Sc)FCHdV zbkp9Bv;UF%S@#0}vtq745EO_bTd-4@ixt)mqI!gnDE(!vrcbO4SK7fai@d!S$Z~J31iG|A%a|R6sg;~@6V*r! zDWw(5k=MOe8ydo@2>?Uas^;cRp$Ul>5IeEy>x))!`C5Fo)F)>x+mKnVxU^w|*6}!Q z8I9yt)L`Rt?^G*eKd7vd<)ts_nQ;xFAG#X!&}{5kB67)?>FY#0kCgV4goEpQK;O+t zewY3+j2Xqj;f4E_TK73ciQh*Vuj;A?vSH7#YVSnlsXv&G|HVJojC;+5bv@Ol1iF;*xH3k6k^sc4F+^hRnNBYA;PB`BB zH*1rxJdf5jDr`S?YTd==I7+T++thrM#tgIqnXWF+RHOk#fPXu9IEEh;6g1zfrl}m1 z+YzfJCUj)@^1q-+yG^gVL#jsV)RibeZhtjPfH5;aOZ#dsCb=#3+Bt2PKM+hqc!L18 z&YjFyr+09pak>y>^D6qDwAgX5Dd61D*NwCb$+j1@tMh)rA#@3(>M|6x3f;-)G|_mM zYaOE^nHRro5}1=0P2@zIXtE>Up zQu;{_HODhP5}@Bj=`w0%iiB$M&WP&k+MThx&k}aVl>MZsUuh&UF1$46FRn_yr}()l z(Yy=!YO1UmaAQcVJQ~=0ZlkA+hk_$b_du}whVmYW8_+=^b0dL7Q4K3V+>_G6OrMaU zXVU|24a3qC>18Tz90QLr{2lhKnC$ghk9QKO;&fawzfT8x(`pu6b|f$F4QJsW%H~ zT2p9t+xxU-L+JKdMK9FtK&^zB>qu?c`*g1hcV|u)7XbY*pdX)OWC(#jpJO&724M5D z(mus!;3Hwa=gD_do#e^0XZIv>tF{6LbU^buo(MrG`J6N%Q#^{!4o-M(I7B**(>(Xq z{|TQtWg^I>h@5RI44RcTRGRv0*Ul`3lvC?{j<>r_wxhl0b>zwb9r+nz*-PJtWj)6EM_iauv<~jL%@z zVMbawe!|mI!PCG=G`MPte>;**#84}aD$YdGzbY3yD%AJK16puSo_sHu=5CDS*pj&E z*7LUl&8E)^Rm15ViprmRNG1vQ;bE-WJ*#`n5Ir25Xnr$EgMO?^>kaC3*`@c(F}22w zi$$uqoy5H3* z-yxHLIdMg@!(Q0unKO?h_?d{4s#i5kuAO9a4$Ol}+2>ADlD?Wd%OKOJ`n8lF!P#%S z+i*{lC8U}Qh@kY34d^y*zPoMsfe-iQ;z~ak@Wq$9?v0hMyY9YkZgxG~N(yuRy!WwtMUny4%fpcs(^5V>AXF4W}F)@NIS=#?_iUJR87+89bUid2>9m4!+6~HlEM05X_ zo9wqJjju~DgLU`ZsgCluW{iYLyN?mHxymxBKMH3|u3R>Heu6YR8bK`qGM!US)qN{~ z=(0C}A%T2T{T4IBAqyt6B80{P1%pb#Vs@g&xKUn^HG*koTx{G@zDH>6ylnI=pr8~5 zRY-OsD;);3A=k{37=!2J5nyoy+j&4F`bZ#n3aB!7212hu1miNdNx&biF%iyy$zaS% zQ~EXq;XP<*Bx3-?EdVKw$^eHjULfd5Z;m=Xf+mu#t%gri9asLkBz;O(Y7KjPoPH_K z%~Q~qQ$PDQGsy^^8B<+-prN5`w5dm1$GAe$`!tQRvhq6UEWFJOGA?}U9=BQiNiZdE z5L*^?)+$>so!6cy-s#f2a!c*ZMteF~GhF-|i7CB7tDl+Pk}2^nS@bo}IGMQn!JU>oafH&UJVFBs4o}>(;Z{!*Ex9xG;4WHjql& z5|IdiLaWf=X3iDBQ^W#MPp6e-onzWTZyOhrf?3WH=A0!=97#gB**a09DSE|oLRDSG z4Ps@mqSJ5P>D^5h&~v4vw9>Kv@f*`F*xm2{L703ROGtRQv>;}JVw#`oUZ+eW8$@(b z!3)Z`alTbZZz5PXvJSVPphDH~Tyit1s1dQ~?F)o0%_*9&S5zGOACH9$XPU*r)&AWU&e;fH+Pn%MLdX z83$QgI!+phaTWVBI|%$3D!S-B8Mb-|RRN(Hc2rSj4@1}l*=3`4mx?~xE$t5jbn66c zgEXzHHoZoT`_FM<-W)^^VtWY!=TZ9>a2%iC>UzfIp20dqornY+N0IBmaSTT8d8vft z-iCa8FWBlOw$XKWG(n^mp;z24!@FI0Z3))}P&MwjJOLR^pti$!T)B=V`gx7=@e~)d ztLU5XaKTF`cJxHC!zx#AjJ(xVe9{WiUi{p#C_Wa$~Kp{2Y5^PV4L+ zNdueNKanKfXWu7ois(EgOg6dF70;Yj6hKAI0`bSwdMxC*r1F#D|J(Td|G!6P>|4U- zKabBB3VHsdqCP1Y{ELk4`)RFOoDKTj@c&18)8s@&eG$_7M|$(z65>-S0?B0)+mj;J zW!lR))@&`Oec}1A3Ut6}?O9&-$?Y^XD|n=#wo+U@uQ5~7(7SJ1R<$olTGn1-y6W9c z6|_<|NQcOX<6h=YS2>zm0QdsLrRWO)3<;(n9MItuOu)_*mw;zkmQVJzh0|GM`F8B^Or2@#*xAw$;>L zq1td4KI>ZIw*qW9Bv1tJo4cBj*dMVGBUugPP2%f3VqQTaeLB2!>`9*`c32Oz8{EF*v|}(%OWCnU0KZoqr(Cy#7lY9>I^HU)Gl1y2 zC(@^KatVKOS5d7a8J-GjE~1=haV~g{@CEJFtK$q_=FHKfF&#l`C1R9F--nH zQ6co#Y~IcaMH}`1su(g#DN<)#7zEM;d>Ou{3H<3%{g%sd=flFhTN+}lYZTA+3PbV2 zi@~G=&Gifky}uD6XVI#60evB6`wXqh~xe z=j-i&^z`f)B{Clat=on`5H9OGxcT$-cB4JX@%Hnt6yltAm+~SWFJ_gni5a+h z^t?wkw2#qC^JrHyRGof(*%2@5888ZP)a9h0_K}=SIhwQ zHUTzmR~LmI0b2xlviw%BwQYlS5A|h<%|41QhPiGIuT|?oJo<9>r&PSKEZXdsL4e6l z&4q&m3ktI58TXylM~1?$bG$obr-nEv1l5Au#<)Zpt&Eh%lphak+%^{(!!8Z6>Qi#g z9eE*{cengCHk6R)kQJ}3JtvO+W%ue1LE|S5h6YkqSZ^?)COKb+T+%Eb5X5?Di^`3o z!+{u&e*=Ump~rVsFhFmCStR(;1_y<2;TH}ZO!gGkcLJ%%k2|t1_k4V>hi$^UUOUx) zFvE74dFN@{voCMgt1l5}6Bvmw19+M$^FtE*v(h~#;2?eiqD+5T(r(r0p5rsmDu6N=YzE%p(p&G zuDSVa9y61F$UE$gb^Dhk4WUa%212u1FO>E(PK=e%;3#>x*ekyi8^w7`T8^^hTGf>D zO;-~`9le71`GnUoJ@ZMHo#(>FG$s}(rsp5Tb;5w9++^2Wu&>VU7Zj8eq%1c^6(qYcz2#oB(T zd8fPu?|>Ilx8DRmv71~P2{>RwQkM_`g^zEqJ75KABo`Sget;qj*@H}1-`@%&iUbPi z<7y~k7KW4IbI0PFa&GGvgdV7PB7RxaS`~%)jcp?k!GDPmdkA27l*nyu9!Rp^D@D6` z8C3OBpZK1=o~l+%<@k2Rb@oR2%UUdz6HihaBYNDSJ-pCtp-I_MG~lEk4{wX!x%&q5 zTEFLDxUmlOd_q0phe>z-e37nCl7rf#*IGZ3BVySV1-nL~gNP&-irFm|MW z=SUxe(Q}`su{nGNM#P-I+`+qYdggq9?Ad4OiYN6gE3E}89!|$jKlKdlw$^s1llm6i zT;-L>dq8FA2d5ONxSYF<$5A@H)usN;UO;%Ti=0nqYY&<1qrmuF+|GD*2S%3wi+2^F zSA&QeBR)LR(czEM9MCXb?BdV69&`)0G;y@X3fnLNX-DA&wAKQV48hV`Ok*hzhNg?- zhXvwKC{fb4uWhfqjQT=g&ttc{K5avEq>9J~IQ?>v4;aFl8V|hQHa4fp^6MOq?|fKk zzJIs*Xz%dz?v(p`7#b`OI8VQh%Sb0PDo?kj=XsXuGaF@-fd?c4i?(18$K;MXB747p zNC;oujsWs?*jJ-a7|&Y-9`wV*PhP>03vazL^`;XI6GK!$2NS;kWo(ROMZ6Hm!s=B{ z02~}f3(OVoYx4oLHPb=}HySAC6KzL7-HEiHKi}$+`TOGsoH_fG8TI(_o98q-ol#FX z(lPLn2X&Eus^p(T*S?=Qv-gz-^0j$YzLEiq>65NN6k+Xv!T~|`;&GJDg%Izz zybu<#svFrQesPT7!h_>DgO8hde~Qu>hxYu%y2SqQ@)V!qAP;uehiv}6qL@x0dJK!x zSc4x?I`R%eKZ(t~9@xHwfsqD6skDsE+D)pF(T6<}-tPiYgg>kv8$YZb79Ss5o^(cF zQ#!m2zZ~=6OlL%L7K7MXxolpElh102#pE1j^%_rh*wb$rqjZzyvkMJBbtB4DdR^b$ z`fydNXqAlr^25rJz4(XAueE;87|kpFaw5UITZVn}`oqoUQs>VBcFlaRsRr&JrSBhv z?|cyhGDZOj-s1^Etkcd2BfIThB(d+N{UIdPGDQaADRtfW58ZWr6JW;116am0^oTciGO`HS_Khat!(MSm zsSs8AKM#V1Ho1fhyAAQqD+(7Jf+k+!OYSZ!`sxyyB7*v)x8xhlxR?j5xKl*_?P6_7 zcVSKie5WJXg|# zDKIh-)EQ3_5^G>O9!n#tHtCmW(P08k&o#w7E{@^KExc3ALtb3jxx4_bY2wK*+1c5r zE6XLa1eeKF&UOLG!ob5jKz43#u!V6ZnaF|+!?f*M4SGyp$<3A4IVOcAbdFNpy(WCc z2A6k*>&?$64X8xFirE)27NTQ^OY?S?RA9zj9hOyxvWKg-xTd0J;A zK?Bcv5rU>}wKXrT&hq z@*b2dYxOV=yVJ=ZZYXSsTq%9F&NRSuT#yQ6n>>Dxd^`c)|Ge|^BxqRHx!xeQ*&=7t zIi$FuW=c`^i|vdh1{2G{tI)pIN^r(TCAYQZaT&*lLL3Bc&xY;^ zCSTpc9z;^%Yto-k$jOv$q2>vSx0B&*`itMnM2|D(0VYQmwA{%P2L1!Cm57rmd6IykMBK-pEN>EECHw}l&iEuOIvQ<{Sxwlxv_GXYf zQZ~sYiEbght#JQa*<{!~-J)zyL#jRWMO{^edk=?cc(=*D*x=*By1QVno+)?!zP+ES zgW(I{|8J?Wl-EuRN<&}%wV?ES7U1X5Ti-b9)QkN-RBzt7pQOgR4jAsd8ZAX`;Y`21 zXFgsf7`pQ+@mS>LNW6&5_pxP0C5Spr=8eF;1;UIEs|tOE?Q-_=apEJX;Omt8*BcOfWzd!G2Kdcu&Jyp_F1G?p1AfZ#|F z0gWqx9XDRKWFRTasZ8d&_M+@59N-bt5=@dsPstKgyKvHApnbE_f}pJ%0MP}8}_RUPdUX3c^Fqw|V= z_X~up>h$T{^4G?n)45`tlr);H(zTvh8h`=jCl7&zx@oA{S}iW4?~jtkKlRU@lwO^8 zcdgs{3lN)qu<9oBGPmwA^eJNN^$X_P5}=%BjRm=HX84$`fQ&m@pD{#qN;kG?y0)jy{luIevHX4>Ffy0Ug`hHQvQB- zG2T4M0{n4zo!5SVSm^LBzR%h5*Z#Tj^!HWEUn&NxRt{TBs#f<$WUAhOoV9p8Z?t4l zx~>5wTe`7dP>;UJxjBiuCC+}i^n-}-ddc<;#iu1ZvPNP1zlEfK8(_Y92!7Pq9EYTv zr)@$Whot}T5LgUYy|hV(Mnr!SqHO8uTRUCD;m?ZV+vkOYgamhAp#+_+!&_c(Mo82c z^=i3*B>KtXnPs*b^f24 zX#KB@b)?r=>9O1;#dMiW>H}`SU>)11040c30T-^Vv%eeg}S{^MS+M=G&(gbtV=lQ zGsh938NQdewP)1ST#RS^E@g9*1>mMGlKIgGD$fQn=h6rUYwL)U13vbew*j<7B%)!O zOCR3`h+sKV1k$F4Q>cnEEzLwRsmF~36RZu35%U_?c#&#X)#!u^D%HL1zp5=3 zhre4c=BE!!XPkwx*^5cwj;oIO97{@0Os!XMCu%s={ zt)*Npax3~|Qd&KTHeUf0;=Qaoism({pDIyaZ~AGkIUQ++j{4QMpI^Cr*e+5d>b&wy z_1j*uz6`p?W?K#od7X66OX$ zai$B8g3alh0>(J>5pon~HK)hj@eF^+tN_wtUPqjt z&v@sIt>J%r;H4d{nERVtks(o%x7%Mm@xF4T++V{mdtp&IpjFF1&(;8B0y~U#-G7h6 zVVmf?NRu0JnWG8qqxwvLB^q_(r3eAM-Yls}Ma#>3FP_ng9R(2GxSF{>TM3VyKT$oo zvvwZYrY*0As(Wf{@Nh-KQO1T90S-I>WVAqBDw`oux~pwGqn&X|M7Mf3{kf2)@G1y5J^dKq*YW@P+A%U6p&K7L%O89 zl#oWcX6Wva4n+i{q@-I)N|f&&KuYv|o^QW<{{@EYK5MOG3G)}bkh$||HsCh?*n7*F_w#8f+1dva zQ(?-GI3|S<E;GWobwSs|d*NnW+?vX)7cb)YX z#mAWC7E4)i@mk9FmWOM2@Lwz8Ng7V%(C+mC3KLKr+9&JJYuUxp1M4x>M1e)d_mmUh zQ-L|7Gar169gM;9AL-g{xTL-{YDz}$b3aH287TCsp3w(b?LYVu*n_Xtw-9ncHhlcW z{df-Tp=2W+B>$#D^+dp$JsSz*uqkf zet8M=%P3%8!f46M$2Jl$WQYa``9xQLLa+6!tN&N0bEa_R|JEts_l*R=z#vN4p)4j| zZEJg#U}Z>e1H5Khk%XUp0wY+B?idYE#mX$?+GDY&$csN)v<+3dxIE5KxS{psG%MeH z{7L4Y^;-GOT`!bytmL*X;o^E!^>gf2Jor%*=-}}l9LtsTQ6St28CXloA>{V-Yi!>? zlY7^T8lAXDR4R`5dahzz?R$enV$2V@H|)~O8}M)m3M?Hk1v%bK^(zBJx$!^|ZzmcB zVHN=LD9!ZNK zivOf&?7wqXJA6ym$9!HEt^c}j|AVxl1@ZOGOGOIY{b*FlU&^dL3^}_JA{ds>k-L02 zw*hV%Ffp&}L0#8rv%B(qVzAcdKis!DYvhhi?C8&jrK28z zL=#R!dS7)-%^zS$YP=R@75W(TNb{}+;Gl3#3Q>k{)(FM1BZlQp%=m|E8A3Gq^b3V1 zA~jl2H6zTZ@l)QYPL^m!0vp8S7|a}qADIOud?KXOVRlS zN^dl$B3^28g#~?jW-Lz$Z-NCvYifcV7CKXwg>D){k%`TBx?%%w5!w>1h`B4JD$vL) zWtKd)IOQ%aWehQW{R%jKZ0nz|zS=&#Zy#*;drs?`U-2J%OEF!} zIwY;qrtj`dVMx~XFQu=_o)0OE{D6-4WA*fk|JPf(Rl{%ezW4o8kHLH_)ieCFW<3>h z?F=pp*ZV9stQR)yl!_8JhEMrtfrR$6-qQAT;(pMp_|p-{veNmviystO<{2P|h zUv6lZsl9XJE>2_KS*klyal^KI?E(&}OR;oBY~QkeWaiFYK7QoB0Cycu8+7GAR5o0X zf5!^^0a1fhHah~blSgjMTdIQ*0cky1%COkwe}~pQ)6Fhb;2feOI1>F4>A~=TQ)z)- za5{3dz1{hbTqOCXwNaRN3v~urtO@fm@8$A;suyTue)C&eXIlmPtTfSE+rPXt2cC$KXj27U7b_XkmsUL^cDXxWn0Eij-9pD5DX3!X z2-;_>tysfFTO;Xe$0F0vBgOI0SWhQ7z*kR8JmEsqiARpQ29bCvj|NGMgqMb-c+itT zQ*8rnXj4BDXlI%owNz8qi^XLUe#fKGhUE0=#_u8Tvg6|n+OWwAOZ-4Z+T)}iU)8oRw;Niniw>G4ko_w)$ zJgX6@iF8He+mP;TGmGDRPBUZPYnJq}28^KAq8fcu;TvhCD{V}`YG9vX{NUW4DD3y_ zitxM5-+Hdnp|AHUSi=r(f9_K!7H)T{hH9-3>mZB&iSD%5ry6dJm^m$Oy>x$7nKzyM z`7ztuG})nTq154THnV>U^_!FVU>~@`e&bo-YNNo_A96Vl4|naS`qUug`=fIrJwLUZ zD!xW&uS_X9$ZtFftCIUJ(8I~={(blnf;MgjWs1#=$O-1fm4lG>ca#XIo5Wbm4K7)r zI88n)V!WF7u136ZNa4=aA27kkdRkZ=);?8-PxrKY;_U;D1#bW0rn)OxGfBkh(zE}g zI{e$qw>ENYi)A-K5i7kG+>vS-E&k7;x<^+wUVa)0f38K%>$oe`kW z_&^|V9pY0{N|%;ru?EeEXo;8;NL_)_Wmf6tr)9s~mS+?QW!vVZu)wd;#&^Tdt<7ki zjewB#@V^DB`wrYK$XQdMl zb@1k=3lEs)yPj~?t+k6=zQG}IeZ80eWKc+rJtGX80Q9UN|IAi-@|R_G^Elv!9pyxc$7 zx)D26c?X34cW=>+{wlzffyIu?%-x>wht1Q0DFch>R{h{LuMJk_&-p7y*YkS{TYY;n z??GO**1KGlJD_t@oe9sfD(}I47<&(xGGfXRHovU`io>d^t?zH@r=B_NVD=6J-^|o! zPH5f8lv?ntcPLyYe`MEUabCo!cVi#-PpwdY0&S%U;VMnAY=)NW?_>>A9(u0hN z4AvgH?2g|d;BE)IS#6bUy0DT#t+?Dd@u@vsSVK}Ut=ZR9hR8j;uJ8wqf0Lx~2ZKv! z>|~v3hq3MOol#zKEaK9H;Du~Zxf(b(YeuQm5U0Fg9+I2V#2vD(j*j>SnTj%ik2sEz zZ~)R;f5Md<{=Q3iZ(WXl-$Q*cF3G#&xqbf^^HTxa&k#(;;=}prx9@fdkoyI=kTFJifBHu(mNVqN_(Lpuf|xQuM(~M1c6a#oEl@y<;g= z%oJd|`i(h{HsJSl@D0Tf2zB&dP6>9}y?io;xs-WF!6_nfniioC@0Gak`fpPNLow4m*Hi?l zlKA_lv8sQL41nzBxftX;8N2D?n#sB5g8-&PI>dv7RF9&I#Dqy+X8YSb$d+MI)IY{h;-23!tm}~1O36;_}^cA+xjB{u;#S>_pOAG`ol21 z6kF_n6A?kT=q1KJf%Ps=4}dja1Av$RC?WzF?~SZ%UyN6=+C_3I*#m9G5gu!zs_7JL z!3^RtqNB^WCtpueKJce4*<_)m8dOD- z5)FXogF0ysuWDQkLW=d$j6lkt0Y@4YT00VHGytA3<7go*N6pchsW)(40E$tkO>Q#6 z^=HWy$0sz~DbXHm(A3z#epI>`PZ^S__}yDjooIJek`%H;XpRTS&R@3?+sb4%CdKmU zcRWNW`=&KrLU?HjFO|XiM`Y@PLSdaKJA^XWb`5tvvdAJL4aBJ!I7jY@(mM6VmS}V` z!ZQjDn)c({-Pv>lKqgd@K7`8bklj!6pftqYdoINyGxAy48teDjyqJC;iprQ-Qs%0N zZCi@!2()*L;cJyT*>)MqRLgbvvijHSpJ<-CbWN%^NRX@lRXu_z>pZQBH$coPDG;-om-O%-#|W>6fudn5@@?I+?tg0aJ$Mh= zpRnNxw1GoVV2^-M?`2O3mm%)WC|4{NzE}->XLA*|iw*fI{}BKSvvaVmt4K$#2@byE zA+W{^;D_<8-cwl*Ig1{HkDSf7QWwwsr>?7r32X`;8yWYPGV+v3{VLF?rL~Xtm{T2B<$LV}u)`NA?u0O!-&u^w)!WRrRV12S}bf z77e<$x)+SNmn{@cTKFs!`#tqB1o+}2hUIG}ws2*>PZhpaZZh}RSAHAP%P54a{hSrQ zOMsD84VbX9%NLT-A*Gy*FP_IQ_A7XjS*$H*0E;?j&$p{4q;6!N`*G{BLwBA#woI}_ zWz}-_a@S&6T+HUB`b?55P)c|yBD=!<1U1{P99ayMamx)^JL}A~#R-{Q-*8gp2YF&)B z-*J`6@{5()Me{Gt*xR>9ywEdlkNBa_q7v*=f3y}+^MKXy;kql6EjlU_0KjIqezKYW z!+^cBOhj$eKHn15{9@JPKK2PQ+wlRr(ySxqK+$?y5W+4M#$mKeDh{_L01PcHj$rQC z5PU(dtJnQmkFT#O;I6?b{>OzG(G4l}YOa0H^Wl3wQQyQuaSZ=SdrdtNTkv06m~CC| zX^VxRp&0}r&2(N9OL&Tjhx<=r!Os+@nj`O`JgnT|`83%{L6%Wzr`$6=c--?mY}M#< z_uC&`A)chR1PAR`oC?uD;nk(S*ZMQBPUe)0@@|5jswU$2D~;s4omyJZzrJUC;^CJD z!YTc6L)YbL)n0P2X?q490-bF$Yi3dktvl*d6JhT;NjMfvfSj-En1)=wi>8;J-O>+@ zOfLk&2+G$>(}>cx>F2YNM}+5d%AgUNnN8$+`gx7fIE?vq93mOn)y%dF*?l3+>6wy5 z&YqMRi^@$UoXYGAnHKZ7Ze;8i+Z)N*>lhf}=4N#TO2=BtcuQ;P=M1vgdjW;Y4gnxF zf!pxTDl8{ZZNhTv{Y+17n~I*3$*I@@rL>zbMW(KiPn)}J+b$v4ut*^4(r_0n+)2QJoYAA}rA)(XXJx7G?IE$`kckTxwrBP}vp zfZ@;wZ;{Hm=>BzKCa`x3YEyA^J`#APF`4?y3T|)41aPuhkA=;d|0eKCP08Gb1@GBR zMOJ01%nKf`mF{q?a2s%+4o92p*xyE*QC_k$;>7^8>i>>tqTgbqz)C0UnTPXFfRJaU zJW}HcxIg}Zcycf2sWvkl7D@h3L0x%zMT3@QEqz1(@ibJm`+4L)IIdu$jSYda2W8+l z6(H2|EQhk7lqJTj#+Vh`;6Ob!W8b3?4Vx8ezG~5O)7cSjBh`i{Qw_a^+ zzJJkjUDV>Hj!%#n=VQCm7F?MbN3Ef>3d`SO?mk3ll2w!fcor(DtEKl30+bs2V0mM| zf*pYwCI*|is`AJ8lhA(sU;$+XB=Tb;wu(cQ*r{{Bm6S7eh<3a=O?1;6@ApYfC!O-s z1a^;>Q%|i%X(SU$P+kX#9QAA@(o~Q4EVxHZ((yP5*i#~t_^Fmb>6y;IR4HSCYathW zfj%<6G|6H*!M~+mJ8>V{Pf{S9>}WCb`c>2cXbLLa`R14NZ@*_VwC=}G%?~MQ0lx9G zb6FK^p0M|zyyyH&UaOV6tlZXe11AQP#d*DWJ559(kMG$`y=MPJPQ?0wxJXN-rz zu(Zk0wx(pBt!y!e9axg)NOqOEAfUv8kL_5|6r!x`lN z9Bs`8c~ZjXkXg(x&zB?N<7JcC5#hLjIPq7Wm(@jl4`&T(SZB)p2CP+cSzFmNayR%@ z8k?`Al&|D0{=8uN_y(z-Cz+dIxp5=K*NazMk&DZfJ09I&Fz-gv|Ge;N+9ac(NY!%C zq+ZqKo#DqJ_cs>m#r)Mr1?@7AsX z0W!b@^k+%@zew*pIyCHwXDr{}tn}G^Mr>bhJv0FTv(JogIx@5?Tg;H{zb4A3s2rY3 zu6Sp}q#k|MFDliXd`*8dw2yQD0hpbx#5EZ%TIxA@2+Tf-U%X51b_1RyA=dsc+==6! zKCi;umILmDO^pg6^2J?c$MpOLwz&+X@d&*P{c_#3Oke^^&#W-)tO&-^N$)kd$if)x+L{=uKnp6A%&3?EpW34z$pE;<1Bfze9ktl_=WW4{AXA*z;(z7<$CB7z@7g!X)iq6SJ z0Xh1KqH{P{^aN+ZTyOW5k$NN~dy*(2d zY+|7!AI@=TeT5Ac#CXo9>4thTkwbff1yFRVj?IoBWd$6*IPPQ2?wc6%4y9}Tz5TSlH5dvv? zb`^^3)?y6~#q)_;T!w*b!T7R@OZAU5)2~-wvU!``Vg#U`=R##qI zMa3y(jDJ%xeg$M(tnW#Mi~?^~eT#i2r)>!k34j3YtQqiD#PWo@Nvzh|1Sy_3gV>33 zJ;-i^GOB*UP{Pb26WPr+uM&GmcD~Q)f!_H6oNzlXiW{90o>c}udiTi&B_&1AQHN4e zqjXxl5UT}oI*?gZJ-BVXiuGEAtR5>w7R#iDrp(WHiq8~_tvukyU6$#jtJXGC5QY-A z=8P*_+l@JwW>Be$r(lWRbIgm!?{N%hcY<3V_T78^f%JIFAU@n(Ou=lU_WetVZ;BdxZM1=rteglI!MjL zzHpA;0oL=L`M;%khY0Y#aAGPR;lcm|itYX#0%=!#dv_I>MdPn@(am5t*8Y5z zmmUjEr<%UwxChozK>&~Bt*#NGc$n*OD(5VCd6E)%e|_y37L(Qyuiy8LXu~pko3y=?OEu>LV5;h zzNYqEM&hI}fJgG4opY^5`aF}Zx79QyU$`iVLj4A5f1Sxz(i%iGJy z&UeyHawHmkZDo8hOj#saov+V*5``TWm8e|6Wr*tCA5&4mfFR_SUfVg@vgm&^eIG$7 zJ!s2Hrk8s@c*wr0yl=GLM;LlF{UV3u=7h(TCFdZ=QJ?nrB!;~Q5O1;uVFe11X7MxF z<>sR|bHkJK_AD#Xs;6T%kJJ2S4lg%!QQFx_R+pY#Ya5R-SFlHo3Uf5DrVh7{yBihJ zYpxR%sjfjB8%~g`GqE4^cSg+S0ec}{ODpj;30jI(s0=7 zEo}}53J`0APIles&G}#id-=Trbez3#%(^Jts#o0aC&Fwz8BIE9-vXwe%9%YGXV1U= z_PAx?#+Hp@Da!3Al3J`HwCjcubQhQRX?_YtNe)T5##R8f2m9=&FUpG{GdQo zFJ)oKB z-%;k+o+ZU`qgoOOD3ddA&@Nwao;Mcy&Q4_FwS$DiM`4levQF%1Yd|OT1I)+%bphMb z0*>;#BO%A<`%4zMbmug3@a5CI(iu$=fkvf0_I^ZirU30&x(lqtbL4lGP-O1cai1UsQht$T2n zG2j$dl+sta*Wnf&R9K+H-K(&t)_b}W%KQ*ly{Y%Hyt_N;!THmjxVI9pbV&5(K4q(= zyf6s1=%L6BfO2@-W*R`NOwlO}Ki*g#d;5w)lsvd(<$YTWx-UoWZP8ij43V#1O4b`m z!$rKiSe#M!q*h0X6GAI0wZE@<4*z4t*?)k$>}gG-gSmVObOnGM-wrLcGm}J7n>`|e zxEC4{B_zakl0>CP!zO}hgqkO~6zu6Hg;ZY7NQN^m6el=nN8FW+WUiS3^O->NlO4_5 z`Xr(QmW6_1Y*?EqVxJ&IoR9OPvUwAChpsd%ftkBy`e3c13H!k8!(C?Eed9xP>5UV& ztz`XD3TJ1}#DxNGBKhc%uW6JNN)9@<|lQw&4z!N34aIdGN0+lK3BiEH*T2oBb zFOB;yipOekT7<}E2GzjooN2vRU;jR^Iwx&6@57%>JKuwx$aK3`-^hGPz|yv>e!w(q zx59kjMXQpfPJ=;#<%st8!F376OVR5iauZ4c#)P zb!#Fo2c@Oh!;Rw%VOgzya9P;F=2Tp{h3V$%_d_~COuHpPLhDc6M(4 zw!`;#avkp5eQSCY{YF2R!}G~YBwIiXRjq~0H?QnetM_I(-LlekQ=fAy;prj(k{IAZIG&)byVInMAFx9@dN#zU%nZIu4T!IR`A@N0pTTTmNQS=M`oVeW-3@0 zQlzRq@IO-BFCXZC8Ai#YZ{)6ovj3&n!$9E!3s?YD@~1Bav;HOM-YhJye`!Bs?Qj-$ zXOxKFJDQg=#^xTmCs{*ST#%Ax@(%n~+mBKoh4F>&Cw?b!#c=r9?6)E;@1WAOvN^CX z#axiST)0*r>`TGSS7a0iXxNIfl*+BOw#h_`m!zwmMCxt%Ts`Rk`QAMPwrOhgR0bMvG25cy4?8@%&8@XUx)SNwA7M5r|6F~ z0To=yN8Wg%U3&fHQwr*RD5ui;ar<*J4YfXFRuyW60eQ7Mg?CMis z0gE?N+W;KRd442q0Y|oTAZ-8xwXQWHfy%1=j1+O-JxNO?fOTBsH2V7?U^5Z}rwipR z0?XtRBE%anuJOX(nx>^uVOcY&@fTc~czfH1SFf}bu!~RN|Ulmft8UMd;0Aw*|p9zpW~W=Sy)M( zBa%Lse|a{ppaZa46%JU;?IqYR7Vq1olhb~;OApPt$l9ZI8A;W@T+3oT*CV}D`0k}; zS~j|Z`BF%$MdY{hm=x_gL>OFBeTk&5}`tJ22SBwBa0YDN7-75ow7qF%R99epW| zg+ei{?W@uS555#PJ-fOQO)4a(>P$XeSH;xxmmhOo=)7!>ktBPW;?p-C)vPU@ewE-i zB%ehbFxO+(-`qd+Tm6}$Ku$e?*>4A(xLfi*ZomXxWJ~edFj?uio*#3<J zek~}H##Sjq3#IJwSc-e)`dZIPio%h55=B(mYqBVFiF@JU+;`FMa4E@~1x?Pl7bTIj zYAZ^fNI0p^jQn7wy^Dn8=L!y|M3HT(At+sPyXJc$iP5sDmVEo#bNYdosJjk=b?R~L zl#{0IxR}LP-`-uK61vxd<0Ht+Bf0GTLQBys$&9aX&MgmczU;|6Uvaj~qD1O`{ z*4ZRUyC&55L=F_ZyYwC}sq)4I;;l&T=eEAm{@#RVo0NKM8{-vi^94$+`m7+&YmYqD z-_;;BzkX1;92oX)pY(6D5_F98pSng(k+mXdkT1ndb|bNn){9b(W6mx(3XSQ$dn@&# z$u(j{4G48}>NC95&?{7$v6-sP>JQ%fA%Bs+A)qQ!z||T2AySjRsQJC2&1&QbM#`N= zp*E9<)u?IF6tV6rnsxM$5Ovj;l&#nwa~xoy&$|Kr5w?DmEM~Mj1+b>ybG{=KK9v>Cj0O(c&*d z2ba<>fek*`zm|osgxlWji$EC$82je~FW(hU;m;_&HP_?9n;E?j!8+f0$zU#1Nnw1U zv)UyK>t$K~i7YW}8m0<1v)S&vtBsizz=evLVm~#{x_;n8mgqz4^zDtX!Gl(6g+hw1 zm{a>_)x7aH3cDZI3ltRvFs+^mAWFF^OJGu`#6CDL{`iX(_D}OTYo1vAFJi=%`0=J7 z=Z!DUXa-ieNVII0@e02}C}q4@j{*cV-PQchp4CpN5a__-oJ5Z&!x-NX2YYLi*N=*` z=hJCM^+O<-Z%l?5~}f9L=;_#p@R@>E9i%qX6(4-8 zmHPbyY3H?z45*6W!Fm}$R4q(}FgquT`%~_dM~%3&KA#KxT^*jrQr8*L)}JjBd6*Ac zqhij4lclbE!}5RP9BS@y_V{SuMgu% zyjX(rvdUK1;s^koJY13MOB(oE>Bb;}XNr9dl(Ol%weQ^YO&ZA`YMM0BrVRA9P!`Rv zs9rN-G=NX#mtS@)&1 zqU~|W?oMe_4k0W1LIJV`dtK_(V)r8U#v;2ywduWk%Jt|DJ922ZzrMKCdLZ8ag~-}d z6`4M;+#DypYyWr(JH~!%9$Bb<+wK-q^3H+_r_qmnd-*Z(zUUzIFshby$`K0??_ard z6NTEW}&fCj#swD_F~u;Q`J!FXWpR(Gu>A=wC~|^By8@+0q%ky_Uj-36=1WZ=^Tq zOrns31TxOz0%y7-Eu$M$R6OFRpm`oh&+@%*W$q3__rh-2l!y zrx?O8lwqw01_-7kQ03bjdH+XZefP(gk4K6JiQSR<@dq53%w>6V$3Ks}K%VnN>&0gL z9o3#(X=;L6?{USRJn2rH2Oczj!37Vx^rh7ZP!y6iBXYG|GOgLi7WWSo>UT0OeiW={wOZ^IyZbu4UKY&xv$$9$wkN-9OousfFf@j7>tx=WB5uvJXHzzip_zZqT0Y=_~?{tDo?~h}OmV>48vyVJD(rVmt z?N8DLA!5NYXpc3(w<@%sffM!V{6jS0Y1Q~u=^u+kvE#EA{_;Y{$9dN;rP|UOsUx`-et{iWfsII zp0=b{eISrPFMdmJdF_FE?|0nF5N1)4T5LTMrsrz}!Pn>#=RaqGp$PY~8+k|5guvlk zJ4|II^tW=VqW)uO=B?wg$z22pCf zEcVo5z{m@vi65xNM%?B*ipeIxo%#5K?*i-f=MXFbl;Psp-~e@tgo+}|PVu&2tpJ9p zb%*ev{4F6f&SUD&?O7nh4N!mXV?dZKrbI{W6Bm)bR8W3>4|*2;6^hOoJ3vls^nIWE zgHwVPyw-k%GK77njc{N2ukhMq*}oda*4WzGj}-q-vb%$-D{z1^+zEYMDcm&oa*+p_ zc=hh97e5}g?mo}u*aUP>m^Vq`&+pqS`xD52p$sW8sJ_GZlH;+|v7A>&1EuBGEb&RW zUi1CJD_R_QJnIQ|*WG}-clr~+XQg%qM*P3C_4?CVou7ufXptA24T9gLCrdh1iM`d9 zIJbIL+0$7AZ?R-EyS+jGJbR_cCk%n+pd0^ycVIdPkbn+Da*B<^!X$Y)_U^i8(M*qc z2Pq*@_vj|q1-{$}#>X_R!By@2xAv6xCQ(i!P=?1pFXC6bqQ zfYHhhWmJIrWv`?c*w9tgn>eFs^Z|3_6G>kdaXvLaBtPeNzdIatYR^NMzNx)J!xS2S z*^k3LA|lLe9TLbxt`iU-MZl*Kd``(LiB(>;Pb2u5F!5x78lK!_$ZxT)B>~`wUTX<3 z`E?X2HTQstsSp=(p$Bm`_O8OF;w<%A@%~4%YzU&`rTwj!O@EWmRea?=0XRKW%D)uY zdJ*il)B7Yf=*~g%l7ZNb!b#oH%<`JqInQdOve|4(0zG|blLZj_T3m{@kkf(K(vgSg z8|Vc_)DA>tNI`h(0fum=YUzms)& z;2rGP%UQOZwlOznMB?y!B&@v9TV)X}j$$cSyktHVw<}7XDncZNccg$UW&~AF3O_+r z0Wft~i~wD9s-zFIJc61p{(Hd$KGueORhzp*n-Z@$SP|6y(J_V8dHBh#B?5&B>ePeI z-A7GgmEw_`cztH-_++8lZ<-{{>89wtTi1)Ha>}HL_-Q z?Sv3bdB;RPDX30jm^~U@3bzeCeSG4!_ADe+yagH$ncRKdY>})R*qjlrEj67{S|k4@ z0zNzfjjrx#ECWNjzbaZP-+Q(}Xjvsthzszyg~64j(CGq1b!r0;;Da(q@s=Vri2L#q zy;}_!oYCmqUgqk965HbqwW=);4VWNAEmsRF;z?%XAlW9V<;lvnU;Wy1Nf`VvW453B z;`*@V_*`(XS@t5v37u#w7YEO7iADVpw0ofi0!p^yIB;FA{d` zFm>EqZi_zn+b6}wX2bne^if^jcPV|&2V6?$?^_NY;JLVeJ<5GelI6PjsBfehz!}#g zI|D)z{c*H8fO&i7Cg;m-b?7B^8_DCkSponiq7FhkUFuG}sy*-DMIx2Ic_U!2s$)KN zFS^F%WUS#M&wDZZYumIZd-VSQk~iWkYw8IJ#mQ24Vk_|<6Elu`|A1J-|IqFJRq2=X zpg#T~bLHQ?e}LCXl=bL>e6*E-jG*^B(rJdNztqtTQUOOV$TzTWZc$fCI8yIaW{vqqEc8sU^wsum8RK!$dLh2}lH6n2o zLf`L;cO{XwemX8u-(ofyT+r3$r5lt^P>sf981L+z9##lJO*QO}N6lJHQYJ{t&mPqT zCtob3i%JgbpJXV;vklC-A{-%{UJ0+q6c_$_c^s2vYEAk9 z0C%gK`{rq~eLa0aK6+IJUH2c}fAXGN+Thz0`PB=@c5oK}BQ`RK2gU#27txq}X@%3FrTJp>Rk-ra5X*7K&F% z)PS?E6-b;a6yDN@oilyN#r{E16M63PlQGqR^I3}OfM5?Xvgap;Qo`EoDZ$>U+3rxV z_pl-}hJko~_uGc7Iy^xyfdeI?_K5R-Rt1dddd4}E4*@G#kuS*?$lj!{d7$L;n94Ku z;SJ_*qYvm<%;T+-#!>zv7y?2(FDu`E8lLDZKPs&TI9-p7*vHckqolUN66wEHtkC#~ zF85t#vJa7s7ew_{pVD@rcGHsb=$HWnLr0C>u^pVQMo4V{{jAfoTm9ql2oReS=ggwJ z9S!>`@p3k5RiG&Cqn`Ci0VB_R-aB`}`MfT2QYOz%8HI%c3e7a8{P*@EOhx2242HSm z7TSv?-R`Z-rHdr&Xbg#oCX7tscOscRCX-FL!Qt9!`rrcpc%yPeUsd6p0&Up3tX(xb z_q$;+GhH&DA|peB;EU}1rerA*aMH~vR0c#V(d#v-v5Jm#;j!`F^aYAstu1#i_n&uS zQ_x(by@WjfJcqs(ohA255KBu=!nn_k!mk{I23`ETV&-K6&y@7*Nis=q^$^?qVD2UI ze$U)T=nOyKuaE9C2h&Sz9LuVhTo7mi5RV5c@ssErj?m%2F-`iQ#}ZG^V7hXA356E5 zy_qyvAE205JFZ27ML>xD@c@X<>Iu_~yPiMNjGx?Zw}xK(=a9Gucj881>Umph~!O&GLi&_8D(W+?!i{ zp|ALGXbKfa`Nd1-d|?Z`t&>C38w1Tuyc%F=y2?#zy#i0>%lLu($JPcOtLfvfK^!~Z zr_26SN$yCPV)0uM9BRhnxC2i62oc(fRj^@gZ)aPLt`f;BRBTEF<9%jtU{Vf z=g9~Rc;cwY+Zpv>_vdX#$)Yn?1fGzjOvJcu3u&APLF<3^CXkI!Cn+r2OeY!Lpas~Q z97TQSf}cV6a$t^Wk*Fhb!%~XLlP3MknK$(uOjd~IrApVK$F)eV_C*(7O!|c`*j|1+ zg=D`a3FN>W9RRz?TNfqjE7=3fc)>n;-iMj(SnUkJd>nEtPx~D~Y?}u`e)`Zitn;*ot z7Xd-Iz>>&&Wg)*)gtLFG^DzV2OqcW{vVw#sTA1HHJ(aC6Pf+r(TkG`=F(~{bn)So{ zvw&V;GwlOC7Ge5_2^HEs5nVr=TNqMtGQ8>2$1_NqL(KhzM-a7RQ9p*`|FqEeG)=xU z*59tgHSXRjv!$VwGJ2aKoR`_U!-he=a3G$ua%)B~C3<=m@%0MY$B5oVn|Wo@3@QSHl>x8FatI zJ=biOJ%6|Gg|&BU8z`oS`|T>%7+YC5?i*a)eD6%LouxsyWa1FL>zxp~kPxtWAgI*! z&bY>%2G=&L4su|A!WRU6_gZqL6^%nXH~?0RQmUy>6O*+0%dontoYM=gMQOOkc)YhH z0=@|6K&&UK?IHFAeQ%TcKk{TjJBUukBEFwCOY6x{s`?wK&dui|)MYOj>JQ?fy?n<% z_m*T*@ENZDd=WwUC^6Pt?e&O&)U7fE)0(FWfP`@aHRpV-fU-Y`cHwXX!Hf@HT1cg%TO=Y z_&{Kn0`--GV@k~Kug*%!{LIXNsJ?>6l&sD$uO?ZDIL|QDz0y*i?5Vd{{V_U12%OrL zCRPw0X2L8g%Yv+55YZKAP=Xj+^A)neuQ*$j+@w$qtZ`R_3vi6S>%Y$)dO=^hLHAw1 zg>}xCzLEz!!{lT9ifGJ-R`@qJI)u=ZZtB6^RNYI4y44*r3sE?8VgrejozC1o58^!W z4vfRw&L*HWr9E4csMvA#Kzmi#Yx5>rBt8iSch4s0Tok!%~jd=(C- zfQ{v8Lx)}GQDvljK8i^jiHZcCmUKcpwN7lne|CmUomw9wb1%i$Q`(1xU-syt0P8v- z!|pr;ItS75qO5mu{lqgL2*2Kojz|ryNF2?NX1sV=ditq9b)Ei};W*LthS0RHoRn+UaxZcgFQjC$TQ_xIHNW^k+S$$*iA%E->-^9j;JUP2%IRTaXlJyT*s zTT0XSIa7L_gD*pOb@VWEJBZ-{2xBi`gk5p023J-;=NyZa{&EAB+Qo#1i>C9}eJMTk zufq{XUR-Iq8j{XZN9(Y&(!f|Yz48vTQIw_aLJy;g4~bTdH(kWdcR)3}7Ue}JszjulSp}z`w1hBMHmE0?fAwJo(R7heetE;tv*CW2`+GA ztdvhDS&H}kwZVeo3@;?CSMe6ZI6v591~BsMis;-ZhMxD*B8jyirr$BRLl3=E0UdfV zHE#)uP**MetX=f}IeiMR=$6;*)tyqWoUwbhUIic0OW@!xvPw3Y=F($1z?=f}n_{LbktK==}_$tX`i$!c;v8WIF-8!7Q01w0v z|Dtmt8U2-~S|WMrzr0vHcJNd2!N7u9*p0{PV7M3k4)ESk`2QXB0c%{b^~~=0+jPw! zW^mS%|A4M99)*S~RwbNecI2dY*@XimIlsIKR8tn=$l}dPthoqB;!X!MC6t+JU>W(sE^7ksI zCa_3QLhfl!DnpXIXQ3&_8rMBx1~oN(YHU53%`}%MynIAX`AhW~{UH8){oFR_rbga< z>a>g5?SECSjo-JWC~ysj|5~xx!hl;bwh{>`*gQ=)o?qG*X5e!sX0Z}FL>dSD#B(#K zziw~+sX@eR04I>fBa-DYS!eNd7K6)K_#>wLb~sYP)pkMbZkBL?OFj7^;MO&>4)d1p z*N<=eV_xeX9{dW6w)^$kyY#S&%%qYP2OoFU%QaFDiND<)4AKC9sF3%5!6|+7k<%1e z$S~)Hp{Ox#jd#Tv5ERmliGAD)u zyIAtIjeVhVm)UlyrcC_BayrGUotVlL9(2026e%>ih@HD=bm^~EcQT6zCD7>m)1y)8 zoPK%^YX1xx+QO*8_GE3YpHy~uq{=TdI+n#o~@<@I&bDC753!-`zsRA1_4+WR6=Xmp9% zJj?H1e_{`BPYiPwu8Z(rL8HS>k!qz)3Ny)XL-b$CugjNE;_Ags8_lZ|WEaZmIUfXw zw6gfpx# z`JHAOBa_@fVvOT;dFy;XO8Xk>-T~sKXZodFKV&iOJWy^TzYlm1AT!b8Ufq@c7%UMl z5@KOEYer{!h4Kx9#lZoBbYW-PEg!-gKz|;ioGRb56F5Mi`F5LxcV{V|htABf2=)RF z69NQHQKp($rts21)X>YHN~~7NHPTkYo;sQAM)2KTxr*`D^HYOsa;Ls(QL8-i=jhfB8xpmmOiUg3)=bT94fY3n*SlBpjDmx);hmN@5FgGbX;K+o< zx}I;Digmj<_>4AL(%7;3grVA+`}S z(J{Kt7c}DXs7eFl`v=T}5_qKWbz*eddd8gGbrT`N-t@C{Pi5}!K2Zz5g9nEkQJ`Ba zudTDpMwkN6-I11cK{ZT0@Q#d$ekPT39au08%BL^H$)YO-wUQ(4&L@n2qLVs8utDva z;;y%7IHvhzv1GnKWYKl5kikg*D+|%r^37ZsBd3kYxvx6kSvS8{XCv-hd5er=Lse@2B?~gL&6aRzmXAVY>BNOP>pa-GP@oTBZ|>fhk+2mwE2dq><#YQ zQ}e6O*s;4-ZNR&}O6~AU*L*&TmbvA#@}|j}bvAv9%|*V2(p8IudJhEuNm;AF4O!iY zN&=G{hr7`35g~p*+JN{)%U=BO3)(`@2O*e`+lO}5i(>ny-*gNkI-v!QXid0&&BH2S zk{IId=XVk5O|CBzlH^D4K!m5WXCAXwD*ZTkTkIu79vu7l?t}Ou^-?ZdS9CU>m)L}E ztQO^!l1c$(8Z{GUSwf%FWOV2HAHLG53|P!@VgJrufW8hj`e4LI@H9G4yZFm970Awm zfwBU&2VeB?@kig@zVO4zH0A5h@7S5x0MoeVS;WrzRMzfKl`kIv6D7uoxG1X|ytoP` zB3~>hJg*vQJJ|{8u`>J>6z)ls2hNy$vGBK^aHFH`#|Kx8RpA<@xPr$i&>p2$UC0G= zR3GVTwBtgMD=%Wuz zF}Y*AB7}uJT|;~N;^MU5;_-=%Cb_86#KB)o`N_2{ex83>ex81crl7eaq!f^A`awhw zWRbhv;5}L7IvBGQ1bz6aqcu+WeJTSzy;NC3R}vdQS+RpY4ki8skq-`&#`F<*bcwMp z3g2-$66FDAuB30+b%s<*PhmvU56&+x=*vA2lzWsbo#_9VGQ7!Ep3)j$MhX+D{IeK0 zMZD~rs0&w(f)jXE-6AKc_!Eh)J4tu<1=g{R2a~9!e=LWDy#3i~Y}ARQ^@v3_!-{}r zrz=Hdv8y}H5Fufl@c~^o8qM3?d$@T&z0>q8BSi*R){C;&n4Wv2@qWSEC~gwVG&#q| z5*ntD`9UMrtU!`$R-Dj@*E-Xp0Hm~NSX4HEdG&dz$WVN^Eak|9uO>ZnitDAap$&Ff zFBS-gxB55izExz|*M61l9^=<~pPr8&?n^B#g&tk}!1MnR_ZECn?`_vN z%nUH}&?yYvAuZ($Idq7ifJh67l&FM3w{#0gcXvydbc3j%Al)H|$}@o5ZSC{g_kErB z=XnqF|IKl%W3BIs9g*wAdJw$~*Jj9xy7t7~q%)7Wnu$!+PYf<%>={WeBrL+I#Hkd@ z_L{L>7Z@NM*d|Bh-{SDD#+|7?CeUf+i6BhF?UK%;- zCn@7k`q;ZDd3-eBhF6}9p|T`J^=Z&gwLF!q&mv7kvG3+w9z0q`GW^clmTBNQ3)XtmOMBz%u%DH^J3OAH8yzMIX^I+ z2e9VfG}}rA7nEDEdO`Wzdzid=-}1_^t}bzUv2!zuQb1xc%Ocv;U5fi~z8OO5`cKe7 zbWCe|mLlbm!KnwN57HJ@HeFsFzd7u$YW&!@`Iti|`zu~`6Nc)R2foYzx>|J$86M1w zzkUL(`CdLI!1hk4D|GVl9UI0C?N9V*qXk2pN;5YgSA5N0r=0AR(Cnrzbk6FI1C6r8 z6(sq|JdW6J$-OpF##;?Y(?`G$!+MBP5lJtvLZO!tZ26C#$>B-F9=g^jTG(&b2az&p zYx|QFB@xJHJTory6oE6=2}dw~VI9G%Fv6kV5C8nxG_rsb?i0GFyj8Z)(sk&keeb@{ z@t4hm`y#U#YKJZFDQ21B^>btchaER%wt{^hzGvDz>@o4)i5~c@!CQ3He{*mbj27^! zpWZg0I{X#pPF|2!yb-k;qYI;Zz)*=46Pc&%8a~@_t`81rSppS?dMmDJ8Kq5PB~HUeMrV4G0_q+)e>yYMM3+2Kins&eZIX}vWFu~lDTFCmWGr0mJN(cP7V-69aX93rv7r`HJ_(T3cpoW034!l%`-7D2IZy0{xB3B_v&N+yZP zN!%NU??dOjo@tqiQiPolp4%q)P^M8hiIF%kjXwjCPZct5Vx}Qz`;Yx!0bWiTCf#AI z=a5IGNS2Eo4;9MJvYmVhY++gb&tXWD(DWdSLMj5e2J4P2NoOgiAx%PK^zzwPktU&B zqE*$?6!;yNQy{X1m`h?8iMM~b-TOv~+M(5eYNuU?8+oBcZ(e9^X6^@u77uf}5w!|h z3vyw#KUoYg(+}NIZ=Pn94ko{ISM?3*aWM|C0#VS&(!NoG?nw_$T6N#&9YM2{)!C_k|A?^-G2Rie%V&Kn;ZPwE`g-W3TkCNSR04I5NSfb>6QUF|5@y#X> z*DMenA0ciF!o>%*012FuOX{hq99z(Ef^clR(KCwOde#j};8?`gDSaT~Lp%F8Ue{IW zCRFUbZ6H;`;O-E|P!D9ljV)0Cu1eM>F#LR2LC{wFcEmk(y}DQXFK#{%*dH^!Ew4Kj zm-1R~H1siX^Q6_!wuy%y|2f-v+W$pGe19QUzU}^prWCtNiw*Z~urAHqQT?=x*ZlO8 zZ;~s`=3?IWX3TTW(O=D&KW00HdGc2rF3~P%W-8e_UoF;qqJCfkKPmipOX6VMWTr}{ z@qq5C+D$f>n3IT4OPxHYGx~qXc7B~*q&Voqe~4w;wZ!;A^5~KsTde==7L+^%%gT-s zr~D=x-*z)${7TZ}Jxpg$o1A1vmgY3ushmbR(bXYTyZzKID2;j%(J4B;9qiPbMx!7s zC$hdBG677#^$Afx><9|r={7{EAg7jQAGoLP+4~BFj4tW!{4v`Z{?yM=o1LIjHl;Ts z2r)%H0;Z_DTFGT#>&_%&krRc<=imYyVyb*R6~@54c)L^_%yZRTIb)KKv1QbcL5Wx; z#xykwPI2>Uu0p}MM478jLpuY#xRG@4Wfb6@!^*DQ7AeiwGo@J+hXQo>Qpx+W<%D~Nf?f8~ptv~*c`SK< z7gH;$`B+ z5vv|55XCOVl%tiUIF_rspL?w@SG%fbtk7jY&k#578V0D{(*^v@`~pHNiasM>VxQr1 z`)fVS&XL!>B!z%AU412|iQqLsu>zUfx_2_VJX!nP{YbhDEhj`h1hk=#WV=i%(7Um} z37%&!{i%s3=$Ds%+L-Os4l3;f{_7TU%KP|Vg`fVP*g@~AGs2|KOgt8hNmqoQ!jmgb z?VxqRDYf@C$4l=nX5Oh2)|jdF95_%BXSJJab|$;oxGS>rx;Jgn@vC^H!}6q=CekzE za*a0Wt1Os3>t1n37~x&SRtk2sb)Ss(11264 zF$AWY(FYXD@__?^rJytz->1>p5YyL(l+-aO`Dwo0b>L!RW4`AuiE<}O+1Rk z7WX_!b1mS$k}*rEp+W&OX`$@wId+lSic1;YmMd&&@3#+gvJy%!tz;>upJ7ycR&u`I zLNw8644ax^#D=qZg_W7UH1c{*Tg{|Eu4GR<3C2)(ak(*y2VAfhrNEWg(F?T{?U8zG zMVX==1VmPkQkegWbgvD#m@38vXX6~)$icQIKtdh0=+yDqdR=qzXvF8-Fw70`rBEQwrdyDX$?PbcQKxuc=C7t*n#{*>G_$72btnm zy1;YREmsiJrI|M_a9>B~kFBYHRY81z>BBW7u8upMz4ZLc1*NkZ_j(^F`vT8^LK}zg ze{Gohj!`{pdJG~8c4_ffn-R4yDx%Sj;LS_Awnj2!z_C%e&3*hM(T=64zL%8q=i~!$ zvre<}LHVPDxF`5u4-@X)tU0{<%=X!*`6{Fuv-J-zy+%jl=#mXGq-v;!)y2QZw&h-d zNdfxaEtmXv_$dV}k7zl2>1BEjXgZpR$8)7IJ_i7AAc(>$wsbG1&l#CJg;K9)iJ{8x|B&<{tv@@TcD*p5m4PsNV~c31UDaRDl1(OTQD@oXdC?QmqUMsl+^I zj(mHqC{Ut)vGanlnGt7E&2N|6R_xy*AtB^y-}#&Om6Pe_apO*n6~EDmw0izG#)>*L zsWUneE{J&GDxNm9zc6z$|}K^ByxXCMw{4oC>5UQuX7bd-`+XmES(`w<^f_u zgt_C5u}sl_B2dS4vuh(rmd1{ffhs_(+70D*=Y&#)SQLrrA0=v#PkDoyQg9zcVIsx? zB<9F90wxsN(qu(x7>!K13GJRgAsa;82)Xd33+b8@bsmDju>=@VWeH~!>0_)9)8#ZP z=M6pYAv2zy#JHH9PiC5%Uo(U_9c4({kLJwM-*5DdNW|sVBzq1xS|+rM+}63pq&rTL zm2g*RWh|;^YH2C`3Y;<_J<@z7GNaB28P!DC>psg$juwr~E{e;wx{{qLw~|}Dax%(p zTQcsl;`q{%9bFzz91}&JFsQBV+*r|mV72;kZv%yU3M~3nq_+gPMpR;Am8lUKbz4L37R5jneEcc8AbfH@gX8Th9T}37=W- zA|Ot)s01|1&zgzw-RyP;#iN{vYltZNqJ|e&yaa|0q`3Cgm0dZyM%6Dr71Y;RL@Pwx zuzjjEX;Ofp`C?GY&q4FH{8;6Pu8vIQ>DJg4>BTw0xjCG+Y~?j3id^*n`yYV|_D zu?@k3$KC$?MPf^u>ZOh~8_;NN0uPZf0@+k2k6B>=31^(I) zl0(FSLCNhg5ob6@e#nST+OJQH^Zm6VT&6|WsHVU#4b^0SXp~9Z)tutKb^YRuVYvmX zG&%F2ogncn{>kN~YC1x0zlk|I0(?!$*in3X6=JMiuW^Zh@&R*%m;csiY8#D^qNnP` zHuwfhJf~FWT{Rg$imO_ARHTegCB3M%yCz$r^oK6qpiZEAh9;Lacv0xKxGGJ9AMDZ! zMAs8%h9+*TvwwZi&x?uyR!f{_bwoUzj65N9w%+o!9a1*cg{*a6gy| zyL>PoT>lWkW%ll6o{Wb5Ft&MFH)$r z;XavseORjN<|9LE0$JKe%b$sBFD1vzX3MGMYQ|voB=L>0aXehnPGBE%*WTyWYFN=I z%|*_og7Nxaa<8dms0Px2^x3@wuRj;ouJ)=ZkZ@id9~Nb+G51cZFXzy|3#hL+-~u?J zy){_AG+D7!QOtXZ)A&Z}WP53PN$^!nQwF4`R`Z}VwlCkDw$82J<)ADXx8N2P>-2E^ z{jzM80xO-D)8n-V6~#{rte=;=Pn~GD6;U|r8s5>1teP9MscYBeer7V<*3MOpNm0o4 z#1-;%gHiH!djVfjhkm)bea;w3kc0Ef*BdS$>t=C_oSHeNJ={pmQ<%7V4b2NJ6Lp{) zU)G!!mEL}8aZEWV;FR56B}m_yp!@oTM;gFsD7aD8bjZcxAtp78_I$4i?`yWlEB4_6 zxwhnsY#V}Q$6@HZUe?q?S-w-`3NzXwEVfkJ-q`dv41BIh5(ejJ8Q`doUgD>VmMxIi zqclR7uI?;5z8H$iIZuaQ-6bcqqCz!u2D~zKh6OFXVrAy{^5C1{87pNlL6x!VS9=9Jh1c6{6Q>#~ayGG2QvwdXmbRWS-zk_T}9L+T`ktvRY5E`;jX6nvYCt?<-|gaDIYPjBeJ?@DDFj0 z&M<%=JrsaW1SW1qV?!zf4%R)3=88C+PzZXfCBqw10w@bAdI)q+@;$wo{QPFE0c!6m6>9g)-Gt6FYc(W_eY$5E?+1A3>f1-;05Gvr@ zY66k{6i;(b!9J^|`wlq$Ii5yV2miPG$gr~T?_Jlw5PmJPUULB`%Fh6&>q0ILx1d1K zz0QJze}*yq5Btbp)jdBZvHwYVvf<$Qc^|n|^yOgY$11L`M}Ifo{<4oWk}2NXRRKUx z&=E}l%D)~g!=;L0!VvnuD?Pu~JEbl?*YH9|1Kp5|)8NOBo zSE1L2ax$;Y0-4Y&zrh&3JpnXGd*(kNNC8jaNFK}oACUbYo&ckez%zU1cgXkccRl}* zB2dTqmQd9z0Rhf(MS8-a)4AXe%k90U)x>SG*QD`(^SLr>Q5dAxQ;NlJ!hF&IL7_4 zHw^Y|Dem;3CW20Sd)VZwC%}D;Sw*pgF@q;TT2e5kAV@NTdY8@7(1R*`)acs!LPr+^ zQc;linojQ;#G|Za)eM;)gboJYY_~9`KE7D$M<1d;_|}H}Q!HU9aGg#&h(#CC1P#G) z@DIk`W?hhf1nDvkt2gU@1r2ml7>v6W+#Tj)*3$KgK1P7`oqr(b4r3&i#w7^7gAehd zw%pFgTP~PWRqs-~SE5*5G~}iy)8AdSS~iZg%399!y{Gs(E18tp>RyK8efGQQ=z`5S zWa%f!$sDje>w!(c8=9+0AsfpTujWKyTYq>L+f znmuZRu7~iy!nyWR^tQR#fbWGv<6d!obGL5F9qKY8F=E`mbKhqvg5MzD-|FrgwELM_ z*M%k=fcm?}k3Q>%zG34zxfA=AP3#86Tkf|iv1w`}*Q;*$46Of8lEmo~P>4azmAsnA zfhIQRfvO5gDOvm)7hC&L6|xqAy6NE2f;~>>-g#X3`JBfx_$O}G16soo4_~$6VK*Kd zNyI{t8ez)4+D&nSoeA60PiF>^KbKxNp^I)A0;O=j(2t1>gPU2_sc_z5>4YL%tR6}S zP!7>tqr?x-cM6y?9B}b!X@syo*0`NwM2~2poZj*gK^jEPz=G$J#OJ>xiHF^2o*tKL zCi~6Rlv9l?Fv?NpI4#gqjPY=@WZ9yvy}bS3SwxFK_{L4~A2lWF_WFe(af82#&mX%w z&$(Hqa6@^?4!`Zkp2W&%Pgz?TxgB&utd$wmGUZy5i~T_YuwFt_DXK=+a1WdeR(XXU z&G?;PxmirY%_Z)9eyVj$co!{OrN4$gD8n(=vQl_1g_mR5@=pd41>Gg3ddDk%2W->A z_LJQghSj09pRb8-(x(Fp?z%7F#JvfvDHCQhO;G+-^$7e`^&n!`7bzzH!LR;*s?k0Y zvHtIdn15t4?_3dyW-&&B1lKqqlL<=O%)uv)?nj>R?#RmbN~pG6HSpo2ny zWcAf382IANCf0cRyhvG;+U`TVaoGHQ`(pbtZt^^EwMLvoS+-hDqS~ z$}W~+WT3XQsw=izIF|iU9(Z@mL0O4zfPh;`cVxFv&Bc9@t zF2$jGD*&jH+?plI$;OtEuIsXF{3Kj7Cnt+JIycv&@}y@nuXwyWH{WMScQv8vonmZZ zUB^^jk;f2LCqtAtKt92Vmk*KL8lFY&-ad@k2@Mb@luw9q#J-~_GS8SS^j=$z{zela ziZ8kYo@RHI=^X?oqLy7#f!eA3*e2g%|G`E*!7`RFy{9!*R^3*BELRh4h7ycAfV#dY zaVQ`P+DbVTfI$<$Ys^bCjaQmq!0PRK#r4zEI$o2L9@*QK-NC(G3<4qg%hyo2^*4+J z@;}G4R%i#67{FTD_XeFv3RZ>?uQD8SR4@(%GL+>dCPwpgzuYY*zP+x4W8ifLsN%YR z!62*PH;wiTgkf2EB3}OX;rr1WcipPkc})BqEe6|lHy_5n*ErUvcy9pgDi!iRwlezg z-~tU2`u<}*=~IZFn{fQ`J;I@^ zq=WwdJQGzp84QHSn3XOsh}t~*!qH8OVm3@C^V!xddx{o7)&)zUwxh$cMuG&-0afI^ zf7EC{D{N_I6ATF60!tDY8p+HHI(LWie549}rPU!dGXpWf@5RPFnfSnyFQd-1QZx9< z!!L&9V9Q?}snKR3+Szq~Bdy9~v?lWsa7+e*=j$swE`DNqil3tYs{e{i+YE-Yks}=q z_FWm_9dF-`KvfD1zOHyMy}b<^qujw#r`!)9!JjqSyRQre$VWOdui{H4h?|hzaAMPz zl8e$YPB&y^6c^!Mz8RuZgz{Ct~{`fb|u-R9LgkKfv(A%_+9c)-V4B!=!actsn)>q(PcEw*86$CJXMfI{=8oTd43-*T_Q!4 zPk|8M>MNsO81#HA&@hYc{iYxX%&?sUAsT~n&J|>4>VrUJ4)OmP{=}aUC@*@$CG5@E zWsZ_06`}*!D?zi7H?Ik+Do2Ix?a~AfS8c|%_;cJ$nhfkLcHJ! zH?FpwMtzAvj@m_Qd4y|`EdBLDcCr*E_foP7u6VYgJE8Wqse5x*Zy7zxGpe4Gqand(5v@b#1D(PTgrZ$JRL&=vri z$}*!ffgMa8pFp1?36J>UmJFQSdX~wF;?PhI1jZ3)MpO5}khyT4{Tat>^CYKc8zepU zCj+8-ofVytQno%I@L+5s1!fGkIC(N#inIcWdm->NtaO+`Moe_>k~`6!x@RBRj3f;4{QodX#$|5^) z!fpmTi26Fi40||hxsV(^m&GVvDwu)NBCxY|+H^H9n0w~~Cv^cj0J-}ouOC!gN4ZH}9InNXj%CZ=PK3w6c-Yoj%OJAk)^vO2H1?d>}en_^#W*Y%d5 zNSBKpv6sZwdN}nyI27@ADo^!Rk6V|SioDF-?GN3jULAmmF_-7ako8Rtv2zq$zhEH4 zb=n}qb?<`et$%m#`UVyHSwW^j^*=4p_~X6n(nR*dpJ0E;YS`c3(vOV>ON}h;ia$9U z{@O3)1r`5_=6!!l%hCYif7mZCPY1k3x{v>PxO9gE&FbZ|G-K&*dHnd6n)V-oM5F-G zyg!E4e|0vTQmfC0OBUbQsyU{4FB#=j!kBMR)}Py&J-;Vzi;002fditThYMFlY_n!n%)iMTsG6;$I47B1;m_x-tF&lKrrl z{;W;?(*EYm_R}1Oyp;!&HESQ{_9zZnsaftp1JN|Mm>KLPm!IhN}$V{=yy=Vn*3BQV=2vuhB8MpLK8^~ zMX2QZ2?cpkbTUQ3dMvL*aBC`LgPPpsb8M1M0<7YKcz3{gpn5CzC-LR7tki)JyS&)i z4)#?|FKt3hhFo?+^AaDLK+ZTP9KJ64Fp*~*`9q4&v@%->i~Z22+fe1J-q1uXr#;KW z9<2?mTrE`FB4yvK7au!bY&cv=w@vzd5IFL}1xuW`*#X_!P6fPKTda1~hOMOShNSf$ zwW+)DdoKU-R(>bGC*)$m>0){#eneB}&VO7?3z8rH5+?y&W6hZ{703aF9IXhZ=K==$qNk8JFnnd_pnUl9G8EU~hTaN~^5Ab@R;B_4yy zf(VWcj3a196D0>v18BkJvoIoPF&qmQu@r~FRz2H-#x|<14kB>rn!+Y3CwIqZvEX-y zQRut51tepNz_AEqLR&~hqJ5g4!bveBfC$Dj!dXpvSkOgy(|P*-Dm`k3v8M6zLX57B z|FxK#(Qz5ECh<8RB8^h7lgHimSk5%E>+m;wb{9)KD^dGh9E+jrjzY%sC!a{NlR*$& z)|AS%?6uhjzI>^;=}3>FAG(th+j6=S8rG@irN~5M?}W8-)14b2pL3<C-cQf#rrR6sX`7!@utDbEE}KQa%h>=Lw8jM zlHU4^3+e94V-YLUauu9abg!2Nt2|>^oT>o6@9(Rlvv7Z5h90712w6^efw{IJVRz|Q zK-6gg!rwW2WJNcAyi0>?!}{BozU0phzZ@N+y%`vIG5huF%ollDH_)^WGU=!5L+L6L z^?}+NpIPK46ZJaXoT`RC__|kxhEsw(>AOxkWr0bv1fT2PtZ@OXscpuAykD;x!+8#b z>F@Nk|0zt%7Vf5a3W$R9v1yyB%P}p;=)@ElyQR})&O)GPAhX(u=L%2}Uh>0F3!ZK;J^@7|GkIv`!doAuir zgBv$Ck#WJsgEx9QjmPLXwlBW+qZK!y66xFNV=(k?wxEk~7Pmm^#){i^H1#j)k(r2Z zb=cioyNF6@Yi)6r-c{crkVQ@?Qu;z`N*@D=m9VpKnpJAEhqdxygzu$>SR*+e;Zb|0 zut6LiYD)3?G<(TSM?Q5~e#dQSka%jjgRa=q$Yd`X(tTx0X+6=^GI()W_Y1bd@!+oHH1U=J1?8+UaqJ7Ekc*tP|C4SZ<>L+&OTMj{CPjp7 zh=E$tNo`@YPV_E65&T)mJuN`^gSRZ}Fd9X(gmFELE~I>tfY@M&;Z_6<*^ozTbW?la z%{DM)JAX%S`9(T2<)2){--XRR4!PLAOUk*e|a!87FWnNpWhTyukf0T1G6a9nkmj*v1 z{eI9bJ`G3r@AB{9U*3 zAGmj)NMULwmLqDX<5J=X&q+E$ilR&%cepeK(;r`Emw%|$bO=ha5F(-yq0#Or;A4Me zAtjWHOUgGd8@QUKsMGUn((k+g;YxGwX0k#6lR6XYus_JrQ#MLfbRuGOiF53c#GNjh zr1(hpm7E-K$_mWKg{&}%3HtY?ofw52CFIu}Hd0mo(M#9vF8@nCjV$qb4x6bb8j0^? zoHRYlc=SBX`3`~|eNT`i8^Nv;XP^P%8OXd;qWNDz9sGD^GbcAX&tcPKFECKM z7kO5qQ@RQ+!l%h|WR1q|8_Za`9@7{=s&BC>+&Up{oD$hyv`u_qPE&3EVRF*wZGInt zGklXY%JyVpBSP%K(m?YcDJZ91)+p$#zjawdenexYz(-{nY19L)tHT^2k0yz*R&d9V z*n#EDK4+r_ui*gRp+j{)LaPdbp!lgSdMU{RlKBuR+$pHPOn;Pdxa&6S^9W@m>fn4# z`VFrE-hfa=ioaUINny2WV<)dfZj@hbN!3(Le8JXkk(lInA)w!vl3r4qdIp^YaY)cx2 zQGrc8ybvJul6saN`R92!7Ju)S8%*yZQtakdwzIaN5l6m>P<`xp4DwM!YdEgVphwkn z_ft)qkz)`*pbtZ>O>Ka{@c|9$-gw*zN<0?Q*6N`c17GVX001+)X23KwUj-=TWVmH6 zl@8e?1!x#Mw2*eP~e8jrNwx(1YQFFR^pxw$_yW^SWGtVXf?nLv>Op0ZkE{65HV!rXoR;0HA3 zUm1@#&w&QSHm7LJ$0CFtY3(4?bLX#8ztekjiBmM@&EQMd7?yGh8BN#m`c#fb^PWW+l5eAsTGNtd4;UCIb)T5mkWwoP^zHy1^ z_weXwXlltWE#>g=zysr9`Dp^)$vKJuM#Fh-`=+kL5Ga0-dcLXfc{{y${~R~aqjhH4&R2SQZtdhTxGfnxbWeu! zom#M8EhBpgi?Z@-qUZEJqSww<mF^q|mi?AD+!=`&v!=Ua`6Rz}iCl(`z!8h~|IqY*U-C2JZOH^<&jXq&pw1q+# zH``7ZCdC!HRe?Y|p)eAted!}gXO=#Tnv-a!fDuOR?cmE)rm8rk4z?&by)X{?wBW5> z_-qZyMKq6ocdb1Q(DiKTX*NjNjlJh*84tzb@c6xSR+XHeUgv4Zqr%S2BZVOu=~N91 zzFS!Z4{xbOEhT!ew`EFmy*u8EBu${1PZ6@W3QxC!qz&)!YBl_n@#s_>FOA>Nw@}H` zo#@fNGY!tZ^N30Rg?~cLeGuDTLYhqSr?C7DyBxE54(Vvq33J^Ht5yMo(H;6p+#|ul z(5LyPEJ{;7y60Xx;g?hAUb=Ndn!K3y$LW~9S2BSLcT&zk}$`gunsaOpuxTzMzRfm+o{${@Zaku_T0oXqe2A+-ds3Rwt zqLRq29GRDC_&JY}!9X*G*5@y-{!Ms%(uVUHS^5YfwLp&azY-oT=Df+xStl$hZAzL+ z^-Q6I*ia{kn~x#WY;yp;6%i_$pbQEiz<^0T6ptI+2E!7qco6%@iwTB`CW=H%U;tD? zVSxfx3vhhB^kQ!zu)bj;1}5>8sg9%!R6T|u)*dxN&ng2L0y1+mkJB+rZUs^F!rWoD zd|S<#IBYVr&Da19NOPj|nS9QiyL3u;w6MW*qB|>nWXnK^yAYv%E6Tv~$`n+9 zAd4~xdD(LWGLU^a`IRT1R`T*Xup-FIhOKTZSAU4NDyXX*%`3_RP+2Rs5@P3;bS6dS zmlg}X94-UR5_DEL*?mG#M>T2WmydXeb}=OJ5h_#!KE&o$97UcYp#gTf3Y8%J`o(qT%Zgwa5<`PEq<0); z5Cge;!}x*)9HW%}8lC6ptn0TF_kSfkY8`h~7TCN%@|649ZzR8VJU3u}`G?&a{oS3o zdFLx{o-KsldL#1dZe0QA4Fu$JG&QZ}7rptkmM@J0cPr{{{IrVGwjs8eU)JBWo=s+p zOuw)cectK1+mGC>UoMCnjmU3a+xJuOZrJ}vd)Cc6wh^DVCTw3^-}@+{{WWO&$tk=e z83p5;Jxd0EgU>h-^z%qRy-kbGpd*T_+Tls{w*mVH<}0rkHTV?XA=k+!Qm=?tQ!4$Y zH`MAI^Yxo3u7RS1>W=cq_N;G_j278{5XBwnI!?#Pf89v`|L&lMtbxrl=sR2T|Fb#4 zV25cp1uP`KOlJr1<)TQU9S>`1CB+BO_MRX#r0eFuqqtaXwvV^Gu&G%gaG2er<7RAb z@Z2n&tf%|IYqD$Tn5J1zv8hqIlH8tLvTFtb9)%_eq4FJ00M#s7n?0wMo0>3acw-<5!CnJ4dvxG zmC7tb138gLvAdM3w@Wj|yZzAZnh50chv}8>D88i8!=!Pz@48s@HdrR7a;gIr1Jw>k zv%79FGcP>TNd%hTxpCXz7`n28$)Ajo;Sxm=)3nOHll>AbRdro*j3b=u>0Va>bXz$-P2l~jebtF;_FsLL&SM0LBV zw~JH`KOEm_IPMuOdhr@S&8rL~sxN59sEaH{@~3(=TLN%WyDFVbgD|LPhBYo~d$&A9?}e(*nlC&#k?x!zN2+es?<6!3R0{4a@|+NCkoo1hE}X^zOuW^ z_@L2oqG0It?uYpTVY!DdS3kZbMcdez^}1r}ROiRSJ@n3sXVvX}q>jze-{8l8Wu*B> zW%y6d!c#$NKF0Pxn2Y~D{$3*klW)0UjQXIGbTy$-hH9qU8v+Ora4e}}3Ds=`I!iVT zgf;I$IcJE*BqGH~u;r!0mV(961+)I~!^cB@_)(~=KaH(FDbasfinaU<4LhGgrT=qP z!3Z-RwZv)Z&E7jt45Zd^H3yv$S;forIA~>y?XOe;66;8n<#9nN+GwQow5uFh#rvwt z?mcq_dnmU~ox^FB)W5ylp4NaoC1hJ3$&QiAwwO+y94)4(VipmrTyLweU5!Rgq_1WO z+>dFvuZe8Gcj1TLl-y<2c;B0*^xVdt;9h`JQJF-bc-=wr_zR_zJ#GWmk2_f1X*bob zetGb5?H@k;eqs38*eW;3wS;8O$sOMGB-E~kcsEm+&HV~wMr(Nx6~JnB-yo3Jyv;bs zwh!?GklFL<=btMcH++pEPO*-E)H>W6s*~c(4Wi6_=fWtW@Tsgzn$fYr-FBKyz~XZ zv1>$I}fgoHA8b42oB+pEWS9-4lap(mW{CQ+{q~rC3K0UN; zweKEG)_WuTT8@7Qyc$JSaJY)saKV?p+&6f386U0Ac_^Um;vPL^c1hhjN0cOWNy}!Y z@Kn|N{=vPQI<^f`leY@K9DwhI?0=l4Vw4=4k5L;ux{_7Y2wOY;`gp^R|MClI1WL-e z>*Fhe920;{6+j6>-KLlPP_ZYeK!@+#fcXF*N%m9d^{vNeu8%{giv2lr?lk4h2Xew; z_uG}JZaMti?S*cc(ydM&j@}R|Dv(cyV;j**Fqh#ghOFX!`wvR=se_Kd3byBuSJWlj zz^iJ&m)=8$7TKN{sljq9Kh|$}vi%P{3#1b5JyU#M#XA+jOGpUw8C9jfSc(`WUk$;f zc;86596GM<0Hd!?o{99z$-QOid@!d>TS78?PEod2>CHvAS38`}-75d# z3@#>6&~R+H@#aMI#Bdc=9KJg@g3np>hR3aP>6KUreptijhRvzr7n{!FCkJ1nd`2HX zxzH5n4!q!&{GegKd=_c`jC`g2$imYP=J9!A$cu6v3c-z$AUARef-cONiD~(z_=x3H z1O28Gx{M#N-;aI=qv#ijfIi~%GkhBIH2Y~Nj@3xA8p#29oG1Cl(&GULF!qPYE+mU%IB3E?&Bjo^Hf9xH^k3X;&6ZiI6=a$A{d zkqHr;Z!DDIL$({4-t2iXMJ?I7hDV>s&jg&H;5 zQCvj+`0!cTPnZvx=B}L3<c|*{ zpbP*9PA^T3bh?Soq{yGR9JbPbQ1_D-NF}^QF2iW!<);KnCAtJ?XMI=ff29pUQeYv? zX+A`+H&2h-a3~w#r4a;zno!U=bWpXV_*n%7qZZ01a!JzT*$={~!MuJVoKiriEhFj( z28q@3i-expbTkJ}vT=|tW%c)6U43Q z=YjPChpk9gL}(AU07sWcwH~ml4JeThJe_msOf6Zxg!_tD{p?FA<^$hxmMyBwHXUnkEM%!up#PFe& zQ4Fg%8D%lZXhWLr_gQYfU}7vu}2x^|_YOeYMY?F33`Hd(cb=N^}ia zwb+BKcNSgjuo)6u?8TxyhoyJeLf&7j3#cdQBg8T0VDM|f<771mtL8z6wPkz?eY3Kp z!w`6{H(+G<-7LN~*2T(h6Vq|o^oDRr zy~WNHmX%lS_22&)UnhV>O#iG>11kP%{ky;(^w+rmm+^$Yjp6UVzMoa<>4ZOZT(U_g zsh;BN{@Z_jIJ>Be1E=GDB1!ImV){h9YG1A3)zN-dV!}LRQPDtSv(mT()?r40 zA$P)1;ndbxmYKgclbsbj)c>;QAIMlCF(Iy#f&EyO*5#ucf(0oP+Ij2ed;YA?Su>du zgouzgg}Zh&Gq132tue0<_`!w|9rcvr-uQV1Tc&|hVGxO`BiiC=q9DmHegQUd+-$+7 zohg=u$cvZAvS{TOw~gdiEA|G4N}ZcH?Ay9_#_NYVh`O(}MUJ?B}VG zk{6P>M;+j$&)*HY+yX`oqb}&`|1#W5QNGrkP=wB>!v}7h21}Ip0NeI|(4Z`zKB}w50O1(zG4S1Ux+9sC%aNbnm+&;2Y`pl7_&V}{n-4vF zVKEnZAN+G*rkkXh0Ew@I$fRJcYf2@Shsyt`N1tA(e*O0U^M&dZAW-Rzv^AI>8Z9V_ z(`nS6>(KzU^0w|W`rf2dbfscBYyWdOB)YPv+)^|Br*9uiGZR*%|H9|rU#MhJq2Ens z-%Q$9lk95w%NEOdaQF_DYaLZR%arqwE$y>QW5sN~+_AdztCQ7JmCR0JKjP(MnhCuF z>T47i`qN%|b2qr?t&EqYwHG!(A0+kG{axjr_jkDqZ6*JgW9jwxr~S6tU*M=qZ;=-& zzc4rS^9xn>5Wr>s!|c!HE)jNbElG?W=bS~1{1;QMjrc9(_)!EhkIx$ieeOe;Je{9% zdLQiA*MTf|$<@(&3|IA;4JDxyi3*oZWipD`lfWeK!dOQqj8G?KHjDm{IJ*GXlbp|p zqI%kG=4dM9y%2ZaZ`*Memiu1ra)4}bI30WCMBivFC0ktxSVD*uIFm*MP?GsN1}h3K z!@`)$Ep&}CBbPIgt%O!~QNg)avoarRTdCz`u6%EB7`Hmr_;Odz8$Xd6AEz^sI?~o8 z3ZD0b&>~4^#dZ}|p%7xIT{{}sqSYM_eCWniuEfS0iQR2Q1g`&&t&jJ)nJayNAdx*jj}Bo6r! zN(&l=g*2RALVUZR<4Iz1JJ7sdZWAbT=&{o)P`AhCFZidi7YQ``4iLCEz^i(v;_B6# z$bg65t;Dhkec!XN9J0#&TY7js0eEiGp1AYzn@L;v1pOf7$?BsrxchCLYMAH8g2Q*- z7y5ro57W2L9-V4@qDu%!Rnzj>x1VF%1wuXl_Fo!^E`l2jjyLMx2G_xBce(4=k@$(v zTdl_ipJAO0Z;yA-1UDb9_edk1XJtAsKJQO<7CzdZd7#$x(M(KoXx~$&1xyWM-SPW0 zAUzkf7U<@k{@uiQ_Diu3w9a3v#W^9nh@j!99=Cww6c=@Q$_P*UU8K!s1;K?~7 z50Z2m!(L%JJYyM`{Z`;tLkx_MM{1t^1cN9Pj1pLcD0nfkiIkMtWcUV%OG1u*d-NKZ zAK4)I$F6OdN0u0{{u?0#D<;pubMn#{K1HswGc!abWU_rK_AXa@XGjubWP9%rINzwB zA&Xdqxd&-D8I>o1>YL8dm5wHqFaJhY{$)A?Y2$hFb^U+MoryctecQ%o7=~;!$d+Y{ zC42TH+c37W45^4TM79V~BsJ5B$vU>82%!*>JxXKWi)hnEWXU?nmUw@bO5OL}b05!p z9PjbY|1j6@`d;UGeoigGboQw-5=pTzD1?Ed>8u2Wcm9g5^bXp`4bI%TB|Tgu)EouM zQpgK$mt-s5r`cexQfA}W=lwc~MXm7aR3GBfg={9g7uBBR{y7$fX=yu1r{h}jxm zev7T)j*70mQI+E9q+z2wsxDMl&u};4fRSl0_hfw&S}WVo)RYU{v#EGAzB&i!^?(KU*u|=4E#UCk-!1*P z>PI8v#gx)cpdt4cy&iGouDYd75S#l>yHis~hq*4RdSwBPj7tM{#0bZP=N!Vf7gDeM zrRwTe3+{@NeY62zc65xM+?9b?8dZ7`CovQH?P1DxE}3@b9zTx&zxUbPIhdFC!tvnQ z_oYNtRLnv;H(|30i;zntFAt8?P$G`+*=J* z=#~W}MC@uRbq>qH>(AJ<9SXFz9d<6NhjI^-YBGvff>7~XxYTw=4M0}muFtU$G2lga z=rGA33QiXFU}Wn;LRK6E&+g!JaibN$!ba(<^a`{X01%pUaGm@Y{M~ojca532)KGQQ zof7dixjlX$SyUcv5<886XRppSb>|{72N3AV2jVw?eSw!Q2*=HC6!vfNj>V3B%EVR|YQL_0&<AEA(Q=!&^ubHB4sQzI--4P%BRD%!nx;5u+Y@-D}zzhGd3~ zxSJ05N}k7WEQPWkhfk!#$;>)YRmwj^hXvC}RrVj#=;Y+&9i^JMKNW%B7Q;Qc_G~6@#p&osn+)Mm5xAkAcXSUqLsUeZ z!^A!~I=0P0RLPKaeDKFfi!jkAf0sFwDqhihdU z+&sr3rMAp6c8~-p@^9jISsfhz3k2|&bAV*T(K_m6$k-w&Fbv#g@Hk)BVTXyaDls|UR5^aInF<_;kXckj+huH1c~ zr!)i z=*8TOP@Sn+2~Zp))A%6}%;B8sOwA8OcZ)YfoL{=Rw3*0#A%e+J`_o9hPkltO+jP&k zB@WFU4Fg_v>HDg^x_iS_2E{Bdse0G<>oP6V#gWv3R!uFXGw1fmck=KGpBpm8)82O4-x=sT>?y)uQp@b8 zCy^aVFmcVs>DaEf%l#$5*XNjK>i2H0pCXR;InpHt?XdVf_UiOSU!gX!Sl zBD-~SumE}!4UKLGp-T68!BrM|_Myp22-_zufHO`(QI(oap=)&?VRV>QnIU8vZtQuB zN7UR>@@5JcL>;uW9aPh-BaI<2(~P9bwrw0Vsc*PFy_{?&-LcU(y>*tYMR$MBvWUT_ zwt!|^t`oIomMOnre)LP1`_dl#Wocws1yiXfVKvVW6Vhd&(iPD-TW%A*Ym0ij z=Yv7edUV&M;;kGkbpwO&SuS;DX{@+$<;>^ep(hpN9{u+!CmxoKf1NC8H90>~U8KHD zxwrH2+;rQd$NAZI)5og3e!Xd`bFcfsjiXQQK2qcLk_Gb65Hh7{$yJQ1>I+2nk_MRP ze0~MetBwCcPit#_1#QoPqr$Xlnu)^qtoyrgi!yL6Dw|t=*HjS)Q$y63A4Gu&LB1Jl6IUUK_+_Z*4 z=;!A6eY0B;j-C_G2!M>h%{&_7Zmt<#8SJCFJh#z2|dFH~}> zw|0_)(^$uEI@#10$-|}FJ3aL3sp{ExY5{MxE4@rtQ^IYm{U<#x6P`ZgQ-41bP39w+$nZBf7*CAL)hHgbPxuyCB1@!5Ai>gIZc z2o?KvaLbnM%l5KIL!uec`)ASU_qQk@!MFl_*rK7&;zN;jS;y>@D?X%O*(T0|j4nhE zS-_26WEzEee#yop+i(ADbC9`MAAdu;+tn!l*{TQ;0aeOQJRf6{!Jm1~Y8!jfgA24$ zCiiJ8yQQd@+{OaynY+gd{~$Ym?JA;Cm({sH%s-p@z@>x%ke%%m8+8^NInb{ntCxUnCgK2jtIC zB}!>ctdnhwshnvni9#J*>HFUNbydP*EJstW;$wF{!wXbaPs>tYa?X95{9^!0d*XGz zDC~Hz4SR5bvv_V0n`>Gr`V6@Zp&$I5ClM-PHy~sJQbw-*`dGV0=AJvc<{}1F<*Y1kEYQ4&W;#7|Oj6oO z!v>A6)kO0vkSI_8A?3csHV19il#1D>8j}6FaS5Hfs4i!yjkr7|Ts?3AB+uADTc{M_ zqb~;+0r5^*(K{VcOtC*Q>>O@I&xEF8hWMdHxa3T!7?G^5Lzl-pJ+4GT~^8v{oC*`IXT>bES`Pb$sdktI&)Z9CE# zj7mqx%JAm=<7)fwkCwdf^`qtSLJHQbPpvUR$2S_OnUoqW7%MhAF~40C2at!~ zDk6VG){lA(p9K1L{-D*n0c44<`mKUxe!msQ1FLX9y5&aI^4Eo#QGrA+p!Z}mi&fqw zRDgHtT@x%2mbcV_)wW060I=0pIS69lCx(G%`ac;H-@Vpf^Czj;^72nxUXM_v-Shs` z*24IoCfY;`q4nC?&7|xIzl;6VA0LVnC3ZJF|L$mMepWlx^to&;4FWc+wZ;>J(Q#&Y zf@y*zG6~Gu!V)AXmotG(6B@0I+Qw^epj>=YM zz{u880|t9Z7kJuhE!S7u z5-;|m_%F{*UcW^?wF!xM`+^ZKU3%q2N(A?7m|)iTXZqUFa+mV0d4PHfP-)(`ev@A4 z-PiBFmc`m=VJP=zf?iX885?$Vu|MH%^O?cji%siC%k@U;rID;j5iodzN>dpb)MZo$ z2o{jG_det0^Y1GrjAkYRCds>`m#4}&Pt8)A8tuMG=m1d7L&!tPVN1oW1X)) zug$=sFC5m}xrFeNx@XaP9 zMB+k0XkKkCLW8cR*X61I>#z1~5jz{?Wb(r)Z}@mB4H}dNWy0Np1UrN=Asc-={e14x z6&uLIA4%Eu4~74=omHY+Ue-H6@<0?+^v~lbj7$7b(?68JAa~dNA9(orAKQ&<^!d^k019l`c6E#)iwOXJl^B49GyNiv{&vn=BW&1*sU6XrSxrH z3I80_H$%->M6K6-{j^6CSnjP3jP-w`5#z*BY3pP0B9xHcORjuP2>l9r_C7)z%~0>Y zaBK-83UWRw=IxI+MEjpYF8GT2WTyZ=d(U<}5-+d+?C@9(TaKgLh# z$RIF&T(-Lad#V$VH_0A4Td@7w&`n(Myu;d_+LLmgW_MQF26S0ZVm;Nfb|vhwk5?H% zptrHZX3^Wk{SYK5XT~|a<8|f|@^Hgu9m_Ag2bW?V|OcTX;}gyo?m3CQJhU^X`@1!;#_6zlY%fhF2(^J$OmSn3EB}? z0{#IN{e4uWmNX8}Adbb2)5F!K$j~NNU;?uBe(iz)20dyjs$@?ZD2Q-Gc~;Hd z#b$~*@q*MePy)m4{kKujtyZCSN<-jwfA28#{6XtyN+x2nK1P~+&pJiSrT+-F8IOK0 zT{C{hL9t04&`b_El!XQ~u0Aho=N<&c4{#;?IexxtCYnrdgM$HoM@;M04e3gF>N!aCt2t1{2<{T;QD=x={79p7 znKt@zA~EN`#`itERW65Zhy*4TV*=HuR%He3#-fy(xKvJ*FLo(aS4mn=8)YaS()Z6h zJx6|Z&8ut0#d?0?16fj!!uQb6@C|kJjxla1+Q1{&L1^NWTn<{NgTW(nL|5d1QV+tO!6Dd{?*jD{-R#b zA1=YJ?g_MtPKrEqJt2cNZBZx@Z}&Ot_ElEJ9o|X7+g>K$E_E2h++0(4xolSrI&unr zS9kA9X4F(zl5W&rhqxBnST#tQv}$~fE_x=gs#y1#lgdaI#gdA9q`xqvTuM@vdI?EJ5!nFHdQLXZoe9zb&_#UR?dw`r%z2hzuHxz|lNR0gVTfAumqh zPq?L0_d!v24LvWd)V`sSYpU8NpNID()*)#-t59`z@K9_Dz1e~W%L-$V9}yz-3L2t9 zM!~%hAZB_@EeHQpV0eNccox{7=IT*!v?7vUUPTMBO^!Hr7s5Y9(oxC62aTV$(5s5+10A$)A0r2nNoIFf@WWD>KPkI5q_^IS^wkrT0-VON}K9OY@6z5dh6_W!cCujq#u0wh}gW$bc&5XSED8|#e5`$oRV*V$wdCJU`j@gUAqD1%)J zQu+KUUjd8TpQ3D8z>BeG&X#c2A3^dFGNbD|!C^amgPG@616h~lOu01?dDR(tVmR5r zIv8Sh=i{0f(jWfUm2H58UK@n6h6x8k4U`uJuCU3C3~VG?%J!%O~>;*%#P+JJMND7mSwFZxG$PJ^#rMclWCk z0h#PQXGX`%0E?SPQhVeZGte+cajwpAjHL$}Y?%r#9L#~ZKU$E_6viAL_{#cd<-PBz z-+MA(`s4ZJVk0z##0c z)#CTVP}9PR;~0q4lY&wd=Sk^#ZJF-Xz%s2}Mi>Hv-ClPEZE;Tn(mRMhteQrN7?{rx z%2MZt;>akNcu&=NwBu9CYP&y*P8O&E2)Md}hXyR+$PkSz!P;Rc&_+A15X3|^p%6Zg zV-Tl<%a8xT;+Dc)#_5&6$yWMPl7}`6<|WILGu52THNUE zGfLZbxT%H%U@QH?F%_hICU0;|XVaut^%@~mTpPW8(L@MR1`u|Iwb=F?t`j>#As%>Z zy*=N#UaG}C%qHj-XFY9$tc+Lq0m*dkSfXCGAvVI^2g&f* zqj1zaMze_efD#=TUWerBY($A&g7a_*Z;$1oNApL+!;LbDmJT4N=)gmNe5A*6B;8bsJF+$2Q``6j?(c?mN(U+ng=AuOwvgp(v%3n3g72@Tu zZZndPO@xR!tXah!OuQrap+&m8iN@|45jRfH-tHpP>w76jB)KW>?CNmQ^OcE6w)463 fthZU$|MS!)6Pg)dLeHdtn6k8>616xGXz%|3HW^s3 literal 0 HcmV?d00001 From df355ce7349d84f405ad758dd701e947eefe51e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Oct 2022 14:38:44 +0800 Subject: [PATCH 1090/2039] Update 204-count-primes.js --- 204-count-primes.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/204-count-primes.js b/204-count-primes.js index f0ae3e2d..e1a61978 100755 --- a/204-count-primes.js +++ b/204-count-primes.js @@ -1,3 +1,26 @@ +/** + * @param {number} n + * @return {number} + */ +const countPrimes = function (n) { + const memo = Array(n).fill(false) + let res = 0 + for (let i = 2; i < n; i++) { + if (memo[i] === false) { + res++ + for (let j = 2; i * j < n; j++) { + memo[i * j] = true + } + } + } + + return res +} + + +// another + + /** * @param {number} n * @return {number} From c8a372b7dff763da2cec9cb23d9915bdd001c708 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Oct 2022 10:41:04 +0800 Subject: [PATCH 1091/2039] Update 2183-count-array-pairs-divisible-by-k.js --- 2183-count-array-pairs-divisible-by-k.js | 31 ++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2183-count-array-pairs-divisible-by-k.js b/2183-count-array-pairs-divisible-by-k.js index d7ff02ab..268ad344 100644 --- a/2183-count-array-pairs-divisible-by-k.js +++ b/2183-count-array-pairs-divisible-by-k.js @@ -1,3 +1,34 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countPairs = function (nums, k) { + const map = new Map() + + let res = 0 + for(const e of nums) { + const tmp = gcd(e, k) + + for(const [key, v] of map) { + if(tmp * key % k === 0) { + res += v + } + } + if(map.get(tmp) == null) map.set(tmp, 0) + map.set(tmp, map.get(tmp) + 1) + } + + return res + + function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) + } +} + +// another + + /** * @param {number[]} nums * @param {number} k From 5ac507cbf685cf6c251b1d30bfef46baebff4ac3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Oct 2022 15:41:22 +0800 Subject: [PATCH 1092/2039] Create 1574-shortest-subarray-to-be-removed-to-make-array-sorted.js --- ...rray-to-be-removed-to-make-array-sorted.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 1574-shortest-subarray-to-be-removed-to-make-array-sorted.js diff --git a/1574-shortest-subarray-to-be-removed-to-make-array-sorted.js b/1574-shortest-subarray-to-be-removed-to-make-array-sorted.js new file mode 100644 index 00000000..7b4c43ef --- /dev/null +++ b/1574-shortest-subarray-to-be-removed-to-make-array-sorted.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const findLengthOfShortestSubarray = function (arr) { + const n = arr.length + let left = 0 + for(let i = 0; i < n - 1; i++) { + if(arr[i] > arr[i+ 1]) { + break + } + left = i + 1 + } + + let right = n - 1 + for(let i = n - 1; i > 0; i--) { + if(arr[i] < arr[i - 1]) { + break + } + right = i - 1 + } + // console.log(left, right) + if(left === n - 1) return 0 + + let res = Math.min(n - 1 - left, right) + let l = 0, r = right + while(l <= left && r < n) { + if(arr[l] <= arr[r]) { + res = Math.min(res, r - 1 - l) + l++ + } else { + r++ + } + } + + return res +} From 2c3836f9f8b6a2c27b9be29a80ebaa79823aa391 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 10:44:06 +0800 Subject: [PATCH 1093/2039] Update 2344-minimum-deletions-to-make-array-divisible.js --- ...nimum-deletions-to-make-array-divisible.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2344-minimum-deletions-to-make-array-divisible.js b/2344-minimum-deletions-to-make-array-divisible.js index 466d2bd8..cf3025b7 100644 --- a/2344-minimum-deletions-to-make-array-divisible.js +++ b/2344-minimum-deletions-to-make-array-divisible.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number[]} numsDivide + * @return {number} + */ +const minOperations = function (nums, numsDivide) { + nums.sort((a, b) => a - b) + let gcdVal = numsDivide[0] + + for(let i = 1, n = numsDivide.length; i < n; i++) { + gcdVal = gcd(gcdVal, numsDivide[i]) + } + + for(let i = 0, n = nums.length; i < n && nums[i] <= gcdVal; i++) { + if(gcdVal % nums[i] === 0) return i + } + + return -1 + + + function gcd(a,b) { + return b === 0 ? a : gcd(b, a % b) + } +} + +// another + /** * @param {number[]} nums * @param {number[]} numsDivide From 076df96a8a1cccac34d809b846dbe77c459797e8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 13:25:23 +0800 Subject: [PATCH 1094/2039] Create 2246-determine-if-two-events-have-conflict.js --- 2246-determine-if-two-events-have-conflict.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2246-determine-if-two-events-have-conflict.js diff --git a/2246-determine-if-two-events-have-conflict.js b/2246-determine-if-two-events-have-conflict.js new file mode 100644 index 00000000..d139a672 --- /dev/null +++ b/2246-determine-if-two-events-have-conflict.js @@ -0,0 +1,38 @@ +/** + * @param {string[]} event1 + * @param {string[]} event2 + * @return {boolean} + */ +var haveConflict = function(event1, event2) { + const fn = arr => arr.map(e => e.split(':').map(e => +e).reduce((ac,e,i) => i === 0 ? ac + 60 * e : ac + e, 0)) + const arr1 = fn(event1) + const arr2 = fn(event2) + const hash = {} + + if(hash[arr1[0]] == null) hash[arr1[0]] = 0 + hash[arr1[0]]++ + + if(hash[arr1[1] + 1] == null) hash[arr1[1] + 1] = 0 + hash[arr1[1] + 1]-- + + if(hash[arr2[0]] == null) hash[arr2[0]] = 0 + hash[arr2[0]]++ + + if(hash[arr2[1] + 1] == null) hash[arr2[1] + 1] = 0 + hash[arr2[1] + 1]-- + + const keys = Object.keys(hash).map(e => +e) + keys.sort((a, b) => a - b) + + let num = 0 + for(let i = 0; i < keys.length; i++) { + num += hash[keys[i]] + if(num > 1) return true + } + + // const arr = [].concat(arr1, arr2) + // arr.sort((a, b) => a - b) + // if(arr2[1] >= arr1[0] && arr2[0] <= arr1[1]) return true + // if(arr2[1] >= arr1[1] && arr2[0] <= arr1[1]) return true + return false +}; From 98cd5dd70b7235f0d1e75a5ec1eed8ac01b80c68 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 13:55:57 +0800 Subject: [PATCH 1095/2039] Create 2247-number-of-subarrays-with-gcd-equal-to-k.js --- ...number-of-subarrays-with-gcd-equal-to-k.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2247-number-of-subarrays-with-gcd-equal-to-k.js diff --git a/2247-number-of-subarrays-with-gcd-equal-to-k.js b/2247-number-of-subarrays-with-gcd-equal-to-k.js new file mode 100644 index 00000000..7611c8ec --- /dev/null +++ b/2247-number-of-subarrays-with-gcd-equal-to-k.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const subarrayGCD = function (nums, k) { + let res = 0 + const n = nums.length + for (let i = 0; i < n; i++) { + let cur = nums[i] + for (let j = i; j < n; j++) { + if (nums[j] % k !== 0) break + cur = gcd(cur, nums[j]) + if (cur === k) res++ + } + } + + return res + + function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) + } +} From acf792a4f7dbfb621a746163bad2fc9aec69e5b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 14:05:00 +0800 Subject: [PATCH 1096/2039] Rename 2247-number-of-subarrays-with-gcd-equal-to-k.js to 2447-number-of-subarrays-with-gcd-equal-to-k.js --- ...ual-to-k.js => 2447-number-of-subarrays-with-gcd-equal-to-k.js | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename 2247-number-of-subarrays-with-gcd-equal-to-k.js => 2447-number-of-subarrays-with-gcd-equal-to-k.js (100%) diff --git a/2247-number-of-subarrays-with-gcd-equal-to-k.js b/2447-number-of-subarrays-with-gcd-equal-to-k.js similarity index 100% rename from 2247-number-of-subarrays-with-gcd-equal-to-k.js rename to 2447-number-of-subarrays-with-gcd-equal-to-k.js From c64f9cd2f066be9f4b4bfc5c6965d1a64aac6885 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 15:01:51 +0800 Subject: [PATCH 1097/2039] Create 2448-minimum-cost-to-make-array-equal.js --- 2448-minimum-cost-to-make-array-equal.js | 33 ++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2448-minimum-cost-to-make-array-equal.js diff --git a/2448-minimum-cost-to-make-array-equal.js b/2448-minimum-cost-to-make-array-equal.js new file mode 100644 index 00000000..55371cd2 --- /dev/null +++ b/2448-minimum-cost-to-make-array-equal.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums + * @param {number[]} cost + * @return {number} + */ +const minCost = function (nums, cost) { + const n = nums.length + let l = Math.min(...nums) + let r = Math.max(...nums) + + let res = calc(l) + while(l < r) { + const mid = Math.floor((l + r) / 2) + const v1 = calc(mid) + const v2 = calc(mid + 1) + res = Math.min(res, v1, v2) + if(v1 < v2) { + r = mid + } else { + l = mid + 1 + } + } + + return res + + function calc(v) { + let res = 0 + for (let i = 0; i < n; i++) { + res += Math.abs(nums[i] - v) * cost[i] + } + return res + } +} From 4266524616b2bb5cfa91bbd36d8014de76c64555 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 15:10:41 +0800 Subject: [PATCH 1098/2039] Update 2448-minimum-cost-to-make-array-equal.js --- 2448-minimum-cost-to-make-array-equal.js | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/2448-minimum-cost-to-make-array-equal.js b/2448-minimum-cost-to-make-array-equal.js index 55371cd2..ea777961 100644 --- a/2448-minimum-cost-to-make-array-equal.js +++ b/2448-minimum-cost-to-make-array-equal.js @@ -8,12 +8,10 @@ const minCost = function (nums, cost) { let l = Math.min(...nums) let r = Math.max(...nums) - let res = calc(l) while(l < r) { const mid = Math.floor((l + r) / 2) const v1 = calc(mid) const v2 = calc(mid + 1) - res = Math.min(res, v1, v2) if(v1 < v2) { r = mid } else { @@ -21,7 +19,7 @@ const minCost = function (nums, cost) { } } - return res + return calc(l) function calc(v) { let res = 0 From 058c3f623f4566e9e49d77bbc2d88e46d7f5764d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Oct 2022 15:58:43 +0800 Subject: [PATCH 1099/2039] Create 2449-minimum-number-of-operations-to-make-arrays-similar.js --- ...er-of-operations-to-make-arrays-similar.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2449-minimum-number-of-operations-to-make-arrays-similar.js diff --git a/2449-minimum-number-of-operations-to-make-arrays-similar.js b/2449-minimum-number-of-operations-to-make-arrays-similar.js new file mode 100644 index 00000000..18b5b93f --- /dev/null +++ b/2449-minimum-number-of-operations-to-make-arrays-similar.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} nums + * @param {number[]} target + * @return {number} + */ +const makeSimilar = function (nums, target) { + const odd = [], even = [] + const todd = [], teven = [] + for(const e of nums) { + if(e % 2 === 0) even.push(e) + else odd.push(e) + } + for(const e of target) { + if(e % 2 === 0) teven.push(e) + else todd.push(e) + } + const sfn = (a, b) => a - b + odd.sort(sfn) + todd.sort(sfn) + even.sort(sfn) + teven.sort(sfn) + let res = 0 + for(let i = 0, n = odd.length; i < n; i++) { + res += Math.abs(odd[i] - todd[i]) / 2 + } + for(let i = 0, n = even.length; i < n; i++) { + res += Math.abs(even[i] - teven[i]) / 2 + } + return res / 2 +} From 6fb1bbca8138143f6c0a2487b0693a247f485ba7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 28 Oct 2022 10:05:59 +0800 Subject: [PATCH 1100/2039] Update 296-best-meeting-point.js --- 296-best-meeting-point.js | 42 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/296-best-meeting-point.js b/296-best-meeting-point.js index a4cdcdd0..deceaa09 100644 --- a/296-best-meeting-point.js +++ b/296-best-meeting-point.js @@ -53,3 +53,45 @@ function min(arr) { } return sum } + +// another + +/** + * @param {number[][]} grid + * @return {number} + */ +const minTotalDistance = function (grid) { + const homeArr = [] + const horiArr = [], vertArr = [] + const m = grid.length, + n = grid[0].length + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + if (grid[i][j] === 1) { + homeArr.push([i, j]) + vertArr.push(i) + horiArr.push(j) + } + } + } + + vertArr.sort((a, b) => a - b) + horiArr.sort((a, b) => a - b) + + let y = vertArr[~~(vertArr.length/2)] + let x = horiArr[~~(horiArr.length/2)] + + const center = [y, x] + + let res = 0 + for(const point of homeArr) { + res += dis(center, point) + } + + return res + + function dis(a, b) { + return Math.abs(a[0] - b[0]) + Math.abs(a[1] - b[1]) + } + +} From 1443a2dd100e82a93beb76559d33c293df6c2b98 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 31 Oct 2022 16:58:52 +0800 Subject: [PATCH 1101/2039] Update 2033-minimum-operations-to-make-a-uni-value-grid.js --- ...mum-operations-to-make-a-uni-value-grid.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2033-minimum-operations-to-make-a-uni-value-grid.js b/2033-minimum-operations-to-make-a-uni-value-grid.js index 4f4698c3..edb3acc4 100644 --- a/2033-minimum-operations-to-make-a-uni-value-grid.js +++ b/2033-minimum-operations-to-make-a-uni-value-grid.js @@ -1,3 +1,31 @@ +/** + * @param {number[][]} grid + * @param {number} x + * @return {number} + */ +const minOperations = function (grid, x) { + const arr = [], + m = grid.length, + n = grid[0].length + const len = m * n + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + arr.push(grid[i][j]) + } + } + arr.sort((a, b) => a - b) + const mid = arr[~~(len / 2)], { abs } = Math + let res = 0 + for(const e of arr) { + if(abs(mid - e) % x !== 0) return -1 + res += abs(mid - e) / x + } + + return res +} + +// another + /** * @param {number[][]} grid * @param {number} x From b396a10786a0d97d396f42773adc0e696144874a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 31 Oct 2022 21:00:25 +0800 Subject: [PATCH 1102/2039] Create 978-longest-turbulent-subarray.js --- 978-longest-turbulent-subarray.js | 37 +++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 978-longest-turbulent-subarray.js diff --git a/978-longest-turbulent-subarray.js b/978-longest-turbulent-subarray.js new file mode 100644 index 00000000..c44dc883 --- /dev/null +++ b/978-longest-turbulent-subarray.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const maxTurbulenceSize = function(arr) { + const n = arr.length + + return Math.max(helper(), helper1()) + // < > < + function helper() { + const cnt = Array(n).fill(1) + + for(let i = 0; i < n - 1; i++) { + if(i % 2 === 1 && arr[i] > arr[i + 1]) { + cnt[i + 1] = cnt[i] + 1 + } else if(i % 2 === 0 && arr[i] < arr[i + 1]) { + cnt[i + 1] = cnt[i] + 1 + } + } + + return Math.max(...cnt) + } + + function helper1() { + const cnt = Array(n).fill(1) + + for(let i = 0; i < n - 1; i++) { + if(i % 2 === 1 && arr[i] < arr[i + 1] ) { + cnt[i + 1] = cnt[i] + 1 + } else if(i % 2 === 0 && arr[i] > arr[i + 1] ) { + cnt[i + 1] = cnt[i] + 1 + } + } + + return Math.max(...cnt) + } +}; From 67c15beec0a51679723b68a4a35b931303d813f8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Nov 2022 17:05:25 +0800 Subject: [PATCH 1103/2039] Update 1703-maximum-binary-string-after-change.js --- 1703-maximum-binary-string-after-change.js | 36 ++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/1703-maximum-binary-string-after-change.js b/1703-maximum-binary-string-after-change.js index 2f587761..903e97d4 100644 --- a/1703-maximum-binary-string-after-change.js +++ b/1703-maximum-binary-string-after-change.js @@ -1,3 +1,39 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minMoves = function (nums, k) { + const pos = [], + pre = [] + const n = nums.length, + { min, floor: fl } = Math + for (let i = 0; i < n; i++) { + if (nums[i] === 1) pos.push(i) + } + let res = Infinity + + pre.push(0) + for (let i = 0, len = pos.length; i < len; i++) { + pre.push(pre[i] + pos[i]) + } + + for (let i = fl(k / 2), limit = pos.length - fl((k - 1) / 2); i Date: Tue, 1 Nov 2022 20:54:10 +0800 Subject: [PATCH 1104/2039] Create 2214-minimum-health-to-beat-game.js --- 2214-minimum-health-to-beat-game.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 2214-minimum-health-to-beat-game.js diff --git a/2214-minimum-health-to-beat-game.js b/2214-minimum-health-to-beat-game.js new file mode 100644 index 00000000..21c1d29e --- /dev/null +++ b/2214-minimum-health-to-beat-game.js @@ -0,0 +1,10 @@ +/** + * @param {number[]} damage + * @param {number} armor + * @return {number} + */ +const minimumHealth = function(damage, armor) { + const l = Math.max(...damage) + const sum = damage.reduce((ac, e) => ac + e, 0) + return sum - (armor >= l ? l : armor) + 1 +}; From bcd06973a23c8cf8735845c83b8dbce3907087a4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 2 Nov 2022 19:54:49 +0800 Subject: [PATCH 1105/2039] Create 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js --- ...s-of-a-node-in-a-directed-acyclic-graph.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js diff --git a/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js b/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js new file mode 100644 index 00000000..1c9f83e7 --- /dev/null +++ b/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js @@ -0,0 +1,32 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[][]} + */ +const getAncestors = function(n, edges) { + const res = Array.from({ length: n }, () => new Set()) + const inDegree = Array(n).fill(0) + const graph = {} + + for(const [u, v] of edges) { + if(graph[v] == null) graph[v] = [] + graph[v].push(u) + inDegree[v]++ + } + + const visited = Array(n).fill(false) + for (let i = 0; i < n; i++) { + if (!visited[i]) dfs(i); + } + + return res.map(set => Array.from(set).sort((a, b) => a - b)) + + function dfs(i) { + visited[i] = true + for(const p of (graph[i] || [])) { + if(visited[p] === false) dfs(p) + res[i].add(p) + for(const e of res[p]) res[i].add(e) + } + } +}; From 16a0f71c37ac6a876dc4c62c29468fc494b4b2d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 2 Nov 2022 21:06:29 +0800 Subject: [PATCH 1106/2039] Update 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js --- ...s-of-a-node-in-a-directed-acyclic-graph.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js b/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js index 1c9f83e7..4ae95f82 100644 --- a/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js +++ b/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.js @@ -1,3 +1,35 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[][]} + */ +const getAncestors = function(n, edges) { + const res = Array.from({ length: n }, () => []) + const graph = {} + + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = [] + graph[u].push(v) + } + + for(let i = 0; i < n; i++) { + dfs(i, i) + } + + return res + + function dfs(p, cur) { + for(const nxt of (graph[cur] || [])) { + if(res[nxt].length === 0 || res[nxt][res[nxt].length - 1] !== p) { + res[nxt].push(p) + dfs(p, nxt) + } + } + } +}; + +// another + /** * @param {number} n * @param {number[][]} edges From 4e2b529944c1b6b1f613b49e94b6001036725200 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 3 Nov 2022 20:14:02 +0800 Subject: [PATCH 1107/2039] Update 315-count-of-smaller-numbers-after-self.js --- 315-count-of-smaller-numbers-after-self.js | 57 ++++++++++++++++++++++ 1 file changed, 57 insertions(+) diff --git a/315-count-of-smaller-numbers-after-self.js b/315-count-of-smaller-numbers-after-self.js index 16df5aa7..8bda9213 100644 --- a/315-count-of-smaller-numbers-after-self.js +++ b/315-count-of-smaller-numbers-after-self.js @@ -78,3 +78,60 @@ function insert(num, node, ans, i, preSum) { } return node } + +// another + +/** + * @param {number[]} nums + * @return {number[]} + */ +const countSmaller = function(nums) { + + const arr = [] + const n = nums.length + for(let i = 0; i < n; i++) { + arr.push([nums[i], i]) + } + + const res = Array(n).fill(0) + cntSmaller(arr, 0, n - 1, res) + + return res + + function cntSmaller(arr, l, r, res) { + if(l >= r) return + + const mid = ~~((l + r) / 2) + cntSmaller(arr, l, mid, res) + cntSmaller(arr, mid + 1, r, res) + let leftPos = l, rightPos = mid + 1, cnt = 0 + const merged = [] + while(leftPos < mid + 1 && rightPos <= r) { + if(arr[leftPos][0] > arr[rightPos][0]) { + cnt++ + merged.push(arr[rightPos]) + rightPos++ + } else { + res[arr[leftPos][1]] += cnt + merged.push(arr[leftPos]) + leftPos++ + } + } + + while(leftPos < mid + 1) { + res[arr[leftPos][1]] += cnt + merged.push(arr[leftPos]) + leftPos++ + } + + while(rightPos <= r) { + merged.push(arr[rightPos]) + rightPos++ + } + + for(let i = l; i <= r; i++) { + arr[i] = merged[i - l] + } + + } +}; From 6825859fb2d689691ecb6282f4b4d7781bc94f83 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 5 Nov 2022 15:41:02 +0800 Subject: [PATCH 1108/2039] Update 493-reverse-pairs.js --- 493-reverse-pairs.js | 49 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/493-reverse-pairs.js b/493-reverse-pairs.js index bb76e4c8..1ad26aa2 100644 --- a/493-reverse-pairs.js +++ b/493-reverse-pairs.js @@ -1,3 +1,52 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const reversePairs = function(nums) { + return mergeSort(nums, [], 0, nums.length-1); +}; + +function mergeSort(arr, temp, left, right){ + let mid = Math.floor((left+right)/2), count = 0; + if(left2*a[j])){ + j++; + } + count+= (j-(mid)); + } + i=left; + j=mid; + while(i<=(mid-1) && j<=right){ + if (a[i]>(a[j])) { + temp[k++] = a[j++]; + } else { + temp[k++] = a[i++]; + } + } + while(i<=(mid-1)){ + temp[k++] = a[i++]; + } + while(j<=right){ + temp[k++] = a[j++]; + } + for(let x=left; x<=right; x++){ + a[x] = temp[x]; + } + return count; +} + +// another + /** * @param {number[]} nums * @return {number} From 9df567c3076970206779fdebad3fa0bc45f2406b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Nov 2022 12:40:09 +0800 Subject: [PATCH 1109/2039] Create 2463-minimum-total-distance-traveled.js --- 2463-minimum-total-distance-traveled.js | 26 +++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2463-minimum-total-distance-traveled.js diff --git a/2463-minimum-total-distance-traveled.js b/2463-minimum-total-distance-traveled.js new file mode 100644 index 00000000..5eadfe65 --- /dev/null +++ b/2463-minimum-total-distance-traveled.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} robot + * @param {number[][]} factory + * @return {number} + */ +const minimumTotalDistance = function(robot, factory) { + robot.sort((a, b) => a - b) + factory.sort((a, b) => a[0] - b[0]) + const facs = [] + for(const f of factory) { + for(let i = 0; i < f[1]; i++) facs.push(f[0]) + } + const n = facs.length + let dp = Array(n + 1).fill(0) + for(let i = 0; i < robot.length; i++) { + const nxt = Array(n + 1).fill(Infinity) + for(let j = 0; j < n; j++) { + nxt[j + 1] = Math.min(nxt[j], dp[j] + Math.abs(robot[i] - facs[j])) + } + dp = nxt + } + + + return dp[n] +}; + From b2ef4af649feccc6a23d2bcd50b124b8af80bd73 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Nov 2022 12:40:53 +0800 Subject: [PATCH 1110/2039] Create 2462-total-cost-to-hire-k-workers.js --- 2462-total-cost-to-hire-k-workers.js | 138 +++++++++++++++++++++++++++ 1 file changed, 138 insertions(+) create mode 100644 2462-total-cost-to-hire-k-workers.js diff --git a/2462-total-cost-to-hire-k-workers.js b/2462-total-cost-to-hire-k-workers.js new file mode 100644 index 00000000..017f4c3e --- /dev/null +++ b/2462-total-cost-to-hire-k-workers.js @@ -0,0 +1,138 @@ +/** + * @param {number[]} costs + * @param {number} k + * @param {number} candidates + * @return {number} + */ +const totalCost = function(costs, k, candidates) { + const fn = (a, b) => a[0] === b[0] ? a[1] < b[1] : a[0] < b[0] + const n = costs.length + let l = 0, r = n - 1 + const first = new PriorityQueue(fn) + const last = new PriorityQueue(fn) + + for(let i = 0; i < Math.min(candidates, n); i++) { + first.push([costs[i], i]) + l = i + } + + for(let i = n - 1; i > Math.max(0, candidates - 1, n - 1 - candidates); i--) { + last.push([costs[i], i]) + r = i + } + + // console.log(first, last) + + let res = 0 + let num = k + while(num) { + const ft = first.peek() + const lt = last.peek() + + if(ft && lt) { + if(ft[0] < lt[0]) { + first.pop() + res += ft[0] + if(r - l > 1) { + l++ + first.push([costs[l], l]) + } + } else if(ft[0] > lt[0]) { + last.pop() + res += lt[0] + if(r - l > 1) { + r-- + last.push([costs[r], r]) + } + } else { + first.pop() + res += ft[0] + if(r - l > 1) { + l++ + first.push([costs[l], l]) + } + } + } else if(ft) { + first.pop() + res += ft[0] + } else if(lt) { + last.pop() + res += lt[0] + } + // console.log(res) + num-- + } + + + return res + +}; + + +class PriorityQueue { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From c6cff3d26376ee8ea492b841e0e2696a776e6fce Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Nov 2022 12:41:17 +0800 Subject: [PATCH 1111/2039] Create 2461-maximum-sum-of-distinct-subarrays-with-length-k.js --- ...sum-of-distinct-subarrays-with-length-k.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2461-maximum-sum-of-distinct-subarrays-with-length-k.js diff --git a/2461-maximum-sum-of-distinct-subarrays-with-length-k.js b/2461-maximum-sum-of-distinct-subarrays-with-length-k.js new file mode 100644 index 00000000..f2d9bb8e --- /dev/null +++ b/2461-maximum-sum-of-distinct-subarrays-with-length-k.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumSubarraySum = function(nums, k) { + let res = 0 + const n = nums.length + + const preSum = Array(n).fill(0) + preSum[0] = nums[0] + for(let i = 1; i < n; i++) { + preSum[i] = preSum[i - 1] + nums[i] + } + + const set = new Set() + + const lastHash = {} + + for(let i = 0; i < n; i++) { + const cur = nums[i] + lastHash[cur] = i + if(i < k - 1) set.add(cur) + else if(i === k - 1) { + set.add(cur) + if(set.size === k) { + res = preSum[i] + } + } else { + if(lastHash[nums[i - k]] == i - k) set.delete(nums[i - k]) + set.add(nums[i]) + if(set.size === k) { + res = Math.max(res, preSum[i] - preSum[i - k]) + } + } + } + + return res +}; From 5346a23988ee3d788d694aeafb73857d93e9feb2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Nov 2022 12:41:43 +0800 Subject: [PATCH 1112/2039] Create 2460-apply-operations-to-an-array.js --- 2460-apply-operations-to-an-array.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2460-apply-operations-to-an-array.js diff --git a/2460-apply-operations-to-an-array.js b/2460-apply-operations-to-an-array.js new file mode 100644 index 00000000..01ac392e --- /dev/null +++ b/2460-apply-operations-to-an-array.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var applyOperations = function(nums) { + const n = nums.length + for(let i = 0; i < n - 1; i++) { + if(nums[i] === nums[i + 1]) { + nums[i] *= 2 + nums[i + 1] = 0 + } + } + const res = nums.filter(e => e !== 0) + while(res.length !== n) res.push(0) + return res +}; From 99fdc7b8d033a7b467d8902ae997beeed90371d8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Nov 2022 10:27:23 +0800 Subject: [PATCH 1113/2039] Update 1649-create-sorted-array-through-instructions.js --- ...reate-sorted-array-through-instructions.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1649-create-sorted-array-through-instructions.js b/1649-create-sorted-array-through-instructions.js index 6f30ca3c..d186bcd8 100644 --- a/1649-create-sorted-array-through-instructions.js +++ b/1649-create-sorted-array-through-instructions.js @@ -34,3 +34,50 @@ const createSortedArray = function(instructions) { } return res }; + +// another + +/** + * @param {number[]} instructions + * @return {number} + */ +const createSortedArray = function (instructions) { + const ins = instructions, n = ins.length + let res = 0 + const mod = 1e9 + 7, { min } = Math + const bit = new BIT(1e5) + for(let i = 0; i < n; i++) { + const cur = ins[i] + res = (res + min(bit.query(cur - 1), i - bit.query(cur))) % mod + bit.update(cur, 1) + } + + return res +} + +function lowBit(x) { + return x & -x +} +class BIT { + constructor(n) { + this.arr = Array(n + 1).fill(0) + } + + update(i, delta) { + if(i < 1) return + while (i < this.arr.length) { + this.arr[i] += delta + i += lowBit(i) + } + } + + query(i) { + let res = 0 + if(i < 1) return res + while (i > 0) { + res += this.arr[i] + i -= lowBit(i) + } + return res + } +} From 1f906b533ea1c60cd62e593ee2984489e27114c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Nov 2022 13:39:50 +0800 Subject: [PATCH 1114/2039] Create 2426-number-of-pairs-satisfying-inequality.js --- 2426-number-of-pairs-satisfying-inequality.js | 46 +++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 2426-number-of-pairs-satisfying-inequality.js diff --git a/2426-number-of-pairs-satisfying-inequality.js b/2426-number-of-pairs-satisfying-inequality.js new file mode 100644 index 00000000..942eb56b --- /dev/null +++ b/2426-number-of-pairs-satisfying-inequality.js @@ -0,0 +1,46 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} diff + * @return {number} + */ +const numberOfPairs = function (nums1, nums2, diff) { + const n = nums1.length, limit = 6 * 1e4, add = 3 * 1e4 + const bit = new BIT(limit) + + let res = 0 + for(let j = 0; j < n; j++) { + const d = nums1[j] - nums2[j] + add + res += bit.query(d + diff) + bit.update(d, 1) + } + + return res +} + +function lowBit(x) { + return x & -x +} +class BIT { + constructor(n) { + this.arr = Array(n + 1).fill(0) + } + + update(i, delta) { + if(i < 1) return + while (i < this.arr.length) { + this.arr[i] += delta + i += lowBit(i) + } + } + + query(i) { + let res = 0 + if(i < 1) return res + while (i > 0) { + res += this.arr[i] + i -= lowBit(i) + } + return res + } +} From 60534027406637c3c0d6ab105933fc295eb45079 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Nov 2022 13:01:10 +0800 Subject: [PATCH 1115/2039] Create 2438-range-product-queries-of-powers.js --- 2438-range-product-queries-of-powers.js | 29 +++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2438-range-product-queries-of-powers.js diff --git a/2438-range-product-queries-of-powers.js b/2438-range-product-queries-of-powers.js new file mode 100644 index 00000000..1d4235f4 --- /dev/null +++ b/2438-range-product-queries-of-powers.js @@ -0,0 +1,29 @@ +/** + * @param {number} n + * @param {number[][]} queries + * @return {number[]} + */ +const productQueries = function(n, queries) { + const mod = 1e9 + 7 + const powers = [] + let pow = 1 + while(n) { + const tmp = (n & 1) * pow + if(tmp) powers.push(tmp) + n = n >> 1 + pow *= 2 + } + + // console.log(powers) + const res = [] + + for(const [s, e] of queries) { + let tmp = 1 + for(let i = s; i <= e; i++) { + tmp = (tmp * powers[i]) % mod + } + res.push(tmp) + } + + return res +}; From 628aab41ea0bc9987d4f3499e0b1a09ff556fdd4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Nov 2022 17:45:51 +0800 Subject: [PATCH 1116/2039] Create 1523-count-odd-numbers-in-an-interval-range.js --- 1523-count-odd-numbers-in-an-interval-range.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 1523-count-odd-numbers-in-an-interval-range.js diff --git a/1523-count-odd-numbers-in-an-interval-range.js b/1523-count-odd-numbers-in-an-interval-range.js new file mode 100644 index 00000000..12d862e1 --- /dev/null +++ b/1523-count-odd-numbers-in-an-interval-range.js @@ -0,0 +1,18 @@ +/** + * @param {number} low + * @param {number} high + * @return {number} + */ +const countOdds = function(low, high) { + let res = 0 + + const odd = num => num % 2 === 1 + if(odd(low)) res++ + + const num = Math.floor( (high - low) / 2 ) + res += num + + if(high > low + 2 * num && odd(high)) res++ + + return res +}; From 8ba37037cee4ce483bc5fe0c21448a3340d01a2d Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Nov 2022 17:56:14 +0800 Subject: [PATCH 1117/2039] Update 1523-count-odd-numbers-in-an-interval-range.js --- 1523-count-odd-numbers-in-an-interval-range.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/1523-count-odd-numbers-in-an-interval-range.js b/1523-count-odd-numbers-in-an-interval-range.js index 12d862e1..2c47f34f 100644 --- a/1523-count-odd-numbers-in-an-interval-range.js +++ b/1523-count-odd-numbers-in-an-interval-range.js @@ -16,3 +16,15 @@ const countOdds = function(low, high) { return res }; + + +// another + +/** + * @param {number} low + * @param {number} high + * @return {number} + */ +const countOdds = function(low, high) { + return ~~((high + 1) / 2) - (~~(low / 2)) +}; From d8966d4daa37e9e814270190befa80edcea2bab3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Nov 2022 14:11:28 +0800 Subject: [PATCH 1118/2039] Create 2423-remove-letter-to-equalize-frequency.js --- 2423-remove-letter-to-equalize-frequency.js | 23 +++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2423-remove-letter-to-equalize-frequency.js diff --git a/2423-remove-letter-to-equalize-frequency.js b/2423-remove-letter-to-equalize-frequency.js new file mode 100644 index 00000000..57163f53 --- /dev/null +++ b/2423-remove-letter-to-equalize-frequency.js @@ -0,0 +1,23 @@ +/** + * @param {string} word + * @return {boolean} + */ +const equalFrequency = function (word) { + const cnt = {} + for(const ch of word) { + if(cnt[ch] == null) cnt[ch] = 0 + cnt[ch]++ + } + + for(const ch of word) { + cnt[ch]-- + if(cnt[ch] === 0) delete cnt[ch] + const s = new Set([...Object.values(cnt)]) + if(s.size === 1) return true + + if(cnt[ch] == null) cnt[ch] = 0 + cnt[ch]++ + } + + return false +} From ebb64cb2c033065b51d856a1f843b61a2477b442 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Nov 2022 15:23:26 +0800 Subject: [PATCH 1119/2039] Update 1224-maximum-equal-frequency.js --- 1224-maximum-equal-frequency.js | 38 +++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1224-maximum-equal-frequency.js b/1224-maximum-equal-frequency.js index 0f1bb6b1..13eda968 100644 --- a/1224-maximum-equal-frequency.js +++ b/1224-maximum-equal-frequency.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxEqualFreq = function (nums) { + const freqCnt = {}, cnt = {}, { max } = Math + + let res = 0, maxF = 0, i = 0 + for(const e of nums) { + if(cnt[e] == null) cnt[e] = 0 + cnt[e]++ + + const f = cnt[e] + + if(freqCnt[f - 1] == null) freqCnt[f - 1] = 0 + if(freqCnt[f] == null) freqCnt[f] = 0 + + if(freqCnt[f - 1] > 0) freqCnt[f - 1]-- + freqCnt[f]++ + + maxF = max(maxF, f) + + if( + maxF === 1 || + maxF * freqCnt[maxF] === i || + (maxF - 1) * (freqCnt[maxF - 1] + 1) === i + ) { + res = i + 1 + } + + i++ + } + + return res +} + +// another + /** * @param {number[]} nums * @return {number} From 6b72ba51bd433426c6c7d021be7921067caf65b5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Nov 2022 15:26:39 +0800 Subject: [PATCH 1120/2039] Update 1224-maximum-equal-frequency.js --- 1224-maximum-equal-frequency.js | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/1224-maximum-equal-frequency.js b/1224-maximum-equal-frequency.js index 13eda968..192cc0e6 100644 --- a/1224-maximum-equal-frequency.js +++ b/1224-maximum-equal-frequency.js @@ -20,6 +20,14 @@ const maxEqualFreq = function (nums) { maxF = max(maxF, f) + /* + cnt records the occurence of each num, freq records the frequence of number of occurences. max_F is the largest frequence. + There are three cases which satify the condition: + + all elements appear exact once. + all elements appear max_F times, except one appears once. + all elements appear max_F-1 times, except one appears max_F. + */ if( maxF === 1 || maxF * freqCnt[maxF] === i || From c23c35d8b7d98f641156911f249b3d08f4074482 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Nov 2022 14:02:32 +0800 Subject: [PATCH 1121/2039] Create 2380-time-needed-to-rearrange-a-binary-string.js --- 2380-time-needed-to-rearrange-a-binary-string.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2380-time-needed-to-rearrange-a-binary-string.js diff --git a/2380-time-needed-to-rearrange-a-binary-string.js b/2380-time-needed-to-rearrange-a-binary-string.js new file mode 100644 index 00000000..62543287 --- /dev/null +++ b/2380-time-needed-to-rearrange-a-binary-string.js @@ -0,0 +1,14 @@ +/** + * @param {string} s + * @return {number} + */ +var secondsToRemoveOccurrences = function(s) { + const n = s.length + let zeros = 0, seconds = 0; + for (let i = 0; i < n; ++i) { + zeros += s.charAt(i) == '0' ? 1 : 0; + if (s.charAt(i) == '1' && zeros > 0) + seconds = Math.max(seconds + 1, zeros); + } + return seconds; +}; From 631ba8ed86aef8bf0de07e3600df28be51b23c2f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Nov 2022 22:48:30 +0800 Subject: [PATCH 1122/2039] Update 2380-time-needed-to-rearrange-a-binary-string.js --- ...ime-needed-to-rearrange-a-binary-string.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/2380-time-needed-to-rearrange-a-binary-string.js b/2380-time-needed-to-rearrange-a-binary-string.js index 62543287..08f3cfc3 100644 --- a/2380-time-needed-to-rearrange-a-binary-string.js +++ b/2380-time-needed-to-rearrange-a-binary-string.js @@ -1,3 +1,24 @@ +/** + * @param {string} s + * @return {number} + */ +const secondsToRemoveOccurrences = function(s) { + let zeros = 0 + const n = s.length, { max } = Math + let res = 0 + + for(let i = 0; i < n; i++) { + if(s[i] === '0') zeros++ + if(s[i] === '1' && zeros > 0) { + res = max(res + 1, zeros) + } + } + return res +}; + +// another + + /** * @param {string} s * @return {number} From e838742f608cb0574c19cc51a29b114a14d944eb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Nov 2022 21:52:12 +0800 Subject: [PATCH 1123/2039] Create 2337-move-pieces-to-obtain-a-string.js --- 2337-move-pieces-to-obtain-a-string.js | 31 ++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2337-move-pieces-to-obtain-a-string.js diff --git a/2337-move-pieces-to-obtain-a-string.js b/2337-move-pieces-to-obtain-a-string.js new file mode 100644 index 00000000..51679d87 --- /dev/null +++ b/2337-move-pieces-to-obtain-a-string.js @@ -0,0 +1,31 @@ +/** + * @param {string} start + * @param {string} target + * @return {boolean} + */ +const canChange = function(start, target) { + const n=target.length; + let i=0,j=0; + while(i<=n && j<=n){ + + while(i Date: Sun, 13 Nov 2022 23:22:00 +0800 Subject: [PATCH 1124/2039] Create 2469-convert-the-temperature.js --- 2469-convert-the-temperature.js | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 2469-convert-the-temperature.js diff --git a/2469-convert-the-temperature.js b/2469-convert-the-temperature.js new file mode 100644 index 00000000..bafc470d --- /dev/null +++ b/2469-convert-the-temperature.js @@ -0,0 +1,7 @@ +/** + * @param {number} celsius + * @return {number[]} + */ +var convertTemperature = function(celsius) { + return [celsius + 273.15, celsius * 1.8 + 32] +}; From 231b2049b96a4dff48ee54007fe0d12332f23439 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Nov 2022 23:22:25 +0800 Subject: [PATCH 1125/2039] Create 2470-number-of-subarrays-with-lcm-equal-to-k.js --- ...number-of-subarrays-with-lcm-equal-to-k.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2470-number-of-subarrays-with-lcm-equal-to-k.js diff --git a/2470-number-of-subarrays-with-lcm-equal-to-k.js b/2470-number-of-subarrays-with-lcm-equal-to-k.js new file mode 100644 index 00000000..ddab1984 --- /dev/null +++ b/2470-number-of-subarrays-with-lcm-equal-to-k.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var subarrayLCM = function(nums, k) { + let res = 0 + const n = nums.length + + for(let i = 0; i < n; i++) { + let tmp = nums[i] + for(let j = i; j < n; j++) { + if(k % nums[j] !== 0) break + if(lcm(tmp, nums[j]) === k) res++ + tmp = Math.max(tmp, nums[j]) + } + } + + return res +}; + + +function lcm(a, b) { + return a * b / gcd(a, b); +} + +function gcd(a, b) { + return b ? gcd(b, a % b) : a +} From 3bee590f22b2bc6bb16d77fcf56f07954786020c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Nov 2022 23:22:52 +0800 Subject: [PATCH 1126/2039] Create 2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js --- ...erations-to-sort-a-binary-tree-by-level.js | 84 +++++++++++++++++++ 1 file changed, 84 insertions(+) create mode 100644 2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js diff --git a/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js b/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js new file mode 100644 index 00000000..146a0099 --- /dev/null +++ b/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js @@ -0,0 +1,84 @@ +/** + * 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 minimumOperations = function(root) { + let res = 0 + let q = [] + q.push(root) + + while(q.length) { + const nxt = [] + res += minSwaps(q.map(e => e.val), q.length) + const len = q.length + + for(let i = 0; i < len; i++) { + const cur = q[i] + if(cur.left) nxt.push(cur.left) + if(cur.right) nxt.push(cur.right) + } + + q = nxt + } + + + return res +}; + +function swap(arr, i, j) +{ + let temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; +} + +// Return the minimum number +// of swaps required to sort +// the array +function minSwaps(arr,N) +{ + let ans = 0; + let temp = arr.slice(); + + // Hashmap which stores the + // indexes of the input array + let h = new Map(); + + temp.sort((a, b) => a - b); + for (let i = 0; i < N; i++) + { + h.set(arr[i], i); + } + for (let i = 0; i < N; i++) + { + + // This is checking whether + // the current element is + // at the right place or not + if (arr[i] != temp[i]) + { + ans++; + let init = arr[i]; + + // If not, swap this element + // with the index of the + // element which should come here + swap(arr, i, h.get(temp[i])); + + // Update the indexes in + // the hashmap accordingly + h.set(init,h.get(temp[i])); + h.set(temp[i],i); + } + } + // console.log(arr, ans) + return ans; +} From c753a4a27b12a4e0a3c241d1fcd654427c3417e4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Nov 2022 23:31:08 +0800 Subject: [PATCH 1127/2039] Create 2472-maximum-number-of-non-overlapping-palindrome-substrings.js --- ...f-non-overlapping-palindrome-substrings.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2472-maximum-number-of-non-overlapping-palindrome-substrings.js diff --git a/2472-maximum-number-of-non-overlapping-palindrome-substrings.js b/2472-maximum-number-of-non-overlapping-palindrome-substrings.js new file mode 100644 index 00000000..e262fe6a --- /dev/null +++ b/2472-maximum-number-of-non-overlapping-palindrome-substrings.js @@ -0,0 +1,29 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const maxPalindromes = function(s, k) { + const len = s.length; + // dp[i] 表示s[0 .. i - 1] 中的不重叠回文子字符串的最大数目 + const dp = new Array(len + 1).fill(0); + // 如果s[i]不在回文字符串内，dp[i+1]=dp[i]; + // 如果s[l..r]是回文字符串且长度不小于k，那么dp[r+1]=max(dp[r+1],dp[l]+1) + + // 中心扩展法 + // 回文中心：len个单字符和len-1个双字符 + for (let center = 0; center < 2 * len - 1; center++) { + let l = center >> 1, + r = l + (center % 2); + dp[l + 1] = Math.max(dp[l + 1], dp[l]); + while (l >= 0 && r < len && s[l] === s[r]) { + if (r - l + 1 >= k) { + dp[r + 1] = Math.max(dp[r + 1], dp[l] + 1); + } + // expand from center + l--, r++; + } + } + + return dp[len]; +}; From 96bf44bb6704f888291488def5e25f3202531951 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 14 Nov 2022 13:13:50 +0800 Subject: [PATCH 1128/2039] Create 2453-destroy-sequential-targets.js --- 2453-destroy-sequential-targets.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2453-destroy-sequential-targets.js diff --git a/2453-destroy-sequential-targets.js b/2453-destroy-sequential-targets.js new file mode 100644 index 00000000..8e0b486e --- /dev/null +++ b/2453-destroy-sequential-targets.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @param {number} space + * @return {number} + */ +const destroyTargets = function(nums, space) { + let maxCount = -Infinity; + const map = {}; + + for (const num of nums) { + const reminder = num % space; + map[reminder] = (map[reminder] || 0) + 1; + maxCount = Math.max(maxCount, map[reminder]); + } + + let ans = Infinity; + for (const num of nums) { + if (map[num % space] === maxCount) { + ans = Math.min(ans, num); + } + } + + return ans; +}; From 88b94e669286aaabe60711ce62261e6a9c428514 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Nov 2022 16:09:54 +0800 Subject: [PATCH 1129/2039] Update 1286-iterator-for-combination.js --- 1286-iterator-for-combination.js | 51 ++++++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/1286-iterator-for-combination.js b/1286-iterator-for-combination.js index 2357732c..f5f904cb 100644 --- a/1286-iterator-for-combination.js +++ b/1286-iterator-for-combination.js @@ -41,3 +41,54 @@ function build(max, str, out = [], curr = '') { return out } + +// another + +/** + * @param {string} characters + * @param {number} combinationLength + */ +const CombinationIterator = function(characters, combinationLength) { + const res = [], len = combinationLength, str = characters, n = str.length + helper([], 0) + this.arr = res + this.idx = 0 + + function helper(cur, idx) { + if(cur.length === len) { + res.push(cur.slice().join('')) + return + } + if(idx >= n) return + + cur.push(str[idx]) + helper(cur, idx + 1) + cur.pop() + + helper(cur, idx + 1) + } +}; + +/** + * @return {string} + */ +CombinationIterator.prototype.next = function() { + if(this.hasNext()) { + return this.arr[this.idx++] + } +}; + +/** + * @return {boolean} + */ +CombinationIterator.prototype.hasNext = function() { + return this.arr[this.idx] != null +}; + +/** + * Your CombinationIterator object will be instantiated and called as such: + * var obj = new CombinationIterator(characters, combinationLength) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */ + From 2074d6bf6c5d950331ab89576e4e3159e3303cd4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Nov 2022 20:00:10 +0800 Subject: [PATCH 1130/2039] Update 1286-iterator-for-combination.js --- 1286-iterator-for-combination.js | 54 ++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/1286-iterator-for-combination.js b/1286-iterator-for-combination.js index f5f904cb..314526bf 100644 --- a/1286-iterator-for-combination.js +++ b/1286-iterator-for-combination.js @@ -92,3 +92,57 @@ CombinationIterator.prototype.hasNext = function() { * var param_2 = obj.hasNext() */ +// another + +/** + * @param {string} characters + * @param {number} combinationLength + */ +const CombinationIterator = function(characters, combinationLength) { + const res = [], len = combinationLength, str = characters, n = str.length + helper() + + // console.log(res) + this.arr = res + this.idx = 0 + + function helper() { + const limit = 1 << n + for(let i = limit - 1; i > 0; i--) { + let tmp = i, ts = '', idx = n - 1 + while(tmp) { + if(tmp & 1) { + ts = str[idx] + ts + } + idx-- + tmp = (tmp >> 1) + } + if(ts.length === len) res.push(ts) + } + } +}; + +/** + * @return {string} + */ +CombinationIterator.prototype.next = function() { + if(this.hasNext()) { + return this.arr[this.idx++] + } +}; + +/** + * @return {boolean} + */ +CombinationIterator.prototype.hasNext = function() { + return this.arr[this.idx] != null +}; + +/** + * Your CombinationIterator object will be instantiated and called as such: + * var obj = new CombinationIterator(characters, combinationLength) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */ + + From 210a65aef81dd1ca78b688c6cef3efc5fef913ee Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Nov 2022 16:50:06 +0800 Subject: [PATCH 1131/2039] Update 1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.js --- ...aving-the-same-number-of-distinct-balls.js | 68 +++++++++++++++++++ 1 file changed, 68 insertions(+) diff --git a/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.js b/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.js index 91fd6105..465ec0b8 100644 --- a/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.js +++ b/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.js @@ -1,3 +1,71 @@ +/** + * @param {number[]} balls + * @return {number} + */ +const getProbability = function(balls) { + const k = balls.length; + const halfUsed = balls.reduce((acc, val) => acc + val, 0) / 2; + const startArray = new Array(k); + startArray.fill(0); + const perm = function (b1, b2) { + let p1, p2, s1, s2; + s1 = b1.reduce((acc, val) => acc + val, 0); + s2 = b2.reduce((acc, val) => acc + val, 0); + const fact = function (n) { + let f = 1; + for (let i = 2; i <= n; i++) f *= i; + return f; + }; + p1 = fact(s1); + p2 = fact(s2); + b1.forEach((val) => { + if (val > 1) p1 /= fact(val); + }); + b2.forEach((val) => { + if (val > 1) p2 /= fact(val); + }); + return p1 * p2; + }; + + const getValidCombos = function (ballsUsed, colorNum = 0) { + let box1Used = ballsUsed.reduce((acc, val) => acc + val, 0); + let matches = { good: 0, total: 0 }, + thisColorMax = halfUsed - box1Used; + if (colorNum === k - 1) { + if (thisColorMax > balls[colorNum]) return { good: 0, total: 0 }; + ballsUsed[colorNum] = thisColorMax; + let ballsLeft = []; + let colorsUsed = [0, 0]; + for (let i = 0; i < k; i++) { + ballsLeft[i] = balls[i] - ballsUsed[i]; + if (ballsUsed[i] > 0) colorsUsed[0]++; + if (ballsLeft[i] > 0) colorsUsed[1]++; + } + let permutations = perm(ballsUsed, ballsLeft, k); + return { + good: colorsUsed[1] === colorsUsed[0] ? permutations : 0, + total: permutations, + }; + } + thisColorMax = Math.min(thisColorMax, balls[colorNum]); + for (let i = 0; i <= thisColorMax; i++) { + let match = getValidCombos([...ballsUsed], colorNum + 1); + matches = { + good: matches.good + match.good, + total: matches.total + match.total, + }; + ballsUsed[colorNum]++; + } + return matches; + }; + let res = getValidCombos(startArray); + return res.good / res.total; +}; + + +// another + + /** * @param {number[]} balls * @return {number} From 8ccd7196bed9e1b5a72c834da7971504f71802c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Nov 2022 19:54:32 +0800 Subject: [PATCH 1132/2039] Create 2478-number-of-beautiful-partitions.js --- 2478-number-of-beautiful-partitions.js | 56 ++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 2478-number-of-beautiful-partitions.js diff --git a/2478-number-of-beautiful-partitions.js b/2478-number-of-beautiful-partitions.js new file mode 100644 index 00000000..6f6ec63b --- /dev/null +++ b/2478-number-of-beautiful-partitions.js @@ -0,0 +1,56 @@ +/** + * @param {string} s + * @param {number} k + * @param {number} minLength + * @return {number} + */ +const beautifulPartitions = function (s, k, minLength) { + const mod = 1e9 + 7 + const p = new Set(['2', '3', '5', '7']) + + function isPrime(x) { + return p.has(x) + } + + let n = s.length + const dp = Array.from({ length: k + 1 }, () => Array(n).fill(0)) + + for (let j = 0; j < n; ++j) { + dp[1][j] = isPrime(s[0]) && !isPrime(s[j]) + } + let previous_row = Array(n).fill(0) + for (let i = 0; i + 1 < n; ++i) { + if (isPrime(s[i + 1])) previous_row[i] = dp[1][i] // update IFF next_index is prime and capable of starting a substring + if (i - 1 >= 0) + previous_row[i] = (previous_row[i] + previous_row[i - 1]) % mod + } + for (let i = 2; i <= k; ++i) { + let current_row = Array(n).fill(0) + for (let end = i * minLength - 1; end < n; ++end) { + if (isPrime(s[end])) continue + + // optimization usage + let prefixsum = previous_row[end - minLength] + let start = (i - 1) * minLength - 1 + if (start - 1 >= 0) + prefixsum = (prefixsum - previous_row[start - 1] + mod) % mod + dp[i][end] = (dp[i][end] + prefixsum) % mod + + // update current_row's column only if the next_index is a prime and capable of starting a substring + if (end + 1 < n && isPrime(s[end + 1])) + current_row[end] = (current_row[end] + dp[i][end]) % mod + } + // re-calclate prefix sum of current row dp values for each column + for (let c = 1; c <= n - 1; ++c) { + current_row[c] = (current_row[c] + current_row[c - 1]) % mod + } + + // swap previous_row dp values and current_row dp values. why ? + // Because current row will become previous row for next row + // swap(previous_row, current_row); + let tmp = current_row + current_row = previous_row + previous_row = tmp + } + return dp[k][n - 1] +} From 925a77b443dd85e12167e42f09be62a9bc06ed88 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Nov 2022 19:55:23 +0800 Subject: [PATCH 1133/2039] Create 2477-minimum-fuel-cost-to-report-to-the-capital.js --- ...imum-fuel-cost-to-report-to-the-capital.js | 57 +++++++++++++++++++ 1 file changed, 57 insertions(+) create mode 100644 2477-minimum-fuel-cost-to-report-to-the-capital.js diff --git a/2477-minimum-fuel-cost-to-report-to-the-capital.js b/2477-minimum-fuel-cost-to-report-to-the-capital.js new file mode 100644 index 00000000..04e99f78 --- /dev/null +++ b/2477-minimum-fuel-cost-to-report-to-the-capital.js @@ -0,0 +1,57 @@ +/** + * @param {number[][]} roads + * @param {number} seats + * @return {number} + */ +const minimumFuelCost = function(roads, seats) { + const n = roads.length + 1 + const graph = {}, inDegree = Array(n).fill(0) + const nodes = Array(n).fill(null).map((e, i) => ([i, 1, 0])) + for(const [u, v] of roads) { + if(graph[u] == null) graph[u] = new Set() + if(graph[v] == null) graph[v] = new Set() + graph[u].add(nodes[v]) + graph[v].add(nodes[u]) + + inDegree[u]++ + inDegree[v]++ + } + const { ceil } = Math + let q = [] + + for(let i = 0; i < n; i++) { + if(inDegree[i] === 1) q.push([i, 1, 0]) + } + // console.log(q) + let res = 0 + const visited = new Set() + + while(q.length) { + const nxt = [] + const len = q.length + for(let i = 0; i < len; i++) { + const [c, num, sum] = q[i] + if(c === 0) continue + for(const node of (graph[c] || [])) { + const [e] = node + if(visited.has(e)) continue + inDegree[e]-- + // console.log(c, e, sum, num, res) + if(e === 0) res += ceil(num/ seats) + sum + else { + node[1] += num + node[2] += ceil(num / seats) + sum + if(inDegree[e] === 1) nxt.push(node) + } + // console.log(res) + } + visited.add(c) + } + + q = nxt + // console.log(q, visited) + } + + + return res +}; From d251e222ce70343880f5c2c820f3f6cd50170a96 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Nov 2022 19:55:47 +0800 Subject: [PATCH 1134/2039] Create 2476-closest-nodes-queries-in-a-binary-search-tree.js --- ...t-nodes-queries-in-a-binary-search-tree.js | 63 +++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 2476-closest-nodes-queries-in-a-binary-search-tree.js diff --git a/2476-closest-nodes-queries-in-a-binary-search-tree.js b/2476-closest-nodes-queries-in-a-binary-search-tree.js new file mode 100644 index 00000000..afa8ba99 --- /dev/null +++ b/2476-closest-nodes-queries-in-a-binary-search-tree.js @@ -0,0 +1,63 @@ +/** + * 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[]} queries + * @return {number[][]} + */ +var closestNodes = function(root, queries) { + const arr = [] + function dfs(node) { + if(node == null) return + dfs(node.left) + arr.push(node.val) + dfs(node.right) + } + dfs(root) + const res = [] + // console.log(arr) + for(const q of queries) { + const tmp = [] + tmp[0] = ceil(arr, q) + tmp[1] = floor(arr, q) + res.push(tmp) + } + + return res + // maxIdx that <= target + function ceil(arr, q) { + const n = arr.length + let l = 0, r = n - 1 + while(l < r) { + const mid = r - (~~((r - l) / 2)) + if(arr[mid] <= q) { + l = mid + } else { + r = mid - 1 + } + } + + return arr[l] <= q ? arr[l] : -1 + } + // minIdx that >= target + function floor(arr, q) { + const n = arr.length + let l = 0, r = n - 1 + while(l < r) { + const mid = ~~((r + l) / 2) + if(arr[mid] < q) { + l = mid + 1 + } else { + r = mid + } + } + + return arr[l] >= q ? arr[l] : -1 + } +}; From 2bcd6abc8ac0a1f41c0a688bff83301292dd454a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Nov 2022 19:56:11 +0800 Subject: [PATCH 1135/2039] Create 2475-number-of-unequal-triplets-in-array.js --- 2475-number-of-unequal-triplets-in-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2475-number-of-unequal-triplets-in-array.js diff --git a/2475-number-of-unequal-triplets-in-array.js b/2475-number-of-unequal-triplets-in-array.js new file mode 100644 index 00000000..9bcacaaf --- /dev/null +++ b/2475-number-of-unequal-triplets-in-array.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const unequalTriplets = function(nums) { + let res = 0 + const n = nums.length + + for(let i = 0; i < n; i++) { + for(let j = i + 1; j < n; j++) { + for(let k = j + 1; k < n; k++) { + if(nums[i] !== nums[j] && nums[j] !== nums[k] && nums[i] !== nums[k]) res++ + } + } + } + + return res +}; From ba9a4c30bb47a2bb1ba91796059d35bbb5b0f3b3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Nov 2022 11:38:54 +0800 Subject: [PATCH 1136/2039] Update 2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js --- ...-reach-a-position-after-exactly-k-steps.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js b/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js index 2a7481e2..e11d1929 100644 --- a/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js +++ b/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.js @@ -1,3 +1,27 @@ +const dp = Array.from({ length: 1000 + 1 }, () => Array(1000 + 1).fill(0)) +const mod = 1e9 + 7 +/** + * @param {number} startPos + * @param {number} endPos + * @param {number} k + * @return {number} + */ +const numberOfWays = function(startPos, endPos, k) { + const { abs } = Math + if (dp[1][1] == 0) { + for (let k = 1; k <= 1000; ++k) { + dp[k][k] = 1; + for (let i = 0; i < k; ++i) { + dp[k][i] = ((i === 0 ? dp[k - 1][1] : dp[k - 1][i - 1]) + dp[k - 1][i + 1]) % mod; + } + } + } + + return dp[k][abs(startPos - endPos)]; +}; + +// another + /** * @param {number} startPos * @param {number} endPos From f1c7f95908f27de5cc1d1131a54f3ed78ae1dcc9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 24 Nov 2022 11:53:02 +0800 Subject: [PATCH 1137/2039] Update 41-first-missing-positive.js --- 41-first-missing-positive.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/41-first-missing-positive.js b/41-first-missing-positive.js index 3bd7ef24..fa054946 100644 --- a/41-first-missing-positive.js +++ b/41-first-missing-positive.js @@ -68,3 +68,32 @@ function swap(arr, i, j) { arr[i] = arr[j] arr[j] = tmp } + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const firstMissingPositive = function(nums) { + const n = nums.length + for(let i = 0; i < n; i++) { + while(nums[i] > 0 && nums[i] !== nums[nums[i] - 1] && nums[i] <= n) { + swap(i, nums[i] - 1) + } + } + + // console.log(nums) + for(let i = 0; i < n; i++) { + if(nums[i] !== i + 1) return i + 1 + } + + return n + 1 + + + function swap(i, j) { + const tmp = nums[j] + nums[j] = nums[i] + nums[i] = tmp + } +}; From 8363876311b901da529ad729dedf3a38ca569b2d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 25 Nov 2022 18:00:28 +0800 Subject: [PATCH 1138/2039] Update 268-missing-number.js --- 268-missing-number.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/268-missing-number.js b/268-missing-number.js index da2b79ad..69960ce7 100755 --- a/268-missing-number.js +++ b/268-missing-number.js @@ -23,3 +23,15 @@ const missingNumber = function(nums) { function sum(arr) { return arr.reduce((ac, el) => ac + el, 0); } + +// another +/** + * @param {number[]} nums + * @return {number} + */ +var missingNumber = function(nums) { + const n = nums.length + const sum = nums.reduce((ac, e) => ac + e, 0) + const target = (n + 1) * n / 2 + return target - sum +}; From e94fb057d06376d72d2c488a62c9d7847664facc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 26 Nov 2022 22:40:29 +0800 Subject: [PATCH 1139/2039] Update 287-find-the-duplicate-number.js --- 287-find-the-duplicate-number.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/287-find-the-duplicate-number.js b/287-find-the-duplicate-number.js index e4a2fa62..d0a9bb2d 100755 --- a/287-find-the-duplicate-number.js +++ b/287-find-the-duplicate-number.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findDuplicate = function(nums) { + const n = nums.length; + let ans = 0; + let bit_max = 31; + while (((n - 1) >> bit_max) == 0) { + bit_max -= 1; + } + for (let bit = 0; bit <= bit_max; ++bit) { + let x = 0, y = 0; + for (let i = 0; i < n; ++i) { + if ((nums[i] & (1 << bit)) != 0) { + x += 1; + } + if (i >= 1 && ((i & (1 << bit)) != 0)) { + y += 1; + } + } + if (x > y) { + ans |= 1 << bit; + } + } + return ans; +}; + +// another + /** * @param {number[]} nums * @return {number} From a5bbcdbc66a9e78d9aa2d7fc02e3eb2440ed9dfb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Nov 2022 12:37:31 +0800 Subject: [PATCH 1140/2039] Create 2485-find-the-pivot-integer.js --- 2485-find-the-pivot-integer.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2485-find-the-pivot-integer.js diff --git a/2485-find-the-pivot-integer.js b/2485-find-the-pivot-integer.js new file mode 100644 index 00000000..ca073e25 --- /dev/null +++ b/2485-find-the-pivot-integer.js @@ -0,0 +1,14 @@ +/** + * @param {number} n + * @return {number} + */ +var pivotInteger = function(n) { + const sum = (1 + n) * n / 2 + let tmp = 0 + for(let i = 1; i <= n; i++) { + tmp += i + if(tmp === sum - tmp + i) return i + } + + return -1 +}; From fc3f7d46eec8cce3f5b0d3fc3c852147b0570c73 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Nov 2022 12:45:53 +0800 Subject: [PATCH 1141/2039] Create 2486-append-characters-to-string-to-make-subsequence.js --- ...haracters-to-string-to-make-subsequence.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2486-append-characters-to-string-to-make-subsequence.js diff --git a/2486-append-characters-to-string-to-make-subsequence.js b/2486-append-characters-to-string-to-make-subsequence.js new file mode 100644 index 00000000..a3f588be --- /dev/null +++ b/2486-append-characters-to-string-to-make-subsequence.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @param {string} t + * @return {number} + */ +var appendCharacters = function(s, t) { + let i = 0, j = 0 + const m = s.length, n = t.length + while(i < m && j < n) { + if(s[i] === t[j]) { + i++ + j++ + } else { + i++ + } + } + + return n - 1 - (j - 1) +}; From de2e3fcf96baee9cc31da3a0ee07a3fdccf5dcf0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Nov 2022 16:32:18 +0800 Subject: [PATCH 1142/2039] Create 2487-remove-nodes-from-linked-list.js --- 2487-remove-nodes-from-linked-list.js | 34 +++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2487-remove-nodes-from-linked-list.js diff --git a/2487-remove-nodes-from-linked-list.js b/2487-remove-nodes-from-linked-list.js new file mode 100644 index 00000000..4945be49 --- /dev/null +++ b/2487-remove-nodes-from-linked-list.js @@ -0,0 +1,34 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const removeNodes = function(head) { + const arr = [] + let cur = head + while(cur) { + arr.push(cur) + cur = cur.next + } + + const stk = [] + for(const e of arr) { + while(stk.length && e.val > stk[stk.length - 1].val) { + stk.pop() + } + stk.push(e) + } + + for(let i = 0; i < stk.length - 1; i++) { + const cur = stk[i] + cur.next = stk[i + 1] + } + + return stk[0] +}; From 03e5b46d8a138c6ec0dbff91f2abed52a2492525 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Nov 2022 17:33:12 +0800 Subject: [PATCH 1143/2039] Create 2488-count-subarrays-with-median-k.js --- 2488-count-subarrays-with-median-k.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2488-count-subarrays-with-median-k.js diff --git a/2488-count-subarrays-with-median-k.js b/2488-count-subarrays-with-median-k.js new file mode 100644 index 00000000..d1577b75 --- /dev/null +++ b/2488-count-subarrays-with-median-k.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countSubarrays = (a, k) => permutationArrayWithMedianK(a, k); + +const permutationArrayWithMedianK = (a, k) => { + let m = new Map([[0, 1]]), find = false, balance = 0, res = 0; + for (const x of a) { + if (x < k) { + balance--; + } else if (x > k) { + balance++; + } else { + find = true; + } + if (find) { + // balance - 1, subarray length is even, has one more right + res += (m.get(balance) || 0) + (m.get(balance - 1) || 0); + } else { + m.set(balance, m.get(balance) + 1 || 1); + } + } + return res; +}; From 8460d5d5ac916a7380da6487a89219e35f212090 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Nov 2022 23:10:38 +0800 Subject: [PATCH 1144/2039] Create 2439-minimize-maximum-of-array.js --- 2439-minimize-maximum-of-array.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2439-minimize-maximum-of-array.js diff --git a/2439-minimize-maximum-of-array.js b/2439-minimize-maximum-of-array.js new file mode 100644 index 00000000..cc3c1bcf --- /dev/null +++ b/2439-minimize-maximum-of-array.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimizeArrayValue = function(nums) { + const n = nums.length + let sum = 0, res = 0; + for (let i = 0; i < n; ++i) { + sum += nums[i]; + res = Math.max(res, Math.ceil(sum / (i + 1))); + } + return res; +}; From 91b449c73d72273e9dbfb12fca622fcdde33bd3e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 29 Nov 2022 13:24:42 +0800 Subject: [PATCH 1145/2039] Update 645-set-mismatch.js --- 645-set-mismatch.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/645-set-mismatch.js b/645-set-mismatch.js index b55c998b..98106af4 100644 --- a/645-set-mismatch.js +++ b/645-set-mismatch.js @@ -20,3 +20,22 @@ const findErrorNums = function(nums) { } return res }; + +// another + +/** + * @param {number[]} nums + * @return {number[]} + */ +const findErrorNums = function(nums) { + const res = []; + for (const i of nums) { + if (nums[Math.abs(i) - 1] < 0) res[0] = Math.abs(i); + else nums[Math.abs(i) - 1] *= -1; + } + for (let i = 0; i < nums.length; i++) { + if (nums[i] > 0) res[1] = i + 1; + } + return res; +}; + From 8eb1b45cfb5c64654364e45a6f0da9c037e98bfa Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 29 Nov 2022 19:50:53 +0800 Subject: [PATCH 1146/2039] Create 2411-smallest-subarrays-with-maximum-bitwise-or.js --- ...-smallest-subarrays-with-maximum-bitwise-or.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2411-smallest-subarrays-with-maximum-bitwise-or.js diff --git a/2411-smallest-subarrays-with-maximum-bitwise-or.js b/2411-smallest-subarrays-with-maximum-bitwise-or.js new file mode 100644 index 00000000..0c5f82b2 --- /dev/null +++ b/2411-smallest-subarrays-with-maximum-bitwise-or.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const smallestSubarrays = function(nums) { + const n = nums.length, last = Array(30).fill(0), res = []; + for (let i = n - 1; i >= 0; --i) { + res[i] = 1; + for (let j = 0; j < 30; ++j) { + if ((nums[i] & (1 << j)) > 0) last[j] = i; + res[i] = Math.max(res[i], last[j] - i + 1); + } + } + return res; +}; From 2d7f9929802bc0d70063ab7840ac221e46eb270f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 30 Nov 2022 19:51:13 +0800 Subject: [PATCH 1147/2039] Update 2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js --- ...erations-to-sort-a-binary-tree-by-level.js | 79 +++++++++---------- 1 file changed, 37 insertions(+), 42 deletions(-) diff --git a/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js b/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js index 146a0099..2350da34 100644 --- a/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js +++ b/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.js @@ -10,75 +10,70 @@ * @param {TreeNode} root * @return {number} */ -var minimumOperations = function(root) { +var minimumOperations = function (root) { let res = 0 let q = [] q.push(root) - - while(q.length) { + + while (q.length) { const nxt = [] - res += minSwaps(q.map(e => e.val), q.length) + res += minSwaps( + q.map((e) => e.val), + q.length + ) const len = q.length - - for(let i = 0; i < len; i++) { + + for (let i = 0; i < len; i++) { const cur = q[i] - if(cur.left) nxt.push(cur.left) - if(cur.right) nxt.push(cur.right) + if (cur.left) nxt.push(cur.left) + if (cur.right) nxt.push(cur.right) } q = nxt } - - + return res -}; +} -function swap(arr, i, j) -{ - let temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; +function swap(arr, i, j) { + const temp = arr[i] + arr[i] = arr[j] + arr[j] = temp } - + // Return the minimum number // of swaps required to sort // the array -function minSwaps(arr,N) -{ - let ans = 0; - let temp = arr.slice(); - +function minSwaps(arr, len) { + let ans = 0 + const temp = arr.slice() + // Hashmap which stores the // indexes of the input array - let h = new Map(); - - temp.sort((a, b) => a - b); - for (let i = 0; i < N; i++) - { - h.set(arr[i], i); + const h = new Map() + + temp.sort((a, b) => a - b) + for (let i = 0; i < len; i++) { + h.set(arr[i], i) } - for (let i = 0; i < N; i++) - { - + for (let i = 0; i < len; i++) { // This is checking whether // the current element is // at the right place or not - if (arr[i] != temp[i]) - { - ans++; - let init = arr[i]; - + if (arr[i] !== temp[i]) { + ans++ + const init = arr[i] + // If not, swap this element // with the index of the // element which should come here - swap(arr, i, h.get(temp[i])); - + swap(arr, i, h.get(temp[i])) + // Update the indexes in // the hashmap accordingly - h.set(init,h.get(temp[i])); - h.set(temp[i],i); + h.set(init, h.get(temp[i])) + h.set(temp[i], i) } } - // console.log(arr, ans) - return ans; + return ans } From 02601a8ee33d431c7be79aea24fb07245280e379 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Dec 2022 12:53:04 +0800 Subject: [PATCH 1148/2039] Update 525-contiguous-array.js --- 525-contiguous-array.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/525-contiguous-array.js b/525-contiguous-array.js index fcd03339..9b0da1ea 100644 --- a/525-contiguous-array.js +++ b/525-contiguous-array.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findMaxLength = function(nums) { + let res = 0, sum = 0 + const hash = {0: -1}, n = nums.length + + for(let i = 0; i < n; i++) { + const cur = nums[i] + sum += cur === 0 ? -1 : 1 + if(hash[sum] != null) { + res = Math.max(res, i - hash[sum]) + } else { + hash[sum] = i + } + + } + + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From b55818531398aa6afb23824ae968b5a53044bce3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Dec 2022 13:50:40 +0800 Subject: [PATCH 1149/2039] Update 930-binary-subarrays-with-sum.js --- 930-binary-subarrays-with-sum.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/930-binary-subarrays-with-sum.js b/930-binary-subarrays-with-sum.js index e94beea5..785bf86c 100644 --- a/930-binary-subarrays-with-sum.js +++ b/930-binary-subarrays-with-sum.js @@ -17,3 +17,27 @@ const numSubarraysWithSum = function(A, S) { } return ans; }; + +// another + +/** + * @param {number[]} nums + * @param {number} goal + * @return {number} + */ +const numSubarraysWithSum = function(nums, goal) { + const hash = {} + const n = nums.length + let res = 0, sum = 0 + for(let i = 0; i < n; i++) { + const cur = nums[i] + sum += cur + const pre = sum - goal + if(hash[sum] == null) hash[sum] = 0 + if(hash[pre] != null) res += hash[pre] + if(sum === goal) res++ + hash[sum]++ + } + + return res +}; From 4362867ed44ad5f3a9be8852513626765545af61 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 3 Dec 2022 22:36:43 +0800 Subject: [PATCH 1150/2039] Update 974-subarray-sums-divisible-by-k.js --- 974-subarray-sums-divisible-by-k.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/974-subarray-sums-divisible-by-k.js b/974-subarray-sums-divisible-by-k.js index 34fc0a41..26306870 100644 --- a/974-subarray-sums-divisible-by-k.js +++ b/974-subarray-sums-divisible-by-k.js @@ -14,3 +14,22 @@ const subarraysDivByK = function (nums, k) { } return res } + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const subarraysDivByK = function(nums, k) { + const memo = {0: 1} + let sum = 0, res = 0 + for(const e of nums) { + sum += e + const remain = (k - (sum % k)) % k + res += memo[remain] ?? 0 + memo[remain] = (memo[remain] ?? 0) + 1 + } + return res +}; From 661eb3c91ba41963d5b57c68403fe6caa4b7989f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Dec 2022 19:11:28 +0800 Subject: [PATCH 1151/2039] Create 1983-widest-pair-of-indices-with-equal-range-sum.js --- ...st-pair-of-indices-with-equal-range-sum.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1983-widest-pair-of-indices-with-equal-range-sum.js diff --git a/1983-widest-pair-of-indices-with-equal-range-sum.js b/1983-widest-pair-of-indices-with-equal-range-sum.js new file mode 100644 index 00000000..5b0d0233 --- /dev/null +++ b/1983-widest-pair-of-indices-with-equal-range-sum.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const widestPairOfIndices = function(nums1, nums2) { + const n = nums1.length + const diff = Array(n).fill(0) + let res = 0, sum1 = 0, sum2 = 0 + + for(let i = 0; i < n; i++) { + const cur1 = nums1[i], cur2 = nums2[i] + sum1 += cur1 + sum2 += cur2 + if(sum1 === sum2) res = i + 1 + diff[i] = sum1 - sum2 + } + const hash = {} + for(let i = 0; i < n; i++) { + const cur = diff[i] + if(hash[cur] == null) hash[cur] = i + else { + res = Math.max(res, i - hash[cur]) + } + } + + return res +}; From 02279f5ce076062f6e15da70f4c79ac1c4766108 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Dec 2022 19:12:12 +0800 Subject: [PATCH 1152/2039] Create 2490-circular-sentence.js --- 2490-circular-sentence.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2490-circular-sentence.js diff --git a/2490-circular-sentence.js b/2490-circular-sentence.js new file mode 100644 index 00000000..b4764941 --- /dev/null +++ b/2490-circular-sentence.js @@ -0,0 +1,16 @@ +/** + * @param {string} sentence + * @return {boolean} + */ +var isCircularSentence = function(sentence) { + const arr = sentence.split(' ') + const n = arr.length + for(let i = 0; i < n; i++) { + if(i === n - 1) { + if(arr[i][arr[i].length - 1] !== arr[0][0]) return false + } else { + if(arr[i][arr[i].length - 1] !== arr[i + 1][0]) return false + } + } + return true +}; From 95d4b6e2cfa06672db66a0a8f396a2eb6c82099d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Dec 2022 19:12:40 +0800 Subject: [PATCH 1153/2039] Create 2491-divide-players-into-teams-of-equal-skill.js --- ...ivide-players-into-teams-of-equal-skill.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2491-divide-players-into-teams-of-equal-skill.js diff --git a/2491-divide-players-into-teams-of-equal-skill.js b/2491-divide-players-into-teams-of-equal-skill.js new file mode 100644 index 00000000..d4ca89ac --- /dev/null +++ b/2491-divide-players-into-teams-of-equal-skill.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} skill + * @return {number} + */ +const dividePlayers = function(skill) { + skill.sort((a, b) => a - b) + const n = skill.length + const sum = skill[0] + skill[skill.length - 1] + for(let i = 1; i < n / 2; i++) { + const j = n - 1 - i + if(skill[i] + skill[j] !== sum) return -1 + } + let res = skill[0] * skill[skill.length - 1] + for(let i = 1; i < n / 2; i++) { + const j = n - 1 - i + res += skill[i] * skill[j] + } + + return res +}; From 0a9ee039d4779371b17af22a51a273461f94b94c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Dec 2022 19:13:22 +0800 Subject: [PATCH 1154/2039] Create 2492-minimum-score-of-a-path-between-two-cities.js --- ...imum-score-of-a-path-between-two-cities.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 2492-minimum-score-of-a-path-between-two-cities.js diff --git a/2492-minimum-score-of-a-path-between-two-cities.js b/2492-minimum-score-of-a-path-between-two-cities.js new file mode 100644 index 00000000..de7ed10e --- /dev/null +++ b/2492-minimum-score-of-a-path-between-two-cities.js @@ -0,0 +1,56 @@ +class UnionFind { + constructor() { + this.sizes = new Map() + this.parents = new Map() + } + + find(x){ + if (x !== (this.parents.get(x) ?? x)) { + this.parents.set(x, this.find(this.parents.get(x) ?? x)); + } + return this.parents.get(x) ?? x; + } + size(x) { + return (this.sizes.get(this.find(x)) ?? 1); + } + connected(p, q) { + return this.find(p) == this.find(q); + } + union(a, b) { + const fa = this.find(a); + const fb = this.find(b); + if (fa == fb) { + return; + } + const sa = this.sizes.get(fa) ?? 1; + const sb = this.sizes.get(fb) ?? 1; + + if (sa < sb) { + this.parents.set(fa, fb); + this.sizes.set(fb, sb + sa); + } else { + this.parents.set(fb, fa); + this.sizes.set(fa, sb + sa); + } + } +} +/** + * @param {number} n + * @param {number[][]} roads + * @return {number} + */ +var minScore = function(n, roads) { + const uf = new UnionFind(); + + for (const [a, b] of roads) { + uf.union(a, b); + } + let ans = Infinity; + + for (const [i, j, d] of roads) { + if (uf.connected(1, i) && uf.connected(1, j)) { + ans = Math.min(ans, d); + } + } + return ans; +}; From caadda0173007f5c7f9d8386682480021f55061b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Dec 2022 19:14:48 +0800 Subject: [PATCH 1155/2039] Create 2493-divide-nodes-into-the-maximum-number-of-groups.js --- ...nodes-into-the-maximum-number-of-groups.js | 98 +++++++++++++++++++ 1 file changed, 98 insertions(+) create mode 100644 2493-divide-nodes-into-the-maximum-number-of-groups.js diff --git a/2493-divide-nodes-into-the-maximum-number-of-groups.js b/2493-divide-nodes-into-the-maximum-number-of-groups.js new file mode 100644 index 00000000..738d09c3 --- /dev/null +++ b/2493-divide-nodes-into-the-maximum-number-of-groups.js @@ -0,0 +1,98 @@ +/////////////////////// Template //////////////////////////////////////// +const initializeGraph = (n) => { let g = []; for (let i = 0; i < n; i++) { g.push([]); } return g; }; +const packUG = (g, edges) => { for (const [u, v] of edges) { g[u].push(v); g[v].push(u); } }; +const initialize2DArray = (n, m) => { let d = []; for (let i = 0; i < n; i++) { let t = Array(m).fill(Number.MAX_SAFE_INTEGER); d.push(t); } return d; }; + +function DJSet(n) { + // parent[i] < 0, -parent[i] is the group size which root is i. example: (i -> parent[i] -> parent[parent[i]] -> parent[parent[parent[i]]] ...) + // parent[i] >= 0, i is not the root and parent[i] is i's parent. example: (... parent[parent[parent[i]]] -> parent[parent[i]] -> parent[i] -> i) + let parent = Array(n).fill(-1); + return { find, union, count, equiv, par } + function find(x) { + return parent[x] < 0 ? x : parent[x] = find(parent[x]); + } + function union(x, y) { + x = find(x); + y = find(y); + if (x != y) { + if (parent[x] < parent[y]) [x, y] = [y, x]; + parent[x] += parent[y]; + parent[y] = x; + } + return x == y; + } + function count() { // total groups + return parent.filter(v => v < 0).length; + } + function equiv(x, y) { // isConnected + return find(x) == find(y); + } + function par() { + return parent; + } +} + +const isBipartite = (g) => { + let n = g.length, start = 1, visit = Array(n).fill(false), q = [], color = Array(n).fill(0); // 0: no color, 1: red -1: blue + for (let i = start; i < n; i++) { + if (color[i] != 0) continue; + q.push(i); + color[i] = 1; + if (visit[i]) continue; + while (q.length) { + let cur = q.shift(); + if (visit[cur]) continue; + for (const child of g[cur]) { + if (color[child] == color[cur]) return false; + if (color[child]) continue; + color[child] = -color[cur]; + q.push(child); + } + } + } + return true; +}; +//////////////////////////////////////////////////////////////////// +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +const magnificentSets = (n, edges) => { + let g = initializeGraph(n + 1), ds = new DJSet(n + 1); + packUG(g, edges); + if (!isBipartite(g)) return -1; + let d = initialize2DArray(n + 1, n + 1), res = Array(n + 1).fill(0); + for (let i = 1; i <= n; i++) d[i][i] = 0; + for (const [u, v] of edges) { + d[u][v] = 1; + d[v][u] = 1; + ds.union(u, v); + } + wf(d); + for (let i = 1; i <= n; i++) { + let max = 0; + for (let j = 1; j <= n; j++) { + if (d[i][j] >= Number.MAX_SAFE_INTEGER) continue; + max = Math.max(max, d[i][j]); + } + let par = ds.find(i); + res[par] = Math.max(res[par], max + 1); + } + let ans = 0; + for (let i = 1; i <= n; i++) ans += res[i]; + return ans; +}; + +const wf = (g) => { + let n = g.length; + for (let k = 0; k < n; k++) { + for (let i = 0; i < n; i++) { + for (let j = 0; j < n; j++) { + if (g[i][j] > g[i][k] + g[k][j]) { + g[i][j] = g[i][k] + g[k][j]; + } + } + } + } +}; From 941f878d939f611c92165f89e0104227996f6059 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 5 Dec 2022 18:47:00 +0800 Subject: [PATCH 1156/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index 9260de39..943535fa 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -1,3 +1,28 @@ +/** + * @param {string} s + * @return {number} + */ +const findTheLongestSubstring = function(s) { + const n = s.length + const ch2num = ch => { + const idx = 'aeiou'.indexOf(ch) + return idx === -1 ? 0 : (1 << idx) + } + let res = 0 + let mask = 0 + const hash = new Map([[0, -1]]) + for (let i = 0; i < n; i++) { + mask ^= ch2num(s[i]) + const first = hash.has(mask) ? hash.get(mask) : i + if (!hash.has(mask)) hash.set(mask, i) + res = Math.max(res, i - first) + } + + return res +}; + +// another + /** * @param {string} s * @return {number} From c296d37145e8052e07f058323774277ded0697d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 5 Dec 2022 22:01:10 +0800 Subject: [PATCH 1157/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index 943535fa..cd7df758 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -1,3 +1,30 @@ +/** + * @param {string} s + * @return {number} + */ +const findTheLongestSubstring = function(s) { + const n = s.length + let res = 0, mask = 0 + const map = new Map([[0, -1]]) + + for(let i = 0; i < n; i++) { + const ch = s[i] + const idx = 'aeiou'.indexOf(ch) + if(idx !== -1) { + mask ^= (1 << idx) + } + if(map.has(mask)) { + res = Math.max(res, i - map.get(mask)) + } else { + map.set(mask, i) + } + } + + return res +}; + +// another + /** * @param {string} s * @return {number} From 039362f154331d1e77eeb7eb56e68e7e42326984 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 5 Dec 2022 22:09:57 +0800 Subject: [PATCH 1158/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index cd7df758..9b9130d8 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -25,6 +25,35 @@ const findTheLongestSubstring = function(s) { // another +/** + * @param {string} s + * @return {number} + */ +const findTheLongestSubstring = function(s) { + const n = s.length + let res = 0, mask = 0 + const map = new Map([[0, -1]]) + + for(let i = 0; i < n; i++) { + const ch = s[i] + const idx = 'aeiou'.indexOf(ch) + if(idx !== -1) { + mask ^= (1 << idx) + if(map.has(mask)) { + res = Math.max(res, i - map.get(mask)) + } else { + map.set(mask, i) + } + } else { + res = Math.max(res, i - map.get(mask)) + } + } + + return res +}; + +// another + /** * @param {string} s * @return {number} From f5e490c8536ee55fd1b5e67599f92305d76ca56a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Dec 2022 23:04:58 +0800 Subject: [PATCH 1159/2039] Update 1524-number-of-sub-arrays-with-odd-sum.js --- 1524-number-of-sub-arrays-with-odd-sum.js | 26 +++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1524-number-of-sub-arrays-with-odd-sum.js b/1524-number-of-sub-arrays-with-odd-sum.js index 671df32f..1b3fed50 100644 --- a/1524-number-of-sub-arrays-with-odd-sum.js +++ b/1524-number-of-sub-arrays-with-odd-sum.js @@ -1,3 +1,29 @@ +/** + * @param {number[]} arr + * @return {number} + */ +const numOfSubarrays = function(arr) { + const n = arr.length, mod = 1e9 + 7 + let sum = 0, res = 0, oddCnt = 0, evenCnt = 0 + + for(let i = 0; i < n; i++) { + const cur = arr[i] + sum += cur + if(sum % 2 === 1) { + res++ + res += evenCnt + oddCnt++ + } else { + res += oddCnt + evenCnt++ + } + } + + return res % mod +}; + +// another + /** * @param {number[]} arr * @return {number} From be487287c85a2d036e2a1ddf59a4f61325fdbc55 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Dec 2022 23:48:23 +0800 Subject: [PATCH 1160/2039] Create 2100-find-good-days-to-rob-the-bank.js --- 2100-find-good-days-to-rob-the-bank.js | 39 ++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2100-find-good-days-to-rob-the-bank.js diff --git a/2100-find-good-days-to-rob-the-bank.js b/2100-find-good-days-to-rob-the-bank.js new file mode 100644 index 00000000..c90bacd8 --- /dev/null +++ b/2100-find-good-days-to-rob-the-bank.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} security + * @param {number} time + * @return {number[]} + */ +const goodDaysToRobBank = function(security, time) { + const n = security.length, sec = security + const pre = Array(n).fill(0), post = Array(n).fill(0) + + const res = [] + let num = 0 + for(let i = 1; i < n; i++) { + if(sec[i] <= sec[i - 1]) { + num++ + } else { + num = 0 + } + pre[i] = num + } + + num = 0 + for(let i = n - 2; i >= 0; i--) { + if(sec[i] <= sec[i + 1]) { + num++ + } else { + num = 0 + } + post[i] = num + } + + // console.log(pre, post) + for(let i = 0; i < n; i++) { + if(pre[i] >= time && post[i] >= time) { + res.push(i) + } + } + + return res +}; From 627fef5e864c24b13c370352456cc2fbd0a4e5d8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 9 Dec 2022 22:55:21 +0800 Subject: [PATCH 1161/2039] Update 1590-make-sum-divisible-by-p.js --- 1590-make-sum-divisible-by-p.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1590-make-sum-divisible-by-p.js b/1590-make-sum-divisible-by-p.js index 61d36c0c..91857ae1 100644 --- a/1590-make-sum-divisible-by-p.js +++ b/1590-make-sum-divisible-by-p.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} p + * @return {number} + */ +const minSubarray = function(nums, p) { + const remain = nums.reduce((ac, e) => ac + e, 0) % p + const n = nums.length, hash = {0: -1} + let res = n + if(remain === 0) return 0 + for(let i = 0, sum = 0; i < n; i++) { + const cur = nums[i] + sum += cur + const target = (sum % p - remain + p) % p + if(hash[target] != null) { + res = Math.min(res, i - hash[target]) + } + + hash[sum % p] = i + } +// console.log(hash) + + return res === n ? -1 : res +}; + +// another + /** * @param {number[]} nums * @param {number} p From ada1e7906e923f5eedbbed422f0ab90e6b9acaa2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 10 Dec 2022 14:19:44 +0800 Subject: [PATCH 1162/2039] Update 1658-minimum-operations-to-reduce-x-to-zero.js --- ...-minimum-operations-to-reduce-x-to-zero.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/1658-minimum-operations-to-reduce-x-to-zero.js b/1658-minimum-operations-to-reduce-x-to-zero.js index ed2b66ef..15935ef5 100644 --- a/1658-minimum-operations-to-reduce-x-to-zero.js +++ b/1658-minimum-operations-to-reduce-x-to-zero.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} nums + * @param {number} x + * @return {number} + */ +const minOperations = function(nums, x) { + const sum = nums.reduce((ac, e) => ac + e, 0) + const subArrSum = sum - x + if(subArrSum === 0) return nums.length + const n = nums.length, hash = {0: -1} + let ac = 0, res = -1 + for(let i = 0; i < n; i++) { + const cur = nums[i] + ac += cur + if(hash[ac - subArrSum] != null) { + res = Math.max(res, i - hash[ac - subArrSum]) + } + hash[ac] = i + } + + return res === -1 ? -1 : n - res +}; + +// another + /** * @param {number[]} nums * @param {number} x From da047eed06f87905ab63f6639e8ec03fa73ac3bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 10 Dec 2022 22:01:13 +0800 Subject: [PATCH 1163/2039] Create 2291-maximum-profit-from-trading-stocks.js --- 2291-maximum-profit-from-trading-stocks.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2291-maximum-profit-from-trading-stocks.js diff --git a/2291-maximum-profit-from-trading-stocks.js b/2291-maximum-profit-from-trading-stocks.js new file mode 100644 index 00000000..4a69461f --- /dev/null +++ b/2291-maximum-profit-from-trading-stocks.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} present + * @param {number[]} future + * @param {number} budget + * @return {number} + */ +const maximumProfit = function(present, future, budget) { + const dp = new Array(budget + 1).fill(0); + for (let i = 0; i < present.length; i++){ + for (let j = budget; j >= 0; j--){ + if (j >= present[i] && present[i] < future[i]){ + dp[j] = Math.max(dp[j], dp[j - present[i]] + future[i] - present[i]); + } + } + } + return dp[budget]; +}; From 18ad49bb95a64894cc95143fb4c241fe2d92fed3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 13 Dec 2022 22:59:55 +0800 Subject: [PATCH 1164/2039] Update 2488-count-subarrays-with-median-k.js --- 2488-count-subarrays-with-median-k.js | 33 ++++++++++++++------------- 1 file changed, 17 insertions(+), 16 deletions(-) diff --git a/2488-count-subarrays-with-median-k.js b/2488-count-subarrays-with-median-k.js index d1577b75..54a7d129 100644 --- a/2488-count-subarrays-with-median-k.js +++ b/2488-count-subarrays-with-median-k.js @@ -6,21 +6,22 @@ const countSubarrays = (a, k) => permutationArrayWithMedianK(a, k); const permutationArrayWithMedianK = (a, k) => { - let m = new Map([[0, 1]]), find = false, balance = 0, res = 0; - for (const x of a) { - if (x < k) { - balance--; - } else if (x > k) { - balance++; - } else { - find = true; - } - if (find) { - // balance - 1, subarray length is even, has one more right - res += (m.get(balance) || 0) + (m.get(balance - 1) || 0); - } else { - m.set(balance, m.get(balance) + 1 || 1); - } + const m = new Map([[0, 1]]) + let find = false, balance = 0, res = 0; + for (const x of a) { + if (x < k) { + balance--; + } else if (x > k) { + balance++; + } else { + find = true; } - return res; + if (find) { + // balance - 1, subarray length is even, has one more right + res += (m.get(balance) || 0) + (m.get(balance - 1) || 0); + } else { + m.set(balance, (m.get(balance) || 0) + 1); + } + } + return res; }; From 7755c18b069c5ecc4d3fb6658973d5a05d5e4b70 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Dec 2022 16:50:13 +0800 Subject: [PATCH 1165/2039] Update 743-network-delay-time.js --- 743-network-delay-time.js | 101 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 101 insertions(+) diff --git a/743-network-delay-time.js b/743-network-delay-time.js index a827a9ca..bf562c67 100644 --- a/743-network-delay-time.js +++ b/743-network-delay-time.js @@ -1,3 +1,104 @@ +/** + * @param {number[][]} times + * @param {number} n + * @param {number} k + * @return {number} + */ +const networkDelayTime = function(times, n, k) { + const graph = {} + for(const [u, v, w] of times) { + if(graph[u] == null) graph[u] = [] + graph[u][v] = w + } + const visited = new Array(n + 1).fill(false) + const pq = new PQ((a, b) => a[0] < b[0]) + pq.push([0, k]) + let res = 0 + while(!pq.isEmpty()) { + const [dist, cur] = pq.pop() + if(visited[cur]) continue + visited[cur] = true + n-- + res = dist + if(graph[cur]) { + for(const nxt of Object.keys(graph[cur])) { + pq.push([res + graph[cur][nxt], nxt]) + } + } + } + return n === 0 ? res : -1 +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number[][]} times * @param {number} N From 602afceebcad445537d965e0b49a7c870eade761 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 17 Dec 2022 13:41:40 +0800 Subject: [PATCH 1166/2039] Create 2503-maximum-number-of-points-from-grid-queries.js --- ...imum-number-of-points-from-grid-queries.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 2503-maximum-number-of-points-from-grid-queries.js diff --git a/2503-maximum-number-of-points-from-grid-queries.js b/2503-maximum-number-of-points-from-grid-queries.js new file mode 100644 index 00000000..fbc8688f --- /dev/null +++ b/2503-maximum-number-of-points-from-grid-queries.js @@ -0,0 +1,44 @@ +/** + * @param {number[][]} grid + * @param {number[]} queries + * @return {number[]} + */ +const maxPoints = function (grid, queries) { + const heap = new MinPriorityQueue({ + compare: ({ value: valueA }, { value: valueB }) => valueA - valueB, + }) + + const enqueue = (r, c) => { + if ( + 0 <= r && + r < grid.length && + 0 <= c && + c < grid[0].length && + grid[r][c] !== null + ) { + heap.enqueue({ row: r, col: c, value: grid[r][c] }) + grid[r][c] = null + } + } + enqueue(0, 0) + let count = 0 + const map = {} + const sortedQueries = [...queries].sort((x, y) => x - y) + + for (const query of sortedQueries) { + while (!heap.isEmpty()) { + const { row, col, value } = heap.front() + if (query <= value) break + heap.dequeue() + enqueue(row + 1, col) + enqueue(row - 1, col) + enqueue(row, col + 1) + enqueue(row, col - 1) + ++count + } + + map[query] = count + } + + return queries.map((query) => map[query]) +} From af301b911a885701e59ebf2561a804e918887730 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Dec 2022 20:47:50 +0800 Subject: [PATCH 1167/2039] Update 2493-divide-nodes-into-the-maximum-number-of-groups.js --- ...nodes-into-the-maximum-number-of-groups.js | 90 +++++++++++++++++++ 1 file changed, 90 insertions(+) diff --git a/2493-divide-nodes-into-the-maximum-number-of-groups.js b/2493-divide-nodes-into-the-maximum-number-of-groups.js index 738d09c3..371bf321 100644 --- a/2493-divide-nodes-into-the-maximum-number-of-groups.js +++ b/2493-divide-nodes-into-the-maximum-number-of-groups.js @@ -1,3 +1,93 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +const magnificentSets = function (n, edges) { + function getComponents(n) { + let visited = Array(n + 1).fill(false); + let ans = []; + for (let i = 1; i <= n; i++) { + if (!visited[i]) { + ans.push(visit(i, [], visited)); + } + } + return ans; + } + + function visit(cur, nodes, visited) { + visited[cur] = true; + nodes.push(cur); + for (let next of map.get(cur)) { + // skip if you have already visited this node + if (visited[next]) continue; + visit(next, nodes, visited); + } + return nodes; + } + + function find(node, n) { + let group = Array(n + 1).fill(-1); + + let queue = []; + queue.push(node); + let groups = 0; + while (queue.length > 0) { + let k = queue.length; + // store nodes in set to avoid duplicates + let set = new Set(); + while (k-- > 0) { + let cur = queue.shift(); + // this case occurs when 2 nodes in the same level are connected + // so, return -1 + if (group[cur] != -1) return -1; + group[cur] = groups; + for (let next of map.get(cur)) { + if (group[next] == -1) { + set.add(next); + } + } + } + for (let val of set) queue.push(val); + groups++; + } + return groups; + } + + let map = new Map(); // Integer -> List + for (let i = 1; i <= n; i++) { + map.set(i, []); + } + // adjacency list + for (let edge of edges) { + let u = edge[0], + v = edge[1]; + map.get(u).push(v); + map.get(v).push(u); + } + + // get all components as Graph can be disconnected + let components = getComponents(n); + + let ans = 0; + /* + - Take each component and get max groups can be formed from that component + - return -1 if you can't form groups from any one of the components + */ + for (let component of components) { + let groups = -1; + for (let node of component) { + groups = Math.max(groups, find(node, n)); + } + if (groups == -1) return -1; + ans += groups; + } + + return ans; +}; + +// another + /////////////////////// Template //////////////////////////////////////// const initializeGraph = (n) => { let g = []; for (let i = 0; i < n; i++) { g.push([]); } return g; }; const packUG = (g, edges) => { for (const [u, v] of edges) { g[u].push(v); g[v].push(u); } }; From b52c7886cb1d5ce4ed103d1bccff017e7fce8a8d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Dec 2022 14:56:53 +0800 Subject: [PATCH 1168/2039] Update 2430-maximum-deletions-on-a-string.js --- 2430-maximum-deletions-on-a-string.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2430-maximum-deletions-on-a-string.js b/2430-maximum-deletions-on-a-string.js index 77c6684b..957e9712 100644 --- a/2430-maximum-deletions-on-a-string.js +++ b/2430-maximum-deletions-on-a-string.js @@ -1,3 +1,30 @@ +/** + * @param {string} s + * @return {number} + */ +const deleteString = function (s) { + const dp = Array(4000).fill(0), lps = Array(4000).fill(0) + for (let k = s.length - 1; k >= 0; --k) { + dp[k] = 1; + for (let i = 1, j = 0; dp[k] <= s.length - i - k + 1; ++i) { + while (j && s[i + k] != s[j + k]) j = Math.max(0, lps[j] - 1); + j += s[i + k] == s[j + k]; + lps[i] = j; + if (i % 2) { + const len = ~~((i + 1) / 2); + if (lps[len * 2 - 1] == len) { + dp[k] = Math.max(dp[k], 1 + dp[k + len]); + } + } + } + } + return dp[0]; +} + + +// another + + /** * @param {string} s * @return {number} From 818ca90ed17b2b2024822307d97271ab8f0373c0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Dec 2022 15:44:58 +0800 Subject: [PATCH 1169/2039] Update 2430-maximum-deletions-on-a-string.js --- 2430-maximum-deletions-on-a-string.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/2430-maximum-deletions-on-a-string.js b/2430-maximum-deletions-on-a-string.js index 957e9712..4f04ae64 100644 --- a/2430-maximum-deletions-on-a-string.js +++ b/2430-maximum-deletions-on-a-string.js @@ -1,3 +1,27 @@ +/** + * @param {string} s + * @return {number} + */ +const deleteString = function (s) { + const dp = Array(4000).fill(0) + const n = s.length + return helper(0) + + function helper(i) { + if(dp[i] === 0) { + dp[i] = 1 + for(let len = 1; dp[i] <= n - i - len; len++) { + if(s.slice(i, i + len) === s.slice(i + len, i + 2 * len)) { + dp[i] = Math.max(dp[i], 1 + helper(i + len)) + } + } + } + return dp[i] + } +} + +// another + /** * @param {string} s * @return {number} From 24d2e123a55e630082aac431febeccc2a39990e0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Dec 2022 08:58:13 +0800 Subject: [PATCH 1170/2039] Update 2272-substring-with-largest-variance.js --- 2272-substring-with-largest-variance.js | 61 +++++++++++-------------- 1 file changed, 27 insertions(+), 34 deletions(-) diff --git a/2272-substring-with-largest-variance.js b/2272-substring-with-largest-variance.js index 3a1d7aa1..d31fb2bd 100644 --- a/2272-substring-with-largest-variance.js +++ b/2272-substring-with-largest-variance.js @@ -2,42 +2,35 @@ * @param {string} s * @return {number} */ -const largestVariance = function (s) { - const freq = new Array(26).fill(0) - const ac = 'a'.charCodeAt(0) - for (let i = 0; i < s.length; i++) freq[s.charCodeAt(i) - ac]++ - - // console.log(freq) - let maxVariance = 0 - for (let a = 0; a < 26; a++) { - for (let b = 0; b < 26; b++) { - let remainingA = freq[a] - let remainingB = freq[b] - if (a == b || remainingA == 0 || remainingB == 0) continue - - // run kadanes on each possible character pairs (A & B) - let currBFreq = 0, - currAFreq = 0 - for (let i = 0; i < s.length; i++) { - let c = s.charCodeAt(i) - ac - - if (c == b) currBFreq++ - if (c == a) { - currAFreq++ - remainingA-- - } - if (currAFreq > 0) { - maxVariance = Math.max(maxVariance, currBFreq - currAFreq) - } - - - if (currBFreq < currAFreq && remainingA >= 1) { - currBFreq = 0 - currAFreq = 0 +const largestVariance = (s) => { + let se = new Set(s), + n = s.length, + res = 0 + for (const x of se) { + // max + for (const y of se) { + // min + if (x != y) { + let pre = Array(n + 1).fill(0), + preX, + preY, + diff = 0 + for (let i = 0; i < n; i++) { + if (s[i] == x) { + preX = i + 1 + diff++ + } + if (s[i] == y) { + preY = i + 1 + diff-- + } + pre[i + 1] = Math.min(pre[i], diff) + if (preX == undefined || preY == undefined) continue + res = Math.max(res, diff - pre[Math.min(preX, preY) - 1]) } } } } - - return maxVariance + return res } + From 94a7a97727719bd56fffe19d5783b8b7dc7e1b6a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Dec 2022 21:17:52 +0800 Subject: [PATCH 1171/2039] Create 2484-count-palindromic-subsequences.js --- 2484-count-palindromic-subsequences.js | 31 ++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2484-count-palindromic-subsequences.js diff --git a/2484-count-palindromic-subsequences.js b/2484-count-palindromic-subsequences.js new file mode 100644 index 00000000..fef523ab --- /dev/null +++ b/2484-count-palindromic-subsequences.js @@ -0,0 +1,31 @@ +const initialize2DArray = (n, m) => { + let d = [] + for (let i = 0; i < n; i++) { + let t = Array(m).fill(0) + d.push(t) + } + return d +} + +const mod = 1e9 + 7 +/** + * @param {string} s + * @return {number} + */ +const countPalindromes = (s) => { + let res = 0, + n = s.length, + cnt = Array(10).fill(0) + for (let i = 0; i < n; i++) { + let tot = 0 + for (let j = n - 1; j > i; j--) { + if (s[i] == s[j]) { + res += tot * (j - i - 1) + res %= mod + } + tot += cnt[s[j] - "0"] + } + cnt[s[i] - "0"]++ + } + return res +} From 7db705c3245b637cd56c38e69499f2ae35357b14 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Dec 2022 19:50:50 +0800 Subject: [PATCH 1172/2039] Update 494-target-sum.js --- 494-target-sum.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/494-target-sum.js b/494-target-sum.js index 8fe84b51..aa4dc673 100755 --- a/494-target-sum.js +++ b/494-target-sum.js @@ -1,3 +1,36 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +const findTargetSumWays = function(nums, target) { + const sum = nums.reduce((a, b) => a+b); + + if(Math.abs(target) > sum) { + return 0; + } + + if((target + sum) % 2) { + return 0; + } + + const halfSum = (target + sum) / 2; + + let dp = new Array(halfSum+1).fill(0); + dp[0] = 1; + + for(let i = 0; i < nums.length; i++) { + for(let j = halfSum; j >= nums[i]; j--) { + dp[j] += dp[j - nums[i]]; + } + } + + return dp[halfSum]; +}; + + +// another + /** * @param {number[]} nums * @param {number} S From bade5617922d318a9c3dffd050c281b37225e499 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Dec 2022 20:06:48 +0800 Subject: [PATCH 1173/2039] Update 494-target-sum.js --- 494-target-sum.js | 15 +++++---------- 1 file changed, 5 insertions(+), 10 deletions(-) diff --git a/494-target-sum.js b/494-target-sum.js index aa4dc673..86e36c48 100755 --- a/494-target-sum.js +++ b/494-target-sum.js @@ -5,30 +5,25 @@ */ const findTargetSumWays = function(nums, target) { const sum = nums.reduce((a, b) => a+b); - if(Math.abs(target) > sum) { return 0; } - if((target + sum) % 2) { return 0; } - - const halfSum = (target + sum) / 2; - - let dp = new Array(halfSum+1).fill(0); + const newTarget = (target + sum) / 2; + let dp = new Array(newTarget+1).fill(0); dp[0] = 1; - for(let i = 0; i < nums.length; i++) { - for(let j = halfSum; j >= nums[i]; j--) { + for(let j = newTarget; j >= nums[i]; j--) { dp[j] += dp[j - nums[i]]; } } - - return dp[halfSum]; + return dp[newTarget]; }; + // another /** From db1c052beec8c0ae3e777a26451b05d2f213aee4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Dec 2022 20:57:17 +0800 Subject: [PATCH 1174/2039] Create 2518-number-of-great-partitions.js --- 2518-number-of-great-partitions.js | 40 ++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2518-number-of-great-partitions.js diff --git a/2518-number-of-great-partitions.js b/2518-number-of-great-partitions.js new file mode 100644 index 00000000..7f2c0e66 --- /dev/null +++ b/2518-number-of-great-partitions.js @@ -0,0 +1,40 @@ +const ll = BigInt, + mod = 1e9 + 7, + bmod = ll(mod) +const sm = (a) => a.reduce((x, y) => x + y, 0) +const powmod = (a, b, mod) => { + let r = 1n + while (b > 0n) { + if (b % 2n == 1) r = (r * a) % mod + b >>= 1n + a = (a * a) % mod + } + return r +} +const minus_mod = (x, y, mod) => (((x - y) % mod) + mod) % mod +const knapsack_01 = (a, k) => { + if (sm(a) < 2 * k) return 0 + let dp = Array(k).fill(0) + dp[0] = 1 + for (const x of a) { + for (let j = k - 1; j > x - 1; j--) { + dp[j] += dp[j - x] + dp[j] %= mod + } + } + let bad = ll(sm(dp) * 2), + tot = powmod(2n, ll(a.length), bmod), + good = minus_mod(tot, bad, bmod) + return good +} +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countPartitions = function(nums, k) { + return knapsack_01(nums, k) +}; + + + From 19c71dc3a84b3a8164f6d8b0814d174a0189f4f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Jan 2023 13:22:24 +0800 Subject: [PATCH 1175/2039] Create 2521-distinct-prime-factors-of-product-of-array.js --- ...tinct-prime-factors-of-product-of-array.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2521-distinct-prime-factors-of-product-of-array.js diff --git a/2521-distinct-prime-factors-of-product-of-array.js b/2521-distinct-prime-factors-of-product-of-array.js new file mode 100644 index 00000000..cf2c349b --- /dev/null +++ b/2521-distinct-prime-factors-of-product-of-array.js @@ -0,0 +1,40 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var distinctPrimeFactors = function(nums) { + const primes = getPrime(1000) + const ans = new Set() + nums.forEach(it => { + let cur = it + ans.add(primes[cur]) + while (primes[cur] != 1) { + ans.add(primes[cur]) + cur /= primes[cur] + } + ans.add(cur) + }) + ans.delete(1) + + return ans.size + + function getPrime(k) { + const minPrime = new Array(k + 1).fill(1) + let p = 2 + while (p <= k) { + let i = p + while (p <= k / i) { + if (minPrime[i * p] == 1) { + minPrime[i * p] = p + } + i++ + } + p++ + while (p <= k) { + if (minPrime[p] == 1) break + p++ + } + } + return minPrime + } +}; From 8139ac0a929d4f47243f9101a224b20aadedf4ba Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 2 Jan 2023 19:19:52 +0800 Subject: [PATCH 1176/2039] Update 2401-longest-nice-subarray.js --- 2401-longest-nice-subarray.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/2401-longest-nice-subarray.js b/2401-longest-nice-subarray.js index 0af71e12..9cd9ef95 100644 --- a/2401-longest-nice-subarray.js +++ b/2401-longest-nice-subarray.js @@ -1,3 +1,26 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const longestNiceSubarray = function (nums) { + let res = 1, i = 0, j = 0, mask = 0 + const n = nums.length + for(i = 0; i < n; i++) { + const cur = nums[i] + while((cur & mask) !== 0) { + mask ^= nums[j] + j++ + } + mask |= cur + // console.log(i, j, mask, i - j +1) + res = Math.max(res, i - j + 1) + } + + return res +} + +// another + /** * @param {number[]} nums * @return {number} From 78c9926874381f8e01b018b003edf09e6bbe87fa Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 3 Jan 2023 17:20:33 +0800 Subject: [PATCH 1177/2039] Update 2354-number-of-excellent-pairs.js --- 2354-number-of-excellent-pairs.js | 32 +++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2354-number-of-excellent-pairs.js b/2354-number-of-excellent-pairs.js index aec51380..b610661b 100644 --- a/2354-number-of-excellent-pairs.js +++ b/2354-number-of-excellent-pairs.js @@ -1,3 +1,35 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countExcellentPairs = function(nums, k) { + const cnt = Array(31).fill(0), set = new Set(nums) + for(const e of set) { + cnt[setBits(e)]++ + } + let res = 0 + + for(let i = 1; i < 31; i++) { + for(let j = 1; j < 31; j++) { + if(i + j >= k) res += cnt[i] * cnt[j] + } + } + + return res + + function setBits(num) { + let res = 0 + while(num) { + res += num % 2 + num = num >> 1 + } + return res + } +}; + +// another + /** * @param {number[]} nums * @param {number} k From bdcb0f8e9b4d4b59ffc19f5db96cfb6d858124df Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 4 Jan 2023 13:47:00 +0800 Subject: [PATCH 1178/2039] Update 2411-smallest-subarrays-with-maximum-bitwise-or.js --- ...llest-subarrays-with-maximum-bitwise-or.js | 20 ++++++++++--------- 1 file changed, 11 insertions(+), 9 deletions(-) diff --git a/2411-smallest-subarrays-with-maximum-bitwise-or.js b/2411-smallest-subarrays-with-maximum-bitwise-or.js index 0c5f82b2..6f00bf51 100644 --- a/2411-smallest-subarrays-with-maximum-bitwise-or.js +++ b/2411-smallest-subarrays-with-maximum-bitwise-or.js @@ -2,14 +2,16 @@ * @param {number[]} nums * @return {number[]} */ -const smallestSubarrays = function(nums) { - const n = nums.length, last = Array(30).fill(0), res = []; - for (let i = n - 1; i >= 0; --i) { - res[i] = 1; - for (let j = 0; j < 30; ++j) { - if ((nums[i] & (1 << j)) > 0) last[j] = i; - res[i] = Math.max(res[i], last[j] - i + 1); +const smallestSubarrays = function (nums) { + const n = nums.length, + last = Array(30).fill(0), + res = [] + for (let i = n - 1; i >= 0; i--) { + res[i] = 1 + for (let j = 0; j < 30; j++) { + if ((nums[i] & (1 << j)) > 0) last[j] = i + res[i] = Math.max(res[i], last[j] - i + 1) } } - return res; -}; + return res +} From 4608d03f70dc7fe07d1ad2061bf6798cc5d20992 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 Jan 2023 10:12:53 +0800 Subject: [PATCH 1179/2039] Update 2461-maximum-sum-of-distinct-subarrays-with-length-k.js --- ...sum-of-distinct-subarrays-with-length-k.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/2461-maximum-sum-of-distinct-subarrays-with-length-k.js b/2461-maximum-sum-of-distinct-subarrays-with-length-k.js index f2d9bb8e..932c8383 100644 --- a/2461-maximum-sum-of-distinct-subarrays-with-length-k.js +++ b/2461-maximum-sum-of-distinct-subarrays-with-length-k.js @@ -1,3 +1,38 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumSubarraySum = function (nums, k) { + const map = new Map(), n = nums.length + let i = 0, res = 0, sum = 0 + + while(i < n && i < k) { + const cur = nums[i] + map.set(cur, (map.get(cur) || 0) + 1 ) + sum += cur + i++ + } + if(map.size === k) res = sum + + for(i = k; i < n; i++) { + const cur = nums[i] + map.set(cur, (map.get(cur) || 0) + 1) + const pre = nums[i - k] + map.set(pre, (map.get(pre) || 0) - 1) + if(map.get(pre) === 0) map.delete(pre) + + sum += cur + sum -= nums[i - k] + + if(map.size === k) res = Math.max(res, sum) + } + + return res +} + +// another + /** * @param {number[]} nums * @param {number} k From 2d22a26ee82535552436a749c97c72c2f2428ef2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 Jan 2023 21:38:20 +0800 Subject: [PATCH 1180/2039] Create 2422-merge-operations-to-turn-array-into-a-palindrome.js --- ...rations-to-turn-array-into-a-palindrome.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2422-merge-operations-to-turn-array-into-a-palindrome.js diff --git a/2422-merge-operations-to-turn-array-into-a-palindrome.js b/2422-merge-operations-to-turn-array-into-a-palindrome.js new file mode 100644 index 00000000..cc6be2d3 --- /dev/null +++ b/2422-merge-operations-to-turn-array-into-a-palindrome.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumOperations = function(nums) { + const n = nums.length + let left = nums[0], right = nums[n - 1] + let cnt = 0; + for (let i = 0, j = n - 1; i < j;) { + if (left === right) { + i++; + j--; + left = nums[i]; + right = nums[j]; + } else if (left < right) { + i++; + left += nums[i]; + cnt++; + } else if (left > right) { + j--; + right += nums[j]; + cnt++; + } + } + return cnt; +}; From a3511319a2f880f758386b3e5a4f6a9410e407ba Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Jan 2023 19:57:23 +0800 Subject: [PATCH 1181/2039] Create 2516-take-k-of-each-character-from-left-and-right.js --- ...k-of-each-character-from-left-and-right.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2516-take-k-of-each-character-from-left-and-right.js diff --git a/2516-take-k-of-each-character-from-left-and-right.js b/2516-take-k-of-each-character-from-left-and-right.js new file mode 100644 index 00000000..f917b2db --- /dev/null +++ b/2516-take-k-of-each-character-from-left-and-right.js @@ -0,0 +1,28 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const takeCharacters = function(s, k) { + const cnt = {a: 0, b: 0, c: 0} + const n = s.length + for(const ch of s) { + cnt[ch]++ + } + if(cnt.a < k || cnt.b < k || cnt.c < k) return -1 + const limits = { a: cnt.a - k, b: cnt.b - k, c: cnt.c - k } + let l = 0, r = 0, res = 0 + const hash = {a: 0, b: 0, c: 0} + for(; r < n; r++) { + const cur = s[r] + hash[cur]++ + while(hash[cur] > limits[cur]) { + hash[s[l]]-- + l++ + } + + res = Math.max(res, r - l + 1) + } + + return n - res +}; From d602111da571c32d4c5bd3f562c9dc2d2d2921bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Jan 2023 18:28:58 +0800 Subject: [PATCH 1182/2039] Create 2531-make-number-of-distinct-characters-equal.js --- ...ake-number-of-distinct-characters-equal.js | 53 +++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 2531-make-number-of-distinct-characters-equal.js diff --git a/2531-make-number-of-distinct-characters-equal.js b/2531-make-number-of-distinct-characters-equal.js new file mode 100644 index 00000000..df247fbf --- /dev/null +++ b/2531-make-number-of-distinct-characters-equal.js @@ -0,0 +1,53 @@ +/** + * @param {string} word1 + * @param {string} word2 + * @return {boolean} + */ +const isItPossible = function(word1, word2) { + const map1 = new Array(26).fill(0); + const map2 = new Array(26).fill(0); + + const a = 'a'.charCodeAt(0) + // store frequency of characters + for (const ch of word1) map1[ch.charCodeAt(0)-a]++; + for (const ch of word2) map2[ch.charCodeAt(0)-a]++; + + for (let i = 0; i < 26; i++) { + if (map1[i] === 0) continue; + for (let j = 0; j < 26; j++) { + if (map2[j] === 0) continue; + + // increase freq of char2 and decrease freq of char1 in map1 + map1[j]++; + map1[i]--; + + // increase freq of char1 and decrease freq of char2 in map2 + map2[i]++; + map2[j]--; + + // if equal number of unique characters, return true + if (same(map1, map2)) return true; + + // revert back changes + map1[j]--; + map1[i]++; + map2[i]--; + map2[j]++; + } + } + + return false; + + // check if both maps contain equal number of unique characters + function same( map1, map2) { + let count1 = 0; + let count2 = 0; + for (let i = 0; i < 26; i++) { + if (map1[i] > 0) count1++; + if (map2[i] > 0) count2++; + } + + return count1 === count2; + } +}; + From 21876f448010a47d2c9fbcc28830912183ba67f3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Jan 2023 18:31:18 +0800 Subject: [PATCH 1183/2039] Create 2530-maximal-score-after-applying-k-operations.js --- ...ximal-score-after-applying-k-operations.js | 86 +++++++++++++++++++ 1 file changed, 86 insertions(+) create mode 100644 2530-maximal-score-after-applying-k-operations.js diff --git a/2530-maximal-score-after-applying-k-operations.js b/2530-maximal-score-after-applying-k-operations.js new file mode 100644 index 00000000..951db8f0 --- /dev/null +++ b/2530-maximal-score-after-applying-k-operations.js @@ -0,0 +1,86 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maxKelements = function(nums, k) { + const pq = new PQ((a, b) => a > b) + for(const e of nums) pq.push(e) + let res = 0 + while(k) { + const tmp = pq.pop() + res += tmp + pq.push(Math.ceil(tmp / 3)) + k-- + } + + return res +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 2ed330370d4bc52edc5422ea35d236b322d0ec56 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Jan 2023 19:49:09 +0800 Subject: [PATCH 1184/2039] Create 2529-maximum-count-of-positive-integer-and-negative-integer.js --- ...unt-of-positive-integer-and-negative-integer.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2529-maximum-count-of-positive-integer-and-negative-integer.js diff --git a/2529-maximum-count-of-positive-integer-and-negative-integer.js b/2529-maximum-count-of-positive-integer-and-negative-integer.js new file mode 100644 index 00000000..d8f6a42f --- /dev/null +++ b/2529-maximum-count-of-positive-integer-and-negative-integer.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumCount = function(nums) { + let pos = 0, neg = 0 + + for(const e of nums) { + if(e > 0) pos++ + else if(e < 0) neg++ + } + + return Math.max(pos, neg) +}; From 9d9ad5b11e00bcc0d539fdc2685db0bf1cf90f50 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Jan 2023 20:03:32 +0800 Subject: [PATCH 1185/2039] Update 236-lowest-common-ancestor-of-a-binary-tree.js --- ...lowest-common-ancestor-of-a-binary-tree.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/236-lowest-common-ancestor-of-a-binary-tree.js b/236-lowest-common-ancestor-of-a-binary-tree.js index 002557fa..c0b40692 100644 --- a/236-lowest-common-ancestor-of-a-binary-tree.js +++ b/236-lowest-common-ancestor-of-a-binary-tree.js @@ -55,3 +55,26 @@ const lowestCommonAncestor = function(root, p, q) { if(left && right) return root; return left ? left : right; }; + +// another + +/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ +/** + * @param {TreeNode} root + * @param {TreeNode} p + * @param {TreeNode} q + * @return {TreeNode} + */ +const lowestCommonAncestor = function(root, p, q) { + if(root == null || root === p || root === q) return root + const left = lowestCommonAncestor(root.left, p, q) + const right = lowestCommonAncestor(root.right, p, q) + if(left && right) return root + return left || right +}; From 9dad5df0b0dde568355c6cdcb7ffaadea0b2dd2b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Jan 2023 20:08:47 +0800 Subject: [PATCH 1186/2039] Update 1644-lowest-common-ancestor-of-a-binary-tree-ii.js --- ...est-common-ancestor-of-a-binary-tree-ii.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1644-lowest-common-ancestor-of-a-binary-tree-ii.js b/1644-lowest-common-ancestor-of-a-binary-tree-ii.js index 32c2a70a..bd9407bb 100644 --- a/1644-lowest-common-ancestor-of-a-binary-tree-ii.js +++ b/1644-lowest-common-ancestor-of-a-binary-tree-ii.js @@ -33,3 +33,41 @@ const lowestCommonAncestor = function (root, p, q) { dfs(root) return cn } + +// another + +/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ +/** + * @param {TreeNode} root + * @param {TreeNode} p + * @param {TreeNode} q + * @return {TreeNode} + */ +const lowestCommonAncestor = function (root, p, q) { + let hasP = false, hasQ = false + const res = LCA(root, p, q) + return hasP && hasQ ? res : null + + function LCA(root, p, q) { + if(root == null) return root + const left = LCA(root.left, p, q) + const right = LCA(root.right, p, q) + if(root === p) { + hasP = true + return root + } + if(root === q) { + hasQ = true + return root + } + if(left && right) return root + return left || right + } +} + From a736e694f5724616a8ff4b4646928c0bdb3fe24d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 11 Jan 2023 21:14:29 +0800 Subject: [PATCH 1187/2039] Update 865-smallest-subtree-with-all-the-deepest-nodes.js --- ...lest-subtree-with-all-the-deepest-nodes.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/865-smallest-subtree-with-all-the-deepest-nodes.js b/865-smallest-subtree-with-all-the-deepest-nodes.js index ad7fa163..cea0b7a0 100755 --- a/865-smallest-subtree-with-all-the-deepest-nodes.js +++ b/865-smallest-subtree-with-all-the-deepest-nodes.js @@ -26,3 +26,37 @@ function result(node, dist) { this.node = node; this.dist = dist; } + +// another + +/** + * 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 {TreeNode} + */ +const subtreeWithAllDeepest = function(root) { + let res = null, maxDepth = 0 + dfs(root, 0) + + return res + + function dfs(node, depth) { + if(node == null) return depth - 1 + + const left = dfs(node.left, depth + 1) + const right = dfs(node.right, depth + 1) + maxDepth = Math.max(maxDepth, left, right) + + if(left === maxDepth && right === maxDepth) { + res = node + } + return Math.max(left, right) + } +}; From 17b9b9162888ff41fe5671149c98e574a5632d7b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 12 Jan 2023 13:57:33 +0800 Subject: [PATCH 1188/2039] Update 1676-lowest-common-ancestor-of-a-binary-tree-iv.js --- ...est-common-ancestor-of-a-binary-tree-iv.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1676-lowest-common-ancestor-of-a-binary-tree-iv.js b/1676-lowest-common-ancestor-of-a-binary-tree-iv.js index f5cb150b..1057137e 100644 --- a/1676-lowest-common-ancestor-of-a-binary-tree-iv.js +++ b/1676-lowest-common-ancestor-of-a-binary-tree-iv.js @@ -20,3 +20,32 @@ const lowestCommonAncestor = function(root, nodes) { if(left && right) return root return left ? left : right }; + +// another + +/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ +/** + * @param {TreeNode} root + * @param {TreeNode[]} nodes + * @return {TreeNode} + */ + const lowestCommonAncestor = function(root, nodes) { + const set = new Set(nodes) + return dfs(root) + + function dfs(node) { + if(node == null) return node + const left = dfs(node.left) + const right = dfs(node.right) + + if(set.has(node)) return node + if(left && right) return node + return left || right + } +}; From 581870421d2fa2952bd594d7ce205956cb7a1b07 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 13 Jan 2023 19:03:12 +0800 Subject: [PATCH 1189/2039] Update 235-lowest-common-ancestor-of-a-binary-search-tree.js --- ...common-ancestor-of-a-binary-search-tree.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/235-lowest-common-ancestor-of-a-binary-search-tree.js b/235-lowest-common-ancestor-of-a-binary-search-tree.js index 482f92e0..205bcf3d 100644 --- a/235-lowest-common-ancestor-of-a-binary-search-tree.js +++ b/235-lowest-common-ancestor-of-a-binary-search-tree.js @@ -1,3 +1,27 @@ +/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ + +/** + * @param {TreeNode} root + * @param {TreeNode} p + * @param {TreeNode} q + * @return {TreeNode} + */ +const lowestCommonAncestor = function(root, p, q) { + if(root == null || root == p || root == q) return root + const left = lowestCommonAncestor(root.left, p, q) + const right = lowestCommonAncestor(root.right, p, q) + if(left && right) return root + return left || right +}; + +// another + /** * Definition for a binary tree node. * function TreeNode(val) { From 51b313279408cc202ed9ccad89baa5f934cf3725 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Jan 2023 20:14:08 +0800 Subject: [PATCH 1190/2039] Create 2538-difference-between-maximum-and-minimum-price-sum.js --- ...e-between-maximum-and-minimum-price-sum.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2538-difference-between-maximum-and-minimum-price-sum.js diff --git a/2538-difference-between-maximum-and-minimum-price-sum.js b/2538-difference-between-maximum-and-minimum-price-sum.js new file mode 100644 index 00000000..ba08e423 --- /dev/null +++ b/2538-difference-between-maximum-and-minimum-price-sum.js @@ -0,0 +1,34 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} price + * @return {number} + */ +const maxOutput = function(n, edges, price) { + const tree = []; + const memo = []; + for (let i = 0; i < n; i++) tree[i] = []; + for (const [a, b] of edges) { + tree[a].push(b); + tree[b].push(a); + } + + let result = 0; + dfs(0, -1); + + function dfs(node, parent) { + const max = [price[node], 0]; + const nodes = tree[node] ?? []; + for (const child of nodes) { + if (child === parent) continue; + const sub = dfs(child, node); + result = Math.max(result, max[0] + sub[1]); + result = Math.max(result, max[1] + sub[0]); + max[0] = Math.max(max[0], sub[0] + price[node]); + max[1] = Math.max(max[1], sub[1] + price[node]); + } + return max; + } + + return result; +}; From bcf6d90034e24dc9d7ef583f5a616e67b3b26724 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Jan 2023 18:33:14 +0800 Subject: [PATCH 1191/2039] Update 1310-xor-queries-of-a-subarray.js --- 1310-xor-queries-of-a-subarray.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1310-xor-queries-of-a-subarray.js b/1310-xor-queries-of-a-subarray.js index efad256d..e2b63cb2 100644 --- a/1310-xor-queries-of-a-subarray.js +++ b/1310-xor-queries-of-a-subarray.js @@ -17,3 +17,26 @@ const xorQueries = function(arr, queries) { }) return res }; + +// another + +/** + * @param {number[]} arr + * @param {number[][]} queries + * @return {number[]} + */ +const xorQueries = function(arr, queries) { + const xorArr = [] + xorArr[0] = 0 + const n = arr.length + for(let i = 0; i < n; i++) { + const cur = arr[i] + xorArr.push(cur ^ xorArr[xorArr.length - 1]) + } + const res = [] + for(const [l, r] of queries) { + res.push(xorArr[r + 1] ^ xorArr[l]) + } + + return res +}; From 561f40017c2b3dc0884b397355c96b7da022fa12 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 30 Jan 2023 19:34:20 +0800 Subject: [PATCH 1192/2039] Update 1734-decode-xored-permutation.js --- 1734-decode-xored-permutation.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1734-decode-xored-permutation.js b/1734-decode-xored-permutation.js index 4b0ecdf9..1ae0f396 100644 --- a/1734-decode-xored-permutation.js +++ b/1734-decode-xored-permutation.js @@ -1,3 +1,24 @@ +/** + * @param {number[]} encoded + * @return {number[]} + */ +const decode = function(encoded) { + const n = encoded.length + 1 + let xor = 0 + for(let i = 1; i <= n; i++) xor ^= i + for(let i = 1; i < n - 1; i += 2) xor ^= encoded[i] + const res = [xor] + let pre = xor + for(let i = 0; i < n - 1; i++) { + res.push(encoded[i] ^ pre) + pre = res[res.length - 1] + } + + return res +}; + +// another + /** * @param {number[]} encoded * @return {number[]} From 77d0c7a8afb6214155a6755f3ca9aab5d3071966 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 1 Feb 2023 19:07:56 +0800 Subject: [PATCH 1193/2039] Update 1835-find-xor-sum-of-all-pairs-bitwise-and.js --- 1835-find-xor-sum-of-all-pairs-bitwise-and.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) diff --git a/1835-find-xor-sum-of-all-pairs-bitwise-and.js b/1835-find-xor-sum-of-all-pairs-bitwise-and.js index 8ada2371..795a8fcf 100644 --- a/1835-find-xor-sum-of-all-pairs-bitwise-and.js +++ b/1835-find-xor-sum-of-all-pairs-bitwise-and.js @@ -1,3 +1,19 @@ +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @return {number} + */ +const getXORSum = function(arr1, arr2) { + let a = 0, b = 0 + for(const e of arr1) a ^= e + for(const e of arr2) b ^= e + + return a & b +}; + + +// another + // On every bit XOR acts as modulo 2 addition and AND acts as modulo 2 multiplication. // The set {0,1} with modulo 2 addition and multiplication is the field GF(2) and the distributive property holds in every field. From 06ca5eb13364483cb831e698dacfc193c3a2d581 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Feb 2023 19:08:00 +0800 Subject: [PATCH 1194/2039] Create 2527-find-xor-beauty-of-array.js --- 2527-find-xor-beauty-of-array.js | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 2527-find-xor-beauty-of-array.js diff --git a/2527-find-xor-beauty-of-array.js b/2527-find-xor-beauty-of-array.js new file mode 100644 index 00000000..077ac29b --- /dev/null +++ b/2527-find-xor-beauty-of-array.js @@ -0,0 +1,9 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const xorBeauty = function(nums) { + let res = 0 + for(const e of nums) res ^= e + return res +}; From 8b459b283c219435f0711ed9dccd20f18d2d56da Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Feb 2023 12:36:09 +0800 Subject: [PATCH 1195/2039] Create 2558-take-gifts-from-the-richest-pile.js --- 2558-take-gifts-from-the-richest-pile.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2558-take-gifts-from-the-richest-pile.js diff --git a/2558-take-gifts-from-the-richest-pile.js b/2558-take-gifts-from-the-richest-pile.js new file mode 100644 index 00000000..2efda9f0 --- /dev/null +++ b/2558-take-gifts-from-the-richest-pile.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} gifts + * @param {number} k + * @return {number} + */ +const pickGifts = function(gifts, k) { + + const n = gifts.length + while(k > 0) { + + const max = Math.max(...gifts) + const idx = gifts.indexOf(max) + gifts[idx] = ~~(Math.sqrt(max)) + + k-- + } + + return gifts.reduce((ac, e) => ac + e, 0) +}; From 976058ad7b18b2fa65b3333015299a4082d0f6f7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Feb 2023 15:38:20 +0800 Subject: [PATCH 1196/2039] Create 2559-count-vowel-strings-in-ranges.js --- 2559-count-vowel-strings-in-ranges.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2559-count-vowel-strings-in-ranges.js diff --git a/2559-count-vowel-strings-in-ranges.js b/2559-count-vowel-strings-in-ranges.js new file mode 100644 index 00000000..ff31c5be --- /dev/null +++ b/2559-count-vowel-strings-in-ranges.js @@ -0,0 +1,27 @@ +/** + * @param {string[]} words + * @param {number[][]} queries + * @return {number[]} + */ +const vowelStrings = function(words, queries) { + const n = words.length + const pre = Array(n + 1).fill(0) + const set = new Set(['a', 'e', 'i', 'o', 'u']) + for(let i = 0; i < n; i++) { + const cur = words[i] + if(set.has(cur[0]) && set.has(cur[cur.length - 1])) pre[i + 1] = 1 + } + + const cnt = Array(n + 1).fill(0) + for(let i = 1; i <= n; i++) { + cnt[i] = cnt[i - 1] + pre[i] + } + + const res = [] + + for(const [l, r] of queries) { + res.push(cnt[r + 1] - cnt[l]) + } + + return res +}; From b3563b1612347c63f97d51a773a76ca7539c6284 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Feb 2023 20:03:40 +0800 Subject: [PATCH 1197/2039] Update 502-ipo.js --- 502-ipo.js | 102 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 102 insertions(+) diff --git a/502-ipo.js b/502-ipo.js index e095989d..9938088e 100644 --- a/502-ipo.js +++ b/502-ipo.js @@ -111,3 +111,105 @@ const findMaximizedCapital = function(k, W, Profits, Capital) { } return W; }; + +// another + +/** + * @param {number} k + * @param {number} w + * @param {number[]} profits + * @param {number[]} capital + * @return {number} + */ +const findMaximizedCapital = function(k, w, profits, capital) { + const capPQ = new PQ((a, b) => a.cap < b.cap) + const proPQ = new PQ((a, b) => a.pro > b.pro) + const n = profits.length + + for(let i = 0; i < n; i++) { + capPQ.push({ cap: capital[i], pro: profits[i] }) + } + + while(k) { + + while(!capPQ.isEmpty() && capPQ.peek().cap <= w) { + proPQ.push(capPQ.pop()) + } + + if(proPQ.isEmpty()) break + + w += proPQ.pop().pro + k-- + } + + + return w +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 9cfa836aa8c562e374ec8fb1ee85a397e407135f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Feb 2023 21:32:34 +0800 Subject: [PATCH 1198/2039] Update 857-minimum-cost-to-hire-k-workers.js --- 857-minimum-cost-to-hire-k-workers.js | 31 +++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/857-minimum-cost-to-hire-k-workers.js b/857-minimum-cost-to-hire-k-workers.js index 028bcf65..9c6ae374 100644 --- a/857-minimum-cost-to-hire-k-workers.js +++ b/857-minimum-cost-to-hire-k-workers.js @@ -61,3 +61,34 @@ function insert(arr, el) { } arr.push(el) } + +// another + +/** + * @param {number[]} quality + * @param {number[]} wage + * @param {number} K + * @return {number} + */ +const mincostToHireWorkers = function(quality, wage, K) { + const workers = [], n = wage.length + for(let i = 0; i < n; i++) { + workers.push([wage[i] / quality[i], quality[i]]) + } + workers.sort((a, b) => a[0] - b[0]) + const pq = new MaxPriorityQueue({ priority: (w) => w.quality }) + let res = Infinity, qualitySum = 0 + for(const worker of workers) { + const [ratio, quality] = worker + qualitySum += quality + pq.enqueue({ quality }) + + if(pq.size() > K) { + qualitySum -= pq.dequeue().element.quality + } + if(pq.size() === K) res = Math.min(res, qualitySum * ratio) + } + + return res +}; + From 2869ef71a2115cd4645bb484e8853b0a261816b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Feb 2023 21:36:08 +0800 Subject: [PATCH 1199/2039] Update 857-minimum-cost-to-hire-k-workers.js --- 857-minimum-cost-to-hire-k-workers.js | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/857-minimum-cost-to-hire-k-workers.js b/857-minimum-cost-to-hire-k-workers.js index 9c6ae374..76914b01 100644 --- a/857-minimum-cost-to-hire-k-workers.js +++ b/857-minimum-cost-to-hire-k-workers.js @@ -75,6 +75,9 @@ const mincostToHireWorkers = function(quality, wage, K) { for(let i = 0; i < n; i++) { workers.push([wage[i] / quality[i], quality[i]]) } + // wage[i] / wage[j] = quality[i] / quality[j] + // wage[i] * quality[j] = wage[j] * quality[i] + // wage[i] / quality[i] = wage[j] / quality[j] workers.sort((a, b) => a[0] - b[0]) const pq = new MaxPriorityQueue({ priority: (w) => w.quality }) let res = Infinity, qualitySum = 0 @@ -92,3 +95,4 @@ const mincostToHireWorkers = function(quality, wage, K) { return res }; + From e9b9c3c784281a10ac33f17b31636309e3cb01cc Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Feb 2023 19:25:05 +0800 Subject: [PATCH 1200/2039] Update 1353-maximum-number-of-events-that-can-be-attended.js --- ...m-number-of-events-that-can-be-attended.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/1353-maximum-number-of-events-that-can-be-attended.js b/1353-maximum-number-of-events-that-can-be-attended.js index 58ec8b08..f0cdc48d 100644 --- a/1353-maximum-number-of-events-that-can-be-attended.js +++ b/1353-maximum-number-of-events-that-can-be-attended.js @@ -220,3 +220,29 @@ function maxEvents(events) { // segmentTree.setAt(i, value) // segmentTree.length class SegmentTree{constructor(t,e,s){if(this.valueLength=t.length,this.identity=e,this.associate=s,0===t.length)this.tree=[];else{const h=2**Math.ceil(Math.log2(t.length))*2-1,i=[];for(let s=0;s<=h>>1;++s)i[(h>>1)+s]=s>1)-1;t>=0;--t)i[t]=s(i[2*t+1],i[2*t+2]);this.tree=i}}get length(){return this.valueLength}getAt(t){return this.tree[t+(this.tree.length>>1)]}queryIn(t,e){let s=this.identity;const h=[[0,0,1+(this.tree.length>>1)]];for(;h.length>0;){const[i,r,n]=h.pop();r>=t&&n<=e?s=this.associate(s,this.tree[i]):r>=e||nthis.tree.length>>1||h.push([2*i+1,r,r+n>>1],[2*i+2,r+n>>1,n])}return s}setAt(t,e){const s=t+(this.tree.length>>1);this.tree[s]=e;let h=s-1>>1;for(;h>=0;)this.tree[h]=this.associate(this.tree[2*h+1],this.tree[2*h+2]),h=h-1>>1}} + + +// another + +/** + * @param {number[][]} events + * @return {number} + */ +function maxEvents(events) { + const pq = new MinPriorityQueue () + events.sort((a, b) => a[0] - b[0]) + let res = 0, i = 0, n = events.length + for(let d = 1; d <= 1e5; d++) { + while(i < n && events[i][0] === d) { + pq.enqueue(events[i++][1]) + } + while(!pq.isEmpty() && pq.front().element < d) { + pq.dequeue() + } + if(!pq.isEmpty()) { + res++ + pq.dequeue() + } + } + return res +} From f2e0126ec564d7198290dac4cf5781f6c43ade22 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 10 Feb 2023 19:19:46 +0800 Subject: [PATCH 1201/2039] Create 2542-maximum-subsequence-score.js --- 2542-maximum-subsequence-score.js | 33 +++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2542-maximum-subsequence-score.js diff --git a/2542-maximum-subsequence-score.js b/2542-maximum-subsequence-score.js new file mode 100644 index 00000000..caadb31d --- /dev/null +++ b/2542-maximum-subsequence-score.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number} + */ +const maxScore = function(nums1, nums2, k) { + const pq = new MinPriorityQueue({ priority: e => e }) + const n = nums1.length + const arr = [] + + for(let i = 0; i < n; i++) { + arr.push([nums1[i], nums2[i]]) + } + + arr.sort((a, b) => b[1] - a[1]) + let res = 0, left = 0 + for(let i = 0; i < n; i++) { + const cur = arr[i] + pq.enqueue(cur[0]) + left += cur[0] + if(pq.size() > k) { + const tmp = pq.dequeue().element + left -= tmp + } + + if(pq.size() === k) { + res = Math.max(res, left * cur[1]) + } + } + + return res +}; From 070ca1efa7b8facc504991ac0d275024958bc620 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Feb 2023 16:38:38 +0800 Subject: [PATCH 1202/2039] Create 2563-count-the-number-of-fair-pairs.js --- 2563-count-the-number-of-fair-pairs.js | 40 ++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2563-count-the-number-of-fair-pairs.js diff --git a/2563-count-the-number-of-fair-pairs.js b/2563-count-the-number-of-fair-pairs.js new file mode 100644 index 00000000..3bdf0771 --- /dev/null +++ b/2563-count-the-number-of-fair-pairs.js @@ -0,0 +1,40 @@ +/** + * @param {number[]} nums + * @param {number} lower + * @param {number} upper + * @return {number} + */ +const countFairPairs = function(nums, lower, upper) { + const n = nums.length + nums.sort((a, b) => a - b) + + let total = BigInt(n * (n - 1)) / 2n + return Number(total - BigInt(large(nums, upper) + low(nums, lower))) +}; + + +function large(arr, target) { + let count = 0; + for (let lo = 0, hi = arr.length - 1; lo < hi; ) { + if (arr[lo] + arr[hi] > target) { + count += (hi - lo); + hi--; + } else { + lo++; + } + } + return count; +} + +function low(arr, target) { + let count = 0; + for (let lo = 0, hi = arr.length - 1; lo < hi; ) { + if (arr[lo] + arr[hi] < target) { + count += (hi - lo); + lo++; + } else { + hi--; + } + } + return count; +} From d5baec98df6e2651107aa482d7f7bbaa70630243 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 13 Feb 2023 19:02:11 +0800 Subject: [PATCH 1203/2039] Update 630-course-schedule-iii.js --- 630-course-schedule-iii.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/630-course-schedule-iii.js b/630-course-schedule-iii.js index f9558beb..c4366e57 100644 --- a/630-course-schedule-iii.js +++ b/630-course-schedule-iii.js @@ -1,3 +1,26 @@ +/** + * @param {number[][]} courses + * @return {number} + */ +const scheduleCourse = function (courses) { + const compare = (a, b) => a[0] === b[0] ? 0 : (a[0] > b[0] ? -1 : 1) + const queue = new PriorityQueue({ compare }) + courses.sort((a, b) => a[1] - b[1]) + let time = 0 + for(let e of courses) { + time += e[0] + queue.enqueue(e) + if(time > e[1]) { + const tmp = queue.dequeue() + time -= tmp[0] + } + } + return queue.size() +} + +// another + + /** * @param {number[][]} courses * @return {number} From 487713041179bed64279377b992495add11da84b Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Feb 2023 20:31:37 +0800 Subject: [PATCH 1204/2039] Create 2523-closest-prime-numbers-in-range.js --- 2523-closest-prime-numbers-in-range.js | 34 ++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2523-closest-prime-numbers-in-range.js diff --git a/2523-closest-prime-numbers-in-range.js b/2523-closest-prime-numbers-in-range.js new file mode 100644 index 00000000..4b06cc56 --- /dev/null +++ b/2523-closest-prime-numbers-in-range.js @@ -0,0 +1,34 @@ +/** + * @param {number} left + * @param {number} right + * @return {number[]} + */ +var closestPrimes = function(left, right) { + let primeArr = []; + let res = [-1, -1]; + let minDiff = Infinity; + + for(let i=left; i<=right; i++){ + if(isPrime(i)) primeArr.push(i) + } + + for(let i=1; i Date: Wed, 15 Feb 2023 20:32:09 +0800 Subject: [PATCH 1205/2039] Update 2163-minimum-difference-in-sums-after-removal-of-elements.js --- ...rence-in-sums-after-removal-of-elements.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/2163-minimum-difference-in-sums-after-removal-of-elements.js b/2163-minimum-difference-in-sums-after-removal-of-elements.js index 938e51e7..862bbe53 100644 --- a/2163-minimum-difference-in-sums-after-removal-of-elements.js +++ b/2163-minimum-difference-in-sums-after-removal-of-elements.js @@ -1,3 +1,51 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumDifference = function(nums) { + const n = nums.length, len = n / 3 + const maxCompare = (p, c) => { return p === c ? 0 : (p > c ? -1 : 1)} + const minCompare = (p, c) => { return p === c ? 0 : (p < c ? -1 : 1)} + const maxHeap = new PriorityQueue({compare: maxCompare}) + const minHeap = new PriorityQueue({compare: minCompare}) + const pre = Array(n).fill(Infinity), suffix = Array(n).fill(-Infinity) + for(let i = 0, sum = 0; i < 2 * len; i++) { + const cur = nums[i] + maxHeap.enqueue(cur) + sum += cur + if(maxHeap.size() > len) { + const tmp = maxHeap.dequeue() + sum -= tmp + } + if(maxHeap.size() === len) { + pre[i] = sum + } + } + + for(let i = n - 1, sum = 0; i >= len; i--) { + const cur = nums[i] + minHeap.enqueue(cur) + sum += cur + if(minHeap.size() > len) { + const tmp = minHeap.dequeue() + sum -= tmp + } + if(minHeap.size() === len) { + suffix[i] = sum + } + } + + // console.log(pre, suffix) + let res = Infinity + for(let i = len - 1; i < n - len; i++) { + res = Math.min(res, pre[i] - suffix[i + 1]) + } + return res +}; + +// another + + /** * @param {number[]} nums * @return {number} From ced9e1f552261cdc94e90824438829a61bb0b4ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Feb 2023 21:05:33 +0800 Subject: [PATCH 1206/2039] Update 1653-minimum-deletions-to-make-string-balanced.js --- ...nimum-deletions-to-make-string-balanced.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/1653-minimum-deletions-to-make-string-balanced.js b/1653-minimum-deletions-to-make-string-balanced.js index ac09dbf2..4cf12446 100644 --- a/1653-minimum-deletions-to-make-string-balanced.js +++ b/1653-minimum-deletions-to-make-string-balanced.js @@ -1,3 +1,23 @@ +/** + * @param {string} s + * @return {number} + */ +const minimumDeletions = function(s) { + let res = 0, b = 0 + for(const e of s) { + if(e === 'b') b++ + else if(b > 0) { + res++ + b-- + } + } + + return res +}; + +// another + + /** * @param {string} s * @return {number} From 40d34be01686032d12f29c910d3beecc19dbf42e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Feb 2023 21:29:05 +0800 Subject: [PATCH 1207/2039] Create 2570-merge-two-2d-arrays-by-summing-values.js --- 2570-merge-two-2d-arrays-by-summing-values.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2570-merge-two-2d-arrays-by-summing-values.js diff --git a/2570-merge-two-2d-arrays-by-summing-values.js b/2570-merge-two-2d-arrays-by-summing-values.js new file mode 100644 index 00000000..5b87f11c --- /dev/null +++ b/2570-merge-two-2d-arrays-by-summing-values.js @@ -0,0 +1,19 @@ +/** + * @param {number[][]} nums1 + * @param {number[][]} nums2 + * @return {number[][]} + */ +var mergeArrays = function(nums1, nums2) { + const map = new Map() + for(const [id, val] of nums1) { + if(!map.has(id)) map.set(id, 0) + map.set(id, map.get(id) + val) + } + for(const [id, val] of nums2) { + if(!map.has(id)) map.set(id, 0) + map.set(id, map.get(id) + val) + } + const entries = [...map.entries()] + entries.sort((a, b) => a[0] - b[0]) + return entries +}; From a533c6a053212ab90cc0d65c8626479e6c4ce2b6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Feb 2023 21:49:45 +0800 Subject: [PATCH 1208/2039] Create 2571-minimum-operations-to-reduce-an-integer-to-0.js --- ...um-operations-to-reduce-an-integer-to-0.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2571-minimum-operations-to-reduce-an-integer-to-0.js diff --git a/2571-minimum-operations-to-reduce-an-integer-to-0.js b/2571-minimum-operations-to-reduce-an-integer-to-0.js new file mode 100644 index 00000000..a395370c --- /dev/null +++ b/2571-minimum-operations-to-reduce-an-integer-to-0.js @@ -0,0 +1,22 @@ +function dec2bin(dec) { + return (dec >>> 0).toString(2); +} +function bitCnt(s) { + let res = 0 + for(const e of s) { + if(e === '1') res++ + } + return res +} +/** + * @param {number} n + * @return {number} + */ +var minOperations = function(n) { + if(n === 0) return 0 + if(bitCnt(dec2bin(n)) === 1) return 1 + const lowBit = n & -n + let low = minOperations(n + lowBit); + let high = minOperations(n - lowBit); + return Math.min(low, high) + 1; +}; From 453f076de85fc643fc2e244e7f2ab9df5226bce5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Feb 2023 22:15:54 +0800 Subject: [PATCH 1209/2039] Add files via upload --- images/689.png | Bin 0 -> 200579 bytes 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 images/689.png diff --git a/images/689.png b/images/689.png new file mode 100644 index 0000000000000000000000000000000000000000..3a19a37adcd9686635b875c58301b8ec154643ee GIT binary patch literal 200579 zcmc$`c{tVW7e4y-rcz0iM9Dm7Rv{wu5Mf72WKO0;5;9a|9x^3Kk|C4|Q5r~MhaxH^ zl}w??ROaE_&#w3TJLg>2`TJbg*SB8n{TZHTt$W?;UTZxOMtil_tlG5dpMU;YqpPDq z`RAX1r|_dhzZ|~_In<&0&p&7W(bZ5j@mVrh<(p*Mn>sSoF+cdE$>@gQQ(I0=W(}jP z>uOid@d;|NWHs~4^MCC8u|t=-Ke6#l?S4B)r_I}A)9cD+Wu5mt)ri?dy{4*Jv(h-e zDx6`N$(Djfh0{JiCqD02YM$|9-F)S74yp(FU*Gzwukx|oP!=I1FcKh41{k;Np`nlBKE5wdR*!-UhSO5QaVdV^& z^z`)S9{PqdsSItdtjzzt*n-^HwAGQ{-`_nRZ&c*)AE|o#?p@KY{e|W=pUO{&q%{1p z|JC2@Kc3cM|2&-ezjayEQeJEjGrt#p^Y+8Yix*id#**(y**v3L&dBlN0+0HL(puBr zQ9APK z^7-Le+PXLPl&m)u-JqAVE+!_1&F+J7tNF+F_JP4ce%*CSO?LgSGqWqEY9x!D--#Y8 z?`6GRx#0Kl^?1-&<0@Rt4j;J+X>EzkUr~d*tOM>BqlX_9#t!u-hglcVenD zO!mY#{mW@-Z6C**RGPNld93E>D1?11z30)bb^FoJoqLt1?fpAwo9r!^k>3CAfR)3S z$G#Rmo#%Tz6*g_&oNpq^ud8NhxkWeOuHSFx&^4QD6^9>JUsDY>GL5X^&C-fdGZjhJ z^T)j`0)D@{WnQ|WSQpAep4UW-RfIJvPc)yB z|GYu6^5xUBOW75@#fV9c8&3^t*szU}_5NYCc)4u41z(9rgEISXnNJp9UQasJ-7K2eV1Enj?D)4=-L;$DdlL3Y*bIIsGIN>6UVV7r!B?QiM8~jY zXVSNCM~Fk+kW^MQW}FSIMA-LU+W1n=2%(62x&;C5e&7JnDrM0#8ZT>!X`QzMcm8ZD7sc|=oisC)X z^$j)Xm@^9t*SLt+5~p|0&&mp(9j?rP4J0NSDyQn9V9-@nUXzysg+_b(`zOwh~8K-!XggszMGQBEJ9lF{%`2oTcSawQS?v zqs_e6g?S@+FNz!rb)Wqv49jiwm=l$LhB-Y~B&QY&Glak00x&`!br^ z-78;lo*u0F{obnSPSCuI#FJl?);m^Bae=@1SjElZ!+iZ6l`4{zb25iqjvlpseNFZ8 z#77sOt5l~O>9y)>cRk1AhL*B2X9~S~^@@Q_>I~le48JZwEI%1bbdLKgOt`O4Wl_N~ z{UmG0+&4KVS6BY+)=&RwRGxLc{di1|{16L@mG7c|C}#2CLTl^(;x@53l?8e1c{Ksl zhp^4xzkicm&QuTc{9qFn-_UDT;je&AmYn>2imM?-vTt~CVc2*4mE6I{KGNj(r#b@U zsGO(8+#ioFzuGryxcJNP%JF9_m8QN1a|HZqW?+{Ik+!Rq@*XskDDPRw!1b< zul5<|n+UT;ZQHi(c(dllc=M7YYwkRm*tBNN8Uky3H)f>g83{`rea$^Kt(2-CY8R^z zIz8TZ;%9kZF?QPg(4lEyqyC{on}4(xRA>0 zSZHzT^GP!og&(&{row`zRyCc+$+E~fWpib$S|9L7^;e=qtaEbSjIYG|r!d-aQ z=l{1&9(*$S<+(?6pRa%CYAb74Z<3zC-wmRMtXw}5knuLny&__G7ON)Z_Ho-)-*4;* z`~(uBwU$4 zL`jF9UAjW%_}ATKJDghhZopL;zO;2m)= zbn%m3Ue<*<=Dcd(5mmZFHy`_Yx?`5}O|C(fg~UFIl)57&h@%AZsC|6!GrgQ=+RdLn z=@$S;O>!tUr_Ed^Q5z+{b%t@}0<3TBEQkyrsZ1~6<&}SDY^o7r zP9gudS;n5;YH{X${+&D2>7$LiCM{}XHd7~d4&JSP@VoWU!E#T5p`jsIaJZC5mj(@{ zdrOv@B%l6S9+t82>js`|Aik+jp*vbOk9LWQiPAeoe9_YSX**(^-sHm8y5)C`wyE-} zDQEOuInih{^K0Pkvy8<#$DfbK_r@yE9BthBL(IGE{OXOK)Geoo4>T$cD>*x0x#oZe z_MOkpfAV@`K#a$n#Nvb4BLcnz3`<7_OPW0Af4`Ttt7X`$GVcYXRct4rr#UWA15q%= z(wiOlGw6!&N6?xuAq%f&P5nz!XU(TR4+m1uEn6**=bHM|r>rghc;@@fm+6Wr>-Wl^ zl?*x03?Nnpyp*y! zZHHSIsK=4HsnM5L6cW?Lb=Q%%h38biOqI<~-tN*m@`5k!!e!-vo$$0QRubVz_{r8y zyaYrk^#t;l0QSevOZuNx%Y52c2A*}hV#XQlOX25(ZeqHM?bs^cZ>f$x134-3z-NW; zd0BbqPkr$X15dg1Wa48K?P0{l#mPG{^Jz(8l?Z}2mibS6{;Zfiw*Ssy0}iVEV#%#i zR{#Y!J>c8_$Dxj{HpdKs(vHAc58!P{lkzM#FWJWoWo54TaBkkW=L)VDz!<~tmiS)P z7S&w`Lz1rL=JjG`cIHW}yH;T4g1=RbD=9Tqn@8abgRZJf+`M_Bx(Vd(SNq~$9f4I7 zt1?=BUTujTLk?vnb0#ZxFJC^ksFfEVf*W$v>m=(5fD(8pE0b@s+3A#m>qst+NfKBk zTnGz!9FLe)@agpM6N{kv-=B_Gujv{0g`r+C*z7*AHj#U=BV(o5~zExwQ!}kg(qRGd-Kh6C9aqz)$9+3SUaQ{L9-DhAe zPqX5b^%D4L7)9(VV!cp8WcQ_*&2kip6ovk4!7q-KfTITkbiU3ir&t9l*svuu^^q8& z9N_P5QxI8T8=c7-EgeqZYVNG7!Ng1{(Ay3$Cyaowyc-#TJB8A{)*+;R0W_6fl#d-S zC^G9wb-Zem5inr`*5kU?j^Sz_GgZ1kPaGc!zgB=;2#cc1bPcZ_0!$cmJ$dqEIQ^kA z*UbI?9YTq92)M20es8{fX{=tW@{+`;0vTj1vAZVBLf3Nbb;q(`A4QY(k8e$K~^(XNnI+v5oKr5Q9Y67WO)3^>UFdD$cTxGr|f&c9}=}_3wd7E&&q=~wzZbC>! zIDNSVqa6bv!5m~$EfcgH>5Sp6QW`oSVL^=^RtswEF3RyIK7Bz z&Zb&6uvN+154u(z4w^r?0C)ri6nee6W3s4qohI`W-=28wqu{l1yC$xgi6NlDwoIzW zm9V3+b|%T@BUlzyQv?@tCT474z7&J8X~FOBH}7Eg?%zH3d1skGtR3Uder~OpP3Ob! zBKdO0zJ34x9Z`y3x4(`=(zQWT>J`6oBt0hD9N&EU^b!f=Gm?Exjdl<05lrNv|JNir zHkR?qmiH|!&q)3>RM!3g#4J_DVO7duKM_I+NrtE)ReQW6VA2Dr5*&dLNVpj?(hP+Y z-(FjS1?nak<(ptl2(r-7XRk6>)`7#m=Lx0#e5xb8DQICloc@WismTUAhEjNBGXKhU zgxC{9rSFS@aM(Yv>AtQg$s;{4;$5S{FBG>H?*h+6dYqk~A5j5UC|F08e&UPNNghO6 zgk{yIz}cZ_4uyp7SjAXpHamoP`Pep2H#avVhu-aOavC9PRpu^8F|hCS5>{n;oeqmI zNtTbzUuMUk%5)*}I=yL*Ino;NdWw~mp&=s0WJiz+@}K4`Z9d+6_wVo9TFVChYs><# zI23g~{N|mC%SeJweDUq;oK-HU2c}EcBDQE)Vbe02_;_KASGJ_o+0&mpvy@T(4A3}@ zJi^0=J1>eIeD-VLOJbCEiLDyiHg&QFWVJ^yapm0mp$^5O*DDckN01%zGh|g7Rctv)!w8_nqlEj** zjj~8DLK)cA+>rqS|H`xl6Fc`<&8*w9WecI=?Z+O)ByT++-`(o2ptH z__T~FL&2R(z$tI zmd<7_zB2RGDRm()XW{j}g%$waGuU$c{SJ&9!)Gk3@OM3QnIhM8k94(QrlKgjDV8 z^gnc=6d<1_=U!{R$0}Mn8!(~`TY%)EjYl;wF!-gV0a(fpExlOk@}45bIz8kb)bQg@ zWn;(u=MInO%-T$JOLk$QUBvN*;_wYK7qA`IPY>cDR6(TDErhQCLa?;8Y<^w7oE5`} z2Jeha0~cpIO6=>_RV@6zBMXB7pU{>_sh$id6Ub;8zp*L_DBk( zy`rqKV?gAm*}I}T9+2RT&{ZE^yV~f^!uwyIu?3f2lwzo}m-*Gxu{hsBtl`mH_+mB+2+HjQy_@O-Q zU9-x3+Oa(cDrYtjl>q#O2y9At-Ip0ETutLsKrBN%*e>Z>8qqUJ25BH!EEaI_712CK zI;)wPXDGrfX7`V6F=lB_!`9lx?W%?Tduf}~I$pKy8X@2vka10tdCv2gv4S*~s7nkls9W$&;mosq3+U>t>QTOcpYNCwFFV2k>5=hq;t(haGt#fewjNdzT|;D)XHj{}-L0VHGK!grBDCB8b+ z#`>3yzN_!`+_rstk|R#{f-(1lQgy z^CH`2&}25khNSl8>hmB=#wHaKb={%$)0;1!`AZUOYHEhNtThYb#$hgSQlX)jkg=_ zt}X$aL(&iGj$9y=##4tz;e$j}irx8LSmN=B8WDv5&hkXeHy?mXBE~F-BfCl0LSOda$SN?g8~IvwC2(edXilG? z?1O^LATt2f180E-58;;-5tN#;AT6 zEH+T0l*V50VGTsnUU`mGtpL1KK@2uP_;|&pz9TJ%k`GnmT>)+b(gJ~P`>ON*@~VNC zVL@WM2OlDIAx8tvO&PK&tTBgDVlD-y#*dKn0Q>BVw5;v1udMr%->kK4P-2kUlGi1Y zPgMBp8uNw;KhUlRP{7%C`E5h$&(RJj6mb!UPVss@b7s)u0+5Ll8V3=G85IYm3T&dQ z*wi_w2<#+hy1YFKv>}bi;gEYyjMWLfNwbg$qcJ+rd>U{JZJ=9%U`2SYa^(BNr(=lV zh_{t>sAqWyJyV0uMI3vcw%$-FK4(vg=NkjLqQ0xAi}BIXxBCn|2$Qs}S%n-_0pI|p zvS{UV8j9tvt+zUH<34z*hAAl_VFh|g9G#!} zZFdNUg#E^<78GZp990fb^_d;I4|VnQi(XGJcs>Y8LWmT@fB}K@tEVOQq)7C(9&$$p z!5Q$&xMHqX@&rg<3&`j2>|Y~89;C^P$cKcSa90FZ;(6S>t{?6$A#mm4ZK=$an7DUm z1VXJRzD<z;F9dVGH@5(yOg;QS0Dp&BD3lmxRLP&W5Rr%)Gnf`91$e3t5f=l7c!NJ^B@KxA*+U!`85yY=Xpuq2b#721pOVSn^Howiffj zht?{M`~$_I^O9X`rd4I2mt%BhMa5Of&CjH=CAaRsWj)$eGgZ-qa*J=SL7JA8MhJYT z+yWA?vp`A%4=(`mnG}E8tG^&k?X&BdRYrEGL<)@HU3sGLeE__lEyx5jbHR2ZmJix+cb8HVp9A1*5At!TT8JP8dibP!;CLEtM(!Uh9a;h4xK#?t z$bC5j+f&29vGour^w>i2r~o;FW}w*_v`5u4ZDS?|2Ql!QY{oRh3XbFd)UuVezJ2=~ zZci4w+?;+#wG-IH=@6;o)BMnI5MO8t`NRut*ifZ?2V@{Q8n&F)2jKX=r)2d$Qwo*ZB7AnN+AQoYK3w72@^_FXaAq}v&S@FOF4terk=o$t)!8mw(Zk{*G)E< z3J5^b48QOPKJ%6_tJ3&Ad7gYxC}w{xp)~2$5t__Wia4dpgsLwwV=y9;=;b0Y;@1Vm z`;`Mro0jB02y*`~n=Hh--zp8U(J7p&Fl3@jYH+|}LB2pdFSp2L)u8K`)Fql1xhWDe z{ma`Th$ImMFO>%I!E^ozR4!xF^j-2t;Acb(HO)~p&50^VpqQ5B7PuO~RK`HF6J}6B zkE9755(Ro2|9+@N({zA@#+{0aPHt|!a+T9-Xd&tp`G`PH0rF3Yg8EjIWGMz;JfAzu*9BLvrxPEz@ zio!u3(6wYcc~D%&*c4%rc25Vq1U8n_e?%3k3++K^uY!N4Ju{XzUlc_XbR$GcF-(&J z0o(=`Nr#w?yZwYA{JEy@!gL=R3rO{$2SPaQi{vJ7Fs#gxLb61lf#3@X51|wJ%#Bi+ zi72}f8UlbIM|?TfnE+J6ABL^ACQ3e z*#s#KVXyTxj7%xGB++uA0H=Z_G5;5E6ptcH1LCQ!*zz3GA5z2+3AnLF|6ZgD;4Poo ziJm##V72fJeFrb%wK?k^cyu%U`PfFd7(S>&JpUB$Gg7cYEk^rKg{TVJOE|qHxgMNy z9dnr=DJ)QQ6GqVGFph$c4Ek4Uf;Do!XeVSK=mH+QU5{@f84N(#Tbof!=Ef*-7)9NR1370xF= z|Lcuz1bL?a-3o8Y%X`c6(M3`{dyKl2g>P>%Asb2IuQfG3TqZYy2!=az`t~pf{=RAD z(V{Cfnj;wyfpywQZh^6VBvXDZS@Mf(VD=2bpgyZIo} zAEdmrUASVI*u)5cY3QB$exS16w=bRA$cj4o?3YO&yjJS2(>rdYdv8)~PY~GSgI*kV zDeHeAQWMc&b+2bCguqd!eEaOWW|SHF8%T~|M~(e2rrB)FDaaGW`=jXLWo+t9OFmKi z0Fi`qm0m=ifvh}|7v&d(1wbCGcRwNq{l74Agtx7bKv4tf@4v=MOTr2IQnuQ#*%m_G z{_BS9-p0hAWonHO42dvI*-HMTm^wp?*8{9Lt3qrdm8|?^Zh9kAnlQGkX&izuzbDL3|NNrh*WMO3&uPU54VD?7q{9L z=HL|(l|>PwQB)$e4}M(;dg;jb(Su_OUHqb%`p53y8s>uToAM@?TR+b-$J?2(Xo7wq zi*RhPmqA=az$?%z#IKN^k;VLzqFwg?KQCF!_7JbKfrK^$mOqIWmQehE_p#9PobH*f8Fa8 zZhBH`AZmxRrg`pma|6eg<@EExHrr-{+b+(`_>o{0PHQ22B$#2DL?9PML%;!OJ3{~e zBjmQ4&mT{2mW&E4Q_YT|<6IobUlOWS2o8uwKcLK=|jaEF9 zLcWt$T>LmB<>TVh$gw@oH`#2@43dhrTQL_D{nFsN5V|G)229z(|Lx|(Jke5q-fWm* zWS=ko$P*24GHe|WTl0R*rq_)Ks%+|nUJKCwOKCO7$IkWnB3z3ysQa~SD$HfOFH^o? zrqwrDU46s#K9h@1DN!-yV^N-QW2U=#F~N=Me2zIou1u-1p=JfGwu1G}H!(8x+gGN! zaQgFxx$nV2U#my9Fgh!pZyKJkjBOtpZeuF6@BFsN+p=m`{>__w5b0gp&i&sOz6JJu zDx%gkQsvqembL`fXL3tU=0@y%qo4jhgn6yuzjT>$uoa}(Ml3g_i$YyvRi1w}9+^p; z{LajYF6HT`peuB700(1n!Mo|nC>opLvEUGZ)mGfg(lGhpf?}Vco>F=LUj47?9F%=y{(Xyq?)!%&9s961Wh-RC}OM51p zwiwKJxhc1*BZe?;B*;)n+ijoQS$yV+t{V=s4&QFO@7EHCN9R$jI9P(h$!V9za{n+d7!(`a|owzqENj25y}pU&iwUS@jm`c(u&;RNCFhvCt0b@|AOr0onU0bF@P@KK z3P?Mf`guBT`$prDS)1osn+PnByg|cVY2^t2Q|FiM=}kqq?09Z4%RyUhWsyo2=#Y+Q3~hJ zI~uX<$71rv_Ki}4LI0e!ABZ4e+mcc|WUcK$I4o8%ikT~zr)Aau%w|)K&(h(GtkOjb z!rvbsDIl@XMZDF#EXP*y?xqqjZd5cWNItI8hei(ZJAP+pivHS^_Va76_*&18Pa8yh zUYYQvy&@D1QD9G9+4%R1+U4#;z5cnQ8WR#6s%@;J0>P38{gB*(#!I9ao0g?qe@yYe zbbsgKvyJ8p5s#g&385UG4TOv2g;V~4Q*(c3{UX;$Wox$wSIpEy9fV%1uxVMDY;X}L zs}!7eq?z-M-9o6#r4}F2?(exRpP$b(c~lq39^7}Z_Vu6-G*ntTVfFp7VC?r(5?Af% z`S+yow0XG3wqA2qoeByE8G?UU?M!?%n1@8O0O3J$*&Qz5H!nIw-KFvuju!Bs4on&u zYHR!5?@@oSCAY6t%?kxJPv8f^bFN||6>0>7T~3UlOggc%?=5v3-OkmRw4eJwhf17{lg_=*_(DuU4|#XG?&crWlSk{KYs0B!Y<5h{ zC`8<=`SHORB?RIUGlC5DKdY?Te=cQVf-nPlpvFVLBdIdE!&>KvAy(3P*?*WDRUq(I zMo~=z2^P>2Fd|f8&lcYv)>-~U_lZ^D`rs<-yo=$l(T2vNiE39F%j3W+(o=dY0xsXB zy6mK~ZDV}A$9I{y3Zb%vs>V8u@_dKO7#;sBl^&(eEX0#lkg~EK#cJI|% z&6^6ZyDH{|{dvdiBx8j6Q`v{kGJ$wzi7F;z0?A0UgP8M!SvAav!kOy&j>phV}Mk;UbUUwQPHM z-2!p2o(9WmQw@#F^!*YJZC`RT#{Gxqitcc!98S_qwHQ$zzR&b8)k8kv zOltM*4_XPLu_6{6Yf>7{Q&v$u`lDTMvWe(#TKA~G>voS$2$PP8ZjoCWpYiVJ$7;7O z&A!+6+n@cg`lHV}k?&t*-**=~oLaY_|Arp~pM%$i=!y{(82|E%`bNi$PNWRfxSlOoI6Yr#&J>Hb}^E`n~< zhr{5_HiI{@DuPZ)HgpOCzxL^O<^~rgJU69Ne;~guhed>-7FqAI0_?8FHhA%cO zk4`6cS(oI@tGC{JT>s#;rcaDMqc;6nrhju-^h9XS^w0hsl`n385Payn++&;m8?*&;P%~wfTH%z_jOqlittX>(_mMO~fpt+alJ$i%+_?e=~Zv zSGFUR+FiBH;Ci!gx=kX#^L@{IbAc*Q&!2aD?Br8l-u7XE^O4=55%z=n^$QA1=Wp2_Gr}Wu?WIfk)s=9#@kOdZ z`6+tte(n%%mQ~Dg)Cg+#(aX6`m%Zntb@|Rd=UeJ!BtIA(cuqj6=a2(OEM*nePmP|@ zORwLyEJURz{(ICws`REi3`{3Ke)v$4R3AMo&3j^b?r{%!HTs>xIsMU>-qfz1T}X_( zyr8$QI5Z$)=$4aj3=0q4t|xp7l_PuowRX%VVtKG?vDq2!N=^Cv8KvTxX^u?V)xDmb z@{DC}Z`cF*HlNLw7~P)E6S7-RS5GE2Th?~3qPyJOO7%;>>e#3?nrl1dP8{9aI`aOB zT=NmRYyVU&YU@R`57l~bkd<^z-fcT#Q2zNCjB`^=3%i~Izv;Owo{*<~`Ar#?CQ2XND8=I?qRjU^UPol$TGDk{{mvuTf@FO6vln{rTDc)B zc(>8u&zM6q3Kx>r@zBL~ALm!tFS2&x%M$w7iw*}hvW$tn`D=y$d+OB3A+4S2^k^wGYKm5h4YBThIR}KamKBWs_AFA^U~h_xL~@&Wx-sh>q)$iD&JnSPDLS|73(_*eDiv1&Uy`u111TrBlp465BWt*^4Tx3_NJ zQRa3+xVu>5*?x}-G-jOt^M-uwqMd_tX(FBnS`Mnw`zv!5nMIq4Y3-zKcQzcWMU!5Y zo5}k9ZA<(I*-!(;g-df$CN(>*-Hm_NlN?aFj824I>%!_)fqNouaLw-1%S__McXrbA z^j}NjP0voE=Q++1=EbaLeOWNJ8_$uxLCSMLOhka9M}aZv(48C2%rIKNm~dnAi%x1E z|D4tiaqlhfn%C$zrW(9{*|%GbUWs!p?VDjOO+lg^p$)yyq!@VP>C-#qirM3*-8sbX zyx*h5DYPjjfsvvIqZVL|ikDEMmywl?sIi4X{GZ2W_?5925M{e}v$RljmMew9Cf;F# z2R8vWN_J9qFw;3kJ&_h&y$Aw!1NH}@DSVY@9KhD-=|;M>dueSvD$^{XS|lf$muqlW97p`F^1Y$ zvn>}H^||6THaq{^RvJ)7;3aoUkp6gZy(AGcBbY= zbjy>!=!nEq5)$+UVbTn%EO*tdPL>w@p~TV4&GaC9y0 zV?Ih)39Q-xo*>sLVO<5+v?*$JO1xcWU@B3X@NZTEU9YjG60H ze4=mfr(<$d^F4c3Bc8OEkvS9e$7eTG1kCERJvt?cISlSCuI+;BBA6mHK2!uKPESu~ zt3$%2=oJ(cpi;1O;DWxOu3#b_q3qb_$oD@4wiMjFiC>@sRfLjn3q}*cMsx%d2S1f3 zqKglvO{MU!Bh!RQg@^91TXkM%MSGbO#^yK}(ViPi7R`yumASA&yUv3Hg{qF@7yg#&f*keo1>WdEX5@-#_ZQ~OY)uq_@El~+o$L^@8 zWJE_Zv}B?~62i@@RjWp3=d<^mJh?r#`vR^??dI8HTg0|~`}Rw@x+xNtIw=^8niy)= zK6XqZ(vMz(3;m@bWcXkFK4b{E1Mto?*E(L-6`!%BuVA25xTR0W-gw*DcLnCZeHNjlL@478X>8 zUky(kYIB_T1V`A>ZISS&Z3cV2a-FcsBR)!h9@JlYI#mBn_O)wg)?32)X;=;m8D14Z zTYB8KgMA&1TEK8BWcg{&flUc;)S>}j^~0_|G(!bCdH-z#hzQdFnmBfjwQRHz2A zJ7Rjn4FBI3777oTonVg9qFrL>wf?=~D==E#cmymUq+%e-4N(~PY5w?8FVg8UQE-(5 zX1H@SW)}~kFyCvh4XM|C@ts0)(XJmAS>0A;~lkZo~$A}*)yK6^f zBz;Wiw|s`anw96(=B&n1NE$<N)Nbdak^JEP_o;n*bk&c@_joqS{cl&m3b~YJMA{;cH z()HU<;i^EQZtmW6J^0*)4I5ZCY>pRzuoP}la`MOi$A=}ceKp%KbHNj@V||d7 zqQ_|8zC(>ZJBdRNrmsd%ZmuVS5k~3O+m=x_Y#+*EI))w5tV70MlE}0XdW9491rADhBKt&(B@ zTwjuN=L}x4_8Zznt_LS2Y(DnjECxC*z}&Kv>>VB7sOr_BkxS2!*Z}Nb8q>Gn4Qlja z4YolrSM+9wkq%L;`{Bc!1Qxun%PK4Za*e|ictf~_gjR?M!1vITYRk4fY<+}=8M=5$ zn=>_b3or{k9&Fp4Sx_q!1Sqfn&l@gKx<-BaxpVB%-G<#VHf9#VroyY%Gll`|Np*|X zN;yj9qV|n9AB@oW7m*6V$=BC+%3rx_RGzfvV#tp44`ubrGroKGPDeyULPCpPwH`|Y zlq9{he8zgl78cP>ebs&AMb=gS9`@;6hE_TKFf*}Q^ywS&#(#bInP-I>eSLjBDPjgzW^{GgPE4X>Kam(&h#C(mIU#CLF&%?W^L@gS zl6^+tZ(Koh(%22m4VI|z(1ndnRxYNKT?4F;dF3TJESRmje*OA6(jbG&;42s);DlO7 z;-_O1r{Bb29cg(1$1iguk6f`hKivJ>&x0cjUB)4#TMUp$Gn0Gw?%nkoppfnqcv}O8 zrgWT~MC$Al$ZWcBPF`N#ZjqWp?oTu^U+I_;u!D?I6XR2vX^z7z{Kg09+|!vx0ql~J zuM8lgi!6BesFA6urmpTvJrTrS-BBMUA0^HT%tCsPe6Wi%29!+x{H(wRo;LjD3905G zJoWVUW|Al_v@@|=UnbQatO6Yt(r9~wIn7QCbyuz6$_8~o2_HKzEFxlqITNeICnZNt^+r@lluUFLWR7DYS&U98|1uxm8w^2^DkY`y*9+`JpA|4k~3 zR~SKBTstb#$=~rNUGj{lCkA=&DIjC_h<32x+cX^d9_*P$nMReJ!aAL+8@Ic0fak1$d$-pXfgOU>lM1YOG*u?4|zsE=eBF5k^q^BFe zF40CL6t82nZ(lX~gWJka2%*)>_HCXqnOOu?A_2B*d>X!s9{83LM?+c@&rmz zrS?s*rHxkp@nnVqA?G;8RirTxOQ~;YD8~b!_I-ei44_>Rh=eGE?ky5Ol2TFG4OOvk4i&m<2g!z%DlegyQ<&mk2muYfq z-)!?mQ*0`hZA%gbSoyPZF%Ty1;myA~vh!VSOb|$M!O}!OxFK;(&t+sOXv3X)ANvj7ivTw3AkEGXU(7GZ2JS zrdNV67Z<;H z@q!z#SLEJ7LS7i*sZN&(g8_^p+|uGPuk7?iFk0gAz#tnyG9io@lZ9YdUS2*mADBde zLm;4cR0IH%kS%QCpxWR`F({Dn`Ozs^jOUXv4NxW##I4=jyFsPk|8&8s6y#IY=ngqR zx&%QHU?qlT0DQ8%2#AbOGcOBn0f*s?3;X!doP!EFQIws;D#t*U{5KIk*m6 zsFuRpe65)MX@{^)UYc~BT=Dy!Px{@#_ehUP#oXAQ!@j*6$Ry(y%i!RY&HO zu_4Gm@1n^cn=;k8Hb@7^e$k;BiEefhFuLXD0ZH^nD*t=-AHtx?=rKs&wJTRR@W@bm zD?6IVu{NZknT*qdztv&Rf48r%!t9SXH`Zd+t)+B4Jfs0RU&(+uR!Ge3?itJ)Mp#R| z0H!ozYjrg>mywADGBCRqrSbZ=JoKM0~y_=+=d+h}~)PS=D z3eo4oVfoN2)3NC)cJizDBN8o_u3)rB>>g~tABR3F83Y58wt%vdsiC^MI#6ix%nl9$ zWZlWsCkFgh;DyLY1Ni|W!Ox+d{7Lk6MTCW|KRxhJ!q^L$lL4*4aV`enEEr>WUM$8a zsHm8hkgyK$jW}D?H|}u@yvc*S8lahA8zFIP14ovMZr$opZh3hcr^2+>IrOj+m>^A5q+JfIvxZFJ4Hh?C!rUw%6%Ms> zc`$#Xu4{X)I&VC8yv}i{)YMdf6KG~#Q$+pMti5-Es-18@>@ z;tdGI4fl=;@J7rGRDtu9V;rNdv618!;OxerN;t_0J?JZh#l?Fu&qmrpNnFKWIWwB5 zVDw}xi6ljYOjKE4cyfBu6X#D5g2EdQ$riyFdRw45!~Le#1NpZGb?E0VlQ8 z02HEx(Ga=E+B9F07K$i~N!m&fabRF6*kBR#@G8|(c?$KA*t5bW@4e> zAZGPVO|(&l>d-aar0JiGg^+IF4CO80MxeIzRp8=;j+vU85~Th$*p`Un0xmDi&yItM z9mkO^Z?d%4l7Vt^%9i)w2UTPzx@3M2f-Qt3X&h@dalphR#H}6qRVHmUi%UvG#Kd}F zreC2*@Z`YcpcBIJkGi^MmzA-?R1ndHg@uU%mkoeN&O(xGa{dW=qsemsZ;~j4G7<9p z{kt=Op3HQ;w+h+?&E_xDQC^s`LlD9|J2yO^YjKK7pn*&+p$C0cWk(#-IRG&vLTETh z<)CrI>)Zv(g)kxhGn&9SlsIpIw$5)ri~-ChQ8-=78V0A+0~eTWc$-F=>V)CPy0r4No?v}%MU@i}#9zn4t(?5(*OnGx~j1I}H zFXh&Op|UIc%Oj74P)9qV=Gil~Bnn^tb|cO_P&PbFxRiG zVvFpR4DVT-9xA=!KUPP^Ou=n|uxd)2)E~cjbI1{6^S@z=(9OQ!7$&H7^*wcoB=sUG zHa3+CxaSYK_Ta%KklXb!TDoC4vMmzXAvq#u1ZIv9(}V&FnKHWQP;`3o7)Jlpf$W$F z>_oCmx>9R%nV1lY2T7Ef`La;ynxsUtbuMi*wBjd%~UONRu5G6J%79g(_M zuWE)TOCVwruJ3etu<6HdfWC&Q=>{k%RF4N}hg}&~jkF#cg3W-k0eMkVRdorh0K~}Y zGRYZ!|9GD`_GCC9t`ft%aP}Z;i2vlsFKh8x6EE?L)cu?y)o!Pk}@B1J99rc9XN_pmf~8pd3Ni{CzhP($im^ z#Y5?dKo*(((VVs7#J86`l9F-33fPbV+!9gT1_=_Z4<(`UZk9Eno}ilm@$ni};e+^z$&}|~vSp`lDkRLSFz)yHW zz8WErXaSm0IpEmJ&dv_Du>x%aDE|=ie}R}ocoq(NfEBCJ2Tqh^5bf-t_mJM+y^JCx zx*#WmY=%-6WJeO`=D?A@VN`|;+>^Y5xKz;MWKbVcYlvL&NDRn3>Oxq~DzT8*i0UAY zF6l%vx_>__A|D!2VAk7)G#tmoO-xL_j!!?p#4oXi0dO-E;1GSu1lpnd$8tb)aimER zl5>(Klk?EP@atZ_v`1uzTgo6kAcO*|fgnS~7Lxct8HO()D-|Kj;B}m6%x`WOIzp4l zPD)Oe#u0JKb0g|RYyz=du@5l%b1KB|RJR-godIk?YBvHjG$lZlpR}M?{)oX||9|sU?WLqmLn|dhl*lFm7a}AFRDs8jmBz-#Nd2!Gr?I4BBpY)1WkK4) zh~SzalKOA#aXu4~aO&$(EA26Y*&vy)tJ`Kkjz6J9GC~dc6tp-GQm_-=z7wI0=t&Fk zFcBCvM{GlH*R7I9Tc~4~a)Iu!tGkHqIF^H)jj2XYiVoylL1g7*5|$LK)#$;&6Ln+x z*%(?reTwdur10*KtO<; ztwjLQqq`P1hl3No;fPKFFhU%==Ye3cj$!#UvVl5`c)n<8=tfdhHRQd1)%h27bvDyu zy&x_tkhKt*4h{RM*iABkkM0-0$)B%?-U%^?jlok2ODUXV_Q+fOiQn%ovovJ-m6+j7 zh1f~a1Hh2#hsUGOME!$DkOOIO)~G7B0Qr*u1X&UUP{JW+F_Mr30wzMj*P~OzwcVqy zX%++WPuMZoXFS4kBuX6woGc_@AG0{0@hfJf)b(`XCrF%tEXJVT&^*f_%jDm>^}Kr& z^1Ti)8-ynvEcXr3DFIcajw!{ap{E;$9J&RsPOQ7?Q^4eBLOC!vet|_qfE-0b46?Ww zC9g{=LCV9Gi^|0N!4T2Pf~_YZS_=z4V9&N3p*9%#v^ByE$J*?q!6qpNc<}&a1Q>#s zltCg!aHZhlj9zsDDR)tK$WHPCS+#`{1AfUU#2SU7ozt;nf~oqnk{^^_cODML5}YPQ z&Xgku9AUEvOWJtYhli{;0$dNo?_CtVM)__Aaxk0UuYT2Sn|fp9z7XDp12|(4N+@6a z#|==b@Im64DrNI8ITUoDwQ#ct;yans^d0|Jgc2T18~#IzNV~b8E(uZUq92g*Gn%>p z9q1t=MI@ZNk&99*8T&UkkHlRCnCPW&KFPh|i-^%Om`>bz6aP-MAn!*CM*Qn+kcksj z2b$`5{nk57jA782Y26vkss5|Mg2;$EN)}LH$N&t{hVOs!Tun}E!U?SqqEWdZHjOQY zKQ+I8{nYe;Wes6}crT=nU~#B@VN*JoYl4)f0AxPkhpFF5rh(i4g zEl!ANhtI3=kRq2X4j?24$RPu`>@7vnBft9yNP$}D2#3aLk-R-GrAs5UgejpR|5ui2!b2YO5J3R1ih5-6_uer*CxfK%iM3Re+)AFcu8A){6x z3x^ML3h{~vC}*rSP&7yTfIsSTBq1RqeULMPkq`o2!<{bw!Nk3Ji&girn?y#MYVTOk z5@W3%@_vJOL5}T2J$kBxrYsZD9dDhDs0|S-&PX`K=`uaf>up1etnFo>`iNr&>qP{} zicDDAj;$er1!l2VVJ+%0xW=v$s5Fay0#Y?|7e%*Lga)KGq=yxSu)zzcS8D^z7e)0% zuoikEKqfW%79KR%=rYM&rE96!$UuGjq0^|`P2AxQ>#DQZglwW*t+a`fjecb3peLXJ< z%3^3mvSIsE1W&G$qn!psj<1EYU64TW6@e9w2Ceu?UJ?aQm6h}i_YL9R0@)#4D+?u| zL<#r%cywzoIXiiUYrr!sM!Li*;49gW-lPHi}NZSqS1zNCOR4a0j z3_~u{L`?)jN;dkP{)lm?*FmZFyd{zY;pKW!(f`HNnZV_ockh43SYkpcR6->w6Dpx> zi55`^S&~Re*;CeuMncj;5|O1M6cVzGy&{C9Y3x!-8V1Qyr2g-7XP)2xdCg-?ZukAY zzu(X2oanQcZjKjjEt=yKIbV@D6=8W6caxn&QY`q z`MZYuL5BMv47K;G^C%fJ;pep84j(oiF><6)_wIW1Nk!Zh+DKrj(`)T53v~DyxK1R! zr5=sU@G`qGZuB5gB0q~thKOgtGk8`AH@N%vx5ad&OVC^GGWGM@r?~(CIGE>@Q~Qq} zk7fwxDtyB-1QV+B>T5@XXKee+F+N36=6}ah{w?e9lxT=wtnsEASWZWC_%?V;lIj`6 z9fZ2gaV6o%XHjd+qOVrP0NKpDKMxzCojXU; zOwDnn6kt`wP%=ZU2uw2q87aEwKsiS9R^NYZYh=4>)nM?^zBNVf>}C2gk->uiAW)a9 zRirNB!_1}l6x7Zxb)Dr($ahFgx_c2Xz`41^a*c_dr z*y|K9FBg)IucZGUh}-e^^61hSzO^(!BKsJ16{xpwi%KJ-t|N^2-A0)@T0QUaKBhYM zvCGGX0UL-*#La-4bSe}ZeR#7h6Ecg8QTz$wl!3-m^R~2#oe7xcq;J-#d3A*`V-g(TgHx?E)eWRpOoOkJAac*qlAh01PvIly_qp z9a5@zp=cWtp&6&6pRC(ht_cQpA9HgwtcF9av3D8cVr1f#a;`)e_!ba-eTV-p#?l~1 zS1~#mqOxyI!!YWmQA3rKvo8B-!@m73ZDFgr%GS*DTx&bg&6?-5-czoNxyOZ)fH|uw z;uv%#v|DCD=l|ao(w?b!K_oTULM?pHTFDwn7CTdQgU#^vteP;H1H7HUAJLKQD3eMg zYa`x9gg~X-&f*(EZcx;onwKO^_D7YsUs&vKn9Lk*M3lB@WuNP(&3Cud)@>|Ae?Y8? zV!S{|U&&q2jb`Y@5IVwUPFB)|0MWh!CpwBxqDiRTS#qAw=(KV*N=xw&;$?!kPv>{=jo`bD5S)M_+`UeAlTNK6SH?aO><;nV!Z=xMR$B@Ih)>O81T+S_BKuxli zvSrM^7?=u1Y$w3V(v8$pZvpc8qtpU+IDt=62`2a?P^m~mDcLbD*h52rI_xL)C-0wa z?xbiP*vfcpOf-CCsfDaWXh*&`B-7*(M#8O&GAGMt{n)8fZ&Qbfo-unDGFav@8F~c| zFWNg?Um?>B4Rc!*h?uc+SPrak9wAy3@=@HXQ}dXPQG^D?_Z~B4N-oO1BEBVBz;K%V zL1n`G*(pMgZsT1%VrHy%7%*d{7}^*^;*fKbG4d9ZLCkuZ}GbcH_yWbJkh%5|7eu74(EEEW48QT&fG%KGeJ#W;Cq)-IM zGV2y82#raFVUlVAE-+t=9FSJ8$t?<4_g{p(!?-k2BTCMV(~>!{^4k(RvFMk{z5hj1 zR$h#a-fGtKLKc}wL>kGQ4zpvLWEcV(vuHldzL=u>(yA3(%^M3(B%y)i?LY-btn7xjtB7XvM=YHp0) zG*;1e`M(X!B}rS^!9tsDkyDyLwV|Upgp<%))X>0i($N+kQnZ7}oOHiQ$j!`@e=+JR zlTcmI1uqwq0Czbl*Uy~i=uVYq?5{<`eOJ~p;pG_13m zTzND$V}AMc)K5)%Md=OSe`JQy`1H1;GmiB7d+LfOlWeRHk5@UZr#Es^qwOJY;#R&~ z{&M--vika6{?jhJ{3m|-tmOtT(m$?vmzNWrY*fJgT=e|%&pj_z&-nWF>vh@qD8nd~ zYu~Yai7-7%#D@xJJ5KDrRisFzTl?zWyIH6_IWB&6SC@m7I0dY)`IHtE;U9@+$aVX{ znW!w-cNxFct>-o@Jt8W7k5^XuwdyqR`W*KvEdu!R(hfzTDIeDLJHLAArEgEq!^xG4 zLh86f-S1eM=?zUnO>)MJVAKKwMbY_=W#qNz&vm4^QSth9sfZu;)ss`nTKPnrZ;T{~sRavJSH#_5I z0B#C^(reeQ9h{Kr`04U5t>15s3JjqNG40>~rZfsE5YABP$=H!4Y@|;}N;Hq+tlLr3 z!A=v>?xUu~DLrJJykxdSXn(8PEGrW=m#&`S);2yNqL1A?Yf}v`GHqI}{p;fD_a4H* ze12Dy*KKfRbCF_q3pYK;Y49Y`5OHVF@I+Aks*9hFED$}o4>u=XjAjtuOs(jPsw$7O zuLwK|T?5PwCwqcH9eZPMPQ?AK}4je4!B+&KBtszJXxV~A4_V;E-9Zr!?d)grSwdUR_^b8$lx z{y?9wdt2{u-M7kl0?|&DdEAPB|3%nUMk<-I^cRKZbgudtrWr_-#`RPlCTc^zJIr>O zuKQ09?T|2KDvibH0ntlTa~(5WXZHQHVwYjq_J7)6s%|o9&>**kSDK*4wp!{v$B7f$ z2YtUEbepvc0yHr*6WN*<-20x}cJ55L5$``~PMm|rI{Lq6-0v=W=G~pfUCYVw4dHPd z?EY(hQNt()6USNhR$t`+#7#G}JFmEIOgXNyyF8r-F9bRIJ>S27SFBtvc<0fhJ;ha} z?oD1@II`)8dD$StAxn%Is!#uSYXcT9R`>;>2rd&+TqJ9IpYKh#b?euQGWN3kjqV|# z$5fCmb?NHRCfyKmuGS35J%YGbb!DjUi<-1mI8?IXeNv=BBu$ zZjX5PEmVn{xQ!W&52sFFh+wesU+tjU%JWsb-o0Qd?WI_D&_KS0F2ps<^(ps4u^VVM z`2Ek)4;}nDJxW&5O9Vr%X^h{h@31|W)b8vegA50`Tl;*`W0_TQeRG#5u>2wt14&lK zZEv`Z5fP@_2J3S7B2? z4BxW1LFtI2$Z`{RY~McJ$0rogX47>^9^nb6PjAc5cP2<6Z^Y{BXSK)Rbwz~-1*CXI zNQ20D^6?M{zBmW1k>Yb^GbZw0O@U%F~NW+oTJ>>z$wiDE8Sy66&Vgpp)} zB&OWj2R~u%MBKIex9HLyB<_hG5sdrsDJY2e#Q3+G(?b+V9W!{k;*1oCU^S*d15xH7 zwnz&@k>Jjrtudc`*6n4-cgqy6Eelo@>^#Fr-{g}%s=hlEf{ctFdMBoMad#6`*#NS3 zUrMB1cqjiLONp+%^KAhxg5kEpq~ z4Jna%kJ;i68(aSox=Fuzgv^k0+QdUQu*e>@B)(v`Fg>OfR;QH2CxMFV>Q=@3-$If< z+|&y>v%#gMrGboP9N>>OY-le02y=zGXp}j{YORE-YAXNuyoKYC7ncPz^h>9PoTr6Mgk>04K!g-}qCMfT6i%K8yQ z_v9_O!aA$Ty;M7L@b`+*{&W+@C{ppQX|-3Une5{Gb|I{$xE?`kkqlgeQb4eO?vTbFGtG(O8pQ}Wt?4J2m%bff_ zzkhx#6Uh_Z{F+b%c&6wmi3uL*h`ZSHng;U1GGQ6^+tKIIBYVn8wwjpSnJI;c;@&;D zdiBrYrsgRqfv(f#xtSv;{S1-PMF22ipe2%XOGIw;;QiONj0Fwm&Iz|cVzgNJ{3m)g zh(Qtto;(R$HBt&Ne31M^1};+Dl6!OU;$Rt#bsWDHA!)l$A3xqjNSi!I;hGuB+l9@|RN*(V z5bO6eKuubQdYQKEr)Fc-|K0q4vp7y8i%aoWWWHy0_^7qFD?4;K+p;aS)J=EJ6EC67Y_m_1*2Yza-3E^BE1}^r{_PrRM+)w>B7ftuyx*T8yW-eh9GDVP{(8OmrJTS5 zGOTaaQBQf8Rv}|FJCacwA@!`qU$A1$b8EwOoyHx`Fb8^~eU|K=)_V{2kVNRA`28Sd6X~gyL9H)YC@Ir~YZDAS57{OV zp2#vgr`<=lQ1X7iJ+pLOu3Flo6GBmjy(4v&rr^npb}lpf|Mw4&wxg7Mh#XHyHC1z& zX^?VL-(_ZBh01oS3ov5)#uT$%ihl|pJkYqN!N%f?N)IK)@j%KgJD0e9DYvpM?UOHE z+QXbiZ(i%*5{D%Yzs?7kpyp3aRA2WUxXC;7{^L__&K*w<-jGPO36qd~?%d9b@mn1f zKR(27h~DUpFhD3oQFoV_(J5vX;%-A&z}hN2TyZtN6w}=9BNLJ)r0VKTnjD7 z`Sa%`U!g!fY0BFic6(*h6>k-?u+Bz9ep}OY(q4FO)zTg6_cP zKmPI-{pPaQ!t}(s)QtPWrJJRUuyeT~(yf~+2S(vmAx94gg^;l%xANsgduc_1-uCZr zqKa#cR14K_mtM+UdanLCl}4mox2rK&#+v! z*o1g05=n_8%$t?e~fFLUUA zU#?TXxu>TmDw_JL#goW3)L*tX7Ju7_3ZOX89GZ~I9!y7axs9qB@8_v(Ptm?H^m%+2 zhc;|-XCgPkhswjuWEk;pSN4w6xOjhy@`bDuthcDnSP;ix5?Rn|)~u1|D5e+YPGXt^ zG8W->#e=@;cZ;Aj4NIYi92O$?DN5@3-h=HuNPDvHR<{oPqy72kO}G?b^0*C3eC>w_ z;?LfixALuj;P=3}%hXr(0D4Yh;22sLrA z*}fsvqykTk^RK7AOT-NUr_UrQZ@g?m9P~2hHvC%mazWiX`E<8cHDyxJHhlIi-h?Z7 z1gH^#XF2!-m)<9JVw!h!s7VJ^4}Mis^|(jF;tFNWOz~fnGi`kRhVRa=4qS?h;_3zQ zKLeTjF@&S5xB>sW4J*jbxzwtQM_Cj%mXp!>V_h0}Ak+*CVr~&+kuzIyVU$6nCsuS9 z^DsBb6fQ!HW5P}Umj#?z6hLZ{r1-g5{LOxo6^r|Vbgv6W4T$jkmr@L+d4w<@{<-+K z+Z=x#3Oa~u06~tuW$_Xx)LTeN?@h&zovX$=IoroM=ex?BzW_wjrWW4`pLJXj5Jqn( znU0Cn{hDN5>QPVSr%#`n4`VO=?P|t$3RSv|h#Jc2>;^`iEHNX{SV!G9{=$U|x7b~4 z-@cu16Vg!T`uCQMK^6<~7VSq;nLesj3yEjud{yCj^xF$b>OEvP(vm#;m2X zzeO*odS2Da&P89~$Nuj-S(b|?X@X{hOWO`{X*-<3r}Cb0hG9PKB)|w(wwLR+3E{?` zAoZnB(vS3nI8dFSHhX@2^8q8Sw({uXF}Q4zrl)w$c_Tv1EusAH((3ByrhA#wKQhYO|IXxm&hZ+^fEm`;Jr=p5_i`Tga(hVnFoeR9yLsHg5w`ueN zO^4R^IvhQ4_4SONBw9s%UbVq(>(q>C9(~HHn)UR~jQAtC+t2e>wVu`MYtXCr+f1g? z>Bnksoo=2@is_|8Pjjxk^5fxNcN&vEEZa4ypIc66;|pOq+x;SIn*<*_`^k98_@L{9x=cgz zdhkv6ZUy2FVU}{!t?8BnHJ>-9S}drXY25t&F&H&nXgBKdvFXDGx?flyapbX4TwkrO zdSt+icGNyU9`>yl6<>!v>G!##`=d`w{tPa&nIF8q`_lKXE8mUt_x$UPVfx>bw6*h= zkL>9=`AlR*xGB2h>bCoQM|2tG8`NitYo1;9vD77CXI}qI}BNREI1BQ5g){{hu%A$tl4N0bfYZ$s9lQb1hs#TW*+_e zJ@EV8J$@Fe!kp%IYbbH@D}Bul#Aa2FdvnO@^6FQ9jXj)}|Moh!SEA1&m5>UO-&Kt@ zB;{Z7OP`olYknQk&0}h&)Axy<*|Yp#PgWvxU@7D@PRk`D>&f71qk+wrW!<}!m^E$0 z#``x$+s&VDK4|E}*IovCLxnS=w)PtR-8wS+oCOwr0FaE>heq{g)vcfOTlHJkjh`d+ z&mDZAYp|FZXz%--^V=HF>aR+z(oj5)GkBvB8#5v8*DEG267j%=aRa9Yh3<)bwsy*< zLqGlW$4?G6*5fZ9>R4WIbrFyFtpBS$2hWHa0%YIC1keONbhV)4k; zhr&$>F|#wYAeFc5=un<;v-N{9&+N`!YP@E>X(!D!&GZao&$4sFO+f}GzB&(cGk(A0 z>33{L??0d2`SZiCK2_~JvS-~p71=M{*exe5XF+M@hTp3T9~_Cf(CXQR4;v5n+?_f8 zfAyTkyM11d4C7i29cN?WXjYP6+$(FFUj53NSr$i+sg4fRk`q*>>tIB7H@|YX;)~g? z>D5a|G!zd>^tPQkS#_#0>oCRr=A8D^ZkD`X*4U$exwa&W zhx@duE?57{in#vUpS`Yy>gI=jyEgx2$h|``7e;yi$2Qe1>z8%I+CAT2_34!sW(h`H z{4Dr0-K3OT28G)PWi*@A=4kSp#d{51281V`T)uI8lyIXdVg8X1l?}dCzr9>kvUAhB z)+={RNZUE2g=5OO7KCZ|6K1;_5+ zHFx$(%`JzMKX&{5n3me`4QCbG240gwJ)zsA8?W233L@%yU0m{Ntm}pOcc#|7lusz^sVOGg$3m~S<^fgzcX@dOB)5l@;j9oYdU)wKF#~{-medz ztZ3K4^;CYz;?2I5fBJlBU+OUA-2JRcD?%JDhMfGmQ6(e}GRq^}BOoBgd;7wqWhLW2 zJfgU1XsgU$HP~sNVY8%Njt^8u2k&+GJ{ba7x%j}epCgGCHvV1fx{mdMuZGQ?7u2I^RK>vNlg2$6ky_-G(!8Lp z0-($|Quc3dny39I`+=sFy)UkOF=Eua6&-rLt5XYK=5?*$=fl?mYo33LOL?<+(dWda zCsNMD#X*hPgs=);_MYENV|267Cyfu;5s~l4OrHG2=Elk1Te=yn8kK)C{rG#ghJ4>~ z&>n+DJItax?K^#J_qa#XY~e(1{o3Ds^ox`yf7MS^KG1Bk)={cqMa0{A{QjMd{fmY? z3}}?O@4C~b*|*%tl{6g|SC4#n?{kafk!~GRV*&P><=VX+`n)W@xyvy2Q(3`#eI38H zt*(v!qx*z$1DkIbv^KsiFCjyIcztu8y3?b!L&h=It+-c8xeH zj*lhro(bw@M~i!z#ddo6^tVgd$KN;hR%D+e6Fd!m3+r~TxK~;J&8c(eTK;myWNL|C zntcd^J$j0jDmY0y zhjM9Ouu;{Mzqk1rt_rqKv1-&LMDyR2?_reze{?OLo&0O?PY6y6&ptAEYy7jCcI>D< zX&wIzw@g9YU%<+XV3iKc;b1tgC`uKZX&qAdGMv7IAW$u)7!x!=1Fe-G}^YNd*b>-YIHCjJsLv$%Qu>FPy&PhZep z<3alYt{N0ETjyEUu&qJGCnK%)=1#k_B_qhwcu;UkiNj^Tt7;X^zalXW+2Cm~GPqAb zv)`7@E$Kuos-D1P?(NlxYFO@ECJl3o4|99`>5)Ip}H``j!xXa)KBeMw9w)iFvNEHh+ASZa5zKz2ub9U#&-kBLM03P^j1a6+-v;SxF=S1gY+hr zRo|Piu3(Lq-o*X0*E_iF>QcEt$tiBqoP9mL{m$%Ym$u~)Fg%GkxZUBvrSR4tp9Ys~ zAF;YPz^Z8Qhiy;#)Ha#W_VnGhAI)}!V)ZQ5i)X@T+W{J*zEq9>x9Cjijl4}hHafaG zGFe%25lZSCc1C3)~MEt%I|&(_?r9R?xOy7 z1Cx6TPfe{c#>LySkH^>r9vy=gXI{__U;1Hqnf*YMRRijey}RUJ7oEF&^8EqZk4`d{ zjy;6#p|MU6oX>9Q92K~B%Om#aJi_*HyA9dO7{<)FSCTH!e3hS{E52jw~oN9FFnsKYI%f8>c z^xU$neebR1%N3FDglWmooeFw zU-n$inibux)8lhJz0$u7WG^{HKac+Ms#lA4uw(0Aukr!K_4o!+Elomso}D~Xq; z^cx%EUnPt)$izM zd~V0xmd;HmF{}JPsqotC7ohpUQ-6?6 zVXLaz&-eW(eXnWY)G6hUM3CU!ON z+HQU7@?(pdwf2}aZIy0r)+c$8JuhvW*rTqqa@TKuv*V8XJi-H4n0kt)76<#suA37& zHG+B+sr8TB(vwea?HOdbMLRO5+uP#LSL$y#%qxFSGBn*Ot#dTPX+QVe7MFLX>~u=sEvw1Mv=`6PJ1jr{RZVZ# z-ltP;rT+db=f=FW?9e<%aWSNL^*3A<{qAE>_?mpr^YdyBylVb!yH}s9vmF73P<-+J z#x{o+&#$Q0SlVhDxTH4l8`^6Vm!=*_zWi~bS{%s)2_3^Fj zJq~W&{6gozVmI=WlZ+_XL4K#JY_NOsD5%Hi!nb7^8++}){Z3%I!Z$i2cCG&;r}z5$ zTYR!tdiL`#-F#_=XYP_w^H+A&lzk~`{dAM2E;zIM^cPuf!463`bmzalv@XHRYVpM4 zF&`Ui+WJk3Z9M0}UmwQO7-MIO^-J8HEr0Y4GNqQAF|mtz*TV*m51d`kk1}|ov9x8- z=3nxY=K8L*vPBD)1DmjbtREp+>F^+;MCAs~(5T<89x0{QhOYn8iSU^CQdJm~<%DW^0-3 z%>Sq)HQAT&z_lws*<1def36~Gsi}t5?K2&xPyBZkCDC!{h&$7252!oFImm8IHu_a{ z`1RPoPgH!|R=lvbNZn-9&=i>_U~I;?HU=G?dbH< zvPZ9%PPs=D-ehb+m!5T-Y}C6_fBL+d8pp!7y^3#NxNo-mb8i=F4@%tQ_pMX!+uDgg zIMV+IyBDlY&c0b<(6r=$=85kgx4S6okFI*SGAP?;#rE-@Z6cN}|FUP{it;I@8p*$A zsR)0_b4?+`x%l<2QdM59ZoPf8={owe+Bpohgd|_*`g$)v{MGYq$8(#vt}XwNTKTTz z*!krTGmL*b?AcS%0TY|O89mqBaIc&HZs)@(K^p7JV(X$RpRT^7oAgg;#x*uo;?rrj zmi4zOj2zQ<7o8`V`XAGV{#7+SnmcXS)P|mI17+l0^4D=G{};YGVUc0nBC_;i`jj&Z z-n28bQ?@M_1qRsZ>TY)>CT@fR+!%*UfAH6zyWpOD@xgL-X_xqB@ut~)kW7E^cp!=r zEk4@~sQ$Y+YLm~dO*${a5HPjR>Fq9BW)wdoGENM3v5&mxDQ^XvOAP>maP zX`BCwXIam_W(8D_v`8-tfX^`LQ1k^s=JBa6bn4(zsfXze&=;vWfB0L++Ny-smB=}z zTe#ik!aRoM_ElcjKxJ5zGaGPgzt&j1E4440( z#e_Xn3hWHvQu>liogabEdfpR0VwV=l!&1V#eAH9Vp0 zm6esJADKCL&WOCyl`D(9jQ>4QIK}4S>%FRq;>UI51@~D!d$@O-)oVq+h%t)|!?M`u zwuH;g4XvE{gY$+$cC^B3X}eSYNx#5~r50KW(6s*{UxER=ky(9e-$wuDQ`uiNylQ>2CVM%v!7H=wV zl+dp~!iA+hF9C+pZBTUU4|f0Cbq64s@d;UD-n1TbEbXDMX@t|SR<~t@E}3C1k0T7D zM7B+B9;?2_L~e_-%m27?&4qU`v&^A+HffGzV>p_0?;~9q){u6!)H#f~Fnck6D{Vh! z*Wi%#9W4H)8^{p|Mu|cf9;TUEuFc#eete7!(731Phslakqa6u~K`drc6c;~Wm{6m0XT@O2l!Ad#iVswb!K~3pm`SO z(QGqZ%Va!-uD9nA*CWU0-0%70Vr0hBCzkg3xYRaq52YvRaik1+ z96C(WNM_WF38IEC`K@(geY0N!WFDBAI}GjW>bofqlTn(U=iZn}r;^bHZn0wP(nZ;k z%zc+K&T_p>sLzH*G275hJ%@_R(z^7 z<1NaMVdi!f@RG>yrMaSL&(nsc(NBkzp+>Qmh7Gmj?r|8mlzIA+wY>rv>ucDaZ;NWQ z*D|IheuP!iri$&VXe57m!<>&@GIMNCf{q%7$r(V+PMshfd9J=Y6d#!p%ZMA(CeG@V z_==yoj@*$<)HpIBOYRio*WxNCcb^ONj|^u(gL}mbv~!rqK}ki zeCZq*$uL~)#QRU5I=y{(h@14}#4sj%u^eyjGBbhZJbJ!SRyA9!JiNR@@&aG>mWG_( zkEy}>oueT>1`VUly+J8rHYY~MclRq=`GtK(i>=`S^zO~Ge{#ajKBwNh^_|kW#_Bmy zLA%Q>U&r^J^?4-%#Gc!Ae?Mh3?0CBtTlf2H={fJD&b*;|`4@WV<)0qla&R zJ($&d-NV!VFAwKcecNUA^3#V8(E({^7oW?+`I^~S)19}k9}maf^3eE{X$P$Ncijtf zt(HmlQOTUTt^WFzLAmkWxBheAm#N5<`bNdY#Ubn0GjSk4yk^6%ioe^vaN4@ihTrjn zuemDD@&d&Vf;9F1d(qZ^dJVIYk5c^L`^-@6eH&hsa!FbB$2)Bu@oAfG!>7vMuQM~R zZStMtB!{P*j(q=qp~0y5(1&yF{(G0N({w&`o4{EoPF*8sS>nCRDrk3;U)zmwcgO4P z+Wga{U31Miw!tBzy0)StgjDb~?-Ti#=b!ff=Px5pY!2gm2Z|n?VM#D-@!ypecDBw! zt#%oVfwTHq7mlQg_734CyQpZ-PIS0OI61YHQ|lEK73LhPea_~QV>kK+1|NRsfQug^ z^F7_q51%nZ&z(;fExE)*y@385!xHZvo{VDTcI!!#H0mQo7rWEI(5&JiDvisg2a8^!y;_2R*~hm}ckXoIB&d#3$hvij`95RR*K%}X6Y|1$_c^HD^6rgLZ}yDz zy-^<5A>Sx!OGZW;E*)q3?|DG~4I4Jdx*A`9fy<88uVg@A z;paD#IkF~FWCJ^iZp$A(|8m#Iyw=^?+Pb=?#_z>-)&5K0-nzZ8|E>rBE;(9OTDrzA z$pe8&k*MG&#_fKstE)q8f1V`-|9FbFMy?729L6scyZPT{x zRg_BdXJ@$Go`1TEvs49qespwnbswGx;{$E9wZku6vZ{~dl=}LLAxLp?}rd}dqDT?$b9?A~> zuFC!8@gj=04%G!2vFyL(jp#ng&_XH#T83dmy}b1AN6*we_f%F@MZj2RXKNdq#@;95 zLP8q1>exR!L*4eu{L@`>&A^uh6|6X0XCIwhvsUZZAf>?wqzyNb$NB;p1n!?`urY}d zobRLGv!^U(1O`VUKOMSpV;2(>m1)za&5va;E<>T=J4i&ZMTH7QFL#mJ;})W~p>brw zNKgO%yKe0sv=hO4k-M31{peJ9U}^7mm!@eL#YGao>^lwE?G<(sP9Td zCK82_tz>SZLoyk)POMIU;M!ku(%9$Mn6*fuvOiEsw$d>11*&l!W)Y$s@ z3Uym+mBvSNDgxv*T2Hq#Ly#PMg~!5*3%g%)Buqpn8aHd^k1DU8Lz}R~=RmOf?vrC> zpj7-vFJ8QeI^|Chc3ByY25LY5{4?4E4R_tJ#c|^#!xrv*ln6L?9T{t~^sSo&2d?Bm z0b>&VN)}pJur84-((l$yty8Bv#aZiX7?_Q-@Y7?rE#v<1+Sr*)Y91)?8+6>56WM11 zDiq45>@YDsAWGl{+b^2K}ZUab2%2MN~!tVA0wi+y%wZeK|@ zL5*9UChWgtgL$LhcXH1CNR;G?7oFXtzkw4~n~))3^RR#Ioz)vPYV`ig7a;Da-2-p1 zLy&&V;a%>(mb0~L-A3v6?HkKUNG)4umBy=^9vHpnCEf;P3N>|g8`h1ixD^+$FSl6v z)x4~%OjHSp7H!nkvypO<31Vbab^7*gXJutYkZHPR^{m~?o2JR}E2IELwD}#+ny1Hh zT^04Nc91$oyHy&P3dk zpSWEN)J!cL;p(b2c<^BPk2I1ex=h5}?YF(piyW@V0?8&bV=F_U!3Ak!=pza8JY9{^(0|+6@h#lNxR8?bSMWj&e^! z8eT+j8Oa*%NN9{%8EqVZ%7%`|8sQE$snIlsURSVnhqJ z-5kqZqgr(y9Da4im7=1~4g_5OCn{*w)yp_q8buf&Fk9>z)##UBd<#?BdY{ll;|amZ z$}eAX?%&^5G$X@xIRIOfe#PLtxw7($6@h_)p%D>fC`@o)ip$G$Q2$5V0O`Eq!s9bX zigq5e_x5c5W3ER;KSIRIpFf{I{{_AtB8jd#4ShEgbz!MdjIks1r-f?5@Aq5p)97vL5WgI3Xj861F z>&Ci{ifVnIO`>OEvHjpd!&M9~YbZD6!T8{Ja20*op{x?6R;^xoyPaLsBYhH!;u!4#g zb>H5VuWj$HV`8!iiERcauOX9o9obZ>Pmy&MnSNwWJ=h!QEQnyQOuJUxTZ{DYF5Cq^ zAQXRW#i!Ygt*3JwLkv9#meJd{4=1>x{h;5qt6vWyC8F1z*h?ZZ+mcgXp~ksS!odsP zcj6t0jo1!&5NiMzrrx(Sc-?zfMoo#Bdl$d{dl~AaA5d>8E<~bq?AWnBq#WdG%8@=x z;@Qe`L0TDX-FIgMN`B4ZBq{<(=4g2N{C!xHW$pGG3XkHEf!3F*npzf%*TKo@s+ZYj zWKH;Z!~}bhp_t&5bG)iVdh8;^QHLLaj2u|o^}aqH>RbuQVZ z7PisS5>+W=7dZTnaBCEyau~YAq-l}FjfsuDcX8$KA6E8(-&O$ed#IzH5_)$ zEM9mw-P0b;C4{bWW@qRrHKLZ0$Adb26^lIq5H~Z96uFS%5`h;Rj(>2E`6&lhf)rV+BJi!ang|qa`+D# z0HUWhmT&z56>&3SGs2zZtrF&qL1Zc#8rSzZY++T_?f{X>`FOdgUkDQgoD*m#@do{kS9P{LrC83Ai|rjD)D- zt(SxNhL0Rs`gCbg893)9YmJK`XoXB9O(hzNViLjyJ_}2-n*+~z;sb*VXOlfou!*ik zbso*S5s)D=?2saM)GyDWgkC~#d6HErFiQXnP~;~bBBq5y5ZoUgZL@Hp z37Cb@%#y*hM!qErPMEBtAR-%QksqEMTlwizSIng*$NKf(6;Hv;!}ez^|IY3~BhijQ zR1t8!C<6c^ws_&;UJUhrd{?xGFe2xn(Zch2bkgXEYlf7(Ha0eQ_u@amwnqTs%(6;7 zQ&Us7d2DBJgYudyLs%~x!om^{9#mrQaD9Y4nXP7llJ)Z_=++ZBC!TmXm#{6X3i&}Y z1&GEB#Z$iC`Ws#)ByO&=)0!)n*#L5oj#VzlBeJt?kXZ|vIA)9r-{HW-G~=#a){Pv-;;>(%G+sUBJpO_TDk^WI|9QT?%C zbn_N1W)x?x75Kop;NvVEh=<`kaFB<&tZ+8p3^IUx`ytNi^J7WaaDF+{O{BI(3x(U3 zJ-08A-kq9LH6Lb1 zcD5Qt6y;7*+_EOA?L^jtY>#j!3glgljU|Ti6*kS(>_utHD=QyyUWSz11%+^28s3x9 z+Nh`up>&pn$!g8c&R&=S3YPPM2oXly_U4cg5m&x+eno(ChrY^bgtg-oQ=Io7?dGOU zJvRe82l36}HkuILC?3{hQR02V@9h&ykVLS~!Xw;hlX;KKC8e%&e@ls!UmG zMG(hCCyrQ)AQ?G9EW+erAZX%a-lkKh$Zc>sN%_Y(YfJS7Ccj2r=lU1+X-I4&BoR-6 zkNWUFtF^!eIXX;W66tTN?;q7j2;F-0i1@XAPZLl$=vlsx)M0E{L~rCAy=Zx`1qsYE zxgApG5R}!lwH+yGS&a6vGePQ^oD|N)fW#3XOARBz4lNoH>VXoV*eHs|C5W#Pmbeg- zLh4_R69{_Z4kaNA1F%^%XhLe+r2OH0h&*Y$cM@2a+yRc?fW^fY1NW+Qge`^Rz^bN( z{r&zcPs(D+8x8kqft5{ArMGo{a4E=24g>Pom4b)-LhX3QuM3+l5iwBXX&2-1Txrv$ z4IuC2f}-8TD;0JVQ77W*{G1u-&lg&}ud0$z3e4KFY13uWd1Yl~!oh=~q|{2RaE>=D zJD;b2_HjMZ4r1wRlFym7l-HOIf?GHeJQDT_E(^pg;Wo~(ag!z@W+GvnsAd^hZPLT_ zqz)l--#&fL4&9PC3Om9j>H$$VUd`Ox#r_qJWi7!uQtLt71`?*VEf3n6M(w2~;lBoy3<3Fc|WB_8wPx)IKR+rCqyg zV4q_T=d$GV^z=m2&1C28S}lkLUJPy(T^-cHC5^K(aED4bc5IV?bPkYrTKUmg{>>IR z6N{`aiQIg_vv|UT$e|U^CRpqww41WFsT-)d5|JG?7m0r=sm6^PLo|+ZbX1=Bn5V_| z6}SWfFE})=8!Q13zH!s0$2siyBW{XI58HuV7B0Pt;>;%Nlr=NOsYdW2dEd{^PtGm` zB32ssG2dRC(9n>nWQFh+lU+~xtk!p63yY8(h5ynYUGoshjR@~O*ey)?-dj{tFIL?eh!~%Y`i*@CC)Pb`q39nMBy+guCG-DB;J2b zxfK(mUQ$wGLE0CeJETZO1sK96o%&30F+y9bvx=u9iy(rWM8WrIaBs-Yhk?hA;W9?1 z9l?<^SiLtzmpZ3GDICY&k5ULtYh|n2_rCxdUXmaU3=Kn59inaWb`KK8Wpc|5+|JDB zJ&K{yl4=6fOF{|w=dTS?{!*FpMX#bOBvMTTo$S24*2w>^{k6Se&z>(49lJI%TEA0J ztshJ!+i2(QYlxhX?*mct=P=%{FfP>S52AbOpB^=dw- zN`eNmY&Of5S@2G2+*38s8abebBm1K`c(;Md5MX+BM!E_6g3WklH$@&c5yL5gP&(Dq z)m=?m5~2n2guPD?pvV+;ME0-{UaTyEn2SqX97vVKn$z zAlS)yk7G$?Z8S7Q=t>l=5at#0At2S>!r8?B>&I_#9C|t1lv*nL-z8i(t~SLG!-??9 zFaYx>p!27zt4lb75dyPH!}<|ZJ)Mh*P){F23 zQV5;7509@64sLW_m@fi;H3cR6VkR1Ov=TZvt5a9cMB5D9EFz^4G>(|`Aj~HCKR#Yt zxCRKF^oMid8NfAS=ScAbHd28}hc3t=wo58x-9Z%jXAn0;MS%YiTj)hW+tIwE<$S{{ zlUT58l>PAGN(Ngt@ZNzdS7KFwO<^c~!|0fpY{(wVW$$&+Tu7h9-{uoJo_mcOE|RRE zDe7uq-gWVA1bC5f_8Yc9R*br|k}~&h!mwug4vDK14WDpEn{Y=0;)8y%YCLu_>e>Lg@iK!7p7@Q(BR(e3IpXI;!AR65xL%!ZLg$CYeEIT_qYM_H zDo?Qifv?<@v;vba$1!CW0Ac`9HdI8iQAP5e#uWBbFym_`q?R#qQ2g#))Tjep%*|uA zZ`a_`R2%;cp8(_jM^^D=WYSN~o8lf=X$$Ks)?wt2OfNGLIT9}cvOP$Ej*@D-c2H{B zWs6klzD!6J1z2tl#W7D2W#wPiT;bhB=^Pk+i!$IWWen6T4HF_B?n+*~NUG{N)KvMG z=k`@oQ(KeoW20`%60;<>U7{IszOl8ArDYsl!SLh9%_2Ju3d<^fE-pPj507`Hu9Xs2 zRCTx9umPZ_PcjDTdzfpXY}sfk)sZXa~e=d8XDp(!{=fCvLAt1wi5V@9LO^~>t-&Zz@q3y zQN}%Kk_KTXGVK&Snz$tj-3-4);m1CN!S~>_y2LIKyEkXkiNrel403)0S4o1oGE${6 ztXeju-dTWOWmQ#H*&=7+J+0vr_TR{ z#wcs6k`h5%^km?+=x%J`d(onxAz7;xm9vH>SnN!C5cEP}_~R&s&x?N--#iG*GvW0o zp}|5dq`4)oB!Z$k6y>7R0EtllqBPwSYRU(UtE=y@Ze~B-mpHBac&Ar3iH(1|c znXkE)6gxa(;YUP@pVfM=kQ)*=z$U8C*c7{vo)@%JU}W_F9Lwu`DL4-!uUc; zEn1XN=$Fy&$^yv|fsAu`!-ZYwDA8PDe>iZHg}=bFfvbW5;1fuA+`JTvz?toX zSN6wJHoLS^m;*e0gb6*fo7F+&t>icojbp;@NN06;?dm=(0SbNrdlXu5{R#9R@UWEF zN9vQlgPvY+ZEc_&izn*xr&L`qQ=)gk`haPkVXnoplBNXtL&u@b#4Y+8FnCx^IV1^D zq+THy_#EKpd1PXTu*cm=r^te{@P$Q@dKwH|@Eq@(16ZGd-=n~2A`rR;T!M|aSWz+9 z@oCS#1XX=~{pn_L;?F{()SQA|p(GNnOrqsKM(yhF2MI6H56R{9$N$2=_YZhAWQ_zM zB|M_%B>|;as%&Rra%w16MdX_}LJ4HTMNu4&W}8tMKgXn}IBwQ%u$C5VG#GQZgF~?^ zci9uSEGh1kHO)fEEi9j=FYoLc2`U$X_KJWRCK_it1qB7sdL`rxbykPomEI5BruZg- z0FHJe9dawBwMYk#E2mD00Zp>~qll_v@+6&dh&;lk08jZu=%LSSnoqz8iq zSG-RM2kz{wN*rS+{Q~v|4v8@=pU_n32UegICZse3-UalDn^*guZkMNBk>@E0M(m;}q}ePG$YSk5WTi~yTyJPt z7?TofcvgPUte^m4IS|D+01?w^;YLDGUGXxLW&pDv7&sS`Blhz(S+le{sFML;veDin z{X@RZO(Pi5TJfV|*AhITrZ$WuF7B~nA1rk;?i%HgIbuG?Z;8|dir%0Pw;muGd^2RI zh4m%Y@svf&EVWxnkw@|s_&xEcn{Go(8FA(Ju(O~6kO)Ee*yDdmXd0r_$0GCe2c5pv|2R5cz-4&f8EhIU-dTFQP7&xXFQC4p>{%;*k;3N8btaG~VE03*$M;_x#!}P7pNK^x{Y-8J_z}*?=h=BnOcvNx=YLf0*j02l*wUPS zZldi*1{nma5ww(>{=x<$nmu2Pf7CGuh>JBZJ5bK7(NQ9#ibb1i#_X$~o*?YS+R}HB z-W{F|d|wbSZpDDlyfo7|M`Of@*>^OV#1;gIlbw^}&jXbf`ne_lQeMks5^G%QZN7>x zkdM3k{~q-+=>Fa}@l1Up!n^K|R)H@&?Pv zO>!fyKqg7QhDy&~rs1}jn+Fr!*wQ&sox4Hor21yKfUxre6aME{@b;nnRiqm40L>%3S>tNz1;iL~#%`+id9zZ+t z)P)&_BPUw1U96Mx7iQ2^6*`T+DVY~)V-a6b`~j~_2PW)bTf+NY5~f4khjT!vuq=Z3Ef?jSr0UDgBKCddd_J{8-|aLnXkSdDJfWf)1QYG{Ne8cO{kRf`09 zWHuT8&MJI#dO;rPU4Vs>lG1ZAe4||E4pV^*r<;O*3)6>;ue5+9Zlx^)aXEBQyYM`~~3ylh^lTRZkO*>K^1E z?wzN(7R$d_I5ceaAQi*_jU+;v(FI@eNK2QTYp$ep8G4FJ;j)kUJ^Fa$5xO`m#Ux4* z*CXPkB>{wzNRkP~DKvw$5n(~81=@ka;pUTxK?>025;^$lM)LcgU?m22?If;g(vnvST4kN77 zfS29Qh}A^UJQE^PTmlg8p7oz4mVUgRJ4dIiq%AZS#jRwHfdjR{jh{Z*!ZP$(@zDn; zM7<YLs0U zz;Z2U-nw&vP1?MZ9f-DpE?Q86;z9A~=04%Cf z@MY=H=flLTW`wR2@K@iV1l@JA{Cs^9MN>Fr#{Wd+AFVX{6?(?T%C^qSU;s!;_y%FZ zJe+kX?W6tsRkgIlp@+hnnML42z0s%xTcn~VTZ87V70Li0eG{f}Q|isFYwFKjWe@2E{X-nX1!|BbZB5^s;^w%zIbE;nAvM zgICf)mUP0{M6hu#2apWI%$e&D1Su3U8AL6d&FV^hIJYl_ z1W_BH$jui^KW1&&Vj_e{rXn;<7c*uk6i^{}Yh$7z1q59k-j@PL%mm1(yZSHIBY2^5 zwH4edj>v?Bb{m^GL_;rQtJEic@X8%*&-Wnj5^%u+y821%N3t@>AtC_)N{zuAQIm1& zwi)L#HzcHFq9It4pOX%|K$H^Rs-}?Zr5y?UDUx<>|6R-C91TD^E%8Z~8c7Cl1XeJo z_#7Vw5SKJD1vaqLAozyT93}{y2PJ{Bx>#B=tFY!iMV1T#(#!|v?PS|gu@Xm-msf>V zl=;WK`95?@BmvT~CzS||*DzJ z1YMHTEH7p%crDw3lzlqPICt5G#Ot>iRHe$@24AVtxX##XG9(MTB~Q$5#T9_vAeF|b z1H&XU`UHQd&sU-k6>bsZk}Un(M3n+r>*})Nn3`U zN0@kW9jkc8vK*pGkRG5|0P*~`w$9vY)-9`}K7|=tlIl9i|BUi5GIT6_p+8}@(g(p6u7VQ&VB7K?i1BFdhqK97Q;gA-D}OMfxQcN2E2fo;L9c*9koNsW>OZspA(4jY^8*efRLO^F z7tSJCG3wGe>)(xL-4-H4E!p&KTbfk0m?PI*AIh&=%KhUet>`t|G2zN60ICV?fjB5$ zIlld(_xy=i%mBh$u~rQgHuMJ+EP{n|Xm9rKZ%Flq5ZCY*zu$vI174FOmPA~J)+HwM zuB~P|7jb0`3SUa^-_kN1K|!bws7-kYp;Q&{)*L#Cr`bo(Pa!{waO5L+5+JqNk@k=> zC$!bFKI`8n5C@P==()EpdD6nXn_|3@4IspCX;6I}1$pC{HTE>EU%zNmrek%9={14? zUn#V!AbHiQGrVKvMwXNEZO68uAQ!i_*K?jVxR&v6sHwFh78rC9Wnd}58~49o5fCVX zcN^j&lzyq@hj9y`k5KA#uw&bxb)*^sY8Ku@16E>*0KkiTO$n`)Dz0&itcZf4>zs=w ziKofuxI^8mvKg*tT58<1h2Y4|nk6W9z*>#nasU1(^m=YE0ub_9M7%3L2^s8aKLs!` zi8{iocki67`mE|s`K(&=17xPhaSf)?)6__@j1aN&9M^)Q%Aacm6DX~n-k&!9(x|TH zr%MW2Ag-0>qpQ1n6#;bNXEUq)7DQWzBtawvTSk%rn8vp0=C|&bU+jr;@G#HvYxOR+ z6z563Tdiiz%E^~=tCk;IwUi7-nA}7oF~dewMUuCv5jQ(EjAPW&Ad4rLvecxdA)8K` z+@YcV1*eDlbL?-W1DLp@ax(~sU8^Fp1gN7ewW2u!6-CSgPVZU=U<&Aly(%0Hg`u%_ z)BFvx?;&IaO9k=NFe_GV@H?D~T8(iUvCB6>8SajI&*O zkCv?1l1xW`8ur`e2xp3eB}KD<;8~>Q$v+3_dYf~6TTg%q*3MOq3H=*s^*$5XJxDuT zY327LbA*CQG1(QiZ281{XC1`xi_ZUh|C_PgWJ>3ujT4wUVLceabL{^fiei2Nmyvrw;i3n}v*PAKKeF2_6e%>%lPzVbVIF=rf8?@JWD3OJeh~x) zw2Eq++j(UU%m7RzD^+*U08pKy*i9&q9*u>tKTydoC8$$NzikWcbd$1&yap@6QblPm zuJ{;2I-mU8HP9+_-$ZDBwI0I#1Br2+T6Xh$!u2cwEgM3Kvy@O|L8;Ai87q#10VVD8 zq}ylL*PNpv*FA{>$V3OG?pjDF{WYSr38`Z`dZiKA;_}LQ%%LTtDjH3B^07nMWXEw8 z6??<}T6Xc`#naoIzjdjSIina+rdt9psL zi^$}@#xynTX@Iv=HKQtCP7yu*EI^;*f^A|~v-&)htxpsLz$B~|q!iVTS$E@*V9Tmz ztlk`0hi~22#qwrii~Ymc?j%y(vMRv;-QA~^H33z9N3*Z&z6MMxW&ALf5!WIDgrI5>CDI(HW-q9i@s@m+#6r(C1PZ-?2)Rp&pvrd5iz%?YG25^)V8rRC_H&4%m_ z%4({1qNX1h1j0Q&_l1`i3jHO_4g%lIzm zMVw~+@lkqF%Wr;kRjW*~AuLmvACL1AZz3%_>YuxQY1NIYu)4P7ci5rHv~tq<$Vi`7 zl3nuKaVaiLGFdJ*B5X!QAsw9Ra0zFrEc>rokJeyLnB=OnUwFq z!SHf=`r|%h+wkKw)>|VrIAp#N(vw!R9&nmguAge@yGSf5pafTr#m;NKB$Q~vL0mT1 zLkg9?0F)putvEe;Xy|3mpxKE?WY03CEQ_&9;C$1b15Rv*6$6LmHfw1xj9BFxHL>cn z7MaC!5>0D_XM%r6XQp^L#q&sCuHMkhEHx~u+5Ug;f3b4f`^h8;RUb_7&TZ7G;Srbc zd8Sotjq)O+n}L*Ys5}A#L#~f=Tj0+b|B_BR1QK2H8l67YW^2z1fWaL01$(eLb_z$v z)`)lZk^!5zV3vWhUuuB26OU5@A18;rNMN{Gk(WIJ`}g0Do=-55msjV&K(0XeLlW3+ z>UoJ%xnUeOfl-;6s~@z_K~-$ZlB>MPQav9gqK8ffexrs$9>l>xN!)Xx7K?Vay-aNKYK%B7r7W>O*@P5S9BG}C5m!GD`nw65w%|QrQ zUdba5gDcdJ<=$D?yz;}o@pTPzf^29&<&yu3LX@q zrRGi!W?XQtv4^9Dc5^yb-{coq+m>aFy}EVj@-bu+>udr07^vEs?A5 zADH!K)*z*nMbhM1J=;cj3Zz;2t4=`2;C(G}6D2r83|k z46`A5rx=HAhtd-Ck&~mbGq^%+=*wrKpa@Dq;Qtbv{2KlAj~QD4(Hfd6UZrpnld9R8x|_mCaQ(hz_Q4({c{e{sJ`=wV zhoLzfPfqEOQz==^;cBkZCTu;~fJ z3T?);gYFp!jmqZqRAXBvGFg@z=wdnic(Q{|&Re{_k34vBw$2e3g68F~zSMh7%SJVD zh(>~*Cp^v5Io6c_9UC?jy;$c>0IPq>KY^*2%P6A zW!Y)wV!WIgVRSJeVzR=1Ks8$zlTUaKz1RtgSS=Wx9g$-zO4`1GEYK}kdf`FVR`Qmc zb#_ZC$n1z*1qos!t3^}T)NX35mF*;GH5EubN;&gAOEbST9AdMW1C6MgQ^E#{4}qdy zru}H-x7J9m8LUkNJ1cb^%kC~JPjo)K{&B=C+gL?S32T{DRA-4t5!$B`y1;$P{}h*ib$s?6iqjCtG>YiQHctxH_MW%YGJ@ zGN=jiBA*AaN_+pim){aC5qPTT%W!0w@Gro#n&c&uBUz&bvxKfg^q8A}eVk1ei(Z3- zYjC`v(&=8QasvZ7Kzt4IC~$a0JW-pywJFJYEd2$q1- z*(`ncEe(&4NE`Fl-g>33DCHdb0ac81qu5%Sef*w=9(XBk4Ae1z26k&&g{8ecW*oB7 zWFLvxqna(Fkl8$cv4MJXD7!wCiKDn0l5wki(c@>+&|#+Ys7>Dx4(W&goJC2_V&ZH8cm2@R;Gi(hHhFt#)^sX9vs588=8@~ z&c_}JruCq7W|Brnn3v3b<;1;jFun6fzNIcEGgG-U#i<~e(vqra)hrM+T0P3@$k)s` zNZO%9^kK#7+p;AmcM`JJkh6UC`D=z|9YSFJn6CMF)tN#B zpI*Si+)pG_7K1Mc_V@Sc_~v12NskuTb|sra(@V~|Gpekd9bSjE5uNoU_h66F14NCq zN?N53V#9`H_S*+ripm5^KZ_z~?7kQM=r4~k7#q>kCq5 zKF8N@i(HQ8^0@|DQ01Scm=5A!D8y3+bVGrK2q1@hYfxve_<9NKYUR37ef65%+2$Zo&7CoF#1b}#Z;i(eq~ogjsr<_i zqAJmq8MLP=h<_P+U?siccu@L9OmsyPrR=P0Qj_|AhQ1AL+EbV(GOZbrjQnR9+orVd z6S#N|O|aEQcul0s+fTPooC6(!WGO zU5?I#_Vqf&bO5R9Y9sT<$Os_bECKF_IzMpaQ_gxT zxOhc(q;C;P*%2zFNJvjM4tSHOr$c(1dXK}oZnI1xhzyZ3x`@!Zis*PKRK5c}%grOU^x9T)=n9Ce3V^2~b zVh|fRkRm79n8QSw!5`%6Mnb&l$p%VF2(d97DdC_W?`6?l_o%F}mk)?YD?r29gBT_) z$*PLCO{GZSa5shMyM1>zg%iE=amaJYT$v64$gjo85=>>ccSsANv1}#p8|ZL&n{#Fg z<#!iadkM&hv*|y*yqMdq)HT-B%ZaA;JZ;fds+7$K-v3BPy4BoWG25t$VzwL`RME;{ z1{Vf1pd?!(n2ucJ{H+@K0Ev1=XBLv~JQ;gH!=1sb+&*kou5O0vg#^z8yT;P7X-tG7HzTN z+$d+2viX?~SFAFpUvrk(z$~^#d`XE*X=Nc(Tas)>FzBeL3&{NJ@v}GYsFS_PGn*K9 z=;mjE&Q7wPttZ$(&8=QOc6YoY&)&Tq5chp;M?s>~Q2(njoqfDfbnU#Cy&OCum~igF z8F2MI^7vKbEPG26Vz^ju{@r!{;##T~I9}V>YdQKSC?D?dq;8-8_PZ>k-)OauuJCq^ zsXD#$&wU(YQ4q_Y8*2j z(H92)fH?0nEkTVJlXW6-ilS2-5u;gkq)P^oGUpvP+4n3$lRTgrr?{L~fVMCSP znU(NIt&4muoSq>tFkWGpU2XG;j~b#Vg8< zVlzQaDRIJJ8MQS%VF<(EJ-OUP4)q~g`AHAA7M8P_&4ctobmjg_ZG?X76p`&NNzNBw zE7p`JJLYl|5HV75OOsEqiTIXssnpeu1QPyG;eabhXOO?nZ>@B@us^6LG|54U2I>?T zc&~WPCw{#AY)D-chFZFe93zP}^DVg|Bno)E47gvScX3}@uks^}-gnlmL-U~{&NFB| z_KF)#U?qyi5uLU90W{6n1Mj|%d0jM={Giols30UjBKcOOd;#q+)5s+RA}!~5z?PPk z^KX9ieVUykOr3;<`dqy6*lG3Ii?<5#6=(BLd>=fvG& z!;=HeZA&3l#$85J2sWHQ8;!4B-#|HQaEuD(m^G$+I+_>Bu$g!7-c6f>hTb3 zt$#+qgTz*@79D^3*Jb2sYo3jn`;*5fn9`uW<90~|_`l#xN$FgqS#sny#Y=$#y8pM* zAQ(^zfUZ}oIy09WNU`3eA0VC_3n&Jqz7wjO(Kk?5BobOy9`DHI0fB=Dp8^YA+InP7 z-gU!)0|(}MT$q@dLRUDN6Uo(Q@`2AKya58JDQI&gvKoR?@)YlN7afD-S(8;M@z}pC znb<%`40U)L#EMk$luYDL2hasVdt7ia2?hY($ze?&Dp7ainChjjukWs%FM;;bcF|1; zK^}OQ#G3Nx&!X!-LQy3h7pZg@a!qcALOQ$t4s)Z#R#6g@AVSl!uTN-C70=ZMrUC0j zFa^Gt+buAVGTGGq+Vj`p)PljT*$>+9-dqc}9D-_Y{(~3e`QrM|*)-DXcn~Sl$SJyI zbw^nnnlZ9Al2HKHCb5#KI397KURBj1v6~7?u-M;!r&Vi;n>mh4!+RtPI~m50bokP&xvoEx#Utk z;Tg5U`$(W6RSXy6pNAJ0rSg7jC8Ah+8`Ft0FSo$e7x3QQnDFOrY}LcZM+Oywd7TIR z`m>5pe&9k9iTZC1^7Tr{fX_SmpVmnQXI5k3qx8gRcpCD#)8D)rL~P&Yj0Ia~ zVVK-NYRX3tHL<4Z_4vd~27h0VOGJ7|05(Y3uz{#Wo#h_tZVc|Q%{ioY^;v)H|LJR~ z4pm+0Q&7Q>%}XhYylGEcGp^Ne(zTB@$w=814kBSd z1fdU#2oncU_kjr8fG9@GS@O_->K2=01T}F5tF2;H7j^1}2<$ti@VN6gGZLGVS~4gC z+>Ob-5mGGgd~yEU$&~i=9$NjUcdxPSBcHV`>DKjfM!U$$;bK-zVOpwlLqwwKl*d zPop0o)Dm8?Z`P4uu5dwKWCm9dY&FXPcrlpDBlo8E;SN0zL;mSYj@_`q99^3aQTCL; zGh8p4wr#tFr=1~S4)x?*Lz@lMEs*B0A+gp$?8IM>h;Ra&cBKiIRRd0z@GM&{BnDfi zPx*Tn@A`lZ#x_alW5$bLE~F%1zXa__fK|c3>@LBA-a-sEyi^}EN@&S`p*iB+gX z4g^ktU{oV_(1yf&_3WA1rm~>}EXY-b1 z&jJRdYVttX>jw_Yb%Z4x9);Zkf4kV#4spQ@Nu1Q+v!GDgib;@2^>Bw#xC{&gaOcxI z7uofrJpoh*B-evYJbzu@`{s)uh4N9|9JqRBJ@F2pD2S8|t(#um$wA}g4dC4cp&~_3_$b~E!NJBj2X-(^4gizXkiDJuM{20;9(quf=kq}nI+}n~~QrhyP4d`lV_}iXn z+$1_5h(m~U__TUN31NbKxegzWho42SZZ@Vi)-_A(pp`LjjLm2lxppD8mCbkl22^!G z!DsjU@Exg+(4TwM05Ii6UYhy8R+>X9c?6TXAJl><5K66p`@vel@6hoS+x^g5I3ikpyC6I%Aw$Pd96nxWypBgv~HS zA*yZknZQIZ!DvyB5jTKs-F@O|>-sWf#XqH&dE4|pf*i_TIbEeSsVL<_YWj%JBCP~S zb1%lzn=q<1zUa%}#<6VDtj3lLMY6YTR8iiY5p>N802cj0V+@SlZ8m`pddz**Ldw!FmY7jy`w+X5>wr-r6UyHpMr=m~<8x5O8Gu zlOOl3+aMREig*<966}^^33d`3N9y>BMWg_Nh8^EE)-*jqCOvcOb>-Xhmz;^V%nhRq zih?-aj!BoU55hW~;hM3W$wufDH?mI;C=aq|O1>lNV|Ghzc~#?2zP zieVEy2j?ZQv>pG6Cz>kLE`MoXdE-RUtFI!-0f!_a{M?YBvu%uv!nM915Lw>od49P( zi9qDsYX9GRbQHO8FQojta5v(ZX4A_EMkBgV>xBdRTEU=VieE*lz!WV9Ean>QbyG%H=?AyJ#?e*&bT9qIc)xxv4scAO#nJfgRu zNXv@^uc_->YGCajQF|L|zDtQJwG4ss5tLSTga@@|X3AR&F-|o00`yTk7^so(B-0rb z%qxF-IS{s#LEZuUhG0vv>I3U+9lz&KlnEiXzTac!-Uk8wm5R?O{9pVS|E22}tJD^?&!@70rzKXv1+josLCa(?GlvY9|Y50JkePd!eMnzTB4}a^C7g_fF zH6|^G@*=5`GLg#!1yE7ZEVvu%Ji`4`N%IMuoE-f8eMoxz7g_&Na}bbdcs}7D+Yvgw zog#dEyh9CtW;{4NMXM}<7{LP{Qs(*JU(ejyD5iWmT{G}@`NQpJ7X0@YBvt;5l$2z! zNy1m_>h4Ru0U*V0K8BDp%h*oJlM() zDoK&y=fpD%(}*q}6h+r<&a8+urPaJps7I-8^N+4@;{QW115X7mvwO3gI4Qy^7C{LS*Wgaco)1agO0E*#uYzW(>y>s#0w9tb!V-`HQ8 zh||s*9*2Qb*q8oM&ibTPbhxAhF^q6E;Txd7G%rd8w}4w7c^Sl8KEwRG^4=rUnwX(V zNksjG{Ska)S?afAuV1ZgQk6O3EXod#S?;!c&4dg}eL9O*)6O7ClDL6r&J`0GvwL%C zI#`uP?l^qjoI-$8H3@%Cys+j$`-)mUOK+~vS$P9EM#3OKN7YQUCLd;8Qze+6ir_(8 z1$OSN_{=rN&bL(U63qg~(A0ry*xfkI+`Tx(bO!n~Mosf+HH2FtnYE$90EW##Fh;i! zD!7OV0!U{?CaYS8zvO6Zw8_lfRJj#+6W!1aP&Wb3*_D5bp9}io@rbe>Qn3}ND;3Hd z;5Z_Mk8v0N^=&kCRF$hRMm__Q!wq)jV>#Ixo#N*@#M+F43Xt~*Wa6SFOJ~2Y&%Xxr*pK1I@=;j2O z&uGg0?<>1JNP~L&^7BA&yKjglQ0ac)_GAmXv!cFSi{)Sp+B`?z2=sV}57QQ zNk9SDM^{iF!}8Hv_K_=jG_cXV%9@fR=&Z+s>=thy*_*R8t{G4N`zP1B#Go_Ad99H3 z?e#HP@Bml{;nlVihoz}NmBRYQeHAQBXDAAS!qIVv3sl3Zll29!M)T`*l5%*`kQvP$ z|E4%yic)xDo@60y40D~CoEj*J;&imo&)BAsh?cq)y%ji%YM@OTnbtu1J;o8`y9xRM zb(q632mBd$M4URL6cAL?etc9vklpxNP00q=H*DM-f(u9G=Nxb`?-XMjqLW7v4N2CY zYYrU72;x`#m0CZUr)##tAcqlpf|T+Wzq>@`d z%PwZwGSM~RMP!6Yx0j8SFO9&@9D=l_aWOm+nJ2jYl#O-YZL86qK1M0>(jzY+`Mso25TNkqwGZ!nsFe zRJpfk<;q^rm+k(fsRCLZe1U3Hw*2X1LFH|Y=nDb=E&=p$e@LU;LCnf7&Ajjc?b3z~ z%oUe3q~tY-dZ0@|{-ywUdpUu@^NcS^d>fDajhp7Y!`;#6s52tJ0E zLA13XhFhuMg2&k3U_elK+ZFgCzOk8NKlIiBsI9A0pMRz*g^9?w_j*q|4BSheA2R9s ze`vM_V*3Tj+=#Ro#U2@IL&PYs)>z9n2TQxdW}Dhd|0H%gL$nNel&#>G2psVRVS+WH z2jDg=!xyp`U;xjqA5($XK?cD-Hrt#4szRvx{@)7+kU%2k8$ke_+u-XuFs#fT$G5#Y zby3dB9}{54C?2*s_bjDICtv=tedOmjlW4GO9kt4tJ4aMiLo?zsX{eKZFXs6g@B#$l zTj5onBQI+Sw<2g*hfR&W8agx|cL=p%S9V6pKv4FlU1nBoiElGEUbDa3oF&G6|MIs3 zeyE~01a72w$$HS9C`1LGL6;-~5nRRw$6(3~QBi_#L1`j>0W+bl(se}i1~c{aw*&8z zq|pLdvDygli^N=hlOi!I5s{^xrga3!v<1~sy9$FUsU-o87fF)JXc6hBcW*{|%at(*24#Pb%41%Jqik8ho@L322n&v$ z;s7Ur?#$c)ovqt&f**}C=CT_KP+_9k5vsxv%CrL{E84~osJv15{BRm*PPF%dr2=t# z{@$HP$+aB@O%4Hax<#tj@`wvF_gNqlxCy1nMv@GmNk@=ejpiF4ntW$Pp?q~g!ESIf zJ|*wLk%6XC^>FycKiY9Y!{>HO#=ZXG~6SV^&@&TzK6RkZI6y(yj_L1||6pts!zM>zL=uuj;-c3Ql|WMzSo2^$UrEQP#ZUfa{DCX`-SuZ7ZC>| z34%Y1Q8LQCbUZ={#)}p%92#6Z;iHd!{>a;-OW#8*L2+!>?1n-#vfR0rEoVr}h1w(7 zl8{R9LDN|}aRoq81w_3b_z-*s_ze!zj?5OH_;qPS`WmVF(ZSgoMQ+_{ z9MsXy^=Rk1H9Hqm2yq@tSAI}}yv&TS^7o-*5)uH*;p!`N04-?bWy8J8j)4E=t}&<~ zdsU!EW211aO$C@Da(!u+mCsfd6%DZH$;dAB*agQH<&| zuESxhnEg%pN82}au!yOcc6G=3zqjYKt-92Gi@%Xm!q0Yt8{0TGX_D||+Pa(8J@N;{ zdv?n(-|EmVI!pIrb-AJn!te`Pb`r zlEuk{hwLU+pMC^w7IYe-4FTyiTe9a8`YRa}-K0D>#k@&HEOQ=>{lE{BC8Lkl?(c$H zke+oGvMn&fGT>k6qG$LF5Cu=6MVuoc247uOr=x{DQe+#&N)YHacVmhP=@@WcmEK6| zPHK<UeT?vH@~jvz+^602WopR6X!(!(M+vL3BejcV)NS>C61A}osQ60M^={XOVf&qiW-yV30tdE4o6vc zWPyfq3AL{r&!O<;po|_|=&`-IbbplAoT^jkg!7Tv`tkuKN|%Eq30Vp<+8l*HT6gG! znsO;%hDgHmo@uV}txvnnq&I~$Ji*snMncYxNWSS-liwuYHGcS3G*ie7Q1NH7X)XhJ znSq|QI~XR(>D9E=qFO2Etu`@cP+TWz#I&2y?+0#AZuZ91d+fce*+1Bao;}@k*zjVj zBQBuqDH)9gxGnIqFAgg81E6(c_-2BI6J*ylx0(%(mp$bx=S8+pFo>&Mt-6i&?T$Lr zF>8*8-2@|Bqtvj4!!LgoL{mK>*2~`A)hdfOuL?blYHvj+rogoAOD~mJRu`!_A`x7xlB0;fz zzen<4m{d5uQd&q=1B^_{y;;|R7M}8m?t+0w`$u@919KG2Yf!}JI)$0n5ze;+##kBJ zc{_DOp1eNX^#na?0VxTI@CXI)2_@Z7$d-n~e_Z+T!6uPjnY5a%qHp(Ge z$TwmWt87R`@-QZCN@=ZdY#@_>%OLDP=Qpox^^PVBy^04B z2no$9$7OD;sucMeO^TpUPJsGQa=0p=;9y&K<77CwdPtIJ1V7jlApb978sQk1t>BZ- zJIJ5`p$e=kFKL|h?Ax)XirI{k%tOXX%s9z1CMIlbEKQW?0S+cSl;RD}E$^CmKH%*DfB{&wXsh}#Jm{6iv-=_sL#-$I(-iK{<$ z7%~wFB=Ovq$;8;bPd(GDD4yY@Zh;X?NwmH+{^U)gtR0@C(aE28Yk#`nQpJdgw|??4 zfAP<&`Q7c-_wM_&*SW4^HcVMObmHWtRetCcgsP5%-MyAB_gyc>HFgw4S+`Hn9E)CZ z_F7VM?s;JE?pvK}&=qsJ`QyM7Zu7bl#Tug%aZbdyyd#!Ef-<(axqyt>a2Iur=fD*gr-EI7&Mw%Ng+|N zFs3mu8{E{K72jKlSS6)P2va#Z_W0GJQ?^T+vx zIwTsQSTbmQH54bqd8Ce6GWLyVW|i~|W5A3QJ7R^#q8Lw(fo(5!q?rfjc*^}kdb<=C z3c#YZ>xo`k-BLo*$4yIBI2gKomh&!;4J9iq&1TG69)!0uQ$TL53)k!;!ARre4any) z`V>h`*38q;zf)FoA~{ms=@|eZLP10Tsp0^ABtlj#61HS;0poa`f#UNbRWg&(i|UO` zpME}#!(__yBFex)C1b>)>FCJITJSLR-TnTm5G5;x0zj;Elwx->RkC~)5#S;XLl3YE zdqpZ{T8rxfAGs|2bAk_?37MQb##D(YZxIWFt8+{f{&ZT6aPHKd-D92Hb9;F~1nROSWw)rU4003>>*a_lM;u8Vci; zknWK7GAjsv+qFW(=xpF>nn|B1CQiFyF z39Z^?&Lj2uw2Jp{FHCz^*T;!Z1MApP_#mZ?WHLHR@~1|sV4sC9^aIdyjO*H4ensBi zf^z9uo?kfdelfj9D-7EeyvPzWO=qY_l7Ynh!q+gWo)kO%2SxpdV|ojFn`^Ysg)Sz9 zoctCsPix5b39g}Bd+nI`IEANnyc`l_sLDW8`-$xrE}QV{((2Dg-1=m1z-yZ!jgQ^^ zeR9teJCl2E{K9`}F1P!Llk;O)&xy_q-K5ZVE z)6a)O`JSU;GM#pAQ=3OwCE+VRvRzR>kknD*q)Bh(*+Ym0AjCnb$H9+D^6i60C(}Yv9Dz}& zhO{?71m-uWLqmFm600mas@mb3fVP6+stlte#0Ks>f&@WCJjPb)`NW3M32P~rP;=y_ zC{m?%uB_KelF5zeEKk6sdvWdn_1pseGx_SIBPJ&r<1G+%2cUx z>>WDoT^n5?Fe1bq(}IsJu!V=Q$x`pZJ(N}sJ_?M&=k}_rD%-y2JCH>fTqq|EDQF zRN*P$-85ml%I1B&^WnCl;vfw6DF#OGB(N;wy?M_olf;bv2nkcB5DHi^>3XTnN`jED zBc)4$I3vlKq zp--293yN4<5(pUrew6IbOnVZRfi8V%5=sQ^hy0V3)n zG=ns!l5fAL=7?%_zuDXPSnh5!msWq&zj*TM=M{0$+rGz3r~e4HY<2%nPH+Z9|&%>^8Mgo6~;d2RjVk zlMtTB)U&#U+$C!xPn1pZ+WxHNR+m}zolJtbZmD4q4wUUL2^xRYexK6pjZOBi#!K(r z9N=(s_mpAPKL3&ejt}EzeS1-#%$%Ax7e7gL1oT4} z&XisGr_#G(>S%8jb6 zYN_ior0>c^Ntr3~YvYnLRO{KHA$y!YD|HozqCp-9y%o@YhlcYN*|lrhcM(JK=|A3I z?}|lPKDAgcqM)h!ukcHN^KAADqv3G1g1k?HMR|SkOiUbp9%KkQ%GMNF!cl`Q?Q#B5 z`J(Z`QKE5bCmx-|K)Up3kaZMLEujU4uYCv}4=g{;7@9odc2vw?e@>eF(RYCz4t~3M z+U*&8r`)~qch?@d=fgK4`!G++w)N|peQrgydP}agZ57`9=&>rBKJL~dGsWI1>#mo( zajdCh7WhCzpQh`!eeNIDsPjG4doxDVY`59m`Fb{3!GcV6CUETbxu>#s_rEykRn>QI z%bwJGchT(M1!wPmKYs8x;YlgxM_fp46dQgItiyhK(Yo)YH{N%R=FQu_dRV*Eaiti! zCHW^z>d$AN3?q$8BAqze1x*+T;3baNhW}|I(ieN}@*G zx^lwXX{7A}%nG1$k_pX0qc3e+^RhNSF!_+vqNnxNhi|IZbX0lf%gK3d_nv8Yv8~_T zcJZm8N!Eo7$3}NZH4Oan7nPsYb%5wLwKRFA=|7dzP7Wi}qpCu#V*XabH`h8a&XE?x zA}ffF_oz}B6`lm$1cl5`&=BNl%F8|Ja=59Sh8=I0fc>v z7N6T1k<_WGNu$V&nu1@B-^DDoW(kmwCc6UpZ{Gj!CC}w>;aYeX(c$PEUam3!z z2Fxd>2vP*TgQ)rv6Edvvoly1CoO zCAJ&46FpV@`God4>DK*Q4*v6acrH^et^8UX!lO*~k{Hx#h=XaX-O_#wLRW{YG zGX0F#t;`gs^kq^1SwEursd{l;k}K-CEb(E7nynsUy4( zVl`;=yzXlU436q#W4Yvevo5V?hh^3EuidHh$~|>AQT!O7lH9@{u2%$4JZkQlb^4IS z*!}B`<-mSFNY#jMQ_b0aK2aS$ix2v1^V9|J-rFNvei%O{r0b(E z@+YPoUv}V7<4;^~J%4SW>O8(3)8N+SxEBu-$Jk!|bNTDZ(++=^S*zFY+cvyyPTH@R zc_!a9nYREQgQ6{bQ-tq|fJ5((^=mSG(22~sUqpGgu<{)=tDVK0xQgZnW(FIhb|5$UQn&O)pVaQ0j)orWw?wE;dgH7+8J zy8aV54lSHaNoFDq6___xF*kIl>5IIa3n~KC?E&0g?oBw6MavbSL*ITu`#@Nl_5+9;*x<8(@w)~IyO`G9 z-56nzRt(?${od6i?@tpp8ehJDA$ip8RtGzM+;xEct=&@=gw-bDc&u?LpLRBA?T!K$ z6I4PuUd0R69XjYyeNpN|lW8-0S3UlH?X%!o?#3zpx&1jEO?RAm8ul*8x|4?umf5tD+%wod2;G*kN;fkXI8pxbK|1>r%TF*obUH#sCoiAzH5KM%=cqNtX)mfcxb*etp;oM2v z<0;LXJ$!sT`c+1o)UY)vED?(C5cs`Qh1*NFU4NSwWDWHQdppH$L(PDl;fV%F9X-C& z(Wmwktb6QqYZKXV*2+a6b@6X|#>TqA$ljA`E%f-NVZGH(n5fw;gwrt~{5|fc`|ST^ zXb~x?Wvds1TAkeN72GGXQGsclj~h3zwLj%8+%A(4HQF^Ta?K8pzH=7MymKviNU~9t z-~I`>_ILNRi?f!FTHS_e6fzKJdmm8>{nxe3MZN5-l3?@hJhzQqy^k)4Lm2Mr6O9p; zos6th`(Y?>V-n>lf;532-GxUAL<1~(x~k&!Dg&sf(NKVyC(EzCjUxwPbrU|Hq=YR@v{# zxpch)bD*1pcJ{|9DnKq$1 zHk`;H8m=+@&6YnHQugN9l7C*#_q2)V`?&A3enS*gYO$w-*Sw9f2pqlq37}OD9X}NPN1r#XqQ{TT$!}{t z-G|vikUx)R{i4=cTF6*9#6_+w-LAs1@UP?|xHi z28OX@p{HX$-`D%|$HsC08Tru+&+Kv6Q)67Mie2x#_|bb? zWc|V@s?Su9z;D`|Hmh1*xG1dl*>xw{c{%!ZOItR-b8)(4^Ii!@Lx|npiwB>ewyT%g zY6Y0rsR&n}uPqN}w83NKavl}Po!JBjBG-F_)2dD*#$p){U{AXozJ>Z$^@cilfCQ#g zBw@#fnb(jIl;AQ}yqpe_C9*^C4VQsN%CZ6k^(WmE$w{57iaS?IqHpT5yLCIHTXQv$+ zxU7G0wa>kCaw?K@Y7RY;v!g{+ua~~AO&Pu*UlXA^FaGK0>xY*8^JGQO0P^^dWu9F# ztUfb-&v>q(-ahrzV&|LW3HEu36AM?~O!@sH|MmZ-@;lT3t~<70uVr03=ir~K@_4K% z{>1T1&j$Xvam@N}Pv!pd;O^h`=6VJ^u;vtm^&kF;Xa4YE*GxLJ>Ktu&_d%nnZwmvg z{_NGLV!c<-G@tP03!+Vc|9tA6!kIN0q!uX_#(!)Yv9h&K8q*-`he@AwT-GaZqv`b3 z?PN+&P>hlkq zc11}^7n#(n-7Sk4=Tg^pxZcTcB>rd!*jD=lW)HP^$;X>PcD<-$nV(d%_i0+*aa&Tu zzZRA!xn^uwIq}>yhxPewO@JjbKCma5-~Oj((e8P_HLEyTqkG+jVYQR{hBi7h+GyFL zDfM6f-4VpY+uv^C>Tkx>K4j56Vc(Ihv9mp68n4*Aa{BM>yGIy2#=Pkk8mG8<(lgy2 z)1dM6r0)Nky}kP1LQDP4trrPXjzujV=W~BdChm1=E0GfIxIKH_+-YaN4*Wctf5BzD z1R~+%6tdNF)5ZE14{y9RE&t1(@&jYfjOu^=u4VlP@0Wj4vSrfNhjre1S~>i+=;^VK zsOF|~?T?1EoR`zl&pS2HE1LYW=Wu;Xi>0ysv(Ki(O&pK1hLvbjW%{NNSNl=rS6x3{ z`}H3K_9T!87L2W3Y=vnjf2!g9wL7vMsx@f3rh$FcFJEV04+Y`*{Hk$K*{e552$4{o zM<~+ZI<%r3xG8D)tVw{L#SB+nE9Az@XYS)qsur6G?0?^z5ueKUu-<7=&6JSgEt@== z`abGmRNkz=j+)~@+P(TrkSqH$=MuTt!rwC6ROv#hJAG#G$yX(j)(Jn&?7Sdkc)*RX zmrd>80+`gs36!egym@OUREh5r9rT5LGSLy-5y<?mVHs`An0IU)Y47 zaP>`2@#mx^dImJSTJ+%7w2&Tujw;Apapu9TSN^Nk9X{`O`&RQNg@HYzH9ls*!e4Iq zq1nKI9VSUPe$QQ{o^D}fP#n>}eA>D>j|-C<{> zk`z_y>J2n*J%4Rk{>0d9O4zmcYlpketTJ*~^~Bo{rJ#>c=$oQ?G|HZ^J@0-C>-a|= z!+u@!cbNZN6VIw6ubVdv;_3i2PU(yGhO4^=r8a zoGe__GCB&T^&87HO{^xd5UI%@OnF1@bn!Xf`xZ2oW~|NReUBeJ_(|XFFWUrCww{$w_4xU|Rmh+26Jo{+yXgL`k+TJQQUev}kOdaWQ{~4EgfF^8Q5?#_lBW!Yfyf4&SxAlz}?U zX<8*^aCL?(o8j>1!=y25avob;Io#d9N!4S5F@?f)!t?d`ePzT+hcpzB%&Zfu^PB8uZv1@%jJj74N*;(6oH@zu*1t)_q*H7A+d? z`_CtJjlJ6LacO$ztAEQ2&!&eBRMnH>FTAe#y|u+t%zfLnpLf1`kDXg%m*+A4$FET& z8#&_qi`ev0m2b{IY}fASh(n>Y#Tih&vw4KHiRUd35AQR~{N3A}THe2}>0>n4#3Xn; z7Z$vNDn|Kb^Ttmb&)hya=e})CkKY!C)?U-+VPed@^9e(Lc-P{}+3w%cg?Jl;!wt}y zZ)0*2-iIwz6+`=jFMyEDCMFvEY`l{FWe$Vp9dibx&OkF%CQOuFecbemFKQUd)p@_l z&1lcx?Wvs=O$NohzNM-5X(NM1qafmAqaeh;ua|@+i2s=MmkA5Kf88cc9XGWJ!g1Hw z_O7wNkCN!4;Occl16mwx8gQ}XiP`0@j~g!_m$z#D?#B+E)xR_oUJsQ&CG*?YgBJYo z`JN;7*Kh0L*SveE|+dl?Txqov@pu8VZctWmfOp5O4WYSBu`F?`I3KHHGgNf*R%R%_s3C= zFFzYwZ}pxjra3u7J@Pg#C?ky7x0^S!%#Fob_X_b6yThExO?*=F%c4+u9^d9Hpg!j1 z_Eo&m;-KyL!fJPgsB^#zCkM>vw1t=rs45eBpNg`Uu7Xzn9;<8xESHr81u)UYM4F2U zf>v}4Z%wIP;rMVhhYPo1xfX`cM<>9$Ep2{{}l$4vcm=!9zfMh5_8N7Z;{j_ z<353QQ^?Y|M1UaPa3+Aj6wAZ*N19!mjVp?mQx&%5V>{M~)6J3>?*I2!o4i@nKwLOoHv0k}=&7aSDV*W+L)@mE>x` zfI0pNxHf+O_%Cf(E)IIW1?AU6#CqJDkFKd-hA~2--nyb(uXq5n2QVoDJryy zWX72&6u{aKLc1;W$D2Tgb)rUK2&{W|XgKoLiN(?YAmkt+g2zd=uh-<5^#@M0%*p4# zcc6N+m3M_kiFoaboPItC;(Hk|A%sKMSmLsVbs)Az=;S1_kRD1i@Mvca-!#hJL0#9K z-=E@TU%rNRo(|_5DPU>0N>ILW!$>IeY~&+kpq#oR-r!P^*?QLs2%hTMtk3{(C0mF& zM;`a;4bT5_-aTUji(V3Lv8hd@nb+BqQ{UGHJVH1_5k&@mH;Hl`5(KC*lAj3qtx0a{ z!t1%Ez1I3U*C}J^_8LeSV5LhLDK}6p-bM_iy_@NiZ!c4-$I=&DTYX+i}^Ugj%p-y5?GV=+hTa08wQ!6h0Idsm^5h5r}g&% z4bnw`ChgnTL$)5W%Bt10*GLjj7$#BZDFo*_;rdc;<)M$>^fqZ?Qv3o6=ktDyqePaRRQ2=ozS_{uT zcm6yM!-jstb1mM9S_Op?1^P*%ZUkqtZZMerDT2UjNg$5+iPBF7O&XAL=#lyavOiD5!V1Hu%s~lq}=m+k+wJL*nQ2Yfz{~3;L?S`x`0k$o*_1Lz!$0`(#VDzL;fnGlM39v6{6Nwptr!l%IEXVE4 z^tzoK(B2aH8Td8?B!(fj?0r@pNkZm&{uY=d`hN#BR`yJkL56uUsH=#jWoS~?@RyE8 zS(CkzwC@Jb*4KYNjwxh8)nts;;?=?tJFeislbv11amBLaM#7&_DV2f#j# zms*lO86sjb?%f)}Wg|&C{A9JhFK@y zTHJrq^;vZ#B$Ac1k5gJJlTTnRH3Q=7E9WxTx`{{8QIUh}TE1S$2X@14zLWMF@@hu= zPM+LOj=fCy@Sb47XcE?}wf_41x!`&JoG<L)|h@+WQ0;Hxrk>*$7=8xd5P+LR%Qw(T?7fK)oF!4T z=-10%HL$Id$h-hWFvtT<`afj|WedwRMV}sdnM601nPNE?$a4sVxlI2JVJ5}j%SjCT znGVlQm`9Sq0mDXkeh&TVMQxCM6u&^wng+nnrZG~I$u7DWsHFoXiFl5YxZ z{1Pra{?gmo?5XpX40kU0d;0PDzcMND!7IDd4ul9VA79mQ_b%qt=(bk{AqIl2n~LUW z5T|2;#pS$bS`{v( zyOe@HPMRx|8+iK}{s}NzWo|V!Dktgh@6SYTucD6lZcpNRT#;X=e44rJg-ql(k;*RPmo3!3$Hbj_X83m64r`9 z%c>+!EdoVRxU%*a{l*c;pTU1>Qcl`NXm|=M!dn2MA1Mwrh=TEj98#O_dDu#NC4=Vg zZ4LAStbmZ#9WZ^yJT&tRV616Oj?t>e_GuR$+~PcCH=ew22zO2j_Xfuwym*GP>g+=2 zqKwU(=P_PgypXGg#1b*u*%HZ%+h1Z_?Or$;58j4k*P9&8vEP^CFEOr$mk_b>)z@v_ z+yt?!mRe8`FT~_LB4W*XXsxtwPJ{DMsHMKYBNzxi~Mc2N;jJh@&>4E+sL zb|vP`BSG#AQzG9T$bMc*CE6p@x<@)yyzVXevtl44JZ{)+@QV>zNl}K9#T~JxI9lo& zTq)b|%|47j@ltQ`R>Dx}#~ul$iXl+rxU~y)=sl5khxE`Dn;R*(1J*?Z<)<5f$R^lugvUb6D>g-73S#{pmF5}IuqF`~(- zQ>S2PPUjd_w=%zDQ`9QMaeT|~_pCtOuSFclEsbl`2xSuY3RYBT7h0k|5#NUy*ctLy z;*c%fSrkQojFcI(hheBRbJLJ`Qa0MJ`@pF5`+iS@#G_ioD^mjYw9Y%d#k+7Zpv7tDrC9`W5@6hA{zgkbBXKp+xH6f>Ar< ztvGyO6BdlF=v6q2C6at{b_+N6Otx3FV(^S*phn!HlOtMldW`CsR7GioUr^_b=cMZm z2?^P`px;LAcqg25o!AAQ)&YkB(ZZ&p1WwsA8;0?I$wu-I8pdH-)TIS~N z8>w=+f=8*y<^yUF)KREql!WiR#HV6kXvInPgvjy@sag}}H@Po;H*AcLz2DYXd)}^3 z-R8_lYK9|g%MPUS0~k4nkN?8YVr$SQmcp_QZf(i19YHKc?SVfJr38Z85dHUREOz7k zCEIHkB#YfDwitiebMDXM8(B|0f`8EMhkt7TfdIzhdlsPi`N?~i@@6g7q>RD%;ll^s zrc{$AocAwLsh*(c+BLg&EkhiN!{>Co!8V@5E^iKoO%~nQ6nf{mh^NzI9NB-XK9i%u$}*(DS_H|_&w4hg1B=+$xptKaWzHExPh$Ubb92XGT2RVh zqxQov{bJ0t(( z$7Ne!UyVJf9IJPG;yW)j3O1k6YQ~tl)z0_?%Vc>%sW0=aaU@k~B6&6~Tej5L9;+4S z)27C8gjUA<8$k=lu+?o^cdfQJH$PneyS<0_9Mx*n=xS<2S?gkzq-dI-pRe^5R9aLf zw)lQ2ePf|%)aBY#w1o_-9va4e>hT@f1k2R7973I(s`**G&XT%YGn~MAGi*$MzjCE# zKtL^qR~@T&Nw&w^l;g!q8Rlxmy5qu8JM4_BblK+27BMor(d(%lf9dxHA;N~@ho%H5 zVx&yFGBdI4*ohU$vTvq*g&F8DWJpGBzWQn#9T+_|%I2vOF(>NgQ;`CQrGH15B~L`RBuC{?tnS?DR=GHDP&JM(*ap;O$5o&6%fIMiswU^avU z!)fMJ0E5~X8{sH47?;EGPISFEK+7VYZHOExER_keRl1n=VUP2)wtf~8M{0|e4jy2h z6lPQb@5>82nX?g^*)P?6+*Mgzv#Gu{(rbPZ4@R@Qo~dD2gidB4i~)fzm5T}y%1ojy zX7l@iP5q#M^$Ylb|J~(lPl&g{Zj&!F0DT-$OisG;Ij5U5EJz&35T-P}RJhG~ zHN+i8#s?)x3k<|XLT`Z$SfNyOEN60?^3oYj6FtTPR`^K(sWh{y{&>K3uuzkQVgS(fAR! ztIl{ft-Q7-O4zW#O^{re*~0NHv1=wZNBw=Jon7O`vRqmRg2Y@YXM@?i%C{?Nxwp6X zpp*O!iILH@Q8RH2l&Pr(YXEF&j+D(3ZbNY?l9`38Yf2&qU+5VSCou$isvjwbT3aEj zIc8SZD4eLFS@0c>zZ<^|^B5PVc8L2Midc@!zn`ozVG{S@A2PnoBDn~pZEK^Uf1h-U9XD=hxNvGR8n%f zxpqza{|TTp!MD}kx9V$2K<&{Fvz8vYb2jSV&#ezx6p)&Kg0Ow@_+ur0^PZ+deOAiwQHm0Gu`U-Dg-tvJ?!$B#ewd+^_^2$#}7|dI>DrSP`Jfl+t=+Gey z239^#E30G=E%^9`Ls7SwHsG7%v7L%cSfzWMHSK%>_+tL%+Vq~>IF{Ukow0q~(8hE{ zn)f<*P3m=4EE5C?Goc+khw*9nR4i<*G5Np$Qsc+2H}-!*0AmO^}ooRvYwka&lT%1cCTl! z{dJLpn;E-i&zwCwyQ_*0@{1q>Nsri(d>-TeOP9XBFq!4u&$hA8Tb07N91r3_uq{t^ z#R^m2<^ZpKWnh%+$a|Gcc!oi{7k-C2Na}vMYajo7z?+xtsC2s_x>Uj<<~eHw2;-4H zTG87Jx?%_Mi%za@^ltt5&(>U+tfqy0*)-SSr)^vKy>i7^ND7tx4qMo<6-#q`_T@H3-K#?HYf%yD(6tg)y#k?lTA~ju3}4! zrlKH(t+-nE*pKZN(`HtWV-RKDLx$X?`j=1OL|hU1bENUX?$2w0On^>ei|_L<+2W1! zlDfi_J)EOV-D*YD?3WI0&u)+^Sm$>i{QC!S&J+LC}QJPIcC+-%&N>gcF;nk`0U z+YwfZ66>~Uh;+c(Cn1K_3{-SPVzV`k5w{kO!h>Q#)oN=(Q%U){d^C}5`NwPz^jc7I} zLsJ>L!sJU@-d)7%8Q(lek^YKrcZPS zW~J!8Rt=|}G#FN(Vk|$@A#m&6wToW0%b^mU;G)@oQKp5H+MX+aI_v&VEdc%$NVIl^ zmRxN>xN^SaqN%e8T5^m#RXaMV@QPVdJJUMN*t1Od8ioN-N3t>++lU)^ovl_at-^uJ zIE784{!@c>B>xmpYrhLyERK|B;fL}?&?;{yvk45dba^%|6k64Dv7#Jo5Jtp5)Xh3x z3S_#RN!#(30L_YdVqg2_3xjz#JmsB?A#dj?3Yt@YGtI3za*+nN{`DPs-el8|_NxcC z%igo?OfZeYC#ais1o(f%MHazpZi`t}U+8r+&jb*^=AD7!YJq2Q(`Nnk`xr59kTAqR zhMwEYyWc z)9Cz^zXaF#7joQSg*|r`Zkf%77c?AC($q*Hi^1>kKP!M+#H}c<=2Mysa?=95GWJc> zZL}poCOp!JGt6gnH6_RsH)Y_Y9hltmLDZfj_cWzG2b*)y7=*HD(gZ7UeA-!TPgS+# z8=>O??unCrx_W zG~!ij41~Fbb?eMRA`gcENckXRHg3Wvg4agTd$|MVD`(HDTWETD>S6i8Ne$_1=?QBX zVPDiu)~qz9GH3+KJzEe_K%HuSfJAek#D{?D2!|jJNwAK)4Y!#(2D<7harOc=N+C<4fho>)RO}Zbvb2lOY?AuTxFFJU2;i#Bl+v-!EnF&WR*9POZ5UnF5S&Q#} z4FJ?ZBU4b^dGQaBT}1cXKCqN+cpNI384FmC=btd}-#-wxL118`4jUfb+=q7)UzG}N z3_(%3irGtQragq%CQX~>%O*uWRoHgu1iO9l!&bVGF|x9i?G5f=M=1!5Jm3j!f0JJ) zA(4yP2zHqRT_dsBMed}uq|W`FoDHC zCs2|rX0h6Y*8?^eWze(dMncFyavFW(R@$t_96erwswBCEz(nCoOKLh;I@vhkUGmM4 z_RfYyZx#@h=gXjU@80`7k_z`eTh?5uzxtZr{EQJ~Eo>J+h* z&gcgKwL^(^^~Y>XfD#f>X>RhajuhQ7P>qfo-M@nv48c`*-F(42(F4XzAEM{x`0ac| z8tu8)rxV^8Nc6*n$qn_8M(@P9l1w$*yoUfpmN1fN73;${;V6jxCNa^&%mm<5AcF;X zJ6Z?@(|c;Fm1Va9L%G<3>X3#;vmx3jR527C&#Ua-c*2ZkKy47JIjUp`{)R)$J0PS2 z5vk%oIDF_3)Zj8ZA1cizR#wYOAD)?*3ys6?O$Suq9#s;dLY)56MPMwHEXhgfhkya6 z2WdcGK%Fbr0C)qTC~*NIwN;m6gJv+*ZdCX7j*zD~8rX`XUo32;#7nh^+2vi#Ft^iI zG?wKz3NJRlP>k1HCd7NBe@O$$X_cIqO)$5CMQxhDQC;&c|F$6!=WJFzbMD znlw=^`N@4!fwrH9YBolcCMpUgKYUt_s3+9sp2IY#wUDS%EZ}3$nDe>AuV5^?uUpJetYEIq=$l4i9 zcDjalJo9mVbAal`vY37%gaDnIK^=V(SH#DQ)*Ic)N+l~{LaVNbDB4Yi$+ig0I`5JY ziwCiYlRM-lf)}e90oOgFy3m>`M4=ejgP|gA*8mpj8ztJsym|BDxC(ay_WqC@)eTw+ z4pBD`y?}`1={-v^d60>hdQmNlE|4Ssg0m2|gw$kIvAN$i4B$u7z9A z9DhKRQ}-4iwzDL{^byNm5R(+p$pe5umx~5=c5Vcexr9ZzlFH(WoR|YMfG8HCm3)IOt2;5D^%*;XZ1TB-AErpu9XJq@ zL*;(}*(`Dy--rmuW}kN3#N(U<9HSrG5L$^0L*Ib~t@Is0ju1nMDo;Vlwng1?WUj;a zf0=knAr_BK?@{%H= zsT7zd11y^?jg2*A6S!F~Fk)DsH4T9?QKpgQ$WXOv~ z_K-FFFL+1d2pl2mQ59&NT2l*)K@fA)>Wl-?+#vn0e58X%nSW0VFkm`6?XOyUtH&mr|m=o%!1jHN0Z z@aoBX)Hq>uO*oM;CTT#Dp`f5;M2FOV}AvQh6y>j z>f10&`1Wk`Bmrb($dw=@ZBK6k>tF5e?#}&|Zi-P`P-=&(k9{cn=tWP)uaTRhiVX_s zUQ^BxAM&DF-uP7$dEKG0hTHi}q$Q$mBdMc_g~e%nC?3$KpmR(Br$BTCe$s(bslqES zoyvIcD{H0dxcK;R^s#^|iz|R=^&4|@bGbo6=RDl5%^RvW?jepy+CW1&(FhH@w%Ze?6t8j?w#{8Kcrmtk07GIRI~ zc?R5~&K6i%$sm3(ClP9w%HMRGN=B>0X@-YGJNzqjDpa1-X!=o5`>W8lZCZq&y za2dbg>HD0()_}t{kXR)VlL(ulkrip!5TbVQ)u~vP&(t0dRaGi&|DJDNlSW*eg#o!* zYY_F?`}E~szu(4zt%9M}_SEsV9nKII5cr z!Ekd$7jfy~T$o&M^5feb4i$)M(@3KP;HNK+*KFbA%heDS1U8>jDBC10AS-Cc3@&d- z<76F5&~YC$=;%=1y+S(&k5{dBq_6KCpqKJP>cyGgu3xuqAoD>$cyQK;?3)mFUey0G zW*hzEg5Lb}LHo*f2JLokO<#~$q8bnqZ89lFRkiwz(q3o{7Rm^PMr@L@JzfU zGag&K_2VJ{R1w*`8f6vimxlddG=Q$;M@VN9EIpJ=k`IkjFefZ>1{;Jc_kOnqfUkwv zGD9Zr%XecJOBX>WC?E*+@*dz?yYDQSwFC0=01iL3j4Cw~7hAhxiFf>pkcV^oAX6iA zzlY^OTXZKI9=$+*lEfj{Q4#?*rYVrdk?cYi;|zLH#a&0eNW(F1L6GUn+L_awx3& zoE1J1uZyN2%*#raC&;x;hl{MmKa5?v6iAap+f)*J2GLjB^iGr1mD=4_>GJ47??gBj(`Rr8#np;bk5`j?jD)-X(r@XPE%H zGny~w4*Wz{00DH^rR{Ef6Ri*9e8ZZ3ib_;f!p;)!jxh1m7%K}WO@v{V{B=^eOuq#* zRzo)4S>qNV{;fTPd@k*%94O zL}aB7lH{3W`TYQ7(4E9yG>Panpp+&D$SP28{ng`|H(f+g!H*2$Nd8E)*8&o&&LJLL zd2S~en0i&3T4LQ!C`P^%X0;JhrwY|RVg)HS*aI_y#`R9LGcHX;XuoI)w?Z1<5yU?A zW|c>1dN{Wyen@TLm#}SHASW$({ps5i03ffD5CN()!>!YHDuAxUGA6yZ1c(}dd=X~F zv)rM5`(>*1Bvxgyf|du)IZ8yA>`Q+w^yR05{z4&QFOlw+))tGj>}ZP-Ea_a(JCgOO zcG-|`$=`NyZ4pptIb?jxUe9P-P_`MVAGitfNon4Uu_J0y&xFg@Q+ziYG9?yb0o=*y zJuOomSLa|y^q`Sr=^2JQD9m!L zqxhs+TAXfWMAMHxqRdu`Wg~X2N^IfdTKSdyV=?Q3Zjj*8mk$D~!2yPba(jN$C(%yp zF_j2&=vBTg@STy+u{5wd!YVD9!DvF2JwK1gHwExWXLHeI2o^aofkoSO>t;U8GI9f^ zU!Si1crbUpS-0j5wGV>&me-?if=Y&fc7 z?Scq~#Wo3Bx2~at-f&@ZJ9?`qLS~`2s50m&QgN83 z@inW|zn5`iX$OL{^eddK7)l$S&pp}D!3m+%x|B`nM{RI`uBg^_A(f%eweTVhG%1_4 zxP=A{{{g4(bT#cPh^1E{@E3r}{E4>gUq=%SV|!W;k<$k1_NR9u*MDFiVHPgxEtsn1 zHGW$33+1&c7KjVA^M3OwKXUEqBVr zR$8NR1kzg*Xv@25x>HcR0PY-lz7uVK}j?k)ncWOrP2jOoh_IhYpPDdEp z#cNArzCGYN)RtK3R*v!5i)gWPepq z3hq!(o{|#t)cw3t5hhXs1M#L}08;XB?yeEZr)GZ3u%LHGn0nML^jd~l9<`QpHN^|O z!K7|Gu1-BVg4XT%={?scB_Uo=Cy|FnUQthFg3B#_RONFB#*i^NBdMNA2O>nmC%QD3 zu_>#5*ui2>8%+uf(!k4?^PDGrdqauBbv#8G!g`fRq1yTcwAjwfAa9BuIVqB=PwE%Q zv5Hdi``kX#d;B^xi!uOe?g28+FmfOnN|Yag)l_PYn?Fr(p>=;!+$DF3pS5e@ zBG7?+a4?_Nbbwc@`LUFTMyiGB2sC?8rtp0i0Fx)6nSekO5eUj&Y1>6DnBll{|-3MbtO zqV(U-IP=zdck1)OI$Z5S12oYtss}HIcpP;Uq(h2_9}b28lVpcOHG#G$TN$&rIYey& zF%ah^=Yf5pDX=g{*v=0rf#xf?C-d0+ost6AP1`<=*BGRm0x^c0qUXl&7=k%3Zr6yK zKmL2XW+9^dlN39uys~e$Mz)BVIw4ej8ybDH=@>3++q;0y)>D5@TKSH|B|MPu1`|GB)kPtHO0=#B)O7pM?hbq1A4buIO(Z03`azPF3}FNsM9<4p z$;)h=c6T&8+e6W+u{I%0gL2^E47q z$ix`MfgJ4hV}Sgil@MC-7N#aLYS!;*w0wylB&_l~@~z&)(*tZP&~`?mJ!bIQe*o&0 zmX%_w!_})l!GObsj5xmf%svi`HZ6+Krvx!}sfanC-4&dZMn*wXZGZD#rcqoJKX{2_ zT&NF(NNaUYejTgOq4+fGDoXe!H%+PCI zU96da66nFswbv*z0O*|Mp-|!4yDIp|af81iLln@KoX>P9;sH&E2JackH-obUT%l4( zM%_oC@&d|gS0sV7TnrR{y4A;DC>20$sQibA6M+T)HV3cU{dDYQRL_sEM!ZVy;it{Q zUsnSOV#eXR_uu%#q%&6^F0^ls_iAgGepJ zNN7-`)aQUty6^D)FTC!Ix*TDEtRtIYP^dj#9mCMMO~3i$7FZ#T@!unabya7c-Yjt? z)QJqI1~fx8nmFPHC2vl1RIDP~Y2Xw3|A@J!B4HEgKUr|7@A*Qg+!tqrT85!)vg(ol zkgcvAiE3A{wsi#~zXjk{do6TC;eLrr#lGQ-8|34RHJJPtN%e#S=WhuBnx`gWgDw^^ zi$TbqheqfncBh&;U>EV#$E#S6M2AKRihf)a0y3IAenV;8iW-vHa3?FiF&70r@KdCK zim__f^NZY6cnD@NRW7Dyob)lyQ44{xKJa1fQK1?xO?Lo6|}3K!iH z7;3e`DJ3d?;b$qft5z1n&^hGLc3W|@Fc#ftj(~Uq2F;^@m&Gr|bXcuBfAL|mgLFmH z*@c~enZ3HCJ3koC&L6QGq)0GHcQ#NtAAdD_I@Loy=f0<)1qoM^i@>3BX1!!>0>YRY z&h{aGNfn0k>#^^modz)@xB7l`SXp|HVBsaoQ1wg^!CpbtR}SZxMZ$&XkkP&r3sMh3 z9w~}ZFRFC`RWSQuM)GCY*tYD8g+BQdYMgQ!Pux>feO@vp9ua(xuFYNIkd|o60l)8m zk1U~#R@mX^R&!>LV$#pdx-6`89jVYoA_H1PBscFqxgmppD*t7%I~;8)kqWYia+DQ( z^xmMI_?*MWvkjH=ll3DjDjY4-Fv4oqKK`a_sUa8b_@JS|O*e;+F&LdCc&yfOnUQ!A zM5Y)lgM-n;W0&NZk{QOFa?ybZNM)AD=kap}fzeMH{2@s`%zro+EhZlm^Ig-K-?r3_ zt0uTGU12w09OCgU0>^Mva6ZHMU1&uinPEC8YG78|(cn>O*^U7VNLc=%$2iEOb{~KI z(el%ab8yPkG?UTCftRL|o{I!xFnQFH%glcJFR9!d+11IvF64^l$ zDfL6oVZxD0M69{G^UJh-_gGAWb|8UH1H@V6ug7|5!h>XAjplQrduC%Z@2_KF1{5&s#4GoBtm}Jgs}6px0MBaA4QP+q0gaMSM>`aw%FX zc7L;}mPRIu0yY~T1HVx_UtyIqzPse36`7HS$jc_B1|)q~DrULvLTTZ}7p&bp%0XTQ z@Y<2xLCsY(9v*BK=c`MBqiU0XLho@F4NfdL%-l5!^aRFN!eu%=Dz63bhzqidM#rd? zsPIRKkqauHgQ4k6oi_fB59{){syg=~WY;s(BHf+#_=J$ur{lGQdjj$E8@#hAWl~q~ zt<-qq{jF8&s{CT@W$kfIa3PJwc8N2E1OV58-cdg9y_y^u?W5C7+d@S$BAN=EC* z1S)vhrMZW1;Y0GBcK>k-dh*W*#WcZF*A$ckzwuYY_I#R;lZaEk4tbAX5$|l{Zc6iM zH*I49mI(`=6!<^m#>lDn z?%$t%Jv_N96^*u)!`4a0&-ddr;}s+p4nLMdGk;CdHG+OgX5r6rbP)$xOdtx8@77w`zs@*3AYXDQBY{FYYyih)A?zjq2aX55SDC5PfENXbdVbaGQ-UDN?a0yMr+n@o2F|!zp|Rn$9F{M=U*yxM#j^s9%a12>)ZRg zZqd$GxnC6>&>$$G3TTJAC-=fPU6;T-vpO0t?hfxu+jLb6QoF80MD&nF(+VJkyNL_bqg;7LK#MnKXA>+GYHUpi*en3EQZi}0u|k)BdGUa;Ws8%6 z$P4NrEdqp$UWR)H|50yNyh>Sg=una#HnWjRl%QtypovtRQlcYAiI;Kri4y3}Z3!udKtRo+AU!a_pOQ9Zc6k&%ejgLQkM^rtEJlqI}`uX~#qaM?o7<*mW(!FU{Hd}d`FFUy#vRdqh zT)W?bHVWJJ=K&YsN11`iyv)dJvZiWR+j$R5Y40GkFgV^i zAEHmInkMVTv0%L-g?+#bn4fGDOD3&c0 zbj2G8#j{}my3vaSdCEv3Hak1D@y2kOUApc3U@X=M^VvkH(PIRM5Tlknad`h4t#6`$ zxO7PdS{!q^gaS1ltwLue_-7Sg6+uabbp09MxC)`yK}0~##~!qmRE#be2m5dKC&Mlz z^r6yH8-^6t4vbX_CR7TI>dCp2$ypw7l>_93NIeU~X4A#~zCL#8Nw5Aa4b)OHZJLvT zNq3GmxzpQ;`?76sB^3_j59TQp2kW6E(+&QNrD7^)zA^kM3X!VEi)uE5xwN<$FHad< z+`D%hKoV%Wm<=>?ZMi#yM;h3_+Ky6FypmoDEpblCl+(9onIWDigfu}0J%l&v<$T3 z2Rj+_Vqr=e(Mj%N#ADX!Xr$NORO7r&N!pl1@-VfC8&QBK)wEbG)d7HF&`t{?)22)o z&9CRYfeYjX$+xFA)bwm$&J>3TNXw5l-ZEVjY-^rU4?Tl4)Q%x7IZ+P~o0OEys1Br( zQUkV&-8EXHZ3tTSn-FCAel1ce-k`A$W=tvJC1Zpjx`utGOT&P06r>v41&6LfYs39G z%DNT>FVmBSyw%gU87X0p&GU@R%*%%&hj0DruQ4PEP7-n+M@#7RCEodG&rVFi9Dm!K z9K^Pype0q>v5Dl%qGiifs5p>GYc2#J?%XdWQ)`k%`~kcK0O6!~6FrWZMW%WQG!Pi! z@Bx^#m}GB52z{m#$(7U$^EmEchQ~0=wuCTNl=FAR9y<6e{<1Ymz#5LK8@0Yc)>gFa z^g7&4r-M7|dk#B7`vue>KQ+NF@~pJ6r3b?O0$8!ke`K3+cM`Y37?Vz-$Rz&)CJ%DW zG)I-vbH;f#!7Mv{`_`lp!T6ZW9p}IbktJNg^<;d}lTAm3y4k@T<48WnD$AnLa?K9V z#TKdU4F)!TV2*5sF@>URLfChL`LfwZ_X9Sim zx_4Y(;%Zi;HNTf+%ueuR7LapmFOp<&1-nK<&y0M=`d72vaE72ql2=W%ehM7Mp@@*oMBUl7YWyNNs4m?`v0dnw_csO1}J?GTVU0U*siY8o8e z#2x3WgiD5agch-8ntwg*!v895;x1Nv*Djs$DI9m5@zAfHUj<{%=?Uk>;~VOD<|uE8 zwq6F&jzIar<{N*UHKvX^9i&m_YJ@I$nh!_w&gPqsQAC%kyCV?G(ZIiJS752Zpz*A_ zMF(~T1_x6z_>=v2Pb0pABFy;pj=TVBgev^%>QGZN>JzGFd8t7XbOaqoAUyObSsVoQ z1~XIpO(+o=pfDtfzClO+jB4&un&$`BJ#1h%>E>CFdtfN;?qnZb-Mg!a2`{FPn9kY{q9jFa3B?P5<%9%H3oy^gA%CS+V1>l3ol zBCSDOY%=Rcd{lKJJr2_$5|@+W1LfaQ;T z0?P(XcCT_iwgTSo8FN>cLG$Qho4C*FL&Mw{ph|nw$s<(27u*4zwj^-*mvYTsQHQf- z=A(sgs;BVVd_ZhHnL@Z=EJ{YmxDE^6pXheEVP7S|P;G?NzD6+FPgv(@$n5!UMJ%2; zCcFu_IgWp!ui5NklV&iV@|Q? z)^lggfKmh7;M=xuUzh5E*RXSNR#sFimZJfrL(QN_w7c{TIm6d?{6wL*73$oA`VI6nT&uffib$hhH61Dlj(}Wglo|UAfyV>B$elsN_G{{I@uY$2G?puFFyUJ$O9TuL zj-q&l;+V#cpal8_dI7JhtDL%YsbJniDrc=qRMc^@S3-f*)$La?BIO&{d=17WbQD|5 z!HxE>){Q}EPdOD^AF&^+KV!19m8JRgfLA&w{8JjbC-I*<0-?66l3qG!BBj@7#no^V z)B;@X%*a<(Y8TKqenx1O56hw@Nr_OK;bX4B)dl(T4mxyb;9qJy1UDPRSM37NYq}d{ zBR~;?uGD~8Xa4P3MAGL3LCj3k!A4YO-ln#@>@)0wVE@G!W3M-qIf-%F-#5SNJ|Ayt zedB+?GBW{Mgq*S%z*iA{NeWMXb_duxC>dajWGtfiX@v_zuDVomBZ5EYqX{1+4u z#mUfr3PsQz{(!2Ski&P%395KS^9CZEK8b_l4k=h}iLdn>7oEjQCOp|?R{xVMr3LU(!$Qe&MYgb|4L(a32> z8>4dSVuiHqH52YD77$Rn4!f(-u;!R`Qw@=2z&8A1HME}GJcOqUBBwQGF$ZlkFfZDP zjqBRw-8DaW9b-@d$!l;>>V@IjISJ;RPmqJ%n3FvUe57{j1_1mC{t=pQqnT3jVA1lk z^9>Alkv{Wf+DdL7glLORa0Iz^{L=*HslVD79yZ)^sW*_bmH{GOq$hb~bNsZCh`O3A zwHG!7fx<37)5T_Ws1`gXf*Ir!sm`}dgAu!z5YH(|M~n#0CwmZd?C4|FYc=nk;NX=> zx-$Z*X^h-ZA5xW}DZp>7fvrgv>E_;S{>ieiS?w`cY~4B#+=|q+9N?mj$}pgBj}tTr zQ_%Zz!;7qbeDn7-hNXRJSMBOT_$0AMZy~Wmqy}ONApVigfbP1sC&3W$(S*xN4TKPz zMi%u?yMR%6gCm0N&FRllfIK+1hB7V?&H{nLGa4gLDV55x%L|m59KMY5EYl657?8;c zO}Qy3Jk&6T=2Q6BDo()9x*+wu_y(I;DMo=IqfTwPnB}U9FvwToB5=U#Gc=Wkz+iLx z##p(VQXe~Z?tBmJm*l0O-02))Ea0`+hY)`l(91r>m*=^C_Q&v!Tsl7;QgJF! z4+*<1+C#=Dt_JTyelf#d_R~p#8W8U(@x}OvRhw+1Yx0 znr9(UME?Bm7CP&+FeU;I6_N?JG_ci3mA(*-3ttV!n{dJJ78_65g$*cjmr^>(;7S&k z;j*!?=AWB$h|Ql`xbH^;2*xggywp1BZ~A`j9ONr@1uVxvMJ9z)2%|Yyo-++W6CeQ5 zC30}6N3$5&P|UvT&1Z+Z0%7uATdFw-&)0iB8C=tZa)pJ>C7rx#nvKV6}H;{fajX?M#Ww0dk&0ts{iL#O{QR~Y4&fX&Zw2=(BuYtzdZhkcCL1r^DLbw zrDUqb`P-tJuQbL88YG_pYkfLXa~8Lbuj<5suBtza;B4_gg(7$k#P64Z^4b6tXqvGrmMY|t z)2i4g@#F@usJdu8F&3*1c&*(Vn7*PX4BS$ES!ka;3(~7??Dmm_XIc*0{EVbT)hUo; zHH-vgY7AMD_0n{;@ox8k%%lBO5xD4Y3r^E|sk77`5A65Ugpj0lm1AcfU5b2sGo*c- zwgUtQ19I*mn7gN?8tl+wz1y5VLB2!`0HyKYhBL1QxNG8H`tq=nH`3a(F!_Mm1{o%CmWgx+0a?k!53)d0LUjowE~K^Gy{2CxK9S{#T zVaVc#HVCnYUuFFZQ)?Q0ktYNt@T>77pr)lqClEwlKVTo1_T>0EgFh@{0K?$k*420v%?|*o#SPHmW_brW|QfFNzKros)>~!hN`0oA| zXiz+|Nk|%3RI`U49?ABBsqnOreD51+K=p6f(qh@5WF2^7Ss14;3p64$NgFY>Gr%u9 z8_@N}BFI;47z%9-?Q!H&hY$xip`hPlmZ^m8p@ay^&ZcZsGstf4I8?8R&=OqO1SFWX zLGn#Y5|VUTYKH-%P}elEHL0nu-8^QsP{8=&TQG8}O^y2&z3#|l%^d=a$d^ z@EU%gRis4oke#~Z$E=ZbAyDN{p?;G=d}`|IKR61&Po5>WhJR&YVF9iS{o-N90wSm4 z7sB`nW6>)T58)8QzLZFWn~E98B%}h2XhzXR)kGzS1ut$Es{+1geEFBIh^4qRvVTFo z8mZz~8%1fmQMJxul$ov##T%)V(?eJIN*Ogq|LVIIg4Wn5YMOKm>Q4P8T4M?rpbGv_ zH78|07Wxravzz9jP~my){*08X2~k{7m>^(cN}k-@$!;W9BJ*<^(#W(1QgOPQK5DT1 zH1BJAc6K)e7&_-zR7xidJX;Ul%2(I~A;EhlB^WUf%-)5^FRB=$OH58KV1kc^2+@y! zSNbshM|54VNrNLJop?rSEBB#QDup+vZ_Zw=OCYEpHZD$36X3`tpp1mFqTmjzg8%Ek zzk=JZ;h`tx6ZM`bQi&0J_Ot>JG@~O7u%$T*@XnL&1o1f-bR$@QiJQU-n2#30SXh88 zdFD{06<7rJlOG~a9A4j zHYDvNbgxA`Q5xnroR_Wz*JQ%z$Gh zjC}-Og?*5mF_^$m@0(B5ooP}6&$OTaZ41aD9DjPS)2d@w$;l!kTl^ z!sTejhS$AhEa55K2Mf=ipU4?7wLN$Kd>WySeg-$;Yp@1qm&b&}oqndVQoo1?w5bWz zPyLJiOt_;bTC<`22v&ac+G#IJh^(Jh6a;)EzreF0^Jq&|6DrN72(A z6)q;_ft-mZ?q<7@iDKYfYADV^0)q}&RRY_I29+APLg3%AIDGu^FRG}Y(KS7~!IXmz zJeLwZgsaVDnB7paH=M*OA;oa%gKM|A9%@_0wVwexTYgmw;Cy+o(``16zrFeW`LCm@^vuVPJW$VuL?D z#7kzDo?^`q#b^)MKwl~uX_;!ly!yHBrlf`s3vbVYwLP}CbSTH*?VZE%L2)+<7o)}~ z>F9;~08EWjySsL6ht&6gjiw83)oA%jdU2#nF`je>HyeTbqE)32VHB2+_cJ~-CVjaa z;2~jbz#&RXm68mgQ0q|eDs+-M@}S6xzqD92WvX{x*=Nz;rQ0G%(YpS!A)~!_qTb6auNLYs8r>iAFLdlbvs%v!o!Us5v$wI0HgaLw`uABw3TL796H6 zM`W7X2c5@hKfu3(O`SEK;^miV8J(v0)}*+SpDoC0dqfM6D3kUtA;AH{Ee|6&CwS@_Fl)~ zFgx44!BXTO_4s#x!$*p-g>=2cp5OW8{XK1gpJ%Y#D3k?|g>fZfh?cCzOhi#I|ovYJ+$rul?hc?k1Z zKO@6uE*@VMhj@v+6#*z+H3%Vd#%)Q7l1(t}Bbjz)BpiPg%Bv*+1dtkXG8Ox3I6#W6;7&2C0aOLdJ}P_^s&zy$$Q4 zwDBy9mWT(UR1$n1f*x}FzI```(8_(q+JtmstO_A=2P0l6r?~Dx!A&7C>2d&{)GY-X zi-xBT$m7#->#rlkj4y6nD_*Q`D-E5*7hLqAMJVai{vA@v%}=L5@f~I<&Cud-NxRBe zUy3j9X_)5pq}0_(iQ@@tTn(5Z#2x%wqC6URS_edG|MlHK{0!>c_j~bV+97*q0=I@d)GKnV& zp#s##qD6Y{Bw%_)Qo&hTS;@Cf<+FUeP%KI67m_!f>}UL2_M;HX)Q6MC_xPLV`@j@n zfipaJZBJ6ffzU@UOk0lwAo(OH7LguYJ$)96CC;=6L*-Pm9i=AxR`Z5n@XSaR11Pjx z(FvD0c~w+*2RDI4ip)9{xZTR`EaU12sbwR;N%Zg zT=JC+(|*Pj*Ryk}VH3=URxVL^kgB5cn~oyQsCx(10=$2U^c>}vmke*-RBb!T#br%J z>_&YF~-bPdPml{xV4#A~Lw=`8OKtoB=Z{-6S=R^-biUgn1c)tVA~?U^wIjDAV1$isy+2+%c7z53AdC*R}zCJ zuBRz#tktEs15No6gt;m#ZDWJqbAG*j?dPifuWvxR!m6-V>?y6WPmMp==PQ0iVvy2R zNM_`0b}eMH`H-^)=Ue+r^xO5V?fIZ#&EbGs-iUes1EgT=OfK|x0e&Xf8BAVs`YJ}J}!>Y;leMAWlJ?8jA=dW)z5;jl`iz8|1rB`KyFzBOMAWgHCDWl;?Gn{utQ^ zjTC_z<32tK5HA|y0-&TJF=b-;xYwV1B9TWJ}QOlX;6dNAlp1 z`H3)=dT_EVqwmU}xDDu@!ZfgIV#2AGrjnc~)}*<|9Z}6fm~jsPtZEA2mjq)72X1km zP#DRESMvkJN{v+reLyVmE6`gP!8>Td7tu63xFc8w`T)+GUC(Bwz&?RD0*y$hP)vCj zFoS`ay$KVvOd%HH@Nept17!jIr*FvP_B1`Yo0uU>|AwdKaH0`=@%!qp*K56C9R)vZ zg}g}NPPNELuFr6&>j88maor^9t#YcVd`fmnVF0R#b&R|zI!))`U@dKvZLHTCo7>bR zQ)pC$5(@dXPZ5|^5jpteiaE71Y0!@YKV9YskarGD*=um?UQx0Z+NrI{84wpCa7nN2 z9^Nl)(Ax2SyDxY-YvHS>UYhlj7BUB2sSLYpO|&Y587muRqXeV=?qBn24#L3fJ$q%T zf%X8Y*(tJSAf=2ZL&$uKo}z028w%rHgE-Wb2=%a$8zgn`n0l!JrD8QS`f9KUU^3EW zc;~&x-+Y0RF}I*q`RB*~`RMsatnh^Me5y@qJp6#O2#gWPn$+<)^>D5@5zHHl$)-mz z3)iYP7+~so5We-TC{%_gXGZG(fZ|y|L8LTH z9c^7>d)ft$#j`yDpd1P0WzojKk`6+yjU8NjKHkX*Pij7G-2cSEPL12eDKRO?&M9M-QwE!7 z6Vj7Th2QA8_wA<8L{{7P&aiaW+S!!af18oimfg>76HY|gsJuoOpA^LZcg%?Jb@F5} zCo4J~o=MQcUzdLdfDIhGnXWN2-sw61Y^2Wni=nJ%{B?Pw94UVZ!OJu{I{H<|2k?C= z$kZ;uYx@vPk+vLWQW@!PRElj;u9XlT=^31r3mPzWa3l&OW#M$vPrWj#T~>S?#LGrA zryA_TqNf1JeG=)`VqCCDdR5zMQa^A$f|7`ht;tE|qgeY(V#IjMB*RjZZ;U<}myRK5 z(7>Nu+#wa=3-%IM;ng>B73sga$Zm!M?d{Z?#q zv_p1OGw@TghJ!QX5d#+xWuRfZN1aD4Q37%lzL(Mg=*JTwD~N(+Zx6rkh^D|GoHRA3 zW2N9bTJyjFoYP!+;&^%LoMP628n-Nl>ewx!`6g{Va|~*OYO5ttjSC!8j*4}bB&6Cl zOo+Qk%D?E><%cs&-Jj9_mh=JQ#dV{MY_5H}*0?^UK?7H-ab+tD${jN>lVqjK8VXB( z-M!~uDCBEYztkY@HQ?ziFhFkGl99>~87Yefw(vy>iUR=UqJFLw4ynl2lq@WQnit$H za+PeyC>AvtOjefB^O|xMKQk`H%&oViaS|vTND5Kw%!=7 zt$pj#W80-m<7Bg#`~24^_gFf9pYx^!k6?HLi&nMZn@!}lCI#(SDbHeGvpUH^ag0SC zKrY8{!dNX8|q@O=++I+3vVDBa|y~nb! zHnF!x$C?@JW4Almnp|+o(DEg%M`Soo4j4}M{M1XS#?NT@9BF{+9d$(gd;J9K5avEjoq>Ij};rnU;oqYf5(Wv8XTdnO*FMun!JSh>PM6X)2+7j0dKeku6 z?aix-0a|DzFK$xjXFoi*QauYnH2%%AWDs{Q441f7c;^9sm#oDrM22&cZt^V<>MpI+ zz$%2AV+IU@0yvKeh9hz+He;_U7QJymRw4rnT7y!TV1HXD!;)(+&<6Vpdv>P9l+=?v zRRWICH1~m=j|b%hf*V%JxQBYrn9(_J#+-gM77({c4M-DqNk_t{KBX8I@$n}Pbb>te zf|ZZ-acM68l2M5#mE&uyIlGyWfB>!ppcsmq`d7UarAij8((DD&tSNUTcnsdjHd{^9 z@t+6;iW;eUm~rDJOffPnID~% zk)F;$qLk#aV_WqNA{SMlBKMdE)-#5&M2E~eYV!=sk_bzpgw}wlsWIaQi-q;h)Wr;H zFbWn%uR+6HTnG-PWVkv++IL;^_r97m@`HrCqcEcp&q&trMkkEe`z(idT@ag1bkrk-*U`wo z0~&e+^|Kf@xptCT2ku+`vRs@Hiiv5x*PJHaOI9WupMn8zy259NxSNKQ>lh;qhd^5R z*THQp-Si=*bc;1RbS7^GIN)s{d-cF;fV-(1At<$>t%(m^FBSBNm7dZESobplEQGYn zngS^;Kp!;?nD1bFuKXl;!RY*pYwT@JXg1K|Sa%owDA2@*WsuHt-!xq;jo?bNm~?7% znP`OYy71b``0>Y91osIp-Y(70M4xRjMKe{?Zw&S=)Omtx`u0DwKhSb{!dW@DTY5Ln zRTK;{kMRZTp&2~2VPIB=4PHQ^KCG#nPrJavwSP#kypPHf@&a~`K8vP@YpS=^XrF*) zLaPaC4`99RO5t|u^Y&wE!GPm{i(dZz2({n7@3)#ZZZmT zUE>M4qZ{Hh%+$<+{xE1dh`vs`&P>(L$}f+CVVHIA?p+s#KAFzDupv2l4wMT-EP>U| zi8sqkVuG6gJMVl73OVI_e2!%&~ z1!Xgt14(?5$cW$8IUz_4nGA#}svf^sp9Hxivy@mfXt#IAl}TGm5zY>3{Wk|sPm zfB*8%Dq#qA;|v8CfqYL&|4Y2pIPnFERCs)AP+KPeTb{jsyl9)0Eu%Xv3m>Dk!3uGZ zcG@O{*^9Q5`;;1Z5>R;Tu?BB3+}ewrbS>|KQX;BPgwFa(V3jCFWTUdVof5m`&EQEL z#SvPF*(W7ayG!BnAuQQ5hr2gY0?>h|o?1y9vz4+%(|)?}F>j-JSaYyVleGn6d`LX` zvYvq`Z2i@rO=Or!8f}F5FFC9^j{)`-(ZMBdJ&zAYHVvd;Cz)CzdlR(n7Pe4(c^Mw7 z>?2lj`}TK|^)InQb6qp&yS%Kb4`JQ56Z7+E6)`l-N>D)O=8@yZ#TOa;$s)Afcjg#x z1ZN*CJ%eSXA0`_q1aW`8s1@suD~nZJ?i9n}~R*R0M8}BI022SxUJpOsXm>M<~g5+#VO_rNm)ok;gHrd@)=W(G0GqbhwNvq<7LaF znN)`Hg2A1`Rb`MIm4y}i4H=Qv66?U)LOU=vDp5K=&Cd8q0b~<6>Dqm9BX5{*f*mbI zrlt5TA+%XYfoFIe1#c6CdMO$$ost?=m+YcPU#AS~x#lQNc-Pox@HLt^71GIuL<7Uli(~F@WR7)J5z!(^n<;Ui?_BqNu{OaQ4*2F_0X;xnJDm| zYnPJRxvGw7@%1N0U@O<19;8hH_J+5tX-R3WRJ;81CUIdbHIBTzRk2 zI#yf}v;!mwl9IvFlfW=3C<Wa zZC5}1Y>r)Sy^oeOJosK#Myg-4o9`HQ%xS9;-ZM?t7DRTWwLA)PB5wx0iOpzTOQN?B zug2o1%u4_t-0XodtwJt<5N3gT<>lwJvCE>@WZ*l(#ZwrCC`<^NO`eibEh*a#Q)^Ns z%sZ`Tv>7>J&Fk_EH8(b=B7n3;;`v##*?3&bUF&D=gpBQmI(qn}C#gTeEZUrI`c@3^ z4d+igXm*AQpAU=x*SewK(VLF+$V2_ zrd#u7{_0EiL5}w+yPY6sG{r?_M0(U-37RK~w3yI+O_NfJ7J!$s$^+Ek8kZ$7#$pc2wbgvddbH+95!p1=#h?Tn)18REnY|`zS zYa-=qm8wxqnZl+Z74HB?_+b2d4o&;APt9GMf|JyQov9pyd`mW>I><;$%i#_0t%N2C zip%5kyPJmQ%_tp7H3cQcu^i!^KYCq!IpxnE)$8r>PtRl3 z^=7wS7RI0Rb>b4w$VaT~YiCYQ87s%rV*#D4cIKdHp~DD|VbgEky2mL1k!Rf41gg4O zKaZJ$2=$LQ3AEo(gG)kz4iBBbz#wE`ykNry=xB{N ziUEa&fuERw?&JvXfYQit&$SVuEew1_EeKFU$TxwpPf$~UN2vjmBsts@$|=9-g9XEY zsn5VpH?kUXGss+!uve)eRQqn-O@W}3IN8#Dk($(+MDiqSMkwtB%LYqb|2S0YYUN}v z9+t)9%wEr_omgX79MZ1T5UF6Y(kWx8@9o5(%fyUY8qzN%6C@vH^Glpr9kQ@Zy$nl5 z8Z!z!-lmnYYh9E#BPqymct@1ewx54ETYbIs;qR5JEc@)ed}2bQ{Lc^Ae;-r)V~4q6 zv-|yTVEMq^6uiBcH!|bKq4$l0Bm|US63boxC$6Bs;?h(hq|vSj>|r8atmTi;t5MgO zSb-nuxn52bBGi(@$BxCS<51JnF6#dN@#Y7dMJ^{9p>PyxKgqtyZ{Bw1wAh&_9L1pg=9zl&{ z3urVN&R@Uvs@V2TPy@JKC;Nh(L%(16cI=1s!DHW42>+5dkx3Q9TT=F4}-EqL$2?~j+W#-_ydQHupbt2%x3 z)mM%mG%TNo{@!)kJXk7hnud-t0ykz@%( zmkLlDZG3(YA9JDV%oZ1CTf3!OyB)X?@N$x=lcC${wnJ`b7^l{cOuvzt!wEvYVN{ z-kBG9T~%u<^J3qiim~@6lur1__Rf_ZL+5#XJ>uhfPKK1>LV$PY+4ZU38nn05%ht!L z104!U`4OYfrM`E3qURsuTO`kK7Zf2rj(Bao(YH;B>BHVf-0zxwe(Fr{H+}Y`T&%1a zJbyxSen84)Bce!M(SEM)g4a$@pF241NLw)Cp9V#1`UkpuMiL9gmF3Q8Sr8TBbFKIJ z->%iQY>>ROQ_tlC+TV}u8oRviKaR=w26&8_;7a+0wFA-L!F-POb;~!+N7W1Lz55I2 zpor8JVa<8GXQOOV9<@w4G3xgCu8(hhwYvC73NN(I%AM1DE*s!((Pz_OTL&1_Am5}Q zFx)T5RS6v(6THDWGq73U`Pein9T{sz5Dlday^#lAd7MHu>q19M_Q-OYLn&+Ke(Ar9 zRD@C*-FfP|(xc94mzQ~Oy$b;c4yU7RWTgeegx)ffeK|vYksd&8Qt|z(=F!|AJvYW3 zJn-M>H=n$)e*Ty3z}xGclIkt%?h@U=>5E4GI;FC`IQewJZ%?e|Paf5$`tM6g&O%iaWcV?dbGHt)c- zR@JKkcNSN=6~368wf@`2{ae@-W@TKyK5D7+kVK{6F;)bO4uAbMaq4eh{nYp6`0p3o zYE*pw$l_LuZT~&()z|r6+wQEsvg*ODhlMLS^2U} zGvD5NHZ9Wfi!auNS+-qggNT`nO>3ib_3MS9Pv_a($g6fv44RFzxC}}(Eis#U6gkif zkJSVBw|;f29n?d+cr1zZWy<>gY+%~^DPV$=Dqg9LTt7;5u zJpU*4&S~4f^U{PC1Jb=FnD$K@zkhF3*J+P#?l{?h^{JB^vMZv(Z?}GM_Yc3sy_HA6 zX56ceeDs7~g2`ji*!12p=VgE1N^moY$&57wvc z_DHHq|4{RM_+j*k91=znQ~!+$XElTwCs{{WmJN zu|!_yZO4C3)wWgIXj>BpO)zV&lOh$W3`EZW(@I#KXKE z*jn`cS0|{ozP*7v0I(M08vaewqv(X&_9LA6Tt^c2nSs7csM%{de zt}$6qmGz*NTmEdc=HBR}poj;iZxX0tge%5-xqFT&d-AUB$E$31cE3Q1gDu^?qR;c` zYZnHrxxQ)pM)8&0RK*F`7XM7#JbKuRQFSvv@!mM>r(7A?+&VC0vqclrn2@@^zM3-h zPUXd0hayJ@G;I07DF2DA8~@>&ynmb@4I^5(jG>VbCvE;{Q_@!*cYo39vk?QlbNBUX zcK^3kUUefdN?L0cGrH5@X}_<`skm5gVgCIm1z!(rTe7rp|DTV$_pJINCZx}WhsOd4 zo>r^EZuIO-r2od@^YIsMpK)H6Iqv+Cf444AaLX>g@$$%D7r)HBDJXWiP>p?6+WOh!6grZJRKxov*n) zFpCHYxRwfWy3FQ6x^5J!ho_MYr-SUwjq6G1hp2{Q)`@L&{`^Cf8xz^M$6N{UfIkPv zzK+dUP+BtEdal?;Ma4f_iE0Vvau+gf+QR$FiWKD(j;O6TqM^P{NkL4YAhv)ilb10q zJt@dEwz{SqAvnnWXAnTq0qxunZG-FR4%TaFQzu2o(q^B~Aiez^qWE~asjZ>Oa>!eh zcNzc~_uZn;Ih1w(F>NupUgo`;Uhnb?hCfKJeBXOV*d7zImp1{sUjq`iOXu7Xsr(;u zbRD1J?xvj51s`>F_$fL5amnccNj3+&^P<-jMcD-8mz-Ic=QXmc%X9abFY1!Qpq-c{ zb8VCpzT0(t&+q;Iv(m*Sy4x|A|C^?|8NzN^)IDeBbEDn1+X?RmJr7OkX5=TR@rq0` zpR_e=e%X(+`Qcwp`gI#Pjqx3*pPj=3&KS9iwI7vSY_avtdw(x09^4?lOUvJ;JWa@Y za=uOZftem{BYn%F0i(28ZsbK4diCgHaq04dL?#ct^>A^=(g(z57k=--cF$TE z&z{Bv{|`}b0*>YSeUE3JB_xV6Psx;IN+M;RhfJB3q9~+NAwy9zOGpx$l#nzT%g`t) zN{XnArQwLi-`e_o|NnDc=Q^jn-uHc;=f3y7_u6Z%jeU=n!uswn-3Px{uBc2m+%B@u zaL`msExY^Cfc4%>AAX$P^!c7RdNKry%w~0U_mOP;-Vb#-%oNJ{x}D)3j|T~QJaL*a zoiZH@0Bw9o-iaxQm!gr0lF}P|OJeFk+Pcsg@Gq1dMdwVUo6uv_!e5iUK8Vu;SjL-B z|C3k|PHa1<-w3OUQKHkLr$Xd1AbeJI=<>lSau-0!!o1Gk4fWy@I^lE}lj9vm-=5}U5y|O~dR96HAp}FFI;}Sr)qfohA zjpIW#VATS$g$b%&m`arWTadAFNmtH)I$QL}_ICzRTnFt{*03M_{|;20(TiJBWT))LC*lPcJ~X9xr^PF0ZR*)Z2;>XwNMC5K9S-^>n9bL2L? znQ7`$-;k;Ae)r_Yr_xhZm4A3z0yZ8KOfN;^1uf*UR@}qvr@e{8i-jND-Tl4Gy?7t9 z`CXHhoZ3ROUOcd>cD-*Gn*HpSfuZqrjlU8%ez2x)6YRgY;^t)2A5WW%p7kfo7LkK` zv+5x#BrI=6SOUqnMM;ddur~UcwP;6>NjBOb)OrSuq7rB3{>g(&sPRIaQBc`(b8~Ca z0wq50tOX?M(4HINOUa86b`zLQOrR&K-$dBBhKi#4xsDzV83q4eU-a?*spUB90>M>6 zEArgAa~jvcw$u#jX#hPL=b@-M&|aV~GHE8_CDM?-V0jheX_k<`A0R_ox~`Qp(h>A~ zcv8Z_s1>+KO)#1X=+}WCxB#NxM_6PuHEF5S#r_oCj|6l>bj$_1vM-U0z|$d^9=*nN zDD!~1MIy;0Qvs6O2qg~yrFl!O$+lF9>JoI^2^52<(%^#|U(HsnEfc=c9~e(mImUWC zxjKDS!>&5$e@hNY+&!k|>DmC^gI&t9-Q$Mo=X;*}z%ReQdAH!l5V!E7Hn`kI=;YS05qMFV^CF(}ZL2(Szx^79)d^XENC( zY|L;*dbYN-_~R&l^q=u#sZ_!QppWR)G*fVWE1!3{sgUpLnD(l0&iRdMdN;q9;ovRn z=}mr)8k=1L3n1Ub(D>Z7x%TJhHf8FkTa2`pm5B3IBLxGviWmr>_^_e(Ip$?9OEwzb zIaii(S)~>EE_ke-p4MB9^L2P-B0Bq4AFnH_dJ=D%?#$W|m*ULzB-2|MEKZ=RSgjEg zC%QC_f<6m+2<|Y^u2;T}l*)16F+1o!&4k$*n;ERocgV)xBPS}s`L|hv{F!L(4W22Q zEL73L69b5rF={X(py5>hIz!|ZQzV5R-6X)o!T?T59CpG$BO){(%J6fb-Hrndp#@aN z#95DW1W4duzS=;wKvx)qy8aAs8B9aZpno&2fCWK0J_t-ESW{Qgd?z0^cVM5?a0Yq< zE+&nVxdc)aqBn`%Fa|FGG!~jUB*7evnG!L8M1djV67k7}W4^D^pdF{4zu$1YXfio&{wv9O++I*UXHm=~w(qt!8uP%s zL9;mTVG9Or$9#1sQPRQ7qeKrcWxh`2HsC`N=1-Ecp!6=VeOT zKa_CJBB!Jfmui=8B3+@x1-qbmC8C17wq^6;jnWU^J^y3o%&2x;wGt8mn2lkKE4~u? z`(|dQVCc|nScve(UtQ1mpUD=HTG5~coGHOf06bv8`$Rd#YIp$45mbi%YfS))N9}?L zNuoa-WA=a%$;-k$q>+UTXuy|EadDBA5Xe8@a<{)X2TEvu#DLj z6px$C2K&FfeM|>UyS{3{xd81dm=W3+Z|Is_>}j06)8+Mcphxdm0yJ{`J~- z3fN00PjiS#XfV1ie0Er@IvbWr^AE4pnr9TraZjUWz5bwA)KdLrS;dEMKe+s7Mfh`u zgfpuSAt#t!pM&TWO7nBLs%r%=JofQK%NyQRO>N(nyv>lgOiP1Z%}rW!A~61Rd58wqy3NtYWl1@9*sBzv7K*L)<-%oXV|;KCFVW& z+R%PI(iv021BCDTqD5qziGD1NZiK5fjj0F8AC#X_EFKESM4E=k1J72pbpU}_2BZKE z0oh3i*U4q81M~;9;6vsM2@xRygKV47bOsF}8<$D626)|?E7wi?fR5OLwMxW*OPCr3 zdD+6FJFp!xK$qKzt}#O46&&19nZZjBd;;Re@U@1bd%$mqrVUL_%0!>DIP)!BzXw2i zpjl*57(alfQ0t&KIvr60qobo*7}|@ah$0F})Y7F~IWWJ(K~0A`Q6DJdg(I#Dcu3G) zg$#E{xYN{AbZKGofc7X25M0?8CIHC(AL)8?_a(96sN~U!E$MRCcd2|IJ&FQ$Lh zN~T@@#l9<7k9S(9U6TX1k~F1+Rk}(Ab%%)8#Se_Ep2Ljx9QW}>q z6MxbjmgN{dx8fe~-}3r^?eNGNb8LkVUy)N+Abk|vyEioAx%GyyA?u5m4&(tJUtfNE z+V2q8j{U|b%a*nxgZdv#ib6>4G*`wG5odw$(cKgMO!A^t3s}1J)TuLvT|`lG1|%9Uh6Y<5EgKMnAA#Di8|w`te*^I0)mdn6 zkhZ@gn9H3(` zCeAxv__rvz!ba9Ckj-me($&10+h|YE{NL%$7e2{#4Y$=^T!h4HXUgCys&r1R;2tQs z(|wHJbG54x_4JWpuK2Pm%-e2gr2PuE57pbxYud~Z0bSOq(Rzd>VH!JP0O`_9;so%W>N8Cd`sz4UQ$>$a4Hb$U&UI;@yw{G89^59Y3SGyMnwf3e6`ZQWDO_T3RwVY*C|_SIL|FB|1;O(!>Q@mAxh7okL@Ci+QI?|ji}764>qf7Tc~1-{BNxLD|GDS1PkWmG~A+1P}qZgI)s#?7<`6W z6w!#jUeI=RVbBy*sN^$7{AREJ?221tn@s1myc-xu#whQTKI7^?NkQ8wUhZ+(5F z3uqh(4;n?fT{A*))fQIf+KKgIKg4v4w|1y%`AkT3$-g~)OTfG5z%9_wajcqoOag!F_4wPEC%(XKCYm0 z#qj~NYPXY5k&dw4Dkk1N9xKZYG#iXVxOFNRn@cY&`O|o$y*Ar;{hvEGTIL?=3D0Cn z=yHW4fdn(w+w;kGKF6X@Pjn+?Qz|=3*bcXRo;@ohM0wGZ)Dk+zZL?T-&2BGdIdc+5 z&x!!@xi53ujV@Wc6|a2rX%lF{aDBS@w6=^^Tki{Eg@B;XdQ~yf_C-}E&YK*~3-|n0s-e(m};{d}K_ZlVB2b+T3?{fiS zE$-5QZ^NbI;ERzP5$Hak7qI0`Y$y$7-rVFB)#Cpx!pUA>U!j%A9(|@)av8yy6_~jY zfnJ#anwZdmx(FqXKE1dkHJyVO?y$5t39B3E7kt)Px>(t{QSH8TfPF`W}E!2J9)?rAq@VSM%O|*!JzK@UV!rovck?;kQasGUziUa|4 zQML=*Lm1Gt!~~%8C}zm$J_Ggz4I`jW7*@~<Rx+%d`1U<6TzmDWh#g1k#*dwrN6Dv{1&0kbD zd+}kw+rKf-PB2oC`TrM)iL@bzh&9(hpd#-m3{o^#&mG#Z0_?R%tG>JA;@9JSyg>LN zzNG}S=Zd7$9q>B=x))IOqK^G&v-rZJ{BZDi1rg&p2XOPy<%HUC;Q5m$Ys&o8Nw~nr z-eHf`Y-ffp89Z}N@^Qvvt_cp)y?b@(&q!JjlY4u?ObN?LSt7m-MlrkdglST++>w#>u zk`2)6;yr=Kz(HH<6&4W^FJwdL(j~xEs0=;Xs_-!<9H#fN48|J!^+il)yG=nn*3=sW`uS|3bn~r8}VXuSClxRvZ#J7+pOKs1myY zHY45^(GaqHEOweK4CD#~GOwQtjv5W^xK1=%aFNg(=;-J$u*N7QP^TbOSp^c*>}&@p zIM!O5TU(cvmmjUE(cF`i$q#8c(&1I$dC+v(ojaG)i~U`~5T-HmU=L}^3TQf^H8dOO z58wru<@gN~RlwlKee3Fi?J3|91(}-L=g!|lR}yS`(tdzQmPf9cV4=@GpWo)P8R&?> z8!Ur{RUj#%9CY>Hna9X6NC%GgH~v!Zzo+*9bL+uXN&H=q2qQfVQQW+J`-cl=X6<;} zsG-q{7sk(y%QH8PsL&bj!OHv2&TqPca54m*rae-eUK%Kh@j5Wy zP~ZKp!XTna1@I-zgKdZX z7-WdVnuT6z@aqh$u&~=za$0Pakw*P{PB34?E!Y4fbVO_Fp8}Eig82vN|IjpD+{%br zIK)`#j7YzH`LZViig_Gm0J0WfHip51O^3u#Yb#?AIM|L)(6@y1Wj*2!Td+)N0;o_j(LxYVFbAa>Y@gAwvClJ6utMncC@(JubsDXVkehu`V(>{hOrl3f z^ReF0lcJdf|Grhq5%56B%n6$wP5gXt2|)n>rUAwnE<0>=co@?=QuFdKL#`+2C%%|m zK^Q+xl))5Spd6uR{_*?)q@i2}AJGFI%{)9jIP-uM-$Vj@Z2vbY8hwF_gGGQQ@x;+) zp$2?~oPrFM8>ma(-4U=Jf}sWod302doRQ~*0qzKH>i~^eq_!W`zw2=r)I;{a8wwO? zo)PuPJmQhoAa?}1QZ%NcPQFWHo+12O`ur)00_mtrW9l11HQCEStoWiEp0DlD9t3XQ zdv-523*!kXha-1$?9k=Q2`cI!}Mf0mRwdWWXXGz&UMpS?|fT9IBzb+ za;Sxzh&CQo+c_ka0bKU^&EMZ|$R6U>@2Os#1b~NnVA})W2aK2qa_}LBGf7m)h3bFP zk4P9uhM!izDAci=7ej53?D;FUv{V+4pfAfp7K5&bkoK0<)(U%cL)_z?6RG!zkOI)Y zN$6gH_<8%b7-lCRIk0WKP6*ZtX3pN z2=;WRp~_o^Ht+zB(Rb*qdP5z6C=Mzzn#rQbA<$egHX||ttUobEEpMU$k|5&w(n*T6 z90!NM(RCQs2E8GH*>kX2U+}Ii<^m1?{XV|@6i8plFTwY{j+q(|7~xPukd5Yx^`Mp= zfC^$HAS_?n1JSohiJklYnRj8v0E?0A(S4@vf=z%SX}kYt0g5z)L|JeY2}S>nl-gu- z5(=Lfd>1TP07e@zjuow(dnnS$v2*wvQF?JF$V~))M)CqT*?8cU=mA=StPW^CEQhk# zdq~BvLkft)XIx?Nv9CaIptL0K=3!t;vWpM=3MDiE?Y&_|@VIa9Spg_O50oOrj!uLb zTE!$lgD4rTLQpJUH;ny9d>yiDrWhSTCLr{Fk(kPfdqTMoviL5Ae;&yZ=th({f-yb#ueogQ+eIG)U%zGrl+j*QCk~Tb2Vj zA92sd@4wptpJtrya*L0_7rqC@FTl9UfQJibA>%KA{IZcy;|%M=kU>~F5Ss>?(l1N? zeqQnleh@H;h@+kz(uS>Dmm(!ZBu7DJf{stpX&SXo69>T_-T*PRo!OKF>;vEz3Mp_u zq-TWGiISnFHAZXA(m3fk&BZSQdMD5jVEk^Z#@)DsaQ1VJN)x?#z)5?H_o9f zhh(<1W-dSW%sN`Z{izHN16Ax>Uf+}F&!LJ4%Yp$Wyp9T?!3+xvvjOIVU{B7H z0PkU=mqn>0&_}cyqv?y${9zi*42O#Vkgvn`;G$gcjKPE?IoOWt8?gSd>LBFp&JStg z!1h5f85!T||izdUdGc_8~(^Ms@V>XvRTv8MqKSXw(ne|0@!y z2t>%6@FK{|V=?vwwJ06K0lLSrbl@$OGy9*?>(_JfLpb%_MQ%0Sva$|NtfJ@9F+?_W zXk9Vtq0V!~#b_^L%*Z$_1%ZBP_C7Hw=0frbw;<@`D>2X=xfD#d{n10ljv)mCQ5CS{ zX(9`Z!SK!VUO^eCv63bZkR%Y5p&^Hf2AuW2~*JoNlkQ!l=0q>!_ADWb2awkF=i(P@3i=Y1a z(Os{OBo?O!F=B!Hp%NfHH0Eu!;ACrqTy++2Z;I!l&-lLq%tVz;FDQ6eH%nXsRNC&B zz7NWTn|-)5J763%3vyC32hu(_w?#nbpsK)4!t%$HT?E24vh(@#uOQ(>bj?Mz2s2w$ zRI}oH9hm(C96yeBIu;{sm4Bor%%Q-l0zVtwD3oiqNYvqm@Bl{+vDZ+3jbA`^0{ou> zDjHg}i&sP43VR12!Q`q0R1@=7XAK4y;2a~pEOt5BwWD4{A*RX=9LzK6bbp8zpJ7Pt zuXid3ys=i0TnVE59UeA-O&Rn#;T@)FA*I`wya;9X5j*c$k2(=QjRohbp>K z;Nc(#kylb0f{|#y4H05sp#YE(r!4A42r6s^d9jhnfs1x|GJ5EcDMj3*tOn>YW`ql2 z=%oW{J`A42@ZePN-_K-Z^53uQftwM=d*P@+Y&ow8F9sL~z;)_~w=hu%pn-n!^5s3q z&SoGmYQk2Y`M9gz93PF8mt3@Np+S=$+9Cq94}3r>4+xHeVJVG;rFS4VLM9RTfFf5a zxpE~9n&=xesU()FewtEEz$DdQIHDoaYX?(;d>;T_V^h;4dKd#eL}-MHl=e=D7U2RU z?_T*TgsJ}b#CDRvAxoMabTs>ZsN~Tyfq5D7Vfmz{lRz(Cph8%fR--jybtfyNQF zn8xewK#Boqka8_z{$ij1noL~nhxxkTk2{0FkL(8ZyRoe>)RbWI;D{r7&j-}AB*@0D zMCWH_>RSCnWyHYMe?A|>^wPAGC#?$g_f0>$ydR<|xm*j-Tnb^i3+Mm9EnAubs`mZH zyepWlh9Jy=r}q`Xi>#$leBz8mzyki!L*pq#)Z+jY;4s&6x6&G5rpLF-A1b^toxU_| z9$4f9Lp)=zu}}tMQ$U#x3@o~OHS76vC%8pe;TW5hvo^+{*NzQ~3WOdNC2ZeVbMz_pTr8bCv_q|+gAY}^552A^RCRUvf?8D-@SPTX5_S0+j*@x7q# zU8U6MIcD7QyP_4R%{qq}XY)uxeUWoQGB)#Y`~GJ1bqztnKX>jh4X-2IgQO(@Fch_hOt0RkZbHe`p9G00>{@lg#D*h63x zfb+7N8X;KmQ%4U#7$82h1P&lRJcenh0g?o`y#t*E>;~-dH#AVhtAuwUCha1-r?HFh zocKp_q^bq_a!{Qwjfq+yJJRe;b1IC!8Y(=-V&wIcQy2XxE&K~Wi)M)7z#+C0j2kMI zBK}QdhrLN63gr1Hu|+v>)2MZ-m}`Ms4wsnK=y?HAkVG?Q|Bn%>)WB)HTC;{52KR&iA_T-2H1+>ci_rO z)&zT@)ubApNQaoLx)Z*EK#HwNQGriK<~j8Y`dWNj@(LwZGLmX|3NOYTKYyOI_3z&Y zp!%Z12zQVM6PKZv3Y5VN8;V5NhV1(A2mKHyVCA&{J3vcR)B3CUG$Yz-a9ljv$n?-=AWpJi@z=H zjq{lTO=2a)J=v}`siEP7(r$ecfKBM{@hBf@e-K5Afa3#O2{3@BoAnPRUKN&sdqI=u zL{mNElhp^FYDDly7d2d%m~7)cw4vX5hBoWJSswV-;<~zvjBSs@YmAa^(r}U*6l*{a zhEE8X#E68;#{&|5BGTfYFhwP$GiY6Z9EF_-DJSUfFiHhA{lE~+3h^i)V3q-Vfo)U= zeJDyD@+pJ$K5+J*n6l@60L4=6L``ob95;}u(OBaZxoBGJOTekJ2AvQfg4Mf2VeuLhZ8eCgt2Ahx1JXb#YQ#oTXqN`_@Z z!Jw@5)@xohl_Os!<8%36^EBU_H~cBCm#e6dsaJp7OU}!QJ?$3^u5w*^5F@avCq-O> z88o_{p!N5}7wA3VEWCq05zO65MnZ-ID<#uG@h<8M zEPI?Wop4&Gt%IxyxPdfiU`UQk{_zrx0Pz5$_Qfd8Fn+kTdy&xy<%K{*VOK{+yJSEI zDSFF5$fQ4TKS#$Gh49HRH|N6fLUlP2vcV6VdKaRFJKGa<^Ve;jC`Aja!HN)tQyiPG z4cmrt$R;K#_V2pOS9Pk7x&EH*ISG!%EK!QyZirm^2M zX6XirEJ<_98Y0-G`7|0O8cHUwb{~)PpT~Z}%gn??cwj!ozQu znieO=@u4Mo7n8?uXLYnic?svCf2TmrzEFyU+Vl6QbAH6jKx$8q4YA8&30?c%430ywRL9pEGj)RHt`iRdDL%<{^!sL~-xN zRYy}VHO}49z!x>5Bpwv&%o5)`c9rkJYu1^CwSpl_Q!g~n!3}wHk2g}A{mrA;*Q|-g z!J?HKCiX9I9QVbA&DU6y;~y9jyC|X7U_pgE^WV#h_j__TzZ!S)iI(lZ8gbUT;R}2I zaLnJfc)bE;TNZhP&bLd=o2RzJ771o=@UhJO=LK+Id3HSR=92R?Y&dUXtgXnvBX-+X zvqm{F)yCG18VuXw4+vcK+Q)sbpx?1V><*i42)po*&o$G)$zyZkEJ8Mms;vl(Eah34 zJ~_-gJQlr1xmIbB)t8W`c}t?z*^Yd_l5?CT*~n%hwmmS)Ta8O7{!}N+KJF9_Lj#MZ zW}c4L=&IjQ=j`}};`?XB-E(=KDf333`_i*EW*75$&u2L9Nu>RLhX zHJcOyLsFL1$PMIbZs=nej0&-p^~f%1e4rGOm(S`Pl+fzxeLSyEkU??MR**AnI*{SW zRIG$nseI2LAZPus!`cLjA?2Q6!pQ+KQQ`v1`%d`7L2KWR{L^kuyBcl<+>loAUc>is zTikQOL?wwL1(t^jCMJ6_nVljU7D?0zKCW(*((SqbEv)wXoKA<7vp1M8jz-tURsEX0 zFIlTL*XnbO`M}v-=?m_O{aVDaR>{PSH~Dznrr!SB>>ETEaWgo7Xz*Hj>-nRck6psQ zDjEK~WL)I)EANC>kZH8vc2kZC*)!5?PrYO8V_vg<(-b#iv8?dSj*Ae`Q>+!7;#VDb zG*MA`aGTo`h9$;D&9OLWC)oW0CvVDbwg_$8Gt%*fAx~gj#?P=Lu1LAId``>H20qc9 z8bN>8u{ToQ1#^>DV$T6nK|xZ4IuxGvuvtefv;OsFl{m`{iw=sa+%)yt%D8x2%&sOZ z)A=t{wRxENu6QN3Zxc#Q_cFC%7Vl|ie9hUs?_r3G(9oD@db#QJlG}rK_{zHr2;RfKwsZY zEp5^uVK9GO=xV=;Zhw)G$%fRj<|SsQ>JJvU+E1<#)Ra4w!&_EzkTK38GKwwIQTRQp zaYfFim;KqnsYOlWjK@zr+IB&wzus-&OVHVnN>2uXIOeQNrVJ8X4h92%<1D6wrEUqw zZTEi?oVzg2VuQfJl}#bWnn%7h2$WAcu|K-+wbH&Rn;FlVWkYl(wuN57?G4c^>{B%g z45l3Xo6XjA_^7xE*o?$Q60>kXoLZ}*syO{y?ROE)dr7N35Rz6so zASUa6T}1Ov&;3q5Ey1=f37Iu46qiOcjSW&*c}zDiFEa2}apMp15F2Kco$kLY9%OCk z$)siVeuP+p4loU!d zHjCvDW@KJ}lDS5XfngrkTYk}4rY*|{o{7Ke<+kM#6!%+miPfAfT0-1BKG;-MW|+}O zD9Fknk3&MhOw48r9zP?GDSPfI&Wbt57y}iD8N(Pj|H}C^eqmSQY@CvwcC6J~q*xG^ z%lw+R`IgXd`N7QSey;n^hqH|(YQuH$7(*B5Pb6y0m!7nk^L|CM{|nVlrn%P|MtO%n zd6j)Xty(3tXAvIKz~Z)NUOO3u68e8?PwwEW)QCvl5aKD|p2gJ5&v&I~nT+>7?$<{f zW<*47+L$e)6^HrF4WIg{95t=IEb^yJZ2v}PW7fX+f)!FMT(PMoP4aX70#$ohk_|($ zmxMK1O~~rqV0zE?Vww5DCGVP^hDD53^dD8dC6o(6gcNtBTWCg1geL81u26Lk53cHp$v zk;yPcg^3~n9I~CD*er({z3%hT?IE3}a-m8hg9qQu+q_c3l7&Nwr#VUfl?QXN-lQ3y z{^*=SP7V&v3I*O>E1Oz`H#7*VaPMqZ(2sbT9-Visaji;}E|+Mm(U+(>{QTP#=3Hjv znRm!#(vWZ4vN(;bf|HyLm8ycHUhFo^++j`S@uCiiEXwhH%&FyT?!-lN%;-FoJ9Ul0 zn`?hJb3*i+sf3)^ey4^Dv5MlJiEmb{*~ci#*y(sStg(G#?KP1{Uz@GD`ae5Ody752 zH@vjO{(Q*Mlg-R>Je${_ zx31zWOK(Q%g&6C1r!-pzYJ&S6`m3}wWQ%&d>UET+eYvo9R%oj}VoQi#*`#{mWM8F5 z4?l~5iRlK>*j85wWeLAn`D&r=N z_Q8`*!boNgGpH~ZY4T=S={tAC)yBCW?Q^xS&|+5LNNCD=-zN z*lT?kSy&zXtj~U;<3wy7>)ud>kU*hZLa{fPhqfRA*gs#CQS*-X{y8m?F9O~8Us?#i zPYC9is+3_kR&BVG--6d-0bhof8E^ZP^smzlualcDMxjcK|9Jn|z}-1d>vt z^o^Qy)eSN?Jltp{vhbJml1uF@?e&`(^*C>`SVmUPU%WZNP;A{^Z(mVS#uIj4W|QYa zZn4$n@F=uzR9~U>h=4vG!eFk2HJu5(lyTGt)yP1RJ>_;D8~GkUt^&AXuos+4LuWkZD|gUWJA?u zVz)STgAXh?tcdDB~$T9_y9=e3F6$a-e0Y75uz{L~V|G(6Td40Rbi z%M>EZ#rXM=G&~IpVNW%#Q$+i^qDwqmVT#cyZ`h=~kYhc$yo5DHQnyl;$jW~ZPW@?{OW-vEYT_twHzCxP$ z^3~?m_XZwP@VT(lE0ZldVU1bH(s4nJftfk^!|^-Vj`Qz-!@V%XW3e#fTmF-Q2akrz zYo3zfP+@K?YhqTBkL_!cje5nfRHs3r|K^KvXS-NggN|?o4*pur1?l`7w3;cQS&*TfVJWL@zg^En zy<4NqsT_vKY^Rzy_GdlLx?r@A@w8B1jVvn?wI9L{6rw}*Rhbjd)H5x#>$fd>>Ltg( z9o{IltU`iShV`blV2FH_GS~FpIq!oKp9`}0zb`+<9>TfVtnsOaYK);+Y3a@fomv){ zEe(H1f>8hqKrRu7F`hO+dO%=;6+JqIvR3(R*FT(0p1A+y)vF`GSl{jV>6Fsgj$t;zNY!!3voN0M8ZD`~7)p@wja_c#P7M;R0-0-Mm@sX&T~4msPK-ye68 zcR1iEV%5SbTpg$~x(x)xkZm9JSi#%$f+UjWCxOYNd~4D$g@vg=9NDw*$AGd_j&j*o zH^eks`rTYqJ6MiQL`yO~`eyVrPEqbb+no5@x97z!hz)V%JsWEzq*Ir5_`8P+jfQIj|W6n2zC)R-;1%Jlpn{2WfgQfhHwJV*rUUag|#L1Pys9$!CwUhQVn<$LUF19IzKA=dVSJ*)EpfhB zh>^a7Hjc8(jQUy1E>C%neT#Iu!GaK-QO>71kn5z?&h%oT?$un?%PcRK z)hZMySaa(lYi0UIQ&cB=d z*8@Gc@E*<3ZIg2Rp9=A&0xmRQ9pu|GE4D?)2;GU%r? zAsdq6xuv+b-2oMdn1cMy5F5r0L2Mb1-Xb*?>;K|otU8zz$F)|~b(rya zYk#H&sGoDrd#Elge4KTzX|sybF~jW#eNU`gK+Q6e7Gd@eSXtyC2`&#HcDXK%85kPe z!MqHx&S;l_z4WpE?|v||Zeob8tsvUalnbM?gkwej7|{mV0Pz6x0;~ofaIZ6&4H3cJ&<;saGFF5 zAqx?jN&ih&+#fU&ZAkrpe#n9xeA<)+PZ+t5myMvCQ=%* z!z#FzU%D}>NZ=6K*K5%FsU0buZDG^6DoksUXpPmFpTvXp^1;j|=1kmNN!5Ey-5=J} zu`2Yh{@PdqsG&qW$UHVP+Dqk~mGD3UTi!sCki1&|Qw=RCu_T@lg)q~e*yAh<|9%PN z)=!C*^{QQj`f3GB?!wyn6?E1tQ&1J;J%5ZLDLUuiWI<2|v)%@76c1fa$MacpHXSrF zFya(S^fDIYo~viW-MY6y;*=VPn9v!8erIoQcG;3OHLPy@9oex1+e|i0CbJ5U#edeX zy~JB1?Ul-v&*^uz-*#a1;Uv#$3ri-)Xyz?%J9_6NdX?qGP8RF*cvp65sp#3W1}oH- zacH&0c&f96Fex-}Fx{I@$~osQm;IUWt+ zyFIHh7QG!Tm6!TL{8{YD1u?#aJ%=Y!!5yA_u{ceseKJH1_FHQjnjX}8`+K*u*ArZfB#u$zv;b&O1t!#UFm!h zseFc)C5@-gDdzakXHhz|(U~vq!csdYW)`J!mhh6Zf=_Iih4|W%I+@r_*-cG+(=F7O z=jxaB9cYnjG>Nux4=wo4W6C=2de1p=hpoWUs<0u2vxexv!-3u?WkmYcsQKEm~Ua)*j<2CJa$65m4Z9L>)Y;ng1$1ZO(=^f%sD zaovzpqHoo2T~~kdutJN>?sGYhFZLhNDJ^-Sc2`;ER~XX*&CmCplto+4#w|PVletc5 z!uOipc7=Hz!ez^>jn{5Hx!ftlE5XIz!Xlm5G~Un9CuTx@*~3(=XKME(-5gqu=f9s> z?7G9D^;XFo-5gb^;5^2)4E4fBf|0#R!^=7x;UgSd@21u}knOhZGoaQJ+B-|(aqMW6RMuS;N%OK1mG8FfvXkoz1a;U2!FWLAor0^k`xmY`|;xk zXsS2<{1}7lwk}@u-`K~GQ`UdKSyMj)4*1V6mz3Ov^XKlw#e2@8sfFX>8rq}uEzkyf zhUoa<E)X@-8?-D@sr8?ba?2z31)C6R%!1B`RuNIB7AoEGsT^yQV? zZv#`4OKrtsudW>)yfEFOswl;@!}!nb+?T>jE(8Q{JpQl4QPs=$mHM|Mhf0)t0% z^ec~C=ng%gyXooYpH}a$s;x9qpDg`iym(@$&hm_*qNE)|mDzPKd8zb^Bg@6vO;`m# zN3Hz&QmZ`Wr7(V_m}e;Y+x**7<-45%uGb!3x_hGw%%&@ z$LGSw?V3^o7x&z0oUhl}cuyZ&e%y}fM5X)97=iO=k3^Ont4vKg#9{hzi@y^`d+MtD zwVMQV@3b!v$sPLOD=buYh{eObJ}o)n%3g(CS3l=j{&JREEn<9MM<{Hkf%f5O3%`ao z=DF1w>?ZLSKMuN$O>dsR-25=xgJpw>QZu7lH2t)TPu^>DN|Jy3Oew>z#?3h<(m=T9 zwD$VlYd6I#xl|_ec(+mDp{~q#n-*zbh>_$pt~9o~;QvYex!+8HfNq&~NkUQRsE^X{ z`)I8fl6NKNUfVe#zxdPJ%Bx2#zoaQ5=t%MZy3Z$DI=yE3)*r%I6~?mCVv{~A&j;Dw z`5}5$&G7PJMn$}9-4l~tX>P95k0Z8iD=Icn^b6qd6v2IQ^GjCxRIItq(Qj$iywyvL z>e_fY+#J?LRph_dJKPb$HIMbRL*V9{f*mfWR#|U7>AYw6>Es!)i^GFYc&*NT-lY(r z3j*kUL^U|qhU>##%(W`u=tHn_hraH`)&Xq z=mBj6O;ZfVj6oE%H8zf~tJB~6>Gm}=%+a2>j^^k_503(%(-^l?jqcfuIebmkK&1a1 z`6}Q=kdwWAhB!O-68%?&Zun5R{pcVk0$XinD?;evz2j<7{=z7Z9D*=+1ReeB!>5z~ zeJ{{RnAh~H{Kn8!2T#xK=nO(3e!jG{B@Yz)I+)Ttf*d>$93c>J<|iAk{ykz{zTrv} z2%Qu}KwSKFebrP?Gc5n!LFX%!d^c)<%QLmz55vb^VG73}m=|F{XGz^52C7u&NHqom zfVm%oimnIWXBD&#+pfP8!fWzD%Iii8{MT6hp9`S!Kt_5TF3V2B34h#+Y-q3y+}d;L zD}f$BrZU9c2N$IpbJL%|^jRjOy$5gcpSd*uNz4HOwekmIw5e?}Z&0K5K!&;%9}T92V6ySwHam$ydxWKIJzeRZrOowq_i~)nl-AU=?d;39 z-IQEletpj>^F1P2)s|P)c$Gdh?9hC-`&P!W`X-5Y<4&W?p54(ZN-Eqolos(tt32DG zZIg34hiN?P1EnI_maMVk_AUGJw2EIxXjjMTzMOt+nQvoxDAGW-(pag#g7f630GA~m zEQ(TJjQ783mlDfg71w!4YH98(^WA<1(T*;4H&f(p)`kcVrn5$!&%S(dpj~s)x7-i2)d&n(0FD_KEUZj9!|E(Bz1KEnZ9a_zUQ3qDt%n5a$zjf!Y(xX9X ze*KnrnXJm+4K3`HV3=}UYueT(Enz2dU9x+-*V@=R$z9uh%udX85>{1eT>WfvOmpLS zsl;G#GNa+smT4Ppslf-I`aPYx@_mn~pO><_SXz;G)n%Ow_i?v?hUSSQmYo~%CNpAZ z3>OY6jTGH9@b}AWkv%+cNmJj}e8^gd%e_9PhOtlO@WAvUe{e`C;K~-S|7M2xaDy`Chv(XO1#5P4vg!vfvz-X~pM#l^)&l4%{UUw?$(o}H7EY(_hA zNWj6nk6(q&koNoIzIZdtue$}?ly+dB=WpD2S%bftiP~6?T;c{s+AedgZbNJU5BMbn zo(gFuJrrm6?A?15DUGK&A|O#b>wY}D%o*DNDiWCaE~n+mMPTGRHmA$Ww%@9Tb zuR?x8Q4u1pZFMsNXdF#}eduCoc{CX4)Ip+7)9AcotN+xZ@>_!x5D~`K%`J}tv9E72 z(#eOgK)?)&>77W|;9@fdvO+a@O-ZNQFwX9y?wgsENWG5`rgwLA^gnmo9u6k=B6Yt* z;N6dmk5?m<;YdI-M!s$EYYswuEww5b1<|`2bNi4Z)|6bha37;-cS6|S^$8O8FbtS! zd$(i%&)zpW!>10CUjr&xA7EU#P+ypfAfM~Q^VqXz&$p?mdjVAlRS&@)i5j&pBuoxz zoqFyORqo#$tnG zFBso0MemCVZug(G_{~SUT)aH8#UK6=sWjf-y~aF6wZA!Q+$A9S-k~pt?%o#dFV9-9 zaYx~_*H7l@kog&%7a!X#^7ToQl$F-r#pAinD?&s@!ZWCUG+ggh<8kS|Sud3B?ehB! zg7X^+&oH*gC~zom6wd2o!j#i#)cAG5T`lIJszK1!7YE@=#3G*Mn9Z7>1dQu0I zc|=_TlYifziD)~1rd-tX;bqsr`}Xtav4}c6DlfnINL_u+youdT-)!%QT#buaHuY$7 zgPfd$t(b3w!dPWojkS`vP>)ZJ-N`W@k8Fw1^HTb5t=n}YZzSslWQJ^6#-rwz?`rON zJjcwajrzQ+YANUay6swI5kth?{7jC_h`CQI?z}&|G~|=455s!r zc`Q%w^hh)^P5ipNg`Yt;YjW*^;N1y#gRj`1IB;p;&2u|`b+xU`B5R_YY~ zt}~ea^iE_o6HkqssfquQhOH4x-yNJEHeYKOJ6nzbOI&T3R^Atf*0aY#U)!Abtx;F= zPnNlTvHi>11$#5EIE$1$yK*)$TTe!!tLuoBaO%=8d6uu9tnk5U3#q!oC04lynq)M&X~RHN6uU0h66XCzpG}I>wWy>^dJICiW1tw#OH@R5CXRxVV$tE53^M~w_%nPjRXYK45uzE zLLx!Fr8qTp@7)ek`an+F(cN8k?p!-mR|S;dY~5;Epz{na51*hPBA5ujOZ6GI(Y}5A zK+u18l$gDBpfBGXNLaMi_RPhL7XJPvklE^dX_LZfpZD(TZpa6rta|qJY2->8NeK#O zA=OQI-PX&upF^iaLY<_$r=bi0Bvybh^BQ?s6w0s&fKxYrj9w_%GkT8Zg&tnpL>_*S z;Y}S}@~Z*-x={!=Y7iv1Y~CF5K&_SPxRvQhMK<1kiL`PV(lGdFzsJDOTX^@qVB$iw zwi{Gmh!uCDRI7K`xN#d;cweBwYC?b|HqheTL-WYwd7|>Za^3gapR`eV_F-NZa>q?b z!5|PAv@iUTsmgs6(YU*AY6W1&G*rK>5xv1Hk)K_Hq1t^YC-)&0+3@zJzm{qrDEvz%uHS#aMJ6J9`es8xu=~?HZ1;0d)byn@=$53_WN{^ap16AP zfjSohui_@x6CW9~=KUAiTOvJl$SjHdm#NDgk?=T%m~P-h?{p`d%+(vlU8b4@zV2SveT4zv0nEyHOw3xZ^HO50@#8`TNE4q3HAzW)XE+)4!tC z`O2<@mRg3rSyy&)jCAN$x^aB3#_p5|JsoZREYy9)%xQ-C^WLSEAF=o{qQf7vYiQDJ zos5XkN^zl(NEY238-D(|+$QlyEPBk8`sIo@AF5Km-yys@Fd&Ct-?_D_@6M#df(-i_ zg$6dW+Reh&yFU9ZxGwojZA#hK?4?jMzlGJ6vpM$@kglMFuQ3Te;(K08+(=1W;PZeP z;~mEIdG?ZS7S_nFrUeTx4R&7rbt|5|$_!yG!bI3c3>9{1nfCegIeW9!ButH7IoU~+ zb%$@kswUWo6NIMz7vvofnpK%2>uPIiLSWp+tbLJEVA6AFx1g z00d3yQ0zH`0uWOo`of)CMRy*7C`3Tc>go13`@a7N54b+(x-au>1xLCOfNbQU=Btqr zN}j>~D!qEu5mg1EMjlEs73?2^xK`HB9JS2T92pw}pM9;ZAAY>jyNMaV(zgIGT?za~ zPYjONKbjWQohmQ4G&fHs);+bBF{vr>+4JZ3K71u8E7xL6U?45xrGlJT?4?((*sAAN z-$tnhp?NQ+ybd9Y3P%{#0@JksjKLJGx9li}npB^@d`YDuV5VOfSqX<-+I2`oJTN(y zSj0Dh)RXE)AD^o`lxjrsvAUmqpB63;ID!I6&NNpihdcqRy8 z_epF8b!z3@eZxkS)*_9$2H@)kw2hek^bkTFQXb;zLi)K6xtZRJpyv?Lh(gMt$rWp$ zB(xl?b+CgG$by~Z1)hkmF@4@%Y8%ig;bD2<{J%f#h3s8hw zTu!b<3q*_t)#}K2^|}>ilC^Ib_GO!pm}#A1%#y_Q^9|Hf26y5xL$crabQK;oSw1 z4QB*1>;!+C_CGXc$ZhLQ=M3Zy_V-D;uufGvAX$t*s^+z(zodHFvQ7y^7|jcrDU8

TO3Q&PAKHm|z4KN3F2Gm))V;8Hi zyh(mMj*dU-4RjZw$*;h6fepo%fLL*S6qYfxqkn11!dpi&NwOXqc`E#nS4`CX{1_`f znS-bSK63q+quZmJk!@`UXB*|ou~tV1heM~y><2LUu(PxCCPV?C`>XNmKjOX5R#!Xd zE$&uHGl6Z_yo91)sEwLbGam+E=Pv2&?Hxlp5!xTac0x1w1W3LFp<5Q}_d&HGx}!~k zwl3<#P$=xE#DpSpKXlcn-k>(5F;BRfIPc*Xn+jK;egdIj5@_}Yor34vv2pAEE8l({ z37_8YZ(UFsLW`k~2P>N-iBttP6%eY}D`s_GMpA+za64RTc~^b2p>i2^25b0+7cj@H zcDA#7dnUtb2Rt!){c}9v_Vk-7I$Sux{*I0_pu%s1XH=Doe&IEsR(r>OI^?%%#8JiAp#`*iweg>75?-P08U53J=h|8N+pu4%uwm~xt{m;$NL_~Q@ZcVeSgP!e%9%H z89#|T2$LNh9?=LK2ct$44^jAjCS|{d$&bWQ8A^YcShFd;zO7i4f)pgkLGr{V#%RR*AU4qU zA|+t@!R!za@Z@OieL1)_<|_;QBx~vS^NA~I4>oXz$Z#e7D#{o#7p_# zvpI%B1^@lGV~Utfn8IGUcMu`}^&ElG8!d*OKmsA|vUhTV`x+8gqCmKbdxZcy;yRES zO)x(A@3SX2wFs=#vg|v~{S+MUAhZ6vQ^oD#G1@Hda&LwsP(`@E9QH-E%^@TP7Zn}~ z>k59p!b`FTJ%=oU`5AU$nG!!Cj(zohXy|(}+35#$bssJvKy}ZF&)asgUJG!P`W!$C zvp_(Ie@q{TJqn|`!5%hz{xl8oc^-RxLIK2_Wf`%9Ib%xe@icX806vg1 zAbjyz9{^ZeT>r=I2Zc`4fX0(3EGhY=j|&g&NgFX}5`UVfy+>yD=qR013=Xa|8P6wZ za0qCYAk;AC6va``Wi1A{f*FIdB@@{ST%G(S*S>ePL1fk=B?O&Criev z<^3tneQOItXQdI~vZ0}?up5^oQGwsht8XT~y`#Q_TcKR(M%a#tJ}soc`EY)7#CL^v zc031Y3e^FER+EvcNYQjbXy5YrJZ*kF7!l_1_tqhFpY=L`s*Yi+STNlXl$n2)1FxtN z`Y&I3oStZU;?F;H+!vIEvaIAW=+4WhY1T~+;1z$>@`cU5__wu%Pvt8y*xIG$zMHgg z`gxY)SNs0?ZpQ+U)3C+E{z?GrLhJwCx{aZRvt9`geAseK0ab?wz(9O`)!2bM+1#R$ z;dVn(ekmsE`;Q+>W~hDe^~+)JV};$`+QONho&5?Sdt)cdmGoEMm>y!&X3r7g{5hsZ z#?6TrUC>ozHE6l3QS>86>a025R=L~fD)v2*^abneYSv!Ac2K#T`@+2?i9`1`6l%x6 z`zI#dkh;S7xQ_r~>Jlxk-`?@JX-Gz4dvz5`1Y28w@nKF)&o@k03~x2231;)3^9jrX zzfDq-B-kIHbIduM?}5Csw{=?Bvz&W+epM{XuA=^<;?WaT+`0HKl!NgzJS1B^)$NxzjD~!iGZ|&r_R6TO?lZx}308v$sBQ|GZ zkN(^%+<23DjgQNKn{l&nIDYD%gsTcU`*|8K*KnWplO=TKE@3+M%yhq`XIy-}88wVd znn_W@#2cS+oA7>iJH7unFO}h77rkkfS3_E*)N5wTKA%HGj*|a-0vNl`}VCvr>iv&BW);JFB1RQrjKdQJn1i81!}KjccNirUsB0r zjnnNhE>V0tk^=j}aS^Vpu7+l-NT=^33;cB(Yc;bsJX?i9X=@M#6l(N-BEAQ|7Pw~s z8gGFY%$t1LOvHqXULdr@j9IiX*ouD%;FKufiJIxwp`+h5$F~RTGtqcmk>34uvV)PI z@^M56`B>!`=cP+clmqJLeBK{)kTm}k;aMDld#^V|&MCRs3UXz!Hw5T2an*x|PC*-g?=a17OKXoO2E~g}}Rk<-3j-5N`E^2259@mp? zHmxi{!+T_Re6Tg=sH4^E0M6&T;_onk#=kk-IrW1%ShuGO{H5;q^zy zh;yRH=SvDo+V8R0cHT&*(dnN}%R0W2@x47xNpC{KeIG^4p8Ci0By-*cR?Q@&0$f2Y zH80Y8i_P`Uv-PG-;ZL)%fMF_c6O1buPuENi3=^Plz-cGlDTPLTr^aWq&@{ptS z2pSIAgTL~Q_;o;JNVM`qyInh1l}6lFC$47$WxRoE6)nT{Y`%VMMU&@lkI~OgOM;4y zl3fZxBk>Wb&#Nmd1h7g#hLG8Sk~KipJTNc`;%H!O?8zs@hxo2lWUl70|7{m-W3_s9 zhcZ#b^ala;$lYCc_2JPcS3|jDfPA$fSUj zrV2tNgc`poF%;VTFeMKN#*pCS!T+F6QRmJ1gwMq9-|tVqUhO`T42tCR!q^WXgCed= z6SuN*&)j?(_*+6$TuFN6i6X_D`;{NVylRp%9VhM{?B@`tWq*9xC5+wi&?Rn)p=hpy z*KFzQm0EeF@?$qoY;g8^Ry;}~6@!54ye1CMb3Qedcew=kqt;*aD5?aHRc+heP(dog zO~scjr|E57>&D>qEPW9|F3LKyOEG!%xe7sTIF&~GPE?$m7NObO&RFlbEc2}Po}kAe zwi~1RD~mJwu^jZV>gRRXD_T}ryla9p?=4ojGq&&VP~1_}>++?ro8LxTv7!BlF-rS5 z?XfbOdPqWkOO`nY(H9JhPL>E5OgxczzN@O=^mC1qhlqu7YX6;I&41@Ue0nX<{4Ktp z=J3xOFC6kD#-n#R+o>MW^t`UilhPibc*^S5N3|0V?k~ST%Kduf_?5v5=`JM=+5Xpk zCoZvBrlq>d4y!Ws8RR|$mM}moM^2o7gOlF{e%7x(o$z{|wkpM&%as10M8!2yOZE2H zS<4;NH=+p4sQIuw;v4jE=#Pz=0f)y)vFZaCF(Ge4W1xx>b(2`XTYo?O`?!54>t}R~ zl90;+{{5Ly;@g5Hc?C)bUX4_1;L;2#Vhq!ZH^ zL9rIN*Y^}t(3pykPc3G!x1Zk0W{ogX)R1@o>n{gBd~kU2ca3lw`9LHx3;Ghc+zi;j zcVJBks2y_HB;;03Ack%Q|9gfh~=5?$gF95;JGj$#Ny&xl_6!b1N?Ho*=AU7y$lbB9<9A= z)j8T;x9h6(9no?2kHP?Z1kpWNxnfoek8ft@#=l+Q)Bkh%f2?$Q+u=I zU&orw4>yO&-`LemN+7#o>MEB4M~#_NKA)q`J!3ZgHP6gLkb@1R`V;$n=~hV=+Yq18 zjPK)n(?MO$e^8|H8if=hKW*x{(eT-WbKWjWym=`)YOuH+xcDe4ma4e5>0|?!Q!fUc_PidCXW0AAsF08}W4V zhBxiAVrmM`kE+{`m^=86Mcp>qGDnrg7wLn%$u`)(?-6I&jalf*=ol$yKhkMpVwRXrg|TTXMRtfNZ5a2=RTxV%HhF=Wz(trZdAabO7AA z66JiV2;kLG-@pLq%zPQte*_wJ6A%$XIUd&33=`ZHky?4P5O6~v1I&U*E+Xvr zhR?2L!Q3qkB;zBX>YM1=O>pwT`Thwmdyx4ElEHfz8QCJ92Ou_5le&rS9)kp`(E4H& zOAc~WWM)fm6W9_UC7yGMkR81`x-x~g!%|dv_}1f-pC`_39lQw8Zb*@c0GbT%Z_E&q zmjc@$P;25g05~mhFluIYcBOv7PZQkzXA(iO?HbsNEl1Ky+apYWcQ*UQPl(B$&8b#&Qw zXel1N%jtd{wdi4c$G7G32WKX-zswpb>m;6)nQo`wP1Szq_>_Z__{L1Y43ml z`a$)ns&>i&RVA`yMoNJZ#pqKKpA0@Ydl z8#*PIABQoo91LYX{#}kB9LNyE5n>J*{8MNpFy3u9R-+9OwPC@8;M1fI zYX=F?Fo@F5CKwH@MIz)0(z1la#2@qXgLtBfLlj7+GHURxIg|C^5*9f&>|0`tJ=#~m zzEC-zUyOTMgCpeFdb}4z;kJjt*CX z8UbTrqy@96ViagBAQ^K7^Pzg9B5M*uhFG_AbprY^)O|Z{=eMwK+SZvCQI`7>( z++-A4X%r&2Xt(E42x#m7*)5Xju0^ZVT+aC;`_L`-1SN*u5+k>irL~plAa?KPjZ-gi z9`pHi?CTLDPD*Z?KNme-^9vpuFPZ-_8FYTjkJX(rqkHj--cu^t2cjLn&w2-LlI`wt zq|KqxQFM5poHS`*&)=*VxW7`MtwJiYfRl}`je^QVrumm-zgY7+13I#MrpI}Qs^68$ z+%O!|bPZxx=Vgng-1zL;E&S!Be1mvQ5Vxormxx(gGPkRmS8nFT?!A&rf2phb*_SmL zFUkjw+?gu~OE!6>IqL1o!$z)8CC0S;MvrW$B3?7f!X1lE&*_!iqz&(0z0rdVjQ=C~LH0wD%yHSA(c4&eXvM*DR?Y4r57*y~KEF7&V3^vJM4Bs<2 z<*mcR?iJY|{dQ)kzPYqN`W}ufYlXqd(8Y&0UmNulfAlSg(KUa_L%JpaOtxBAl*?+U zq;}nA=flCJzxRp`W*43^Y92E>Uyvo$BUfK^a6GEs*Pb-#`~#^u#+u5sPaaDNi?fMk z8n;C?sV@9HY3a7_`w?x%n5Yd^nLOGYx(L<&cwQE<+B*vxUa_?XY#*i*EGTPR`EU`q{$A8e zAUg#4`LB;UR!fbCa5)gld4e**=>SlcP;%m&(JwNzFgHJijY-I@=AX}q+&%M>mz4BB z3oocSkdygf1VEQ6YH?GLVCIPnP?=3gZ)bO3TE9gI*lr!V*1~9T0=HxRl-zC9`612g9HW4cMl#sW8sW1oJNHBYdGX%{@RCKtP@4IyJH>_2b)NFi9L%)u3$hn6o zhzeC^Y;g~Qk&~MC$aM1(N?O8&u{7CrkNxBrGQ&_ovMiq5#kW}~r}oTNz&@BlR6hKO_=Yu37W=B=yISXUX3Pzi-yY{=5AS zmYIY__@Hd>p6h3XryEP_%a3zQ`BOU=<#N~>1{g8#2$Sva{UCJg*q`SqS9VMb9?)<8 z!SQ6~fqTfsStV+QluMmc?-z&NW&1U+1onrtZAv{!opSNDBF%K-W)WkeKSbpqD%g}^ z)KDLI?8mh5wKYEMGykHgcgD&*h8H_LC6{X4eV+!l=CUR3@h*)LSMV(g+`N-6A*G?D z;vZ8GBC2WXCTca8MES7lj*A1zA#N%mt=zlS z>K|>R*U>$^Zgpg5QViu|3U9mUPafKhqXkqmeAnzH_pV&Gq<-<;+~{OdWw}c+uZL#pD<>wc2K24W&D_4TrG zT#T_)UY^1m$!C94%VY&TW^U!BBx&N!ry$w-py@iYk3*mOx<5M)M~|&G6d=L+KWp5J zx{mR;be^`O!6DLfwNbFI|W|8AJR<079H7-#I+_4=2 z8hADM{rYI&?p~?s_e1C4&2f|JW7BO?9 z`w9`AOfUn`Ys(|Jc4ltQ9qLOA#*P0E>w?aou<*#q$pH!n=YT}rv6XyD?0 zrGm%+S4(lL(OxMaF!`cGxI=sVQ#So(KfgaUnNboK_6_s29_EjFRvi58>3%)N#j+jy z3|#Cb{|&T8jhrZoRp^Aq+lKVd^EeyQi732~+rnB8coLj0Y zmEGxS!Xfhop1wjf3PW z?raIr(pYMD?&}E9v6IRhEDhw`yAl(=@$)J+-nuTApAw1nnb^SM2+cAR)W0se3Bvp0 zUHlF&_$P7+Y<#||y}ctqQvX6T`*UxX=pST<-(A=zdV#yN(&q2Q{>~BBbn+Wv>gpAq zk7;XFUWL%sUXV^Fpse9U3|J>vZ4DR|2q_(~h#0lJSu{w5N)PBoHedNLkT@zTDno!A zAYsA2K{zz<{yocq0~pM4IMNC~T#E?EPsyTI_x;v}$F|n0eK0uYF&G+Nq8f!vWv|>y zG)6-YVRpiI+)+B(+LkYGk%N6)Sy_1o6U3y86t1Viu`wqgEtq~#mwbp~7L_M)O#_OC zZX44$A-gO^E7@ycY;1=)P#Mm+*a&171R6#yeS=xz*&zz+3L^`q5jcDSNe_PbFzcKU zAI}6OP0!foV6}0bSJ_c2a9-eeX#pVluV zc)~K{ptWvnLA%Ff*q@^Gk7Bb1YFFR$g%1gKIm>t(P-`{1O0{x_k{pSq#GQ0s=&b(r zvwL5B|16n)@n}$)YB{YY^+@MeQX%%wMOs)_{@#&$qrN>7SZk--!C-0fIP64Ks>$>3 zM@F(AwzteY%L-@ur~C4(a)n8d`c*8BT$1yJIYQaopW}@?xs0_V&WSNqlt$3oJu??R z>F_m$b)g_j-a>F^VjT5`spP|V{mB#ET6KA7(@gGbchTQ|$2%J@r#6(+>>)SQn`FFR z(s8G%Sl049<++`84%>gwtE;~?JzgYh`9fQnXWeD@bil`R4sVQ(3b8ExcGCZb%i;B< zE~&!xLB;u58>@`ekY9txczQB_*W@Hs>*7QiS;DXIr#wzjVkrM5C$7mvrzKI*#MKIi z=)J`_`192+U#W4B<3QP_Dg7vnNkF^#&hhDhPj2O!{JXn0qE_#}2pU0`{OsA?Y1{nE zb-A2R9IeiT-L)~(6@cMHVq#i>Ix&M(7DQt(TU4(E5b2*mmbfr3uf;@@PF*u9-7W z2Ta~pSC64~)H>i|&YZ^)`0q`!b+3?xd2K&OoBr~k-4A*kJGzQhf{LcM+!d-^6nXBc zZiWHnq#MbWen~k{S9U8fS@)FVEt-E~srm86>b*a|Xi>FJSTz;UN2nes3+IktTJ-E6 z9-b!DF$9%Fc$%=v3DWR14Timz3#X_n^Tw48BXz=_bPa81SSb4C2c%(r*OYe({kpKjZ^?!EKe z^T(=3AKoGDeD?g_^E(#zR7qCas_4k;8t(r+*AZ0J9#mHocDpMjCQBfjdnFbZ&6PyA zQzZY!UgeO^nyC53{=2W}e#@;rW%W3(_tQ+sMa#n+t_tSRb$7X(-RoMxO?9uc<@IeZ<{wB~2*zn!pGl-1>Kx%1Pp(w(%}L-A z7Ry}~Wvl6$GaU={fagDo@XLPKY%Fh+Q~DO)mz>Kx{!;$+!4~;wpJXt}Bl|Vu+khIbvNVMbs*Y2zm!BheJ0FDw9#H!n+m_ zvya9R`UAc&qyhHUc`rNcYb%44fSBA}WLi7;`SSz(1N1alTP0ZP*bpC4*-1<}ozKr6Mn3RNSiMTD`e<8%B z1Wd2U`K8j%GAt~_hFCP5=B60~-dlMYlKR^FM)Eli&VQ{Nz@on0=^%O`w^l{q0Vn6r zlc-ZR&o`WiENBlmHf-I>^Ys-E4bb_)N9p)}ghP6Fu7bq3nzFcuJB==?Dm72F9jLky z;^R|eE?i0bZ=`XZVf&bYbNI)8TpSAhySYhYV~Xz#9kWOO9UExzJ3i~K&yAE!o?Xdl zl}f7Zs^Vt40mo*TGshdnMj1hfpJTL?_%>Yl?wqmiYw-jdol}yr^Y6t{5XNMZz6P>ur%O|KgSd#0kkkt$Y>m# zW7ZM4TXF7c;AB?kox@wnV|Et+Gze!fGu#+-C;_{{+c6EVZ{Md+&T($i#c-1>wz0zr zy7ubF3Jnq&XE*sNhl}sHnb*!QeBH^y|3Fw%uQ?^>L_wIMd3c#>gH+6b zR6hqbCCL$n9T&v{%lkfQxHoUv$PTr&lH|~tB`OG<$bI$6l;PSS-Ii_kUuTQr9loEAyK$jdvpSWiTLM81>Ai$5-eZwG2mXrJ|rjSFgOh)4q5 z>_B)VAiD-b`0A(|1a!&ht#D^*V;MlXO{C!xifrUN6c%D2Tog2Q&fuyIRJ2zybDR1 z_F>t$F7qixMWMemD_KwKRX`B;bmMvEunq0q)o!9(O`+nmDLnKeww|j?kqLjg_+B5h z2`=ibundsmi9c(0sMS2?=pjZgEraUCvVjj`_xNo`brk~||LqYqUY6}^WB2hsOC9&t zBQ%54Cd<*TXW1<>1r`<=p8XXZy(1juz#U?@D@|Bw2h!G_qWO21mdlL%6RLYijHTgc zfOG_BN17%Sbp*VJffRMV@(XC8UEgX*)*vPugISOSy!Tr zyb!u_6mSI61{F3e`;@mDUq6SJUKV=8JtzNMBk(oCP)R75A>D@KN!axHJ4`bA4j+7c z*Q5jbswqe^k9p2t1Ve}OZ+w9EcVT0s&!ea=$!O}7Xlu*V5i%PN9u6ChNm?6@&_?}( z^H(MhITszGKTt-!cV%(w%Er`MK^9&P?gI;*3`yOK)tbxU5pDs1O(sb>*U5tmNyo$c zUDX+XCoq@A-C93_YFfYxs7X3XXaWcY?t%k)3T(9-K4%bh5?xcvFq~PI@llXG)>UIr zLUqvJKaSA02Ky&9%FqL85PG2*(*;5jUHIe)BwthEUkzE?B(QJ7aS8)e(s*^0K`F){ zyRs7VxlAVs6AWx0zu)`+H6XOUsCV%e#J6~q3L%~-s~4jlhGZqvaNG*$i{$5w3?<>J zva-sED$0J*F3GFS$h>%9HAe4G(QT7_QU1vV5#`V93ReO%-LIMKEmm-7U*2?)??0ty zZFnVcl2n%``93GDSKyiM*n=V$yXu6he_hj{XXN-Rx?O+^hJ@KK^o6!+%hRIwYlAwY zfz&i}{RPx{LEY~bz5T}84yOeR_s9ix5PP58U5x}UF#~bazxm-c`}2)WGLz{eORM@$ z^W(QfyE~&PyzHVAr1l6OreCUc5;5#rp}Gxa*v1&Q9i8&*9bBnqJYY_*;WOCS==FDk z1ejMd!vR?Y0Ia7#?;>B~1tVD?)-YxsME-j5?=STF4zV59=pT09YOEqVeTafYMt}+f zT}Si)KoRixPpB0B`FGNU3M7ypqduzs4w zbM5Hk)=#FN+0WW%*pG%DeG$J&cI=q7LX+i(v8I$>7hT3FaqYC9BwD9fxbvlxJ^1DF{9bV($N`CLD*n)nAU>M)Q6GVS1XGT?0;YIlgoc=A!9xlEJ;L3aP{sWCrwMbzA|dC3-sK_0T{L9G z{57y5PmRh9;oY(WXCYAocPTI*D1yI6FqH{vbY0tGYURD>MO_$nq9lfynQMzP()(Fv zU~+jQ?u}f~Qg^CKxDTw_-vp=AX0=&QE<7litnHcggxMP1jDN@}PzD*&;9ZO7vfvczjyK>C2EEZ!T(9 z>!Z9s4K|VoWvMB%8+Yd-vc-5=c{Z0=^5oZ9!@mw)hGokK#{vym#sVe=cwoL0c-5*7 z2m%Tq-6Grra8)cNR@b#WJo(oaqYCSB9>l>~Glp4OIe@NSKVKa*F-7|7dAU`5>3Sm1 zK9dl208C?ZMDw2pkNZgkxDehBY^&MQraeRoep<_Qp-3xi7+QGW2#XjY(ML7WKRB3Q zU;mNN6hQ`z`oIwpbew5D#1#ZQ8?JZs?GC^Xh-(9=mptGpUIJz&+;9YO%%wc578>yF zDeb?V_b;BaR^)vkG|>PlPW)Z72b`9NF3&~p*JF;MTAw&TU`p1F{!Y2av#V9S+XHQ8 zO*-Rl-(MA~;iP{n#P*ZKRqa`A@Y^2%MwEOj??#eLN9#5k<*X-7J!^>b92Dd2$Ym%D z8j5~+)gB))N04O`$%K_YRcyE_c@-T8OTWQU%fmc4$af(d29N?y5o{HxHE%T{_u&Vg zm8PwXNV+04R%rnEzC-@mOSm%dDdLBF&{!U#AUkb-7PBa(zkkQb>|zK!{}b;%c_Lz9 z=AB2lIdIbBb0N~Jpl&+(Z~0{Xa{9sw27kR-U;OF^!kfV1iMeP9S$K<^bOD^Z9-Kc2 zNf3Gdof92qDFJXA5nMe1_QSU`zw_jJAT9zyLBZvWUv+1lolC%0w^+V`9<|u0q7~^d z#5{?WnqI%xz&srY1>hzIHI2h)a^cb?^t2ZllyGyvA`Bra$}1EB_Rh{kTe9ALMcxXd zAYj8PxWI>rI;n^)MU_zjxy>g0QBcA|+%AbRRfJ`*>&S}_JV_ThGkbB{VI;^LK*;Ow zw9XDYz^eS@+4!!zXHGLHDMt(mDU0&%!bhFmA4u!3#rP(9d`o_*%(39y&lFL`sw1uC z+x4lm>6R+^k3aM_5bpi9zH;E3O^V(bp!qvDW{oc=Tu3wjMOE$T6PQx~{F@u!AYbzx zl^wcDvwE-QmvZ`ZRN% z^R}o4{~CWDCoWk5cKSoRW?k+kCrCB@ppQR$XKO3WFwROhR`;`>7M)o2os++4M;iM3 z!gobetL|hq>gbNJ$f3I^8#&K89H8FrXbLW+l^a(u^YshN)6r0*ZIUfKsZ6jwbty)b zf1iOCvnWT;$NH6hk0X*3zxBC1`OsJ*v+=8JHiqYvPMEvGhmTD!C%MrS4o4r}&r-Jg zzg2<)d!5L11B;Ei?IsaUmHBt}3aSoh4GHmyUZFnbjHSS@g>M+`JaEE*FpPz#i?B^S@(q+I48cxv^y5W!(k8)LfyRyv=f~Z?nVtLf1v-d zgA`0?A3)hFIQSnwdW0_T@cP2PEoa=6aOH^*y0PlS}Hnd#{=3??M@(fj&&cNm;7 zN*y4_+6Pxn>=d^qYRP0t=M1b?#L?jC(S~Maod%2nO=}u_+cz4($^3Wag}l#rO_Ee} zWq@WnK#THxNe+i?+LEZG`{HjWZH|`YNRlaWVB~@RLZ;*mkn>|CSPPYcrtIP!B4Yy#7KFp$+3lBM zmL0<#LDAF)QFtB9=%A||5uZi`C1RoA!-r7O754)XR0)ArNr@&dEc|iidh=n}a4|zE zg?L3wNrN|aC^tL%3{+wms@n;u5_Y^RtnTl$2p|ipc1-O256t|yaPvL>R-M-h6&D<4 zfUVLLwf?i!PbL`LfI$@*wL{ni_Q#jKb>110EDb2#OZ?{S!Jb7N5bxy0 zU&7&vL`Zu(JDgQf7~)1ah9Lq=m#m-GAjI?F+R!XP>N&HpAPE=($17|=2q0lv9P#*K zJU<6{P-1c*r>KkQ-qpo6c}`a2)2^v}pM~{U%~WlXkhtIE*~6p_Be5)hzM5n~wQCKm=PDdfpMC`&M?)*Z0HMSxrSz_5<=G;liVTFL6oEv%>d6mab0bI_ zB0vQc34odCu1O$>gq0B01CcYp#{h2&45vh@(&{SZty9>Zs3f5|uP2lZ3`&S4@rBh` zTU(nmL2bhXhyf%xc#WCw-wBa;8r!wT?L@#6zyRWV0kZ?qLe7&XuPG1Te^6A^O`6v}wGm<7{%Mwk(0BWCxGFO9&$iHua-#ZLg1>tS&K z2)T$Sf&;w*R%=31i*sk%Z3IFi!k{XS1t4RI-E~sz zj))32QhxKQ1rvHDBEWE0(*+nmai~H&xD54pH^f5Vn&41GYx%Fo^5Q`28@>1-4;7Bf zEr<55iApHBrly9df7df;HjnXDkI+5E`?TxhK$ldGk>Pn-4mB>Uli^-b5ok!ejBBn@ zg%>6#mn%hlJ1)3mI;vwxN9Xb_aeTwtY&;H0K+43*n8%u4f zzJByIy)ynTH;K$dzQ~&JWpm!KsaI<1y2&K%1cA1KA~w@2IxR*984~r<3`4 zaeF5hZ@!^qv$Hh+UZaajMpq359tc^V=Km+1Dm$L6tMb|Z;@j8t^?%yDj`V4L-utn; z{ix_9Ij~CA9g2aD0=vQOpD+CS`k;t$o2uYOkFLO(f7b*!Tk{M@G-n6s$*EeYTF};Y za&>aaa5v73;yaV7%enQJ)MneXr2~zKoU4wud$HWe6!WAQNjyDc< zP<=AYvOX}wJ;5SehQF#)vSE=r4e0f2UZOxR@tqXJ{RJa7p^C$7-+I8CA=xUZsKxCE zuiD$c9U1vSfZL;^g$)g3f}(gfLQO;Doe&91gi9KULRf7$fM6Ih27C(FdI}IV4b;_y z?Ku+MB;1lS8-z#MGj6CW--My~+|%lYZaA08R3+>Hl$ z{=+W(4~5&3$8!n)lG$Q#~^( zd4YTXF@e+Y>Vz4dY)<6>gmU3Pe{!zSaR>b%nHyf7#p(U2Q`zor`=B2Y6*$c_G`?>4 z&4&87pX8^pQ&`~9l*7VJ5ma&7>RmKBIgRFTN;!ip$A?O5;Oq)zuU^h%smV|GfAY1@ z<$%r|vk$X$H-}G~WGuo`nLwqoQ;2<{Q7p)EYr}Sjl}P3(*VLVx>;2M~6MhctdlkU0 z@hy$zS$%MotW;fL>po%cRvst^W@=b9_l)ERa?X*5RXILrR}yA5=!u9B-VB?tEZ}VF z-=0IyYTDAw&?eiVISL8O$=vq|(4bJwY6~m4F{Z?e3GIKYlPkScPWC9wAy1$@VO!?G zCQ9*UQ7fJQ@7;-07X=v+-$dkDP&<3w2I9~}zW?H9RQT?|<_Vk~I+Y7pXo#=SMBxlb z90qJ67|#x*kjFd1fQ3qYxtch1m*O%B#TkJIJNtfR$?zJd{GWakSFphe9A|`x8D}G! z1&O0aKNCm+qO{IEe2c4jVj&BQpQ!0J2oD(H8&KrrpdcaSE`+7bzU7oUtwI^w(#6OH zXKO7f_5+SXsT`eW=mHJ&t^{fpS*XWa6{uj+1L8}ISgoBX&+5{VSH*^Rw8Y=7GL&m( zES639x^6e7tIB!Q;epEb;XZwmS)()du}l_?q2f3?`nO+B8tQCjDE7V)?qO`7k@g%c zG`USKNfX`nzeiA}{d(gAlO5;li!J;)Ue7W^`SWd{mXz^HNxG6mMJj4>YWA)>gOrcB=W74` zLlhxprH!Ji=q(e!{+^i@j@#{6u}y=rf4iK`4y!>%M~eZP3OV})fdh0!Ob;G*r*iuL zm|XH$J92H4Z%5a~w=e(tF<3qCbW7lC4Z5f5;>-1~ulc6lpR1&wOnQ4h-XHE9ir>HT zL^^TJW#riXcikUY9|yR>JJz<7Da>f3%g;|;Wtp92$pwwTrn72ws+UsCc< zagO}@iW+dM!fyDVXZW=;S8qM>dl0czUMyf?#O^aSEM;ZL|831_aG%ukjK;)o z6GI#=E=*b9^556y7GL*ByPN&_udS2h*GlrG#fl!Pi}JFJoC)|_z|Zxw zXj@*g%dAvuK3{7QznG}w?sT3YOD?+Y;xV)f&JV;pjz})5ob;KZ?z%f0Gc~ejkb&~r zm^6anFGoKoAZ-hlYR~0XyRmymiZ~j>PRomjjf8w71KNwc)YVp5>Bj8?th$F<=j1My zhm!76j~wDrxRi2u=P-{|nmEsTGar|lXnmRR1PRv?hpTIM5A(j9isoYq)}&3Z06hHQ z4EugWC-Po<@H-xGjFUxg{&>L|-B!TSnqT)IpX|!hrN0vLFH$`Rt}C+D1lStgtPDN7 zxv^=yZ?M!Pa(Q%!tCwX-y|-VY`AcOH)5P=h@^3p?3cd?nciee$tnp+ulLXCMowZxf z&rO^$(F>t6ky7F3-Q~ccsMqfIx30$A&^hJg%2C+G=90gaZT~mZ-B~uZ&A_wtN&9`) znhPy67tbiQ2p&pNC#)V08u$Wr&PyrPTukh_41ZCHB>aO%!3~#G;gErWPr%H`oz|i; zKX$)3&2sy;VpZcfW!xPjjUq!^4$=t1M3|-TDhf4 zPnjw@D%#&VyOSxzmSy6P1b)9O8QeGPLoc>#nEKi=7*s9imC1@V4zR7X>5gij?Qm7x z9`n!T%?{!veIkR%03Gj)ksQyux#dJ|YQshH$AMGEhRR<3=e)Fs`trwBUkmDo_p*69 zM3}d%xVnDV)Fusbi_=E!IVy8j;g-G3i3g2;{qDc%WhsQBq}*e0k0@`8nYYt-OAFzF ztl}`MU9`V-E1WAWLIY-`;d8K8ry<8tmlTmCyz9{(hl*|Dv{+6Z0UupvzqPdB04W@K z9M&FO)$xqsaP>8fo%^d6r*6tirl$8h@VP9#{V>{gPv>#?)gv*x+Jk0ITJD*?JNw6! zt0h@U{EnB7__6Xo4qVQK7Is0R{BR7ZYGfEVry%%vxT$2+`*O%`$)Df1)kJT2uN6uN zF(2jXBK2EI=m>I4@P3rpWKZc}%KPBqtbckzwCBKLtH7q!56=F;u=h20!rrHEZQV=* zKIvZ=7`Po3@r)`B8E~htu=i?WM;%rl>}Sjtm{@ZX`Ph7#`~W?J6&hmy?t@YzVIMxV z6|sib8Xjww^Ml58<||Xegs15{rP++brH=jE4@<=EIpN3Xx#prxPfckYhr;7jinvlk zb%t)^6Qlgg-}znV4`c`EWaLLYX1>uSE8hN`Q-cx+TxdY0LRCR^chldCL#@4%i-9|K zSm8H*&AcndqLQ{I`ks*Nqh~nHqgZo{Hy*;tm*)AdOecuhsG%aG z_Qr|&gq^=@@^AYUB&WbKGZuZt`($|S#?~HLu~P=24|jkLF?IJ{v32?}-gkgxCB7q= zEabY+UPq;avsXMKF<2)?72%rHT|p6=i{>YHGE&stZ22x&VHwR{G_`-O`}NYj>(C+b z+PqU_HSO&dYLk6=^0=s6*Y5-C-=w!1Les^_PUPJ^`hY=)vEL;B$mLACwE|9NrbKF^ z3oQnNE=D^u+pif?FZjfslU)2pG93U`m}dRR98WKvA*t%Ej->*g@lhCGi_jxZ=4guK z)NidK`qZM*9lu7Ik}R>ziXsBVT82s$Pf2q>b(gcb(Zx;Dzda?oZ|$wt_%ug(poKUs zHKl)?Lwobnuz#oN1k7}8|SL|Q`EB$98k$6s`jIq-RFr9|iam=;-XlE5cKT9|T4$urcY+q|1+4!6ug z4(cCJS`K6l&=MP8Llw|s|DR77hv6bos?L-8e7Mr)}55eVACk;HW8Ofvs zXgrhTt{&gq6qDMGb+rcRNOHX@8gt#)F)>Z5pJ{uZ zEPOsoPeF2I_y@<$GT_~mP%V|n`WVFQzQ@-B-H4_H&V!BUL579LC{_aJzV1(3A5z;z zD=Pn?`HG1nhw_zBw^O{ji~q841gN8+B=8!b@|G1KLqx`vw>8ny|9;fdU4@lf8NlcO`yj;cUwSC=q_B(wJu-nmDbYT3K zY4__lX5*b6=dW5igjI3wE?9RwJjc^y$K}Ey>ABpngG;`z@snJO%^d5+2Q;)d21Sfs zGb>!_K;_?IOEP+v|69I@{@ypq=25a1=0jt8v+*2?3b$&c^8dii-I6Tlf*~`< zc~B&g{#|K#r_B1P@%{V7$;vxJ;^#gaO$RK@H9FUNxdgmS)@>io@wQ5!eH@*B?89)= z28;*Ua)mRL8UtsB4IzBqQ;zuR;07_X|;Ex*E) z`&D;2Oe7iJva?9gxcakeHGW{N=?k&(^K}yU6Ad2dGs~`5)C^?`oU`(aNf*2SPLb)T z;8&>|UA{hSzxNLvb5`Wfm&|AIiKH2z4NP+8BW@I?w?^5bS>ue+7Zy{$!|ee}SuKoW ze=`3q`xA1qr$jN)=Iur6h5oz zDlL@e`w}9J8|LPKB5EhnzkjSrYo}7~=T~>Xy*(Q%>Yy8&^W$+ig@dVPN`_buC9Ly_ zU*6n|EPg0G-YNormz$j6&W+P76|V0T8LaYinbWiDRh&~Uwog#KSg<_G%g9vaEbd(V z8>;a zeYej?%0B&x5a}`9mZwxHeO={`f(8_d*es0`s~H|?4Do86n%KBIBJ8B9aX2b%*)a4{;p+RfDoS%qs%PS<@Y5uRfpwHG7b5su z-4Z&;-tjtoSvxqtFlF-fM5(zUe|~-Q0Gp5y&5o5MsTcP;Z1)s@iIRhEkISwjsE8$7 z{xn`YT?qks<~dW99wC{ImQG{Pp4dyTf7uaMHbsHTEYkL8`NyG_ucT0-p8Vx%y7TaH zEqX1+f}u#sRHc&N)!85-}@I^?u5w@5DQ`3;HOgXr)?`c5efdI0)c!4 zM+Nj~6Mn2|;$;9A|HrGFb%QlccONtYa4CdYA;|g%5Pw4yxIDpN61s6L$~4FiOh9pi zBRqj&O>U*1A%u1Z0gypigy@PORABGd*3+}OdX?~fVA#_c#PJi1 zFoHF-%7*V8m-MV~L9cQ0Q*(^F?%gT@<%q20lWrCGV%m#8et6rqNZtMV`k z*0zHET9zJ(NcAnXj21g%P14F;{~%B9es!c@f!E~_!BKRKt$CQO{y-*dI>`Q2*{MCf>wc9FOAn4w;z|haHz4SFb2f4cn4?+7wVF(QR)Nrx|)4 zMD|t;wdW#rU0G^_n4e9Us5tFM8~r_E{2Cz*<;AX{aM zOOUsOV1eM~L8JN;3v2ZMX!`DWtl$58+igo^WUqu|C1kJ2P81<~6eUt=*(0fpY?UNL zHbu%7lAUNHB~j6&RKIh*Ki}V9^(f=MU-xxA$9bOTIl#e%PQ1TH_T@-w6#~>qz~j=2 zira{CaF)6SRA&g%6mySM28r*<9yllvm0bi?BBPqw{7p)qlZdv5{}~UjhwBPi5`@sH zK6HPeKSY=rSTG{r^`9{Vwg~q@&xFiT=jUr-zXg%V5x6XLfh72gsFy-)s?iyiIB#NM zgm40a=jHHy;EMwkn%?J~>w-*8qA<2{74CoA`5J@_G72m!gFqkwl88JqIDbSfjR**1 zy^lz202<#7(=k&?LiEE_2R%GoM(>VVZL@52R)Y%y(D|J>!jbgNcQZOfq}J|C(zq2@ zI^^*3S%2m8#^OvigN%rclbKmBB+^&ANeT0Em8CPVBV}kJ(`O+ob z9f4j=6dR$im&>Ls^NFWU3%zz7ObK1JW3gnCC^Zrm;t*V4fcWMBQ|d;K)>bZK_FRO_JHNb=QFC%dM2nHDEzLz^}TF z{hZFTYhPkbj|5;S(wCQikKKH#4HLxq%9dA{KPkXE3c@~6lgz<31xD{-A8r<}{%-l# z1m4Q?1u`0PR+zwv&(iV(Tr|kcmIN5 zZOuZ8Z#OurYJHe=caKSzo66R0A~q2CVMbJ-!&;cDNgA@3eNXMen>nxzJ9+VpGF=N-d{1O#(7EG$o&E28 zsSpLS!K;UWS7T}T&Hq`uI6Uy!odOr(b zhAtLQ$i$W?#-sQn>?aJY7hnBs9!CM@i+MA?4|JX5$Z)>3#AFUj^K+;pu>^bzHf0c9 z#p`~GA;?DHP#4ewz=qMYoA)C)knI4?MnEawxR7Fnc#6M&g< zSDF7TYubn;?ejtn{SX6V{DVwq!zEsB`Wf2iV|T_!T_r`<(8u);d}&nDdfYwy{jv12 zsmi(i{8tO4r<=Cf@T71w2GMNu<;$G;STFz4J1}Jl70t4R+-v9Vu3S?_!JUSN?Fp}H zGH)bZsmUytE>KgJryMuD5`OTStoWLe|LW!tqWcK%A*^EljN5uoA4Me;Yc{6uK!c=> zdpfQD1D3-3;D5jYxo4vE3$$H21;16Z$wmN4Gj%R1w(lK&bVu& zufyCMKa4yn(2o@UV}Ujtz7EV_43-7N``{QRSYSggd4LK9QhGm0Fhru8Xg~A&=1sxT zGzc^%V$Vl*kzG%Igmj1lq}s4lK)jexhvV~i^t~(v)pfAW-mZVW9EZcvL_Qf(q(GiS zZrwR-MiKowkOw9aQE<088legg%jkBp(Mbw=5E=09h#Wj#zIpRSU_CN8sIbc>f@-W0pF6A5aYkkrEii2 z606;xq8czt@>uXb>$%x{qmLQKRmZMXLGzQ@Sw&Je|JOeEc`1Lo|I?Moju8GE-XZdI z4@ePUG=Y7UZYqgGN$g+1=<-9i%uA*$E!cDYkEwu43S9d^kx6kCNUVd=RWR}^*+3yy zsCF{kpvPhqK=vGoMkMY=IAp%TnG}I=#c6a}gc?bVEef%Tge&pm=VQ@9))b}*B}>bh z@bte~&B|}H+9s+DjC6L{R>yLvebFDpID}fkr`3ji4I`vq(*|dWpvLF$e<%O1j*f-qJ&13_Coz|(&b<0w zag4xVC^m?R+6!!45wT9>qcp4H%h(VlE<2T=7O8_M9iXPFI)k>eo(y-l>wH;5atMwj zD3PFaxq(Ro^qsc`gi=i`CXj_{qLPD&ehG5G$N8K3R$)2a45svg<2{GJdl~$bVC}-x z!DV=z6W2nrIEa#E&l+#$Mk;H2cO30q9K3GIC@br_Te_&B@*>N#o;VAuuW_<8m3beM ze{QX@i@P9xHsVytG*7C{(p?B~6Z3>VP*?Iv*eKc@A!HW)?-}`$1UQ7z3qoWZ+Ea3(TRt@+Tr6na3%}>}5zuT|50$jL^W z!(F*;&u#1kbKm;^8CQ@pbT6Dh;lFSlG*&{GyT?s{282=#Tvzf=aHNlV{OcaTq_I@bSWfYkixFhG^L`p9|Pi1mUV&Xs0hjHd1NZb#7S3F;^k^AH^{l8|j zxStq55XT%yz|lo!dVt5>3_t}gfoHt2%*U=V!%6l>6BAn!4*PQG21u;MLizecLC5ad z?&BBQvUsAQ6!?QnTk1hE$_X~6=ePK3ulel>No_U1bF;JGMN7j}98&<7kjL1Jc;0XL zNARa4$G71;Re7Eui)cIuEErb_6nXF2H#1Bx~#Q^fKHpLDNamIw1P)m1|BKj4fTH*Qc^44DT-Dwi8m)G_&k{ z%vxJ>#WVlW8(J-u&Ny*e?-LJi&5L$k@ZT>EC_$z6#b_Cx;0ETb)F1aS0!kaKsy02D zJ&@{tGvdx;&fm|y41e_8JWemQYu9QqbTdZ%vC|M27Z-p<*28Ze5DG5{`>0RKHd1In zYU@LMBO?_+MK=pP4tQYnIxcjt>4Nq70?y&AML})vin+=7z$7bWX=8-~1q?$zaK+qK z`hyUi-KNjpaNy(?hj7RN#4`G|4%#0g=c$zv{f{a5!U z47(I@KQFD`*sS|1;ji*+`J3nSSy!aipSbXV?jn0h$+C#A>lF^Q;FBD=iE**iwKc1! z*Phk;-;g*QD^f&53{~Ef;bD?%eZWmd{SRCM-}%pS``K*Azt^%i`VSrm)75?1+Ag3o zWU8jRFm*=fexiuADDM|N-Q2{-QVrE<*XJGgqIxon0%Y@4TDr)wCWTGvL5v9^pQFg3 z9=ofH_iDu6q~fHBbI;sI5IpyNB(xrHgyNZ=c z)QFANUhx$5$$zBxC`atzypLguOD#s?W67dI5MSeqAV1xWUcBgv;b!E1FK=5D z`04%B?|F@?RWoZ!=?+q z1X&3{i=+xKf?U)p5E0mIyW|8kXB3+>&CRZ`JJIe^idH&oA$U?>+gt6@o_$^}s0%yP zG8&pPcUo+Gm%}c+@TQ|5BknujhwO^BwE3EREjt=4*8L>Jdm8{8otxpaQn+SinF4cQbV`pS}={byor_TI(IAgHcZ-1O~&#@<8f1ZEz zu;##%gbxYlLAAhheGJ3{C-#YCZ7q3X{b8Oft<25!7c6?r`U?#d4$Ypo_cC-~*t zwG41w-DeqysUcr(o&ELHTbpaH8QB?hvEZX_shCQkmXI#i2<7%n1zXOwAZGj~N~=!n zBpkxFA0e?$r*92>riumVMIds|E{3mq0#pz_@m>s|YYQe*JUoM-8y^;gF%^{5-_|Iy zYF|~qkiJ6-*Lq*)Vfb1gF_AWwkm@1RFo!CZEKjwp_Os_>J56KUK2%J)xHp~5z_wFjp-46AO_LjL|Z0$4F4R-TsGXg zt!P5(0H`a8)#dw57h{#2$IX1tULKL3m*73&TE8Z3Wc6C^4=zl8K3B{p9>rdZbn%Lp z+-t#Z-`z;0I0+WCY)l48=7+nbHFw|_)X8&v4>_>)bBSj>w@R(^6RSWY%g)N@D+_)m zQeg)oKUdDCP#1YGyYR+8Nu~tYCtW=V_!D!nMvcKTjW#`t?PrT(TFe$&=v;G@Y3N+< z?zC8Nq{de1k1gCGbJ7(H`C@H)+2H{`rxN3OUKfI{b6fVut=6w{U6QH$*$gQWZ49ngo5!S5p|$OcVi;%+O2%#ep0izl$_LRu0msGvI_i40l- z(_>rI)k`3XE}Om+ik}pk%5<_WfJH|LAKk*P14c>UJPl-Tu1X$0m=BwVqht%n3CH)N@n+?~Cp$VOA&OE~^Oc znv7CA+WV#aFi>j+|Jgd$v#l7Vd{Ra|Toudt21u6QM7@yK&}VvM%$&hQvNue!5&%J= zhzqQNrH%W=e?Xv6Yj@q(Xf=g^H)-X9F5Noz&UKN4w>%t0y0>Duesy05$S>($&fqtN z8W$BhZZR^C;@o8B%5TW2;Jc^Me|d)ua?FwrU;X5|OLBG+ra>7IMR zt`aCHH+>o+MJrucayF^q&c$Me-gqxs2G5+-Bx_q9WzMzTUIu&L%O198>^D0)Xq!L@ z$gMYA?KZ*69otQFMeV-7W0KXkd)^mf;%}XFS-De&@Pa*9GtA_a%52jIQ~ z%@DFmiEi>C(J_Op$Fcq`<3xfVowOd7_7UWuoEwUN+=KS|<3@^~>5!|3=dcj&ebecX)?C~&6c^Tq7VR9@RgOY10GNRvZA%Bk}zz>@UV`@-|U3GlE>zQ-P~hh<|ngqLCQN_I#K*EUH{hc!=D6R zIdxp{$6!FDuG%~m2TR^IcNp1ea1gV!V zMlAPb6S(be!o@p_aavoCd~ws=b^~;fZf^TE#;Z3obDN%4=Db;-l~Zl`>C>CL3a^|k zT{`2qXuT7?pY`SaV4c0VfrroGL3Y{P#;=!!WV%;xryYBo!s0m6A#xX7qgOgbzWli} z(0M(@h3fN(rM(f~aaZ$`7#*Ky!VcNS4h8<4w3xqrAH;cY`P#CLitojYZu6~oSq#!e za|%n(6@J_-5YtaOuq~|cs`l3fo9=!W=O+V8=VuJUYx!{NMQv=WPfG<{2lPcCc>oBQr43lLSV!<%ge_g zV1NzJYHU5Ohb}8wE<*u`C9ihHx=qBt4~sZ(-I|}({ntofA^bp$n);BwD{W-d$uxJ= zKbP2clRHK9EN~67w;Uic&xZvGg5ZTq^w$F&&HnxSlOWXU16)oCkE9VHS13GJ zfQAoz1wW~2q2^pm2^1|LG6A_iC3SUd(>)b7u;^1%F<1UpplN<2-OseD4$~-X%H+3l zJe%0q@mnAPtE8t>sQzU_+PSh+hfjC)&*hL$8pmd(x1LNfZg)))k~FbRmRe^VB)Zdv zWu0@VjoeUF*&&`=n+n!(Cb#zmiL!Ikt>L8ONfx5e8K^mKJ@)$RzYS;d^DW8_1?JA) zWRIfL5~MwNdGt%b&?s}wq>Tr*!=s3esenIA>3o)u}YEAjAjEq{zg(D>s9DALUy<-&CDV*KMxI3YC zj})H(yM{vvi$OwoGW{N@9_8SSYFkBRt`E_Z!)-!Q&qO=<{k+oiCpdEFTgwdVX!uP` z?XDH`jHn*J&eeRlJ`JpkI$_zs@s-ul!hS7oFgVNayG>v3bzsz$!Zp`1QyKvNyQ3a1|i~f6$ z$Zk(Dv$u5*sg^?%wk&FEPL7L}jJ{vb@kl=QwserJDD_XHDEU_T;SvS9eRtcgM`w!+ z@I>)!n5yDf)l52KaQA_=cu7Z%tjrI?2G+#<6yvBf?rxmUsfkpN<3%4(mFD-hP{*3@ zvaxA}cOvmpB?ACHMK>x&c0sqnE83@4-ewAFpSTngLr0+KTMlxV#&vpB54D7c17tI> zx96FfnsN?%n||c;tIOqk@6=#<5)RCUVPP7%TMzkQhTxZDGXI1Cq3qSw)!f|N$=TVx zfMw1mCKi~biJ0RHD_j0*hJ}S4c|R0shmEOzTo?;8GbZ#9F94Iiz%}AyWyrJIfbB}7 zQB}MK-I%_&)1Y#_!; zNj!JX%-r12mfK2+kJZb^Cm74)oa@#-*l0lU@bFL+IG?ACC2{SlPk2?yzP0H=3^g@oxTbH-0W28lZ)%2*u+ikO2VxOJ4g z+jSPF{i+`h#vWK${Joa*W@{Z?f`gks&pk(aHGbyPoMjQ>qMdi1<>c4W|8-#B8XIj` zWLv|m#?)LI@9Ll+lW!Qxc}kPlD^*lKcJq9rBm?#3O*S)(x-D#*aQ~hv;ke!4mbv~_SsWj|bZ6@$ z$>U$>l6093I}isXZ|3dZ&9bV@_0GO^_xHv4Y=?8qQ}{e;@mhicdNNi>B&b(d9bZ=O`)*XzrBHRQFKTs932u(D@g zwKz?Ax2x5GSB6HiIo&%(P|irk`O*fu@Qu;wV{U1pPxP(_(VyXG`e>=T!oRb@D4t!Y z{moKxX6ANL&PjmOl2TH!sFGr_ZlJ89;#j|*2ZcPPv9S?nFXY>MTTJreUwfv z-8yA##gaa6WOOtP%hOeR*Rz*V`fGU;ljIjbFe_1nwB=KdLHIUA?WR{&1@f`v zR!)_~<1wJ9T6Vly5;fy`y#>BdCP{p4s1@{1pVn5(Jr7W~I`Fv~NKOy1U~b{+DvY}G zEfgv?Xlq}_L^j1Ps!h~@B5Bs{rM!lR$JpP0qwvM}sw%}Z@+M5m=bcmK*(x}qOGTYM z)&teRj$7*nmLo<8wFQ0&;)Uu(L);bnt zw@iJiG!HQY>RLK`YSXdFMx*yW*HUbwQml^GQ1(YpCi@ps-h0JeJmBu9-pQ}tUm4BL zM@MOXJ0_O@ReM9UjZlnftcem71)?ixqgYbuo!ujkN(=PTuttfTm(@$xIA>bZK#W8tEQW$ z&?ANT?Vj!-Lh|KNN-4<)VmWdR?=qa3yx65!#=qK35!PYwVe(S27{8`Pwe6*%I8Dxa zvBGG1zq(Pjwalmoys6F{6J(7tx!UL!Ao;B($~ekXNBv#=&rx?K!zcNm=n+GOzN zrkH2F(x=Yv+T%hSUKul+)+!lEqt0z5$I`mWY&xEQhiyR_5jSn}3B}ZQN^Yy*4+F}C zBg@q$H@kH`QPR39%$YKrl*y&z@YM8znDNBNqXh*8iz}zF{F8V^`=qk(fZzoY-2sSz zCnO}eEl#%G!~9(fw#t}KM80e~R(tHTtC!;gKUFT~*etCu<))(_rzhK@iCRq3`mGmm z6UXPJ6cjGtT-^?QZqjn*k2>sbEV#m}Z^mPhw0mx4z{41@0t6wJq)JO_Hazype{qO7Gwe}V(?AJkq&YKQy1Z(B( zlf8$$!5KqVZid=>0)8GWZy5#I8QET){^>#@5eTx|jg07uPl3chNVMM;o~E7t{i7NI zpyK`yCuL>jiRRPWYUIB{B=RffR_?V=lfC&JGc>va)Yc-o_NHxMVu0_4!kD+WlmX@0 z?Z9)AW_1BiQxR}?*?XfA>3r~D1pD1dnDeAwzHI5?A?{O~ot4G+QS>FZxfnMHH)yF-dCE= zB%By2Cojq}z~vipQDw!EGeTM~ZACbqwIz`zEuuK_S`UZ6z^pxQj3kfi0R|4i=;Fkw zr$z}|TSXa@v}wZ2BDB_{!dzP*HcIg}_;=E>Vn{0<~=+Fq= zIqN9HxFc*AR`MIyNH!0aM_b3IkKyJ@>T%^g8DJfhY@g?;8l?UFB*L;FMOwdr`6&O0 z>crbPrdS)UhyWGt6)|Uq>vU1(nV(~I(_58vW0oD(ueG=suX?`rTXo0kjuMVG8^$`- zNa=i83VxSMT!W&O+)~FqX1@bb^Bt4cl?g9Sy&MLAffob1_x7<}zo-|8bA?_G&}}zj=I5&8B#rueb}dpdgBxmLWMcwY}873^GC;Zi;Sqo>xB&C@d-(DYh0t z5(bpw3)?E(8h9HjLDNzjDc;Q5di!`N#Gz4%w)xa9g-m}xfs-$j*nVU2#C`nHNJm2r znN=KVznljv3$I(QZWlRyDUz0P`iQ1R8mfkhiVLVKFuP6c_mR-j%40y?yleOF>;3|e z#K1*SwKPnX6u@7!ggFumL}MnK?zwK>enC**mK$|xFlO!XD7f?B?zISeg_KK|j8JG4 z!&W*Pe4{wm`zNZw-E0FZFz`0``RV1; zJBLKjeH(4x{$EK{;nIhf_O$8PW|Yk&e88bJ51Km|${Hg>YiMZT;T#Lo5=KE0(dL$a z^5-W!Sv<(6)t-#6Pkm)W`|++PMFP)Xyib`eKy5wlJFL>SK@lkfA2056_XQzVVXZ9k z&M~)et9Me$?Vox3)^^XH9@GMUFYj)FgeT%W*6YtEB#>*5r-4fBVTDT*wDs4x+&$7Z z6+}cCxYn+n8@fh|Vd~86tS4fb#fPl6kom) zM6XIMGS(WurK)J1PHE&HSJVejOl;_8PEJJ&@NqKS6!10MCFUH*rTd>~9S zKetKh?_I0T!@2sKX>Rd6!jd`(ply-Tu!&~pmgI=a7ga^< zvb3TRo9Eq6Z(8`GS1s}^TfOhciRFiEC@mxpXK?d;SwJ%q-9E{{=q$p}E87!Q>$O+Z zGJ2E3@jDDd2w&7fPoC&sq7mvBrLv~H+udF(RW-;Wad~po-9_jU!{kTV5_W@Qa+0O0 z%pWG7OjUX>I%$ZCzGgWr`>iI}D)$3=dTXgxUWMh?vg*^c(Gfnfl(wJCk^i)rgdPpG z_iz-@N}bV*koEf_fx@2jn$Y~6Mc$4v5JS%gezO#6LG+erYt4=xRqO5TJ%u%sOX=xr zL`1A{lSED}QlkzBaUvQ4Vlqg*3NhivjitHbt0Tx*I=|jaurkm>&xQ^{rhI6-^D#Cc zUjT1QJ3G5*BzpnX1ctL`&$5c>H6!rbtix+2i z#u|u06$wSiWD~A@jl8EKpC1SjT@Taco;HSTShHr077$rn76l(LMe@`SN3}&WdaC6% za%T2*5ylA7`)=>(&@dhkWoBl^p0x13)8BbauBX6GaHMjd?m*Yvkph2#=eGkT&`E=u z!fo6ZpcXRIvxY>Wmj`Dtt&%`d;Dt%5>O_@0EjDUUa1gU}RZAiOF*7qG+NZqtcEA*P zh#m+vl9G~(F2=^j7J2F^>_VD~Xn{ODJsWpzu)Z<_@wl0H@3?q*yP>16J__~T>gOL3 z3*l|F41Y6n-TC?XJ?-Uaon{xH4b+Ogu_pe)YySlpWK?VKD!bFO&_KBdxrvcJxY8eFu;?4@Zsgkg- z5{E9vxxTjr&COR1zPy`~n|rRbRQ3H>880~O)2)%Tq|X9ELRvq-4S)q%AS}yP3eim> z_I>$KRyl&#|K;n~Fd(B@nxV4U+1Yf_`m1MjVWHms@#t54MGb0Gh?pT=p`}AyZaVgv zSP}HpScpPOPAvmZKK05KD_Su+lsm{aC@wAkets&+Hy7jTP{JNHa7R$N(BJKn-zD#u z!?wwVU$nUtRRtL|T8l?b*NQHUGQF?5FYGWLu{+*Jmh~J}S*QOQAqV@8_$@XfQ55=L zPp_5H2PpshVbHo}b3l3g<%4_nvGC~geTZ;hlUxw&Y7pTPH!kO9MmeSF$CV`|z%PaH zk#oRiCf-4XMk%b5VF}VtVdkU1^h?a(oqS@1I&I96cxs2JU^LgMl;RE zd1$gg68Pjti$x!vdrs7ICVt*AeDv(U^L6Nan2w%w3*(vDGsVIi5URg^ZQ=f^LarBL z$!t~C?05ILS+d(q@kN&?ZL6e+%UFYnv8Be?bIX%+Jbagt^pvjdkGUfo~sGM*xNmUIyy z8|Tk!W?rwVN(Q@?$h)9U?%RmWPaqET7dg<`Ugww*hB_S_c`39$8^pw@9W(qF;e5*} zB-Ed;AI)j7=mIAUP^eQN+!6GCNDM83-|J>=-;vPE_fP)Zi5v_>vS(nR$anCHX==>q zoEMNeEpV@ZhA5$hN677j5Yl@j)!Eel6)lIFSELE}hI~uV$f=HaKma``mts&ENk~M4 z->n4krkt&Z1`x?6?uDr!gNtq4c$P#}6efr$aq@kD=&HfSX5bLE08T-!Hhkv1yuG2$ zN)eZkAWm~=H`Gv-BnfR>XK&xgjca68QdcDni;PxX*R9gKY>oI=%5w z@|>}Rif4$hK-v_ltlETBvygtKWC1(_~NO(2>+Y9FjVci9pwBD zd_I1oMQlf#E+eAVq5vgN#K}nj|IpcKH2vm{Qnp3jMs8+6JC+0Q#@x$TUWoa5Myb=z z?pjCH!k$AF&ssBiuQY1WY}3MzhzdiIZAYs0*01HgRMh^`HlJz0oF||8%n{tS7R7|E zLC<`6U+ku&Fz=Df+Q)Rrp)H!g`83O(Opg?z>3BwVEjKV^TtO$LtU4sA$VAE1*pNmy zCvb_ewcJpJhg)BQI;MB1mv!CQa3*U?hJ72$4Yy3UD%ykRBD{D4lzAno|8(SE=YJt4 zkS&Q{mg5qqb5y~U=9cp8;{nz{i##9Bp_eq9&Ic(|{&M!v0D=sWRn(?FC8l7?qo~QX zQ*~hDfZp{z^uOYUdxWCya?*vK*{Lri?u8f#^uucF5jDe9=JoUWvQ#ovC0w_-wAL`* z5sHgVUo_w+^I|S0(mkJ&tiIJg zf^PYU0uZ8ux~yr_Zkdc+_LRAxc8>T{czKBt*g&T16u<*BDHBkf!P2y)=^HVx!+6kz?iTZx=Jss-%+AXb1R2wK z=T0tkIiyC+yI5Mv%C8&)ASVinsS%iWW2T`)6G;V_cLspUcQ%1OIdqmI?%mVE z$JdD>z|`FQ4ayZF`*~bT7&4r_7}h3SyjZNS$Tx%VhU;%3y%yO8<;fA3S!Wb+XD?jv z!NYSt{e28Ul+;2Hej-I8%8mzaib0@~v%yV)6;(-{-*6Ok5y{s8CEelw~QJadH8C|Ldm zLywcx=FtencF2i}e1+b98F>ZZ%mRbITOrY>j7sS(s(N2Ep^vWWUR_>3ER>kzB6Q;K?_Owgo5YTc6w-|(Kw<`zMc{A6G<~{z4)F=!VnDG9o4b)o z+C+qS?AhX&Bk8^FEbrK7e(j=AO;SGdKyW+9MZx%T13m4@c&+i;3ok zSY6>Xr2&fReB~GCyY{U+lF!qYqQg~Po7mzj`$JECL7{iqk2CLixFpK6N9$1TG(3syexnUeA=`0FNQt$ya;omY_yr6l z3S^ksyd2+MLRmjtzIUqt&>9AILDSICEr1)42}euq<#d)OY5#u7Y;jZMBi#^M#3OSf zvA`5jly8)gnZ!QVx6iMy;^Z1!<8*g-r-(IV_4Jrx#Iu5Rp^ck1c_T~_*aG?Y8U~UD zlRtlFZ#$*{zuRr7VBEoYCZ$MPuMsZ&WFy*If`IId%PdIhVtfc z-=;f32yt9%*0dda`thi=WlkrMlK%=e01jvhJNDNrLtT=Lpb)735Bxw=l!b06L=1_$ zsI)W@U`#N?NdbVhq9f^l{qOHFJPEX37O}jV`5>EKu!SIQ-hWpAC2#`yPXBf{;%4JNQ3@8JD`GAXs zL9Gs>?`bl*MoO9mvhF$4lS1Bj?Nh%+B%cvIO4~8B)Xt5F(`zJ5l2cOjeSD;gDPnk? z(s(^8{y7gY301cP_zYAauXid4sDgSXa5vPIW&pO?Qd3h=*Uhw?WnK8${ybJujjMu# zHs0d;Gtt$0)`zQ$4w_lsS$6E^R_$ePIen=PQ9c+d_E5WQa!bwEr0`G!YAqGLM6Wk1 zlEn3bpJ_Z^|A2%k&6Q1YPv6=IVK9}jHDa>;2!IoM9hoos#++JW>im-@k4#o^C~wK) zq;)vkS3uxf{u_&4f}H}BW5J6tZWfXyQ6}XURgydao_=Wp_O)dH?`utJ(B&3HS@a-Z_M7y$v5;ZDKwfgH0@r0Z+KBF|GO+XV7(?eaO&Q}RmDm{ zXE7Uk8JdcE!BQw%>^O)DgY8pj-gae4FpYe z^X7|aO?LvR#d`M+eA&v^tN)VP-1Jf59o`GkEKBbX6u|N?+Z0MyLL$kvaaDRq3C@d&<^2{i0H>#e0bcSWc>OKMWAW>ju zGcDP&lQ-#(H?q2JjMo-!=wo7%J!M0Cb*%05Fu(xu$*t8xx~w|K^sjO3V!FFG{|-+Q zm+nMmf!>;`Dz2kVQ@m3{{WMCdnO9>BA?tXA}?TY5$&%Vk05C>4FQBhJAj$2q3m zdq2>65CV$s-W9;fmEmrm{kmjV^E7~vicmD7J7#mbbI_8Ug^I_IcQwm_IRNvgs~`;g zcc7OACojA>8!3!6{8)T zh$Hh)&I7t66Cl76mK|7v)QaIF#VCAMGi8p_wF zh=D7D-fJU3nm^yii5DMWNAo><_;BxwQRH@Zb}nMEh1?-PkbOXp&-Qvv2LnnX_Y{eH zje(n5E_8uefg+Gm5*GLSrcWrR320haC^@hJ zm-f~zc|6Sjy;%fMUWph{pfmX2oYmhfneL}lz5Et4l_zW%H_9$7>4|Kcd8)TYb%gGS zvf&1md#*5aqeTvdt%3GGr`L#~5rrKBai7s)7O?px7pvhrstzp>d4R zkFcJVr>W}YERWD%jIL8@yIu|2(kWMl-Ot>N=w>CU&Kadi^A=wHLp?7nfoubz;P)byd9>i=f-KWvf#L9qXiaKt=SxIz(ncM6j3qQDoZL+|axaUHGjFo6 z5ug&PGIvY$3ub4|ya_T2N*cluD)LvQ#2TzV#=yYV)^?TC-{0RNN0q7e>7yH*21CuK zPm-A>`W%!xfZQU{A}-DE`zK&*3v!$1Ibxg38QnJ0csL4t(Y@3KC3^_jZ}14^D^!iAW^m$P8{vY z?w_Ftx(UwL@Gj>7xCKow2eQH7@u@wmkW+NH2-OncQY5CY1U*BB zE;3tNMi(tK^ngyqd@7ljAqIo1HiZzY(#h>S(uV&O-ye(xE^S8}e>(pwhYtz8O*}hy zRrR^0>#bRx@uJ@SJU^Q0p5}x%CCz_i#@CDr-{_w1?#%sSj;@%7EBPi!Z-QUjSj;dV zTgx)_&d@DYk7qLZnj}>!=H!Bl1_^z$qbqIuqc|U5)1f=2aV?tPK(B$7Ytevd^#-df z4dz*ao4!5k^Z#ko*5EfpXW48xrK};yP6Aa~W%ENwhLI+G)`}7dR!1<(T<97+%0{Yj zC`-3PZQA?j(ab5~@YTZukDHDiLR-^?lY#>B8s<%2US43fH1Odh5feSkb5I4K5JwHY zA{HDRyyyOjEqH3uW~msUh!|ve6J9d|D_;aB4M5I~IYrm}1#~YJ`I8`sPH4#!5uxtT z>nkC1!`B)AZ*+yrO)6s<88T2HRBQ4DBA9Qf`Ul@+rE%h$+T6R^*F#gl-BYW7<@{A4 zW4)wEY0JN56p#%q-_;%G`4UjoMSqw9IG-0SxPKk46e{MSt*jk%(Tae-j*RjrFCYlq6Aa$t-Pb@Y#F;T{}fz|lB4r1$ZupYVbaV2g;;~}+P`q; zB0Pg(py3Euev9bu(lRnk(pcdC;|sEYGZu*ba^lA4-!4vds2+MH=$O&SS2=!eaJB;j z`@x}5A;ic68PMs{YFAF_;0ASIM<-%%)^Jpn993w>8Q`p2LK0-8uy@cU5RA(hInkvz zavXY}PlGxYva>;cb7tGQ8$ls-pe$VMG>D<;-;%IJPY73SC~#g~kR7Z!LH7 z7WRfm-xuCO@43K!q?W+w4m#>PPu*~GrCXKh^)Tj3pgCPyEujQ z5<~0S>6-HiRQ9b0IZUHIpLKBaP_0wKkaxv3C|1-lwk%M!k&an6`Q^c4)WvwL0N7(V zR|PS!h~cD&Emw!#cSUb~SX~f(708GNn1h~a5dqmSO}O-_+o>*eUAs0~z7Kz?Jut2S!!VE|jVWy{J3s`5z)um{ zVRXk!o@KXg&A{G74vCiRni3#PjPwHs#w)ymf9G*g=zyI{Tb{AvVnsDpr`Vo(@c0bh zy*auSJqN*v)ruYa(wgAhKCF$XQeYu z3wpx|+Mx62n;qCL2^I6041myiw<4sGB>sP^ga0reHjYLu1k9@ogjJ0FCinHCghFrd z1(WJ8b_wUsy+I{2^W}z1H*`pLdlSnDZ7cVGbEsxss zx4@X2*S;--`N`Ra$qnTtp*A+1k$cxr+g?hD_NK^5dbuhzHoaJVbxiAD@I9@QmJtb$ zO}>P+?EAAHJMC|tLW2Y5s=uy7M56&Dy1YnbP=sT9anRzW6PltXIemk&6Sm1ifiCyWJo^NmPPN=uv z`FwU@%|W4en?|#)^3t{atC1|=UdwWOx5?tAJJ2;F_P_w~%u^*R8s7;Zv1Jm2D>>IC zX6RQ4!{+0_lH@Z6TQTd@Q z6wWBRDY81rxK6>@4-A3DmTL}WVS8X*b8d6<1aTmJyE(j3bU9?q?u_;$%jg%1dWpVU zmfm3jSbAkel=o2KCigKu-Dm9^W|Pk)&6kbt_I14=C8dzn%Q*h^!q~U*u-6t=`-?vv z>Zawd;|+PpNNHN_-c2!DjH_}#aXAl zZ(kl*_S#w-^5|jkA1Xt(GvWyj{%bF+C{oJRtkrKgjn zb?&pAdni5!jkXdX}Jt!}vog=hM5j|Xn}_qgkG{K{ZI ztC|JhLB))m!ls9o(ONC(9`ckZxA;rk{vN!}jvnIs#sW9Lgd0ESA$G|>9wvrz~H zLg|B?6EbALfg_3^MDT~mZ3U>wQT{qBRZKiOux)wV@$t@sB2!XOL8~SRjE9utZHBM`byjMMr*m`vyBb8bNodB&{ov23gvxJU9^5Q^ zf5^sqW2aG+DCHMrDLF86HLDS%7?EY#n{thEXP(5v~OdHtG%wHm!c?BVx0}yzJtQVZV~G{qT1g9=0VLb-9O{9qXO` zGs}b3UjPSrZA9UYXcvv`x3{*w2+a5AwEAs)X2kfCIP(E5(prE*9ayu6J@OD5s&{Ln!I_VmtXAD1IMVsWRy?WDD8WK)tFK(s?8>UvMY*;G!OD+r zD>9XPd%Hr^OS{-NSw3}^Sf6sPr1;x-c1peFITm?^tRQDOj$Oz9ov3*6$R>J<;ooCp zCAEr3@9P0Kzgi!7UukEt$9dAQ_WeWVDA5TqFFI>~gm01th{9z#;sdq=J_EF_gInZ@ zXQNk&%FFvPL-Yf`6Jjvs`&wR+js1>}j%GNQX=1=HbY^*~`S172Tx-rR$jzi?=Cgiel;o!gx8@}3otJA#jy9~rg0ZJ^o+jELWRL9`1 zODnP*f!Ol<orR+@i!*xP4D{fke})cTp<#P$ZjS)!S*e;^9r6?Y$L)_P+dcqUA2W% z4Jx)*$Rx%Xg688rnWZkjnAMr}6#1QnPX`;&u0QXNpMA3@RT2Ur|F5;Tj*7DD-hiL? zQBXusx>4!Ip@$SCq@^2VhHeHaL4A-KTDk^!q@`i#lx`5|&S9iW2_?QWzVG_h@B9B# z*OJBDbKmDaXP>>VeeHer1}_N6q83~uB+$xhx9#Q{$np)Rx(SEzExw85q^MWUQ`Q0t<;NJ_x$!fmE>7BT$bBj34O0sOV@1S62g2n+`-6_S;KfY-xD=!}fE(^dpst=uFo~Ijr zT#qW|U~jIA$e)R~(NDq(ooq!d2y|UhFiEuDRfjx?a>w2^I1^y+ZMU8;W$skoW7HE7 zaM21lX$0*H?p*mdfy!O&#H`FS_PO>Bz?T9tBo?inCA|oaeE$nT6HaYqNAP{K6T%h9 z0}X(hf8_BCgK}ZuAi4sTnH5MLK2ri^+;&RPxU+z`Dz2`+gC;<|H30faw^+~2%nanG zF~N{nj;KrY=1D5?hmBLPFm0;mF4Q{KB}#|&2xx7=@W2X}5``)A`` z>>vi5Zqftw8GzOVbB}96h^zbtHV3Z4Ea3Am4wg=9>u~Kdo7X^TqhT9hjH48vr{#mM zJJf*Yv!D&vL&;3-A!`rce>)QHpPaD7va5S^7>yS?t%!E!o;P_(G_$~zQ*%RaTv?wJ z@nt^O*;S5@>QfZzt!C*dEsqWBQ@~jkYMOS9Ph)oV2d%$N!As&4{{xdMt1wV)q7%f> zUBIaoa}XcDGd;+|G!l1S5oALDKEp^u_UK|7l z!v3edE#ojKpbB$y`wB_~Fo5I!KhGgzjBKo~%8?cIeN>wl>1gj*ZY;W4 zPN^fn`i5IO=6mr;y5%YFw^)+fvK5_ucfIc6iYbDI=+8jqbsR=ytOZ#SpntRnIQKD1 zrpJ}I3reG1+W~m^(+4+PT*+YYUkqC`oE_!%p|TR>9rXY-%AP*_D@$Bl90kg0;|{cd zLTL5{8Q>})x4;B8?>W1A03}vE<&wPK4XYGd>*1LVe0>ux+{Zb1o z0D44x5ZFJ^hx+b^wpQwslcCYy7CMpN%Z_)Rym7dEgEY|mB>exr!Ou5~IF;a8?w0{d z(>(yKvn@jzHp@%L?5G(TYe9^q##o&#zLHltj)O9SaSBvhFaeqfhtoi48#^W>ENl<@ zODcivnhIb`H79T-(SUxzQQGgx6=DJO276Z1SxM-mlec;ANfD=D6#zW`EI1e%OR`H2 z9Fgz9zyrh%Z2OIIT0XGodR!D>UY6rvm4${p_ddMBo}g@`Wn%K4TQL)Jp_M?%=RZn- z6L98+Jaby$zqYnzQ1=$mz;pLnKT?ER)n56w#3#9-0M=7p(kIc#+p-UL4Pml}2Kroy zV6%VL<>E>Ve|&C&(BnTa?M!NX#hw)Qf{6*-SR&K#;bkIDV}UKGk_U5gQhT`jqDMQ4 z_^9|vkG9Fh@Kc#x?B)}2scgmbaJ+VlS-|V(+H>9Yl2626-d-=!TabovI}_{_o60;B zrT|aAErG(_Q&?1VXM3CUwnVn}kgT=Hr0@K50M4sy15^f_J4Y)>3j-H-Hp}yh3%TC=>uByBdtmqN?KTA@9*Wx$LNdfqrO!KY^!4aZ}GmcRX4fC7rh`Ii_E zsa^AxF0UjI1h+AV2Dcq-l#yJwgx=x0KVh%zRJR;`7-c?^(e5bD(Z#4EjCqjr+8T5z zP)+x75#;WzZ|iUebzEyzrL4QD8<1v*+AYHL8R1cMnq*NszIx@WJ5`lE&*49&?4xJV z&s3T2e#p>O1ahXMtJ*QfJE60LPNH7kv8@=%qf1T1IFC2L1Z5UG_I(9NMmf-qnVQ}w z3pQoj);387wK~zMNtRjxJ9m7{*m=YDYM=Ht(^I+pD>ztLy1}$xT+uKRM_MT}Yq~DX zE#^r3ez_f!ZUj|~Kdg7 zAL{#-@bNKSth^UBQKayTv1e>dk1irg%Mq*iU?uZuYZCCan{Dw6ygo(&u_jYl`fc%N zRk}(1$m?^{T~8r0qyJ&uFMZ10i-)c+=y*_fIKW8`n-lyo1zc1?w7)M|!Ry0p{Wav0 z`0_qBIZ(1CtR-B&7D!j9(9sHY@@sVMz=GuR4tDrKWo}oqWUSJHWEXp5YWg~KxTN$r zad>FxIOE+ZZChsf`PNn_hQKn4#H2`~W4(i%EJy?3&FzvS* z2yoFaSp*3h4Sqw+0y=t<00v%osiW7$a5_2zv8=;h7`52f>!DK49K85ZJ$QwyJKAn169p zBaKf7n#828j*ys-w|7Xs^^~s4)Ppy}#TjT!J{P>6u5XjG4Urw7+QQ^8rjwl;61x5-zQaMbaM$m}hOq?ot}BkgQq%Zm0i$R_r40SnMP zLFCCU8#N4S{V7&&6EQiG<-z0PVuem};Rio-lzpGGmxk?4Wx63kOLvV|8vj!(l)?wL zo)(U!U_b1jTpxf$L~JmVB_(`+QD4#<)DjMQPVHE#KzPI4Ij8it$^=+DNAc_H)<&mL zhtXU9pezHy%@};4ibNV6%j>xgNUT=Ysc0~0KPrx%1!+09wdCg|#ox@KM$t`Y)>uvA9ricD2e z#QI;;KWIc>Vl(fN;L}D5seLoRRxvKsho4LxpU9GhLmK*6@>04LqMb3jTl8~X>VXs5 z^SaTX`nvze%8*k3oEVR(!_&}n%wr-+p&kXgdhdktGlX)T@~>_GH_UVnwF11I<_a2n zD;K=g>}>L4pEIbcKSrrlfw&BFq{yX_jm_uW`;&OG74hMCz_i`Yw^mEZd_otSom6ET zd*S=8DmW3|Q^N`jZ7hCN!W)ML!vVb(wf@66eFTZY*&8_o$*A)tnTO9$a(!JSQ|sdB zH%l%~@0jCe%2S@>ZuJG7)h+97&T-uK)_=rF?7G?QeEBZr{jwc55s*X8+NX0B>X2hd zD$-W;=qoi{5nI^DsLy#lS6(T+M6~s`6ZOe8V><9*YB~pc-OYkqJ?f*!t*N_d*k<8o zOV&D~^o>j{e7ei^`_axdiwF`kqbXhcnOgs$OgtAl8=;!S8o19f7_3$b59W$eGq@CV%99D)M*l z3otu^|C=4#Fe%XZg{rpdvF5D{B;1&@M^eb9Lv=nS$x<(|u55FI0_7%SF*|f(a$dj} z?ev810{wI9a~=yx(}tLzcyBG_rR~2XqJYt%RHUUh-puv7embBub#h6`q&BD>4YYJO z(yR(487y_rKRf;4Z2XX&L|^ZG-6ZTkOoCNF5UE{0zHuVh zuC4vtlSkL^n)!k5`QqK1sw7QM!HK6&qNz*J^?j}(Mh4c#A-7aOv&uQr0Z7*3i(8Wk z{I1!;t3!IG^#Pb1UG4Qb(vatOY2$HzGKD*UogB$N$Xc++j6a_ROA)5%$4N> z(;a$M&05X6tM$~yGBZ)ng=TF=Kb{&Nh^ zhM%;jah>U|>n$+p>U3Q5Joag5w_dXs+8dVu}Pif7?{4j?}|VI6<3rh;~5| zz`i8WE|xkOfU0!h=Xd^^2vv3eT<71lmQ7%* z&MaV*_HBBF{nmoS04GDWwVj4oOZ?~=fSyEploaQ^TSKFQ?7jT>z8Lc3SmkZb&o`tr z2H~^Xw)K{#%y~(1VMwN!&w|e_q9)+!vFqNoI=|J)H)uF3DKQvOAufm11l7A%Vm10sc)yrtk-s{ml9V@K>a)>}IfpV9N zuh*cT=`f_XdTyZ1cL|aq#`MUyBj3g;@8QW0QiGoeUBcd4Qs!u%cZ7Em`+EFgx4KhW zBC1(YbM4=rIB;I{1^v_ma$n{FpqIOlBbjC*G>W~rU;r} zV8cBw&ed&YT7t(V?f_7}y^F%Fy>I4jtF5r`+zVZvb9m zh3wP41%}uF+YZUM4Ff81k#K16=<1ycq%@4cy(@r~Z^!Z{b*VzU+NieuR};9gK3MzI zjg}h)94a>@9n1X0`J@W|f+-FucAOjWF{)2K^Ytu}s_tl?1~sAK2$LfnOL&RwR|IA+ zQeYO@t&q7a$0xA*!4s%K(=I<-0YS%wiTi_GrsKW;VRfKZxp>2WCowfkw0|+Dgb`lf zZa7f)D<#RgElx?8fApP#7k^4FxrZs;C`WvRj}cvYnjBO_StMKd6E!-oeU6LD+rwSd zRt=**4sabSi67O)8KVnzF881mg>-dhTYATDuMuLOn&EV z&do2RseM6;V48MKVAIWjdJ&-c<9e|~xEYd#3j3-No&b-mIm!&dMh*k0AZzL{L~qw* z<7WmyfiF7s0k-@WB~PtNU{Pu zr8*oQiwB0_;q4nGbE)o}xw^jJw(e&fCx~4$n0u_66*s@#C+5z4T4tj4P0XcUSD%7p zT`+U{Y@NJxl{&wp^$pXRK_NVgsR4NvzH3me4(5vP?S%SN=Bo2}DH=LVZ9#O*BC?XwI3S990Xw8I0FWRhK%wP?@=3@oFgnf4tW7JpX*tm zZ=&i`N`T#i#DYmz{4?nfFV(}{+)@Jv!QVx0@ z>f`{xV-B*p>2sw^%=bGz4puD-p_B}xr7qLa0KCJYZXE9ElGdKq(84awZQ#5stH;4| zWnD8I987_sc=CuQIZVc z72dpnyTPDqv+LY*c#kzRK*#C?z?G61NPo0eFS7JinN2|1B4b`@#!%Sh>~FM3br%cn z&0gW&tX)UnuOmJGDBr#|4)&88_>iOcpYw%YhC_3Q)|fH~LWTY0rgSef9(hMru&tK8rK*C0ByM(*iA=omh)N3D44Sc+_H{H8QDMzv-Ao|X$dr2`;_@z&Y`($% zjH*WEh{>&Z5bJ|d%$6P@m*8OL~Bd1l9E7WxN z6YC!B{c<;>2OvP2YEA4Y;xfyDNr6HcY1gAk=1BMHF&mr{+GTYA3a@?@XrtcPEACh1 z;d0X@+zSH=97M2#cZ^aBgg*&({)g2D6X~cdRu@5}R~5U5=zW^C+*RNWvGj<_4>Gj^ z*!j606R6x=_)G+5mU!?3kWs{3esYY3hk3&b5-NTnR5gbvn|qb)>f!B;?!#fqT%3bS z%CRwGd4aY`z_M>JX&e9#$cov-*Cv&JI44bDV#T}DKR?v5uEH_Xbity>eX{TOqMI|oS(@k=M*kE#@wQ3_pqk&7Gc6h;v4{GBG zosSOl^tr3t*(tijvegRJzYQ`&RCk#+#%`u`H@UqE^B!JFdNQTg@HVJ6h?9nLBT5yr zuu{RcB$B~Nkcyn@V$l&)8&1g$NWYUBS794FlXYpCuyaSPzOEy5>SWYxXpm+)?r_v> zgNf;Vl|v*THryfu2d3k&%#^rYg{fwH&4T+&KR4tnXs@b< zJleGx*;%W#)Ohm`a4}SeLaB{LBIFQuX`vWZt*qyUZumpcU0&z&9sP9P#3kV`)kgyFdWmEPf6fOHrR4Dmz| z`scM<4x83zvaAJpk(ySflFf5;C%|m1jkEzaMb(67J*aSvCI6Z52_MeMYC`95xXw$j z3-cPOr^EmLxw1?}Gpb23CDz(zsy@e9%#}C!=i!O0jnzdm-*IfO9&&4_sz`;E^^un5 zMJGocv5sbxD$^-n)%#c=D#~HDq8?LRUfhSgY!uU3=~tt*|=t za2>Y1TWSe`Ligz{%b6Y>05ZrQCZbex*!k|wPGs(a#V1~X`1_dOINTRaiO+fHr|Vek z^jYWZ99GTVqo)(|xnMx4X=|XOalrdG^iu|W9#qnu)y;93FQZ#Ac`KPSh+APSl2h^<}U2 zup+eB!t85NQmJc4rpA2=AWubZ(YTa+)5+njOuQD)n)xE*4Uw>27{$LhqGT+5sR@8x zay7yw*?nAaXaI0wPKEBef(B>WDjW&`5XffsO~oOnQXEvI6uRsN`0+1nvIt1lh;!$J$j`|h;K$&RlJjTt_08V3hIdl@Ot3V>|nSSjycypmE+JGdS z(o*(y5v(IR0gLuD5zlvXqc9&O5UlB9_3sFwaY_cpv4w|^cKR7F2=6TztOl2|AS)k_ zx&`XNd4|YljivIE(hg6zz~c*=0QG*5GLrp4nR3(DEizuB-Y>!RbnKa<9Mn>FNu-;j zyQCbFq%Fs}IjQ5LRZIXe79@w8^eX}SMb>(s1~bPCcAQlB&;TIvfl>1!1R;q~lCpj4 z8`7pts0WwpJ7lZ)qs1>CY0&I2e&;pTQovmh=|Ju8$vj#?O95M4X8a7Ap9GBeDund~ z8gdms-62v0a1M_Q0dvNTwx{>n$TchD|$8qUsMv+75=!z8-FyApMMAA0EPl!#w5QGa)sU^r|~U-bg> zSP%_tckvq|;T{*?DT9k+wtec=PPCo6&zVE(Vy{U)I=71v4>+fh(3W`E5GMU%jm?Yy zYuZ;*bj35(5V|{s`D|T4rC$M8WnPF~NeZ)c?*zeUU?RtBUB9a3Y2%}Q2lU8z7X-+S z2rK4rylYRXKqByr>CTd3_eDy+6lGq_vM6GjV^ArKX`cb}BT>lBN>Fo$3CI~71UGPU z7Dy!B7@+C$w5$LCmHC2`ZO-QEC>G##BW=tV6dgP40+WLBfpyV1U^zkx794%hU!O8) z$d92h;zMI%mO+G5?jyAMRzAyW(e~ip3pTCa25(VNQm6r%r6Acz z$2zQ^lFEMctIo-L8`Z!Er8%6d80Y4SMA(q8+2z|iyad51zEHlb15GAk=c+_o5t?L> zwiXU)qA~=X#?v4Ab)nN6ijvdueOw5!L$BT>op#l;tmSephz`66)OPB45vVS#sN=v1 z%7Zal=|qL}o}y(1NNhEL6qvTA0#4l&q*{u-Wlcps7y-tK>Apz4{XdURPv(fF#o{p( zzqXrwX*Kx?KfIE_MXhd2)Nm58*Z9eK_4{fIbpzC>I`_SFEYq?)+dUPzNO*t3$i!N! z9iSpWRRHB|WOSVuv3QSh{AFNkn)`Dik*WFuxhKa|{k^77_nV_inyft zpD*+h>8m&^GCb`5nh+REjW+X*hUYj>I72jIc%e7`f_px28-BpK+=+#>}qK}!^4w*mRm?T?`>N!iV`gF zUmo`GzfQN!;vJ%V<$clO>O?ho&#Rc!!zH<;$lBkHP9|kcBny&0HspKp(5&)`60V*q zY<<=!Y<&&mOpZc-wBOO7egXaL#NLgx#*+wRQoJWwmA*wul0;#sZ{-^>$;#wcTUA)f zzG}uTRuC@)%kKYOhcHd8A*@Cq+R#OP-OQ5z%DHCqMjILfw?$e7=Xte1aWM)oARZ@? zD7;4!vu`72Es{fC+5BaIsW?0V9-1fDb%O6>`k>U*~PbURj3i+YI`*1f6*Ll!iL_pf?Nn_;(E;!P+g?wxLVt;P!+>g?l9F=_RG;(k?C5 zfoQd#sJp>0=KU493nVHHjG~d$9yBJj^g5(qH_*4^MjRT(ukkJ3t)D{`1cVhw)FSRL zR@QRcT+|UbW4%x68M!L2vEv9r39lBQ&X!p?4x<{g2_1;8IZurY2SqrY(Cd;DTOR;#6?|V z$s4*IF;?%eIdD@Emr#8TX76&tKHp;o@QLG&sm!QpPiSxb=Ydp))527bMM;ZH*xSHm zp2JZ%YTCL@7$I6JA`qGP!8K56w3gLUYl3FRN5y_-C>bpD$E?S$0_yB^2_INF6>uq{f~dCa$0VaLAPUV%uYnq0Eat=`?x= z(G0QR|4K8z8jAM!m}|)5g8-nSx_X zy;c#AhATgh%!%{2M3k#RvIxNJ!Mec$6O$F_`}{_{(_1H^J749AS|F~|RX&`{OJHK+ zQU7dB$=f@Mz1Y1y&MPAFUAcPLy4jI1o$hpYimh}(+Ru<`KF!}cF5R&iPFPO8_JrZI zD2#02e!l;^5A%+aH8DRu---8{c_JbV1}}QZWl*0|=lPd2ZFJ%nZossgh`6f`n^Q1x zLF%UJt!`n@+#F_I7WJ@FCNmSSMBt4I!t29yu_siWJis{z!_C7Dml^9NP>qUlT6a$O zxw;#3Fs2`t+W$RzuMXCg)8u=?)+*DviGLLaL~M3y+c{Ufu6;}yZkvxX{5o+%9p{x&kIjz4q7nCR$wl%-j7VB(_YYDMbpK2kl<3g3-4 z)^J${Q@Th0Xr_nLS|9;VOLMR!_kLi#ac^o^SRCF6S0Txo8G$$X9+7_QbNR`7nLY5k z?s(|krT`xud-!=Dm&O5Z*UPKowx41g66h|61aGHJe$lU4ZeHw4$tm`gHT};V+KBRX z1Cde<}ojIb(HK9T@{ zkSVLG?$DUE5)GWRH~&!$Y#lEL=9A)`Hu$Gb9`y<&AmmaX4OQir@G8;IvU7(wd*F>; z@uGP}gzFo6dhk1e$|hS45@?Vbe41tN=f=K_%1(_}1aem6;cuHZ67*;kG4@wEE!(k# zy%p7il9!I|(|;!-^+yVN&Id_G_L!m;N=+P1n=|FQwwdZC3$d4uVbLjNL1cp^d~u4W z-%B*4{qCF40Wr;*(P-)RiI2b+`=sXG5jUZMpx0T8rUiqELS+VdJFn*ZY81Kk7iKKz zudCBtY)PVdmnu_jM$+y*ni*j4^*Q}Z^8jSYxOL$S0)2is2^Bv^HU82+^Tf{w_TbS% z&!ZoeEY?NcaS45E3O>(*lOG&S(_LIi(?aVe&cAT|B8w1M+Ng3D5vg9R{6fV}!}-*B zWrj4iCEe*L781>;jily1%q&ICcUQ9d3C(U~)s1JlnTBDB5ROsBn_?}2OI?e`dK(JQ zO(lAr33)aa3^9*t#~8>~#}+Ryp5FQ_6|NO-XtaTO4rC1@cscgh&1>??#X&?_inVoY zu}!KAM0dr$rTHCafi8!<7g&_D5-Zg}e)Z#h-i_~3zR!YlB2Z&bfGR~Mfh=LM$e%2) zyN7J&7^geiG!EOHn_qpjm=bGHBcHW>-yAfmd6??{i}c#=pR$>33T8z@oWMCcIUhz3 zmv9_|Dtc7POn!QU$iogmnY<XRP*B4HF696ZQQ)fxV- zY#67F+-2&h`g>>F-!|lqZi-!HW&0dnh_)gw6G^H1kLu+awBPjlj`ZDox}3U+=h*Nr zQ^}KT-a8K&kqj)HOX0WphepkrLAF0mYB9}lyxt@qUD4!7gzN+N4HsVJhSxMP`}s1K zZ!<*s*PHqLgr+v0&-?8E1ys}P*m+9&k3wtzp$O65FYHf3O!B- zXa7-Zf>9`oDGvEdEDMbW*Zit1gZ~DHOHozx7aE4sd3V;NT(!FT*JR#PzBV$wi99Mn zWhs*iNfh7J#fm$#DVU;p?M=+q3Owj_Si*L-Ts!>q5sG&bQ?jeL=GcKv{d$g!{%az_TyW6|KcUW7ac&6K_C$#qHx)f!&_Q+r?y`rUi zi$bI5Va~(4pq`&2J1RBNV8Ywa-Z_^M}%^Zk=8b&_dq}%UN_#u|aG5+*yCK zgnvged?Zsb6&W#A)P%*{BYAL8)v0WKXPA?sRn)ny8_CSKyWXBr!ZlZ1@bjcYHbgr_ zTiQEPic3kdDk6SRGCRG@aGvlE*m?`)xj4ly7|2;pyGiqw-VEm3E@k7Kp_+WuAsbG@ z&sb%lLNZGIuSD%K<5V}iF?H~}@&bG2x50rAxAY?o^ax_!0k^N4%# zkY4`}G)bjaqJlPlXFQv-{=rJld?)we(Ve%%eGt~ARut>!-$OJExE&JhQxjRPiT*T# zzC*2o*KWy-OS0P?d(r-cxg!o}z_Snc>vVmW^(hhNP&H1{+o8cg5`jd5YzdViG`^3# z=#8!5avJy`>i_-VZf~N`2?x~=H)p+v^df(d9e7V+gaed;M0rDcdZ^*EVokT41|j!7 z)JwK1TbYz6(LO%OftwTe4vds{GtnOfm#j+qH}S`5f{}Oh42{Td|K|CV{MX*HMy2}idX>+;Yx>4O8rOJ4OwW@Bj9 z+z1A(CPd>3bbPG>?a_oZpP8Zs)7?{L96o#~y114^8;l&6Kr+x6Lq(_i5Wu9-E3&0s z&a=eqZO+6g_$|IkqVPFTc|#T&8RaQ0-Sb==itc>N*UmsFnU}1`>g=fUn*DTpnvjQE z%t?M`<`q06Ai-mR-ptAPM!=Yu$Rs_I+-LTw?Q6S;hqLHPHZtC| zKH0H>)P4>HUDz2?Y%Pkp*;3vlh=Zx4QbAg@JrONg7Aiz~JK_%j4dUfL&exJgr;V27 zQ_tpnrZgBm8X1=SEqXbB+i3se3g@!MN~BF+K_%~w`DAp-%0E}lz(Cgf1jP^Tlc`rDA}F7XHstlxvgP3Y zc7B50(UB+7+_HXxJrMPHb4T;QmT&!p>~i)YGu|Du=qS$~W0Wyl7`;$lN<(BRQ8d3% z!Z6V>iUsj<$jaX%oC5E+mGpX*d#mW6Zw9>{Od&u|L7zgIIYK+k_XYcMmZe#So`P(J zT_x}WI=_?(FExg}aiJoFT4Zi`tV??Tb5^#YnN(3_mo;p=pjVJKTYM48uTk~MvJF#c zbNZc1Pg=ak^TZ31@QudfZQ`5#kDfZ9Q{{$pIzWr7W%#0K58J<(ZeR%C_e-!_%wnAVZ7s{rlFMfz= z?yPHueh=TP+rj$I+g#fugnBtRVisz@JRA6?JKuxDS^6sn&o3b-b-XXt9ujZQt;EAkDj`NGARrut%-v=Pr4>4RWTY#3zHwOiaM7GO(@w@=T5%GPU71?&S29 z#6y<9I9&de57<{LWW{H&sZoZo`e#o`T6do|!>52jI( z5cP7ihbv~MGQy#!ptk`QqOR_j0QU%_D@M(>zbY!t^iYkuptRrkcUv78(qz3Nn#7q! z2Mn0QNmLY(2G2>Z`M%*wvR*jEj3BmKnK_zwjK;$+%0W?y=Po5HPNJ#L^`gcSW=0UE z5}Lg0$}O+EPfeJyJzQwsM!3Xf^MLBXhBAObK`Ls3w$kv%?nd!p0RJ+Bjc}PiS;_2Otm|!D~zI=^^+2yUS_$*8}H$5d3iUIOI$j*v*>L0vShhdCg8QOqgxWGIAnx zVNErq{TZH2uX}m8zfm-qbRz{N8Z0wwJT!ge#B)>JeG~DRBnA=hM0)K4C=~AG#-60(B~gCY zteNyE%Uq|@OCm3{Nr2Z1%`R=g;X_tDRzTUyG64O$uIdFm_**6y)`8U6?f zi!7L4Y#Re`=|Z>wu0OI4(Yd4UEoU)6AqYTQYmlJ0kIJJP$(|^^cWp7_5@LC3ny@wn zYBdhUjq@IIgQ4RYm!|r>p1K0x?x*%cRuQ&mf(gf`!@96{M(Z~`Sgpl{mzdFMNY-pA zkcox*TDU4e^rgaJebx2MtAZRi8=O$!IMJ}7K|xw&(F>^8%W6cA$&mFBP)}Ixum#;G~BK0*$?dO*^GSatH#L)4dCipgi zStvtUD-YOHgp;hR1ImEgb}MpA-N%ROy)<}%@^F%Zgo`r*093VS7tw zujdMM_wgO0Y%~asqWiLiJZy}Aux=0!*#(Sq0qSL#ND*+ET7SS%y+e;v&np!xgLtql z7%Fc~$w?KYI;PtlXV|YH>5A2=zpKx@v{j9drHtA8^bZIHUs1LS^xx5Ucj_lDMct&W zZbQx664-xKRkkm?u97TDHm1vU$&Cnm0CT-1z%*p-@AV-j>ZmR0Fpjmv_3(m&ja7 z4U$byX4$MP$R1X01{oaPyqLH4e}{@6^m@S@Lg-Y8Zt0KGYnATqR`rGPTV$*?jW@fp zN)Z6GKgc$+w>GwT$`xg31km1TzC!AV9Y(FD4?#P#WM$OuVkSKpW8*t0pm@&X_+`Q{t@d!ddf4`$Su zvBxw?xhV71GI91K-=ErzuwSHz%RRQt+0jQo$kuP>hp=p7O@Rjdn2GSfB7O`?qgAAz zy%sncU4}ZFK>}2#RSoS?de_cz)1}ymUf>HRUk9xMXApS9<%YezJwA(fGb(E>CePdN z+jr54K3!ZZWQsz0y8zw{*j&CtjPi9}_fNg0mJh96d?KP?Q@HWVzkEW@QaKSaa%sEpUi-Z();9s<(|e4_!WGH3~_ZQ5SYURUxk73@`tsWLgC zshdn01yDFb(S>RmwYF$-zA;w9G50A|a5|eBV9AdxYxShec&!qhs-d^rv;P2T_u)uz zbt%fBM=gQ_Ce9pHh;?!}d_?B&8}41c(#+>w{IIgIkBY7S(}0#jtAMfr@LA5!sc%Hu z6$0t?tUP1W9XFu%LoWi@e|$@?Xmw$q9znOZoBZC2taEwp|KZUOj0RRl3Bc2gfGOu?20#K?7r-XxoU>~tIm1rR9t_~|n2CM_UUw%)#G zl_xH{-L^dVUhS|Fk}1So5FVD>$wws%#6$b9{TwIyi zydm25hlg6M{>blI;N)_L)O!Z>Q!-T64%(jQ{HOJ4domleAby&s#zY2%iJ!kHCW+>r zRWRsK2)r!n(L+mqPG;qlVle&MS&RQ*4{U~>bT8yb%v?4yIMNZ@e{@A-E+DU&?cA&^ zy#A;b@j5nQN;|p+13jTJNx!s;?)5s!q(B+k6m?JGKiJ6yx!O_QuGWt6cl3Bb^4lxF z_&-Y@^LO?LZ&>$bUgYE&Bu%G5-wO_0ETWc&^*o$hwId6=P_wcY9cmFVkw>5Rn!jsg zejUVui*N5+^k9>diHt@_D<2UXvWt;oulx>~2EEO)2lXleZ4B|`BsYz&S zS1QATQJqq6GN5}@wVNnba|N=*(xQm;slr}{0~Kp7(&gWCr*^Eb#<_63?{k-0o!#b; z?WJ8bS|Y{is9V{*E`grL#p1CX?a>H@Bzl<`c!D2lBnz^Vi9D_(Z>0NA+34s@rAE7V zE{^EA@A?0-)8LqAZ@5WnGKtw;+j5xKXGsJC&kHoeM_up>{Hjv7evUPF53kJ1U(Y1|J-wn`@@RMAE&~7kzf%blg0jg z&D*8eT_;gxNIw2R4V~Q=mw+X5Gp7RKtfw`0y~)0-j}PWL(nS%7VC(}xHo+Sk{6ii% ztzU5i4oA1=7d|`dMm;R)GbJ#e2%W@9g?q8JStFHs{T4BYi!{=biXehL<#lo2BF*Xv zHs-gFe@v~Q#NJvv1E8&ovGxBZQ(tlBA^Ft~LrC}-pVXr1PiQhK1GkNC0pv613v6na zX>Gx!q#ly5v#4dl)u>i8exeZ$8cvtX~O(%So3B`< zzCNDh+%GvPrnU9dK9YfJO*J|ZNOmKPjGNw+E1*vB2>qs^a#7m>t__HhSn!$}2z zXN*(*TMS-f0}Y5Ii%Fl0htEGR8pj=r<_LL&5Y7nzu#(}qBqnFzMD?6gbAOzYS;^|= zC)@qJE|TQY!!O~F>rMWPp;@A|RkF3=Mc5^Lzk+;t`lq@%=AyODJ546Bcv-c zDDX1JMpHAIJ;{-jRAqc?%MRjSh}UNsq7s6tY1H1JEjIGlxqpJq*P9k{qGu<9?Y%qZj9Wfe%wci8hl zM2U0tmx!bpe*3NlGobXXA^=xEv&f|Y$ivRr4AU7UscFhj+7S@raT4Wc$Y!pM4+zQ$zbsM|#^ybjwEc$% z>q&QheIE!%Zy-zT+i!iTgS+v0c-ODN!9b>|1mAgtM)6DJu71$!1RwCRtP*s%<-I23 z4*|gZ92!5+<>e}!lQfo0I*%61W@hVg1=W@QXFmzdpZ1L@gvT&2@Y!Yu*-6 zs;*C|%>3I~3=`JkRayO|I3(<9q>}ZQ4&WDDDbLqfAWJQA>ndIXOVypC`4=NX<c*^Ik66G{RskBoG?` zJ_gU2?~%|-r%+qs!$KEI1k>xT`+4L{zj-_GS|m#%K26B#L{e)oe1yqE5Lv&j@8_im zt$D03m|}i1OV-C%vK8o`ujo6E(ynv~1S0`EA~9Z4>Y)`D>QzZ}lXrRIcpt-S2q32UA<_J^#dik@dH83F9}ORm z@HX2KP@QT;?&^p1Qx2oliT>yPb$&Vidz9vJRWZw&yOiXcwD&UuI=`tk7MaCi5(%(q ze)n0ib>7UG&f*Ygqr8>Da>i!NGy=n;MBzL8v6gy}P_kxJgDGO1=H#OWATdY8AMAde z$~X+YGMxeN8MuP|Nem-f8y(VT;fSuH?7%YSd}hks9+{ZRqP~3m9ooy`yYFW-X(8Gx zkMx1Ng1EGl>3%U^^*0q!9J8F&XdDuI|EcyXdk1#S?-<@epB)=O)CjG8v%b7|sBBe^ z&=qv9yrG1y@hGQ``Yaib>}+&DM;Yc*$6}mZs!H1**n;JR7NtHmO!yQ3Vyd!L)gIYj zDUM$-hu06btZ}vg1?XM6!r3D4b-?-@0ALVFK?jOPej}Mzwz^>*6ZMMYvR-nC7dJo=T!!;)Wl z!)4KY9ZfbjHFa^!fabbhalhchzk8TY)L6S;T@_0n zebaOviRLy&x#hIKF8^XJsCKXic(p>Xr@#Y!HQ+Yza$uI>QdUMPtW)I!;hPkPqcfBG z28S3xEP{hR)a3tjHU5?dv6ccoK**QV@Cq2OQ0XD$y~@em9lE8MdYBuHjI6A+9##_- zNan`xrzCX_;a&PnV$<`Rz~?tm{R<5gR%c*roi}xzt9XycAtRSiG>KO2l)&9QC859FOz%q G;r{_Yj?+T` literal 0 HcmV?d00001 From 607dc5ee9e079504c34d0ec5248201e975cfb84e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 22 Feb 2023 21:40:10 +0800 Subject: [PATCH 1210/2039] Create 2565-subsequence-with-the-minimum-score.js --- 2565-subsequence-with-the-minimum-score.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2565-subsequence-with-the-minimum-score.js diff --git a/2565-subsequence-with-the-minimum-score.js b/2565-subsequence-with-the-minimum-score.js new file mode 100644 index 00000000..e3dc5adc --- /dev/null +++ b/2565-subsequence-with-the-minimum-score.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @param {string} t + * @return {number} + */ +var minimumScore = function(s, t) { + let sl = s.length, tl = t.length, k = tl - 1; + const dp = new Array(tl).fill(-1); + for (let i = sl - 1; i >= 0 && k >= 0; --i) { + if (s.charAt(i) === t.charAt(k)) dp[k--] = i; + } + let res = k + 1; + for (let i = 0, j = 0; i < sl && j < tl && res > 0; ++i) { + if (s.charAt(i) === t.charAt(j)) { + while(k < tl && dp[k] <= i) k++ + j++ + res = Math.min(res, k - j); + } + } + + return res; +}; From dc0d763995c2826a11e98903ac8f50632e529866 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 Feb 2023 21:11:17 +0800 Subject: [PATCH 1211/2039] Create 2555-maximize-win-from-two-segments.js --- 2555-maximize-win-from-two-segments.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2555-maximize-win-from-two-segments.js diff --git a/2555-maximize-win-from-two-segments.js b/2555-maximize-win-from-two-segments.js new file mode 100644 index 00000000..a2d06c88 --- /dev/null +++ b/2555-maximize-win-from-two-segments.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} prizePositions + * @param {number} k + * @return {number} + */ +const maximizeWin = function(prizePositions, k) { + let res = 0, j = 0 + const n = prizePositions.length, dp = new Array(n + 1).fill(0); + for (let i = 0; i < n; ++i) { + while (prizePositions[j] < prizePositions[i] - k) ++j; + dp[i + 1] = Math.max(dp[i], i - j + 1); + res = Math.max(res, i - j + 1 + dp[j]); + } + return res; +}; From f92774b95a11f0af4db181b0e1cd5bebf03888e2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Feb 2023 20:25:10 +0800 Subject: [PATCH 1212/2039] Update 1638-count-substrings-that-differ-by-one-character.js --- ...substrings-that-differ-by-one-character.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1638-count-substrings-that-differ-by-one-character.js b/1638-count-substrings-that-differ-by-one-character.js index c95a6d31..e1a9a64f 100644 --- a/1638-count-substrings-that-differ-by-one-character.js +++ b/1638-count-substrings-that-differ-by-one-character.js @@ -25,3 +25,30 @@ const countSubstrings = function (s, t) { } return result } + +// another + +/** + * @param {string} s + * @param {string} t + * @return {number} + */ +const countSubstrings = function(s, t) { + let res = 0 ; + for (let i = 0; i < s.length; ++i) res += helper(s, t, i, 0); + for (let j = 1; j < t.length; ++j) res += helper(s, t, 0, j); + return res; +}; + +function helper(s, t, i, j) { + let res = 0, pre = 0, cur = 0; + for (let n = s.length, m = t.length; i < n && j < m; ++i, ++j) { + cur++; + if (s.charAt(i) !== t.charAt(j)) { + pre = cur; + cur = 0; + } + res += pre; + } + return res; +} From e19f6551270ff8ea4a1ae110b673b489849e2531 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Feb 2023 21:12:02 +0800 Subject: [PATCH 1213/2039] Create 2574-left-and-right-sum-differences.js --- 2574-left-and-right-sum-differences.js | 27 ++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2574-left-and-right-sum-differences.js diff --git a/2574-left-and-right-sum-differences.js b/2574-left-and-right-sum-differences.js new file mode 100644 index 00000000..f3fa4833 --- /dev/null +++ b/2574-left-and-right-sum-differences.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const leftRigthDifference = function(nums) { + const {abs} = Math + const n = nums.length + + const pre = new Array(n + 2).fill(0) + const post = new Array(n + 2).fill(0) + const res = [] + for(let i = 1, cur = 0; i <= n; i++) { + pre[i] = cur + cur += nums[i - 1] + } + + for(let i = n, cur = 0; i >= 1; i--) { + post[i] = cur + cur += nums[i - 1] + } + + for(let i = 1; i <= n; i++) { + res[i - 1] = abs(pre[i] - post[i]) + } + + return res +}; From 1ba52525967cda1693e48d6e804cf694911747c4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Feb 2023 21:13:36 +0800 Subject: [PATCH 1214/2039] Create 2572-find-the-divisibility-array-of-a-string.js --- 2572-find-the-divisibility-array-of-a-string.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2572-find-the-divisibility-array-of-a-string.js diff --git a/2572-find-the-divisibility-array-of-a-string.js b/2572-find-the-divisibility-array-of-a-string.js new file mode 100644 index 00000000..b9934b8a --- /dev/null +++ b/2572-find-the-divisibility-array-of-a-string.js @@ -0,0 +1,14 @@ +/** + * @param {string} word + * @param {number} m + * @return {number[]} + */ +const divisibilityArray = function(word, m) { + let ans = []; + let cur = 0; + for (let i = 0; i < word.length; i++) { + cur = (cur * 10 + Number(word[i])) % m; + ans.push(cur === 0 ? 1 : 0); + } + return ans; +}; From cc7fda34e106f2c7168572d0aae5b22fb562b73f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Feb 2023 21:16:16 +0800 Subject: [PATCH 1215/2039] Create 2576-find-the-maximum-number-of-marked-indices.js --- 2576-find-the-maximum-number-of-marked-indices.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 2576-find-the-maximum-number-of-marked-indices.js diff --git a/2576-find-the-maximum-number-of-marked-indices.js b/2576-find-the-maximum-number-of-marked-indices.js new file mode 100644 index 00000000..f8520d12 --- /dev/null +++ b/2576-find-the-maximum-number-of-marked-indices.js @@ -0,0 +1,12 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxNumOfMarkedIndices = function(nums) { + let i = 0, n = nums.length; + nums.sort((a, b) => a - b) + for (let j = n - (~~(n / 2)); j < n; ++j) { + i += 2 * nums[i] <= nums[j] ? 1 : 0; + } + return i * 2; +}; From ef4c9cf4e0c043aa2e9c4b2e6eff4d8efe154f49 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Feb 2023 21:38:36 +0800 Subject: [PATCH 1216/2039] Create 2577-minimum-time-to-visit-a-cell-in-a-grid.js --- ...-minimum-time-to-visit-a-cell-in-a-grid.js | 110 ++++++++++++++++++ 1 file changed, 110 insertions(+) create mode 100644 2577-minimum-time-to-visit-a-cell-in-a-grid.js diff --git a/2577-minimum-time-to-visit-a-cell-in-a-grid.js b/2577-minimum-time-to-visit-a-cell-in-a-grid.js new file mode 100644 index 00000000..05a9d259 --- /dev/null +++ b/2577-minimum-time-to-visit-a-cell-in-a-grid.js @@ -0,0 +1,110 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const minimumTime = function (grid) { + const directions = [ + [-1, 0], + [0, 1], + [1, 0], + [0, -1], + ] + let m = grid.length, + n = grid[0].length + if (grid[0][1] > 1 && grid[1][0] > 1) return -1 + let dist = Array(m) + .fill(0) + .map(() => Array(n).fill(Infinity)) + let heap = new Heap((a, b) => a[2] - b[2]) + heap.add([0, 0, 0]) + dist[0][0] = 0 + + while (!heap.isEmpty()) { + let [row, col, time] = heap.remove() + if (dist[row][col] < time) continue + if (row === m - 1 && col === n - 1) return time + for (let [x, y] of directions) { + let newRow = row + x, + newCol = col + y + if (newRow < 0 || newRow >= m || newCol < 0 || newCol >= n) continue + let diff = grid[newRow][newCol] - time + let moves = diff % 2 === 1 ? diff : diff + 1 + let weight = grid[newRow][newCol] <= time + 1 ? 1 : moves + if (dist[newRow][newCol] > time + weight) { + dist[newRow][newCol] = Math.min(dist[newRow][newCol], time + weight) + heap.add([newRow, newCol, time + weight]) + } + } + } +} + +class Heap { + constructor(comparator = (a, b) => a - b) { + this.values = [] + this.comparator = comparator + this.size = 0 + } + add(val) { + this.size++ + this.values.push(val) + let idx = this.size - 1, + parentIdx = Math.floor((idx - 1) / 2) + while ( + parentIdx >= 0 && + this.comparator(this.values[parentIdx], this.values[idx]) > 0 + ) { + ;[this.values[parentIdx], this.values[idx]] = [ + this.values[idx], + this.values[parentIdx], + ] + idx = parentIdx + parentIdx = Math.floor((idx - 1) / 2) + } + } + remove() { + if (this.size === 0) return -1 + this.size-- + if (this.size === 0) return this.values.pop() + let removedVal = this.values[0] + this.values[0] = this.values.pop() + let idx = 0 + while (idx < this.size && idx < Math.floor(this.size / 2)) { + let leftIdx = idx * 2 + 1, + rightIdx = idx * 2 + 2 + if (rightIdx === this.size) { + if (this.comparator(this.values[leftIdx], this.values[idx]) > 0) break + ;[this.values[leftIdx], this.values[idx]] = [ + this.values[idx], + this.values[leftIdx], + ] + idx = leftIdx + } else if ( + this.comparator(this.values[leftIdx], this.values[idx]) < 0 || + this.comparator(this.values[rightIdx], this.values[idx]) < 0 + ) { + if (this.comparator(this.values[leftIdx], this.values[rightIdx]) <= 0) { + ;[this.values[leftIdx], this.values[idx]] = [ + this.values[idx], + this.values[leftIdx], + ] + idx = leftIdx + } else { + ;[this.values[rightIdx], this.values[idx]] = [ + this.values[idx], + this.values[rightIdx], + ] + idx = rightIdx + } + } else { + break + } + } + return removedVal + } + top() { + return this.values[0] + } + isEmpty() { + return this.size === 0 + } +} From 3250b66aa359a7c31c991eec0777a8820a5ef46e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 27 Feb 2023 21:43:36 +0800 Subject: [PATCH 1217/2039] Update 334-increasing-triplet-subsequence.js --- 334-increasing-triplet-subsequence.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/334-increasing-triplet-subsequence.js b/334-increasing-triplet-subsequence.js index bd231408..d8b22cc0 100644 --- a/334-increasing-triplet-subsequence.js +++ b/334-increasing-triplet-subsequence.js @@ -35,3 +35,22 @@ const increasingTriplet = function(nums) { return false }; + +// another + +/** + * @param {number[]} nums + * @return {boolean} + */ +const increasingTriplet = function(nums) { + let small = Number.MAX_VALUE, big = Number.MAX_VALUE + + for(const e of nums) { + if(e <= small) small = e + else if(e <= big) big = e + else return true + } + + return false +}; + From 8bea775ead10ec6bb31895a679b45d6fe38b8523 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Mar 2023 22:10:21 +0800 Subject: [PATCH 1218/2039] Create 2454-next-greater-element-iv.js --- 2454-next-greater-element-iv.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2454-next-greater-element-iv.js diff --git a/2454-next-greater-element-iv.js b/2454-next-greater-element-iv.js new file mode 100644 index 00000000..b172eaa0 --- /dev/null +++ b/2454-next-greater-element-iv.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var secondGreaterElement = function(nums) { + let n = nums.length, res = new Array(n).fill(-1); + const s1 = [], s2 = [], tmp = []; + for (let i = 0; i < n; i++) { + while (s2.length && nums[s2.at(-1)] < nums[i]) res[s2.pop()] = nums[i]; + while (s1.length && nums[s1.at(-1)] < nums[i]) tmp.push(s1.pop()); + while (tmp.length) s2.push(tmp.pop()); + s1.push(i); + } + return res; +}; From d8b4f84bd223a8f350114107890e85e2a12af1f3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Mar 2023 22:31:20 +0800 Subject: [PATCH 1219/2039] Create 2366-minimum-replacements-to-sort-the-array.js --- 2366-minimum-replacements-to-sort-the-array.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2366-minimum-replacements-to-sort-the-array.js diff --git a/2366-minimum-replacements-to-sort-the-array.js b/2366-minimum-replacements-to-sort-the-array.js new file mode 100644 index 00000000..70d9854d --- /dev/null +++ b/2366-minimum-replacements-to-sort-the-array.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumReplacement = function(nums) { + const n = nums.length + let prev = nums[n - 1];; + let ans = 0; + for(let i = n - 2; i >= 0; i--){ + let noOfTime = ~~(nums[i] / prev); + if((nums[i]) % prev != 0){ + noOfTime++; + prev = ~~(nums[i] / noOfTime); + } + ans += noOfTime - 1; + } + return ans; +}; From 0a9e1589a2e30efe5ed47599befae0d60f53a2bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 4 Mar 2023 21:02:37 +0800 Subject: [PATCH 1220/2039] Create 2365-task-scheduler-ii.js --- 2365-task-scheduler-ii.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2365-task-scheduler-ii.js diff --git a/2365-task-scheduler-ii.js b/2365-task-scheduler-ii.js new file mode 100644 index 00000000..28b9371c --- /dev/null +++ b/2365-task-scheduler-ii.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} tasks + * @param {number} space + * @return {number} + */ +const taskSchedulerII = function(tasks, space) { + const last = new Map();; + let res = 0; + for (const a of tasks) + if (last.has(a)) { + res = Math.max(res, last.get(a) + space) + 1 + last.set(a, res); + } else { + res++ + last.set(a, res); + } + return res; +}; From c7f29b99154f5ff69f4ef94ca3deae7c76633caf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Mar 2023 15:12:30 +0800 Subject: [PATCH 1221/2039] Create 2585-number-of-ways-to-earn-points.js --- 2585-number-of-ways-to-earn-points.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2585-number-of-ways-to-earn-points.js diff --git a/2585-number-of-ways-to-earn-points.js b/2585-number-of-ways-to-earn-points.js new file mode 100644 index 00000000..a2abffef --- /dev/null +++ b/2585-number-of-ways-to-earn-points.js @@ -0,0 +1,23 @@ +/** + * @param {number} target + * @param {number[][]} types + * @return {number} + */ +const waysToReachTarget = function(target, types) { + const n = types.length + const dp = Array.from({ length: n + 1 }, () => Array(target + 1).fill(0)) + const mod = 1e9 + 7 + let res = 0 + dp[0][0] = 1 + for(let i = 1; i <= n; i++) { + const [cnt, mark] = types[i - 1] + for(let j = 0, tmp = 0; j <= cnt; j++) { + const tmp = mark * j + for(let k = tmp; k <= target; k++) { + dp[i][k] = (dp[i][k] + dp[i - 1][k - tmp]) % mod + } + } + } + + return dp[n][target] % mod +}; From c0ccaa6551fda31ad9153b6a7a5ccf7bd0837770 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Mar 2023 15:12:57 +0800 Subject: [PATCH 1222/2039] Create 2583-kth-largest-sum-in-a-binary-tree.js --- 2583-kth-largest-sum-in-a-binary-tree.js | 102 +++++++++++++++++++++++ 1 file changed, 102 insertions(+) create mode 100644 2583-kth-largest-sum-in-a-binary-tree.js diff --git a/2583-kth-largest-sum-in-a-binary-tree.js b/2583-kth-largest-sum-in-a-binary-tree.js new file mode 100644 index 00000000..214b31f6 --- /dev/null +++ b/2583-kth-largest-sum-in-a-binary-tree.js @@ -0,0 +1,102 @@ +/** + * 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} k + * @return {number} + */ +const kthLargestLevelSum = function(root, k) { + let row = [root] + const pq = new PQ((a, b) => a < b) + while(row.length) { + let sum = 0 + const nxt = [] + const len = row.length + for(let i = 0; i < len; i++) { + const cur = row[i] + sum += cur.val + if(cur.left) nxt.push(cur.left) + if(cur.right) nxt.push(cur.right) + } + + pq.push(sum) + if(pq.size() > k) pq.pop() + row = nxt + } + + return pq.size() < k ? -1 : pq.peek() +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 04247f78baddb335c21124bd498deec83bbba1b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Mar 2023 15:13:26 +0800 Subject: [PATCH 1223/2039] Create 2582-pass-the-pillow.js --- 2582-pass-the-pillow.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 2582-pass-the-pillow.js diff --git a/2582-pass-the-pillow.js b/2582-pass-the-pillow.js new file mode 100644 index 00000000..52ad735c --- /dev/null +++ b/2582-pass-the-pillow.js @@ -0,0 +1,11 @@ +/** + * @param {number} n + * @param {number} time + * @return {number} + */ +const passThePillow = function(n, time) { + const k = ~~(time / (n - 1)) + const r = time % (n - 1) + + return k % 2 === 1 ? n - r : r + 1 +}; From 44dde38acacc267c3e3729f92a194392d648eb8a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Mar 2023 15:17:55 +0800 Subject: [PATCH 1224/2039] Create 2584-split-the-array-to-make-coprime-products.js --- ...plit-the-array-to-make-coprime-products.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2584-split-the-array-to-make-coprime-products.js diff --git a/2584-split-the-array-to-make-coprime-products.js b/2584-split-the-array-to-make-coprime-products.js new file mode 100644 index 00000000..da1f0171 --- /dev/null +++ b/2584-split-the-array-to-make-coprime-products.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var findValidSplit = function(nums) { + let n = nums.length, right = {}; + for (let i = 0; i < n; i++) { + let primeFactorsCount = getPrimeFactors(nums[i]); + for (let prime in primeFactorsCount) { + let count = primeFactorsCount[prime]; + right[prime] = (right[prime] || 0) + count; + } + } + let left = {}, common = new Set(); + for (let i = 0; i <= n - 2; i++) { + let primesFactorsCount = getPrimeFactors(nums[i]); + for (let prime in primesFactorsCount) { + let count = primesFactorsCount[prime]; + left[prime] = (left[prime] || 0) + count; + right[prime] -= count; + if (right[prime] > 0) common.add(prime); + else if (right[prime] === 0) common.delete(prime); + } + if (common.size === 0) return i; + } + return -1; +}; + +function getPrimeFactors(n) { + let counts = {}; + for (let x = 2; (x * x) <= n; x++) { + while (n % x === 0) { + counts[x] = (counts[x] || 0) + 1; + n /= x; + } + } + if (n > 1) counts[n] = (counts[n] || 0) + 1; + return counts; +} From c0aad5e55591df96c4bd756751f25e1715332c0c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Mar 2023 20:30:54 +0800 Subject: [PATCH 1225/2039] Create 2412-minimum-money-required-before-transactions.js --- 2412-minimum-money-required-before-transactions.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2412-minimum-money-required-before-transactions.js diff --git a/2412-minimum-money-required-before-transactions.js b/2412-minimum-money-required-before-transactions.js new file mode 100644 index 00000000..42fcb831 --- /dev/null +++ b/2412-minimum-money-required-before-transactions.js @@ -0,0 +1,13 @@ +/** + * @param {number[][]} transactions + * @return {number} + */ +const minimumMoney = function(transactions) { + let res = 0; + let v = 0; + for (const a of transactions) { + v = Math.max(v, Math.min(a[0], a[1])); + res += Math.max(a[0] - a[1], 0); + } + return res + v; +}; From f4ec60bd1a0bbf44b8f9e00890328ac4f1a39dfe Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Mar 2023 21:14:51 +0800 Subject: [PATCH 1226/2039] Update 2444-count-subarrays-with-fixed-bounds.js --- 2444-count-subarrays-with-fixed-bounds.js | 28 +++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2444-count-subarrays-with-fixed-bounds.js b/2444-count-subarrays-with-fixed-bounds.js index e2d969e1..9ad838c7 100644 --- a/2444-count-subarrays-with-fixed-bounds.js +++ b/2444-count-subarrays-with-fixed-bounds.js @@ -1,3 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} minK + * @param {number} maxK + * @return {number} + */ +const countSubarrays = function(nums, minK, maxK) { + let res = 0, n = nums.length + let minIdx = -1, maxIdx = -1 + + for(let i = 0, j = 0; i < n; i++) { + if(nums[i] < minK || nums[i] > maxK) { + minIdx = -1 + maxIdx = -1 + j = i + 1 + } + if(nums[i] === minK) minIdx = i + if(nums[i] === maxK) maxIdx = i + if(minIdx !== -1 && maxIdx !== -1) { + res += Math.min(minIdx, maxIdx) - j + 1 + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} minK From 798642b615122523e9cb207c4a95efea7a3c16b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Mar 2023 20:48:43 +0800 Subject: [PATCH 1227/2039] Create 2457-minimum-addition-to-make-integer-beautiful.js --- ...imum-addition-to-make-integer-beautiful.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2457-minimum-addition-to-make-integer-beautiful.js diff --git a/2457-minimum-addition-to-make-integer-beautiful.js b/2457-minimum-addition-to-make-integer-beautiful.js new file mode 100644 index 00000000..d1d9189f --- /dev/null +++ b/2457-minimum-addition-to-make-integer-beautiful.js @@ -0,0 +1,34 @@ +/** + * @param {number} n + * @param {number} target + * @return {number} + */ +const makeIntegerBeautiful = function(n, target) { + let res = 0, carry = 0 + const arr = [] + while(n) { + if(digitSum(n) <= target) break + const remain = (n % 10) + if(remain === 0) { + arr.push(0) + carry = 0 + } else { + arr.push(10 - remain) + carry = 1 + } + + n = (Math.floor(n / 10)) + carry + } + if(arr.length === 0) return 0 + arr.reverse() + return +arr.map(e => '' + e).join('') + + function digitSum(num) { + let res = 0 + while(num > 0) { + res += (num % 10) + num = Math.floor(num/10) + } + return res + } +}; From 1a4a4804a3d1c69bbcd47409634ad876b12f4a1b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 9 Mar 2023 15:06:39 +0800 Subject: [PATCH 1228/2039] Create 2551-put-marbles-in-bags.js --- 2551-put-marbles-in-bags.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2551-put-marbles-in-bags.js diff --git a/2551-put-marbles-in-bags.js b/2551-put-marbles-in-bags.js new file mode 100644 index 00000000..860094d5 --- /dev/null +++ b/2551-put-marbles-in-bags.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} weights + * @param {number} k + * @return {number} + */ +const putMarbles = function (weights, k) { + if (weights.length === k) return 0 + let getEdgeWeights = weights.map((n, i, a) => + i < a.length - 1 ? n + a[i + 1] : 0 + ) + getEdgeWeights = getEdgeWeights.slice(0, weights.length - 1) + getEdgeWeights = getEdgeWeights.sort((a, b) => a - b) + let maxScores = getEdgeWeights + .slice(getEdgeWeights.length - k + 1) + .reduce((a, b) => a + b, 0) + let minScores = getEdgeWeights.slice(0, k - 1).reduce((a, b) => a + b, 0) + return maxScores - minScores +} From f44bd618a1362deab434c2e565a8d2cc219e1c76 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Mar 2023 20:00:18 +0800 Subject: [PATCH 1229/2039] Create 2561-rearranging-fruits.js --- 2561-rearranging-fruits.js | 53 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 2561-rearranging-fruits.js diff --git a/2561-rearranging-fruits.js b/2561-rearranging-fruits.js new file mode 100644 index 00000000..1b630ba9 --- /dev/null +++ b/2561-rearranging-fruits.js @@ -0,0 +1,53 @@ +/** + * @param {number[]} basket1 + * @param {number[]} basket2 + * @return {number} + */ +const minCost = function (basket1, basket2) { + const [map1, map2] = [new Map(), new Map()] + let minVal = Number.MAX_SAFE_INTEGER + + for (const val of basket1) { + if (!map1.has(val)) map1.set(val, 0) + map1.set(val, map1.get(val) + 1) + minVal = Math.min(minVal, val) + } + for (const val of basket2) { + if (!map2.has(val)) map2.set(val, 0) + map2.set(val, map2.get(val) + 1) + minVal = Math.min(minVal, val) + } + + const [swapList1, swapList2] = [[], []] + for (const [key, c1] of map1.entries()) { + const c2 = map2.get(key) || 0 + if ((c1 + c2) % 2) return -1 + if (c1 > c2) { + let addCnt = (c1 - c2) >> 1 + while (addCnt--) { + swapList1.push(key) + } + } + } + for (const [key, c2] of map2.entries()) { + const c1 = map1.get(key) || 0 + if ((c1 + c2) % 2) return -1 + if (c2 > c1) { + let addCnt = (c2 - c1) >> 1 + while (addCnt--) { + swapList2.push(key) + } + } + } + + swapList1.sort((a, b) => a - b) + swapList2.sort((a, b) => b - a) + const n = swapList1.length + + let res = 0 + for (let i = 0; i < n; i++) { + res += Math.min(2 * minVal, swapList1[i], swapList2[i]) + } + + return res +} From d9490e9554c32f7a7e63b4e2e8b616873b361809 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Mar 2023 19:09:47 +0800 Subject: [PATCH 1230/2039] Create 2567-minimum-score-by-changing-two-elements.js --- 2567-minimum-score-by-changing-two-elements.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 2567-minimum-score-by-changing-two-elements.js diff --git a/2567-minimum-score-by-changing-two-elements.js b/2567-minimum-score-by-changing-two-elements.js new file mode 100644 index 00000000..6a4b3abc --- /dev/null +++ b/2567-minimum-score-by-changing-two-elements.js @@ -0,0 +1,12 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimizeSum = function(nums) { + nums.sort((a, b) => a - b) + const { max, min, abs } = Math + const res1 = nums.at(-1) - nums[2] + const res2 = nums.at(-2) - nums[1] + const res3 = nums.at(-3) - nums[0] + return min(res1, res2, res3) +}; From 5e90694cd3331448cf830494cc825e1b01770681 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Mar 2023 19:31:05 +0800 Subject: [PATCH 1231/2039] Update 2567-minimum-score-by-changing-two-elements.js --- ...-minimum-score-by-changing-two-elements.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/2567-minimum-score-by-changing-two-elements.js b/2567-minimum-score-by-changing-two-elements.js index 6a4b3abc..cf2a5321 100644 --- a/2567-minimum-score-by-changing-two-elements.js +++ b/2567-minimum-score-by-changing-two-elements.js @@ -1,3 +1,42 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimizeSum = function(nums) { + let s1 = Infinity, s2 = Infinity, s3 = Infinity + let l1 = -1, l2 = -1, l3 = -1 + const { max, min } = Math + // s1, s2, s3, ..., l3, l2, l1 + for(const e of nums) { + if(s1 > e) { + s3 = s2; + s2 = s1; + s1 = e; + } else if(s2 > e) { + s3 = s2 + s2 = e + } else if(s3 > e) { + s3 = e + } + + if(e > l1) { + l3 = l2 + l2 = l1 + l1 = e + } else if(e > l2) { + l3 = l2 + l2 = e + } else if(e > l3) { + l3 = e + } + } + + return min(l1 - s3, l2 - s2, l3 - s1) +}; + +// another + + /** * @param {number[]} nums * @return {number} From d108548242f4cda4c498abbd362e500e964f0908 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Mar 2023 19:41:00 +0800 Subject: [PATCH 1232/2039] Create 2568-minimum-impossible-or.js --- 2568-minimum-impossible-or.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 2568-minimum-impossible-or.js diff --git a/2568-minimum-impossible-or.js b/2568-minimum-impossible-or.js new file mode 100644 index 00000000..a5609aab --- /dev/null +++ b/2568-minimum-impossible-or.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minImpossibleOR = function(nums) { + const s = new Set(); + for (const e of nums) s.add(e); + let res = 1; + while (s.has(res)) res <<= 1; + return res; +}; From be5dd9294dbbc5783780a9cb442ca1fd95c2e040 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 17 Mar 2023 20:49:12 +0800 Subject: [PATCH 1233/2039] Update 2571-minimum-operations-to-reduce-an-integer-to-0.js --- ...um-operations-to-reduce-an-integer-to-0.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2571-minimum-operations-to-reduce-an-integer-to-0.js b/2571-minimum-operations-to-reduce-an-integer-to-0.js index a395370c..70758216 100644 --- a/2571-minimum-operations-to-reduce-an-integer-to-0.js +++ b/2571-minimum-operations-to-reduce-an-integer-to-0.js @@ -1,3 +1,35 @@ +function dec2bin(dec) { + return (dec >>> 0).toString(2); +} +function bitCnt(s) { + let res = 0 + for(const e of s) { + if(e === '1') res++ + } + return res +} +function cnt(num) { + return bitCnt(dec2bin(num)) +} +/** + * @param {number} n + * @return {number} + */ +const minOperations = function(n) { + let res = 0 + for(let i = 0; i < 14; i++) { + if(cnt(n + (1 << i)) < cnt(n)) { + res++ + n += (1 << i) + } + } + + return res + cnt(n) +}; + +// another + + function dec2bin(dec) { return (dec >>> 0).toString(2); } From 5b202316af16080603ea09f7e89788bcb9b79593 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 18 Mar 2023 18:59:46 +0800 Subject: [PATCH 1234/2039] Create 2573-find-the-string-with-lcp.js --- 2573-find-the-string-with-lcp.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2573-find-the-string-with-lcp.js diff --git a/2573-find-the-string-with-lcp.js b/2573-find-the-string-with-lcp.js new file mode 100644 index 00000000..83ab6c20 --- /dev/null +++ b/2573-find-the-string-with-lcp.js @@ -0,0 +1,27 @@ +/** + * @param {number[][]} lcp + * @return {string} + */ +const findTheString = function (lcp) { + const n = lcp.length + let c = 0 + const arr = new Array(n).fill(0) + for (let i = 0; i < n; ++i) { + if (arr[i] > 0) continue + if (++c > 26) return '' + for (let j = i; j < n; ++j) { + if (lcp[i][j] > 0) arr[j] = c + } + } + for (let i = 0; i < n; ++i) { + for (let j = 0; j < n; ++j) { + let v = i + 1 < n && j + 1 < n ? lcp[i + 1][j + 1] : 0 + v = arr[i] === arr[j] ? v + 1 : 0 + if (lcp[i][j] != v) return '' + } + } + const res = [] + const ac = 'a'.charCodeAt(0) + for (let a of arr) res.push(String.fromCharCode(ac + a - 1)) + return res.join('') +} From 120dc0a5abd751da622192471cf006d2b5969423 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Mar 2023 21:54:50 +0800 Subject: [PATCH 1235/2039] Update 2576-find-the-maximum-number-of-marked-indices.js --- ...nd-the-maximum-number-of-marked-indices.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/2576-find-the-maximum-number-of-marked-indices.js b/2576-find-the-maximum-number-of-marked-indices.js index f8520d12..de2fe1c7 100644 --- a/2576-find-the-maximum-number-of-marked-indices.js +++ b/2576-find-the-maximum-number-of-marked-indices.js @@ -1,3 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxNumOfMarkedIndices = function(nums) { + let res = 0 + const n = nums.length + nums.sort((a, b) => a - b) + for(let i = 0, j = n - Math.floor(n / 2); j < n; j++) { + if(nums[i] * 2 <= nums[j]) { + res += 2 + i++ + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 093323a64e9a98f775494a21bf2896291895ecc4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Mar 2023 19:05:21 +0800 Subject: [PATCH 1236/2039] Update 307-range-sum-query-mutable.js --- 307-range-sum-query-mutable.js | 65 ++++++++++++++++++++++++++++++++++ 1 file changed, 65 insertions(+) diff --git a/307-range-sum-query-mutable.js b/307-range-sum-query-mutable.js index 8c64848f..faff27c5 100644 --- a/307-range-sum-query-mutable.js +++ b/307-range-sum-query-mutable.js @@ -1,3 +1,68 @@ +const lowBit = (x) => x & -x +class FenwickTree { + constructor(n) { + if (n < 1) return + this.sum = Array(n + 1).fill(0) + } + update(i, delta) { + if (i < 1) return + while (i < this.sum.length) { + this.sum[i] += delta + i += lowBit(i) + } + } + query(i) { + if (i < 1) return 0 + let sum = 0 + while (i > 0) { + sum += this.sum[i] + i -= lowBit(i) + } + return sum + } +} + +/** + * @param {number[]} nums + */ +var NumArray = function(nums) { + this.nums = nums + const n = nums.length + this.bit = new FenwickTree(n) + for(let i = 1; i <= n; i++) { + this.bit.update(i, nums[i - 1]) + } +}; + +/** + * @param {number} index + * @param {number} val + * @return {void} + */ +NumArray.prototype.update = function(index, val) { + const delta = val - this.nums[index] + this.nums[index] = val + this.bit.update(index + 1, delta) +}; + +/** + * @param {number} left + * @param {number} right + * @return {number} + */ +NumArray.prototype.sumRange = function(left, right) { + return this.bit.query(right + 1) - this.bit.query(left) +}; + +/** + * Your NumArray object will be instantiated and called as such: + * var obj = new NumArray(nums) + * obj.update(index,val) + * var param_2 = obj.sumRange(left,right) + */ + +// another + /** * @param {number[]} nums */ From aea984e125f0b5138514d1065448d392325a1e71 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Mar 2023 09:43:28 +0800 Subject: [PATCH 1237/2039] Update 1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js --- ...ements-on-subarrays-to-form-a-target-array.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) diff --git a/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js b/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js index 10d9f567..8464391c 100644 --- a/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js +++ b/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js @@ -1,3 +1,19 @@ +/** + * @param {number[]} target + * @return {number} + */ +const minNumberOperations = function(target) { + let res = target[0] + + for(let i = 1; i < target.length; i++) { + res += Math.max(0, target[i] - target[i - 1]) + } + + return res +} + +// another + /** * @param {number[]} target * @return {number} From 130ee4ce3268441b1cbb85982495c6a0b9c0f385 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 Mar 2023 21:01:55 +0800 Subject: [PATCH 1238/2039] Update 1157-online-majority-element-in-subarray.js --- 1157-online-majority-element-in-subarray.js | 138 ++++++++++++++++++++ 1 file changed, 138 insertions(+) diff --git a/1157-online-majority-element-in-subarray.js b/1157-online-majority-element-in-subarray.js index 72a30cfb..54f72984 100644 --- a/1157-online-majority-element-in-subarray.js +++ b/1157-online-majority-element-in-subarray.js @@ -1,3 +1,141 @@ +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_right(a, x, lo = 0, hi = null) { + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = (lo + hi) >> 1 + x < a[mid] ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_left(a, x, lo = 0, hi = null) { + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = (lo + hi) >> 1 + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } +} + +function SegmentTreeRQ(m, A, n) { + let bisect = new Bisect() + let h = Math.ceil(Math.log2(n)) + const MAX = 2 * 2 ** h - 1 + let tree = Array(MAX).fill(-1) + let a = [...A] + build(1, 0, n - 1) + return { + query, + } + + function build(vi, tl, tr) { + if (tl == tr) { + tree[vi] = a[tl] + return + } + let mid = getMid(tl, tr) + build(vi * 2, tl, mid) + build(vi * 2 + 1, mid + 1, tr) + if ( + tree[vi * 2] != -1 && + get_occurrence(tree[vi * 2], tl, tr) * 2 > tr - tl + 1 + ) { + tree[vi] = tree[vi * 2] + } else if ( + tree[vi * 2 + 1] != -1 && + get_occurrence(tree[vi * 2 + 1], tl, tr) * 2 > tr - tl + 1 + ) { + tree[vi] = tree[vi * 2 + 1] + } + } + + function query(vi, l, r, tl, tr) { + if (l > tr || r < tl) { + return { + first: -1, + second: -1, + } + } + if (tl <= l && r <= tr) { + if (tree[vi] == -1) + return { + first: -1, + second: -1, + } + let occ = get_occurrence(tree[vi], tl, tr) + if (occ * 2 > tr - tl + 1) { + return { + first: tree[vi], + second: occ, + } + } else { + return { + first: -1, + second: -1, + } + } + } + let mid = getMid(l, r) + let resL = query(vi * 2, l, mid, tl, tr) + if (resL.first > -1) return resL + let resR = query(vi * 2 + 1, mid + 1, r, tl, tr) + if (resR.first > -1) return resR + return { + first: -1, + second: -1, + } + } + + function get_occurrence(num, l, r) { + // only difference + if (!m.has(num)) return 0 + let a = m.get(num) + let lbv = bisect.bisect_left(a, l) //lower_bound + if (lbv == a.length) return 0 + let ubv = bisect.bisect_right(a, r) // upper_bound + return ubv - lbv + } + + function getMid(low, high) { + return low + ((high - low) >> 1) + } +} + +function MajorityChecker(a) { + let m = new Map() + let n = a.length + for (let i = 0; i < n; i++) { + if (!m.has(a[i])) m.set(a[i], []) + m.get(a[i]).push(i) + } + let st = new SegmentTreeRQ(m, a, n) + return { + query, + } + + function query(left, right, threshold) { + let res = st.query(1, 0, n - 1, left, right) + if (res.second >= threshold) { + return res.first + } + return -1 + } +} + +// another + + /** * @param {number[]} arr */ From 2baf0887ce7baaf845766f2e52053d734adf475b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Mar 2023 10:00:44 +0800 Subject: [PATCH 1239/2039] Update 2-add-two-numbers.js --- 2-add-two-numbers.js | 41 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/2-add-two-numbers.js b/2-add-two-numbers.js index eeaa3925..06f99a30 100755 --- a/2-add-two-numbers.js +++ b/2-add-two-numbers.js @@ -117,4 +117,45 @@ const addTwoNumbers = function(l1, l2) { return dummy.next }; +// another + +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} l1 + * @param {ListNode} l2 + * @return {ListNode} + */ +const addTwoNumbers = function(l1, l2) { + const dummy = new ListNode(null) + let cur = dummy, carry = 0 + + while(l1 || l2) { + let v = 0 + if(l1 && l2) { + v = l1.val + l2.val + carry + l1 = l1.next + l2 = l2.next + } else { + const node = l1 || l2 + v = node.val + carry + if(l1) l1 = l1.next + if(l2) l2 = l2.next + } + + cur.next = new ListNode(v % 10) + cur = cur.next + if(v >= 10) carry = 1 + else carry = 0 + } + + if(carry) cur.next = new ListNode(1) + + return dummy.next +}; From b875116529435b9f1ecfc542adf818d3ec124510 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Mar 2023 15:25:10 +0800 Subject: [PATCH 1240/2039] Update 691-stickers-to-spell-word.js --- 691-stickers-to-spell-word.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/691-stickers-to-spell-word.js b/691-stickers-to-spell-word.js index ac5b4f16..8c0574c5 100644 --- a/691-stickers-to-spell-word.js +++ b/691-stickers-to-spell-word.js @@ -1,3 +1,37 @@ +/** + * @param {string[]} stickers + * @param {string} target + * @return {number} + */ +const minStickers = function (stickers, target) { + const n = stickers.length + const m = target.length + const limit = 1 << m + const dp = Array(limit).fill(Infinity) + dp[0] = 0 + for (let i = 0; i < limit; i++) { + if (dp[i] === Infinity) continue + for (const sticker of stickers) { + let stat = i + for (const ch of sticker) { + for (let j = 0; j < m; j++) { + if (target[j] === ch && ((stat >> j) & 1) === 0) { + stat |= (1 << j) + break + } + } + } + dp[stat] = Math.min(dp[stat], dp[i] + 1) + } + } + + return dp[limit - 1] === Infinity ? -1 : dp[limit - 1] +} + + +// another + + /** * @param {string[]} stickers * @param {string} target From 621ac9fa08232d76ac3e205fca4d98249e1d8e1b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 31 Mar 2023 10:44:01 +0800 Subject: [PATCH 1241/2039] Update 1125-smallest-sufficient-team.js --- 1125-smallest-sufficient-team.js | 42 ++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/1125-smallest-sufficient-team.js b/1125-smallest-sufficient-team.js index 561385d6..4b890c98 100644 --- a/1125-smallest-sufficient-team.js +++ b/1125-smallest-sufficient-team.js @@ -1,3 +1,45 @@ +/** + * @param {string[]} req_skills + * @param {string[][]} people + * @return {number[]} + */ +const smallestSufficientTeam = function (req_skills, people) { + const m = req_skills.length, + n = people.length, + limit = 1 << m + const skillIdxMap = {} + for(let i = 0; i < m; i++) { + skillIdxMap[req_skills[i]] = i + } + const dp = Array(limit) + + dp[0] = [] + + for(let i = 0; i < n; i++) { + let skillMask = 0 + for(let j = 0; j < people[i].length; j++) { + skillMask |= (1 << skillIdxMap[people[i][j]]) + } + + for(let j = 0; j < dp.length; j++) { + if(dp[j] == null) continue + const prev = j + const comb = prev | skillMask + + if(dp[comb] == null || dp[comb].length > dp[prev].length + 1) { + + dp[comb] = dp[prev].slice() + dp[comb].push(i) + } + } + } + + return dp[limit - 1] +} + +// another + + /** * @param {string[]} req_skills * @param {string[][]} people From 74d435044da92e994d571c2ba38247103aea93ae Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Apr 2023 21:07:32 +0800 Subject: [PATCH 1242/2039] Update 1349-maximum-students-taking-exam.js --- 1349-maximum-students-taking-exam.js | 56 ++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/1349-maximum-students-taking-exam.js b/1349-maximum-students-taking-exam.js index 03153525..0a45d165 100644 --- a/1349-maximum-students-taking-exam.js +++ b/1349-maximum-students-taking-exam.js @@ -1,3 +1,59 @@ +/** + * @param {character[][]} seats + * @return {number} + */ +const maxStudents = function(seats) { + const m = seats.length, n = seats[0].length, limit = 1 << n + const dp = Array.from({ length: m + 1}, () => Array(limit).fill(0)) + + let res = 0 + for(let i = 1; i <= m; i++) { + for(let mask = 0; mask < limit; mask++) { + let valid = true + for(let j = 0; j < n; j++) { + if(seats[i - 1][j] === '#' && ((mask >> j) & 1) ) { + valid = false + break + } + if(j < n - 1 && ((mask >> j) & 1) && ((mask >> (j + 1)) & 1) ) { + valid = false + break + } + } + + if(!valid) { + dp[i][mask] = -1 + continue + } + + for(let pre = 0; pre < limit; pre++) { + if(dp[i - 1][pre] === -1) continue + if( (pre & (mask >> 1)) !== 0 || (pre & (mask << 1)) !== 0 ) continue + dp[i][mask] = Math.max(dp[i][mask], dp[i - 1][pre]) + } + + dp[i][mask] += bitCnt(mask) + + res = Math.max(res, dp[i][mask]) + } + } + + return res + + function bitCnt(num) { + let res = 0 + while(num) { + if(num & 1) res++ + num = num >> 1 + } + + return res + } +}; + +// another + + /** * @param {character[][]} seats * @return {number} From c49aa74d0d85fcb8c9dda0fc5eef0e7da89c2a9b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 15:07:00 +0800 Subject: [PATCH 1243/2039] Create 2609-find-the-longest-balanced-substring-of-a-binary-string.js --- ...t-balanced-substring-of-a-binary-string.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2609-find-the-longest-balanced-substring-of-a-binary-string.js diff --git a/2609-find-the-longest-balanced-substring-of-a-binary-string.js b/2609-find-the-longest-balanced-substring-of-a-binary-string.js new file mode 100644 index 00000000..1f3ad65e --- /dev/null +++ b/2609-find-the-longest-balanced-substring-of-a-binary-string.js @@ -0,0 +1,29 @@ +/** + * @param {string} s + * @return {number} + */ +const findTheLongestBalancedSubstring = function(s) { + let res = 0 + + const n = s.length + for(let i = 0; i < n - 1; i++) { + for(let j = i + 1; j < n; j++) { + const str = s.slice(i, j + 1) + if(valid(str)) { + res = Math.max(res, str.length) + } + } + } + + return res + + function valid(str) { + let res = true + const len = str.length + if(len % 2 === 1) return false + const lastZeroIdx = str.lastIndexOf('0') + const firstOneIdx = str.indexOf('1') + + return firstOneIdx - lastZeroIdx === 1 && len / 2 === firstOneIdx + } +}; From b64ad8bcd8b48dade8765266f079efa38a1657ae Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 15:14:40 +0800 Subject: [PATCH 1244/2039] Update 1411-number-of-ways-to-paint-n-3-grid.js --- 1411-number-of-ways-to-paint-n-3-grid.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/1411-number-of-ways-to-paint-n-3-grid.js b/1411-number-of-ways-to-paint-n-3-grid.js index c644c37b..199a4a5b 100644 --- a/1411-number-of-ways-to-paint-n-3-grid.js +++ b/1411-number-of-ways-to-paint-n-3-grid.js @@ -1,3 +1,24 @@ +/** + * @param {number} n + * @return {number} + */ +const numOfWays = function(n) { + const mod = 1e9 + 7 + let colors3 = 6, colors2 = 6 + + for(let i = 1; i < n; i++) { + const colors3Tmp = colors3 + colors3 = (2 * colors3 + 2 * colors2) % mod + colors2 = (2 * colors3Tmp + 3 * colors2) % mod + } + + + return (colors2 + colors3) % mod +}; + +// another + + /** * @param {number} n * @return {number} From 0cc1ab703cfd65764f6524dd0e6d39d9b7bac9b7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 20:07:27 +0800 Subject: [PATCH 1245/2039] Create 2610-convert-an-array-into-a-2d-array-with-conditions.js --- ...n-array-into-a-2d-array-with-conditions.js | 114 ++++++++++++++++++ 1 file changed, 114 insertions(+) create mode 100644 2610-convert-an-array-into-a-2d-array-with-conditions.js diff --git a/2610-convert-an-array-into-a-2d-array-with-conditions.js b/2610-convert-an-array-into-a-2d-array-with-conditions.js new file mode 100644 index 00000000..9ab60648 --- /dev/null +++ b/2610-convert-an-array-into-a-2d-array-with-conditions.js @@ -0,0 +1,114 @@ +/** + * @param {number[]} nums + * @return {number[][]} + */ +const findMatrix = function(nums) { + const p1 = new PQ((a, b) => a.cnt > b.cnt) + const p2 = new PQ((a, b) => a.cnt > b.cnt) + + const hash = new Map() + for(const e of nums) { + if(!hash.has(e)) hash.set(e, 0) + hash.set(e, hash.get(e) + 1) + } + + for(const [k, v] of hash) { + p1.push({val: k, cnt: v}) + } + + + const res = [] + while(p1.size() || p2.size()) { + const tmp = [] + + if(p1.size()) { + while(p1.size()) { + const e = p1.pop() + let {val, cnt} = e + tmp.push(val) + if(--cnt > 0) p2.push({val, cnt}) + } + + } else { + while(p2.size()) { + const e = p2.pop() + let {val, cnt} = e + tmp.push(val) + if(--cnt > 0) p1.push({val, cnt}) + } + + } + + res.push(tmp) + } + + return res +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 1fa73a65d1e635e63898429082d5e9da354867c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 20:15:05 +0800 Subject: [PATCH 1246/2039] Update 2610-convert-an-array-into-a-2d-array-with-conditions.js --- ...n-array-into-a-2d-array-with-conditions.js | 102 ++---------------- 1 file changed, 9 insertions(+), 93 deletions(-) diff --git a/2610-convert-an-array-into-a-2d-array-with-conditions.js b/2610-convert-an-array-into-a-2d-array-with-conditions.js index 9ab60648..040edf6c 100644 --- a/2610-convert-an-array-into-a-2d-array-with-conditions.js +++ b/2610-convert-an-array-into-a-2d-array-with-conditions.js @@ -3,112 +3,28 @@ * @return {number[][]} */ const findMatrix = function(nums) { - const p1 = new PQ((a, b) => a.cnt > b.cnt) - const p2 = new PQ((a, b) => a.cnt > b.cnt) - + const hash = new Map() for(const e of nums) { if(!hash.has(e)) hash.set(e, 0) hash.set(e, hash.get(e) + 1) } + const arr = [] for(const [k, v] of hash) { - p1.push({val: k, cnt: v}) + arr.push([v, k]) } + arr.sort((a, b) => b[0] - a[0]) const res = [] - while(p1.size() || p2.size()) { - const tmp = [] - - if(p1.size()) { - while(p1.size()) { - const e = p1.pop() - let {val, cnt} = e - tmp.push(val) - if(--cnt > 0) p2.push({val, cnt}) - } - - } else { - while(p2.size()) { - const e = p2.pop() - let {val, cnt} = e - tmp.push(val) - if(--cnt > 0) p1.push({val, cnt}) - } - + for(let i = 0, len = arr.length; i < len; i++) { + const [freq, val] = arr[i] + for(let j = 0; j < freq; j++) { + if(res[j] == null) res[j] = [] + res[j].push(val) } - - res.push(tmp) } return res }; - -class PQ { - constructor(comparator = (a, b) => a > b) { - this.heap = [] - this.top = 0 - this.comparator = comparator - } - size() { - return this.heap.length - } - isEmpty() { - return this.size() === 0 - } - peek() { - return this.heap[this.top] - } - push(...values) { - values.forEach((value) => { - this.heap.push(value) - this.siftUp() - }) - return this.size() - } - pop() { - const poppedValue = this.peek() - const bottom = this.size() - 1 - if (bottom > this.top) { - this.swap(this.top, bottom) - } - this.heap.pop() - this.siftDown() - return poppedValue - } - replace(value) { - const replacedValue = this.peek() - this.heap[this.top] = value - this.siftDown() - return replacedValue - } - - parent = (i) => ((i + 1) >>> 1) - 1 - left = (i) => (i << 1) + 1 - right = (i) => (i + 1) << 1 - greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) - swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) - siftUp = () => { - let node = this.size() - 1 - while (node > this.top && this.greater(node, this.parent(node))) { - this.swap(node, this.parent(node)) - node = this.parent(node) - } - } - siftDown = () => { - let node = this.top - while ( - (this.left(node) < this.size() && this.greater(this.left(node), node)) || - (this.right(node) < this.size() && this.greater(this.right(node), node)) - ) { - let maxChild = - this.right(node) < this.size() && - this.greater(this.right(node), this.left(node)) - ? this.right(node) - : this.left(node) - this.swap(node, maxChild) - node = maxChild - } - } -} From a2be85f8aeffb79bf0872791c1cb1c7f0be27386 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 20:35:40 +0800 Subject: [PATCH 1247/2039] Create 2611-mice-and-cheese.js --- 2611-mice-and-cheese.js | 100 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 100 insertions(+) create mode 100644 2611-mice-and-cheese.js diff --git a/2611-mice-and-cheese.js b/2611-mice-and-cheese.js new file mode 100644 index 00000000..f8ddd497 --- /dev/null +++ b/2611-mice-and-cheese.js @@ -0,0 +1,100 @@ +/** + * @param {number[]} reward1 + * @param {number[]} reward2 + * @param {number} k + * @return {number} + */ +const miceAndCheese = function(reward1, reward2, k) { + const pq = new PQ((a, b) => a[2] > b[2]) + + const n = reward1.length + + for(let i = 0; i < n; i++) { + const tmp = [reward1[i], reward2[i], reward1[i] - reward2[i]] + pq.push(tmp) + } + + let res = 0 + while(k) { + const [v1, v2, delta] = pq.pop() + res += v1 + + k-- + } + + while(!pq.isEmpty()) { + const [v1, v2] = pq.pop() + res += v2 + } + + + return res +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 5160bb70684c1142cdc031b24f4e7a3b2a6a8d8c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 21:04:28 +0800 Subject: [PATCH 1248/2039] Update 496-next-greater-element-I.js --- 496-next-greater-element-I.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/496-next-greater-element-I.js b/496-next-greater-element-I.js index 663ef13e..e3b281bb 100755 --- a/496-next-greater-element-I.js +++ b/496-next-greater-element-I.js @@ -1,3 +1,35 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number[]} + */ +const nextGreaterElement = function(nums1, nums2) { + const map = new Map() + const stk = [] + + for(let i = 0, n = nums2.length; i < n; i++) { + const e = nums2[i] + while(stk.length && stk.at(-1) < e) { + const tmp = stk.pop() + map.set(tmp, e) + } + stk.push(e) + } + + const res = [] + for(const e of nums1) { + if(map.has(e)) { + res.push(map.get(e)) + } else { + res.push(-1) + } + } + + return res +}; + +// another + /** * @param {number[]} findNums * @param {number[]} nums From 296904d087e85612c1ec9e464e680a1bd9833f5f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Apr 2023 21:30:46 +0800 Subject: [PATCH 1249/2039] Update 503-next-greater-element-II.js --- 503-next-greater-element-II.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/503-next-greater-element-II.js b/503-next-greater-element-II.js index fc284214..37a4898e 100755 --- a/503-next-greater-element-II.js +++ b/503-next-greater-element-II.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const nextGreaterElements = function(nums) { + const arr = [] + const n = nums.length + const res = Array(n).fill(-1) + nums.push(...nums) + const stk = [] + for(let i = 0; i < 2 * n; i++) { + const e = nums[i] + while(stk.length && nums[stk.at(-1)] < e) { + const idx = stk.pop() + res[idx] = e + } + if(i < n) stk.push(i) + } + + return res +}; + +// another + + /** * @param {number[]} nums * @return {number[]} From b0e6b74f7c658bd3de34c7a77182662972cd2e02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 Apr 2023 10:00:07 +0800 Subject: [PATCH 1250/2039] Update 15-3sum.js --- 15-3sum.js | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/15-3sum.js b/15-3sum.js index c6f4a983..498fc859 100755 --- a/15-3sum.js +++ b/15-3sum.js @@ -1,3 +1,37 @@ +/** + * @param {number[]} nums + * @return {number[][]} + */ +const threeSum = function(nums) { + const res = [], n = nums.length + nums.sort((a, b) => a - b) + + for(let i = 0; i < n; i++) { + const target = -nums[i] + let l = i + 1, r = n - 1 + while(l < r) { + const sum = nums[l] + nums[r] + if(sum > target) r-- + else if(sum < target) l++ + else { + const e = [nums[i], nums[l], nums[r]] + res.push(e) + while(l + 1 < r && nums[l + 1] === nums[l]) l++ + while(r - 1 > l && nums[r - 1] === nums[r]) r-- + l++ + r-- + } + } + while(i + 1 < n && nums[i] === nums[i + 1]) i++ + } + + + return res +}; + +// another + + /** * @param {number[]} nums * @return {number[][]} From 4fedf133b1f1a240c67262c33995bfdee0c4f1c8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 Apr 2023 14:17:45 +0800 Subject: [PATCH 1251/2039] Update 1434-number-of-ways-to-wear-different-hats-to-each-other.js --- ...ys-to-wear-different-hats-to-each-other.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1434-number-of-ways-to-wear-different-hats-to-each-other.js b/1434-number-of-ways-to-wear-different-hats-to-each-other.js index 6704ff78..4656736b 100644 --- a/1434-number-of-ways-to-wear-different-hats-to-each-other.js +++ b/1434-number-of-ways-to-wear-different-hats-to-each-other.js @@ -1,3 +1,46 @@ +/** + * @param {number[][]} hats + * @return {number} + */ +const numberWays = function(hats) { + const map = new Map() + const n = hats.length + for(let i = 0; i < n; i++) { + for(const h of hats[i]) { + if(!map.has(h)) map.set(h, []) + map.get(h).push(i) + } + } + const mod = 1e9 + 7 + const allMask = (1 << n) - 1 + const dp = Array.from({ length: 41 }, () => Array(1024)) + + return dfs(1, 0) + + function dfs(hat, mask) { + if(mask === allMask) return 1 + if(hat > 40) return 0 + if(dp[hat][mask] != null) return dp[hat][mask] + + let res = 0 + + // not using this `hat` + res += dfs(hat + 1, mask) + for(const p of (map.get(hat) || [])) { + if(((mask >> p) & 1) === 0) { + res += dfs(hat + 1, mask | (1 << p)) + res = res % mod + } + } + dp[hat][mask] = res + return res + } + +}; + +// another + + /** * @param {number[][]} hats * @return {number} From fd314ca2b6ff20cb7d46e27ab9398870add26e26 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Apr 2023 15:02:50 +0800 Subject: [PATCH 1252/2039] Update 1655-distribute-repeating-integers.js --- 1655-distribute-repeating-integers.js | 50 +++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/1655-distribute-repeating-integers.js b/1655-distribute-repeating-integers.js index ece2391f..679d1fc2 100644 --- a/1655-distribute-repeating-integers.js +++ b/1655-distribute-repeating-integers.js @@ -1,3 +1,53 @@ +/** + * @param {number[]} nums + * @param {number[]} quantity + * @return {boolean} + */ +const canDistribute = function(nums, quantity) { + const freq = new Map() + for(const e of nums) { + freq.set(e, (freq.get(e) || 0) + 1) + } + const cntArr = [...freq.values()] + const dp = Array.from({ length: 51 }, () => Array(1024).fill(false)) + const n = cntArr.length, m = quantity.length + for(let i = 0; i < n; i++) { + dp[i][0] = true + } + cntArr.unshift(0) + const allMask = (1 << m) - 1 + + for(let i = 1; i <= n; i++) { + for(let mask = 1; mask <= allMask; mask++) { + if(dp[i - 1][mask]) { + dp[i][mask] = true + continue + } + for(let subset = mask; subset > 0; subset = (subset - 1) & mask) { + if(dp[i - 1][mask - subset] === false) continue + if(canSatisfySubset(cntArr[i], subset)) { + dp[i][mask] = true + break + } + } + } + } + + return dp[n][allMask] + + function canSatisfySubset(cnt, subset) { + let sum = 0 + for (let i = 0; i < 10; i++) { + if(subset & (1 << i)) { + sum += quantity[i] + } + } + return cnt >= sum + } +}; + +// another + /** * @param {number[]} nums * @param {number[]} quantity From 89ea11344b6ab6baafde8f975abf673ad40e065d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 6 Apr 2023 20:47:14 +0800 Subject: [PATCH 1253/2039] Update 1681-minimum-incompatibility.js --- 1681-minimum-incompatibility.js | 46 +++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) diff --git a/1681-minimum-incompatibility.js b/1681-minimum-incompatibility.js index eb5a21a8..255ef859 100644 --- a/1681-minimum-incompatibility.js +++ b/1681-minimum-incompatibility.js @@ -1,3 +1,49 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minimumIncompatibility = function(nums, k) { + const n = nums.length + const size = n / k + const mod = 1e9 + 7 + if(size === 1) return 0 + const limit = 1 << n + const dp = Array.from({ length: limit }, () => Array(16).fill(Infinity)) + for(let i = 0; i < n; i++) dp[1 << i][i] = 0 + + for(let mask = 0; mask < limit; mask++) { + for(let i = 0; i < n; i++) { + if((mask & (1 << i)) === 0) continue + for(let j = 0; j < n; j++) { + if((mask & (1 << j))) continue + const newMask = mask | (1 << j) + if(bitCnt(mask) % size === 0) { + dp[newMask][j] = Math.min(dp[newMask][j], dp[mask][i]) + } else if(nums[j] > nums[i]) { + dp[newMask][j] = Math.min(dp[newMask][j], dp[mask][i] + nums[j] - nums[i]) + } + } + } + } + + const candidate = Math.min(...dp.at(-1)) + + return candidate === Infinity ? -1 : candidate + + function bitCnt(num) { + let res = 0 + while(num) { + if(num & 1) res++ + num = num >> 1 + } + + return res + } +}; + +// another + /** * @param {number[]} nums * @param {number} k From 406a75452ea5670e6fc28260f18ea83b2c487f68 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 7 Apr 2023 20:39:42 +0800 Subject: [PATCH 1254/2039] Update 1723-find-minimum-time-to-finish-all-jobs.js --- 1723-find-minimum-time-to-finish-all-jobs.js | 3 --- 1 file changed, 3 deletions(-) diff --git a/1723-find-minimum-time-to-finish-all-jobs.js b/1723-find-minimum-time-to-finish-all-jobs.js index 40f5824e..4dd000c4 100644 --- a/1723-find-minimum-time-to-finish-all-jobs.js +++ b/1723-find-minimum-time-to-finish-all-jobs.js @@ -17,12 +17,9 @@ const minimumTimeRequired = function(jobs, k) { res = Math.min(res, Math.max(...workers)) return } - const visited = new Set() const e = jobs[idx] for(let i = 0; i < k; i++) { - if(visited.has(workers[i])) continue if(workers[i] + e >= res) continue - visited.add(workers[i]) workers[i] += e dfs(idx + 1) workers[i] -= e From fde3f164ee74805dbc089c89031c96d703991f92 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 7 Apr 2023 22:19:46 +0800 Subject: [PATCH 1255/2039] Update 1723-find-minimum-time-to-finish-all-jobs.js --- 1723-find-minimum-time-to-finish-all-jobs.js | 34 ++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/1723-find-minimum-time-to-finish-all-jobs.js b/1723-find-minimum-time-to-finish-all-jobs.js index 4dd000c4..94a8c01b 100644 --- a/1723-find-minimum-time-to-finish-all-jobs.js +++ b/1723-find-minimum-time-to-finish-all-jobs.js @@ -1,3 +1,37 @@ +/** + * @param {number[]} jobs + * @param {number} k + * @return {number} + */ +const minimumTimeRequired = function(jobs, k) { + const n = jobs.length + const limit = 1 << n + const sum = Array(limit).fill(0) + const { min, max } = Math + + for(let mask = 0; mask < limit; mask++) { + for(let i = 0; i < n; i++) { + if((mask & (1 << i))) sum[mask] += jobs[i] + } + } + + const dp = Array.from({ length: k + 1 }, () => Array(limit).fill(0)) + for(let i = 0; i < limit; i++) dp[1][i] = sum[i] + + for(let i = 2; i <= k; i++) { + for(let mask = 0; mask < limit; mask++) { + dp[i][mask] = dp[i - 1][mask] + for(let sub = mask; sub; sub = (sub - 1) & mask) { + dp[i][mask] = min(dp[i][mask], max(dp[i - 1][mask - sub], sum[sub])) + } + } + } + + return dp[k][limit - 1] +}; + +// another + /** * @param {number[]} jobs * @param {number} k From fb16d686cd20a475568530c14c7b62ee7cca9c35 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Apr 2023 17:06:51 +0800 Subject: [PATCH 1256/2039] Create 2614-prime-in-diagonal.js --- 2614-prime-in-diagonal.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2614-prime-in-diagonal.js diff --git a/2614-prime-in-diagonal.js b/2614-prime-in-diagonal.js new file mode 100644 index 00000000..d214e379 --- /dev/null +++ b/2614-prime-in-diagonal.js @@ -0,0 +1,30 @@ +const isPrime = num => { + for(let i = 2, s = Math.sqrt(num); i <= s; i++) { + if(num % i === 0) return false; + } + return num > 1; +} +/** + * @param {number[][]} nums + * @return {number} + */ +var diagonalPrime = function(nums) { + const n = nums.length + let res = 0 + for(let i = 0; i < n; i++) { + if(isPrime(nums[i][i])) { + res = Math.max(res, nums[i][i]) + } + } + + for(let i = 0; i < n; i++) { + if(isPrime(nums[i][n - 1 - i])) { + res = Math.max(res, nums[i][n - 1 - i]) + } + } + + + return res + + +}; From 9b8bd8153c70cc8edd7179575ebcdcc284141334 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Apr 2023 12:21:28 +0800 Subject: [PATCH 1257/2039] Update 1931-painting-a-grid-with-three-different-colors.js --- ...ting-a-grid-with-three-different-colors.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1931-painting-a-grid-with-three-different-colors.js b/1931-painting-a-grid-with-three-different-colors.js index 1433b0e4..2e3cec5a 100644 --- a/1931-painting-a-grid-with-three-different-colors.js +++ b/1931-painting-a-grid-with-three-different-colors.js @@ -100,3 +100,50 @@ const colorTheGrid = function(m, n) { return dp(0, 0) }; + +// another + +/** + * @param {number} m + * @param {number} n + * @return {number} + */ +const colorTheGrid = function(m, n) { + const mod = 1e9 + 7 + const limit = 1 << (2 * m) + const memo = Array.from({ length: n }, () => Array(limit)) + + return dp(0, 0) + + function dp(col, preColMask) { + if(col === n) return 1 + let res = 0 + + if(memo[col][preColMask] != null) return memo[col][preColMask] + const curColMasks = [] + dfs(preColMask, 0, 0, curColMasks) + for(const colMask of curColMasks) { + res = (res + dp(col + 1, colMask)) % mod + } + return memo[col][preColMask] = res + } + + function dfs(preColMask, curColMask, row, res) { + if(row === m) { + res.push(curColMask) + return + } + for(let i = 1; i <= 3; i++) { + if(getColor(preColMask, row) !== i && (row === 0 || getColor(curColMask, row - 1) !== i)) { + dfs(preColMask, setColor(curColMask, row, i) ,row + 1, res) + } + } + } + + function getColor(mask, row) { + return (mask >> (2 * row)) & 3 + } + function setColor(mask, row, val) { + return mask | (val << (2 * row)) + } +}; From a6015ede1db6619c90cccd278493f82ec68416ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Apr 2023 19:47:43 +0800 Subject: [PATCH 1258/2039] Create 2615-sum-of-distances.js --- 2615-sum-of-distances.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2615-sum-of-distances.js diff --git a/2615-sum-of-distances.js b/2615-sum-of-distances.js new file mode 100644 index 00000000..533c3806 --- /dev/null +++ b/2615-sum-of-distances.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const distance = function(nums) { + const n = nums.length + const res = Array(n).fill(0) + const hash = {} + for(let i = 0; i < n; i++) { + const e = nums[i] + if(hash[e] == null) hash[e] = [] + hash[e].push(i) + } + + const keys = Object.keys(hash) + for(const k of keys) { + const arr = hash[k] + const totalSum = arr.reduce((ac, e) => ac + e, 0) + let preSum = 0 + if(arr.length < 2) continue + for(let i = 0, len = arr.length; i < len; i++) { + const idx = arr[i] + const postSum = totalSum - (preSum + idx) + + res[idx] += idx * i + res[idx] -= preSum + res[idx] -= idx * (len - 1 - i) + res[idx] += postSum + + preSum += idx + } + } + + + return res +}; From 2ff0661b1e4a792e2736520ce153f94b64d98825 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Apr 2023 10:53:59 +0800 Subject: [PATCH 1259/2039] Update 2184-number-of-ways-to-build-sturdy-brick-wall.js --- ...mber-of-ways-to-build-sturdy-brick-wall.js | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/2184-number-of-ways-to-build-sturdy-brick-wall.js b/2184-number-of-ways-to-build-sturdy-brick-wall.js index 1d53cd50..99624b12 100644 --- a/2184-number-of-ways-to-build-sturdy-brick-wall.js +++ b/2184-number-of-ways-to-build-sturdy-brick-wall.js @@ -1,3 +1,57 @@ +/** + * @param {number} height + * @param {number} width + * @param {number[]} bricks + * @return {number} + */ +const buildWall = function (height, width, bricks) { + const mod = 1e9 + 7 + const avail = [] + const bset = new Set(bricks) + const m = width - 1, limit = 1 << m + for(let mask = 0; mask < limit; mask++) { + const idxArr = [-1] + for(let j = 0; j < m; j++) { + if((mask >> j) & 1) idxArr.push(j) + } + idxArr.push(m) + let flag = true + for(let j = 1, len = idxArr.length; j < len; j++) { + if(!bset.has(idxArr[j] - idxArr[j - 1])) { + flag = false + break + } + } + if(flag) avail.push(mask) + } + + let res = 0 + if(height === 1) return avail.length + const dp = Array.from({ length: height }, () => Array(limit).fill(0)) + for(const mask of avail) { + dp[0][mask] = 1 + } + + for(let i = 1; i < height; i++) { + for(let j = 0, len = avail.length; j < len; j++) { + const cur = avail[j] + for(let k = 0; k < len; k++) { + const pre = avail[k] + if((cur & pre) === 0) { + dp[i][cur] = (dp[i][cur] + dp[i - 1][pre]) % mod + } + } + if(i === height - 1) { + res = (res + dp[i][cur]) % mod + } + } + } + + return res +} + +// another + /** * @param {number} height * @param {number} width From 22d618f36bc711d21932114951226c1af61e9398 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Apr 2023 19:25:01 +0800 Subject: [PATCH 1260/2039] Create 2616-minimize-the-maximum-difference-of-pairs.js --- ...inimize-the-maximum-difference-of-pairs.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2616-minimize-the-maximum-difference-of-pairs.js diff --git a/2616-minimize-the-maximum-difference-of-pairs.js b/2616-minimize-the-maximum-difference-of-pairs.js new file mode 100644 index 00000000..c96d82b0 --- /dev/null +++ b/2616-minimize-the-maximum-difference-of-pairs.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} p + * @return {number} + */ +const minimizeMax = function(nums, p) { + nums.sort((a, b) => a - b) + const n = nums.length + let l = 0, r = nums.at(-1) - nums[0] + + while(l < r) { + const mid = Math.floor(l + (r - l) / 2) + let k = 0 + for(let i = 1; i < n;) { + if(nums[i] - nums[i - 1] <= mid) { + k++ + i += 2 + } else { + i++ + } + } + + if(k >= p) { + r = mid + } else { + l = mid + 1 + } + } + + return l +}; From f106183a718e75a9d867a541133d84787c7e1c4a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Apr 2023 06:41:53 +0800 Subject: [PATCH 1261/2039] Update 206-reverse-linked-list.js --- 206-reverse-linked-list.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/206-reverse-linked-list.js b/206-reverse-linked-list.js index 94c78a97..82ccda9a 100755 --- a/206-reverse-linked-list.js +++ b/206-reverse-linked-list.js @@ -14,7 +14,7 @@ const reverseList = function(head) { const pre = new ListNode(null, head) let cur = head while(cur.next) { - let tmp = pre.next + const tmp = pre.next pre.next = cur.next cur.next = cur.next.next pre.next.next = tmp From 24572632c52eadba03a8e229534aed644a1cd2dc Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Apr 2023 11:04:38 +0800 Subject: [PATCH 1262/2039] Update 2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js --- ...-length-of-two-palindromic-subsequences.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js b/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js index ad4a1b79..f6126c88 100644 --- a/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js +++ b/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js @@ -27,3 +27,47 @@ function palindromic( i, s) { } return len; } + +// another + +/** + * @param {string} s + * @return {number} + */ +const maxProduct = function(s) { + const s1 = [], s2 = [], n = s.length + let res = 0 + dfs(0) + return res + + function dfs(idx) { + if(idx === n) { + if(isPalindromic(s1) && isPalindromic(s2)) { + res = Math.max(res, s1.length * s2.length) + } + return + } + const ch = s[idx] + s1.push(ch) + dfs(idx + 1) + s1.pop() + + s2.push(ch) + dfs(idx + 1) + s2.pop() + + dfs(idx + 1) + } + function isPalindromic(arr) { + let l = 0, r = arr.length - 1 + while(l < r) { + if(arr[l] === arr[r]) { + l++ + r-- + } else { + return false + } + } + return true + } +}; From a95af4a7e3a802247cf123d6828aa3a5d1a6fbad Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 13 Apr 2023 11:46:37 +0800 Subject: [PATCH 1263/2039] Create 2572-count-the-number-of-square-free-subsets.js --- ...count-the-number-of-square-free-subsets.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2572-count-the-number-of-square-free-subsets.js diff --git a/2572-count-the-number-of-square-free-subsets.js b/2572-count-the-number-of-square-free-subsets.js new file mode 100644 index 00000000..2100de59 --- /dev/null +++ b/2572-count-the-number-of-square-free-subsets.js @@ -0,0 +1,48 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const squareFreeSubsets = function(nums) { + const primes = [2,3,5,7,11,13,17,19,23,29] + const n = nums.length + const limit = 1 << primes.length, mod = 1e9 + 7 + const dp = Array.from({ length: n + 1 }, () => Array(limit).fill(0)) + dp[0][0] = 1 + const arr = [0, ...nums] + let res = 0 + for(let i = 1; i <= n; i++) { + const cur = arr[i] + for(let mask = 0; mask < limit; mask++) { + if(cur === 1) { + dp[i][mask] = (dp[i - 1][mask] * 2) % mod + } else { + dp[i][mask] = dp[i - 1][mask] + const sub = helper(cur) + if(sub !== -1 && (mask & sub) === sub) { + dp[i][mask] = (dp[i][mask] + dp[i - 1][mask - sub]) % mod + } + } + if(i === n) { + res = (res + dp[i][mask]) % mod + } + } + } + + return (res + mod - 1) % mod + + function helper(x) { + let res = 0 + for(let i = 0; i < primes.length; i++) { + let cnt = 0 + while(x && (x % primes[i] === 0)) { + cnt++ + x = x / primes[i] + } + if(cnt > 1) return -1 + else if(cnt === 1) { + res = res | (1 << i) + } + } + return res + } +}; From 1a42bc432ce576618bb379b5aad3ed1f9fd30060 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 14 Apr 2023 12:28:48 +0800 Subject: [PATCH 1264/2039] Create 2403-minimum-time-to-kill-all-monsters.js --- 2403-minimum-time-to-kill-all-monsters.js | 30 +++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2403-minimum-time-to-kill-all-monsters.js diff --git a/2403-minimum-time-to-kill-all-monsters.js b/2403-minimum-time-to-kill-all-monsters.js new file mode 100644 index 00000000..b91a3541 --- /dev/null +++ b/2403-minimum-time-to-kill-all-monsters.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} power + * @return {number} + */ +const minimumTime = function(power) { + const n = power.length + const limit = 1 << n + const dp = new Array(limit).fill(Infinity) + dp[0] = 0 + for(let mask = 1; mask < limit; mask++) { + const k = cnt(mask) + for(let i = 0; i < n; i++) { + if((mask >> i) & 1) { + dp[mask] = Math.min(dp[mask], dp[mask - (1 << i)] + Math.ceil(power[i] / k) ) + } + } + } + // console.log(dp) + return dp[limit - 1] + + function cnt(num) { + let res = 0 + while(num) { + if(num & 1) res++ + num = num >> 1 + } + + return res + } +}; From a678a67f0dc6e115d537d400a793f18d3630553a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 Apr 2023 19:30:16 +0800 Subject: [PATCH 1265/2039] Update 1494-parallel-courses-ii.js --- 1494-parallel-courses-ii.js | 47 +++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1494-parallel-courses-ii.js b/1494-parallel-courses-ii.js index af6c6a1d..e693d4b5 100644 --- a/1494-parallel-courses-ii.js +++ b/1494-parallel-courses-ii.js @@ -48,3 +48,50 @@ function bitCount(n) { n = (n & 0x33333333) + ((n >> 2) & 0x33333333) return (((n + (n >> 4)) & 0xf0f0f0f) * 0x1010101) >> 24 } + +// another + +/** + * @param {number} n + * @param {number[][]} dependencies + * @param {number} k + * @return {number} + */ +const minNumberOfSemesters = function (n, dependencies, k) { + const pre = Array(n).fill(0) + const limit = 1 << n + for(const [p, v] of dependencies) { + pre[v - 1] |= (1 << (p - 1)) + } + const dp = Array(limit).fill(Infinity) + dp[0] = 0 + + for(let learned = 0; learned < limit; learned++) { + let wait = 0 + for(let i = 0; i < n; i++) { + if( (learned & pre[i]) === pre[i]) { + wait |= (1 << i) + } + } + wait = wait & (~learned) + for(let sub = wait; sub; sub = (sub - 1) & wait) { + if(bitCnt(sub) > k) continue + const mask = learned | sub + dp[mask] = Math.min(dp[mask], dp[learned] + 1) + } + } + + return dp[limit - 1] +} + +function bitCnt(num) { + let res = 0 + while(num) { + if(num & 1) res++ + num = num >> 1 + } + + return res +} + + From 91b528dc297b355ca9d5901bc80d8922e83254ea Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 Apr 2023 19:38:29 +0800 Subject: [PATCH 1266/2039] Update 1494-parallel-courses-ii.js --- 1494-parallel-courses-ii.js | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/1494-parallel-courses-ii.js b/1494-parallel-courses-ii.js index e693d4b5..0882499f 100644 --- a/1494-parallel-courses-ii.js +++ b/1494-parallel-courses-ii.js @@ -87,11 +87,12 @@ const minNumberOfSemesters = function (n, dependencies, k) { function bitCnt(num) { let res = 0 while(num) { - if(num & 1) res++ - num = num >> 1 + num &= (num - 1) + res++ } return res } + From c24a66cf875cfa38549479cf232536282d602b76 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Apr 2023 12:16:54 +0800 Subject: [PATCH 1267/2039] Create 2643-row-with-maximum-ones.js --- 2643-row-with-maximum-ones.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2643-row-with-maximum-ones.js diff --git a/2643-row-with-maximum-ones.js b/2643-row-with-maximum-ones.js new file mode 100644 index 00000000..b7ebf790 --- /dev/null +++ b/2643-row-with-maximum-ones.js @@ -0,0 +1,21 @@ +/** + * @param {number[][]} mat + * @return {number[]} + */ +var rowAndMaximumOnes = function(mat) { + const arr= [] + const m = mat.length, n = mat[0].length + let ma = 0 + for(let i = 0; i < m; i++) { + let cnt = 0 + for(let j = 0; j < n; j++) { + if(mat[i][j] === 1) cnt++ + } + arr[i] = cnt + ma = Math.max(ma, cnt) + } + + for(let i = 0; i < m; i++) { + if(arr[i] === ma) return [i, ma] + } +}; From 2668e5e810a61928f4483a532160598a126deeaf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Apr 2023 12:17:24 +0800 Subject: [PATCH 1268/2039] Create 2644-find-the-maximum-divisibility-score.js --- 2644-find-the-maximum-divisibility-score.js | 24 +++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2644-find-the-maximum-divisibility-score.js diff --git a/2644-find-the-maximum-divisibility-score.js b/2644-find-the-maximum-divisibility-score.js new file mode 100644 index 00000000..78832000 --- /dev/null +++ b/2644-find-the-maximum-divisibility-score.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @param {number[]} divisors + * @return {number} + */ +var maxDivScore = function(nums, divisors) { + divisors.sort((a, b) => a - b) + nums.sort((a, b) => a - b) + + let arr = [], ma = 0 + for(let i = 0; i < divisors.length; i++) { + const div = divisors[i] + let cnt = 0 + for(let j = 0; j < nums.length; j++) { + if(nums[j] % div === 0) cnt++ + } + arr[i] = cnt + ma = Math.max(ma, cnt) + } + + for(let i = 0; i < divisors.length; i++) { + if(arr[i] === ma) return divisors[i] + } +}; From fc170d70cb665a4f00e0f2de63b9968f6688345f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Apr 2023 12:17:55 +0800 Subject: [PATCH 1269/2039] Create 2645-minimum-additions-to-make-valid-string.js --- ...-minimum-additions-to-make-valid-string.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2645-minimum-additions-to-make-valid-string.js diff --git a/2645-minimum-additions-to-make-valid-string.js b/2645-minimum-additions-to-make-valid-string.js new file mode 100644 index 00000000..7e767f07 --- /dev/null +++ b/2645-minimum-additions-to-make-valid-string.js @@ -0,0 +1,23 @@ +/** + * @param {string} word + * @return {number} + */ +var addMinimum = function(word) { + let pattern = "abc" + let p1 = 0, p2 = 0 + let cnt = 0 + while( p1 < word.length) { + while( p1 < word.length && word[p1] != pattern[p2]) { + p2 = (p2 + 1) % 3 + cnt++ + } + p1++ + p2 = (p2 + 1) % 3 + } + if (p2 == 1) { + cnt += 2 + } else if (p2 == 2) { + cnt += 1 + } + return cnt +}; From 272207dea2457f0bf28eb3ebc08f0b723a46effd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Apr 2023 12:18:35 +0800 Subject: [PATCH 1270/2039] Create 2646-minimize-the-total-price-of-the-trips.js --- 2646-minimize-the-total-price-of-the-trips.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2646-minimize-the-total-price-of-the-trips.js diff --git a/2646-minimize-the-total-price-of-the-trips.js b/2646-minimize-the-total-price-of-the-trips.js new file mode 100644 index 00000000..52600ad8 --- /dev/null +++ b/2646-minimize-the-total-price-of-the-trips.js @@ -0,0 +1,51 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} price + * @param {number[][]} trips + * @return {number} + */ +var minimumTotalPrice = function (n, edges, price, trips) { + const graph = [] + const { min, max } = Math + for (const [u, v] of edges) { + if (graph[u] == null) graph[u] = [] + if (graph[v] == null) graph[v] = [] + graph[u].push(v) + graph[v].push(u) + } + + const cnt = Array(n).fill(0) + + function dfs(p, i, e) { + if (i == e) { + ++cnt[i] + return true + } + for (const j of graph[i] || []) { + if (j != p && dfs(i, j, e)) { + ++cnt[i] + return true + } + } + return false + } + + for (const t of trips) dfs(-1, t[0], t[1]) + + const dp = Array.from({ length: n }, () => Array(2).fill(Infinity)) + + function minCost(pre, i, status) { + if (dp[i][status] == Infinity) { + dp[i][status] = (price[i] >> status) * cnt[i] + for (const j of graph[i] || []) { + if (j == pre) continue + if (status == 1) dp[i][status] += minCost(i, j, 0) + else dp[i][status] += min(minCost(i, j, 0), minCost(i, j, 1)) + } + } + return dp[i][status] + } + + return min(minCost(-1, 0, 0), minCost(-1, 0, 1)) +} From fb7504d55e12276b50a218f29fa350da9e4092bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Apr 2023 20:37:39 +0800 Subject: [PATCH 1271/2039] Update 1655-distribute-repeating-integers.js --- 1655-distribute-repeating-integers.js | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/1655-distribute-repeating-integers.js b/1655-distribute-repeating-integers.js index 679d1fc2..201a7fad 100644 --- a/1655-distribute-repeating-integers.js +++ b/1655-distribute-repeating-integers.js @@ -1,3 +1,4 @@ + /** * @param {number[]} nums * @param {number[]} quantity @@ -9,13 +10,13 @@ const canDistribute = function(nums, quantity) { freq.set(e, (freq.get(e) || 0) + 1) } const cntArr = [...freq.values()] - const dp = Array.from({ length: 51 }, () => Array(1024).fill(false)) - const n = cntArr.length, m = quantity.length + const n = cntArr.length, m = quantity.length, limit = 1 << m + const dp = Array.from({ length: n + 1 }, () => Array(limit).fill(false)) for(let i = 0; i < n; i++) { dp[i][0] = true } cntArr.unshift(0) - const allMask = (1 << m) - 1 + const allMask = limit - 1 for(let i = 1; i <= n; i++) { for(let mask = 1; mask <= allMask; mask++) { @@ -37,7 +38,7 @@ const canDistribute = function(nums, quantity) { function canSatisfySubset(cnt, subset) { let sum = 0 - for (let i = 0; i < 10; i++) { + for (let i = 0; i < m; i++) { if(subset & (1 << i)) { sum += quantity[i] } From 245f37713471aebc67b50e92c26c5e4c635aa176 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 Apr 2023 15:34:48 +0800 Subject: [PATCH 1272/2039] Update 1986-minimum-number-of-work-sessions-to-finish-the-tasks.js --- ...er-of-work-sessions-to-finish-the-tasks.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js b/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js index 2b5b5758..a3237bb6 100644 --- a/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js +++ b/1986-minimum-number-of-work-sessions-to-finish-the-tasks.js @@ -1,3 +1,36 @@ +/** + * @param {number[]} tasks + * @param {number} sessionTime + * @return {number} + */ +const minSessions = function(tasks, sessionTime) { + const n = tasks.length + const limit = 1 << n + + const dp = Array(limit).fill(Infinity) + dp[0] = 0 + for(let mask = 1; mask < limit; mask++) { + for(let sub = mask; sub; sub = (sub - 1) & mask) { + if(valid(sub)) { + dp[mask] = Math.min(dp[mask], dp[mask - sub] + 1) + } + } + } + + return dp[limit - 1] + + function valid(sub) { + let sum = 0 + for(let i = 0; i < 14; i++) { + if((sub >> i) & 1) sum += tasks[i] + } + + return sum <= sessionTime + } +}; + +// another + /** * @param {number[]} tasks * @param {number} sessionTime From 0f93d9fe54fff71902d49c1f6b89e669dfd9584c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Apr 2023 11:43:07 +0800 Subject: [PATCH 1273/2039] Update 2152-minimum-number-of-lines-to-cover-points.js --- ...minimum-number-of-lines-to-cover-points.js | 80 +++++++++---------- 1 file changed, 36 insertions(+), 44 deletions(-) diff --git a/2152-minimum-number-of-lines-to-cover-points.js b/2152-minimum-number-of-lines-to-cover-points.js index 8c0878b4..78453f54 100644 --- a/2152-minimum-number-of-lines-to-cover-points.js +++ b/2152-minimum-number-of-lines-to-cover-points.js @@ -3,56 +3,48 @@ * @return {number} */ const minimumLines = function(points) { - const n = points.length; - const connects = Array.from({ length: n }, () => Array(n).fill(0)); - for(let i = 0; i < n; ++i) { - for(let j = i + 1; j < n; ++j) { - connects[i][j] = (1 << i) | (1 << j); - let dx = points[j][0] - points[i][0]; - let dy = points[j][1] - points[i][1]; - for(let k = j + 1; k < n; ++k) { // check if k will be on the line connecting i and j. - let dx2 = points[k][0] - points[i][0]; - let dy2 = points[k][1] - points[i][1]; - if (dx * dy2 == dy * dx2) { - connects[i][j] |= (1 << k); - } - } + const n = points.length + const limit = 1 << n + const dp = Array(limit).fill(n) + dp[0] = 0 + for(let mask = 1; mask < limit; mask++) { + for(let sub = mask; sub; sub = (sub - 1) & mask) { + if(valid(sub)) { + dp[mask] = Math.min(dp[mask], dp[mask - sub] + 1) } + } } - const dp = new Array(1<= n - 2) { // if only 2 points left - dp[mask] = 1; - } else { // if there are more than 2 points, try a line connecting first to second, third, ... - let i = 0; - for(let x = (1 << i); i < n; ++i, x <<= 1) { - if ((mask & x) == 0) { - break; - } - } - for(let j = i + 1, x = (1 << j); j < n; ++j, x <<= 1) { - if ((mask & x) == 0) { - let mask2 = mask | connects[i][j]; - dp[mask] = Math.min(dp[mask], 1 + helper(n, mask2, dp, connects)); - } - } + return dp[limit - 1] + + function valid(sub) { + let res = true + const arr = [] + let idx = 0 + while(sub) { + if(sub & 1) arr.push(idx) + sub = sub >> 1 + idx++ + } + if(arr.length <= 2) return res + for(let i = 2; i < arr.length; i++) { + if(!isSameLine(points[arr[0]], points[arr[1]], points[arr[i]])) { + return false } + } + return res } - return dp[mask]; -} +}; + -function numOfOne(num) { - const str = (num >>> 0).toString(2) +function bitCnt(num) { let res = 0 - for(let ch of str) { - if(ch === '1') res++ + while(num) { + if(num & 1) res++ + num = num >> 1 } return res } +function isSameLine(p1, p2, p3) { + const delta = (p3[1] - p2[1]) * (p2[0] - p1[0]) - (p2[1] - p1[1]) * (p3[0] - p2[0]) + return delta === 0 +} From 4cf0026f066a8970dd43acf7789a2d971f7f9f72 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Apr 2023 11:25:36 +0800 Subject: [PATCH 1274/2039] Update 1879-minimum-xor-sum-of-two-arrays.js --- 1879-minimum-xor-sum-of-two-arrays.js | 36 +++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/1879-minimum-xor-sum-of-two-arrays.js b/1879-minimum-xor-sum-of-two-arrays.js index 0225d947..31c752c9 100644 --- a/1879-minimum-xor-sum-of-two-arrays.js +++ b/1879-minimum-xor-sum-of-two-arrays.js @@ -1,3 +1,39 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const minimumXORSum = function (nums1, nums2) { + const n = nums1.length + const limit = 1 << n + const dp = Array(limit).fill(Infinity) + dp[0] = 0 + for (let mask = 1; mask < limit; ++mask) { + for (let i = 0; i < n; ++i) { + if ((mask >> i) & 1) { + dp[mask] = Math.min( + dp[mask], + dp[mask ^ (1 << i)] + (nums1[bitCnt(mask) - 1] ^ nums2[i]) + ) + } + } + } + return dp[limit - 1] +} + +function bitCnt(num) { + let res = 0 + while (num) { + res++ + num = num & (num - 1) + } + + return res +} + + +// another + /** * @param {number[]} nums1 * @param {number[]} nums2 From e0f3a8e56388caf5c621c032296315c77ad73f40 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 20 Apr 2023 10:03:21 +0800 Subject: [PATCH 1275/2039] Update 1947-maximum-compatibility-score-sum.js --- 1947-maximum-compatibility-score-sum.js | 47 +++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1947-maximum-compatibility-score-sum.js b/1947-maximum-compatibility-score-sum.js index e6148d33..7debdc44 100644 --- a/1947-maximum-compatibility-score-sum.js +++ b/1947-maximum-compatibility-score-sum.js @@ -1,3 +1,50 @@ +/** + * @param {number[][]} students + * @param {number[][]} mentors + * @return {number} + */ +const maxCompatibilitySum = function(students, mentors) { + const m = students.length, n = students[0].length + const limit = 1 << m + const dp = Array(limit).fill(0) + for(let mask = 1; mask < limit; mask++) { + for(let i = 0; i < m; i++) { + if(mask & (1 << i)) { + dp[mask] = Math.max( + dp[mask], + dp[mask ^ (1 << i)] + calc(bitCnt(mask) - 1, i) + ) + } + } + } + + + return dp[limit - 1] + + function bitCnt(num) { + let res = 0 + while(num) { + num = num & (num - 1) + res++ + } + + return res + } + // student, mentor + function calc(i, j) { + let res = 0 + for(let k = 0; k < n; k++) { + if(students[i][k] === mentors[j][k]) { + res++ + } + } + + return res + } +}; + +// another + /** * @param {number[][]} students * @param {number[][]} mentors From a6fdb0a9bff9e1c4c743c5e5cb6a9b1946dea2c9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Apr 2023 11:42:30 +0800 Subject: [PATCH 1276/2039] Update 1066-campus-bikes-ii.js --- 1066-campus-bikes-ii.js | 48 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/1066-campus-bikes-ii.js b/1066-campus-bikes-ii.js index ddf46b3d..8b536b6d 100644 --- a/1066-campus-bikes-ii.js +++ b/1066-campus-bikes-ii.js @@ -1,3 +1,51 @@ +/** + * @param {number[][]} workers + * @param {number[][]} bikes + * @return {number} + */ +const assignBikes = function(workers, bikes) { + const { abs, min } = Math + const n = workers.length, m = bikes.length + + const limit = 1 << m + const dp = Array(limit).fill(Infinity) + dp[0] = 0 + let res = Infinity + for(let mask = 1; mask < limit; mask++) { + if(bitCnt(mask) > n) continue + for(let i = 0; i < m; i++) { + if((mask >> i) & 1) { + dp[mask] = min( + dp[mask], + dp[mask ^ (1 << i)] + distance(bitCnt(mask) - 1, i) + ) + } + } + if(bitCnt(mask) === n) { + res = min(res, dp[mask]) + } + } + + return res + + function bitCnt(num) { + let res = 0 + while(num) { + num = num & (num - 1) + res++ + } + + return res + } + + // worker, bike + function distance(i, j) { + return abs(workers[i][0] - bikes[j][0]) + abs(workers[i][1] - bikes[j][1]) + } +}; + +// another + /** * @param {number[][]} workers * @param {number[][]} bikes From 83a3c3efea80f4ab8a946d2221722bd84b325901 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Apr 2023 16:16:09 +0800 Subject: [PATCH 1277/2039] Create 875-koko-eating-bananas.js --- 875-koko-eating-bananas.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 875-koko-eating-bananas.js diff --git a/875-koko-eating-bananas.js b/875-koko-eating-bananas.js new file mode 100644 index 00000000..6bb679cd --- /dev/null +++ b/875-koko-eating-bananas.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} piles + * @param {number} h + * @return {number} + */ +const minEatingSpeed = function(piles, h) { + let ma = -1 + for(const e of piles) { + if(e > ma) ma = e + } + + let l = 1, r = ma + + while(l < r) { + const mid = Math.floor((l + r) / 2) + if(valid(mid)) { + r = mid + } else { + l = mid + 1 + } + } + + return l + + function valid(val) { + let res = 0 + for(const e of piles) { + res += Math.ceil(e / val) + } + + return res <= h + } +}; From e021d32d4780d2416cd94c120accc4c8ffbb6ee1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 22 Apr 2023 18:28:20 +0800 Subject: [PATCH 1278/2039] Update 2127-maximum-employees-to-be-invited-to-a-meeting.js --- ...um-employees-to-be-invited-to-a-meeting.js | 58 +++++++++++++++++++ 1 file changed, 58 insertions(+) diff --git a/2127-maximum-employees-to-be-invited-to-a-meeting.js b/2127-maximum-employees-to-be-invited-to-a-meeting.js index bcaa93f1..356bf2f2 100644 --- a/2127-maximum-employees-to-be-invited-to-a-meeting.js +++ b/2127-maximum-employees-to-be-invited-to-a-meeting.js @@ -1,3 +1,61 @@ +/** + * @param {number[]} favorite + * @return {number} + */ +const maximumInvitations = function(favorite) { + const n = favorite.length + const inDegree = Array(n).fill(0) + for(let i = 0; i < n; i++) { + inDegree[favorite[i]]++ + } + + let q = [] + const visited = Array(n).fill(0) + const depth = Array(n).fill(1) + for(let i = 0; i < n; i++) { + if(inDegree[i] === 0) { + q.push(i) + visited[i] = 1 + } + } + + while(q.length) { + const cur = q.shift() + const nxt = favorite[cur] + inDegree[nxt]-- + if(inDegree[nxt] === 0) { + q.push(nxt) + visited[nxt] = 1 + } + depth[nxt] = depth[cur] + 1 + } + + let maxLoopSize = 0 + let twoNodesSize = 0 + const { max } = Math + for(let i = 0; i < n; i++) { + if(visited[i] === 1) continue + let j = i + let cnt = 0 + while(visited[j] === 0) { + cnt++ + visited[j] = 1 + j = favorite[j] + } + + if(cnt > 2) { + maxLoopSize = max(maxLoopSize, cnt) + } else if(cnt === 2) { + twoNodesSize += depth[i] + depth[favorite[i]] + } + } + + + return max(maxLoopSize, twoNodesSize) +}; + +// another + /** * @param {number[]} favorite * @return {number} From 88a2af5122db7dad5fe119560eb57c39565ac64d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 22 Apr 2023 19:01:29 +0800 Subject: [PATCH 1279/2039] Update 2127-maximum-employees-to-be-invited-to-a-meeting.js --- 2127-maximum-employees-to-be-invited-to-a-meeting.js | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/2127-maximum-employees-to-be-invited-to-a-meeting.js b/2127-maximum-employees-to-be-invited-to-a-meeting.js index 356bf2f2..8a8efe69 100644 --- a/2127-maximum-employees-to-be-invited-to-a-meeting.js +++ b/2127-maximum-employees-to-be-invited-to-a-meeting.js @@ -5,6 +5,7 @@ const maximumInvitations = function(favorite) { const n = favorite.length const inDegree = Array(n).fill(0) + const { max } = Math for(let i = 0; i < n; i++) { inDegree[favorite[i]]++ } @@ -16,23 +17,24 @@ const maximumInvitations = function(favorite) { if(inDegree[i] === 0) { q.push(i) visited[i] = 1 + depth[i] = 1 } } while(q.length) { - const cur = q.shift() + const cur = q.pop() const nxt = favorite[cur] inDegree[nxt]-- if(inDegree[nxt] === 0) { q.push(nxt) visited[nxt] = 1 } - depth[nxt] = depth[cur] + 1 + depth[nxt] = max(depth[nxt], depth[cur] + 1) } - + let maxLoopSize = 0 let twoNodesSize = 0 - const { max } = Math + for(let i = 0; i < n; i++) { if(visited[i] === 1) continue let j = i @@ -50,7 +52,6 @@ const maximumInvitations = function(favorite) { } } - return max(maxLoopSize, twoNodesSize) }; From aa2cb91856b1ff2634e50c0ff797f013ac4132bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Apr 2023 12:32:43 +0800 Subject: [PATCH 1280/2039] Create 2653-sliding-subarray-beauty.js --- 2653-sliding-subarray-beauty.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2653-sliding-subarray-beauty.js diff --git a/2653-sliding-subarray-beauty.js b/2653-sliding-subarray-beauty.js new file mode 100644 index 00000000..89080175 --- /dev/null +++ b/2653-sliding-subarray-beauty.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} x + * @return {number[]} + */ +const getSubarrayBeauty = function(nums, k, x) { + let counter = Array(50).fill(0), ans = new Array(nums.length - k + 1).fill(0); + for (let i = 0; i < nums.length; i++) { + if (nums[i] < 0) counter[nums[i] + 50]++; + if (i - k >= 0 && nums[i - k] < 0) counter[nums[i - k] + 50]--; + if (i - k + 1 < 0) continue; + let count = 0; + for (let j = 0; j < 50; j++) { + count += counter[j]; + if (count >= x) { + ans[i - k + 1] = j - 50; + break; + } + } + } + return ans; +}; From 1bb16b89858e8299226657c1529242f77744cf5d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Apr 2023 12:36:43 +0800 Subject: [PATCH 1281/2039] Create 2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.js --- ...s-to-make-all-array-elements-equal-to-1.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.js diff --git a/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.js b/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.js new file mode 100644 index 00000000..498f4da2 --- /dev/null +++ b/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minOperations = function(nums) { + let n = nums.length; + + let ones = cntOnes(); + if (ones) return n - ones; + + for (let r = 2; r <= n; r++) { + for (let i = 0; i + r <= n; i++) { + let g = 0; + for (let j = i; j < i + r; j++) g = gcd(g, nums[j]); + if (g == 1) return r - 1 + n - 1; + } + } + + return -1; + + function cntOnes() { + let res = 0 + for(const e of nums) { + if(e === 1) res++ + } + return res + } + function gcd(a, b) { + return b ? gcd(b, a % b) : a + } +}; From 94719d496e51d1c13214ca434b83f36111a43bad Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Apr 2023 12:42:05 +0800 Subject: [PATCH 1282/2039] Create 2652-sum-multiples.js --- 2652-sum-multiples.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2652-sum-multiples.js diff --git a/2652-sum-multiples.js b/2652-sum-multiples.js new file mode 100644 index 00000000..e135636d --- /dev/null +++ b/2652-sum-multiples.js @@ -0,0 +1,25 @@ +/** + * @param {number} n + * @return {number} + */ +const sumOfMultiples = function(n) { + let res = 0 + const set = new Set() + for(let i = 3; i <= n; i += 3) { + set.add(i) + } + + for(let i = 5; i <= n; i += 5) { + set.add(i) + } + + for(let i = 7; i <= n; i += 7) { + set.add(i) + } + + for(const e of set) { + res += e + } + + return res +}; From e98dc390addbdc90aada4bb1613d26bbbaddc44c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Apr 2023 12:42:42 +0800 Subject: [PATCH 1283/2039] Create 2651-calculate-delayed-arrival-time.js --- 2651-calculate-delayed-arrival-time.js | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 2651-calculate-delayed-arrival-time.js diff --git a/2651-calculate-delayed-arrival-time.js b/2651-calculate-delayed-arrival-time.js new file mode 100644 index 00000000..e30c44e6 --- /dev/null +++ b/2651-calculate-delayed-arrival-time.js @@ -0,0 +1,8 @@ +/** + * @param {number} arrivalTime + * @param {number} delayedTime + * @return {number} + */ +var findDelayedArrivalTime = function(arrivalTime, delayedTime) { + return (arrivalTime + delayedTime) % 24 +}; From 85f8a4dd8bf97d765802c228cdae27216340444a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Apr 2023 13:54:01 +0800 Subject: [PATCH 1284/2039] Create 2172-maximum-and-sum-of-array.js --- 2172-maximum-and-sum-of-array.js | 42 ++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2172-maximum-and-sum-of-array.js diff --git a/2172-maximum-and-sum-of-array.js b/2172-maximum-and-sum-of-array.js new file mode 100644 index 00000000..02ca3260 --- /dev/null +++ b/2172-maximum-and-sum-of-array.js @@ -0,0 +1,42 @@ +/** + * @param {number[]} nums + * @param {number} numSlots + * @return {number} + */ +const maximumANDSum = function (nums, numSlots) { + const n = nums.length + nums.unshift(0) + const m = Math.pow(3, numSlots) + + const dp = Array.from({ length: n + 1 }, () => Array(m).fill(-Infinity)) + dp[0][0] = 0 + + let ret = 0 + + for (let state = 1; state < m; state++) { + let i = 0 + let temp = state + while (temp > 0) { + i += temp % 3 + temp = Math.floor(temp / 3) + } + if (i > n) continue + + for (let j = 0; j < numSlots; j++) { + if (filled(state, j) >= 1) { + dp[i][state] = Math.max( + dp[i][state], + dp[i - 1][state - Math.pow(3, j)] + (nums[i] & (j + 1)) + ) + } + } + if (i === n) ret = Math.max(ret, dp[i][state]) + } + + return ret +} + +function filled(state, k) { + for (let i = 0; i < k; i++) state = Math.floor(state / 3) + return state % 3 +} From 9be65f0be80b79e177394ad8947472b5c345b48e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Apr 2023 14:20:10 +0800 Subject: [PATCH 1285/2039] Create 2619-array-prototype-last.js --- 2619-array-prototype-last.js | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 2619-array-prototype-last.js diff --git a/2619-array-prototype-last.js b/2619-array-prototype-last.js new file mode 100644 index 00000000..acd8a636 --- /dev/null +++ b/2619-array-prototype-last.js @@ -0,0 +1,8 @@ +Array.prototype.last = function() { + return this.at(-1) ?? -1 +}; + +/** + * const arr = [1, 2, 3]; + * arr.last(); // 3 + */ From 98fe4174fbfc3f33b1bd13c700bb414910e3b391 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Apr 2023 09:55:30 +0800 Subject: [PATCH 1286/2039] Update 1595-minimum-cost-to-connect-two-groups-of-points.js --- ...um-cost-to-connect-two-groups-of-points.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1595-minimum-cost-to-connect-two-groups-of-points.js b/1595-minimum-cost-to-connect-two-groups-of-points.js index 900ec1dc..48f9f7f0 100644 --- a/1595-minimum-cost-to-connect-two-groups-of-points.js +++ b/1595-minimum-cost-to-connect-two-groups-of-points.js @@ -1,3 +1,50 @@ +/** + * @param {number[][]} cost + * @return {number} + */ +const connectTwoGroups = function(cost) { + const m = cost.length, n = cost[0].length, { min } = Math + const limit = 1 << n + const dp = Array.from({ length: m + 1 }, () => Array(limit).fill(Infinity)) + const minCost = Array.from({ length: m + 1 }, () => Array(limit).fill(Infinity)) + + for(let i = 0; i < m; i++) { + for(let mask = 0; mask < limit; mask++) { + let sum = 0 + for(let j = 0; j < n; j++) { + if((mask >> j) & 1) { + sum += cost[i][j] + } + } + + minCost[i][mask] = sum + } + } + + dp[0][0] = 0 + for(let i = 1; i <= m; i++) { + for(let mask = 0; mask < limit; mask++) { + for(let sub = mask; sub; sub = (sub - 1) & mask) { + dp[i][mask] = min( + dp[i][mask], + dp[i - 1][mask - sub] + minCost[i - 1][sub] + ) + } + let tmp = Infinity + for(let j = 0; j < n; j++) { + tmp = min(tmp, cost[i - 1][j]) + } + + dp[i][mask] = min(dp[i][mask], dp[i - 1][mask] + tmp) + } + } + // console.log(dp) + return dp[m][limit - 1] +}; + +// another + + /** * @param {number[][]} cost * @return {number} From 8bf7d93421e7fca6cb2edaebc629be90b3b2620d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 24 Apr 2023 10:04:40 +0800 Subject: [PATCH 1287/2039] Update 1595-minimum-cost-to-connect-two-groups-of-points.js --- 1595-minimum-cost-to-connect-two-groups-of-points.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/1595-minimum-cost-to-connect-two-groups-of-points.js b/1595-minimum-cost-to-connect-two-groups-of-points.js index 48f9f7f0..43e3d060 100644 --- a/1595-minimum-cost-to-connect-two-groups-of-points.js +++ b/1595-minimum-cost-to-connect-two-groups-of-points.js @@ -6,7 +6,7 @@ const connectTwoGroups = function(cost) { const m = cost.length, n = cost[0].length, { min } = Math const limit = 1 << n const dp = Array.from({ length: m + 1 }, () => Array(limit).fill(Infinity)) - const minCost = Array.from({ length: m + 1 }, () => Array(limit).fill(Infinity)) + const subCost = Array.from({ length: m + 1 }, () => Array(limit).fill(Infinity)) for(let i = 0; i < m; i++) { for(let mask = 0; mask < limit; mask++) { @@ -17,7 +17,7 @@ const connectTwoGroups = function(cost) { } } - minCost[i][mask] = sum + subCost[i][mask] = sum } } @@ -27,7 +27,7 @@ const connectTwoGroups = function(cost) { for(let sub = mask; sub; sub = (sub - 1) & mask) { dp[i][mask] = min( dp[i][mask], - dp[i - 1][mask - sub] + minCost[i - 1][sub] + dp[i - 1][mask - sub] + subCost[i - 1][sub] ) } let tmp = Infinity From e43fd5d75636dce6135d4f5c3bfad6d6f9487f45 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 Apr 2023 12:33:06 +0800 Subject: [PATCH 1288/2039] Create 2397-maximum-rows-covered-by-columns.js --- 2397-maximum-rows-covered-by-columns.js | 44 +++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 2397-maximum-rows-covered-by-columns.js diff --git a/2397-maximum-rows-covered-by-columns.js b/2397-maximum-rows-covered-by-columns.js new file mode 100644 index 00000000..2bf39ffe --- /dev/null +++ b/2397-maximum-rows-covered-by-columns.js @@ -0,0 +1,44 @@ +/** + * @param {number[][]} matrix + * @param {number} numSelect + * @return {number} + */ +const maximumRows = function(matrix, numSelect) { + const m = matrix.length, n = matrix[0].length + const limit = 1 << n + + let res = 0 + + for(let mask = 1; mask < limit; mask++) { + if(bitCnt(mask) > numSelect) continue + const set = new Set() + for(let i = 0; i < n; i++) { + if(mask & (1 << i)) { + set.add(n - 1 - i) + } + } + let num = 0 + for(let i = 0; i < m; i++) { + let mark = true + for(let j = 0; j < n; j++) { + if(matrix[i][j] === 1 && !set.has(j)) { + mark = false + break + } + } + if(mark) num++ + } + res = Math.max(res, num) + } + + return res + + function bitCnt(num) { + let res = 0 + while(num) { + num = num & (num - 1) + res++ + } + return res + } +}; From 06c7bc2affe2d0f951de05a92949f3d2b0e67f30 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 Apr 2023 12:48:22 +0800 Subject: [PATCH 1289/2039] Update 2397-maximum-rows-covered-by-columns.js --- 2397-maximum-rows-covered-by-columns.js | 10 ++-------- 1 file changed, 2 insertions(+), 8 deletions(-) diff --git a/2397-maximum-rows-covered-by-columns.js b/2397-maximum-rows-covered-by-columns.js index 2bf39ffe..8d2e4f5d 100644 --- a/2397-maximum-rows-covered-by-columns.js +++ b/2397-maximum-rows-covered-by-columns.js @@ -11,17 +11,11 @@ const maximumRows = function(matrix, numSelect) { for(let mask = 1; mask < limit; mask++) { if(bitCnt(mask) > numSelect) continue - const set = new Set() - for(let i = 0; i < n; i++) { - if(mask & (1 << i)) { - set.add(n - 1 - i) - } - } let num = 0 for(let i = 0; i < m; i++) { let mark = true - for(let j = 0; j < n; j++) { - if(matrix[i][j] === 1 && !set.has(j)) { + for(let j = n - 1; j >= 0; j--) { + if(matrix[i][j] === 1 && (mask & (1 << j)) === 0) { mark = false break } From a8e2a5047a8b1c8e273752eb3a66c821d76389e7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Apr 2023 10:59:42 +0800 Subject: [PATCH 1290/2039] Update 320-generalized-abbreviation.js --- 320-generalized-abbreviation.js | 34 +++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/320-generalized-abbreviation.js b/320-generalized-abbreviation.js index 016c0045..b8fc1b48 100644 --- a/320-generalized-abbreviation.js +++ b/320-generalized-abbreviation.js @@ -11,6 +11,40 @@ Output: */ +/** + * @param {string} word + * @return {string[]} + */ +const generateAbbreviations = function(word) { + const n = word.length + const limit = 1 << n + const res = [] + + for(let mask = 0; mask < limit; mask++) { + res.push(helper(word, mask)) + } + + return res + + function helper(word, mask) { + let res = '', zero = 0, idx = 0 + for(let i = 0; i < n; i++) { + if(mask & (1 << i)) { + if(zero) res += zero + res += word[i] + zero = 0 + } else { + zero++ + } + if(i === n - 1 && zero) res += zero + } + + return res + } +}; + +// another + /** * @param {string} word * @return {string[]} From 4a0a99bf4ea367c8dba3ea7c1f7edb3a505644c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Apr 2023 16:04:46 +0800 Subject: [PATCH 1291/2039] Create 2626-array-reduce-transformation.js --- 2626-array-reduce-transformation.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2626-array-reduce-transformation.js diff --git a/2626-array-reduce-transformation.js b/2626-array-reduce-transformation.js new file mode 100644 index 00000000..cfc6ea20 --- /dev/null +++ b/2626-array-reduce-transformation.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @param {Function} fn + * @param {number} init + * @return {number} + */ +const reduce = function(nums, fn, init) { + let res = init + + for(let i = 0; i < nums.length; i++) { + res = fn(res, nums[i]) + } + + return res +}; From b7b9bae155d0957bf7dfb996a81cb9039bcd9a33 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Apr 2023 16:08:24 +0800 Subject: [PATCH 1292/2039] Create 2627-debounce.js --- 2627-debounce.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2627-debounce.js diff --git a/2627-debounce.js b/2627-debounce.js new file mode 100644 index 00000000..15d16dfb --- /dev/null +++ b/2627-debounce.js @@ -0,0 +1,21 @@ +/** + * @param {Function} fn + * @param {number} t milliseconds + * @return {Function} + */ +const debounce = function(fn, t) { + let timer = null + return function(...args) { + clearTimeout(timer) + timer = setTimeout(() => { + fn(...args) + }, t) + } +}; + +/** + * const log = debounce(console.log, 100); + * log('Hello'); // cancelled + * log('Hello'); // cancelled + * log('Hello'); // Logged at t=100ms + */ From e3539482ef4509f68bf94357e6c28d94d8e21f52 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Apr 2023 16:11:48 +0800 Subject: [PATCH 1293/2039] Create 2632-curry.js --- 2632-curry.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2632-curry.js diff --git a/2632-curry.js b/2632-curry.js new file mode 100644 index 00000000..10272274 --- /dev/null +++ b/2632-curry.js @@ -0,0 +1,16 @@ +/** + * @param {Function} fn + * @return {Function} + */ +const curry = function(fn) { + return function curried(...args) { + if(args.length >= fn.length) return fn(...args) + return (...params) => curried(...args, ...params) + }; +}; + +/** + * function sum(a, b) { return a + b; } + * const csum = curry(sum); + * csum(1)(2) // 3 + */ From 9b39c5709dcf699e4772576b9246ee999b0c3e4b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Apr 2023 12:03:53 +0800 Subject: [PATCH 1294/2039] Create 2381-shifting-letters-ii.js --- 2381-shifting-letters-ii.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2381-shifting-letters-ii.js diff --git a/2381-shifting-letters-ii.js b/2381-shifting-letters-ii.js new file mode 100644 index 00000000..630d5b58 --- /dev/null +++ b/2381-shifting-letters-ii.js @@ -0,0 +1,26 @@ +/** + * @param {string} s + * @param {number[][]} shifts + * @return {string} + */ +const shiftingLetters = function(s, shifts) { + const n = s.length + const arr = Array(n + 1).fill(0) + const a = 'a'.charCodeAt(0) + const chToCode = ch => ch.charCodeAt(0) + const codeToCh = code => String.fromCharCode(code) + for(const [s, e, d] of shifts) { + const delta = d === 1 ? 1 : -1 + arr[s] += delta + arr[e + 1] -= delta + } + for(let i = 1; i < n + 1; i++) { + arr[i] = arr[i - 1] + arr[i] + } + const codes = s.split('').map(e => chToCode(e)) + for(let i = 0; i < n; i++) { + codes[i] += arr[i] + codes[i] = a + (codes[i] - a + 26 * n) % 26 + } + return codes.map(c => codeToCh(c)).join('') +}; From de82905c3c7f63f297b40935ce30402973603f76 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Apr 2023 13:55:27 +0800 Subject: [PATCH 1295/2039] Create 2636-promise-pool.js --- 2636-promise-pool.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2636-promise-pool.js diff --git a/2636-promise-pool.js b/2636-promise-pool.js new file mode 100644 index 00000000..0c86a9cb --- /dev/null +++ b/2636-promise-pool.js @@ -0,0 +1,29 @@ +/** + * @param {Function[]} functions + * @param {number} n + * @return {Function} + */ +const promisePool = async function(functions, n) { + const it = functions[Symbol.iterator]() + + const add = async () => { + const { value, done } = it.next() + if(value) { + await value() + await add() + } + } + + const arr = [] + for(let i = 0; i < n; i++) { + arr.push(add()) + } + + return Promise.all(arr) +}; + +/** + * const sleep = (t) => new Promise(res => setTimeout(res, t)); + * promisePool([() => sleep(500), () => sleep(400)], 1) + * .then(console.log) // After 900ms + */ From 5fe28f890405db45c51eab0da7b1319418d54bfa Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Apr 2023 14:29:18 +0800 Subject: [PATCH 1296/2039] Create 2630-memoize-ii.js --- 2630-memoize-ii.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2630-memoize-ii.js diff --git a/2630-memoize-ii.js b/2630-memoize-ii.js new file mode 100644 index 00000000..2ddb7868 --- /dev/null +++ b/2630-memoize-ii.js @@ -0,0 +1,36 @@ +const RES = Symbol("result"); +/** + * @param {Function} fn + */ +function memoize(fn) { + const globalCache = new Map(); + + return (...params) => { + let currentCache = globalCache; + for(const param of params) { + if (!currentCache.has(param)) { + currentCache.set(param, new Map()); + } + currentCache = currentCache.get(param); + } + + if (currentCache.has(RES)) return currentCache.get(RES); + + const result = fn(...params); + + currentCache.set(RES, result); + return result; + } +} + + +/** + * let callCount = 0; + * const memoizedFn = memoize(function (a, b) { + * callCount += 1; + * return a + b; + * }) + * memoizedFn(2, 3) // 5 + * memoizedFn(2, 3) // 5 + * console.log(callCount) // 1 + */ From 51b6a4dda0858c8ef772c2f855b4f245dddcbfe1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Apr 2023 14:35:06 +0800 Subject: [PATCH 1297/2039] Update 2630-memoize-ii.js --- 2630-memoize-ii.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/2630-memoize-ii.js b/2630-memoize-ii.js index 2ddb7868..93519d2b 100644 --- a/2630-memoize-ii.js +++ b/2630-memoize-ii.js @@ -1,4 +1,4 @@ -const RES = Symbol("result"); +const RES = Symbol("res"); /** * @param {Function} fn */ From e2561e49aa6d958f4d3779631c7914c7e2c1b568 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 28 Apr 2023 11:09:07 +0800 Subject: [PATCH 1298/2039] Update 2584-split-the-array-to-make-coprime-products.js --- ...split-the-array-to-make-coprime-products.js | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/2584-split-the-array-to-make-coprime-products.js b/2584-split-the-array-to-make-coprime-products.js index da1f0171..2e438d82 100644 --- a/2584-split-the-array-to-make-coprime-products.js +++ b/2584-split-the-array-to-make-coprime-products.js @@ -2,20 +2,20 @@ * @param {number[]} nums * @return {number} */ -var findValidSplit = function(nums) { - let n = nums.length, right = {}; +const findValidSplit = function(nums) { + const n = nums.length, right = {}; for (let i = 0; i < n; i++) { - let primeFactorsCount = getPrimeFactors(nums[i]); + const primeFactorsCount = getPrimeFactors(nums[i]); for (let prime in primeFactorsCount) { - let count = primeFactorsCount[prime]; + const count = primeFactorsCount[prime]; right[prime] = (right[prime] || 0) + count; } } - let left = {}, common = new Set(); + const left = {}, common = new Set(); for (let i = 0; i <= n - 2; i++) { - let primesFactorsCount = getPrimeFactors(nums[i]); - for (let prime in primesFactorsCount) { - let count = primesFactorsCount[prime]; + const primesFactorsCount = getPrimeFactors(nums[i]); + for (const prime in primesFactorsCount) { + const count = primesFactorsCount[prime]; left[prime] = (left[prime] || 0) + count; right[prime] -= count; if (right[prime] > 0) common.add(prime); @@ -27,7 +27,7 @@ var findValidSplit = function(nums) { }; function getPrimeFactors(n) { - let counts = {}; + const counts = {}; for (let x = 2; (x * x) <= n; x++) { while (n % x === 0) { counts[x] = (counts[x] || 0) + 1; From 0fcff71e8ab3fa830cdfba921d0fbe1df9f16927 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 28 Apr 2023 13:54:06 +0800 Subject: [PATCH 1299/2039] Update 2584-split-the-array-to-make-coprime-products.js --- ...plit-the-array-to-make-coprime-products.js | 69 +++++++++++++++++++ 1 file changed, 69 insertions(+) diff --git a/2584-split-the-array-to-make-coprime-products.js b/2584-split-the-array-to-make-coprime-products.js index 2e438d82..3d148bc2 100644 --- a/2584-split-the-array-to-make-coprime-products.js +++ b/2584-split-the-array-to-make-coprime-products.js @@ -37,3 +37,72 @@ function getPrimeFactors(n) { if (n > 1) counts[n] = (counts[n] || 0) + 1; return counts; } + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const findValidSplit = function (nums) { + const map = new Map() + const n = nums.length + const max = Math.max(...nums) + const primes = Eratosthenes(max) + + for (let i = 0; i < n; i++) { + let x = nums[i] + for (const p of primes) { + if (p * p > x && x > 1) { + if (!map.has(x)) { + map.set(x, [i, i]) + } + map.get(x)[1] = i + break + } + + if (x % p === 0) { + if (!map.has(p)) { + map.set(p, [i, i]) + } + const a = map.get(p) + a[1] = i + } + while (x % p === 0) x = x / p + } + } + + const diff = Array(n + 1).fill(0) + for (const [k, v] of map) { + const [s, e] = v + // if(s === e) continue + diff[s] += 1 + diff[e] -= 1 + } + // console.log(diff) + let sum = 0 + for (let i = 0; i < n - 1; i++) { + sum += diff[i] + if (sum === 0) return i + } + + return -1 +} + +function Eratosthenes(n) { + const q = Array(n + 1).fill(0) + const primes = [] + for (let i = 2; i <= Math.sqrt(n); i++) { + if (q[i] == 1) continue + let j = i * 2 + while (j <= n) { + q[j] = 1 + j += i + } + } + for (let i = 2; i <= n; i++) { + if (q[i] == 0) primes.push(i) + } + return primes +} + From 541ab0a408d5f09606057d337a2915e717e0d340 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 29 Apr 2023 20:48:44 +0800 Subject: [PATCH 1300/2039] Update 2327-number-of-people-aware-of-a-secret.js --- 2327-number-of-people-aware-of-a-secret.js | 29 ++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/2327-number-of-people-aware-of-a-secret.js b/2327-number-of-people-aware-of-a-secret.js index 83cf4e8f..8339fb12 100644 --- a/2327-number-of-people-aware-of-a-secret.js +++ b/2327-number-of-people-aware-of-a-secret.js @@ -1,3 +1,32 @@ +/** + * @param {number} n + * @param {number} delay + * @param {number} forget + * @return {number} + */ +const peopleAwareOfSecret = function(n, delay, forget) { + const dp = Array(n + 1).fill(0) + const mod = 1e9 + 7 + + dp[1] = 1 + for(let i = 1; i <= n; i++) { + for(let j = i + delay; j < i + forget; j++) { + if(j > n) break + dp[j] += dp[i] + dp[j] %= mod + } + } + + let res = 0 + for(let i = n - forget + 1; i <= n; i++) { + res = (dp[i] + res) % mod + } + + return res +}; + +// another + /** * @param {number} n * @param {number} delay From c85b328a56558a172a5b6aa6e26890d8e9bec661 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Apr 2023 12:55:05 +0800 Subject: [PATCH 1301/2039] Create 2660-determine-the-winner-of-a-bowling-game.js --- ...-determine-the-winner-of-a-bowling-game.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2660-determine-the-winner-of-a-bowling-game.js diff --git a/2660-determine-the-winner-of-a-bowling-game.js b/2660-determine-the-winner-of-a-bowling-game.js new file mode 100644 index 00000000..c51e7e18 --- /dev/null +++ b/2660-determine-the-winner-of-a-bowling-game.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} player1 + * @param {number[]} player2 + * @return {number} + */ +var isWinner = function(player1, player2) { + const n = player1.length + let sum1 = 0, sum2 = 0 + // 1 + for(let i = 0; i < n; i++) { + const cur = player1[i] + sum1 += cur + if( (i >= 1 && player1[i - 1] === 10) || (i >= 2 && player1[i - 2] === 10) ) { + sum1 += cur + } + } + + + // 2 + for(let i = 0; i < n; i++) { + const cur = player2[i] + sum2 += cur + if( (i >= 1 && player2[i - 1] === 10) || (i >= 2 && player2[i - 2] === 10) ) { + sum2 += cur + } + } + + return sum1 === sum2 ? 0 : (sum1 > sum2 ? 1 : 2) +}; From 1ab5d0e6b447662b91bfa3189e8ce5bc43e397d9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Apr 2023 12:55:32 +0800 Subject: [PATCH 1302/2039] Create 2661-first-completely-painted-row-or-column.js --- ...-first-completely-painted-row-or-column.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2661-first-completely-painted-row-or-column.js diff --git a/2661-first-completely-painted-row-or-column.js b/2661-first-completely-painted-row-or-column.js new file mode 100644 index 00000000..373ccd52 --- /dev/null +++ b/2661-first-completely-painted-row-or-column.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} arr + * @param {number[][]} mat + * @return {number} + */ +const firstCompleteIndex = function(arr, mat) { + const map = new Map() + const m = mat.length, n = mat[0].length + + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + map.set(mat[i][j], [i, j]) + } + } + + const rows = Array(m).fill(0) + const cols = Array(n).fill(0) + + for(let i = 0; i < m * n; i++) { + const e = arr[i] + const [r, c] = map.get(e) + rows[r]++ + cols[c]++ + // console.log(r, c, rows, cols, m, n) + if(rows[r] === n) return i + if(cols[c] === m) return i + } + +}; From 1f67111e9fd8c26719e281da61b81d9c85113d3b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Apr 2023 21:31:25 +0800 Subject: [PATCH 1303/2039] Update 253-meeting-rooms-ii.js --- 253-meeting-rooms-ii.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/253-meeting-rooms-ii.js b/253-meeting-rooms-ii.js index 61a6a0db..fb5d5915 100644 --- a/253-meeting-rooms-ii.js +++ b/253-meeting-rooms-ii.js @@ -15,6 +15,27 @@ Output: 1 */ +/** + * @param {number[][]} intervals + * @return {number} + */ +const minMeetingRooms = function(intervals) { + const arr = Array(1e6 + 2).fill(0) + for(const [s, e] of intervals) { + arr[s]++ + arr[e]-- + } + let res = arr[0] + for(let i = 1; i < arr.length; i++) { + arr[i] += arr[i - 1] + res = Math.max(res, arr[i]) + } + + return res +}; + +// another + /** * @param {number[][]} intervals * @return {number} From 447cf7165648ff1147401e3b664e5ff73bf873b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Apr 2023 21:52:12 +0800 Subject: [PATCH 1304/2039] Create 2662-minimum-cost-of-a-path-with-special-roads.js --- ...nimum-cost-of-a-path-with-special-roads.js | 127 ++++++++++++++++++ 1 file changed, 127 insertions(+) create mode 100644 2662-minimum-cost-of-a-path-with-special-roads.js diff --git a/2662-minimum-cost-of-a-path-with-special-roads.js b/2662-minimum-cost-of-a-path-with-special-roads.js new file mode 100644 index 00000000..b1e7bb8c --- /dev/null +++ b/2662-minimum-cost-of-a-path-with-special-roads.js @@ -0,0 +1,127 @@ +/** + * @param {number[]} start + * @param {number[]} target + * @param {number[][]} specialRoads + * @return {number} + */ +var minimumCost = function (start, target, specialRoads) { + const INF = 1e9 + 10 + let n = specialRoads.length + const { abs, min, max } = Math + + // Initialize the distance of each special road to infinity + const d = Array(n).fill(INF) + + // Create a priority queue and push the distance from start to each special road + const pq = new PQ((a, b) => a[0] < b[0]) + for (let i = 0; i < n; i++) { + d[i] = + abs(start[0] - specialRoads[i][0]) + + abs(start[1] - specialRoads[i][1]) + + specialRoads[i][4] + pq.push([d[i], i]) + } + + // Initialize the answer with the manhattan distance between start and target + let ans = abs(start[0] - target[0]) + abs(start[1] - target[1]) + + // Continue to search for the shortest path until the priority queue is empty + while (pq.size()) { + // Pop the pair with smallest distance + let [d_c, c] = pq.pop() + + // If the distance stored in d is not equal to the current distance d_c, skip this node + if (d_c != d[c]) continue + + // Update the answer by finding the distance from the current special road to the target + ans = min( + ans, + d_c + + abs(target[0] - specialRoads[c][2]) + + abs(target[1] - specialRoads[c][3]) + ) + + // For each special road that can be reached from the current special road, update its distance + for (let nxt = 0; nxt < n; nxt++) { + let w = + abs(specialRoads[c][2] - specialRoads[nxt][0]) + + abs(specialRoads[c][3] - specialRoads[nxt][1]) + + specialRoads[nxt][4] + if (d_c + w < d[nxt]) { + d[nxt] = d_c + w + pq.push([d[nxt], nxt]) + } + } + } + + // Return the minimum cost of reaching the target + return ans +} + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From c98b4ac4e51265322747826c9bb8a0f24e49a447 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 May 2023 13:11:09 +0800 Subject: [PATCH 1305/2039] Update 630-course-schedule-iii.js --- 630-course-schedule-iii.js | 93 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 93 insertions(+) diff --git a/630-course-schedule-iii.js b/630-course-schedule-iii.js index c4366e57..b2f0f289 100644 --- a/630-course-schedule-iii.js +++ b/630-course-schedule-iii.js @@ -20,6 +20,99 @@ const scheduleCourse = function (courses) { // another +/** + * @param {number[][]} courses + * @return {number} + */ +const scheduleCourse = function(courses) { + const pq = new PQ((a, b) => a[0] === b[0] ? a[1] < b[1] : a[0] > b[0]) + const n = courses.length + courses.sort((a, b) => a[1] === b[1] ? a[0] - b[0] : a[1] - b[1]) + + let time = 0 + for(const e of courses) { + const [dur, end] = e + time += dur + pq.push(e) + if(time > end) { + const tmp = pq.pop() + time -= tmp[0] + } + } + + return pq.size() +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number[][]} courses From a5869f3447b937a1b42549d8763b91d8071bb134 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 May 2023 13:00:27 +0800 Subject: [PATCH 1306/2039] Update 299-bulls-and-cows.js --- 299-bulls-and-cows.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/299-bulls-and-cows.js b/299-bulls-and-cows.js index 6acc441a..dd67443e 100644 --- a/299-bulls-and-cows.js +++ b/299-bulls-and-cows.js @@ -1,3 +1,28 @@ +/** + * @param {string} secret + * @param {string} guess + * @return {string} + */ +const getHint = function(secret, guess) { + let x = 0, y = 0 + const arr = Array(10).fill(0) + for(let i = 0; i < guess.length; i++) { + const ch = guess[i], e = secret[i] + if(secret[i] === ch) { + x++ + } else { + if(arr[+ch] < 0) y++ + if(arr[+e] > 0) y++ + arr[+ch]++ + arr[+e]-- + } + } + + return `${x}A${y}B` +}; + +// another + /** * @param {string} secret * @param {string} guess From 715d482244929ac93ef7fc28fbbcf7186de28cf1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 May 2023 13:24:08 +0800 Subject: [PATCH 1307/2039] Create 2599-make-the-prefix-sum-non-negative.js --- 2599-make-the-prefix-sum-non-negative.js | 88 ++++++++++++++++++++++++ 1 file changed, 88 insertions(+) create mode 100644 2599-make-the-prefix-sum-non-negative.js diff --git a/2599-make-the-prefix-sum-non-negative.js b/2599-make-the-prefix-sum-non-negative.js new file mode 100644 index 00000000..5025c1ac --- /dev/null +++ b/2599-make-the-prefix-sum-non-negative.js @@ -0,0 +1,88 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const makePrefSumNonNegative = function(nums) { + const pq = new PQ((a, b) => a < b) + let sum = 0, res = 0 + for(const e of nums) { + sum += e + if(e < 0) { + pq.push(e) + if(sum < 0) { + sum -= pq.pop() + res++ + } + } + } + + return res +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From e12aee2764c0ab888847105462fdc435c328f210 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 6 May 2023 12:47:17 +0800 Subject: [PATCH 1308/2039] Update 1801-number-of-orders-in-the-backlog.js --- 1801-number-of-orders-in-the-backlog.js | 109 +++++++++++++----------- 1 file changed, 60 insertions(+), 49 deletions(-) diff --git a/1801-number-of-orders-in-the-backlog.js b/1801-number-of-orders-in-the-backlog.js index b9678076..8e95f7ce 100644 --- a/1801-number-of-orders-in-the-backlog.js +++ b/1801-number-of-orders-in-the-backlog.js @@ -2,64 +2,75 @@ * @param {number[][]} orders * @return {number} */ -const getNumberOfBacklogOrders = function (orders) { - const h0 = new PriorityQueue((a, b) => a[0] > b[0]) - const h1 = new PriorityQueue((a, b) => a[0] < b[0]) - const P = 10 ** 9 + 7 - const { min } = Math - - let i, - j, - i1, - j1, - ans = 0 - for (let c of orders) { - i = c[0] - j = c[1] - if (c[2]) { - while (!h0.isEmpty() && h0.peek()[0] >= i) { - i1 = h0.peek()[0] - j1 = h0.peek()[1] - h0.pop() - if (j > j1) j -= j1 - else { - j1 -= j - j = 0 - if (j1) h0.push([i1, j1]) - break +const getNumberOfBacklogOrders = function(orders) { + const buyPQ = new PQ((a, b) => a[0] > b[0]) + const sellPQ = new PQ((a, b) => a[0] < b[0]) + const mod = 1e9 + 7 + + for(const e of orders) { + const [p, a, o] = e + if(o === 0) { + // buy order + if(sellPQ.isEmpty() || sellPQ.peek()[0] > p) { + buyPQ.push(e) + continue + } + while(!sellPQ.isEmpty() && sellPQ.peek()[0] <= p && e[1]) { + const tmp = sellPQ.peek() + if(e[1] <= tmp[1]) { + tmp[1] -= e[1] + e[1] = 0 + if(tmp[1] === 0) { + sellPQ.pop() + } + } else { + // e[1] > tmp[1] + sellPQ.pop() + e[1] -= tmp[1] } } - if (j) h1.push([i, j]) - } else { - while (!h1.isEmpty() && h1.peek()[0] <= i) { - i1 = h1.peek()[0] - j1 = h1.peek()[1] - h1.pop() - if (j > j1) j -= j1 - else { - j1 -= j - j = 0 - if (j1) h1.push([i1, j1]) - break + if(e[1]) { + buyPQ.push(e) + } + } else if(o === 1) { + // sell order + if(buyPQ.isEmpty() || buyPQ.peek()[0] < p) { + sellPQ.push(e) + continue + } + while(!buyPQ.isEmpty() && buyPQ.peek()[0] >= p && e[1]) { + const tmp = buyPQ.peek() + if(e[1] <= tmp[1]) { + tmp[1] -= e[1] + e[1] = 0 + if(tmp[1] === 0) { + buyPQ.pop() + } + } else { + // e[1] > tmp[1] + buyPQ.pop() + e[1] -= tmp[1] } } - if (j) h0.push([i, j]) + if(e[1]) { + sellPQ.push(e) + } } } - while (!h0.isEmpty()) { - ans += h0.peek()[1] - h0.pop() - if (ans >= P) ans -= P + + let res = 0 + + while(!buyPQ.isEmpty()) { + res = (res + buyPQ.pop()[1]) % mod } - while (!h1.isEmpty()) { - ans += h1.peek()[1] - h1.pop() - if (ans >= P) ans -= P + while(!sellPQ.isEmpty()) { + res = (res + sellPQ.pop()[1]) % mod } - return ans -} + + return res % mod +}; -class PriorityQueue { +class PQ { constructor(comparator = (a, b) => a > b) { this.heap = [] this.top = 0 From 933d48e5503a2ad4b2c8e52d1f7146896e1d1545 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 May 2023 12:01:08 +0800 Subject: [PATCH 1309/2039] Create 2670-find-the-distinct-difference-array.js --- 2670-find-the-distinct-difference-array.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2670-find-the-distinct-difference-array.js diff --git a/2670-find-the-distinct-difference-array.js b/2670-find-the-distinct-difference-array.js new file mode 100644 index 00000000..4148bf6c --- /dev/null +++ b/2670-find-the-distinct-difference-array.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const distinctDifferenceArray = function(nums) { + const res = [] + + for(let i = 0, n = nums.length; i < n; i++) { + const pre = nums.slice(0, i + 1), suf = nums.slice(i + 1) + res[i] = new Set(pre).size - new Set(suf).size + } + + return res +}; From c4d1d7fb92a17057131b1df12d067160dc5099f4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 May 2023 12:01:35 +0800 Subject: [PATCH 1310/2039] Create 2671-frequency-tracker.js --- 2671-frequency-tracker.js | 51 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2671-frequency-tracker.js diff --git a/2671-frequency-tracker.js b/2671-frequency-tracker.js new file mode 100644 index 00000000..74362ddb --- /dev/null +++ b/2671-frequency-tracker.js @@ -0,0 +1,51 @@ +let cnt = {}, freq = {} +var FrequencyTracker = function() { + cnt = {} + freq = {} +}; + +/** + * @param {number} number + * @return {void} + */ +FrequencyTracker.prototype.add = function(number) { + const c = cnt[number] ?? 0 + if(cnt[number] == null) cnt[number] = 0 + if(freq[c] == null) freq[c] = 0 + --freq[cnt[number]]; + if(cnt[number] == null) cnt[number] = 0 + ++cnt[number]; + if(freq[cnt[number]] == null) freq[cnt[number]] = 0 + ++freq[cnt[number]]; +}; + +/** + * @param {number} number + * @return {void} + */ +FrequencyTracker.prototype.deleteOne = function(number) { + if(cnt[number] == null) cnt[number] = 0 + if (cnt[number] > 0) { + if(freq[cnt[number]] == null) freq[cnt[number]] = 0 + --freq[cnt[number]]; + --cnt[number]; + if(freq[cnt[number]] == null) freq[cnt[number]] = 0 + ++freq[cnt[number]]; + } +}; + +/** + * @param {number} frequency + * @return {boolean} + */ +FrequencyTracker.prototype.hasFrequency = function(frequency) { + return freq[frequency] > 0; +}; + +/** + * Your FrequencyTracker object will be instantiated and called as such: + * var obj = new FrequencyTracker() + * obj.add(number) + * obj.deleteOne(number) + * var param_3 = obj.hasFrequency(frequency) + */ From 24436279ee7df7dd0f8b304150f87388a8364d02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 May 2023 12:02:03 +0800 Subject: [PATCH 1311/2039] Create 2672-number-of-adjacent-elements-with-the-same-color.js --- ...f-adjacent-elements-with-the-same-color.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2672-number-of-adjacent-elements-with-the-same-color.js diff --git a/2672-number-of-adjacent-elements-with-the-same-color.js b/2672-number-of-adjacent-elements-with-the-same-color.js new file mode 100644 index 00000000..241889da --- /dev/null +++ b/2672-number-of-adjacent-elements-with-the-same-color.js @@ -0,0 +1,27 @@ +/** + * @param {number} n + * @param {number[][]} queries + * @return {number[]} + */ +var colorTheArray = function(n, queries) { + let color = {}; + let ans = []; + let cnt = 0; + for (const q of queries) { + if (get(color, q[0])!=q[1]) { + if (get(color, q[0])!=0){ + if (get(color, q[0]-1) == get(color, q[0])) --cnt; + if (get(color, q[0]+1) == get(color, q[0])) --cnt; + } + color[q[0]]=q[1]; + if (get(color, q[0]-1) == color[q[0]]) ++cnt; + if (get(color, q[0]+1) == color[q[0]]) ++cnt; + } + ans.push(cnt); + } + return ans; + + function get(hash, key) { + return hash[key] == null ? 0 : hash[key] + } +}; From b99135e4efbb99dbc871ca3f6c91a53eec468c51 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 May 2023 12:02:36 +0800 Subject: [PATCH 1312/2039] Create 2673-make-costs-of-paths-equal-in-a-binary-tree.js --- ...-make-costs-of-paths-equal-in-a-binary-tree.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2673-make-costs-of-paths-equal-in-a-binary-tree.js diff --git a/2673-make-costs-of-paths-equal-in-a-binary-tree.js b/2673-make-costs-of-paths-equal-in-a-binary-tree.js new file mode 100644 index 00000000..fecb6c46 --- /dev/null +++ b/2673-make-costs-of-paths-equal-in-a-binary-tree.js @@ -0,0 +1,15 @@ +/** + * @param {number} n + * @param {number[]} cost + * @return {number} + */ +var minIncrements = function(n, cost) { + let ans = 0; + const {abs, max} = Math + for (let i = n >> 1; i > 0; ) { + let r = i<<1, l = r-1; + ans += abs(cost[l]-cost[r]); + cost[--i] += max(cost[l], cost[r]); + } + return ans; +}; From cb1d152097d32098a7784079e306393951d259b7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 May 2023 12:01:15 +0800 Subject: [PATCH 1313/2039] Update 1882-process-tasks-using-servers.js --- 1882-process-tasks-using-servers.js | 109 ++++++++++++++++++++++++++++ 1 file changed, 109 insertions(+) diff --git a/1882-process-tasks-using-servers.js b/1882-process-tasks-using-servers.js index 311fafc7..db62a07e 100644 --- a/1882-process-tasks-using-servers.js +++ b/1882-process-tasks-using-servers.js @@ -1,3 +1,112 @@ +/** + * @param {number[]} servers + * @param {number[]} tasks + * @return {number[]} + */ +const assignTasks = function(servers, tasks) { + const avail = new PQ((a, b) => a[0] === b[0] ? a[1] < b[1] : a[0] < b[0]) + const busy = new PQ((a, b) => a[2] < b[2]) + const res = [] + const { max } = Math + // init + for(let i = 0, len = servers.length; i < len; i++) { + avail.push([servers[i], i, 0]) + } + + for(let i = 0, len = tasks.length; i < len; i++) { + while(!busy.isEmpty() && busy.peek()[2] <= i) { + const s = busy.pop() + s[2] = i + avail.push(s) + } + if(!avail.isEmpty()) { + const s = avail.pop() + res.push(s[1]) + busy.push([s[0], s[1], max(i, s[2]) + tasks[i]]) + } else { + const tmp = busy.peek() + while(!busy.isEmpty() && busy.peek()[2] === tmp[2]) { + avail.push(busy.pop()) + } + const s = avail.pop() + res.push(s[1]) + busy.push([s[0], s[1], max(i, s[2]) + tasks[i]]) + } + } + + return res +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number[]} servers * @param {number[]} tasks From 3d88f03aa7cbcab9e75fe12c37cdffd16c27a035 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 May 2023 13:29:42 +0800 Subject: [PATCH 1314/2039] Update 1942-the-number-of-the-smallest-unoccupied-chair.js --- ...number-of-the-smallest-unoccupied-chair.js | 105 ++++++++++++++++++ 1 file changed, 105 insertions(+) diff --git a/1942-the-number-of-the-smallest-unoccupied-chair.js b/1942-the-number-of-the-smallest-unoccupied-chair.js index 65b9cd46..aeeafb99 100644 --- a/1942-the-number-of-the-smallest-unoccupied-chair.js +++ b/1942-the-number-of-the-smallest-unoccupied-chair.js @@ -1,3 +1,108 @@ +/** + * @param {number[][]} times + * @param {number} targetFriend + * @return {number} + */ +const smallestChair = function(times, targetFriend) { + const avail = new PQ((a, b) => a[0] < b[0]) + const occupied = new PQ((a, b) => a[1] < b[1]) + const n = times.length + for(let i = 0; i < n; i++) { + avail.push([i, 0]) + } + times.forEach((e, i) => e.push(i)) + times.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + + for(let i = 0; i < n; i++) { + let res = -1 + const [s, e, idx] = times[i] + while(!occupied.isEmpty() && occupied.peek()[1] <= s) { + const tmp = occupied.pop() + tmp[1] = s + avail.push(tmp) + } + + const c = avail.pop() + res = c[0] + c[1] = e + occupied.push(c) + + if(idx === targetFriend) { + return res + } + } +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number[][]} times * @param {number} targetFriend From 301e17004693118b6a67cd207202077c9fe0d721 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 May 2023 13:48:59 +0800 Subject: [PATCH 1315/2039] Update 1942-the-number-of-the-smallest-unoccupied-chair.js --- 1942-the-number-of-the-smallest-unoccupied-chair.js | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/1942-the-number-of-the-smallest-unoccupied-chair.js b/1942-the-number-of-the-smallest-unoccupied-chair.js index aeeafb99..0876ec69 100644 --- a/1942-the-number-of-the-smallest-unoccupied-chair.js +++ b/1942-the-number-of-the-smallest-unoccupied-chair.js @@ -17,9 +17,7 @@ const smallestChair = function(times, targetFriend) { let res = -1 const [s, e, idx] = times[i] while(!occupied.isEmpty() && occupied.peek()[1] <= s) { - const tmp = occupied.pop() - tmp[1] = s - avail.push(tmp) + avail.push(occupied.pop()) } const c = avail.pop() From e823c8115287b7bc76e979d52064b5278f751d0f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 9 May 2023 11:53:30 +0800 Subject: [PATCH 1316/2039] Update 2402-meeting-rooms-iii.js --- 2402-meeting-rooms-iii.js | 113 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 113 insertions(+) diff --git a/2402-meeting-rooms-iii.js b/2402-meeting-rooms-iii.js index aa3ab2fc..22d0bf36 100644 --- a/2402-meeting-rooms-iii.js +++ b/2402-meeting-rooms-iii.js @@ -1,3 +1,116 @@ +/** + * @param {number} n + * @param {number[][]} meetings + * @return {number} + */ +const mostBooked = function(n, meetings) { + const rooms = Array(n).fill(0) + const busy = new PQ((a, b) => a[1] === b[1] ? a[0] < b[0] : a[1] < b[1]) + const avail = new PQ((a, b) => a[0] < b[0]) + for(let i = 0; i < n; i++) { + avail.push([i, 0]) + } + meetings.sort((a, b) => a[0] - b[0]) + + for(let i = 0, len = meetings.length; i < len; i++) { + const [s, e] = meetings[i] + while(!busy.isEmpty() && busy.peek()[1] <= s) { + avail.push(busy.pop()) + } + if(!avail.isEmpty()) { + const r = avail.pop() + r[1] = e + rooms[r[0]]++ + busy.push(r) + } else { + const r = busy.pop() + r[1] += e - s + rooms[r[0]]++ + busy.push(r) + } + } + let res = 0 + // console.log(meetings.length, rooms) + const maxNum = Math.max(...rooms) + for(let i = 0; i < n; i++) { + if(rooms[i] === maxNum) { + res = i + break + } + } + return res +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number} n * @param {number[][]} meetings From e33f458e2701689448d037786d98c0ef7bde9e9e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 10 May 2023 12:08:16 +0800 Subject: [PATCH 1317/2039] Update 2102-sequentially-ordinal-rank-tracker.js --- 2102-sequentially-ordinal-rank-tracker.js | 110 ++++++++++++++++++++++ 1 file changed, 110 insertions(+) diff --git a/2102-sequentially-ordinal-rank-tracker.js b/2102-sequentially-ordinal-rank-tracker.js index 745f2173..3e2f8c83 100644 --- a/2102-sequentially-ordinal-rank-tracker.js +++ b/2102-sequentially-ordinal-rank-tracker.js @@ -1,3 +1,113 @@ +const maxFn = (a, b) => a.score === b.score ? a.name < b.name : a.score > b.score +const minFn = (a, b) => a.score === b.score ? a.name > b.name : a.score < b.score +const SORTracker = function() { + this.maxPQ = new PQ(maxFn) + this.minPQ = new PQ(minFn) + this.idx = 0 +}; + +/** + * @param {string} name + * @param {number} score + * @return {void} + */ +SORTracker.prototype.add = function(name, score) { + this.maxPQ.push({name, score}) +}; + +/** + * @return {string} + */ +SORTracker.prototype.get = function() { + if(this.idx) { + this.minPQ.push(this.maxPQ.pop()) + while(maxFn(this.maxPQ.peek(), this.minPQ.peek())) { + const tmp = this.minPQ.pop() + this.minPQ.push(this.maxPQ.pop()) + this.maxPQ.push(tmp) + } + } + this.idx++ + return this.maxPQ.peek().name +}; + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = new SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */ + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + const maxComp = (a, b) => { return a[1] === b[1] ? b[0].localeCompare(a[0]) > 0 : a[1] > b[1] } From 7f25f44e3348339677d7e9ca3226b1ba7f2b24fb Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 May 2023 11:40:36 +0800 Subject: [PATCH 1318/2039] Update 2653-sliding-subarray-beauty.js --- 2653-sliding-subarray-beauty.js | 42 +++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/2653-sliding-subarray-beauty.js b/2653-sliding-subarray-beauty.js index 89080175..0450dda7 100644 --- a/2653-sliding-subarray-beauty.js +++ b/2653-sliding-subarray-beauty.js @@ -1,3 +1,45 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} x + * @return {number[]} + */ +const getSubarrayBeauty = function(nums, k, x) { + const arr = Array(101).fill(0) + const res = [], n = nums.length, delta = 50 + for(let i = 0; i < n; i++) { + const cur = nums[i] + const idx = cur + delta + arr[idx]++ + if(i < k - 1) continue + else if(i === k - 1) res.push(helper()) + else { + const prev = nums[i - k] + arr[prev + delta]-- + res.push(helper()) + } + } + + return res + + function helper() { + let res = 0, neg = 0 + // -50 ---> 0 + // -1 ---> 49 + for(let i = 0, len = arr.length; i < len; i++) { + if(i < delta && arr[i] > 0) neg += arr[i] + if(neg >= x) { + res = i - delta + break + } + } + + return res + } +}; + +// another + /** * @param {number[]} nums * @param {number} k From cfdd85244fe5337d4c9acdd51921da406297a6ff Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 May 2023 11:28:07 +0800 Subject: [PATCH 1319/2039] Update 715-range-module.js --- 715-range-module.js | 96 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 96 insertions(+) diff --git a/715-range-module.js b/715-range-module.js index abeb83e4..4c193227 100644 --- a/715-range-module.js +++ b/715-range-module.js @@ -1,3 +1,99 @@ + +const RangeModule = function() { + this.st = new SegmentTree(); +}; + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.addRange = function(left, right) { + this.st.add(left, right); +}; + +/** + * @param {number} left + * @param {number} right + * @return {boolean} + */ +RangeModule.prototype.queryRange = function(left, right) { + return this.st.query(left, right); +}; + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.removeRange = function(left, right) { + this.st.remove(left, right); +}; + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = new RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */ +class SegNode { + constructor(l, r, state) { + this.l = l; + this.r = r; + this.state = state; + this.left = null; + this.right = null; + } +} + +function SegmentTree() { + let root = new SegNode(0, 1e9, false); + return { update, query, add, remove } + function update(node, l, r, state) { + if (l <= node.l && r >= node.r) { + node.state = state; + node.left = null; + node.right = null; + return node.state; + } + if (l >= node.r || r <= node.l) return node.state; + let mid = node.l + parseInt((node.r - node.l) / 2); + if (node.left == null) { + node.left = new SegNode(node.l, mid, node.state); + node.right = new SegNode(mid, node.r, node.state); + } + let left = update(node.left, l, r, state); + let right = update(node.right, l, r, state); + node.state = left && right; + return node.state; + } + function query(l, r) { + return dfs(root, l, r); + } + function dfs(node, l, r) { + if (l >= node.r || r <= node.l) return true; + if ((l <= node.l && r >= node.r) || (node.left == null)) return node.state; + let mid = node.l + parseInt((node.r - node.l) / 2); + if (r <= mid) { + return dfs(node.left, l, r); + } else if (l >= mid) { + return dfs(node.right, l, r); + } else { + return dfs(node.left, l, r) && dfs(node.right, l, r); + } + } + function add(l, r) { + update(root, l, r, true); + } + function remove(l, r) { + update(root, l, r, false); + } +} + + +// another + const RangeModule = function() { this.range = [] } From a423ecec46229903ae1280d5c937f488f3ac005e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 May 2023 11:17:42 +0800 Subject: [PATCH 1320/2039] Create 2382-maximum-segment-sum-after-removals.js --- 2382-maximum-segment-sum-after-removals.js | 29 ++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2382-maximum-segment-sum-after-removals.js diff --git a/2382-maximum-segment-sum-after-removals.js b/2382-maximum-segment-sum-after-removals.js new file mode 100644 index 00000000..83269863 --- /dev/null +++ b/2382-maximum-segment-sum-after-removals.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @param {number[]} removeQueries + * @return {number[]} + */ +const maximumSegmentSum = function(nums, removeQueries) { + const INF = Infinity, n = nums.length + const res = Array(n).fill(0) + const ds = Array(n).fill(INF); + for (let i = n - 1; i > 0; --i) { + const j = removeQueries[i]; + ds[j] = -nums[j]; + if (j > 0 && ds[j - 1] !== INF) merge(j, j - 1, ds); + if (j < n - 1 && ds[j + 1] !== INF) merge(j, j + 1, ds); + res[i - 1] = Math.max(res[i], -ds[find(j, ds)]); + } + return res; +}; + +function find(i, ds) { + return ds[i] < 0 ? i : ds[i] = find(ds[i], ds); +} + +function merge(s1, s2, ds) { + const p1 = find(s1, ds); + const p2 = find(s2, ds); + ds[p2] += ds[p1]; + ds[p1] = p2; +} From daa82ab353215a3ee24daa11de740004cde1f690 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 May 2023 14:15:05 +0800 Subject: [PATCH 1321/2039] Update 2382-maximum-segment-sum-after-removals.js --- 2382-maximum-segment-sum-after-removals.js | 41 +++++++++++----------- 1 file changed, 21 insertions(+), 20 deletions(-) diff --git a/2382-maximum-segment-sum-after-removals.js b/2382-maximum-segment-sum-after-removals.js index 83269863..6ce1bf3e 100644 --- a/2382-maximum-segment-sum-after-removals.js +++ b/2382-maximum-segment-sum-after-removals.js @@ -4,26 +4,27 @@ * @return {number[]} */ const maximumSegmentSum = function(nums, removeQueries) { - const INF = Infinity, n = nums.length - const res = Array(n).fill(0) - const ds = Array(n).fill(INF); - for (let i = n - 1; i > 0; --i) { - const j = removeQueries[i]; - ds[j] = -nums[j]; - if (j > 0 && ds[j - 1] !== INF) merge(j, j - 1, ds); - if (j < n - 1 && ds[j + 1] !== INF) merge(j, j + 1, ds); - res[i - 1] = Math.max(res[i], -ds[find(j, ds)]); + removeQueries.reverse() + const rev = removeQueries + const hash = {} + const res = [] + let cur = 0 + for(const idx of rev) { + hash[idx] = [nums[idx], 1] + const [lv, ll] = (hash[idx - 1] || [0, 0]) + const [rv, rl] = (hash[idx + 1] || [0, 0]) + + const val = nums[idx] + lv + rv + hash[idx + rl] = [val, ll + rl + 1] + hash[idx - ll] = [val, ll + rl + 1] + + cur = Math.max(cur, val) + res.push(cur) } - return res; + res.pop() + res.reverse() + res.push(0) + + return res }; -function find(i, ds) { - return ds[i] < 0 ? i : ds[i] = find(ds[i], ds); -} - -function merge(s1, s2, ds) { - const p1 = find(s1, ds); - const p2 = find(s2, ds); - ds[p2] += ds[p1]; - ds[p1] = p2; -} From d03136af0df4d51ffd3bc0075bf2975435bda01c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 May 2023 12:15:07 +0800 Subject: [PATCH 1322/2039] Create 2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.js --- ...-in-a-binary-matrix-by-at-most-one-flip.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.js diff --git a/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.js b/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.js new file mode 100644 index 00000000..ddec85ef --- /dev/null +++ b/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.js @@ -0,0 +1,42 @@ +/** + * @param {number[][]} grid + * @return {boolean} + */ +const isPossibleToCutPath = function(grid) { + const m = grid.length, n = grid[0].length + const pre = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0)) + const suf = Array.from({ length: m + 2 }, () => Array(n + 2).fill(0)) + + for(let i = 1; i <= m; i++) { + for(let j = 1; j <= n; j++) { + if(i === 1 && j === 1) pre[i][j] = 1 + else if(grid[i - 1][j - 1] === 1) { + pre[i][j] = pre[i - 1][j] + pre[i][j - 1] + } + } + } + + for(let i = m; i > 0; i--) { + for(let j = n; j > 0; j--) { + if(i === m && j === n) suf[i][j] = 1 + else if(grid[i - 1][j - 1] === 1) { + suf[i][j] = suf[i + 1][j] + suf[i][j + 1] + } + } + } + // console.log(pre, suf) + + const target = pre[m][n] + + for(let i = 1; i <= m; i++) { + for(let j = 1; j <= n; j++) { + if(i === 1 && j === 1) continue + if(i === m && j === n) continue + if(pre[i][j] * suf[i][j] === target) { + return true + } + } + } + + return false +}; From 33e2d1b3cc62282db158ade7be61212f4b4329b6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 May 2023 12:16:19 +0800 Subject: [PATCH 1323/2039] Create 2682-find-the-losers-of-the-circular-game.js --- 2682-find-the-losers-of-the-circular-game.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2682-find-the-losers-of-the-circular-game.js diff --git a/2682-find-the-losers-of-the-circular-game.js b/2682-find-the-losers-of-the-circular-game.js new file mode 100644 index 00000000..27eab644 --- /dev/null +++ b/2682-find-the-losers-of-the-circular-game.js @@ -0,0 +1,19 @@ +/** + * @param {number} n + * @param {number} k + * @return {number[]} + */ +var circularGameLosers = function(n, k) { + const set = new Set() + let i = 0, turn = 1 + while(!set.has(i + 1)) { + set.add(i + 1) + i = (i + turn * k) % n + turn++ + } + const res = [] + for(let j = 1; j<=n;j++) { + if(!set.has(j)) res.push(j) + } + return res +}; From 285a836108ff4e78ef86cb2eb6654ccc5f388862 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 May 2023 12:16:55 +0800 Subject: [PATCH 1324/2039] Create 2683-neighboring-bitwise-xor.js --- 2683-neighboring-bitwise-xor.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2683-neighboring-bitwise-xor.js diff --git a/2683-neighboring-bitwise-xor.js b/2683-neighboring-bitwise-xor.js new file mode 100644 index 00000000..bf83e34c --- /dev/null +++ b/2683-neighboring-bitwise-xor.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} derived + * @return {boolean} + */ +var doesValidArrayExist = function(derived) { + let n = derived.length + let r1 = Array(n).fill(0) + for (let i = 0; i < n-1; i++) { + r1[i+1] = derived[i] ^ r1[i] + } + if (r1[n-1]^r1[0] == derived[n-1]) { + return true + } + r1[0] = 1 + for (let i = 0; i < n-1; i++) { + r1[i+1] = derived[i] ^ r1[i] + } + if (r1[n-1]^r1[0] == derived[n-1]) { + return true + } + return false +}; From 36518bf185db421081624ddbb69aa78cbc1860d4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 May 2023 12:17:26 +0800 Subject: [PATCH 1325/2039] Create 2684-maximum-number-of-moves-in-a-grid.js --- 2684-maximum-number-of-moves-in-a-grid.js | 39 +++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2684-maximum-number-of-moves-in-a-grid.js diff --git a/2684-maximum-number-of-moves-in-a-grid.js b/2684-maximum-number-of-moves-in-a-grid.js new file mode 100644 index 00000000..b3760368 --- /dev/null +++ b/2684-maximum-number-of-moves-in-a-grid.js @@ -0,0 +1,39 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var maxMoves = function(g) { + let dirs = [ + [-1, 1], + [0, 1], + [1, 1], + ] + let grid = g + let m = grid.length, n = grid[0].length + let cachev1 = Array.from({ length: m }, () => Array(n).fill(null)) + const cache = {} + // const m = g.length; const n = g[0].length + const dx = [0, -1, 1]; const dy = [1, 1, 1] + + let ans = 0 + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + ans = Math.max(ans, dfs(i, j)) + } + } + return ans + + function dfs (i, j) { + if (cache[`${i}_${j}`]) return cache[`${i}_${j}`] + if (j === 0) return cache[`${i}_${j}`] = 0 + let s = -1 + for (let k = 0; k < 3; k++) { + const x = i - dx[k]; const y = j - dy[k] + if (x >= 0 && x < m && y >= 0 && y < n && g[i][j] > g[x][y]) { + s = Math.max(s, dfs(x, y)) + } + } + if (s === -1) return cache[`${i}_${j}`] = -1 + return cache[`${i}_${j}`] = s + 1 + } +}; From 935e4ed7d328aec3fa736d62244f90ad333e7180 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 May 2023 12:18:03 +0800 Subject: [PATCH 1326/2039] Create 2685-count-the-number-of-complete-components.js --- ...count-the-number-of-complete-components.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2685-count-the-number-of-complete-components.js diff --git a/2685-count-the-number-of-complete-components.js b/2685-count-the-number-of-complete-components.js new file mode 100644 index 00000000..f13b6657 --- /dev/null +++ b/2685-count-the-number-of-complete-components.js @@ -0,0 +1,48 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var countCompleteComponents = function(n, edges) { + const ma = Array(n).fill(0).map((_, idx) => idx) + const e = {} + for (const [x, y] of edges) { + e[x] ??= new Set() + e[x].add(y) + e[y] ??= new Set() + e[y].add(x) + merge(x, y) + } + const f = []; const fs = {} + for (let i = 0; i < n; i++) { + s = get(i) + f.push(s) + fs[s] ??= [] + fs[s].push(i) + } + + let ans = 0 + for (const [_, t] of Object.entries(fs)) { + let ok = true + for (let i = 0; i < t.length; i++) { + if (!ok) break + for (let j = i + 1; j < t.length; j++) { + if (!e[t[i]].has(t[j])) { + ok = false + break + } + } + } + ans += ok + } + return ans + + function get(x) { + if (ma[x] === x) return x + return ma[x] = get(ma[x]) + } + function merge (x, y) { + const fx = get(x); const fy = get(y) + ma[fx] = fy + } +}; From b7205ed8084157dde67fe41f2f5dfff00bd901e0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 19 May 2023 20:02:58 +0800 Subject: [PATCH 1327/2039] Create 2508-add-edges-to-make-degrees-of-all-nodes-even.js --- ...edges-to-make-degrees-of-all-nodes-even.js | 55 +++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 2508-add-edges-to-make-degrees-of-all-nodes-even.js diff --git a/2508-add-edges-to-make-degrees-of-all-nodes-even.js b/2508-add-edges-to-make-degrees-of-all-nodes-even.js new file mode 100644 index 00000000..f360018a --- /dev/null +++ b/2508-add-edges-to-make-degrees-of-all-nodes-even.js @@ -0,0 +1,55 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {boolean} + */ +const isPossible = (n, edges) => { + const g = initializeGraphSet(n) + packUG_Set(g, edges) + return canAddAtMost2EdgesMakeALLNodesDegreeEven(g) +} + +function initializeGraphSet(n) { + const g = [] + for (let i = 0; i < n; i++) { + g.push(new Set()) + } + return g +} +function packUG_Set(g, edges) { + for (const [u, v] of edges) { + g[u - 1].add(v - 1) + g[v - 1].add(u - 1) + } +} + +function canAddAtMost2EdgesMakeALLNodesDegreeEven(g) { + const oddNodes = [] + for (let i = 0; i < g.length; i++) { + let deg = g[i].size + if (deg % 2 == 1) { + oddNodes.push(i) + } + } + if (oddNodes.length == 0) { + // add no edge + return true + } else if (oddNodes.length == 2) { + // add one edge + let [a, b] = oddNodes + for (let k = 0; k < g.length; k++) { + // a <-> k b <-> k (k as transition node) + if (!g[a].has(k) && !g[b].has(k)) return true + } + return false + } else if (oddNodes.length == 4) { + // add two edges + let [a, b, c, d] = oddNodes // find two matched pairs valid + if (!g[a].has(b) && !g[c].has(d)) return true + if (!g[a].has(c) && !g[b].has(d)) return true + if (!g[a].has(d) && !g[c].has(b)) return true + return false + } else { + return false + } +} From 0a7f9c7c3ea00b0fc7d14ae1db1239975bdf1b58 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 May 2023 20:25:16 +0800 Subject: [PATCH 1328/2039] Create 2640-find-the-score-of-all-prefixes-of-an-array.js --- 2640-find-the-score-of-all-prefixes-of-an-array.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2640-find-the-score-of-all-prefixes-of-an-array.js diff --git a/2640-find-the-score-of-all-prefixes-of-an-array.js b/2640-find-the-score-of-all-prefixes-of-an-array.js new file mode 100644 index 00000000..2c7a88c7 --- /dev/null +++ b/2640-find-the-score-of-all-prefixes-of-an-array.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const findPrefixScore = function(nums) { + let pre = []; + let m = 0, s = 0; + for(let x of nums) { + m = Math.max(m, x); + s += x + m; + pre.push(s); + } + return pre; +}; From b23360fd98594bffaffb5cda5f5e9a37ecacbc86 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 May 2023 20:28:11 +0800 Subject: [PATCH 1329/2039] Update 2640-find-the-score-of-all-prefixes-of-an-array.js --- ...find-the-score-of-all-prefixes-of-an-array.js | 16 +++++++++------- 1 file changed, 9 insertions(+), 7 deletions(-) diff --git a/2640-find-the-score-of-all-prefixes-of-an-array.js b/2640-find-the-score-of-all-prefixes-of-an-array.js index 2c7a88c7..e07e4517 100644 --- a/2640-find-the-score-of-all-prefixes-of-an-array.js +++ b/2640-find-the-score-of-all-prefixes-of-an-array.js @@ -3,12 +3,14 @@ * @return {number[]} */ const findPrefixScore = function(nums) { - let pre = []; - let m = 0, s = 0; - for(let x of nums) { - m = Math.max(m, x); - s += x + m; - pre.push(s); + const { max } = Math + const res = [] + let ma = 0, sum = 0 + for(const e of nums) { + ma = max(e, ma) + sum += ma + e + res.push(sum) } - return pre; + + return res }; From dce73881f63bf02f20e5c5d0af0aceec19a4e1c7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 May 2023 19:33:44 +0800 Subject: [PATCH 1330/2039] Create 2642-design-graph-with-shortest-path-calculator.js --- ...ign-graph-with-shortest-path-calculator.js | 79 +++++++++++++++++++ 1 file changed, 79 insertions(+) create mode 100644 2642-design-graph-with-shortest-path-calculator.js diff --git a/2642-design-graph-with-shortest-path-calculator.js b/2642-design-graph-with-shortest-path-calculator.js new file mode 100644 index 00000000..2d1a48d4 --- /dev/null +++ b/2642-design-graph-with-shortest-path-calculator.js @@ -0,0 +1,79 @@ +/** + * Your Graph object will be instantiated and called as such: + * var obj = new Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */ +/** + * @param {number} n + * @param {number[][]} edges + */ +const Graph = function (n, edges) { + this.map = new Map() + const map = this.map + for (let i = 0; i < edges.length; i++) { + let edge = edges[i] + let from = edge[0] + let to = edge[1] + let cost = edge[2] + if (!map.has(from)) { + map.set(from, new Set()) + } + + map.get(from).add({ to, cost }) + } +} + +/** + * @param {number[]} edge + * @return {void} + */ +Graph.prototype.addEdge = function (edge) { + let map = this.map + let from = edge[0] + let to = edge[1] + let cost = edge[2] + if (!map.has(from)) { + map.set(from, new Set()) + } + + map.get(from).add({ to, cost }) +} + +/** + * @param {number} node1 + * @param {number} node2 + * @return {number} + */ +Graph.prototype.shortestPath = function (node1, node2) { + const heap = new MinPriorityQueue() + heap.enqueue({ node: node1, cost: 0 }, 0) + let visited = new Set() + + while (heap.size() > 0) { + const top = heap.dequeue().element + + if (visited.has(top.node)) { + continue + } + visited.add(top.node) + if (top.node === node2) { + return top.cost + } + let next = this.map.get(top.node) + if (next) { + for (let n of next) { + heap.enqueue({ node: n.to, cost: top.cost + n.cost }, top.cost + n.cost) + } + } + } + + return -1 +} + +/** + * Your Graph object will be instantiated and called as such: + * var obj = new Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */ From 4f373f6c215a94c2da518b46d37b20c29fd47bd3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 23 May 2023 12:08:56 +0800 Subject: [PATCH 1331/2039] Create 2608-shortest-cycle-in-a-graph.js --- 2608-shortest-cycle-in-a-graph.js | 40 +++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2608-shortest-cycle-in-a-graph.js diff --git a/2608-shortest-cycle-in-a-graph.js b/2608-shortest-cycle-in-a-graph.js new file mode 100644 index 00000000..77057b20 --- /dev/null +++ b/2608-shortest-cycle-in-a-graph.js @@ -0,0 +1,40 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +const findShortestCycle = function(n, edges) { + let res = Infinity + const graph = new Map() + for(const [u, v] of edges) { + if(graph.get(u) == null) graph.set(u, []) + if(graph.get(v) == null) graph.set(v, []) + graph.get(u).push(v) + graph.get(v).push(u) + } + for(let i = 0; i < n; i++) { + bfs(i) + } + + if(res === Infinity) return -1 + return res + + function bfs(src) { + const parent = Array(n), dis = Array(n).fill(Infinity) + let q = [] + dis[src] = 0 + q.push(src) + while(q.length) { + const node = q.shift() + for(const nxt of (graph.get(node) || [])) { + if(dis[nxt] === Infinity) { + dis[nxt] = dis[node] + 1 + parent[nxt] = node + q.push(nxt) + } else if(parent[node] !== nxt && parent[nxt] !== node) { + res = Math.min(res, dis[nxt] + dis[node] + 1) + } + } + } + } +}; From 8b0eeba2b7b47f788cdfd57090cc275f58386ca8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 24 May 2023 13:57:38 +0800 Subject: [PATCH 1332/2039] Update 386-lexicographical-numbers.js --- 386-lexicographical-numbers.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/386-lexicographical-numbers.js b/386-lexicographical-numbers.js index cd11275b..d593eb57 100644 --- a/386-lexicographical-numbers.js +++ b/386-lexicographical-numbers.js @@ -1,3 +1,28 @@ +/** + * @param {number} n + * @return {number[]} + */ +const lexicalOrder = function(n) { + const res = [] + for(let i = 1; i < 10; i++) { + dfs(i) + } + + return res + + function dfs(num) { + if(num > n) return + res.push(num) + for(let i = 0; i < 10; i++) { + const tmp = num * 10 + i + if(tmp > n) return + dfs(tmp) + } + } +}; + +// another + /** * @param {number} n * @return {number[]} From a2fe75adf7d8bc1dddf6c47f1e2d1446c68b16d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 24 May 2023 21:02:07 +0800 Subject: [PATCH 1333/2039] Update 400-nth-digit.js --- 400-nth-digit.js | 24 ++++++++++++------------ 1 file changed, 12 insertions(+), 12 deletions(-) diff --git a/400-nth-digit.js b/400-nth-digit.js index 59e4a928..53f0f393 100644 --- a/400-nth-digit.js +++ b/400-nth-digit.js @@ -3,16 +3,16 @@ * @return {number} */ const findNthDigit = function(n) { - let start = 1 - let len = 1 - let base = 9 - while(n > len * base) { - n = n - len * base - len++ - start *= 10 - base *= 10 - } - let target = start + (n - 1) / len - let reminder = (n - 1) % len - return (''+target).charAt(reminder) + let start = 1 + let len = 1 + let base = 9 + while(n > len * base) { + n = n - len * base + len++ + start *= 10 + base *= 10 + } + let target = start + Math.floor((n - 1) / len) + let reminder = (n - 1) % len + return (''+target).charAt(reminder) }; From 09b9a7978cd294ffc97f4973f8bd06392975d5ea Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 May 2023 15:27:11 +0800 Subject: [PATCH 1334/2039] Update 440-k-th-smallest-in-lexicographical-order.js --- 440-k-th-smallest-in-lexicographical-order.js | 23 +++++++++---------- 1 file changed, 11 insertions(+), 12 deletions(-) diff --git a/440-k-th-smallest-in-lexicographical-order.js b/440-k-th-smallest-in-lexicographical-order.js index 0750acf5..5e6f7319 100644 --- a/440-k-th-smallest-in-lexicographical-order.js +++ b/440-k-th-smallest-in-lexicographical-order.js @@ -3,29 +3,28 @@ * @param {number} k * @return {number} */ -const findKthNumber = function(n, k) { +const findKthNumber = function (n, k) { let curr = 1 k = k - 1 while (k > 0) { let steps = calSteps(n, curr, curr + 1) if (steps <= k) { - curr++ + curr += 1 k -= steps } else { curr *= 10 - k-- + k -= 1 } } return curr -} -//use long in case of overflow -function calSteps(n, n1, n2) { - let steps = 0 - while (n1 <= n) { - steps += Math.min(n + 1, n2) - n1 - n1 *= 10 - n2 *= 10 + function calSteps(n, n1, n2) { + let steps = 0 + while (n1 <= n) { + steps += Math.min(n + 1, n2) - n1 + n1 *= 10 + n2 *= 10 + } + return steps } - return steps } From 22b3aabc2ef02893db51b66ef05f0b6ff48a787e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 May 2023 19:51:53 +0800 Subject: [PATCH 1335/2039] Update 440-k-th-smallest-in-lexicographical-order.js --- 440-k-th-smallest-in-lexicographical-order.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/440-k-th-smallest-in-lexicographical-order.js b/440-k-th-smallest-in-lexicographical-order.js index 5e6f7319..00bb38fb 100644 --- a/440-k-th-smallest-in-lexicographical-order.js +++ b/440-k-th-smallest-in-lexicographical-order.js @@ -1,3 +1,38 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const findKthNumber = function (n, k) { + let cur = 1 + k = k - 1 + while(k > 0) { + const num = calc(cur) + if(num <= k) { + cur++ + k -= num + } else { + k-- + cur *= 10 + } + } + return cur + + function calc(cur) { + let total = 0 + let nxt = cur + 1 + while(cur <= n) { + total += Math.min(n - cur + 1, nxt - cur) + nxt *= 10 + cur *= 10 + } + + return total + } +} + +// another + /** * @param {number} n * @param {number} k From 15d22cd7f6d4e30181475f8506a1931de2471b4d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 26 May 2023 11:58:06 +0800 Subject: [PATCH 1336/2039] Update 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js --- ...string-of-all-happy-strings-of-length-n.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js b/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js index 03581889..e5568823 100644 --- a/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js +++ b/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js @@ -1,3 +1,27 @@ +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +const getHappyString = function(n, k) { + const hash = {a: 'bc', b: 'ac', c: 'ab'} + const q = ['a', 'b', 'c'] + while(q[0].length !== n) { + const e = q.shift() + const last = e.charAt(e.length - 1) + for(const ch of hash[last]) { + q.push(e + ch) + } + } + if(q.length >= k && q[k - 1].length === n) { + return q[k - 1] + } + + return '' +}; + +// another + /** * @param {number} n * @param {number} k From fa45d419f21ddfe033772e88355a0cc124204ce4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 26 May 2023 17:02:51 +0800 Subject: [PATCH 1337/2039] Update 120-triangle.js --- 120-triangle.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/120-triangle.js b/120-triangle.js index 483942e8..6f809c2a 100644 --- a/120-triangle.js +++ b/120-triangle.js @@ -17,3 +17,26 @@ const minimumTotal = function(triangle) { return triangle[0][0]; }; + +// another + +/** + * @param {number[][]} triangle + * @return {number} + */ +const minimumTotal = function(triangle) { + const m = triangle.length, n = triangle.at(-1).length + const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(Infinity)) + dp[1][1] = triangle[0][0] + for(let i = 2; i <= m; i++) { + for(let j = 1; j <= triangle[i - 1].length; j++) { + if(j === 1) dp[i][j] = dp[i - 1][j] + triangle[i - 1][j - 1] + else dp[i][j] = Math.min(dp[i - 1][j], dp[i - 1][j - 1]) + triangle[i - 1][j - 1] + } + } + let res = Infinity + for (let j = 0; j <= n; j++) { + res = Math.min(res, dp[m][j]) + } + return res +}; From f249742ad852e9045e32ac33e06c70b42a741a30 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 May 2023 17:40:45 +0800 Subject: [PATCH 1338/2039] Create 2710-remove-trailing-zeros-from-a-string.js --- 2710-remove-trailing-zeros-from-a-string.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2710-remove-trailing-zeros-from-a-string.js diff --git a/2710-remove-trailing-zeros-from-a-string.js b/2710-remove-trailing-zeros-from-a-string.js new file mode 100644 index 00000000..960926be --- /dev/null +++ b/2710-remove-trailing-zeros-from-a-string.js @@ -0,0 +1,14 @@ +/** + * @param {string} num + * @return {string} + */ +var removeTrailingZeros = function(num) { + const n = num.length + let idx = n + for(let i = n - 1; i >= 0; i--) { + if(num[i] === '0') idx = i + else break + } + + return num.slice(0, idx) +}; From f094dab40014d66efcb8fa5953877573f23176b5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 May 2023 17:42:04 +0800 Subject: [PATCH 1339/2039] Create 2711-difference-of-number-of-distinct-values-on-diagonals.js --- ...-number-of-distinct-values-on-diagonals.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 2711-difference-of-number-of-distinct-values-on-diagonals.js diff --git a/2711-difference-of-number-of-distinct-values-on-diagonals.js b/2711-difference-of-number-of-distinct-values-on-diagonals.js new file mode 100644 index 00000000..03cabb3d --- /dev/null +++ b/2711-difference-of-number-of-distinct-values-on-diagonals.js @@ -0,0 +1,33 @@ +/** + * @param {number[][]} grid + * @return {number[][]} + */ +const differenceOfDistinctValues = function (grid) { + const m = grid.length, + n = grid[0].length, + { abs } = Math + const res = Array.from({ length: m }, () => Array(n).fill(0)) + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + const bottomRight = new Set() + const topLeft = new Set() + let x = i + 1 + let y = j + 1 + while (x >= 0 && x < m && y >= 0 && y < n) { + bottomRight.add(grid[x][y]) + x++ + y++ + } + x = i - 1 + y = j - 1 + while (x >= 0 && x < m && y >= 0 && y < n) { + topLeft.add(grid[x][y]) + x-- + y-- + } + + res[i][j] = abs(bottomRight.size - topLeft.size) + } + } + return res +} From 326b489866e1ffbf21dde10b6e8ba413e41146b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 May 2023 17:42:46 +0800 Subject: [PATCH 1340/2039] Create 2712-minimum-cost-to-make-all-characters-equal.js --- ...nimum-cost-to-make-all-characters-equal.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2712-minimum-cost-to-make-all-characters-equal.js diff --git a/2712-minimum-cost-to-make-all-characters-equal.js b/2712-minimum-cost-to-make-all-characters-equal.js new file mode 100644 index 00000000..934c66bb --- /dev/null +++ b/2712-minimum-cost-to-make-all-characters-equal.js @@ -0,0 +1,34 @@ +/** + * @param {string} s + * @return {number} + */ +const minimumCost = function (s) { + const n = s.length, + { min } = Math + let res = Infinity + const dp = Array.from({ length: n + 1 }, () => Array(2).fill(0)) + const dp1 = Array.from({ length: n + 1 }, () => Array(2).fill(0)) + for (let i = 0; i < n; i++) { + if (s[i] === '0') { + dp[i + 1][0] = dp[i][0] + dp[i + 1][1] = dp[i][0] + (i + 1) + } else { + dp[i + 1][0] = dp[i][1] + (i + 1) + dp[i + 1][1] = dp[i][1] + } + } + + for (let i = n - 1; i >= 0; i--) { + if (s[i] === '0') { + dp1[i][0] = dp1[i + 1][0] + dp1[i][1] = dp1[i + 1][0] + (n - i) + } else { + dp1[i][0] = dp1[i + 1][1] + (n - i) + dp1[i][1] = dp1[i + 1][1] + } + } + for (let i = 0; i <= n; i++) { + res = min(res, dp[i][0] + dp1[i][0], dp[i][1] + dp1[i][1]) + } + return res +} From 4457d96e58d1e3ad12333f27d02ac90a41928afb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 May 2023 17:43:19 +0800 Subject: [PATCH 1341/2039] Create 2713-maximum-strictly-increasing-cells-in-a-matrix.js --- ...m-strictly-increasing-cells-in-a-matrix.js | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 2713-maximum-strictly-increasing-cells-in-a-matrix.js diff --git a/2713-maximum-strictly-increasing-cells-in-a-matrix.js b/2713-maximum-strictly-increasing-cells-in-a-matrix.js new file mode 100644 index 00000000..e033e1f7 --- /dev/null +++ b/2713-maximum-strictly-increasing-cells-in-a-matrix.js @@ -0,0 +1,50 @@ +/** + * @param {number[][]} mat + * @return {number} + */ +const maxIncreasingCells = function (mat) { + let m = mat.length + let n = mat[0].length + + const p = Array.from({ length: m * n }, () => Array(2).fill(0)) + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + p[i * n + j][0] = i + p[i * n + j][1] = j + } + } + p.sort((a, b) => mat[a[0]][a[1]] - mat[b[0]][b[1]]) + + let rmax = new Array(m).fill(0) + + let cmax = new Array(n).fill(0) + let ans = 0 + let start = 0, + end = 0 + for (; start < m * n; start = end) { + let sv = mat[p[start][0]][p[start][1]] + + for (end = start + 1; end < m * n; end++) { + if (sv != mat[p[end][0]][p[end][1]]) { + break + } + } + + let list = [] + for (let t = start; t < end; t++) { + let i = p[t][0], + j = p[t][1] + let max = Math.max(rmax[i], cmax[j]) + 1 + list.push([i, j, max]) + ans = Math.max(ans, max) + } + for (let ints of list) { + let i = ints[0], + j = ints[1], + max = ints[2] + rmax[i] = Math.max(rmax[i], max) + cmax[j] = Math.max(cmax[j], max) + } + } + return ans +} From d7a71e146f1755e8b28d36a230812ee505f56b54 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 May 2023 22:45:13 +0800 Subject: [PATCH 1342/2039] Update 31-next-permutation.js --- 31-next-permutation.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/31-next-permutation.js b/31-next-permutation.js index 17797b5a..28de12d6 100644 --- a/31-next-permutation.js +++ b/31-next-permutation.js @@ -4,7 +4,7 @@ */ const nextPermutation = function(nums) { const n = nums.length - let k + let k = null for(let i = n - 2; i >= 0; i--) { if(nums[i] < nums[i + 1]) { k = i From e0f66a71d6ea6501b09ee13fd5a710e0f412bdde Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 May 2023 17:41:17 +0800 Subject: [PATCH 1343/2039] Create 2663-lexicographically-smallest-beautiful-string.js --- ...cographically-smallest-beautiful-string.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2663-lexicographically-smallest-beautiful-string.js diff --git a/2663-lexicographically-smallest-beautiful-string.js b/2663-lexicographically-smallest-beautiful-string.js new file mode 100644 index 00000000..b37a5814 --- /dev/null +++ b/2663-lexicographically-smallest-beautiful-string.js @@ -0,0 +1,42 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const smallestBeautifulString = function(s, k) { +const chars = s.split('') + +for (let i = chars.length - 1; i >= 0; i--) { + chars[i] = String.fromCharCode(chars[i].charCodeAt(0) + 1) + while (containsPalindrome(chars, i)) { + chars[i] = String.fromCharCode(chars[i].charCodeAt(0) + 1) + } + if (chars[i] < String.fromCharCode('a'.charCodeAt(0) + k)) { + // If s[i] is among the first k letters, then change the letters after + // s[i] to the smallest ones that don't form any palindrome substring. + return changeSuffix(chars, i + 1) + } +} + +return '' + +// Returns true if chars[0..i] contains palindrome. +function containsPalindrome(chars, i) { + return ( + (i > 0 && chars[i] == chars[i - 1]) || (i > 1 && chars[i] == chars[i - 2]) + ) +} + +// Returns string where chars[i..] replaced with the smallest letters that +// don't form any palindrome substring. +function changeSuffix(chars, i) { + for (let j = i; j < chars.length; j++) { + chars[j] = 'a' + while (containsPalindrome(chars, j)) { + chars[j] = String.fromCharCode(chars[j].charCodeAt(0) + 1) + } + } + return chars.join('') +} + +}; From 1bcc5fc48c77edf297bc9e1b3afc72bcabb6a735 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 May 2023 17:42:00 +0800 Subject: [PATCH 1344/2039] Update 2663-lexicographically-smallest-beautiful-string.js --- ...cographically-smallest-beautiful-string.js | 55 +++++++++---------- 1 file changed, 27 insertions(+), 28 deletions(-) diff --git a/2663-lexicographically-smallest-beautiful-string.js b/2663-lexicographically-smallest-beautiful-string.js index b37a5814..e1b63472 100644 --- a/2663-lexicographically-smallest-beautiful-string.js +++ b/2663-lexicographically-smallest-beautiful-string.js @@ -3,40 +3,39 @@ * @param {number} k * @return {string} */ -const smallestBeautifulString = function(s, k) { -const chars = s.split('') +const smallestBeautifulString = function (s, k) { + const chars = s.split('') -for (let i = chars.length - 1; i >= 0; i--) { - chars[i] = String.fromCharCode(chars[i].charCodeAt(0) + 1) - while (containsPalindrome(chars, i)) { + for (let i = chars.length - 1; i >= 0; i--) { chars[i] = String.fromCharCode(chars[i].charCodeAt(0) + 1) + while (containsPalindrome(chars, i)) { + chars[i] = String.fromCharCode(chars[i].charCodeAt(0) + 1) + } + if (chars[i] < String.fromCharCode('a'.charCodeAt(0) + k)) { + // If s[i] is among the first k letters, then change the letters after + // s[i] to the smallest ones that don't form any palindrome substring. + return changeSuffix(chars, i + 1) + } } - if (chars[i] < String.fromCharCode('a'.charCodeAt(0) + k)) { - // If s[i] is among the first k letters, then change the letters after - // s[i] to the smallest ones that don't form any palindrome substring. - return changeSuffix(chars, i + 1) - } -} -return '' + return '' -// Returns true if chars[0..i] contains palindrome. -function containsPalindrome(chars, i) { - return ( - (i > 0 && chars[i] == chars[i - 1]) || (i > 1 && chars[i] == chars[i - 2]) - ) -} + // Returns true if chars[0..i] contains palindrome. + function containsPalindrome(chars, i) { + return ( + (i > 0 && chars[i] == chars[i - 1]) || (i > 1 && chars[i] == chars[i - 2]) + ) + } -// Returns string where chars[i..] replaced with the smallest letters that -// don't form any palindrome substring. -function changeSuffix(chars, i) { - for (let j = i; j < chars.length; j++) { - chars[j] = 'a' - while (containsPalindrome(chars, j)) { - chars[j] = String.fromCharCode(chars[j].charCodeAt(0) + 1) + // Returns string where chars[i..] replaced with the smallest letters that + // don't form any palindrome substring. + function changeSuffix(chars, i) { + for (let j = i; j < chars.length; j++) { + chars[j] = 'a' + while (containsPalindrome(chars, j)) { + chars[j] = String.fromCharCode(chars[j].charCodeAt(0) + 1) + } } + return chars.join('') } - return chars.join('') } - -}; From bd93128a0bdeab7ab852f765eb3fe18caeaeae6c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 30 May 2023 22:20:09 +0800 Subject: [PATCH 1345/2039] Update 2663-lexicographically-smallest-beautiful-string.js --- ...cographically-smallest-beautiful-string.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/2663-lexicographically-smallest-beautiful-string.js b/2663-lexicographically-smallest-beautiful-string.js index e1b63472..9c6d0067 100644 --- a/2663-lexicographically-smallest-beautiful-string.js +++ b/2663-lexicographically-smallest-beautiful-string.js @@ -1,3 +1,47 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const smallestBeautifulString = function(s, k) { + const n = s.length + const original = s + const chars = s.split(''), a = 'a'.charCodeAt(0), z = 'z'.charCodeAt(0) + const codeToCh = code => String.fromCharCode(code) + let flag = false + for(let i = n - 1; i >= 0; i--) { + const code = chars[i].charCodeAt(0) + for(let j = code + 1; j < a + k && j <= z; j++) { + if(!valid(i, codeToCh(j))) continue + chars[i] = codeToCh(j) + for(let nxt = i + 1; nxt < n; nxt++) { + for(let c = a; c < a + k; c++) { + if(valid(nxt, codeToCh(c))) { + chars[nxt] = codeToCh(c) + break + } + } + } + flag = true + break + } + if(flag) break + } + + const res = chars.join('') + if(res === original) return '' + return res + + function valid(idx, ch) { + if(idx >= 1 && ch === chars[idx - 1]) return false + if(idx >= 2 && ch === chars[idx - 2]) return false + return true + } +}; + +// another + + /** * @param {string} s * @param {number} k From 4ee0653402e814e389c1ae894b8f2a3112c0177d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 31 May 2023 20:00:01 +0800 Subject: [PATCH 1346/2039] Update 1625-lexicographically-smallest-string-after-applying-operations.js --- ...allest-string-after-applying-operations.js | 59 +++++++++++++++++++ 1 file changed, 59 insertions(+) diff --git a/1625-lexicographically-smallest-string-after-applying-operations.js b/1625-lexicographically-smallest-string-after-applying-operations.js index 6c603c5d..f624d743 100644 --- a/1625-lexicographically-smallest-string-after-applying-operations.js +++ b/1625-lexicographically-smallest-string-after-applying-operations.js @@ -1,3 +1,62 @@ +/** + * @param {string} s + * @param {number} a + * @param {number} b + * @return {string} + */ +const findLexSmallestString = function(s, a, b) { + let res = s + const visited = new Set() + dfs(s) + return res + + function dfs(str) { + if(isVisited(str)) return + visit(str) + dfs(add(str)) + dfs(rotate(str)) + } + + function isVisited(str) { + return visited.has(str) + } + + function visit(str) { + if(str < res) res = str + visited.add(str) + } + + function add(str) { + const arr = str.split('').map(e => +e) + for(let i = 1; i < str.length; i += 2) { + arr[i] = (arr[i] + a) % 10 + } + return arr.join('') + } + + function rotate(str) { + const arr = str.split('') + arr.reverse() + let l = 0, r = b - 1 + while(l < r) { + swap(arr, l++, r--) + } + l = b + r = s.length - 1 + while(l < r) { + swap(arr, l++, r--) + } + return arr.join('') + } + + function swap(arr, i, j) { + ;[arr[i], arr[j]] = [arr[j], arr[i]] + } +}; + +// another + + /** * @param {string} s * @param {number} a From 1619cab4cc78ef1834aa981c13149c0c32bd34c3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 1 Jun 2023 13:04:03 +0800 Subject: [PATCH 1347/2039] Create 2702-minimum-operations-to-make-numbers-non-positive.js --- ...operations-to-make-numbers-non-positive.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2702-minimum-operations-to-make-numbers-non-positive.js diff --git a/2702-minimum-operations-to-make-numbers-non-positive.js b/2702-minimum-operations-to-make-numbers-non-positive.js new file mode 100644 index 00000000..1330b34b --- /dev/null +++ b/2702-minimum-operations-to-make-numbers-non-positive.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @param {number} x + * @param {number} y + * @return {number} + */ +const minOperations = function (nums, x, y) { + const { max, floor } = Math + let right = nums[0] + for (const v of nums) { + right = Math.max(v, right) + } + let left = 1 + right = floor(right / y) + 1 + x -= y + while (left <= right) { + let mid = (left + right) >> 1, + s = mid + for (let v of nums) { + let t = floor((v + y - 1) / y) + if (mid >= t) { + continue + } + s -= floor((v - mid * y + x - 1) / x) + if (s < 0) { + break + } + } + if (s >= 0) { + right = mid - 1 + } else { + left = mid + 1 + } + } + return right + 1 +} From 429405e29f2d871e4c29db0e83c1ce8cba80e594 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Jun 2023 00:05:06 +0800 Subject: [PATCH 1348/2039] Create 2557-maximum-number-of-integers-to-choose-from-a-range-ii.js --- ...r-of-integers-to-choose-from-a-range-ii.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2557-maximum-number-of-integers-to-choose-from-a-range-ii.js diff --git a/2557-maximum-number-of-integers-to-choose-from-a-range-ii.js b/2557-maximum-number-of-integers-to-choose-from-a-range-ii.js new file mode 100644 index 00000000..376d4586 --- /dev/null +++ b/2557-maximum-number-of-integers-to-choose-from-a-range-ii.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} banned + * @param {number} n + * @param {number} maxSum + * @return {number} + */ +var maxCount = function(banned, n, maxSum) { + const set = new Set(banned); + + let low = 0; + let high = n; + let possibleVal = 0; + while (low <= high) { + const mid = Math.floor((low + high) / 2); + let totalSum = (mid * (mid + 1)) / 2; + for (const val of set) { + if (val <= mid) totalSum -= val; + } + + if (totalSum <= maxSum) { + possibleVal = mid; + low = mid + 1; + } else { + high = mid - 1; + } + } + + let ans = possibleVal; + for (const val of set) { + if (val <= possibleVal) ans--; + } + + return ans; +}; From f2c1e29b746adca6ee50bedd22e4c6c4c25a790d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Jun 2023 11:34:51 +0800 Subject: [PATCH 1349/2039] Create 2560-house-robber-iv.js --- 2560-house-robber-iv.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2560-house-robber-iv.js diff --git a/2560-house-robber-iv.js b/2560-house-robber-iv.js new file mode 100644 index 00000000..d0fe4251 --- /dev/null +++ b/2560-house-robber-iv.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minCapability = function(nums, k) { + let left = 1, right = 1e9, n = nums.length + while (left < right) { + let mid = Math.floor((left + right) / 2), take = 0 + for (let i = 0; i < n; ++i) { + if (nums[i] <= mid) { + take += 1 + i++ + } + } + if (take >= k) right = mid + else left = mid + 1 + } + return left +}; From 59ec24a9d5b7295703f5a300a44d9ece1b0715bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 Jun 2023 13:27:15 +0800 Subject: [PATCH 1350/2039] Update 2560-house-robber-iv.js --- 2560-house-robber-iv.js | 22 ++++++++++++---------- 1 file changed, 12 insertions(+), 10 deletions(-) diff --git a/2560-house-robber-iv.js b/2560-house-robber-iv.js index d0fe4251..3a297193 100644 --- a/2560-house-robber-iv.js +++ b/2560-house-robber-iv.js @@ -4,17 +4,19 @@ * @return {number} */ const minCapability = function(nums, k) { - let left = 1, right = 1e9, n = nums.length - while (left < right) { - let mid = Math.floor((left + right) / 2), take = 0 - for (let i = 0; i < n; ++i) { - if (nums[i] <= mid) { - take += 1 + const n = nums.length + let l = 1, r = 1e9 + while(l < r) { + const mid = Math.floor((l + r) / 2) + let cnt = 0 + for(let i = 0; i < n; i++) { + if(nums[i] <= mid) { + cnt++ i++ - } + } } - if (take >= k) right = mid - else left = mid + 1 + if(cnt >= k) r = mid + else l = mid + 1 } - return left + return l }; From 85b740c453cc86e82945d73bea5e1467474ff72f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 10 Jun 2023 22:53:01 +0800 Subject: [PATCH 1351/2039] Create 2604-minimum-time-to-eat-all-grains.js --- 2604-minimum-time-to-eat-all-grains.js | 32 ++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2604-minimum-time-to-eat-all-grains.js diff --git a/2604-minimum-time-to-eat-all-grains.js b/2604-minimum-time-to-eat-all-grains.js new file mode 100644 index 00000000..33762836 --- /dev/null +++ b/2604-minimum-time-to-eat-all-grains.js @@ -0,0 +1,32 @@ +/** + * @param {number[]} hens + * @param {number[]} grains + * @return {number} + */ +var minimumTime = function (hens, grains) { + hens.sort((a, b) => a - b) + grains.sort((a, b) => a - b) + let lo = 0, + hi = 1e9 + while (lo < hi) { + let mid = Math.floor(lo + (hi - lo) / 2), + i = 0 + for (let h of hens) { + for ( + let ii = i; + i < grains.length && + ((grains[i] <= h && h - grains[i] <= mid) || + (h <= grains[ii] && grains[i] - h <= mid) || + (grains[ii] <= h && + h <= grains[i] && + grains[i] - grains[ii] + Math.min(grains[i] - h, h - grains[ii]) <= + mid)); + ++i + ); + } + + if (i == grains.length) hi = mid + else lo = mid + 1 + } + return lo +} From a854e29bd952de93328c302f0af8c285004c8320 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Jun 2023 14:34:40 +0800 Subject: [PATCH 1352/2039] Create 2031-count-subarrays-with-more-ones-than-zeros.js --- ...unt-subarrays-with-more-ones-than-zeros.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 2031-count-subarrays-with-more-ones-than-zeros.js diff --git a/2031-count-subarrays-with-more-ones-than-zeros.js b/2031-count-subarrays-with-more-ones-than-zeros.js new file mode 100644 index 00000000..c87d67a3 --- /dev/null +++ b/2031-count-subarrays-with-more-ones-than-zeros.js @@ -0,0 +1,41 @@ +const lowBit = (x) => x & -x +class FenwickTree { + constructor(n) { + if (n < 1) return + this.sum = Array(n + 1).fill(0) + } + update(i, delta) { + if (i < 1) return + while (i < this.sum.length) { + this.sum[i] += delta + i += lowBit(i) + } + } + query(i) { + if (i < 1) return 0 + let sum = 0 + while (i > 0) { + sum += this.sum[i] + i -= lowBit(i) + } + return sum + } +} + +/** + * @param {number[]} nums + * @return {number} + */ +const subarraysWithMoreZerosThanOnes = function(nums) { + const n = nums.length, mod = 1e9 + 7 + const bit = new FenwickTree(2 * n + 1) + bit.update(n, 1) + let balance = 0, res = 0 + for(const e of nums) { + balance += (e === 1 ? 1 : -1) + bit.update(balance + n, 1) + res = (res + bit.query(balance + n - 1)) % mod + } + + return res +}; From b4441842d6abe3aa28a22f605baec0663ab9fbf6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Jun 2023 14:40:12 +0800 Subject: [PATCH 1353/2039] Update 2031-count-subarrays-with-more-ones-than-zeros.js --- 2031-count-subarrays-with-more-ones-than-zeros.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/2031-count-subarrays-with-more-ones-than-zeros.js b/2031-count-subarrays-with-more-ones-than-zeros.js index c87d67a3..324c77f6 100644 --- a/2031-count-subarrays-with-more-ones-than-zeros.js +++ b/2031-count-subarrays-with-more-ones-than-zeros.js @@ -29,12 +29,12 @@ class FenwickTree { const subarraysWithMoreZerosThanOnes = function(nums) { const n = nums.length, mod = 1e9 + 7 const bit = new FenwickTree(2 * n + 1) - bit.update(n, 1) + bit.update(n + 1, 1) let balance = 0, res = 0 for(const e of nums) { balance += (e === 1 ? 1 : -1) - bit.update(balance + n, 1) - res = (res + bit.query(balance + n - 1)) % mod + bit.update(balance + n + 1, 1) + res = (res + bit.query(balance + n)) % mod } return res From 8cbe5cbe7fac6ddd69706a0bd22ceef04086d61f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 20 Jun 2023 12:46:31 +0800 Subject: [PATCH 1354/2039] Update 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js --- ...ubsequences-that-satisfy-the-given-sum-condition.js | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js b/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js index 8803f183..e7de9469 100644 --- a/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js +++ b/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js @@ -4,17 +4,17 @@ * @return {number} */ const numSubseq = function(nums, target) { - const n = nums.length, pow = Array(n), mod = 1e9 + 7 - pow[0] = 1 + const n = nums.length, mod = 1e9 + 7 + const pows = Array(n).fill(1) for(let i = 1; i < n; i++) { - pow[i] = (pow[i - 1] * 2) % mod + pows[i] = pows[i - 1] * 2 % mod } + let res = 0, l = 0, r = n - 1 nums.sort((a, b) => a - b) - let l = 0, r = n - 1, res = 0 while(l <= r) { if(nums[l] + nums[r] > target) r-- else { - res = (res + pow[r - l]) % mod + res = (res + pows[r - l]) % mod l++ } } From c5ce8a5b87ef10ba719990a76fa2d9ccd63aecb8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 Jun 2023 15:32:03 +0800 Subject: [PATCH 1355/2039] Create 2681-power-of-heroes.js --- 2681-power-of-heroes.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2681-power-of-heroes.js diff --git a/2681-power-of-heroes.js b/2681-power-of-heroes.js new file mode 100644 index 00000000..e76bf3da --- /dev/null +++ b/2681-power-of-heroes.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const sumOfPower = function(nums) { + const n = nums.length, mod = BigInt(1e9 + 7) + let res = 0n, sum = 0n + nums.sort((a, b) => a - b) + + for(let i = 0; i < n; i++) { + const e = BigInt(nums[i]) + const square = (e * e) % mod + + res = (res + sum * square + e * square) % mod + sum = (sum * 2n + e) % mod + } + + return res +}; From 2277886292b9d639d0a7b7fe85d90b6a94b652b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 24 Jun 2023 17:14:57 +0800 Subject: [PATCH 1356/2039] Update 2492-minimum-score-of-a-path-between-two-cities.js --- ...imum-score-of-a-path-between-two-cities.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/2492-minimum-score-of-a-path-between-two-cities.js b/2492-minimum-score-of-a-path-between-two-cities.js index de7ed10e..43c7f362 100644 --- a/2492-minimum-score-of-a-path-between-two-cities.js +++ b/2492-minimum-score-of-a-path-between-two-cities.js @@ -1,3 +1,36 @@ +/** + * @param {number} n + * @param {number[][]} roads + * @return {number} + */ +const minScore = function(n, roads) { + const g = {}, visited = Array(n + 1).fill(0) + let res = Infinity + for(const [u, v, d] of roads) { + if(g[u] == null) g[u] = [] + if(g[v] == null) g[v] = [] + + g[u].push([v, d]) + g[v].push([u, d]) + } + + dfs(1) + + return res + + function dfs(node) { + visited[node] = 1 + for(const [nxt, dis] of (g[node] || [])) { + res = Math.min(res, dis) + if(visited[nxt] === 0) { + dfs(nxt) + } + } + } +}; + +// another + class UnionFind { constructor() { this.sizes = new Map() From fc5a4bc64e5e7299aaa7c3d7af87857f03d1eba0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Jun 2023 22:26:24 +0800 Subject: [PATCH 1357/2039] Create 2658-maximum-number-of-fish-in-a-grid.js --- 2658-maximum-number-of-fish-in-a-grid.js | 62 ++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 2658-maximum-number-of-fish-in-a-grid.js diff --git a/2658-maximum-number-of-fish-in-a-grid.js b/2658-maximum-number-of-fish-in-a-grid.js new file mode 100644 index 00000000..a46ab84b --- /dev/null +++ b/2658-maximum-number-of-fish-in-a-grid.js @@ -0,0 +1,62 @@ +const deepCopy2DArray = (g) => { + let d = [] + for (const a of g) d.push([...a]) + return d +} + +const dx = [1, -1, 0, 0], + dy = [0, 0, 1, -1] +const getAllAreasCoordinates = (g) => { + const forbid = 0, + floodFillMakeConnected = '*' // forbid is land cell + let n = g.length, + m = g[0].length, + res = [] + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + if (g[i][j] != forbid) { + let q = [[i, j]], + area = [] + while (q.length) { + let [x, y] = q.shift() + for (let k = 0; k < 4; k++) { + let nx = x + dx[k], + ny = y + dy[k] + if ( + nx < 0 || + nx >= n || + ny < 0 || + ny >= m || + g[nx][ny] == forbid || + g[nx][ny] == floodFillMakeConnected + ) + continue + g[nx][ny] = floodFillMakeConnected + area.push([nx, ny]) + q.push([nx, ny]) + } + } + if (area.length == 0 && g[i][j] != floodFillMakeConnected) + area.push([i, j]) + res.push(area) + } + } + } + return res +} + +/** + * @param {number[][]} grid + * @return {number} + */ +const findMaxFish = (g) => { + let areas = getAllAreasCoordinates(deepCopy2DArray(g)), + res = 0 + for (const area of areas) { + let sum = 0 + for (const [x, y] of area) sum += g[x][y] + res = Math.max(res, sum) + } + return res +} + From 95aa94fc8f4bda4fffd589431199887f85c02275 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Jun 2023 13:38:56 +0800 Subject: [PATCH 1358/2039] Update 459-repeated-substring-pattern.js --- 459-repeated-substring-pattern.js | 32 +++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/459-repeated-substring-pattern.js b/459-repeated-substring-pattern.js index 2ed1fcce..9debc498 100644 --- a/459-repeated-substring-pattern.js +++ b/459-repeated-substring-pattern.js @@ -1,3 +1,35 @@ +/** + * @param {string} s + * @return {boolean} + */ +const repeatedSubstringPattern = function(s) { + + const len = s.length + const table = build(s) + return table[len] && (table[len] % (len - table[len]) === 0) + + function build(str) { + const n = str.length + const table = Array(n + 1).fill(0) + let i = 1, j = 0 + table[0] = -1 + while(i < n) { + if(str[i] === str[j]) { + i++ + j++ + table[i] = j + } else { + if(j > 0) j = table[j] + else i++ + } + } + + return table + } +}; + +// another + /** * @param {string} s * @return {boolean} From 6924e8bd4d22fc3eaa3098da5a23539bf62da278 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Jun 2023 16:20:00 +0800 Subject: [PATCH 1359/2039] Update 1998-gcd-sort-of-an-array.js --- 1998-gcd-sort-of-an-array.js | 95 ++++++++++++++++++++++++++++++------ 1 file changed, 81 insertions(+), 14 deletions(-) diff --git a/1998-gcd-sort-of-an-array.js b/1998-gcd-sort-of-an-array.js index 55c9526d..68ecd546 100644 --- a/1998-gcd-sort-of-an-array.js +++ b/1998-gcd-sort-of-an-array.js @@ -3,25 +3,92 @@ * @return {boolean} */ const gcdSort = function(nums) { - const spf = Array(nums.length).fill(0) - let maxNum = Math.max(...nums); - sieve(maxNum); + const n = nums.length + const maxNum = Math.max(...nums); + const spf = sieve(maxNum); + + const uf = new UnionFind(maxNum + 1) + for(const e of nums) { + for(const f of getFactors(e)) uf.union(e, f) + } + const clone = nums.slice() + clone.sort((a, b) => a - b) - const uf = new UnionFind(maxNum+1); - for (let x of nums) { - for (let f of getFactors(x)) uf.union(f, x); + for(let i = 0; i < n; i++) { + if(uf.find(nums[i]) !== uf.find(clone[i])) return false + } + + return true + + function sieve(n) { // O(Nlog(logN)) ~ O(N) + const res = [0, 0] + for (let i = 2; i <= n; ++i) res[i] = i; + for (let i = 2; i * i <= n; i++) { + if (res[i] != i) continue; // skip if `i` is not a prime number + for (let j = i * i; j <= n; j += i) { + if (res[j] == j) { // marking spf[j] if it is not previously marked + res[j] = i; } + } + } + return res + } + + function getFactors(n) { // O(logN) + const factors = []; + while (n > 1) { + factors.push(spf[n]); + n = ~~(n /spf[n]); + } + return factors; + } +}; +function gcd( x, y) { + return y == 0 ? x : gcd(y, x % y); +} - const sortedArr = nums.slice(); - sortedArr.sort((a, b) => a - b) +class UnionFind { + constructor(n) { + this.parent = []; + for (let i = 0; i < n; i++) this.parent[i] = i; + } + find(x) { + if (x == this.parent[x]) return x; + return this.parent[x] = this.find(this.parent[x]); // Path compression + } + union(u, v) { + let pu = this.find(u), pv = this.find(v); + if (pu != pv) this.parent[pu] = pv; + } +}; - for (let i = 0; i < nums.length; ++i) { - let pu = uf.find(sortedArr[i]); - let pv = uf.find(nums[i]); - if (pu != pv) return false; // can't swap nums[i] with sortedArr[i] - } - return true; +// another + +/** + * @param {number[]} nums + * @return {boolean} + */ +const gcdSort = function(nums) { + const spf = Array(nums.length).fill(0) + let maxNum = Math.max(...nums); + sieve(maxNum); + + const uf = new UnionFind(maxNum+1); + for (let x of nums) { + for (let f of getFactors(x)) uf.union(f, x); + } + + + const sortedArr = nums.slice(); + sortedArr.sort((a, b) => a - b) + + for (let i = 0; i < nums.length; ++i) { + let pu = uf.find(sortedArr[i]); + let pv = uf.find(nums[i]); + if (pu != pv) return false; // can't swap nums[i] with sortedArr[i] + } + return true; function sieve( n) { // O(Nlog(logN)) ~ O(N) for (let i = 2; i <= n; ++i) spf[i] = i; From 9add58e096d93a41a5694b2535d9cb2f7bf2251e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 30 Jun 2023 16:39:03 +0800 Subject: [PATCH 1360/2039] Create 2709-greatest-common-divisor-traversal.js --- 2709-greatest-common-divisor-traversal.js | 47 +++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 2709-greatest-common-divisor-traversal.js diff --git a/2709-greatest-common-divisor-traversal.js b/2709-greatest-common-divisor-traversal.js new file mode 100644 index 00000000..581401c6 --- /dev/null +++ b/2709-greatest-common-divisor-traversal.js @@ -0,0 +1,47 @@ +// max number in `nums` is 10^5. Only need primes up to sqrt(10^5) = 316 +const primes = [ + 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, + 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, + 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, + 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, +] + +/** + * @param {number[]} nums + * @return {boolean} + */ +const canTraverseAllPairs = function(nums) { + const n = nums.length + const uf = new Array(n).fill(-1) + const primeIdxs = {} + + const find = (i) => (uf[i] < 0 ? i : find(uf[i])) + + nums.forEach((num, i) => { + // find all prime factors of num + let primeFactors = [] + for (let p of primes) { + if (num % p === 0) { + primeFactors.push(p) + while (num % p === 0) num = Math.floor(num / p) + } + } + + if (num !== 1) primeFactors.push(num) + + for (let factor of primeFactors) { + if (factor in primeIdxs) { + let pi = find(i) + let pj = find(primeIdxs[factor]) + // union if not already merged + if (pi !== pj) { + if (uf[pi] > uf[pj]) [pi, pj] = [pj, pi] + uf[pi] += uf[pj] + uf[pj] = pi + } + } else primeIdxs[factor] = i + } + }) + + return Math.abs(Math.min(...uf)) === n +}; From faae9739592ef82abe8768c6f53f9fea5966bc6d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Jul 2023 15:43:42 +0800 Subject: [PATCH 1361/2039] Update 204-count-primes.js --- 204-count-primes.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/204-count-primes.js b/204-count-primes.js index e1a61978..6882fda6 100755 --- a/204-count-primes.js +++ b/204-count-primes.js @@ -1,3 +1,28 @@ +/** + * @param {number} n + * @return {number} + */ +const countPrimes = function(n) { + const arr = Array(n).fill(0) + + for(let i = 2; i * i < n; i++) { + if(arr[i] !== 0) continue + let j = i * i + while(j < n) { + arr[j] = 1 + j += i + } + } + + let res = 0 + for(let i = 2; i < n; i++) { + if(arr[i] === 0) res++ + } + return res +}; + +// another + /** * @param {number} n * @return {number} From 4db9500bd965fe81b3db54b3764f3747e5eddb84 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jul 2023 13:10:52 +0800 Subject: [PATCH 1362/2039] Update 2280-minimum-lines-to-represent-a-line-chart.js --- ...minimum-lines-to-represent-a-line-chart.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/2280-minimum-lines-to-represent-a-line-chart.js b/2280-minimum-lines-to-represent-a-line-chart.js index 96ae3aa4..a8d50bf9 100644 --- a/2280-minimum-lines-to-represent-a-line-chart.js +++ b/2280-minimum-lines-to-represent-a-line-chart.js @@ -1,3 +1,33 @@ +/** + * @param {number[][]} stockPrices + * @return {number} + */ +const minimumLines = function(stockPrices) { + let res = 1 + const n = stockPrices.length + if(n === 1) return 0 + stockPrices.sort((a, b) => a[0] - b[0]) + for(let i = 2; i < n; i++) { + const cur = stockPrices[i], p = stockPrices[i - 1], pp = stockPrices[i - 2] + if(chk(pp, p, cur)) continue + else res++ + } + + + return res +}; + +function chk(p1, p2, p3) { + const bi = BigInt + // (y3 - y1) / (x3 - x1) == (y2 - y1) / (x2 - x1) + const [x1, y1] = p1, [x2, y2] = p2, [x3, y3] = p3 + return (bi(y3) - bi(y1)) * (bi(x2) - bi(x1)) === (bi(y2) - bi(y1)) * (bi(x3) - bi(x1)) +} + + + +// another + /** * @param {number[][]} stockPrices * @return {number} From e20a1970c9b7b13b69bb6c8ae60ec37053fd2d5d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jul 2023 19:29:50 +0800 Subject: [PATCH 1363/2039] Create 2763-sum-of-imbalance-numbers-of-all-subarrays.js --- ...m-of-imbalance-numbers-of-all-subarrays.js | 72 +++++++++++++++++++ 1 file changed, 72 insertions(+) create mode 100644 2763-sum-of-imbalance-numbers-of-all-subarrays.js diff --git a/2763-sum-of-imbalance-numbers-of-all-subarrays.js b/2763-sum-of-imbalance-numbers-of-all-subarrays.js new file mode 100644 index 00000000..6bc83cc3 --- /dev/null +++ b/2763-sum-of-imbalance-numbers-of-all-subarrays.js @@ -0,0 +1,72 @@ +class MultiSet { + constructor() { + this.countMap = new Map() + this.valueList = [] + } + remove(value) { + if(!this.countMap.has(value)) return false + let index = binarySearch(this.valueList, value) + if (this.countMap.get(value) === 1) { + this.valueList.splice(index, 1) + this.countMap.delete(value) + } else { + this.countMap.set(value, (this.countMap.get(value) || 0) - 1) + } + return true + } + add(value) { + let index = binarySearch(this.valueList, value) + if (index < 0) { + this.valueList.splice(-index - 1, 0, value) + this.countMap.set(value, 1) + } else { + this.countMap.set(value, this.countMap.get(value) + 1) + } + } + has(value) { + return this.countMap.has(value) + } + get max() { + return this.valueList[this.valueList.length - 1] + } + get min() { + return this.valueList[0] + } +} + +function binarySearch(arr, val) { + let l = 0, r = arr.length + while( l < r ) { + const mid = Math.floor((l + r) / 2) + if(arr[mid] < val) { + l = mid + 1 + } else { + r = mid + } + } + if(arr[l] !== val) return -(l + 1) + + return l +} +/** + * @param {number[]} nums + * @return {number} + */ +const sumImbalanceNumbers = function (nums) { + let n = nums.length, res = 0; + for (let i = 0; i < n; i++) { + let tree = new MultiSet(), cnt = 0; + tree.add(nums[i]); + for (let j = i + 1; j < n; j++) { + let x = nums[j]; + if (!tree.has(x)) { + tree.add(x); + cnt++; + if (tree.has(x - 1)) cnt--; + if (tree.has(x + 1)) cnt--; + } + res += cnt; + } + } + return res; +} From 420ebae9503e3612896537e070e54ae13af84620 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jul 2023 19:30:44 +0800 Subject: [PATCH 1364/2039] Create 2762-continuous-subarrays.js --- 2762-continuous-subarrays.js | 68 ++++++++++++++++++++++++++++++++++++ 1 file changed, 68 insertions(+) create mode 100644 2762-continuous-subarrays.js diff --git a/2762-continuous-subarrays.js b/2762-continuous-subarrays.js new file mode 100644 index 00000000..54ab362a --- /dev/null +++ b/2762-continuous-subarrays.js @@ -0,0 +1,68 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const continuousSubarrays = function(nums) { + let res = 0 + let l = 0 + let r = 0 + const mset = new MultiSet() + for(let r = 0; r < nums.length; r++) { + mset.add(nums[r]) + while (mset.max - mset.min > 2) { + mset.remove(nums[l]) + l++ + } + + res += r - l + 1 + } + return res +}; + +class MultiSet { + constructor() { + this.countMap = new Map() + this.valueList = [] + } + remove(value) { + if(!this.countMap.has(value)) return false + let index = binarySearch(this.valueList, value) + if (this.countMap.get(value) === 1) { + this.valueList.splice(index, 1) + this.countMap.delete(value) + } else { + this.countMap.set(value, (this.countMap.get(value) || 0) - 1) + } + return true + } + add(value) { + let index = binarySearch(this.valueList, value) + if (index < 0) { + this.valueList.splice(-index - 1, 0, value) + this.countMap.set(value, 1) + } else { + this.countMap.set(value, this.countMap.get(value) + 1) + } + } + get max() { + return this.valueList[this.valueList.length - 1] + } + get min() { + return this.valueList[0] + } +} + +function binarySearch(arr, val) { + let l = 0, r = arr.length + while( l < r ) { + const mid = Math.floor((l + r) / 2) + if(arr[mid] < val) { + l = mid + 1 + } else { + r = mid + } + } + if(arr[l] !== val) return -(l + 1) + + return l +} From 57136bcd549e77256ed1cf8d7e6ada7cd6d2ea4a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jul 2023 19:31:25 +0800 Subject: [PATCH 1365/2039] Create 2761-prime-pairs-with-target-sum.js --- 2761-prime-pairs-with-target-sum.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 2761-prime-pairs-with-target-sum.js diff --git a/2761-prime-pairs-with-target-sum.js b/2761-prime-pairs-with-target-sum.js new file mode 100644 index 00000000..ef9a6bba --- /dev/null +++ b/2761-prime-pairs-with-target-sum.js @@ -0,0 +1,28 @@ + +/** + * @param {number} n + * @return {number[][]} + */ +const findPrimePairs = function(n) { + const res = primes(n + 1, n) + return res +}; + +function primes(n, target) { + const arr = Array(n).fill(0) + + for(let i = 2; i * i < n; i++) { + if(arr[i] !== 0) continue + let j = i * i + while(j < n) { + arr[j] = 1 + j += i + } + } + + let res = [] + for(let i = 2; i < n; i++) { + if(arr[i] === 0 && target - i > 1 && target - i >= i && arr[target - i] === 0) res.push([i, target - i]) + } + return res +}; From f8b189203376952e74a0295612b30e10caaa31c9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jul 2023 19:32:04 +0800 Subject: [PATCH 1366/2039] Create 2760-longest-even-odd-subarray-with-threshold.js --- ...ongest-even-odd-subarray-with-threshold.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2760-longest-even-odd-subarray-with-threshold.js diff --git a/2760-longest-even-odd-subarray-with-threshold.js b/2760-longest-even-odd-subarray-with-threshold.js new file mode 100644 index 00000000..690ff7f6 --- /dev/null +++ b/2760-longest-even-odd-subarray-with-threshold.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} threshold + * @return {number} + */ +var longestAlternatingSubarray = function(nums, threshold) { + let res = 0 + const n = nums.length + for(let i = 0; i < n; i++) { + const e = nums[i] + let j = i, s = i + if(e % 2 === 0 && e <= threshold) { + j++ + while(true) { + if(j >= n) break + if(nums[j] > threshold) break + if( (nums[j] % 2) === (nums[j - 1] % 2) ) break + j++ + } + } + res = Math.max(res, j - i) + } + + return res +}; From a7b2fbb581982371e40bd1bab61e6263ce28bfff Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 Jul 2023 13:56:51 +0800 Subject: [PATCH 1367/2039] Create 2514-count-anagrams.js --- 2514-count-anagrams.js | 60 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 2514-count-anagrams.js diff --git a/2514-count-anagrams.js b/2514-count-anagrams.js new file mode 100644 index 00000000..a8b4e197 --- /dev/null +++ b/2514-count-anagrams.js @@ -0,0 +1,60 @@ +const mod = 1e9 + 7 +const fact = Array(1e5 + 2) +getfact() +// console.log(fact) +/** + * @param {string} s + * @return {number} + */ +const countAnagrams = function (s) { + let ans = 1 + const arr = s.trim().split(' ') + for (const word of arr) { + ans = modmul(ans, ways(word)) + } + + return ans +} + +function modmul(a, b) { + const big = BigInt + return Number(((big(a) % big(mod)) * (big(b) % big(mod))) % big(mod)) +} + +function binExpo(a, b) { + if (b === 0) return 1 + let res = binExpo(a, Math.floor(b / 2)) + if (b & 1) { + return modmul(a, modmul(res, res)) + } else { + return modmul(res, res) + } +} + +function modmulinv(a) { + return binExpo(a, mod - 2) +} + +function getfact() { + fact[0] = 1 + for (let i = 1; i <= 100001; i++) { + fact[i] = modmul(fact[i - 1], i) + } +} + +function ways(str) { + const freq = Array(26).fill(0) + const a = 'a'.charCodeAt(0) + for (let i = 0; i < str.length; i++) { + freq[str.charCodeAt(i) - a]++ + } + + let totalWays = fact[str.length] + + let factR = 1 + for (let i = 0; i < 26; i++) { + factR = modmul(factR, fact[freq[i]]) + } + // console.log(freq, totalWays, factR) + return modmul(totalWays, modmulinv(factR)) +} From 865c6111d3c1f754f8349490c5769cb9cceffbbd Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Jul 2023 19:26:07 +0800 Subject: [PATCH 1368/2039] Update 1830-minimum-number-of-operations-to-make-string-sorted.js --- ...ber-of-operations-to-make-string-sorted.js | 63 +++++++++++++++++++ 1 file changed, 63 insertions(+) diff --git a/1830-minimum-number-of-operations-to-make-string-sorted.js b/1830-minimum-number-of-operations-to-make-string-sorted.js index e7808cbd..702e0c27 100644 --- a/1830-minimum-number-of-operations-to-make-string-sorted.js +++ b/1830-minimum-number-of-operations-to-make-string-sorted.js @@ -1,3 +1,66 @@ +/** + * @param {string} s + * @return {number} + */ +const makeStringSorted = function (s) { + const mod = 1e9 + 7, + n = s.length + const a = 'a'.charCodeAt(0) + let res = 0 + const freq = Array(26).fill(0) + for (let c of s) { + freq[c.charCodeAt(0) - a]++ + } + const fact = Array(n + 1).fill(1) + getfact() + let l = n + for (let c of s) { + l-- + let t = 0, + rev = 1 + for (let i = 0; i < 26; i++) { + if (i < c.charCodeAt(0) - a) t += freq[i] + rev = modmul(rev, fact[freq[i]]) + } + res += modmul(modmul(t, fact[l]), binExpo(rev, mod - 2)) + res %= mod + freq[c.charCodeAt(0) - a]-- + } + return res + + function modmul(a, b) { + const big = BigInt + return Number(((big(a) % big(mod)) * (big(b) % big(mod))) % big(mod)) + } + + function binExpo(a, b) { + if (b === 0) return 1 + let res = binExpo(a, Math.floor(b / 2)) + if (b & 1) { + return modmul(a, modmul(res, res)) + } else { + return modmul(res, res) + } + } + + function modmulinv(a) { + return binExpo(a, mod - 2) + } + + function getfact() { + fact[0] = 1 + for (let i = 1; i <= 3000; i++) { + fact[i] = modmul(fact[i - 1], i) + } + } + +} + + +// another + + + /** * @param {string} s * @return {number} From 86552ba3428a9b1a14aad0bae5c35f101fead4e5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 5 Jul 2023 12:38:15 +0800 Subject: [PATCH 1369/2039] Create 2543-check-if-point-is-reachable.js --- 2543-check-if-point-is-reachable.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2543-check-if-point-is-reachable.js diff --git a/2543-check-if-point-is-reachable.js b/2543-check-if-point-is-reachable.js new file mode 100644 index 00000000..c10a2f9f --- /dev/null +++ b/2543-check-if-point-is-reachable.js @@ -0,0 +1,13 @@ +/** + * @param {number} targetX + * @param {number} targetY + * @return {boolean} + */ +const isReachable = function(targetX, targetY) { + const g = gcd(targetX, targetY) + return (g & (g - 1)) === 0 + + function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) + } +}; From 3bbdcb87770a52172cca1801220350fed2f79c38 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 6 Jul 2023 13:23:53 +0800 Subject: [PATCH 1370/2039] Create 2607-make-k-subarray-sums-equal.js --- 2607-make-k-subarray-sums-equal.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2607-make-k-subarray-sums-equal.js diff --git a/2607-make-k-subarray-sums-equal.js b/2607-make-k-subarray-sums-equal.js new file mode 100644 index 00000000..a208b2f7 --- /dev/null +++ b/2607-make-k-subarray-sums-equal.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +const makeSubKSumEqual = function(arr, k) { + let res = 0 + const n = arr.length + for(let i = 0; i < n; i++) { + const tmp = [] + for(let j = i; arr[j] !== 0; j = (j + k) % n) { + tmp.push(arr[j]) + arr[j] = 0 + } + tmp.sort((a, b) => a - b) + const mid = tmp[~~(tmp.length / 2)] + for(const e of tmp) { + res += Math.abs(e - mid) + } + } + + + return res +}; From c9410785d88d05f70f4f7b69a3d83e5d340bc245 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 7 Jul 2023 20:37:36 +0800 Subject: [PATCH 1371/2039] Update 357-count-numbers-with-unique-digits.js --- 357-count-numbers-with-unique-digits.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/357-count-numbers-with-unique-digits.js b/357-count-numbers-with-unique-digits.js index 9aca0ff3..03018011 100755 --- a/357-count-numbers-with-unique-digits.js +++ b/357-count-numbers-with-unique-digits.js @@ -1,3 +1,23 @@ +/** + * @param {number} n + * @return {number} + */ +const countNumbersWithUniqueDigits = function(n) { + if(n === 0) return 1 + let res = 10 + let uniqueDigits = 9, avail = 9 + while(n > 1 && avail) { + uniqueDigits = uniqueDigits * avail + res += uniqueDigits + avail-- + n-- + } + + return res +}; + +// another + /** * @param {number} n * @return {number} From 845a84ae3c099abf7eb08e0bfe3ab913a0ab377c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jul 2023 17:59:14 +0800 Subject: [PATCH 1372/2039] Update 233-number-of-digit-one.js --- 233-number-of-digit-one.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/233-number-of-digit-one.js b/233-number-of-digit-one.js index 938403e6..e672d63f 100644 --- a/233-number-of-digit-one.js +++ b/233-number-of-digit-one.js @@ -1,3 +1,29 @@ +/** + * @param {number} n + * @return {number} + */ +const countDigitOne = function(n) { + return countNum(1, n + 1) +}; + +// Counts the number of `digit` in the range [0, limit) +function countNum( digit, limit) { + let count = 0; + let factor = 1; + let tail = 0; + while (limit >= 10) { + let d = limit % 10; + limit = ~~(limit / 10); + count += limit * factor; + count += d > digit ? factor : d == digit ? tail : 0; + tail += d * factor; + factor *= 10; + } + return count + (limit > digit ? factor : limit == digit ? tail : 0); +} + +// another + /** * @param {number} n * @return {number} From 89ab6857950032d1aecc1134d6d757fa85e5413c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jul 2023 18:06:09 +0800 Subject: [PATCH 1373/2039] Create 2769-find-the-maximum-achievable-number.js --- 2769-find-the-maximum-achievable-number.js | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 2769-find-the-maximum-achievable-number.js diff --git a/2769-find-the-maximum-achievable-number.js b/2769-find-the-maximum-achievable-number.js new file mode 100644 index 00000000..db0ac464 --- /dev/null +++ b/2769-find-the-maximum-achievable-number.js @@ -0,0 +1,8 @@ +/** + * @param {number} num + * @param {number} t + * @return {number} + */ +const theMaximumAchievableX = function(num, t) { + return 2 * t + num +}; From b86709430cb25947554bfdf534b3ccebe1e4c385 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jul 2023 18:06:40 +0800 Subject: [PATCH 1374/2039] Create 2770-maximum-number-of-jumps-to-reach-the-last-index.js --- ...number-of-jumps-to-reach-the-last-index.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2770-maximum-number-of-jumps-to-reach-the-last-index.js diff --git a/2770-maximum-number-of-jumps-to-reach-the-last-index.js b/2770-maximum-number-of-jumps-to-reach-the-last-index.js new file mode 100644 index 00000000..e1c26db5 --- /dev/null +++ b/2770-maximum-number-of-jumps-to-reach-the-last-index.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var maximumJumps = function(nums, target) { + const n = nums.length + const dp = Array(n).fill(-1) + dp[0] = 0 + for(let i = 0; i < n; i++) { + if(dp[i] === -1) continue + for(let j = i + 1; j < n; j++) { + if (nums[j] - nums[i] <= target && nums[j] - nums[i] >= -target) { + dp[j] = Math.max(dp[j], dp[i] + 1) + } + } + } + + return dp.at(-1) +}; + From aa333ddd8f330f45b180732c43ac5cdd442a392e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jul 2023 18:07:12 +0800 Subject: [PATCH 1375/2039] Create 2771-longest-non-decreasing-subarray-from-two-arrays.js --- ...non-decreasing-subarray-from-two-arrays.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2771-longest-non-decreasing-subarray-from-two-arrays.js diff --git a/2771-longest-non-decreasing-subarray-from-two-arrays.js b/2771-longest-non-decreasing-subarray-from-two-arrays.js new file mode 100644 index 00000000..5435776a --- /dev/null +++ b/2771-longest-non-decreasing-subarray-from-two-arrays.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maxNonDecreasingLength = function(nums1, nums2) { + const n = nums1.length + let dp = Array(3).fill(1) + let ans = 1 + const { max } = Math + for(let i = 1; i < n; i++) { + const nextDp = Array(3).fill(1) + if (nums1[i] >= nums1[i - 1]) { + nextDp[1] = max(nextDp[1], dp[1] + 1) + } + if (nums1[i] >= nums2[i - 1]) { + nextDp[1] = max(nextDp[1], dp[2] + 1) + } + if (nums2[i] >= nums1[i - 1]) { + nextDp[2] = max(nextDp[2], dp[1] + 1) + } + if (nums2[i] >= nums2[i - 1]) { + nextDp[2] = max(nextDp[2], dp[2] + 1) + } + dp = nextDp + // console.log(dp, nextDp) + ans = max(ans, max(...dp)) + } + return ans +}; + From 83622e7d7188e90832083293f72a877466d673a7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jul 2023 18:07:46 +0800 Subject: [PATCH 1376/2039] Create 2772-apply-operations-to-make-all-array-elements-equal-to-zero.js --- ...o-make-all-array-elements-equal-to-zero.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2772-apply-operations-to-make-all-array-elements-equal-to-zero.js diff --git a/2772-apply-operations-to-make-all-array-elements-equal-to-zero.js b/2772-apply-operations-to-make-all-array-elements-equal-to-zero.js new file mode 100644 index 00000000..bbc33d1e --- /dev/null +++ b/2772-apply-operations-to-make-all-array-elements-equal-to-zero.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {boolean} + */ +var checkArray = function(nums, k) { + let cur = 0 + let diff = Array(nums.length).fill(0) + const n = nums.length + for(let i = 0; i < n; i++) { + if (nums[i] != cur) { + diff[i] += nums[i] - cur + if( (i + k - 1) >= n ) return false + diff[i + k - 1] -= nums[i] - cur + } + if (nums[i] < cur) return false + cur += diff[i] + } + return true +}; From 20b791bf8b9d2925d3745d7f4f629d7390f62eff Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Jul 2023 23:06:31 +0800 Subject: [PATCH 1377/2039] Update 233-number-of-digit-one.js --- 233-number-of-digit-one.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/233-number-of-digit-one.js b/233-number-of-digit-one.js index e672d63f..82678200 100644 --- a/233-number-of-digit-one.js +++ b/233-number-of-digit-one.js @@ -1,3 +1,31 @@ +/** + * @param {number} n + * @return {number} + */ +const countDigitOne = function(n) { + let res = 0 + const str = `${n}` + const len = str.length, { pow } = Math + + for(let i = 1; i <= len; i++) { + const pre = ~~(n / pow(10, i)) + const remain = n % (pow(10, i - 1)) + const post = pow(10, i - 1) + res += pre * post + const e = +(str[len - i]) + if(e > 1) { + res += pow(10, i - 1) + } else if(e === 1) { + res += remain + 1 + } + } + + return res +}; + + +// another + /** * @param {number} n * @return {number} From e06f56018cffb04f9e0e872d136d59387bf208fc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Jul 2023 17:24:27 +0800 Subject: [PATCH 1378/2039] Update 1067-digit-count-in-range.js --- 1067-digit-count-in-range.js | 47 ++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1067-digit-count-in-range.js b/1067-digit-count-in-range.js index 55a147f6..7b75d18d 100644 --- a/1067-digit-count-in-range.js +++ b/1067-digit-count-in-range.js @@ -1,3 +1,50 @@ +/** + * @param {number} d + * @param {number} low + * @param {number} high + * @return {number} + */ +const digitsCount = function(d, low, high) { + return countDigit(high, d) - countDigit(low - 1, d) +}; +function countDigit(limit, d) { + let res = 0 + const str = `${limit}` + const len = str.length + const { pow } = Math + if(d === 0) { + for(let i = 1; i < len; i++) { + const pre = ~~(limit / pow(10, i)) + const post = pow(10, i - 1) + res += (pre - 1) * post + const e = +str[len - i] + if(e > d) { + res += post + } else if(e === d) { + res += (limit % post) + 1 + } + } + } else { + for(let i = 1; i <= len; i++) { + const pre = ~~(limit / pow(10, i)) + const post = pow(10, i - 1) + res += pre * post + const e = +str[len - i] + if(e > d) { + res += post + } else if(e === d) { + res += (limit % post) + 1 + } + } + } + + + return res +} + + +// another + /** * @param {number} d * @param {number} low From 95401de9a0c69abff59a395393f4e025828191c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Jul 2023 15:02:30 +0800 Subject: [PATCH 1379/2039] Update 902-numbers-at-most-n-given-digit-set.js --- 902-numbers-at-most-n-given-digit-set.js | 35 ++++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/902-numbers-at-most-n-given-digit-set.js b/902-numbers-at-most-n-given-digit-set.js index c45b9fef..8793d275 100644 --- a/902-numbers-at-most-n-given-digit-set.js +++ b/902-numbers-at-most-n-given-digit-set.js @@ -1,3 +1,38 @@ +/** + * @param {string[]} digits + * @param {number} n + * @return {number} + */ +const atMostNGivenDigitSet = function(digits, n) { + let res = 0 + const str = `${n}`, len = str.length + const { pow } = Math, base = digits.length + for(let i = 1; i < len; i++) { + res += pow(base, i) + } + + dfs(0) + + return res + + function dfs(pos) { + if(pos === len) { + res++ + return + } + for(const ch of digits) { + if(str[pos] > ch) { + res += pow(base, len - 1 - pos) + } else if(str[pos] === ch) { + dfs(pos + 1) + } + } + } +}; + +// another + + /** * @param {string[]} digits * @param {number} n From cda02c04c769741d5defebbb239f269b77b0d375 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Jul 2023 15:08:26 +0800 Subject: [PATCH 1380/2039] Update 902-numbers-at-most-n-given-digit-set.js --- 902-numbers-at-most-n-given-digit-set.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/902-numbers-at-most-n-given-digit-set.js b/902-numbers-at-most-n-given-digit-set.js index 8793d275..2e5da545 100644 --- a/902-numbers-at-most-n-given-digit-set.js +++ b/902-numbers-at-most-n-given-digit-set.js @@ -25,7 +25,7 @@ const atMostNGivenDigitSet = function(digits, n) { res += pow(base, len - 1 - pos) } else if(str[pos] === ch) { dfs(pos + 1) - } + } else break } } }; From 50f8904322d06dc17b0dc04282c58f6defe48123 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 13 Jul 2023 14:41:24 +0800 Subject: [PATCH 1381/2039] Update 60-permutation-sequence.js --- 60-permutation-sequence.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/60-permutation-sequence.js b/60-permutation-sequence.js index f25ea1a4..ea812807 100644 --- a/60-permutation-sequence.js +++ b/60-permutation-sequence.js @@ -62,6 +62,36 @@ const getPermutation = function(n, k) { // another +/** + * @param {number} n + * @param {number} k + * @return {string} + */ +const getPermutation = function(n, k) { + const fact = [] + const nums = [] + for(let i = 1; i <= n; i++) { + nums.push(i) + } + fact[0] = 1 + for(let i = 1, tmp = 1; i <= n; i++) { + tmp *= i + fact[i] = tmp + } + let res = '' + k-- + for(let i = 1; i <= n; i++) { + const idx = ~~(k / fact[n - i]) + res += nums[idx] + nums.splice(idx, 1) + k -= idx * fact[n - i] + } + + return res +}; + +// another + /** * @param {number} n * @param {number} k From dec9c086dba3897e978509e62b64550814ce9103 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 15 Jul 2023 13:50:13 +0800 Subject: [PATCH 1382/2039] Update 992-subarrays-with-k-different-integers.js --- 992-subarrays-with-k-different-integers.js | 29 ++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/992-subarrays-with-k-different-integers.js b/992-subarrays-with-k-different-integers.js index ed497d7b..f597e751 100644 --- a/992-subarrays-with-k-different-integers.js +++ b/992-subarrays-with-k-different-integers.js @@ -1,3 +1,32 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const subarraysWithKDistinct = function(nums, k) { + return mostK(k) - mostK(k - 1) + function mostK(limit) { + const map = new Map() + let i = 0, j = 0, res = 0 + const n = nums.length + for(; j< n; j++) { + const e = nums[j] + map.set(e, (map.get(e) || 0) + 1) + while(map.size > limit) { + const tmp = nums[i] + map.set(tmp, (map.get(tmp) || 0) - 1) + if(map.get(tmp) === 0) map.delete(tmp) + i++ + } + res += j - i + 1 + } + + return res + } +}; + +// another + /** * @param {number[]} A * @param {number} K From 8f38541dcd8cdc3ce3697628ffbd994d582bc01b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jul 2023 18:19:06 +0800 Subject: [PATCH 1383/2039] Create 2781-length-of-the-longest-valid-substring.js --- 2781-length-of-the-longest-valid-substring.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2781-length-of-the-longest-valid-substring.js diff --git a/2781-length-of-the-longest-valid-substring.js b/2781-length-of-the-longest-valid-substring.js new file mode 100644 index 00000000..d938a9be --- /dev/null +++ b/2781-length-of-the-longest-valid-substring.js @@ -0,0 +1,18 @@ +/** + * @param {string} word + * @param {string[]} forbidden + * @return {number} + */ +var longestValidSubstring = function(word, forbidden) { + let setF = new Set(forbidden) + let res = 0, left = 0 + for(let i = 0; i < word.length; i++) { + for(let j = Math.max(left, i - 10); j < i + 1; j++) { + if(setF.has(word.slice(j, i + 1))) { + left = j + 1 + } + } + res = Math.max(res, i - left + 1) + } + return res +}; From bd93f3f26f775ca6f0d57c8d36142bfe45acebe8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jul 2023 18:19:45 +0800 Subject: [PATCH 1384/2039] Create 2780-minimum-index-of-a-valid-split.js --- 2780-minimum-index-of-a-valid-split.js | 30 ++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2780-minimum-index-of-a-valid-split.js diff --git a/2780-minimum-index-of-a-valid-split.js b/2780-minimum-index-of-a-valid-split.js new file mode 100644 index 00000000..99b54191 --- /dev/null +++ b/2780-minimum-index-of-a-valid-split.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minimumIndex = function(nums) { + let n = nums.length + if (n == 1) { + return -1 + } + let mp = {} + let mx = 0 + for (const num of nums) { + if(mp[num] == null) mp[num] = 0 + mp[num]++ + if (mp[num] > n/2) { + mx = num + } + } + let c = 0 + for (let i = 0; i < n-1; i++) { + let num = nums[i] + if (num == mx) { + c++ + } + if (c > (i+1)/2 && mp[mx]-c > (n-i-1)/2) { + return i + } + } + return -1 +}; From a82062f019fc7ddf70f47cb3488c7f47e4bc35f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jul 2023 18:20:45 +0800 Subject: [PATCH 1385/2039] Create 2779-maximum-beauty-of-an-array-after-applying-operation.js --- ...ty-of-an-array-after-applying-operation.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2779-maximum-beauty-of-an-array-after-applying-operation.js diff --git a/2779-maximum-beauty-of-an-array-after-applying-operation.js b/2779-maximum-beauty-of-an-array-after-applying-operation.js new file mode 100644 index 00000000..cd45bff2 --- /dev/null +++ b/2779-maximum-beauty-of-an-array-after-applying-operation.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumBeauty = function(nums, k) { + nums.sort((a, b) => a - b) + let n = nums.length + let res = 0 + let l = 0, r = 0 + while( r < n) { + if (nums[l]+k >= nums[r]-k) { + if (r-l+1 > res) { + res = r - l + 1 + } + r++ + } else { + l++ + } + } + if (r-l > res) { + res = r - l + } + return res +}; From 9a5e8712704c49780fb0658073ddfff4fb8cd3fa Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jul 2023 18:21:15 +0800 Subject: [PATCH 1386/2039] Create 2778-sum-of-squares-of-special-elements.js --- 2778-sum-of-squares-of-special-elements.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2778-sum-of-squares-of-special-elements.js diff --git a/2778-sum-of-squares-of-special-elements.js b/2778-sum-of-squares-of-special-elements.js new file mode 100644 index 00000000..621da5ef --- /dev/null +++ b/2778-sum-of-squares-of-special-elements.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var sumOfSquares = function(nums) { + const n = nums.length + let res = 0 + + for(let i = 1; i <= n; i++) { + if(n % i === 0) res += nums[i - 1] ** 2 + } + + return res +}; From cf014f9a2265eb52b87d2c9de6154e41d70d80c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 Jul 2023 11:30:16 +0800 Subject: [PATCH 1387/2039] Create 2537-count-the-number-of-good-subarrays.js --- 2537-count-the-number-of-good-subarrays.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2537-count-the-number-of-good-subarrays.js diff --git a/2537-count-the-number-of-good-subarrays.js b/2537-count-the-number-of-good-subarrays.js new file mode 100644 index 00000000..31b95aae --- /dev/null +++ b/2537-count-the-number-of-good-subarrays.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countGood = function(nums, k) { + let res = 0; + const count = new Map() + for(let i = 0, j = 0; j < nums.length; ++j){ + k -= count.get(nums[j]) || 0; + count.set(nums[j], (count.get(nums[j]) || 0) + 1); + while(k <= 0) { + count.set(nums[i],count.get(nums[i]) - 1); + k += count.get(nums[i]); + i++ + } + res += i; + } + return res; +}; From ca489ca0a5c9118afe99ee0f051aba55873f266b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 Jul 2023 12:13:53 +0800 Subject: [PATCH 1388/2039] Update 2537-count-the-number-of-good-subarrays.js --- 2537-count-the-number-of-good-subarrays.js | 39 ++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/2537-count-the-number-of-good-subarrays.js b/2537-count-the-number-of-good-subarrays.js index 31b95aae..58df8f51 100644 --- a/2537-count-the-number-of-good-subarrays.js +++ b/2537-count-the-number-of-good-subarrays.js @@ -1,3 +1,42 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countGood = function(nums, k) { + let res = 0, total = 0 + const cnt = {}, n = nums.length + + for(let i = 0, j = 0; i < n; i++) { + + while(j < n && total < k) { + total += diff(nums[j], 1) + cnt[nums[j]] = (cnt[nums[j]] || 0) + 1 + j++ + } + + if(total >= k) { + res += n - j + 1 + } + total += diff(nums[i], -1) + cnt[nums[i]]-- + } + + return res + + function diff(num, delta) { + const pre = cnt[num] || 0 + const old = pre * (pre - 1) / 2 + const post = pre + delta + const cur = post * (post - 1) / 2 + + return cur - old + } +}; + +// another + + /** * @param {number[]} nums * @param {number} k From c186fb1f55cad54e0eaeacc965d6eaffcfcec58f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Jul 2023 12:33:29 +0800 Subject: [PATCH 1389/2039] Create 2564-substring-xor-queries.js --- 2564-substring-xor-queries.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2564-substring-xor-queries.js diff --git a/2564-substring-xor-queries.js b/2564-substring-xor-queries.js new file mode 100644 index 00000000..f689aefb --- /dev/null +++ b/2564-substring-xor-queries.js @@ -0,0 +1,30 @@ +/** + * @param {string} s + * @param {number[][]} queries + * @return {number[][]} + */ +const substringXorQueries = function(s, queries) { + const n = s.length, q = queries.length + const res = [] + const map = {}, { max, min } = Math, int = parseInt, big = BigInt + + for(let i = 0; i < n; i++) { + if(s[i] === '0') { + if(map[0] == null) map[0] = [i, i] + continue + } + let num = 0n + for(let j = i; j <= min(i + 32, n - 1); j++) { + num = (num << 1n) + big(int(s[j])) + if(map[num] == null) map[num] = [i, j] + } + } + for(let i = 0; i < q; i++) { + const [fir, sec] = queries[i] + const num = fir ^ sec + if(map[num] != null) res.push([...map[num]]) + else res.push([-1, -1]) + } + + return res +}; From a512dae8ef3f377884b99bd029ea14034340de7c Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Jul 2023 17:27:01 +0800 Subject: [PATCH 1390/2039] Create 2730-find-the-longest-semi-repetitive-substring.js --- ...d-the-longest-semi-repetitive-substring.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2730-find-the-longest-semi-repetitive-substring.js diff --git a/2730-find-the-longest-semi-repetitive-substring.js b/2730-find-the-longest-semi-repetitive-substring.js new file mode 100644 index 00000000..cfb15f6b --- /dev/null +++ b/2730-find-the-longest-semi-repetitive-substring.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @return {number} + */ +const longestSemiRepetitiveSubstring = function(s) { + let res = 1 + let i = 0, j = 1, last = 0 + while(j < s.length) { + if(s[j] === s[j - 1]) { + if(last) i = last + last = j + } + + res = Math.max(res, j - i + 1) + j++ + } + + return res +}; From badd49c2eb1d1d81ba7d05b806a23d963c9e6a6d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 20 Jul 2023 21:25:44 +0800 Subject: [PATCH 1391/2039] Update 2762-continuous-subarrays.js --- 2762-continuous-subarrays.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2762-continuous-subarrays.js b/2762-continuous-subarrays.js index 54ab362a..d812a6f4 100644 --- a/2762-continuous-subarrays.js +++ b/2762-continuous-subarrays.js @@ -1,3 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const continuousSubarrays = function(nums) { + let res = 0 + let l = 0 + let r = 0 + const mq1 = [], mq2 = [] + for(let r = 0; r < nums.length; r++) { + const e = nums[r] + while(mq1.length && nums[mq1.at(-1)] < e) mq1.pop() + mq1.push(r) + while(mq2.length && nums[mq2.at(-1)] > e) mq2.pop() + mq2.push(r) + + while(mq1.length && mq2.length && Math.abs(nums[mq1[0]] - nums[mq2[0]]) > 2) { + if(mq1.length && mq1[0] <= l) mq1.shift() + if(mq2.length && mq2[0] <= l) mq2.shift() + l++ + } + + res += r - l + 1 + } + return res +}; + + +// another + + /** * @param {number[]} nums * @return {number} From 992c6c7df4fa8a8228e08be70e9b59533a554703 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Jul 2023 19:49:28 +0800 Subject: [PATCH 1392/2039] Create 2747-count-zero-request-servers.js --- 2747-count-zero-request-servers.js | 56 ++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 2747-count-zero-request-servers.js diff --git a/2747-count-zero-request-servers.js b/2747-count-zero-request-servers.js new file mode 100644 index 00000000..58b6a4f9 --- /dev/null +++ b/2747-count-zero-request-servers.js @@ -0,0 +1,56 @@ +/** + * @param {number} n + * @param {number[][]} logs + * @param {number} x + * @param {number[]} queries + * @return {number[]} + */ +const countServers = function(n, logs, x, queries) { +let queryArr = [], + ans = [] +for (let i = 0; i < queries.length; i++) { + queryArr.push([i, queries[i]]) +} +queryArr.sort(function (a, b) { + return a[1] - b[1] +}) +logs.sort(function (a, b) { + return a[1] - b[1] +}) + +let sumOfServersInCurrentTimeWindow = 0, + serverFrequenceyInCurrentTimeWindow = [] +for (let i = 0, left = 0, right = 0; i < queryArr.length; i++) { + let queryIndex = queryArr[i][0] + let startTime = queryArr[i][1] - x //Start time for the current query + let endTime = queryArr[i][1] //End time for the current query + while (right < logs.length && logs[right][1] <= endTime) { + //Include all the servers till endTime + let s = logs[right][0] + if ( + serverFrequenceyInCurrentTimeWindow[s] === undefined || + serverFrequenceyInCurrentTimeWindow[s] === 0 + ) { + serverFrequenceyInCurrentTimeWindow[s] = 1 + sumOfServersInCurrentTimeWindow++ + } else { + serverFrequenceyInCurrentTimeWindow[s] += 1 + } + right++ + } + while (left < logs.length && logs[left][1] < startTime) { + //Exclude all the servers older than startTime + let s = logs[left][0] + if (serverFrequenceyInCurrentTimeWindow[s] === 1) { + serverFrequenceyInCurrentTimeWindow[s] = 0 + sumOfServersInCurrentTimeWindow-- + } else { + serverFrequenceyInCurrentTimeWindow[s] -= 1 + } + left++ + } + ans[queryIndex] = n - sumOfServersInCurrentTimeWindow +} +return ans + +}; From d2add3e8c91c217a94d71ceb4671934d8114064f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 22 Jul 2023 19:46:28 +0800 Subject: [PATCH 1393/2039] Create 1503-last-moment-before-all-ants-fall-out-of-a-plank.js --- ...oment-before-all-ants-fall-out-of-a-plank.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1503-last-moment-before-all-ants-fall-out-of-a-plank.js diff --git a/1503-last-moment-before-all-ants-fall-out-of-a-plank.js b/1503-last-moment-before-all-ants-fall-out-of-a-plank.js new file mode 100644 index 00000000..af5ef123 --- /dev/null +++ b/1503-last-moment-before-all-ants-fall-out-of-a-plank.js @@ -0,0 +1,17 @@ +/** + * @param {number} n + * @param {number[]} left + * @param {number[]} right + * @return {number} + */ +var getLastMoment = function(n, left, right) { + left.sort(function(a,b){return a-b}); + right.sort(function(a,b){return a-b}); + if(left.length == 0){ + return n-right[0]; + } + if(right.length == 0){ + return left[left.length-1]; + } + return Math.max(left[left.length-1], n-right[0]) +}; From 9ace2333e420ce94fb3d4b10ba3ee29430f6b586 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 Jul 2023 12:06:26 +0800 Subject: [PATCH 1394/2039] Update 735-asteroid-collision.js --- 735-asteroid-collision.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/735-asteroid-collision.js b/735-asteroid-collision.js index 35b768f7..f48a26b0 100644 --- a/735-asteroid-collision.js +++ b/735-asteroid-collision.js @@ -1,3 +1,25 @@ +/** + * @param {number[]} asteroids + * @return {number[]} + */ +const asteroidCollision = function(asteroids) { + const stk = [], n = asteroids.length, {abs} = Math + for(const e of asteroids) { + while(stk.length && stk.at(-1) > 0 && e < 0 && -e > stk.at(-1)) { + stk.pop() + } + if(stk.length && stk.at(-1) > 0 && e < 0 && -e === stk.at(-1)) { + stk.pop() + }else if(stk.length && stk.at(-1) > 0 && e < 0 && -e < stk.at(-1)) { + + }else stk.push(e) + } + return stk +}; + +// another + + /** * @param {number[]} asteroids * @return {number[]} From a852473795b903606852a57e7934f4c24effde58 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Jul 2023 13:16:37 +0800 Subject: [PATCH 1395/2039] Create 2751-robot-collisions.js --- 2751-robot-collisions.js | 45 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 2751-robot-collisions.js diff --git a/2751-robot-collisions.js b/2751-robot-collisions.js new file mode 100644 index 00000000..c45f2602 --- /dev/null +++ b/2751-robot-collisions.js @@ -0,0 +1,45 @@ +/** + * @param {number[]} positions + * @param {number[]} healths + * @param {string} directions + * @return {number[]} + */ +const survivedRobotsHealths = function (positions, healths, directions) { + const p = positions, + h = healths, + d = directions + let m = {}, + res = Array(p.length).fill(0) + p.map((x, i) => (m[x] = d[i] == 'R' ? [h[i], i] : [-h[i], i])) + let a = [] + for (const k in m) a.push(m[k]) + let v = asteroidCollision(a) + for (const [x, i] of v) res[i] = Math.abs(x) + return res.filter((x) => x != 0) +} + +function asteroidCollision(a) { + let st = [] + for (const [x, i] of a) { + st.push([x, i]) + let l, li, sl, sli + if (st.length >= 1) [l, li] = st[st.length - 1] + if (st.length >= 2) [sl, sli] = st[st.length - 2] + while (st.length >= 2 && l < 0 && sl > 0) { + st.pop() + st.pop() + let add, idx + if (-l > sl) { + add = -(-l - 1) + idx = li + } else if (-l < sl) { + add = sl - 1 + idx = sli + } + if (add) st.push([add, idx]) + if (st.length >= 1) [l, li] = st[st.length - 1] + if (st.length >= 2) [sl, sli] = st[st.length - 2] + } + } + return st +} From f01cfcacb5a1c81b94123c5729100d2c02751bf6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jul 2023 19:30:06 +0800 Subject: [PATCH 1396/2039] Create 2799-count-complete-subarrays-in-an-array.js --- 2799-count-complete-subarrays-in-an-array.js | 23 ++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2799-count-complete-subarrays-in-an-array.js diff --git a/2799-count-complete-subarrays-in-an-array.js b/2799-count-complete-subarrays-in-an-array.js new file mode 100644 index 00000000..7218b364 --- /dev/null +++ b/2799-count-complete-subarrays-in-an-array.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countCompleteSubarrays = function(nums) { + const set = new Set(nums) + const size = set.size + + let res = 0 + const n = nums.length + + for(let i = 0; i < n; i++) { + const s = new Set() + s.add(nums[i]) + for(let j = i; j < n; j++) { + s.add(nums[j]) + if(s.size === size) res++ + } + } + + return res + +}; From 62fa7a8c07fcd1170ae19f0661ff9778ef8b048d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jul 2023 19:30:52 +0800 Subject: [PATCH 1397/2039] Create 2798-number-of-employees-who-met-the-target.js --- 2798-number-of-employees-who-met-the-target.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2798-number-of-employees-who-met-the-target.js diff --git a/2798-number-of-employees-who-met-the-target.js b/2798-number-of-employees-who-met-the-target.js new file mode 100644 index 00000000..09b41092 --- /dev/null +++ b/2798-number-of-employees-who-met-the-target.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} hours + * @param {number} target + * @return {number} + */ +var numberOfEmployeesWhoMetTarget = function(hours, target) { + let res = 0 + for(const e of hours) { + if(e >= target) res++ + } + + return res +}; From b7654700b0157abdec5429121ba22d255d66ed64 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jul 2023 19:33:12 +0800 Subject: [PATCH 1398/2039] Create 2801-count-stepping-numbers-in-range.js --- 2801-count-stepping-numbers-in-range.js | 35 +++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2801-count-stepping-numbers-in-range.js diff --git a/2801-count-stepping-numbers-in-range.js b/2801-count-stepping-numbers-in-range.js new file mode 100644 index 00000000..8fbb85c9 --- /dev/null +++ b/2801-count-stepping-numbers-in-range.js @@ -0,0 +1,35 @@ +const minus_mod = (x, y, mod) => ((x - y) % mod + mod) % mod; +const mod = 1e9 + 7, ll = BigInt; +let memo; +const go = (s) => { + memo = new Map(); + return dfs(0, 0, true, false, s); +}; + +const dfs = (i, mask, isLimit, isNum, s) => { + let ke = i + " " + mask + " " + isLimit + " " + isNum; + if (memo.has(ke)) return memo.get(ke); + if (i == s.length) return isNum - '0'; + let res = 0; + if (!isNum) res = dfs(i + 1, mask, false, false, s); + let leading = isNum ? 0 : 1; + let up = isLimit ? s[i] - '0' : 9; + for (let digit = leading; digit <= up; digit++) { + if (!isNum || Math.abs(digit - mask) == 1) { + res += dfs(i + 1, digit, isLimit && digit == up, true, s); + } + } + res %= mod; + memo.set(ke, res); + return res; +}; +/** + * @param {string} low + * @param {string} high + * @return {number} + */ +const countSteppingNumbers = (low, high) => { + let x = go(high), y = go((ll(low) - 1n).toString()); + return minus_mod(x, y, mod); +}; + From 6c71a45493d44974e24b62a83adb87c3fd13f1a4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jul 2023 19:35:08 +0800 Subject: [PATCH 1399/2039] Create 2800-shortest-string-that-contains-three-strings.js --- ...test-string-that-contains-three-strings.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2800-shortest-string-that-contains-three-strings.js diff --git a/2800-shortest-string-that-contains-three-strings.js b/2800-shortest-string-that-contains-three-strings.js new file mode 100644 index 00000000..dd53a0b4 --- /dev/null +++ b/2800-shortest-string-that-contains-three-strings.js @@ -0,0 +1,23 @@ +const lexical_smallest_comp = (x, y) => x < y ? -1 : x > y ? 1 : 0; +const merge = (s, t) => { + if (s.indexOf(t) != -1) return s; + // concat based on suffix + for (let l = Math.min(s.length, t.length); l > 0; l--) { + if (s.slice(-l) == t.slice(0, l)) return s.slice(0, -l) + t; + } + return s + t; +}; +/** + * @param {string} a + * @param {string} b + * @param {string} c + * @return {string} + */ +const minimumString = (a, b, c) => { + let d = [merge(merge(a, b), c), merge(merge(a, c), b), merge(merge(b, a), c), merge(merge(b, c), a), merge(merge(c, a), b), merge(merge(c, b), a)]; + d.sort((x, y) => { + if (x.length != y.length) return x.length - y.length; + return lexical_smallest_comp(x, y); + }) + return d[0]; +}; From a7e66369aa4e8fd4b95d67119c86e0878b5a44e6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jul 2023 20:10:56 +0800 Subject: [PATCH 1400/2039] Update 2799-count-complete-subarrays-in-an-array.js --- 2799-count-complete-subarrays-in-an-array.js | 30 ++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/2799-count-complete-subarrays-in-an-array.js b/2799-count-complete-subarrays-in-an-array.js index 7218b364..dd6d4307 100644 --- a/2799-count-complete-subarrays-in-an-array.js +++ b/2799-count-complete-subarrays-in-an-array.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countCompleteSubarrays = function(nums) { + const set = new Set(nums) + const size = set.size + const hash = new Map() + + let res = 0, i = 0, j = 0 + const n = nums.length + + while(i < n) { + const e = nums[i] + hash.set(e, (hash.get(e) || 0) + 1) + while(j <= i && size === hash.size) { + const pre = nums[j] + hash.set(pre, hash.get(pre) - 1) + if(hash.get(pre) === 0) hash.delete(pre) + res += n - i + j++ + } + i++ + } + + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 505f7647aca05246005aaba39690cd25977a4b6d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 31 Jul 2023 19:10:38 +0800 Subject: [PATCH 1401/2039] Create 2547-minimum-cost-to-split-an-array.js --- 2547-minimum-cost-to-split-an-array.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2547-minimum-cost-to-split-an-array.js diff --git a/2547-minimum-cost-to-split-an-array.js b/2547-minimum-cost-to-split-an-array.js new file mode 100644 index 00000000..a04c2441 --- /dev/null +++ b/2547-minimum-cost-to-split-an-array.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minCost = function (nums, k) { + const n = nums.length, + max = Math.max(...nums), + dp = Array(n + 1).fill(Number.MAX_SAFE_INTEGER) + dp[0] = 0 + for (let i = 0; i < n; i++) { + let f = Array(max + 1).fill(0), + cost = 0 + for (let j = i; j < n; j++) { + f[nums[j]]++ + if (f[nums[j]] == 2) { + cost += 2 + } else if (f[nums[j]] > 2) { + cost++ + } + dp[j + 1] = Math.min(dp[i] + cost + k, dp[j + 1]) + } + } + return dp[n] +} From 0feb7800bd11d00d5a531c6c63ae4af54fa98363 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 31 Jul 2023 19:28:41 +0800 Subject: [PATCH 1402/2039] Update 2547-minimum-cost-to-split-an-array.js --- 2547-minimum-cost-to-split-an-array.js | 27 ++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2547-minimum-cost-to-split-an-array.js b/2547-minimum-cost-to-split-an-array.js index a04c2441..8ff46ae8 100644 --- a/2547-minimum-cost-to-split-an-array.js +++ b/2547-minimum-cost-to-split-an-array.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minCost = function (nums, k) { + const n = nums.length + const dp = Array(n + 1).fill(Infinity) + for(let i = 0; i < n; i++) { + let score = 0, hash = {} + for(let j = i; j >= 0; j--) { + const e = nums[j] + if(hash[e] == null) hash[e] = 0 + hash[e]++ + if(hash[e] === 2) score += 2 + else if(hash[e] > 2) score++ + + if(j > 0) dp[i] = Math.min(dp[i], dp[j - 1] + score + k) + else dp[i] = Math.min(dp[i], score + k) + } + } + + return dp[n - 1] +} + +// another + /** * @param {number[]} nums * @param {number} k From b6173e71cf3be95597865dcf5a338801efb5c486 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Aug 2023 18:58:34 +0800 Subject: [PATCH 1403/2039] Create 2552-count-increasing-quadruplets.js --- 2552-count-increasing-quadruplets.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2552-count-increasing-quadruplets.js diff --git a/2552-count-increasing-quadruplets.js b/2552-count-increasing-quadruplets.js new file mode 100644 index 00000000..b7f08c53 --- /dev/null +++ b/2552-count-increasing-quadruplets.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countQuadruplets = function(nums) { + const B = new Array(nums.length + 1).fill(0); + let quadruplets = 0; + + for (let i = 0; i < nums.length; i += 1) { + let countSmaller = 0; + + for (let j = 0; j < i; j += 1) { + if (nums[j] < nums[i]) { + countSmaller += 1; + quadruplets += B[nums[j]]; + } else { + // countSmaller is all the As nums[j] is the B, nums[i] is C + // so nums[j] is apart of countSmaller A-B-C relationships with nums[i] + B[nums[j]] += countSmaller; + } + } + } + + return quadruplets +}; From 94f0a4d749a528d006f9409cd975c71e812dcd42 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 1 Aug 2023 19:56:20 +0800 Subject: [PATCH 1404/2039] Update 2552-count-increasing-quadruplets.js --- 2552-count-increasing-quadruplets.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2552-count-increasing-quadruplets.js b/2552-count-increasing-quadruplets.js index b7f08c53..89e05c6e 100644 --- a/2552-count-increasing-quadruplets.js +++ b/2552-count-increasing-quadruplets.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countQuadruplets = function(nums) { + let res = 0, n = nums.length + const cnt = Array(n).fill(0) + + for(let j = 0; j < n; j++) { + let preSmall = 0 + for(let i = 0; i < j; i++) { + if(nums[i] < nums[j]) { + preSmall++ + res += cnt[i] + } else if(nums[j] < nums[i]) { + cnt[i] += preSmall + } + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 200f06f228cdf0f0f0e6feaafdef92dee199762f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 2 Aug 2023 11:54:36 +0800 Subject: [PATCH 1405/2039] Create 2522-partition-string-into-substrings-with-values-at-most-k.js --- ...g-into-substrings-with-values-at-most-k.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2522-partition-string-into-substrings-with-values-at-most-k.js diff --git a/2522-partition-string-into-substrings-with-values-at-most-k.js b/2522-partition-string-into-substrings-with-values-at-most-k.js new file mode 100644 index 00000000..706d07c7 --- /dev/null +++ b/2522-partition-string-into-substrings-with-values-at-most-k.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const minimumPartition = function(s, k) { + const n = s.length, m = `${k}`.length + const dp = Array(n + 1).fill(0) + for(let i = 0; i < n; i++) { + if(m === 1 && +s[i] > k) return -1 + } + s = '#' + s + for(let i = 1; i <= n; i++) { + if(i - m + 1 > 0 && s.slice(i - m + 1, i + 1) <= k) { + dp[i] = dp[i - m] + 1 + } else { + dp[i] = dp[Math.max(0, i - m + 1)] + 1 + } + } + + return dp[n] +}; From 4f2aed85b8351cb88c9c5da2564f2d2f55c49682 Mon Sep 17 00:00:00 2001 From: tunakite <113432700+Tunakite03@users.noreply.github.com> Date: Fri, 4 Aug 2023 22:32:24 +0700 Subject: [PATCH 1406/2039] Update 7-reverse-integer.js add another --- 7-reverse-integer.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/7-reverse-integer.js b/7-reverse-integer.js index 4a2fef60..1048c8cf 100755 --- a/7-reverse-integer.js +++ b/7-reverse-integer.js @@ -40,3 +40,22 @@ const reverse = function(num) { if (negative) return result * -1; return result; }; + +// another + +/** + * @param {number} n + * @return {number} + */ +const reverse = (n) => { + if (typeof n !== 'number') { + throw new Error('n must be a number'); + } + let sign = Math.sign(n); + n = Math.abs(n); + if (n < 0) { + return -reverse(-n); + } + let reversed = Number([...n.toString()].reverse().join('')); + return sign * reversed; +} From 5ef3e4b21022a93c7c9a0e8fc129a73224995d08 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 5 Aug 2023 01:06:36 +0800 Subject: [PATCH 1407/2039] Create 2597-the-number-of-beautiful-subsets.js --- 2597-the-number-of-beautiful-subsets.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2597-the-number-of-beautiful-subsets.js diff --git a/2597-the-number-of-beautiful-subsets.js b/2597-the-number-of-beautiful-subsets.js new file mode 100644 index 00000000..308352a3 --- /dev/null +++ b/2597-the-number-of-beautiful-subsets.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var beautifulSubsets = function (nums, k) { + let output = 0 + const pick = function (nums, k) { + if (nums.length > 0) { + for (let i = 0; i < nums.length; i++) { + output++ + let arr = nums.slice(i + 1) + arr = arr.filter((e) => Math.abs(e - nums[i]) != k) + pick(arr, k) + } + } + } + pick(nums, k) + return output +} From 13f90316025a4cb8e12470a67fc4f49a18c7aa8f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Aug 2023 09:19:47 +0800 Subject: [PATCH 1408/2039] Create 2638-count-the-number-of-k-free-subsets.js --- 2638-count-the-number-of-k-free-subsets.js | 36 ++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2638-count-the-number-of-k-free-subsets.js diff --git a/2638-count-the-number-of-k-free-subsets.js b/2638-count-the-number-of-k-free-subsets.js new file mode 100644 index 00000000..5005da89 --- /dev/null +++ b/2638-count-the-number-of-k-free-subsets.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countTheNumOfKFreeSubsets = function (nums, k) { + let res = 1 + const marr = Array.from({ length: k }, () => Array()) + for (const e of nums) { + marr[e % k].push(e) + } + + for (let i = 0; i < k; i++) { + res *= helper(marr[i]) + } + + return res + + function helper(arr) { + arr.sort((a, b) => a - b) + let take = 0, + no_take = 1 + for (let i = 0; i < arr.length; i++) { + let take_temp = take, + no_take_temp = no_take + if (i >= 1 && arr[i] == arr[i - 1] + k) { + take = no_take_temp + no_take = take_temp + no_take_temp + } else { + take = take_temp + no_take_temp + no_take = take_temp + no_take_temp + } + } + return take + no_take + } +} From ba8ffa4529ad9866801f5723ca999d08afadc20a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Aug 2023 19:39:37 +0800 Subject: [PATCH 1409/2039] Create 2810-faulty-keyboard.js --- 2810-faulty-keyboard.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2810-faulty-keyboard.js diff --git a/2810-faulty-keyboard.js b/2810-faulty-keyboard.js new file mode 100644 index 00000000..1eb78b4f --- /dev/null +++ b/2810-faulty-keyboard.js @@ -0,0 +1,16 @@ +/** + * @param {string} s + * @return {string} + */ +const finalString = function(s) { + const arr = [] + for(const ch of s) { + if(ch === 'i') { + arr.reverse() + } else { + arr.push(ch) + } + } + + return arr.join('') +}; From 95601a4c4e6c5d1c390ff14a84514853ceea62d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Aug 2023 19:40:04 +0800 Subject: [PATCH 1410/2039] Create 2811-check-if-it-is-possible-to-split-array.js --- 2811-check-if-it-is-possible-to-split-array.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2811-check-if-it-is-possible-to-split-array.js diff --git a/2811-check-if-it-is-possible-to-split-array.js b/2811-check-if-it-is-possible-to-split-array.js new file mode 100644 index 00000000..bb135222 --- /dev/null +++ b/2811-check-if-it-is-possible-to-split-array.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @param {number} m + * @return {boolean} + */ +const canSplitArray = function(nums, m) { + const n = nums.length + if(n <= 2) return true + for(let i = 1; i < n; i++) { + if(nums[i] + nums[i - 1] >= m) return true + } + return false +}; From bc4c51a226726eaf9bafa3601161561f3d6a85b4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Aug 2023 19:40:43 +0800 Subject: [PATCH 1411/2039] Create 2812-find-the-safest-path-in-a-grid.js --- 2812-find-the-safest-path-in-a-grid.js | 126 +++++++++++++++++++++++++ 1 file changed, 126 insertions(+) create mode 100644 2812-find-the-safest-path-in-a-grid.js diff --git a/2812-find-the-safest-path-in-a-grid.js b/2812-find-the-safest-path-in-a-grid.js new file mode 100644 index 00000000..a30e3a47 --- /dev/null +++ b/2812-find-the-safest-path-in-a-grid.js @@ -0,0 +1,126 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const maximumSafenessFactor = function (grid) { + let n = grid.length, + m = grid[0].length, + ans = Infinity + const { min, abs } = Math + let t = [] + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + if (grid[i][j] == 1) { + t.push([i, j]) // keeping track of each thief + } + } + } + + const vis = Array.from({ length: n }, () => Array(m).fill(0)) + + const pq = new PQ((a, b) => a[0] > b[0]) + let m_dist = Infinity + for (const thieve of t) { + m_dist = Math.min(m_dist, thieve[0] + thieve[1]) // Calculating Manhattan distance between current cell and all thieves + } + let dr = [0, -1, 0, 1], + dc = [-1, 0, 1, 0] + pq.push([m_dist, [0, 0]]) + vis[0][0] = 1 + // int mn_dist = 0; + while (!pq.isEmpty()) { + let temp = pq.pop() + + let dist = temp[0], + r = temp[1][0], + c = temp[1][1] + // mn_dist = min(dist,mn_dist); + if (r == n - 1 && c == m - 1) { + return dist // return path safety when end is reached + } + for (let i = 0; i < 4; i++) { + let nr = r + dr[i] + let nc = c + dc[i] + if (nr >= 0 && nc >= 0 && nr < n && nc < m && !vis[nr][nc]) { + //for every adjacent cell calculate the minimum mahattan distance betwwen cell and thieves. + vis[nr][nc] = 1 + let m_dist = Infinity + for (let thieve of t) { + m_dist = min(m_dist, abs(thieve[0] - nr) + abs(thieve[1] - nc)) + } + + // push the minimum of current distance and the minimum distance of the path till now + pq.push([min(m_dist, dist), [nr, nc]]) + } + } + } + return ans +} + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 5fa58203daa39c53944726917f6c350607f461a8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Aug 2023 19:41:20 +0800 Subject: [PATCH 1412/2039] Create 2813-maximum-elegance-of-a-k-length-subsequence.js --- ...imum-elegance-of-a-k-length-subsequence.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2813-maximum-elegance-of-a-k-length-subsequence.js diff --git a/2813-maximum-elegance-of-a-k-length-subsequence.js b/2813-maximum-elegance-of-a-k-length-subsequence.js new file mode 100644 index 00000000..844e63f9 --- /dev/null +++ b/2813-maximum-elegance-of-a-k-length-subsequence.js @@ -0,0 +1,39 @@ +/** + * @param {number[][]} items + * @param {number} k + * @return {number} + */ +const findMaximumElegance = function (items, k) { + let v = items + let n = v.length + const { max } = Math + v.sort((a, b) => b[0] - a[0]) //sort according to profit + let ans = 0 + let m = {} + for (let i = 0; i < k; i++) { + ans += v[i][0] + if (m[v[i][1]] == null) m[v[i][1]] = 0 + m[v[i][1]]++ + } + let sz = Object.keys(m).length + ans += sz * sz + let res = ans + let j = k - 1 + for (let i = k; i < n; i++) { + if (m[v[i][1]] == 0 || m[v[i][1]] == null) { + //try to increase unique elements + while (j >= 0 && m[v[j][1]] < 2) j-- //finding smallest number in 0 to k-1 whose frequency is more than 1, and removing it to increasing uniquenes of the subsequence + if (j < 0) break //no number found that has frequency more than two + m[v[j][1]]-- + m[v[i][1]]++ + res -= v[j][0] + res += v[i][0] + res -= sz * sz + sz++ + res += sz * sz + j-- + ans = max(ans, res) //keep taking max + } + } + return max(ans, res) +} From 12e56cc5182226fdc5e5d846e8b932d8a479eb63 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Aug 2023 15:57:52 +0800 Subject: [PATCH 1413/2039] Update 956-tallest-billboard.js --- 956-tallest-billboard.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/956-tallest-billboard.js b/956-tallest-billboard.js index 3b2cc2f8..2d322d8e 100644 --- a/956-tallest-billboard.js +++ b/956-tallest-billboard.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} rods + * @return {number} + */ +const tallestBillboard = function(rods) { + const sum = rods.reduce((ac, e) => ac + e, 0) + const dp = Array(sum + 1).fill(-1), { abs, max, min } = Math + dp[0] = 0 + for(const e of rods) { + const bak = dp.slice() + for(let delta = 0; delta <= sum; delta++) { + if(bak[delta] < 0) continue + if(delta + e <= sum) dp[delta + e] = max(dp[delta + e], bak[delta]) + dp[abs(delta - e)] = max(dp[abs(delta - e)], bak[delta] + min(e, delta)) + } + } + + + return dp[0] +}; + + +// another + + /** * @param {number[]} rods * @return {number} From dab2ec364a7c92b0abb066fad7664fa7f94e7feb Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Aug 2023 17:25:17 +0800 Subject: [PATCH 1414/2039] Create 2742-painting-the-walls.js --- 2742-painting-the-walls.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2742-painting-the-walls.js diff --git a/2742-painting-the-walls.js b/2742-painting-the-walls.js new file mode 100644 index 00000000..3bd19770 --- /dev/null +++ b/2742-painting-the-walls.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} cost + * @param {number[]} time + * @return {number} + */ +const paintWalls = function(cost, time) { + const n = cost.length + const cache = {} + + return dfs(n - 1, 0) + + function dfs(i, j) { + if(j > i) return 0 + if(i < 0) return Number.MAX_SAFE_INTEGER + const k = `${i},${j}` + if(cache[k] != null) return cache[k] + + const res = Math.min(dfs(i - 1, j + time[i]) + cost[i], dfs(i - 1, j - 1)) + cache[k] = res + return res + } +}; From 98ca324b1a74df8ffaf1803ec40e3296e5ea67ed Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 9 Aug 2023 11:23:17 +0800 Subject: [PATCH 1415/2039] Create 2786-visit-array-positions-to-maximize-score.js --- ...visit-array-positions-to-maximize-score.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2786-visit-array-positions-to-maximize-score.js diff --git a/2786-visit-array-positions-to-maximize-score.js b/2786-visit-array-positions-to-maximize-score.js new file mode 100644 index 00000000..33007b95 --- /dev/null +++ b/2786-visit-array-positions-to-maximize-score.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @param {number} x + * @return {number} + */ +const maxScore = function(nums, x) { + let even = nums[0] + (nums[0] % 2 ? -x : 0) + let odd = nums[0] + (nums[0] % 2 ? 0 : -x) + + const n = nums.length, { max } = Math + for(let i = 1; i < n; i++) { + const e = nums[i] + if(e % 2 === 1) { + odd = max(even - x, odd) + e + } else { + even = max(even, odd - x) + e + } + } + + return max(even, odd) +}; From d0205e07716b3203c90cdfdb37b800697afc5f02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Aug 2023 12:37:23 +0800 Subject: [PATCH 1416/2039] Create 2787-ways-to-express-an-integer-as-sum-of-powers.js --- ...-to-express-an-integer-as-sum-of-powers.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2787-ways-to-express-an-integer-as-sum-of-powers.js diff --git a/2787-ways-to-express-an-integer-as-sum-of-powers.js b/2787-ways-to-express-an-integer-as-sum-of-powers.js new file mode 100644 index 00000000..4a4161a8 --- /dev/null +++ b/2787-ways-to-express-an-integer-as-sum-of-powers.js @@ -0,0 +1,21 @@ +/** + * @param {number} n + * @param {number} x + * @return {number} + */ +const numberOfWays = function(n, x) { + const dp = Array.from({ length: n + 1 }, () => Array(n + 1).fill(0)) + dp[0][0] = 1 + const mod = 1e9 + 7 + for(let i = 0; i <= n; i++) { + for(let j = 1; j <= n; j++) { + dp[i][j] = (dp[i][j] + dp[i][j - 1]) % mod + const tmp = Math.pow(j, x) + if(i >= tmp) { + dp[i][j] = (dp[i][j] + dp[i - tmp][j - 1]) % mod + } + } + } + + return dp[n][n] +}; From ea6950e788a140f26624270de48c0fff9686798f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 10 Aug 2023 13:08:04 +0800 Subject: [PATCH 1417/2039] Update 2787-ways-to-express-an-integer-as-sum-of-powers.js --- ...-to-express-an-integer-as-sum-of-powers.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/2787-ways-to-express-an-integer-as-sum-of-powers.js b/2787-ways-to-express-an-integer-as-sum-of-powers.js index 4a4161a8..a6311cad 100644 --- a/2787-ways-to-express-an-integer-as-sum-of-powers.js +++ b/2787-ways-to-express-an-integer-as-sum-of-powers.js @@ -1,3 +1,26 @@ +/** + * @param {number} n + * @param {number} x + * @return {number} + */ +const numberOfWays = function(n, x) { + const dp = Array(n + 1).fill(0) + dp[0] = 1 + const mod = 1e9 + 7 + for(let i = 1; i <= n; i++) { + const tmp = Math.pow(i, x) + for(let j = n; j >= tmp; j--) { + + dp[j] = (dp[j] + dp[j - tmp]) % mod + + } + } + + return dp[n] +}; + +// another + /** * @param {number} n * @param {number} x From c593f24579e3dc634576e40cf4f73ee0b7d479a1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Aug 2023 12:58:39 +0800 Subject: [PATCH 1418/2039] Create 2809-minimum-time-to-make-array-sum-at-most-x.js --- ...inimum-time-to-make-array-sum-at-most-x.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2809-minimum-time-to-make-array-sum-at-most-x.js diff --git a/2809-minimum-time-to-make-array-sum-at-most-x.js b/2809-minimum-time-to-make-array-sum-at-most-x.js new file mode 100644 index 00000000..f858ea98 --- /dev/null +++ b/2809-minimum-time-to-make-array-sum-at-most-x.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} x + * @return {number} + */ +const minimumTime = function (nums1, nums2, x) { + let n = nums1.length, + s1 = 0, + s2 = 0 + + let ids = Array(n) + for (let i = 0; i < n; i++) { + ids[i] = i + s1 += nums1[i] + s2 += nums2[i] + } + + ids.sort((i, j) => nums2[i] - nums2[j]) + + let f = new Array(n + 1).fill(0) + for (let i of ids) { + for (let j = n; j > 0; j--) { + f[j] = Math.max(f[j], f[j - 1] + nums1[i] + nums2[i] * j) + } + } + + for (let t = 0; t <= n; t++) { + if (s1 + s2 * t - f[t] <= x) { + return t + } + } + return -1 +} From acd86bbb61c21ec9683addc35dc194956f9c245b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Aug 2023 21:42:12 +0800 Subject: [PATCH 1419/2039] Create 2807-insert-greatest-common-divisors-in-linked-list.js --- ...greatest-common-divisors-in-linked-list.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2807-insert-greatest-common-divisors-in-linked-list.js diff --git a/2807-insert-greatest-common-divisors-in-linked-list.js b/2807-insert-greatest-common-divisors-in-linked-list.js new file mode 100644 index 00000000..9607c762 --- /dev/null +++ b/2807-insert-greatest-common-divisors-in-linked-list.js @@ -0,0 +1,32 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +const insertGreatestCommonDivisors = function(head) { + const dummy = new ListNode() + + dummy.next = head + let cur = head + while(cur.next) { + const val = gcd(cur.val, cur.next.val) + const tmp = new ListNode(val) + const nxt = cur.next + cur.next = tmp + tmp.next = nxt + + cur = nxt + } + + return dummy.next + + function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) + } +}; From c8c16d7cd0bf23bcfbaeff867c7f55478d9e13bb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Aug 2023 13:04:29 +0800 Subject: [PATCH 1420/2039] Update 1631-path-with-minimum-effort.js --- 1631-path-with-minimum-effort.js | 44 ++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/1631-path-with-minimum-effort.js b/1631-path-with-minimum-effort.js index aa094e96..76e5611d 100644 --- a/1631-path-with-minimum-effort.js +++ b/1631-path-with-minimum-effort.js @@ -1,3 +1,47 @@ +/** + * @param {number[][]} heights + * @return {number} + */ +const minimumEffortPath = function(heights) { + const m = heights.length, n = heights[0].length + const { abs, floor } = Math + let l = 0, r= 1e6 + + while(l < r) { + const mid = l + floor((r- l) /2) + if(valid(mid)) { + r = mid + } else { + l = mid + 1 + } + } + + return l + + function valid(effort) { + const visited = Array.from({length:m}, () => Array(n).fill(0)) + const dirs = [[1,0],[-1,0],[0,1],[0,-1]] + let q = [] + q.push([0, 0]) + visited[0][0] = 1 + while(q.length) { + const [x, y] = q.shift() + for(const [dx, dy] of dirs) { + const nx = x + dx, ny = y + dy + if(nx<0 || nx>=m || ny < 0 || ny >= n) continue + if(visited[nx][ny]) continue + if(abs(heights[nx][ny] - heights[x][y]) > effort) continue + q.push([nx,ny]) + visited[nx][ny] = 1 + } + } + + return visited[m - 1][n - 1] === 1 + } +}; + +// another + /** * @param {number[][]} heights * @return {number} From 5880c4d56a81bcde355c26f089e5454fc058fa3f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Aug 2023 19:58:05 +0800 Subject: [PATCH 1421/2039] Create 2818-apply-operations-to-maximize-score.js --- 2818-apply-operations-to-maximize-score.js | 105 +++++++++++++++++++++ 1 file changed, 105 insertions(+) create mode 100644 2818-apply-operations-to-maximize-score.js diff --git a/2818-apply-operations-to-maximize-score.js b/2818-apply-operations-to-maximize-score.js new file mode 100644 index 00000000..e48f7311 --- /dev/null +++ b/2818-apply-operations-to-maximize-score.js @@ -0,0 +1,105 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumScore = function (nums, k) { + const n = nums.length + const factors = Array(n).fill(0) // To store prime factors count for each number + const count = Array(n).fill(0) // To store the count of reachable elements for each element + + // Calculate prime factors count for each number + for (let i = 0; i < n; i++) { + factors[i] = primeFactors(nums[i]) + } + + const stack = [-1] // Monotonic stack to keep track of elements in decreasing order of factors + let curr = 0 + + // Calculate the count of reachable elements for each element + for (let i = 0; i < n; i++) { + while ( + stack[stack.length - 1] !== -1 && + factors[stack[stack.length - 1]] < factors[i] + ) { + curr = stack.pop() + count[curr] = (curr - stack[stack.length - 1]) * (i - curr) + } + stack.push(i) + } + + // Process any remaining elements in the stack + while (stack[stack.length - 1] !== -1) { + curr = stack.pop() + count[curr] = (curr - stack[stack.length - 1]) * (n - curr) + } + + // Create an array of pairs containing elements and their corresponding reachable count + const pairs = Array(n) + for (let i = 0; i < n; i++) { + pairs[i] = [nums[i], count[i]] + } + + // Sort the pairs in descending order of elements + pairs.sort((a, b) => b[0] - a[0]) + + let res = BigInt(1) + const mod = BigInt(1e9 + 7) + + // Calculate the maximum score using modPow and available moves + for (let i = 0; i < pairs.length && k > 0; i++) { + const curr = Math.min(pairs[i][1], k) + res = (res * modPow(BigInt(pairs[i][0]), BigInt(curr), mod)) % mod + k -= curr + } + + return Number(res) // Convert the result to a regular number before returning +} + +/** + * Function to calculate modular exponentiation. + * @param {bigint} x - Base. + * @param {bigint} y - Exponent. + * @param {bigint} m - Modulus. + * @return {bigint} - Result of modular exponentiation. + */ +function modPow(x, y, m) { + if (y === 0n) { + return 1n + } + let p = modPow(x, y / 2n, m) % m + p = (p * p) % m + if (y % 2n === 0n) { + return p + } + return (p * x) % m +} + +/** + * Function to calculate the count of prime factors for a number. + * @param {number} num - Input number. + * @return {number} - Count of prime factors for the input number. + */ +function primeFactors(num) { + let count = 0 + let factor = 2 + const end = Math.sqrt(num) + + while (num > 1 && factor <= end) { + let inc = false + while (num % factor === 0) { + if (!inc) { + count++ + inc = true + } + num /= factor + } + factor++ + } + + if (num > 1) { + count++ + } + + return count +} From 5ea26e68488ec4efe2e90ec7558260d9f6007e59 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Aug 2023 19:58:47 +0800 Subject: [PATCH 1422/2039] Create 2817-minimum-absolute-difference-between-elements-with-constraint.js --- ...erence-between-elements-with-constraint.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2817-minimum-absolute-difference-between-elements-with-constraint.js diff --git a/2817-minimum-absolute-difference-between-elements-with-constraint.js b/2817-minimum-absolute-difference-between-elements-with-constraint.js new file mode 100644 index 00000000..68f63926 --- /dev/null +++ b/2817-minimum-absolute-difference-between-elements-with-constraint.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} x + * @return {number} + */ +var minAbsoluteDifference = function(nums, x) { + const {abs, min, max, floor} = Math + + let res = Infinity + let n = nums.length + for(let i = 0; i < n; i++) { + if( i + x <= n - 1) { + let j = n - 1 - i - x + // abs_var.push() + res = min(res, abs(nums[i] - nums[i + x])) + let g = 1 + while (j > 0) { + // abs_var.push() + res = min(res, abs(nums[i] - nums[i + x + g])) + g += 1 + j -= 1 + } + } + + } + return res +}; From 9a201a6df58aa5c9a00104f718b66bc81fa8377c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Aug 2023 19:59:25 +0800 Subject: [PATCH 1423/2039] Create 2816-double-a-number-represented-as-a-linked-list.js --- ...e-a-number-represented-as-a-linked-list.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2816-double-a-number-represented-as-a-linked-list.js diff --git a/2816-double-a-number-represented-as-a-linked-list.js b/2816-double-a-number-represented-as-a-linked-list.js new file mode 100644 index 00000000..62407097 --- /dev/null +++ b/2816-double-a-number-represented-as-a-linked-list.js @@ -0,0 +1,38 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +var doubleIt = function(head) { + const res = dfs(head) + if(res.val > 9) { + const dummy = new ListNode(1) + dummy.next = res + res.val = res.val % 10 + return dummy + } else return res + + function dfs(node) { + if(node == null) return + const nxt = dfs(node.next) + let val = node.val * 2 + if(nxt && nxt.val > 9) { + val++ + nxt.val = nxt.val % 10 + node.val = val + return node + } else { + node.val = val + return node + } + + } + + +}; From d1b9ab871061897e96fb6164d5ec25a52e5221c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 13 Aug 2023 19:59:53 +0800 Subject: [PATCH 1424/2039] Create 2815-max-pair-sum-in-an-array.js --- 2815-max-pair-sum-in-an-array.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2815-max-pair-sum-in-an-array.js diff --git a/2815-max-pair-sum-in-an-array.js b/2815-max-pair-sum-in-an-array.js new file mode 100644 index 00000000..703a8456 --- /dev/null +++ b/2815-max-pair-sum-in-an-array.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxSum = function(nums) { + let res = -1 + const n = nums.length + + for(let i = 0; i < n - 1; i++) { + const arr = `${nums[i]}`.split('') + arr.sort((a, b) => b - a) + for(let j = 1; j < n; j++) { + if(i === j) continue + const ar = `${nums[j]}`.split('') + ar.sort((a, b) => b - a) + if(arr[0] === ar[0]) { + res = Math.max(res, nums[i] + nums[j]) + } + } + } + + return res +}; From 102d709becee0e843b0bb8dc92cce2d61bc5e9fb Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 14 Aug 2023 21:12:04 +0800 Subject: [PATCH 1425/2039] Update 2812-find-the-safest-path-in-a-grid.js --- 2812-find-the-safest-path-in-a-grid.js | 152 +++++++------------------ 1 file changed, 44 insertions(+), 108 deletions(-) diff --git a/2812-find-the-safest-path-in-a-grid.js b/2812-find-the-safest-path-in-a-grid.js index a30e3a47..73b62e49 100644 --- a/2812-find-the-safest-path-in-a-grid.js +++ b/2812-find-the-safest-path-in-a-grid.js @@ -3,124 +3,60 @@ * @return {number} */ const maximumSafenessFactor = function (grid) { - let n = grid.length, - m = grid[0].length, - ans = Infinity - const { min, abs } = Math - let t = [] - for (let i = 0; i < n; i++) { - for (let j = 0; j < m; j++) { - if (grid[i][j] == 1) { - t.push([i, j]) // keeping track of each thief + const n = grid.length; + const isInBound = (r, c) => r >= 0 && r < n && c >= 0 && c < n; + const dist = new Array(n).fill(0).map(() => new Array(n).fill(Infinity)); + const queue = []; + + for (let r = 0; r < n; r++) { + for (let c = 0; c < n; c++) { + if (grid[r][c] === 1) { + dist[r][c] = 0; + queue.push([r, c]); } } } - const vis = Array.from({ length: n }, () => Array(m).fill(0)) - - const pq = new PQ((a, b) => a[0] > b[0]) - let m_dist = Infinity - for (const thieve of t) { - m_dist = Math.min(m_dist, thieve[0] + thieve[1]) // Calculating Manhattan distance between current cell and all thieves - } - let dr = [0, -1, 0, 1], - dc = [-1, 0, 1, 0] - pq.push([m_dist, [0, 0]]) - vis[0][0] = 1 - // int mn_dist = 0; - while (!pq.isEmpty()) { - let temp = pq.pop() - - let dist = temp[0], - r = temp[1][0], - c = temp[1][1] - // mn_dist = min(dist,mn_dist); - if (r == n - 1 && c == m - 1) { - return dist // return path safety when end is reached - } - for (let i = 0; i < 4; i++) { - let nr = r + dr[i] - let nc = c + dc[i] - if (nr >= 0 && nc >= 0 && nr < n && nc < m && !vis[nr][nc]) { - //for every adjacent cell calculate the minimum mahattan distance betwwen cell and thieves. - vis[nr][nc] = 1 - let m_dist = Infinity - for (let thieve of t) { - m_dist = min(m_dist, abs(thieve[0] - nr) + abs(thieve[1] - nc)) - } + while (queue.length) { + const [r, c] = queue.shift(); + const neighbors = [ + [r + 1, c], + [r - 1, c], + [r, c + 1], + [r, c - 1], + ]; - // push the minimum of current distance and the minimum distance of the path till now - pq.push([min(m_dist, dist), [nr, nc]]) + for (const [nr, nc] of neighbors) { + if (isInBound(nr, nc) && dist[nr][nc] === Infinity) { + dist[nr][nc] = dist[r][c] + 1; + queue.push([nr, nc]); } } } - return ans -} -class PQ { - constructor(comparator = (a, b) => a > b) { - this.heap = [] - this.top = 0 - this.comparator = comparator - } - size() { - return this.heap.length - } - isEmpty() { - return this.size() === 0 - } - peek() { - return this.heap[this.top] - } - push(...values) { - values.forEach((value) => { - this.heap.push(value) - this.siftUp() - }) - return this.size() - } - pop() { - const poppedValue = this.peek() - const bottom = this.size() - 1 - if (bottom > this.top) { - this.swap(this.top, bottom) - } - this.heap.pop() - this.siftDown() - return poppedValue - } - replace(value) { - const replacedValue = this.peek() - this.heap[this.top] = value - this.siftDown() - return replacedValue - } + const maxDistance = new Array(n).fill(0).map(() => new Array(n).fill(0)); + maxDistance[0][0] = dist[0][0]; + queue.push([0, 0]); - parent = (i) => ((i + 1) >>> 1) - 1 - left = (i) => (i << 1) + 1 - right = (i) => (i + 1) << 1 - greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) - swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) - siftUp = () => { - let node = this.size() - 1 - while (node > this.top && this.greater(node, this.parent(node))) { - this.swap(node, this.parent(node)) - node = this.parent(node) - } - } - siftDown = () => { - let node = this.top - while ( - (this.left(node) < this.size() && this.greater(this.left(node), node)) || - (this.right(node) < this.size() && this.greater(this.right(node), node)) - ) { - let maxChild = - this.right(node) < this.size() && - this.greater(this.right(node), this.left(node)) - ? this.right(node) - : this.left(node) - this.swap(node, maxChild) - node = maxChild + while (queue.length) { + const [r, c] = queue.shift(); + const neighbors = [ + [r + 1, c], + [r - 1, c], + [r, c + 1], + [r, c - 1], + ]; + + for (const [nr, nc] of neighbors) { + if (isInBound(nr, nc)) { + const newDistance = Math.min(maxDistance[r][c], dist[nr][nc]); + if (newDistance > maxDistance[nr][nc]) { + maxDistance[nr][nc] = newDistance; + queue.push([nr, nc]); + } + } } } + + return maxDistance[n - 1][n - 1]; } From a5353e90237335056fd526fa6ec05f46a9b44b32 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 15 Aug 2023 14:01:32 +0800 Subject: [PATCH 1426/2039] Update 778-swim-in-rising-water.js --- 778-swim-in-rising-water.js | 43 +++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/778-swim-in-rising-water.js b/778-swim-in-rising-water.js index 43f52c67..c39e9372 100644 --- a/778-swim-in-rising-water.js +++ b/778-swim-in-rising-water.js @@ -1,3 +1,46 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const swimInWater = function(grid) { + const n = grid.length + const limit = n * n, { floor } = Math + let l = 0, r = limit - 1 + + while(l < r) { + const mid = l + floor((r - l) / 2) + if(valid(mid)) r = mid + else l = mid + 1 + } + + return l + + + function valid(h) { + const visited = Array.from({ length: n }, () => Array(n).fill(0)) + if(grid[0][0] > h) return false + return dfs(h, 0, 0, visited) + } + + function dfs(h, i, j, visited) { + if(i === n - 1 && j === n - 1) return true + const dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]] + visited[i][j] = 1 + for(const [dx, dy] of dirs) { + const nx = i + dx, ny = j + dy + if(nx >= 0 && nx < n && ny >= 0 && ny < n && visited[nx][ny] === 0 && grid[nx][ny] <= h) { + if(dfs(h, nx, ny, visited)) return true + } + + } + + return false + } +}; + +// another + + /** * @param {number[][]} grid * @return {number} From 7d24af747e4d291685c94f1de5117d26755b6c0c Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Aug 2023 16:23:03 +0800 Subject: [PATCH 1427/2039] Create 2667-create-hello-world-function.js --- 2667-create-hello-world-function.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2667-create-hello-world-function.js diff --git a/2667-create-hello-world-function.js b/2667-create-hello-world-function.js new file mode 100644 index 00000000..d4dcdbfa --- /dev/null +++ b/2667-create-hello-world-function.js @@ -0,0 +1,13 @@ +/** + * @return {Function} + */ +var createHelloWorld = function() { + return function(...args) { + return 'Hello World' + } +}; + +/** + * const f = createHelloWorld(); + * f(); // "Hello World" + */ From 3fbd239425b2908a44422f02901abfb2aa9d2f16 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Aug 2023 16:53:47 +0800 Subject: [PATCH 1428/2039] Create 1491-average-salary-excluding-the-minimum-and-maximum-salary.js --- ...salary-excluding-the-minimum-and-maximum-salary.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 1491-average-salary-excluding-the-minimum-and-maximum-salary.js diff --git a/1491-average-salary-excluding-the-minimum-and-maximum-salary.js b/1491-average-salary-excluding-the-minimum-and-maximum-salary.js new file mode 100644 index 00000000..e65eff5d --- /dev/null +++ b/1491-average-salary-excluding-the-minimum-and-maximum-salary.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} salary + * @return {number} + */ +const average = function(salary) { + const sum = salary.reduce((ac, e) => ac + e, 0) + const min = Math.min(...salary), max = Math.max(...salary) + const n = salary.length + + return (sum - min - max) / (n - 2) +}; From badd57ba978ef464024d00ff2a4b14dfc27a77a6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Aug 2023 16:55:22 +0800 Subject: [PATCH 1429/2039] Create 851-loud-and-rich.js --- 851-loud-and-rich.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 851-loud-and-rich.js diff --git a/851-loud-and-rich.js b/851-loud-and-rich.js new file mode 100644 index 00000000..a413c424 --- /dev/null +++ b/851-loud-and-rich.js @@ -0,0 +1,32 @@ +/** + * @param {number[][]} richer + * @param {number[]} quiet + * @return {number[]} + */ +const loudAndRich = function(richer, quiet) { + const hash = {} + for(const [a, b] of richer) { + if(hash[b] == null) hash[b] = [] + hash[b].push(a) + } + const n = quiet.length + + const res = [] + for(let i = 0; i < n; i++) { + dfs(i) + } + + return res + + function dfs(i) { + if(res[i] != null) return res[i] + res[i] = i + + const nxt = hash[i] || [] + for(const e of nxt) { + if(quiet[dfs(e)] < quiet[res[i]]) res[i] = res[e] + + } + return res[i] + } +}; From 6d7b1381413dccb1f94b7da3b0df2d09e5cc4fce Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Aug 2023 20:53:36 +0800 Subject: [PATCH 1430/2039] Create 2440-create-components-with-same-value.js --- 2440-create-components-with-same-value.js | 50 +++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 2440-create-components-with-same-value.js diff --git a/2440-create-components-with-same-value.js b/2440-create-components-with-same-value.js new file mode 100644 index 00000000..fc6e910c --- /dev/null +++ b/2440-create-components-with-same-value.js @@ -0,0 +1,50 @@ +/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +const componentValue = function(nums, edges) { + const n = nums.length, sum = nums.reduce((ac, e) => ac + e, 0) + const graph = {}, degree = Array(n).fill(0) + const { min } = Math, mi = min(...nums) + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = [] + if(graph[v] == null) graph[v] = [] + graph[u].push(v) + graph[v].push(u) + degree[u]++ + degree[v]++ + } + + + for(let t = mi; t < sum; t++) { + if((sum % t === 0) && bfs(t)) return sum / t - 1 + } + + return 0 + + + function bfs(target) { + const vertices = nums.slice(0), deg = degree.slice(0), q = [] + for(let i = 0; i < n; i++) { + if(deg[i] === 1) { + q.push(i) + } + } + + while(q.length) { + const cur = q.shift() + deg[cur] = 0 + const nxt = graph[cur] || [] + for(const e of nxt) { + if(vertices[cur] !== target) vertices[e] += vertices[cur] + deg[e]-- + + if(deg[e] === 0) return vertices[e] === target + else if(deg[e] === 1) q.push(e) + } + } + return false + } +}; + From b2f4f91e1d0b993b3ae9330241bd5a3bf6e796c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 18 Aug 2023 16:05:31 +0800 Subject: [PATCH 1431/2039] Create 2603-collect-coins-in-a-tree.js --- 2603-collect-coins-in-a-tree.js | 35 +++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2603-collect-coins-in-a-tree.js diff --git a/2603-collect-coins-in-a-tree.js b/2603-collect-coins-in-a-tree.js new file mode 100644 index 00000000..211e4335 --- /dev/null +++ b/2603-collect-coins-in-a-tree.js @@ -0,0 +1,35 @@ +let a, cum, res, v, sum, g; +const initializeGraph = (n) => { let g = []; for (let i = 0; i < n; i++) { g.push([]); } return g; }; +const packUG = (g, edges) => { for (const [u, v] of edges) { g[u].push(v); g[v].push(u); } }; +const sm = (a) => a.reduce(((x, y) => x + y), 0); +const tree_dp = (cur, par) => { + v[cur] = a[cur]; + for (const child of g[cur]) { + if (child != par) { + v[cur] += tree_dp(child, cur); + } + } + if (cur != par) { + let x = v[cur] + cum[par] - a[cur]; + let y = (sum - v[cur]) + cum[cur] - a[par]; + if (x != sum && y != sum) res += 2; + } + return v[cur]; +}; +/** + * @param {number[]} coins + * @param {number[][]} edges + * @return {number} + */ +const collectTheCoins = function(coins, edges) { + let n = coins.length; + g = initializeGraph(n), a = coins, res = 0, cum = Array(n), v = Array(n), sum = sm(a); + packUG(g, edges); + for (let i = 0; i < n; i++) { + cum[i] = a[i]; + for (const child of g[i]) cum[i] += a[child]; + } + tree_dp(0, 0); + return res; + +}; From a76c48a73acd980ce0b088472c2b8de564bfcd36 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 19 Aug 2023 20:29:44 +0800 Subject: [PATCH 1432/2039] Create 2768-number-of-black-blocks.js --- 2768-number-of-black-blocks.js | 48 ++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2768-number-of-black-blocks.js diff --git a/2768-number-of-black-blocks.js b/2768-number-of-black-blocks.js new file mode 100644 index 00000000..d43a8070 --- /dev/null +++ b/2768-number-of-black-blocks.js @@ -0,0 +1,48 @@ +/** + * @param {number} m + * @param {number} n + * @param {number[][]} coordinates + * @return {number[]} + */ +const countBlackBlocks = function (m, n, coordinates) { + let arr = new Array(5).fill(0) + arr[0] = (m - 1) * (n - 1) + let mat = {} + for (let [r, c] of coordinates) { + mat[r] ||= [] + mat[r][c] = true + } + for (let [r, c] of coordinates) { + for (let i = -1; i < 1; i++) { + for (let j = -1; j < 1; j++) { + let nextR = r + i + let nextC = c + j + if (nextR < 0 || nextC < 0 || (nextR >= m - 1) | (nextC >= n - 1)) + continue + let res = getRes(nextR, nextC, mat) + arr[res]++ + } + } + } + for (let i = 1; i < 5; i++) { + arr[i] = ~~(arr[i] / i) + } + let used = 0 + for (let i = 1; i < 5; i++) { + used += arr[i] + } + arr[0] -= used + return arr +} + +const getRes = (r, c, mat) => { + let res = 0 + for (let i = 0; i < 2; i++) { + for (let j = 0; j < 2; j++) { + let nextR = r + i + let nextC = c + j + if (mat[nextR]?.[nextC] === true) res++ + } + } + return res +} From 8365b8fdd11a286dca2c54b1951c1cf13e0f3027 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 19 Aug 2023 20:53:23 +0800 Subject: [PATCH 1433/2039] Update 2768-number-of-black-blocks.js --- 2768-number-of-black-blocks.js | 50 ++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/2768-number-of-black-blocks.js b/2768-number-of-black-blocks.js index d43a8070..48067a99 100644 --- a/2768-number-of-black-blocks.js +++ b/2768-number-of-black-blocks.js @@ -1,3 +1,53 @@ +/** + * @param {number} m + * @param {number} n + * @param {number[][]} coordinates + * @return {number[]} + */ +const countBlackBlocks = function(m, n, coordinates) { + const block = {} + + for(const [i, j] of coordinates) { + helper(i, j) + } + + const arr = Array(5).fill(0) + for(const k in block) { + if(block.hasOwnProperty(k)) { + arr[block[k]]++ + } + } + arr[0] = (m - 1) * (n - 1) - arr.reduce((ac, e) => ac + e, 0) + return arr + + function helper(i, j) { + + if(i < m - 1 && j < n - 1) { + update(i, j) + if(i > 0) update(i - 1, j) + if(j > 0) update(i, j - 1) + if(i > 0 && j > 0) update(i - 1, j - 1) + } else if(i === m - 1 && j === n - 1) { + update(i - 1, j - 1) + } else if(i === m - 1) { + update(i - 1, j) + if(j > 0) update(i - 1, j - 1) + } else if(j === n - 1) { + update(i, j - 1) + if(i > 0) update(i - 1, j - 1) + } + + } + + function update(i, j, delta = 1) { + const key = `${i},${j}` + if(block[key] == null) block[key] = 0 + block[key]++ + } +}; + +// another + /** * @param {number} m * @param {number} n From 15633d72bea5a35bae353c43818e03970c65e0ad Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Aug 2023 18:31:34 +0800 Subject: [PATCH 1434/2039] Update 1685-sum-of-absolute-differences-in-a-sorted-array.js --- ...of-absolute-differences-in-a-sorted-array.js | 17 ++++++++++------- 1 file changed, 10 insertions(+), 7 deletions(-) diff --git a/1685-sum-of-absolute-differences-in-a-sorted-array.js b/1685-sum-of-absolute-differences-in-a-sorted-array.js index c9893c3f..a4273d0e 100644 --- a/1685-sum-of-absolute-differences-in-a-sorted-array.js +++ b/1685-sum-of-absolute-differences-in-a-sorted-array.js @@ -3,15 +3,18 @@ * @return {number[]} */ const getSumAbsoluteDifferences = function(nums) { - const res = [], n = nums.length - let sum = 0 - for(let first = nums[0], i = 1; i < n; i++) { - sum += nums[i] - first + const n = nums.length, { abs } = Math + const res = [] + let e0 = 0 + for(let i = 1; i < n; i++) { + e0 += abs(nums[i] - nums[0]) } - res[0] = sum + res[0] = e0 for(let i = 1; i < n; i++) { - res[i] = res[i - 1] - (nums[i] - nums[i - 1]) * (n - i - 1) + (nums[i] - nums[i - 1]) * (i - 1) + const pre = res[i - 1], diff = nums[i] - nums[i - 1] + let cur = pre + diff * (i - 1) - diff * (n - 1 - i) + res.push(cur) } - + return res }; From 77171102d705fe40110b3209658f856f251d0faa Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Aug 2023 21:28:09 +0800 Subject: [PATCH 1435/2039] Create 2828-check-if-a-string-is-an-acronym-of-words.js --- 2828-check-if-a-string-is-an-acronym-of-words.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 2828-check-if-a-string-is-an-acronym-of-words.js diff --git a/2828-check-if-a-string-is-an-acronym-of-words.js b/2828-check-if-a-string-is-an-acronym-of-words.js new file mode 100644 index 00000000..5951071d --- /dev/null +++ b/2828-check-if-a-string-is-an-acronym-of-words.js @@ -0,0 +1,10 @@ +/** + * @param {string[]} words + * @param {string} s + * @return {boolean} + */ +const isAcronym = function(words, s) { + let str = '' + for(const e of words) str = str + e[0] + return s === str +}; From 91640a0b47fe3fe547c522f6828300ca4561de27 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Aug 2023 21:29:07 +0800 Subject: [PATCH 1436/2039] Create 2829-determine-the-minimum-sum-of-a-k-avoiding-array.js --- ...ine-the-minimum-sum-of-a-k-avoiding-array.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2829-determine-the-minimum-sum-of-a-k-avoiding-array.js diff --git a/2829-determine-the-minimum-sum-of-a-k-avoiding-array.js b/2829-determine-the-minimum-sum-of-a-k-avoiding-array.js new file mode 100644 index 00000000..8bf5b7c1 --- /dev/null +++ b/2829-determine-the-minimum-sum-of-a-k-avoiding-array.js @@ -0,0 +1,17 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const minimumSum = function(n, k) { + let res = 0 + const set = new Set() + for(let i = 1; set.size < n; i++) { + if(!set.has(k - i)) { + set.add(i) + res += i + } + } + + return res +}; From 11a3f528df99a7bc78bcdc88572aa6396bb738c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Aug 2023 21:29:42 +0800 Subject: [PATCH 1437/2039] Create 2830-maximize-the-profit-as-the-salesman.js --- 2830-maximize-the-profit-as-the-salesman.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2830-maximize-the-profit-as-the-salesman.js diff --git a/2830-maximize-the-profit-as-the-salesman.js b/2830-maximize-the-profit-as-the-salesman.js new file mode 100644 index 00000000..d54b6eeb --- /dev/null +++ b/2830-maximize-the-profit-as-the-salesman.js @@ -0,0 +1,20 @@ +/** + * @param {number} n + * @param {number[][]} offers + * @return {number} + */ +const maximizeTheProfit = function(n, offers) { + const dp = Array(n + 1).fill(0); + const m = []; + for (const a of offers) { + if(m[a[1]] == null) m[a[1]] = [] + m[a[1]].push(a); + } + for (let e = 1; e <= n; e++) { + dp[e] = dp[e - 1]; + for (let a of (m[e - 1] || []) ) { + dp[e] = Math.max(dp[e], dp[a[0]] + a[2]); + } + } + return dp[n]; +}; From 6556704c0366134315b55268127854c64ec85c44 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 20 Aug 2023 21:30:16 +0800 Subject: [PATCH 1438/2039] Create 2831-find-the-longest-equal-subarray.js --- 2831-find-the-longest-equal-subarray.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2831-find-the-longest-equal-subarray.js diff --git a/2831-find-the-longest-equal-subarray.js b/2831-find-the-longest-equal-subarray.js new file mode 100644 index 00000000..a2fdf369 --- /dev/null +++ b/2831-find-the-longest-equal-subarray.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const longestEqualSubarray = function(nums, k) { + let maxf = 0, i = 0, n = nums.length; + let count = {}; + for (let j = 0; j < n; j++) { + if(count[nums[j]] == null) count[nums[j]] = 0 + maxf = Math.max(maxf, ++count[nums[j]]); + if (j - i + 1 - maxf > k) { + if(count[nums[i]] == null) count[nums[i]] = 0 + --count[nums[i++]]; + } + + } + return maxf; +}; From ce6aa564d3322025a938579d77b38ca8649d5aaf Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Aug 2023 18:11:06 +0800 Subject: [PATCH 1439/2039] Update 2121-intervals-between-identical-elements.js --- 2121-intervals-between-identical-elements.js | 38 ++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2121-intervals-between-identical-elements.js b/2121-intervals-between-identical-elements.js index 2c99b424..3507ba0e 100644 --- a/2121-intervals-between-identical-elements.js +++ b/2121-intervals-between-identical-elements.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} arr + * @return {number[]} + */ +const getDistances = function(arr) { + const hash = {} + const n = arr.length + for(let i = 0; i < n; i++) { + const e = arr[i] + if(hash[e] == null) hash[e] = [] + hash[e].push(i) + } + const res = [] + for(const [k, v] of Object.entries(hash)) { + helper(v) + } + return res + + function helper(idxArr) { + let sum = 0 + const len = idxArr.length + for(let i = 1; i < len; i++) { + sum += idxArr[i] - idxArr[0] + } + const first = idxArr[0] + res[first] = sum + for(let i = 1; i < len; i++) { + const pre = res[idxArr[i - 1]] + const delta = idxArr[i] - idxArr[i - 1] + const tmp = pre + i * delta - (len - i) * delta + res[idxArr[i]] = tmp + } + } +}; + +// another + + /** * @param {number[]} arr * @return {number[]} From ca16016e025063995f41c936a645f280392e6af4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Aug 2023 19:01:31 +0800 Subject: [PATCH 1440/2039] Update 2615-sum-of-distances.js --- 2615-sum-of-distances.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2615-sum-of-distances.js b/2615-sum-of-distances.js index 533c3806..6ac7000e 100644 --- a/2615-sum-of-distances.js +++ b/2615-sum-of-distances.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const distance = function(nums) { + const res = [] + const hash = {}, n = nums.length + for(let i = 0; i < n; i++) { + const e = nums[i] + if(hash[e] == null) hash[e] = [] + hash[e].push(i) + } + + for(const [_, arr] of Object.entries(hash)) { + helper(arr) + } + + return res + + function helper(arr) { + let sum = 0 + const len = arr.length + for(let i = 1; i < len; i++) { + sum += arr[i] - arr[0] + } + const first = arr[0] + res[first] = sum + for(let i = 1; i < len; i++) { + const preIdx = arr[i - 1] + const pre = res[preIdx], diff = arr[i] - arr[i - 1] + const val = pre + i * diff - diff * (len - i) + res[arr[i]] = val + } + } +}; + +// another + /** * @param {number[]} nums * @return {number[]} From 5661b6012eb25187dbbbd43be03ed729a0b6c560 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 23 Aug 2023 19:23:08 +0800 Subject: [PATCH 1441/2039] Create 2591-distribute-money-to-maximum-children.js --- 2591-distribute-money-to-maximum-children.js | 27 ++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2591-distribute-money-to-maximum-children.js diff --git a/2591-distribute-money-to-maximum-children.js b/2591-distribute-money-to-maximum-children.js new file mode 100644 index 00000000..52d9a5a6 --- /dev/null +++ b/2591-distribute-money-to-maximum-children.js @@ -0,0 +1,27 @@ +/** + * @param {number} money + * @param {number} children + * @return {number} + */ +const distMoney = function(money, children) { + let m = money, n = children + if(m < n) return -1 + let res = 0 + for(let num = 1; num <= n && num * 8 <= m; num++) { + if(valid(num)) res = num + } + + return res + + function valid(num) { + if(m < num * 8) return false + let remain = m - num * 8 + let slots = n - num + if(slots === 0 && remain) return false + if(slots > remain) return false + remain = remain - slots + if(remain === 3 && slots === 1) return false + return true + } + +}; From 8eaac9216cf181ff5a454781e2419a6cf5815009 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 24 Aug 2023 18:53:14 +0800 Subject: [PATCH 1442/2039] Update 2672-number-of-adjacent-elements-with-the-same-color.js --- ...f-adjacent-elements-with-the-same-color.js | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/2672-number-of-adjacent-elements-with-the-same-color.js b/2672-number-of-adjacent-elements-with-the-same-color.js index 241889da..1ca04f3c 100644 --- a/2672-number-of-adjacent-elements-with-the-same-color.js +++ b/2672-number-of-adjacent-elements-with-the-same-color.js @@ -1,3 +1,48 @@ +/** + * @param {number} n + * @param {number[][]} queries + * @return {number[]} + */ +const colorTheArray = function(n, queries) { + let res = [] + const arr = Array(n).fill(0) + const [idx, val] = queries[0] + arr[idx] = val + res.push(0) + const len = queries.length + for(let i = 1; i < len; i++) { + helper(queries[i]) + } + + return res + + function helper([idx, val]) { + const pre = res[res.length - 1] + let cur = pre + if(arr[idx] !== val) { + if(arr[idx] !== 0) { + if(idx > 0 && arr[idx - 1] === val) cur++ + if(idx + 1 < n && arr[idx + 1] === val) cur++ + if(idx > 0 && arr[idx - 1] === arr[idx]) { + cur-- + } + if(idx + 1 < n && arr[idx + 1] === arr[idx]) { + cur-- + } + } else { + // not set + if(idx > 0 && arr[idx - 1] === val) cur++ + if(idx + 1 < n && arr[idx + 1] === val) cur++ + } + } + arr[idx] = val + + res.push(cur) + } +}; + +// another + /** * @param {number} n * @param {number[][]} queries From 7ff215bda29686e080e9e1dfcb63609cf380dab3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Aug 2023 22:03:13 +0800 Subject: [PATCH 1443/2039] Create 2833-furthest-point-from-origin.js --- 2833-furthest-point-from-origin.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 2833-furthest-point-from-origin.js diff --git a/2833-furthest-point-from-origin.js b/2833-furthest-point-from-origin.js new file mode 100644 index 00000000..b7a34e64 --- /dev/null +++ b/2833-furthest-point-from-origin.js @@ -0,0 +1,14 @@ +/** + * @param {string} moves + * @return {number} + */ +var furthestDistanceFromOrigin = function(moves) { + let u = 0 + let val = 0 + for(const e of moves) { + if(e === '_') u++ + else if(e === 'L') val-- + else if(e === 'R') val++ + } + return Math.abs(val) + u +}; From 825998f7769559ccae05ba4f3f9c6706c1c6b8ea Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Sep 2023 21:02:56 +0800 Subject: [PATCH 1444/2039] Create 2745-construct-the-longest-new-string.js --- 2745-construct-the-longest-new-string.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 2745-construct-the-longest-new-string.js diff --git a/2745-construct-the-longest-new-string.js b/2745-construct-the-longest-new-string.js new file mode 100644 index 00000000..271bc658 --- /dev/null +++ b/2745-construct-the-longest-new-string.js @@ -0,0 +1,12 @@ +/** + * @param {number} x + * @param {number} y + * @param {number} z + * @return {number} + */ +var longestString = function(x, y, z) { + if (x === y) + return (4 * x + 2 * z); + var mini = Math.min(x, y); + return (2 * mini + 2 * (mini + 1) + 2 * z); +}; From 6e3b028a6fdb61f9c3e052dbd4461339f467789c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Sep 2023 21:24:06 +0800 Subject: [PATCH 1445/2039] Update 2745-construct-the-longest-new-string.js --- 2745-construct-the-longest-new-string.js | 13 ++++++++----- 1 file changed, 8 insertions(+), 5 deletions(-) diff --git a/2745-construct-the-longest-new-string.js b/2745-construct-the-longest-new-string.js index 271bc658..523bcf91 100644 --- a/2745-construct-the-longest-new-string.js +++ b/2745-construct-the-longest-new-string.js @@ -4,9 +4,12 @@ * @param {number} z * @return {number} */ -var longestString = function(x, y, z) { - if (x === y) - return (4 * x + 2 * z); - var mini = Math.min(x, y); - return (2 * mini + 2 * (mini + 1) + 2 * z); +const longestString = function(x, y, z) { + const base = Math.min(x, y) + let extra = 0 + if(x !== y) { + extra = 1 + } + + return (base * 2 + z + extra) * 2 }; From 39745e816f366c361b6323566e27c41fa0d6e7b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Sep 2023 17:52:40 +0800 Subject: [PATCH 1446/2039] Create 2749-minimum-operations-to-make-the-integer-zero.js --- ...mum-operations-to-make-the-integer-zero.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 2749-minimum-operations-to-make-the-integer-zero.js diff --git a/2749-minimum-operations-to-make-the-integer-zero.js b/2749-minimum-operations-to-make-the-integer-zero.js new file mode 100644 index 00000000..884190c2 --- /dev/null +++ b/2749-minimum-operations-to-make-the-integer-zero.js @@ -0,0 +1,35 @@ +/** + * @param {number} num1 + * @param {number} num2 + * @return {number} + */ +const makeTheIntegerZero = (x, y) => { + for (let cnt = 0; cnt < 40; cnt++) { + let sum = x - cnt * y; + if (sum < 0) break; + let f = SumOfPower2Factorization(sum), min = f.size, max = sum; // max factorization is all 1's (2 ^ 0) + if (min <= cnt && cnt <= max) return cnt; + } + return -1; +}; + +// min factorization (smallest total cnt) +const SumOfPower2Factorization = (x) => { + let i = 0, bit = 2 ** i, v = [], res = new Set(), cur = x; + while (bit <= x) { + v.push(bit); + i++; + bit = 2 ** i; + } + while (cur != 0) { + let idx = v.findIndex((element) => element > cur); + if (idx === -1) { + idx = v.length - 1; + } else { + idx--; + } + res.add(idx); + cur -= v[idx]; + } + return res; +}; From 824dbae17e9e48e4ee688fc09081fe17a518dc8a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Sep 2023 20:31:09 +0800 Subject: [PATCH 1447/2039] Update 2673-make-costs-of-paths-equal-in-a-binary-tree.js --- ...e-costs-of-paths-equal-in-a-binary-tree.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/2673-make-costs-of-paths-equal-in-a-binary-tree.js b/2673-make-costs-of-paths-equal-in-a-binary-tree.js index fecb6c46..b429fb98 100644 --- a/2673-make-costs-of-paths-equal-in-a-binary-tree.js +++ b/2673-make-costs-of-paths-equal-in-a-binary-tree.js @@ -1,3 +1,24 @@ +/** + * @param {number} n + * @param {number[]} cost + * @return {number} + */ +const minIncrements = function(n, cost) { + let res = 0 + dfs(1) + return res + + function dfs(node) { + if(node > n) return 0 + const l = dfs(2 * node) + const r = dfs(2 * node + 1) + res += Math.abs(l - r) + return Math.max(l, r) + cost[node - 1] + } +}; + +// another + /** * @param {number} n * @param {number[]} cost From 9e2b3b34612fd25902f185a7dab8fe054591e9a6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Sep 2023 21:23:32 +0800 Subject: [PATCH 1448/2039] Create 2580-count-ways-to-group-overlapping-ranges.js --- 2580-count-ways-to-group-overlapping-ranges.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2580-count-ways-to-group-overlapping-ranges.js diff --git a/2580-count-ways-to-group-overlapping-ranges.js b/2580-count-ways-to-group-overlapping-ranges.js new file mode 100644 index 00000000..11817f76 --- /dev/null +++ b/2580-count-ways-to-group-overlapping-ranges.js @@ -0,0 +1,15 @@ +/** + * @param {number[][]} ranges + * @return {number} + */ +const countWays = function(ranges) { + const mod = 1e9 + 7 + const n = ranges.length + ranges.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + let last = -1, res = 1 + for (const r of ranges) { + if (last < r[0]) res = res * 2 % mod; + last = Math.max(last, r[1]); + } + return res +}; From cddca02a38b7ee7c264871c2928250902d4847d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Sep 2023 21:17:15 +0800 Subject: [PATCH 1449/2039] Create 2589-minimum-time-to-complete-all-tasks.js --- 2589-minimum-time-to-complete-all-tasks.js | 31 ++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2589-minimum-time-to-complete-all-tasks.js diff --git a/2589-minimum-time-to-complete-all-tasks.js b/2589-minimum-time-to-complete-all-tasks.js new file mode 100644 index 00000000..6999599c --- /dev/null +++ b/2589-minimum-time-to-complete-all-tasks.js @@ -0,0 +1,31 @@ +/** + * @param {number[][]} tasks + * @return {number} + */ +const findMinimumTime = function(tasks) { + let maxEnd = -Infinity + for(const [s,e,d] of tasks) { + maxEnd = Math.max(maxEnd, e) + } + // console.log(maxEnd) + const endSlots = Array(maxEnd + 1).fill(0) + tasks.sort((a, b) => a[1] - b[1]) + const n = tasks.length + for(let i = 0; i < n; i++) { + const cur = tasks[i] + let [s, e, d] = cur + for(let j = s; j <= e; j++) { + if(endSlots[j]) d-- + } + let t = e + while(d > 0) { + if(endSlots[t] === 0) { + endSlots[t] = 1 + d-- + } + t-- + } + } + + return endSlots.reduce((ac, e) => ac + e, 0) +}; From e5371965aa02fa2699ffe3f9adf6dae27a7613a2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Sep 2023 20:53:29 +0800 Subject: [PATCH 1450/2039] Create 2598-smallest-missing-non-negative-integer-after-operations.js --- ...g-non-negative-integer-after-operations.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2598-smallest-missing-non-negative-integer-after-operations.js diff --git a/2598-smallest-missing-non-negative-integer-after-operations.js b/2598-smallest-missing-non-negative-integer-after-operations.js new file mode 100644 index 00000000..a0cbc404 --- /dev/null +++ b/2598-smallest-missing-non-negative-integer-after-operations.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @param {number} value + * @return {number} + */ +const findSmallestInteger = function(nums, value) { + const hash = {}, n = nums.length + for(const e of nums) { + let remain = e % value + if(remain < 0) remain = value + remain + if(hash[remain] == null) hash[remain] = 0 + hash[remain]++ + } + for(let i = 0; i < n; i++) { + const re = i % value + if(hash[re] == null) return i + hash[re]-- + if(hash[re] === 0) delete hash[re] + } + return n +}; From c03f93232821cdeb56942a32e88d645004548784 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Sep 2023 17:38:41 +0800 Subject: [PATCH 1451/2039] Create 2835-minimum-operations-to-form-subsequence-with-target-sum.js --- ...ons-to-form-subsequence-with-target-sum.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2835-minimum-operations-to-form-subsequence-with-target-sum.js diff --git a/2835-minimum-operations-to-form-subsequence-with-target-sum.js b/2835-minimum-operations-to-form-subsequence-with-target-sum.js new file mode 100644 index 00000000..399aefd2 --- /dev/null +++ b/2835-minimum-operations-to-form-subsequence-with-target-sum.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var minOperations = function(nums, target) { + const n = nums.length, arr = Array(31).fill(0); + let sum = 0; + + for(const x of nums) ++arr[Math.log2(x)], sum += x; + if(sum < target) return -1; + + let i=0, res = 0; + while(i < 31) { + if(1< Date: Tue, 12 Sep 2023 20:28:36 +0800 Subject: [PATCH 1452/2039] Create 2836-maximize-value-of-function-in-a-ball-passing-game.js --- ...alue-of-function-in-a-ball-passing-game.js | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 2836-maximize-value-of-function-in-a-ball-passing-game.js diff --git a/2836-maximize-value-of-function-in-a-ball-passing-game.js b/2836-maximize-value-of-function-in-a-ball-passing-game.js new file mode 100644 index 00000000..ac238a8f --- /dev/null +++ b/2836-maximize-value-of-function-in-a-ball-passing-game.js @@ -0,0 +1,60 @@ +const N = 34 +const checkIthBit64 = (x, i) => { + let s = x.toString(2), + n = s.length + for (let j = 0; j < n; j++) { + if (n - j - 1 == i && s[j] == '1') return 1 + } + return 0 +} + +/** + * @param {number[]} receiver + * @param {number} k + * @return {number} + */ +var getMaxFunctionValue = function(receiver, k) { + const a = receiver + let n = a.length, + ia = [], + res = [], + iaP = [...a], + resP = [...a] + for (let i = 0; i < n; i++) { + ia.push(i) + res.push(i) + } + for (let i = 0; i < N; i++) { + if (checkIthBit64(k, i)) { + ;[res, ia] = update(res, resP, ia, iaP) + } + resP = updateResP(res, resP, iaP) + iaP = updateIaP(iaP) + } + return Math.max(...res) +}; + +const update = (cur, curP, ia, iaP) => { + let n = cur.length, + nextRes = [], + nextPos = [] + for (let i = 0; i < n; i++) { + nextRes.push(cur[i] + curP[ia[i]]) + nextPos.push(ia[iaP[i]]) + } + return [nextRes, nextPos] +} + +const updateResP = (cur, curP, iaP) => { + let n = cur.length, + next = [] + for (let i = 0; i < n; i++) next.push(curP[i] + curP[iaP[i]]) + return next +} + +const updateIaP = (iaP) => { + let n = iaP.length, + next = [] + for (let i = 0; i < n; i++) next.push(iaP[iaP[i]]) + return next +} From df1e053129470de7f756ef518997ee9235f83ac8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Sep 2023 21:39:39 +0800 Subject: [PATCH 1453/2039] Create 2846-minimum-edge-weight-equilibrium-queries-in-a-tree.js --- ...ge-weight-equilibrium-queries-in-a-tree.js | 120 ++++++++++++++++++ 1 file changed, 120 insertions(+) create mode 100644 2846-minimum-edge-weight-equilibrium-queries-in-a-tree.js diff --git a/2846-minimum-edge-weight-equilibrium-queries-in-a-tree.js b/2846-minimum-edge-weight-equilibrium-queries-in-a-tree.js new file mode 100644 index 00000000..113349f5 --- /dev/null +++ b/2846-minimum-edge-weight-equilibrium-queries-in-a-tree.js @@ -0,0 +1,120 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[][]} queries + * @return {number[]} + */ +const minOperationsQueries = function (n, edges, queries) { + let [directParents, counts, depths] = getParentsAndPrefixCounts(n, edges) + let lcaModule = new LCA(n, directParents, depths) + let ans = [] + for (let [a, b] of queries) { + let lca = lcaModule.getLCA(a, b) + let countsA = diffCounts(counts[a], counts[lca]), + countsB = diffCounts(counts[b], counts[lca]) + let totalCounts = addCounts(countsA, countsB) + let edgesInPath = depths[a] - depths[lca] + depths[b] - depths[lca] + let maxCount = 0 + for (let i = 1; i <= 26; i++) { + maxCount = Math.max(maxCount, totalCounts[i]) + } + ans.push(edgesInPath - maxCount) // turn all other non-majority weights into the weight with the most occurances + } + return ans +} + +function addCounts(countsA, countsB) { + let total = Array(27) + for (let i = 1; i <= 26; i++) { + total[i] = countsA[i] + countsB[i] + } + return total +} + +function diffCounts(countsA, countsLCA) { + let diff = Array(27) + for (let i = 1; i <= 26; i++) { + diff[i] = countsA[i] - countsLCA[i] + } + return diff +} + +function getParentsAndPrefixCounts(n, edges) { + let directParents = Array(n).fill(-1) + let graph = Array(n) + .fill(0) + .map(() => []) + let prefixCounts = Array(n) + for (let [u, v, w] of edges) { + graph[u].push([v, w]) + graph[v].push([u, w]) + } + let seen = Array(n).fill(false) + seen[0] = true + let queue = [[0, Array(27).fill(0), 0]] + let depths = Array(n) + while (queue.length) { + let [node, count, depth] = queue.shift() + prefixCounts[node] = count + depths[node] = depth + + for (let [nei, weight] of graph[node]) { + if (seen[nei]) continue + let newCount = [...count] + newCount[weight]++ + seen[nei] = true + queue.push([nei, newCount, depth + 1]) + directParents[nei] = node + } + } + return [directParents, prefixCounts, depths] +} + +class LCA { + constructor(n, directParents, depths) { + this.maxDepth = Math.ceil(Math.log2(n)) + this.p = Array(this.maxDepth + 1) + .fill(0) + .map(() => Array(n).fill(-1)) + this.depths = depths + + // precomputation for binary lifting + for (let node = 0; node < n; node++) { + this.p[0][node] = directParents[node] + } + for (let pow2 = 1; pow2 <= this.maxDepth; pow2++) { + for (let node = 0; node < n; node++) { + let halfParent = this.p[pow2 - 1][node] + this.p[pow2][node] = + halfParent === -1 ? -1 : this.p[pow2 - 1][halfParent] + } + } + } + getLCA(a, b) { + if (this.depths[a] > this.depths[b]) { + let temp = a + a = b + b = temp + } + + // bring both nodes up to the same depth + let depthDiff = this.depths[b] - this.depths[a] + for (let i = 0; i <= this.maxDepth; i++) { + if ((depthDiff >> i) & 1) { + b = this.p[i][b] // move b up to the 2^ith parent + } + } + if (a === b) return a + + // move both nodes up by 2^ith levels if the 2^ith parents are not equal + for (let i = this.maxDepth; i >= 0; i--) { + // this decrements so that we can jump the nodes up incrementally + if (this.p[i][a] !== this.p[i][b]) { + // if 2^ith parents of both nodes are not equal, we can safely both move up + a = this.p[i][a] + b = this.p[i][b] + } + } + return this.p[0][a] + } +} From ead9b6ee11c91866edd22d8ee4754c6d9fd7f25b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 15 Sep 2023 20:24:13 +0800 Subject: [PATCH 1454/2039] Create 2581-count-number-of-possible-root-nodes.js --- 2581-count-number-of-possible-root-nodes.js | 45 +++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 2581-count-number-of-possible-root-nodes.js diff --git a/2581-count-number-of-possible-root-nodes.js b/2581-count-number-of-possible-root-nodes.js new file mode 100644 index 00000000..49c2615c --- /dev/null +++ b/2581-count-number-of-possible-root-nodes.js @@ -0,0 +1,45 @@ +/** + * @param {number[][]} edges + * @param {number[][]} guesses + * @param {number} k + * @return {number} + */ +const rootCount = function (edges, guesses, k) { + const lookup = new Set(guesses.map(([a, b]) => a * 1_000_000 + b)) + const adjList = edges.reduce( + (adjList, [a, b]) => { + adjList[a].push(b) + adjList[b].push(a) + return adjList + }, + new Array(edges.length + 1).fill(0).map(() => []), + ) + + const guessed = (a, b) => (lookup.has(a * 1_000_000 + b) ? 1 : 0) + + const getCorrect = (node, parent) => + adjList[node].reduce( + (total, child) => + child === parent + ? total + : total + guessed(node, child) + getCorrect(child, node), + 0, + ) + + const getTotal = (node, parent, correct) => + (correct >= k ? 1 : 0) + + adjList[node].reduce( + (total, child) => + child === parent + ? total + : total + + getTotal( + child, + node, + correct - guessed(node, child) + guessed(child, node), + ), + 0, + ) + + return getTotal(0, -1, getCorrect(0, -1)) +} From dab908ae7835cca692969420c91a0633b4e02dad Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Sep 2023 22:05:16 +0800 Subject: [PATCH 1455/2039] Create 2764-is-array-a-preorder-of-some-binary-tree.js --- ...is-array-a-preorder-of-some-binary-tree.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2764-is-array-a-preorder-of-some-binary-tree.js diff --git a/2764-is-array-a-preorder-of-some-binary-tree.js b/2764-is-array-a-preorder-of-some-binary-tree.js new file mode 100644 index 00000000..5054f1c8 --- /dev/null +++ b/2764-is-array-a-preorder-of-some-binary-tree.js @@ -0,0 +1,19 @@ +/** + * @param {number[][]} nodes + * @return {boolean} + */ +var isPreorder = function(nodes) { + const stack = []; + + for (const [curr, parent] of nodes) { + while (stack.length && stack[stack.length - 1] !== parent) { + stack.pop(); + } + if (!stack.length && parent !== -1) { + return false; + } + stack.push(curr); + } + + return true; +}; From ad1eed49fcd782d4c9dbf4886a927f29d88562da Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Sep 2023 01:37:29 -0500 Subject: [PATCH 1456/2039] Create 2458-height-of-binary-tree-after-subtree-removal-queries.js --- ...nary-tree-after-subtree-removal-queries.js | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 2458-height-of-binary-tree-after-subtree-removal-queries.js diff --git a/2458-height-of-binary-tree-after-subtree-removal-queries.js b/2458-height-of-binary-tree-after-subtree-removal-queries.js new file mode 100644 index 00000000..e3869df4 --- /dev/null +++ b/2458-height-of-binary-tree-after-subtree-removal-queries.js @@ -0,0 +1,50 @@ +/** + * 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[]} queries + * @return {number[]} + */ +const treeQueries = function(root, queries) { + const height = [], depth = [], { max } = Math + dfs(root, 0) + + function dfs(node, dep) { + if(node == null) return 0 + depth[node.val] = dep + const h = max(dfs(node.left, dep + 1), dfs(node.right, dep + 1)) + height[node.val] = h + return h + 1 + } + // console.log(height, depth) + + const neighbors = [] + for(let i = 1; i < height.length; i++) { + if(height[i] == null) continue + const d = depth[i] + if(neighbors[d] == null) neighbors[d] = [] + neighbors[d].push([height[i], i]) + neighbors[d].sort((a, b) => b[0] - a[0]) + if(neighbors[d].length > 2) neighbors[d].pop() + } + // console.log(neighbors) + const res = [] + for(const q of queries) { + const d = depth[q] + if(neighbors[d].length === 1) res.push(d - 1) + else if(q === neighbors[d][0][1]) { + // console.log('in', d) + res.push(d + neighbors[d][1][0]) + } else { + res.push(d + neighbors[d][0][0]) + } + } + + return res +}; From 008496e57964e3300a672c9ff3b89e844de79999 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Sep 2023 03:33:26 -0500 Subject: [PATCH 1457/2039] Create 2467-most-profitable-path-in-a-tree.js --- 2467-most-profitable-path-in-a-tree.js | 48 ++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2467-most-profitable-path-in-a-tree.js diff --git a/2467-most-profitable-path-in-a-tree.js b/2467-most-profitable-path-in-a-tree.js new file mode 100644 index 00000000..9f0b827c --- /dev/null +++ b/2467-most-profitable-path-in-a-tree.js @@ -0,0 +1,48 @@ +/** + * @param {number[][]} edges + * @param {number} bob + * @param {number[]} amount + * @return {number} + */ +const mostProfitablePath = function(edges, bob, amount) { + const graph = [], depth = [], parent = [] + for(const [u, v] of edges) { + if(graph[u] == null) graph[u] = [] + if(graph[v] == null) graph[v] = [] + graph[u].push(v) + graph[v].push(u) + } + dfs(0) + let cur = bob, bobh = 0 + while(cur) { + if(depth[cur] > bobh) amount[cur] = 0 + else if(depth[cur] === bobh) amount[cur] /= 2 + + bobh++ + cur = parent[cur] + } + + // console.log(depth, parent, amount) + + return dfs2(0) + + function dfs(node, p = 0, d = 0) { + parent[node] = p + depth[node] = d + for(const e of graph[node]) { + if(e === p) continue + dfs(e, node, d + 1) + } + } + + function dfs2(node, p = 0) { + let res = amount[node] + let ma = -Infinity + for(const e of graph[node]) { + if(e === p) continue + ma = Math.max(ma, dfs2(e, node)) + } + if(ma === -Infinity) return res + return res + ma + } +}; From 6adb4b11cc78df7a274d30ed41d3659cf81d4dc9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 21 Sep 2023 20:58:54 -0500 Subject: [PATCH 1458/2039] Update 2322-minimum-score-after-removals-on-a-tree.js --- ...-minimum-score-after-removals-on-a-tree.js | 93 +++++++++++++++++++ 1 file changed, 93 insertions(+) diff --git a/2322-minimum-score-after-removals-on-a-tree.js b/2322-minimum-score-after-removals-on-a-tree.js index fe2fc586..5adcde91 100644 --- a/2322-minimum-score-after-removals-on-a-tree.js +++ b/2322-minimum-score-after-removals-on-a-tree.js @@ -139,3 +139,96 @@ var minimumScore = function (nums, edges) { return (child_xor[i] = ans) } } + +// another + +/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +const minimumScore = function (nums, edges) { + const n = nums.length, + m = edges.length + const graph = {}, + degree = Array(n).fill(0) + const children = [], + vArr = nums.slice() + for (let i = 0; i < n; i++) children[i] = new Set() + for (const [u, v] of edges) { + if (graph[u] == null) graph[u] = [] + if (graph[v] == null) graph[v] = [] + graph[u].push(v) + graph[v].push(u) + degree[u]++ + degree[v]++ + } + let v = 0, + q = [] + const seen = new Set() + for (let i = 0; i < n; i++) { + v ^= nums[i] + if (degree[i] === 1) { + q.push(i) + seen.add(i) + } + } + + while (q.length) { + const tmp = [] + const size = q.length + for (let i = 0; i < size; i++) { + const cur = q[i] + for (const nxt of graph[cur]) { + // chidlren + // vArr + if (!seen.has(nxt)) { + children[nxt].add(cur) + children[nxt] = mergeSet(children[nxt], children[cur]) + vArr[nxt] ^= vArr[cur] + } + degree[nxt]-- + if (degree[nxt] === 1) { + tmp.push(nxt) + seen.add(nxt) + } + } + } + + q = tmp + } + + let res = Infinity + for (let i = 0; i < m - 1; i++) { + for (let j = i + 1; j < m; j++) { + let [a, b] = edges[i] + if (children[a].has(b)) { + ;[a, b] = [b, a] + } + let [c, d] = edges[j] + if (children[c].has(d)) { + ;[c, d] = [d, c] + } + if (children[c].has(a)) { + const tmp = [vArr[a], vArr[c] ^ vArr[a], v ^ vArr[c]] + res = Math.min(res, Math.max(...tmp) - Math.min(...tmp)) + } else if (children[a].has(c)) { + const tmp = [vArr[c], vArr[a] ^ vArr[c], v ^ vArr[a]] + res = Math.min(res, Math.max(...tmp) - Math.min(...tmp)) + } else { + const tmp = [vArr[a], vArr[c], v ^ vArr[a] ^ vArr[c]] + res = Math.min(res, Math.max(...tmp) - Math.min(...tmp)) + } + } + } + + return res +} + +function mergeSet(s, t) { + for (const e of t) { + s.add(e) + } + return s +} + From a096f7e0d67deab5d863ee26f55f3c1b66999015 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 23 Sep 2023 19:58:30 +0800 Subject: [PATCH 1459/2039] Create 2858-minimum-edge-reversals-so-every-node-is-reachable.js --- ...ge-reversals-so-every-node-is-reachable.js | 71 +++++++++++++++++++ 1 file changed, 71 insertions(+) create mode 100644 2858-minimum-edge-reversals-so-every-node-is-reachable.js diff --git a/2858-minimum-edge-reversals-so-every-node-is-reachable.js b/2858-minimum-edge-reversals-so-every-node-is-reachable.js new file mode 100644 index 00000000..839d6212 --- /dev/null +++ b/2858-minimum-edge-reversals-so-every-node-is-reachable.js @@ -0,0 +1,71 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +const minEdgeReversals = function (n, edges) { + let edgesMap = {} + for (let i = 0; i < edges.length; i++) { + let a = edges[i][0] + let b = edges[i][1] + if (edgesMap[a] === undefined) { + edgesMap[a] = [] + } + //its a forward edge + edgesMap[a].push([b, 'f']) + if (edgesMap[b] === undefined) { + edgesMap[b] = [] + } + //its a revers edge + edgesMap[b].push([a, 'r']) + } + + //We can cosnider any node as root node, Here I choose node 0 + let res = bfs(0) + let ans = [] + ans[0] = res[0] + let dist = res[1] + for (let i = 1; i < n; i++) { + //Ans for rest of the node will be, distance from node to root + answer of root + ans[i] = dist[i][0] - dist[i][1] + ans[0] + } + + return ans + function bfs(root) { + let distance = [], + visited = [], + totalReversal = 0 + let queue = [] + queue.push([root, 0, 0]) + distance[root] = [0, 0] + visited[root] = true + while (queue.length > 0) { + let nextLevelQueue = [] + for (let i = 0; i < queue.length; i++) { + let node = queue[i][0] + let weightF = queue[i][1] + let weightR = queue[i][2] + for (let j = 0; j < edgesMap[node].length; j++) { + let neighbour = edgesMap[node][j][0] + if (visited[neighbour] !== undefined) { + continue + } + let type = edgesMap[node][j][1] + let f = weightF, + r = weightR + if (type === 'r') { + totalReversal += 1 + r++ + } else { + f++ + } + visited[neighbour] = true + distance[neighbour] = [f, r] + nextLevelQueue.push([neighbour, f, r]) + } + } + queue = nextLevelQueue + } + return [totalReversal, distance] + } +} From 83370d88f05325b6c10011ca09082facaec8f91c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Sep 2023 00:13:24 -0500 Subject: [PATCH 1460/2039] Update 2003-smallest-missing-genetic-value-in-each-subtree.js --- ...t-missing-genetic-value-in-each-subtree.js | 58 +++++++++++++++++++ 1 file changed, 58 insertions(+) diff --git a/2003-smallest-missing-genetic-value-in-each-subtree.js b/2003-smallest-missing-genetic-value-in-each-subtree.js index fccbd9db..0089f20a 100644 --- a/2003-smallest-missing-genetic-value-in-each-subtree.js +++ b/2003-smallest-missing-genetic-value-in-each-subtree.js @@ -1,3 +1,61 @@ +/** + * @param {number[]} parents + * @param {number[]} nums + * @return {number[]} + */ +function smallestMissingValueSubtree(parent, nums) { + const graph = {}, + n = parent.length + const res = Array(n).fill(1) + const visited = new Set() + let miss = 1 + for (let i = 0; i < n; i++) { + if (graph[parent[i]] == null) graph[parent[i]] = [] + graph[parent[i]].push(i) + } + let idx = -1 + for (let i = 0; i < n; i++) { + if (nums[i] === 1) { + idx = i + break + } + } + + if (idx === -1) return res + let cur = idx, + pre = -1 + while (cur !== -1) { + const chidlren = graph[cur] + if (chidlren) { + for (const child of chidlren) { + if (child === pre) continue + dfs(child) + } + } + visited.add(nums[cur]) + while (visited.has(miss)) { + miss++ + } + // console.log(cur, miss, visited) + res[cur] = miss + pre = cur + cur = parent[cur] + } + + return res + + function dfs(node) { + visited.add(nums[node]) + const chidlren = graph[node] + if (chidlren) { + for (const child of chidlren) dfs(child) + } + } +} + +// another + + /** * @param {number[]} parents * @param {number[]} nums From c7138bc80a9cd8b474cabb9fde8ac3541ee0b68e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 30 Sep 2023 19:37:09 +0800 Subject: [PATCH 1461/2039] Create 1504-count-submatrices-with-all-ones.js --- 1504-count-submatrices-with-all-ones.js | 34 +++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 1504-count-submatrices-with-all-ones.js diff --git a/1504-count-submatrices-with-all-ones.js b/1504-count-submatrices-with-all-ones.js new file mode 100644 index 00000000..14cad762 --- /dev/null +++ b/1504-count-submatrices-with-all-ones.js @@ -0,0 +1,34 @@ +/** + * @param {number[][]} mat + * @return {number} + */ +const numSubmat = function(mat) { + let m = mat.length + let n = mat[0].length + let res = 0 + let height = Array(n).fill(0) + for (let i = 0; i < m; i++) { + let st = [] + for (let j = 0; j < n; j++) { + if (mat[i][j] == 1) { + height[j]++ + } else { + height[j] = 0 + } + let sum = 0 + while (st.length != 0) { + if (height[st[st.length - 1][0]] < height[j]) break + st.pop() + } + if (st.length != 0) { + sum += height[j] * (j - st[st.length - 1][0]) + st[st.length - 1][1] + } else { + sum += height[j] * (j + 1) + } + st.push([j, sum]) + res += sum + } + } + return res + +}; From 942de7057b09165072f915cd619dfa885b72b275 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Oct 2023 14:57:19 +0800 Subject: [PATCH 1462/2039] Create 2873-maximum-value-of-an-ordered-triplet-i.js --- 2873-maximum-value-of-an-ordered-triplet-i.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2873-maximum-value-of-an-ordered-triplet-i.js diff --git a/2873-maximum-value-of-an-ordered-triplet-i.js b/2873-maximum-value-of-an-ordered-triplet-i.js new file mode 100644 index 00000000..06fc592a --- /dev/null +++ b/2873-maximum-value-of-an-ordered-triplet-i.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumTripletValue = function(nums) { + const n = nums.length + let res = 0 + for(let i = 0; i < n - 2; i++) { + for(let j = i + 1; j < n - 1; j++) { + for(let k = j + 1; k < n ; k++) { + if(nums[i] < 0 && nums[j] < 0 && nums[k] < 0) continue + res = Math.max(res, (nums[i] - nums[j]) * nums[k]) + } + } + } + return res +}; From 0941361a30d2c230b8fc5422adc7d5b1faf07f65 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Oct 2023 14:57:47 +0800 Subject: [PATCH 1463/2039] Create 2874-maximum-value-of-an-ordered-triplet-ii.js --- ...-maximum-value-of-an-ordered-triplet-ii.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2874-maximum-value-of-an-ordered-triplet-ii.js diff --git a/2874-maximum-value-of-an-ordered-triplet-ii.js b/2874-maximum-value-of-an-ordered-triplet-ii.js new file mode 100644 index 00000000..2b996426 --- /dev/null +++ b/2874-maximum-value-of-an-ordered-triplet-ii.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumTripletValue = function(nums) { + const n = nums.length, {max} = Math + const left = Array(n).fill(0), right = Array(n).fill(0) + for(let i = 0, ma = 0; i < n; i++) { + ma = max(ma, nums[i]) + left[i] = ma + } + for(let i = n - 1, ma = 0; i >= 0; i--) { + ma = max(ma, nums[i]) + right[i] = ma + } + let res = 0 + + for(let i = 1; i < n - 1; i++) { + res = max(res, (left[i - 1] - nums[i]) * right[i + 1] ) + } + + return res +}; From da45b267456eb91e23d7384400ee3c4479dac4dd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Oct 2023 14:58:18 +0800 Subject: [PATCH 1464/2039] Create 2875-minimum-size-subarray-in-infinite-array.js --- ...minimum-size-subarray-in-infinite-array.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2875-minimum-size-subarray-in-infinite-array.js diff --git a/2875-minimum-size-subarray-in-infinite-array.js b/2875-minimum-size-subarray-in-infinite-array.js new file mode 100644 index 00000000..94c6b1b3 --- /dev/null +++ b/2875-minimum-size-subarray-in-infinite-array.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var minSizeSubarray = function(nums, target) { + let sum = 0, su = 0; + for (const a of nums) sum += a; + let n = nums.length, k = Math.floor(target / sum), res = n; + target %= sum; + if (target === 0) { + return k * n; + } + + let dp = new Map(); + dp.set(0, -1); + + for (let i = 0; i < 2 * n; ++i) { + su += nums[i % n]; + if (dp.has(su - target)) { + res = Math.min(res, i - dp.get(su - target)); + } + dp.set(su, i); + } + + return res < n ? res + k * n : -1; +}; From 6c005b5c0361cd429850d088109af763f9be6a23 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Oct 2023 14:58:50 +0800 Subject: [PATCH 1465/2039] Create 2876-count-visited-nodes-in-a-directed-graph.js --- ...count-visited-nodes-in-a-directed-graph.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2876-count-visited-nodes-in-a-directed-graph.js diff --git a/2876-count-visited-nodes-in-a-directed-graph.js b/2876-count-visited-nodes-in-a-directed-graph.js new file mode 100644 index 00000000..df153750 --- /dev/null +++ b/2876-count-visited-nodes-in-a-directed-graph.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} edges + * @return {number[]} + */ +var countVisitedNodes = function(edges) { + let n = edges.length, res = new Array(n).fill(0), j = 0; + for (let i = 0; i < n; j = ++i) { + let seen = new Set(); + let s = []; + while (!seen.has(j) && res[j] == 0) { + seen.add(j); + s.push(j); + j = edges[j]; + } + if (seen.has(j)) { // hit the cycle + let k = s.length - s.indexOf(j); + for (j = 0; j < k; ++j) { + res[s.pop()] = k; + } + } + while (s.length) { + j = s.pop(); + res[j] = res[edges[j]] + 1; + } + } + return res; +}; From 6a76469d6655becb763754e9f5604c79eb145722 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Oct 2023 15:28:21 +0800 Subject: [PATCH 1466/2039] Update 2876-count-visited-nodes-in-a-directed-graph.js --- 2876-count-visited-nodes-in-a-directed-graph.js | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/2876-count-visited-nodes-in-a-directed-graph.js b/2876-count-visited-nodes-in-a-directed-graph.js index df153750..0def283d 100644 --- a/2876-count-visited-nodes-in-a-directed-graph.js +++ b/2876-count-visited-nodes-in-a-directed-graph.js @@ -4,7 +4,8 @@ */ var countVisitedNodes = function(edges) { let n = edges.length, res = new Array(n).fill(0), j = 0; - for (let i = 0; i < n; j = ++i) { + for (let i = 0; i < n; i++) { + let j = i let seen = new Set(); let s = []; while (!seen.has(j) && res[j] == 0) { From 7d504b4ad41dc04c9255e5b245d668f9ebb1f54b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Oct 2023 20:29:50 +0800 Subject: [PATCH 1467/2039] Create 2866-beautiful-towers-ii.js --- 2866-beautiful-towers-ii.js | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 2866-beautiful-towers-ii.js diff --git a/2866-beautiful-towers-ii.js b/2866-beautiful-towers-ii.js new file mode 100644 index 00000000..8cbf4e55 --- /dev/null +++ b/2866-beautiful-towers-ii.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} maxHeights + * @return {number} + */ +const maximumSumOfHeights = function (maxHeights) { + let n = maxHeights.length + + let left = Array(n).fill(0) + let stack = [] + stack.push(-1) + let res = 0, + cur = 0 + for (let i = 0; i < n; i++) { + while (stack.length > 1 && maxHeights[stack.at(-1)] > maxHeights[i]) { + let j = stack.pop() + cur -= (j - stack.at(-1)) * maxHeights[j] + } + cur += 1 * (i - stack.at(-1)) * maxHeights[i] + stack.push(i) + left[i] = cur + } + + stack = [] + stack.push(n) + cur = 0 + for (let i = n - 1; i >= 0; i--) { + while (stack.length > 1 && maxHeights[stack.at(-1)] > maxHeights[i]) { + let j = stack.pop() + cur -= 1 * -(j - stack.at(-1)) * maxHeights[j] + } + cur += 1 * -(i - stack.at(-1)) * maxHeights[i] + stack.push(i) + res = Math.max(res, left[i] + cur - maxHeights[i]) + } + + return res +} From fbcf8cd0f8117cc003c3ac5c9321fc638b531fdd Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 3 Oct 2023 21:43:56 +0800 Subject: [PATCH 1468/2039] Update 1944-number-of-visible-people-in-a-queue.js --- 1944-number-of-visible-people-in-a-queue.js | 24 +++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/1944-number-of-visible-people-in-a-queue.js b/1944-number-of-visible-people-in-a-queue.js index d74994b3..b2864dfc 100644 --- a/1944-number-of-visible-people-in-a-queue.js +++ b/1944-number-of-visible-people-in-a-queue.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} heights + * @return {number[]} + */ +const canSeePersonsCount = function(heights) { + const n = heights.length + const res = Array(n).fill(0) + const stk = [] + for(let i = n - 1; i >= 0; i--) { + const cur = heights[i] + let del = 0 + while(stk.length && cur > heights[stk.at(-1)]) { + del++ + stk.pop() + } + res[i] = del + (stk.length ? 1 : 0) + stk.push(i) + } + + return res +}; + +// another + /** * @param {number[]} heights * @return {number[]} From 657ff1275d032786a30fde033865b3a9cf88d563 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 4 Oct 2023 23:10:58 +0800 Subject: [PATCH 1469/2039] Create 962-maximum-width-ramp.js --- 962-maximum-width-ramp.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 962-maximum-width-ramp.js diff --git a/962-maximum-width-ramp.js b/962-maximum-width-ramp.js new file mode 100644 index 00000000..8cd14c1e --- /dev/null +++ b/962-maximum-width-ramp.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxWidthRamp = function(nums) { + const s = []; + let res = 0, n = nums.length; + for (let i = 0; i < n; ++i) { + if (s.length === 0 || nums[s.at(-1)] > nums[i]) s.push(i); + } + + for (let i = n - 1; i > res; --i) { + while (s.length && nums[s.at(-1)] <= nums[i]) res = Math.max(res, i - s.pop()); + } + + return res; +}; From 04320658dd57959b1b1d02b7be56ddda04d00e36 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Oct 2023 23:48:49 -0500 Subject: [PATCH 1470/2039] Create 2897-apply-operations-on-array-to-maximize-sum-of-squares.js --- ...ons-on-array-to-maximize-sum-of-squares.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2897-apply-operations-on-array-to-maximize-sum-of-squares.js diff --git a/2897-apply-operations-on-array-to-maximize-sum-of-squares.js b/2897-apply-operations-on-array-to-maximize-sum-of-squares.js new file mode 100644 index 00000000..64c54537 --- /dev/null +++ b/2897-apply-operations-on-array-to-maximize-sum-of-squares.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maxSum = function(nums, k) { + const n = nums.length, mod = BigInt(1e9 + 7) + let res = 0n + const stk = Array(n).fill(0), idx = Array(32).fill(0) + for(const e of nums) { + for(let i = 0; i < 32; i++) { + if((e >> i) & 1) { + stk[idx[i]] += (1 << i) + idx[i]++ + } + } + } + + for(let i = 0; i < k; i++) { + res += BigInt(stk[i]) * BigInt(stk[i]) + res %= mod + } + + return Number(res) +}; From abf9481f56f13e51c932afea3538f5a11787856e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Oct 2023 23:57:36 -0500 Subject: [PATCH 1471/2039] Create 2896-apply-operations-to-make-two-strings-equal.js --- ...ly-operations-to-make-two-strings-equal.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2896-apply-operations-to-make-two-strings-equal.js diff --git a/2896-apply-operations-to-make-two-strings-equal.js b/2896-apply-operations-to-make-two-strings-equal.js new file mode 100644 index 00000000..839fa09e --- /dev/null +++ b/2896-apply-operations-to-make-two-strings-equal.js @@ -0,0 +1,39 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @param {number} x + * @return {number} + */ +const minOperations = function(s1, s2, x) { + const diffs = []; + for (let i = 0; i < s1.length; i++) { + if (s1[i] !== s2[i]) { + diffs.push(i); + } + } + + if (diffs.length % 2 === 1) { + return -1; + } + + const cache = new Map(); + function bestCostUpTo(i) { + if (i === 0) { + return x / 2; + } + if (i === -1) { + return 0; + } + if (cache.has(i)) { + return cache.get(i); + } + const cost = Math.min( + bestCostUpTo(i - 1) + x / 2, + bestCostUpTo(i - 2) + diffs[i] - diffs[i - 1] + ); + cache.set(i, cost); + return cost; + } + + return Math.floor(bestCostUpTo(diffs.length - 1)); +}; From 06c587c18da8a040edebe8aacdcfbd02b1a1d6ee Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Oct 2023 23:58:15 -0500 Subject: [PATCH 1472/2039] Create 2895-minimum-processing-time.js --- 2895-minimum-processing-time.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2895-minimum-processing-time.js diff --git a/2895-minimum-processing-time.js b/2895-minimum-processing-time.js new file mode 100644 index 00000000..02747490 --- /dev/null +++ b/2895-minimum-processing-time.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} processorTime + * @param {number[]} tasks + * @return {number} + */ +const minProcessingTime = function (processorTime, tasks) { + const n = processorTime.length + processorTime.sort((a, b) => a - b) + tasks.sort((a, b) => b - a) + let res = 0 + for(let i = 0, j = 0; i < n; i++, j += 4) { + res = Math.max(res, processorTime[i] + tasks[j]) + } + return res +} From 887d465429ac7db6ad0d8d09410661b4ef9e0bcd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 7 Oct 2023 23:58:43 -0500 Subject: [PATCH 1473/2039] Create 2894-divisible-and-non-divisible-sums-difference.js --- 2894-divisible-and-non-divisible-sums-difference.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2894-divisible-and-non-divisible-sums-difference.js diff --git a/2894-divisible-and-non-divisible-sums-difference.js b/2894-divisible-and-non-divisible-sums-difference.js new file mode 100644 index 00000000..d7a5db30 --- /dev/null +++ b/2894-divisible-and-non-divisible-sums-difference.js @@ -0,0 +1,13 @@ +/** + * @param {number} n + * @param {number} m + * @return {number} + */ +const differenceOfSums = function(n, m) { + let num1 = 0, num2 = 0 + for(let i = 1; i <= n; i++) { + if(i % m !== 0) num1 += i + if(i % m === 0) num2 += i + } + return num1 - num2 +}; From bdfd497c9dc871c01979f61490567e0b95e9f7ae Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Oct 2023 00:25:30 -0500 Subject: [PATCH 1474/2039] Create 1297-maximum-number-of-occurrences-of-a-substring.js --- ...um-number-of-occurrences-of-a-substring.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1297-maximum-number-of-occurrences-of-a-substring.js diff --git a/1297-maximum-number-of-occurrences-of-a-substring.js b/1297-maximum-number-of-occurrences-of-a-substring.js new file mode 100644 index 00000000..7d63bbac --- /dev/null +++ b/1297-maximum-number-of-occurrences-of-a-substring.js @@ -0,0 +1,24 @@ +/** + * @param {string} s + * @param {number} maxLetters + * @param {number} minSize + * @param {number} maxSize + * @return {number} + */ +function maxFreq(s, maxLetters, k, maxSize) { + let count = new Map(); + for (let i = 0; i <= s.length - k; i++) { + let substring = s.slice(i, i + k); + if (!count.has(substring)) { + count.set(substring, 0); + } + count.set(substring, count.get(substring) + 1); + } + let maxFreq = 0; + for (let [substring, freq] of count) { + if (new Set(substring).size <= maxLetters) { + maxFreq = Math.max(maxFreq, freq); + } + } + return maxFreq; +} From efa671fbb0c391bb249feda6c8057c949cec45d0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Oct 2023 01:49:00 -0500 Subject: [PATCH 1475/2039] Update 2896-apply-operations-to-make-two-strings-equal.js --- ...ly-operations-to-make-two-strings-equal.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/2896-apply-operations-to-make-two-strings-equal.js b/2896-apply-operations-to-make-two-strings-equal.js index 839fa09e..7e7492ca 100644 --- a/2896-apply-operations-to-make-two-strings-equal.js +++ b/2896-apply-operations-to-make-two-strings-equal.js @@ -1,3 +1,38 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @param {number} x + * @return {number} + */ +var minOperations = function(s1, s2, x) { + const n = s1.length; + const idxs = []; + for (let i = 0; i < n; i++) { + if (s1[i] !== s2[i]) { + idxs.push(i); + } + } + const k = idxs.length; + if (k % 2) { + return -1; + } + const dp = new Array(k + 1).fill(Infinity); + dp[0] = 0; + for (let i = 0; i < k; i++) { + if (i % 2 === 0) { + dp[i + 1] = dp[i]; + } else { + dp[i + 1] = dp[i] + x; + } + if (i) { + dp[i + 1] = Math.min(dp[i + 1], dp[i - 1] + idxs[i] - idxs[i - 1]); + } + } + return dp[k]; +}; + +// another + /** * @param {string} s1 * @param {string} s2 From bb70f9195df728585b4fbedab14c98c92806ab75 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Oct 2023 01:50:26 -0500 Subject: [PATCH 1476/2039] Update 2896-apply-operations-to-make-two-strings-equal.js --- 2896-apply-operations-to-make-two-strings-equal.js | 11 +++++++++++ 1 file changed, 11 insertions(+) diff --git a/2896-apply-operations-to-make-two-strings-equal.js b/2896-apply-operations-to-make-two-strings-equal.js index 7e7492ca..71acb213 100644 --- a/2896-apply-operations-to-make-two-strings-equal.js +++ b/2896-apply-operations-to-make-two-strings-equal.js @@ -19,11 +19,22 @@ var minOperations = function(s1, s2, x) { const dp = new Array(k + 1).fill(Infinity); dp[0] = 0; for (let i = 0; i < k; i++) { + /* + # 这里没有删除指的是没有用第二种操作 + # 如果目前考虑的元素个数为奇数，如果最后一个位置没有被删除，则前面位置都被删除了，那么当前的成本是 dp[i] + */ if (i % 2 === 0) { dp[i + 1] = dp[i]; } else { + /* + # 如果目前考虑的元素个数为偶数，如果最后一个位置没有被删除，则需要与前面的某项进行配对删除（第一种操作）， + # 那么当前的成本是 dp[i] + x，即前面有位置没被删除的成本 + 这次删除的成本，因为要删去最后两项 + */ dp[i + 1] = dp[i] + x; } + /* + # 考虑使用第二种操作 + */ if (i) { dp[i + 1] = Math.min(dp[i + 1], dp[i - 1] + idxs[i] - idxs[i - 1]); } From 4320bf9382ba7ac041478bf5586476903b23b6e0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Oct 2023 02:35:48 -0500 Subject: [PATCH 1477/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index 9b9130d8..0c65e37a 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -124,3 +124,41 @@ const findTheLongestSubstring = function(s) { return res }; + +// another + +/** + * @param {string} s + * @return {number} + */ +const findTheLongestSubstring = function (s) { + let mask = 0 + const n = s.length, + { max } = Math, + map = new Map(), + a = 'a'.charCodeAt(0), + set = new Set(['a', 'e', 'i', 'o', 'u']) + map.set(0, -1) + let res = 0 + for (let i = 0; i < n; i++) { + const ch = s[i] + if (set.has(ch)) { + const idx = ch.charCodeAt(0) - a + mask ^= 1 << idx + if (mask === 0) res = max(res, i + 1) + else if (map.has(mask)) { + res = max(res, i - map.get(mask)) + } else { + map.set(mask, i) + } + } else { + if(map.has(mask)) { + // console.log(i, map.get(mask)) + res = max(res, i - map.get(mask)) + } + } + } + + return res +} + From 66fee86854f5c8d4fd690d83c300ccdf053ccaf2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Oct 2023 21:30:12 -0500 Subject: [PATCH 1478/2039] Update 1542-find-longest-awesome-substring.js --- 1542-find-longest-awesome-substring.js | 34 ++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/1542-find-longest-awesome-substring.js b/1542-find-longest-awesome-substring.js index aaa37653..7426ad8f 100644 --- a/1542-find-longest-awesome-substring.js +++ b/1542-find-longest-awesome-substring.js @@ -1,3 +1,37 @@ +/** + * @param {string} s + * @return {number} + */ +const longestAwesome = function(s) { + const n = s.length, map = new Map(), {max} = Math + let res = 0, mask = 0 + + map.set(0, -1) + for(let i = 0; i < n; i++) { + const d = +s[i] + mask ^= (1 << d) + if(map.has(mask)) { + res = max(res, i - map.get(mask)) + } + + for(let j = 0; j < 10; j++) { + const tmp = mask ^ (1 << j) + if(map.has(tmp)) { + // console.log(i, map.get(tmp), tmp) + res = max(res, i - map.get(tmp)) + } + } + + if(!map.has(mask)) { + map.set(mask, i) + } + } + + return res +}; + +// another + /** * @param {string} s * @return {number} From bcdfe81ac805ba8b5a28db4ace663e5031abedc7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 10 Oct 2023 22:04:17 +0800 Subject: [PATCH 1479/2039] Update 169-majority-element.js --- 169-majority-element.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/169-majority-element.js b/169-majority-element.js index 91f38a94..34d524d4 100755 --- a/169-majority-element.js +++ b/169-majority-element.js @@ -1,3 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const majorityElement = function(nums) { + let res = 0, cnt = 0 + + for(const e of nums) { + if(cnt === 0) { + res = e + } + if(res === e) cnt++ + else cnt-- + } + + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 97f5d05cacdcfa03e328dd2453a9b0e49edb829a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 10 Oct 2023 22:17:35 +0800 Subject: [PATCH 1480/2039] Update 229-majority-element-ii.js --- 229-majority-element-ii.js | 39 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/229-majority-element-ii.js b/229-majority-element-ii.js index 96d6c824..2f1b5be7 100644 --- a/229-majority-element-ii.js +++ b/229-majority-element-ii.js @@ -1,3 +1,42 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const majorityElement = function(nums) { + let candidate1 = 0, candidate2 = 0, cnt1 = 0, cnt2 = 0 + for(const e of nums) { + if(e === candidate1) { + cnt1++ + } else if(e === candidate2) { + cnt2++ + } else if(cnt1 === 0) { + candidate1 = e + cnt1++ + } else if(cnt2 === 0) { + candidate2 = e + cnt2++ + } else { + cnt1-- + cnt2-- + } + } + + const n = nums.length + let c1 = 0, c2 = 0 + for(const e of nums) { + if(e === candidate1) c1++ + if(e === candidate2) c2++ + } + const k = Math.floor(n / 3) + const res = [] + if(c1 > k) res.push(candidate1) + if(c2 > k) res.push(candidate2) + if(res[0] === res[1]) res.pop() + return res +}; + +// another + /** * @param {number[]} nums * @return {number[]} From eb3cab9433cf9b3ab03a3c5b8b92a9413cc7ade6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 10 Oct 2023 22:41:06 -0500 Subject: [PATCH 1481/2039] Update 1590-make-sum-divisible-by-p.js --- 1590-make-sum-divisible-by-p.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1590-make-sum-divisible-by-p.js b/1590-make-sum-divisible-by-p.js index 91857ae1..182ae5a0 100644 --- a/1590-make-sum-divisible-by-p.js +++ b/1590-make-sum-divisible-by-p.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @param {number} p + * @return {number} + */ +const minSubarray = function(nums, p) { + const sum = nums.reduce((ac, e) => ac+ e,0) + const target = sum % p, n = nums.length, {min} = Math + if(target === 0) return 0 + const map = new Map() + map.set(0, -1) + let res = n + for(let i = 0, s = 0; i < n; i++) { + s += nums[i] + const r = s % p + + if(r >= target) { + if(map.has(r - target)) res = min(res, i - map.get(r-target)) + }else { + if(map.has(p + r - target)) res = min(res, i - map.get(p + r - target)) + } + map.set(r, i) + } + + return res === n ? -1 : res +}; + +// another + + /** * @param {number[]} nums * @param {number} p From c09d159d9f5eac813170538beace00e58b7a2e69 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 11 Oct 2023 00:43:54 -0500 Subject: [PATCH 1482/2039] Create 2483-minimum-penalty-for-a-shop.js --- 2483-minimum-penalty-for-a-shop.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2483-minimum-penalty-for-a-shop.js diff --git a/2483-minimum-penalty-for-a-shop.js b/2483-minimum-penalty-for-a-shop.js new file mode 100644 index 00000000..ed7948fa --- /dev/null +++ b/2483-minimum-penalty-for-a-shop.js @@ -0,0 +1,20 @@ +/** + * @param {string} customers + * @return {number} + */ +const bestClosingTime = function (customers) { + const n = customers.length, {min} = Math + let penalty = n, idx = -1, ma = 0 + for(let i = 0, save = 0; i < n; i++) { + const ch = customers[i] + if(ch === 'Y') save++ + else save-- + + if(save > ma) { + idx = i + ma = save + } + } + + return idx + 1 +} From eef0ac565474624f9de6f2d3ffa0d9f65a1a0b22 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 12 Oct 2023 20:25:02 +0800 Subject: [PATCH 1483/2039] Update 1658-minimum-operations-to-reduce-x-to-zero.js --- ...-minimum-operations-to-reduce-x-to-zero.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1658-minimum-operations-to-reduce-x-to-zero.js b/1658-minimum-operations-to-reduce-x-to-zero.js index 15935ef5..1e9fd1d6 100644 --- a/1658-minimum-operations-to-reduce-x-to-zero.js +++ b/1658-minimum-operations-to-reduce-x-to-zero.js @@ -1,3 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} x + * @return {number} + */ +const minOperations = function(nums, x) { + const n = nums.length + const sum = nums.reduce((ac, e) => ac + e, 0) + const target = sum - x + if(target < 0) return -1 + if(target === 0) return n + const map = new Map() + map.set(0, -1) + let res = 0 + for(let i = 0, cur = 0; i < n; i++) { + cur += nums[i] + if(map.has(cur - target)) { + res = Math.max(res, i - map.get(cur - target)) + } + + if(!map.has(cur)) map.set(cur, i) + } + + return res === 0 ? -1 : n - res +}; + +// another + /** * @param {number[]} nums * @param {number} x From 80dd26077ce5ad4d2490209a20fea88f8ab79706 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 12 Oct 2023 22:45:14 -0500 Subject: [PATCH 1484/2039] Update 1915-number-of-wonderful-substrings.js --- 1915-number-of-wonderful-substrings.js | 27 ++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1915-number-of-wonderful-substrings.js b/1915-number-of-wonderful-substrings.js index 8402c87d..99f3a690 100644 --- a/1915-number-of-wonderful-substrings.js +++ b/1915-number-of-wonderful-substrings.js @@ -1,3 +1,30 @@ +/** + * @param {string} word + * @return {number} + */ +const wonderfulSubstrings = function (word) { + const n = word.length, + a = 'a'.charCodeAt(0) + const map = new Map() + map.set(0, 1) + let res = 0 + for (let i = 0, mask = 0; i < n; i++) { + const idx = word[i].charCodeAt(0) - a + mask ^= 1 << idx + res += (map.get(mask) || 0) + for (let j = 0; j < 10; j++) { + const tmp = mask ^ (1 << j) + res += map.get(tmp) || 0 + } + + map.set(mask, (map.get(mask) || 0) + 1) + } + return res +} + +// another + + /** * @param {string} word * @return {number} From ff7748a76af212753cfe54a18bdff4f3306270cc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Oct 2023 13:39:25 +0800 Subject: [PATCH 1485/2039] Create 2903-find-indices-with-index-and-value-difference-i.js --- ...dices-with-index-and-value-difference-i.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2903-find-indices-with-index-and-value-difference-i.js diff --git a/2903-find-indices-with-index-and-value-difference-i.js b/2903-find-indices-with-index-and-value-difference-i.js new file mode 100644 index 00000000..46a565c9 --- /dev/null +++ b/2903-find-indices-with-index-and-value-difference-i.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number} indexDifference + * @param {number} valueDifference + * @return {number[]} + */ +var findIndices = function(nums, indexDifference, valueDifference) { + let res = [-1, -1] + const {abs} = Math, n = nums.length + for(let i = 0; i < n; i++) { + for(let j = i; j < n; j++) { + if(abs(i - j) >= indexDifference && abs(nums[i] - nums[j]) >= valueDifference) { + res = [i, j] + } + } + } + + + return res +}; From 7ab055b0ab4e499d277a50216a4de2633b6b5b0f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Oct 2023 13:39:52 +0800 Subject: [PATCH 1486/2039] Create 2904-shortest-and-lexicographically-smallest-beautiful-string.js --- ...cographically-smallest-beautiful-string.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 2904-shortest-and-lexicographically-smallest-beautiful-string.js diff --git a/2904-shortest-and-lexicographically-smallest-beautiful-string.js b/2904-shortest-and-lexicographically-smallest-beautiful-string.js new file mode 100644 index 00000000..b138eec2 --- /dev/null +++ b/2904-shortest-and-lexicographically-smallest-beautiful-string.js @@ -0,0 +1,43 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const shortestBeautifulSubstring = function (s, k) { + let n = s.length; + let left = 0; + let right = 0; + let count = 0; + let min_length = Infinity; + let res = ""; + while (right < n) { + count = updateCount(s[right], count); + while (count === k) { + [min_length, res] = updateRes(s, left, right, min_length, res); + count = updateCount(s[left], count, false); + left++; + } + right++; + } + return res; + + + function updateCount(c, count, increment = true) { + if (c === '1') { + return increment ? count + 1 : count - 1; + } + return count; + } + + function updateRes(s, left, right, min_length, res) { + if (right - left + 1 < min_length) { + min_length = right - left + 1; + res = s.substring(left, left + min_length); + } else if (right - left + 1 === min_length) { + // res = Math.min(res, s.substring(left, left + min_length)); + if(s.substring(left, left + min_length) < res) res = s.substring(left, left + min_length) + } + return [min_length, res]; + } + +} From 2f89661d1a2eb0d2168666db34073390ccba7741 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Oct 2023 13:40:20 +0800 Subject: [PATCH 1487/2039] Create 2905-find-indices-with-index-and-value-difference-ii.js --- ...ices-with-index-and-value-difference-ii.js | 156 ++++++++++++++++++ 1 file changed, 156 insertions(+) create mode 100644 2905-find-indices-with-index-and-value-difference-ii.js diff --git a/2905-find-indices-with-index-and-value-difference-ii.js b/2905-find-indices-with-index-and-value-difference-ii.js new file mode 100644 index 00000000..a8d47bb8 --- /dev/null +++ b/2905-find-indices-with-index-and-value-difference-ii.js @@ -0,0 +1,156 @@ +/** + * @param {number[]} nums + * @param {number} indexDifference + * @param {number} valueDifference + * @return {number[]} + */ +class SegmentTree { + constructor(start = 0, end = 0, value = null, lazy = null, merge) { + this.start = start + this.end = end + this.value = value + this.lazy = lazy + this.merge = merge + this.left = null + this.right = null + } + + get mid() { + return this.start + Math.floor((this.end - this.start) / 2) + } + + build(arr) { + return this.buildHelper(0, arr.length - 1, arr) + } + + buildHelper(left, right, arr) { + if (left > right) return null + const root = new SegmentTree(left, right, arr[left], null, this.merge) + if (left === right) return root + const mid = Math.floor((left + right) / 2) + root.left = this.buildHelper(left, mid, arr) + root.right = this.buildHelper(mid + 1, right, arr) + root.value = this.safeMerge(root.left?.value, root.right?.value) + return root + } + + build(left, right, defaultValue) { + if (left > right) return null + return new SegmentTree(left, right, defaultValue, null, this.merge) + } + + update(root, l, r, v) { + if (l <= root.start && r >= root.end) { + root.value = v + root.lazy = this.safeMerge(root.lazy, v) + return + } + if (root.left === null || root.right === null) { + const mid = root.mid + if (root.left === null) + root.left = this.build(root.start, mid, root.value) + if (root.right === null) + root.right = this.build(mid + 1, root.end, root.value) + } + this.pushDown(root) + const mid = root.mid + if (l <= mid) { + this.update(root.left, l, r, v) + } + if (r > mid) { + this.update(root.right, l, r, v) + } + root.value = this.merge(root.left.value, root.right.value) + } + + pushDown(root) { + if (root.lazy === null) return + root.left.lazy = this.safeMerge(root.left.lazy, root.lazy) + root.right.lazy = this.safeMerge(root.right.lazy, root.lazy) + root.left.value = this.safeMerge(root.left.value, root.lazy) + root.right.value = this.safeMerge(root.right.value, root.lazy) + root.lazy = null + } + + update(root, index, value) { + if (root.start === index && root.end === index) { + root.value = value + return + } + if (root.left === null || root.right === null) { + const mid = root.mid + if (root.left === null) + root.left = this.build(root.start, mid, root.value) + if (root.right === null) + root.right = this.build(mid + 1, root.end, root.value) + } + const mid = root.mid + if (index <= mid) { + this.update(root.left, index, value) + root.value = this.safeMerge(root.left.value, root.right.value) + } else { + this.update(root.right, index, value) + root.value = this.safeMerge(root.left.value, root.right.value) + } + } + + query(root, left, right) { + if (left <= root.start && right >= root.end) { + return root.value + } + if (root.left === null || root.right === null) { + const mid = root.mid + if (root.left === null) + root.left = this.build(root.start, mid, root.value) + if (root.right === null) + root.right = this.build(mid + 1, root.end, root.value) + } + this.pushDown(root) + const mid = root.mid + let ans = null + if (mid >= left) { + ans = this.safeMerge(ans, this.query(root.left, left, right)) + } + if (mid + 1 <= right) { + ans = this.safeMerge(ans, this.query(root.right, left, right)) + } + return ans + } + + safeMerge(a, b) { + if (a === null) return b + if (b === null) return a + return this.merge(a, b) + } + + lazyMerge(a, b) { + return b + } +} + +function findIndices(nums, indexDifference, valueDifference) { + const root = new SegmentTree(0, 100005, [0, 0], null, (a, b) => + a[0] >= b[0] ? a : b, + ) + for (let i = 0; i < nums.length; i++) { + root.update(root, i, [nums[i], i]) + } + + for (let i = 0; i < nums.length; i++) { + const left = i - indexDifference + if (left >= 0) { + const max = root.query(root, 0, left) + if (max[0] - nums[i] >= valueDifference) { + return [max[1], i] + } + } + const right = i + indexDifference + if (right < nums.length) { + const max = root.query(root, right, nums.length - 1) + if (max[0] - nums[i] >= valueDifference) { + return [i, max[1]] + } + } + } + return [-1, -1] +} From a5bd49d7392d0d2381462c044a323937bbd69e51 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 15 Oct 2023 13:40:45 +0800 Subject: [PATCH 1488/2039] Create 2906-construct-product-matrix.js --- 2906-construct-product-matrix.js | 68 ++++++++++++++++++++++++++++++++ 1 file changed, 68 insertions(+) create mode 100644 2906-construct-product-matrix.js diff --git a/2906-construct-product-matrix.js b/2906-construct-product-matrix.js new file mode 100644 index 00000000..5396d36c --- /dev/null +++ b/2906-construct-product-matrix.js @@ -0,0 +1,68 @@ +/** + * @param {number[][]} grid + * @return {number[][]} + */ +var constructProductMatrix = function(grid) { + const mod = 12345; + const n = grid.length; + const m = grid[0].length; + + const row = new Array(n).fill(1); + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + row[i] = (row[i] * grid[i][j]) % mod; + } + } + + const rowLeft = new Array(n).fill(1); + const rowRight = new Array(n).fill(1); + for (let i = 0; i < n; i++) { + rowLeft[i] = (i === 0) ? row[i] : rowLeft[i - 1] * row[i]; + rowLeft[i] = rowLeft[i] % mod; + } + for (let i = n - 1; i >= 0; i--) { + rowRight[i] = (i === n - 1) ? row[i] : rowRight[i + 1] * row[i]; + rowRight[i] = rowRight[i] % mod; + } + + const colLeft = new Array(n); + const colRight = new Array(n); + for (let i = 0; i < n; i++) { + colLeft[i] = new Array(m); + colRight[i] = new Array(m); + for (let j = 0; j < m; j++) { + colLeft[i][j] = (j === 0) ? grid[i][j] : colLeft[i][j - 1] * grid[i][j]; + colLeft[i][j] = colLeft[i][j] % mod; + } + for (let j = m - 1; j >= 0; j--) { + colRight[i][j] = (j === m - 1) ? grid[i][j] : colRight[i][j + 1] * grid[i][j]; + colRight[i][j] = colRight[i][j] % mod; + } + } + + const ans = new Array(n); + for (let i = 0; i < n; i++) { + ans[i] = new Array(m); + for (let j = 0; j < m; j++) { + let tmp = 1; + if (i - 1 >= 0) { + tmp *= rowLeft[i - 1]; + tmp %= mod; + } + if (i + 1 < n) { + tmp *= rowRight[i + 1]; + tmp %= mod; + } + if (j - 1 >= 0) { + tmp *= colLeft[i][j - 1]; + tmp %= mod; + } + if (j + 1 < m) { + tmp *= colRight[i][j + 1]; + tmp %= mod; + } + ans[i][j] = tmp; + } + } + return ans; +}; From b359e53909434b39df431f83e8da2adf3b16d303 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 16 Oct 2023 01:52:51 -0500 Subject: [PATCH 1489/2039] Create 2588-count-the-number-of-beautiful-subarrays.js --- ...count-the-number-of-beautiful-subarrays.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2588-count-the-number-of-beautiful-subarrays.js diff --git a/2588-count-the-number-of-beautiful-subarrays.js b/2588-count-the-number-of-beautiful-subarrays.js new file mode 100644 index 00000000..62786c7b --- /dev/null +++ b/2588-count-the-number-of-beautiful-subarrays.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const beautifulSubarrays = function (nums) { + const map = new Map() + map.set(0, 1) + let res = 0 + const n = nums.length + for(let i = 0, mask = 0; i < n; i++) { + const cur = nums[i] + mask ^= cur + if(map.has(mask)) { + res += map.get(mask) + } + map.set(mask, (map.get(mask) || 0) + 1) + } + + return res +} From 3a68a2f65921d16bb66329fd3b7f7a8e27c06a1d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 16 Oct 2023 21:37:43 -0500 Subject: [PATCH 1490/2039] Create 2845-count-of-interesting-subarrays.js --- 2845-count-of-interesting-subarrays.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2845-count-of-interesting-subarrays.js diff --git a/2845-count-of-interesting-subarrays.js b/2845-count-of-interesting-subarrays.js new file mode 100644 index 00000000..6acf17c8 --- /dev/null +++ b/2845-count-of-interesting-subarrays.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} modulo + * @param {number} k + * @return {number} + */ +const countInterestingSubarrays = function (nums, modulo, k) { + const n = nums.length + const map = new Map() + let res = 0 + map.set(0, 1) + for (let i = 0, cnt = 0; i < n; i++) { + const cur = nums[i] + if (cur % modulo === k) { + cnt++ + } + const key = cnt % modulo + if(key >= k) res += map.get(key - k) || 0 + else res += map.get(modulo - (k - key)) || 0 + + map.set(key, (map.get(key) || 0) + 1) + } + + return res +} From 9e7dca4b46596692450e3dc01253e136a895c403 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 16 Oct 2023 21:43:10 -0500 Subject: [PATCH 1491/2039] Update 2845-count-of-interesting-subarrays.js --- 2845-count-of-interesting-subarrays.js | 3 +++ 1 file changed, 3 insertions(+) diff --git a/2845-count-of-interesting-subarrays.js b/2845-count-of-interesting-subarrays.js index 6acf17c8..e1cac0b4 100644 --- a/2845-count-of-interesting-subarrays.js +++ b/2845-count-of-interesting-subarrays.js @@ -15,8 +15,11 @@ const countInterestingSubarrays = function (nums, modulo, k) { cnt++ } const key = cnt % modulo + /* if(key >= k) res += map.get(key - k) || 0 else res += map.get(modulo - (k - key)) || 0 + */ + res += map.get((modulo + key - k) % modulo) || 0 map.set(key, (map.get(key) || 0) + 1) } From 9cf4604195c638d0eada49ce82098ac525952c0d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 Oct 2023 00:53:56 -0500 Subject: [PATCH 1492/2039] Update 2875-minimum-size-subarray-in-infinite-array.js --- ...minimum-size-subarray-in-infinite-array.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2875-minimum-size-subarray-in-infinite-array.js b/2875-minimum-size-subarray-in-infinite-array.js index 94c6b1b3..9746278e 100644 --- a/2875-minimum-size-subarray-in-infinite-array.js +++ b/2875-minimum-size-subarray-in-infinite-array.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +const minSizeSubarray = function (nums, target) { + const sum = nums.reduce((ac, e) => ac + e, 0) + const remain = target % sum + if(remain === 0) return target / sum * nums.length + const arr = [...nums, ...nums] + const map = new Map() + const n = arr.length + let r = Infinity + for(let i = 0, cur = 0; i < n; i++) { + const e = arr[i] + cur += e + // const tmp = cur % target + if(map.has(cur - remain)) r = Math.min(r, i - map.get(cur-remain)) + map.set(cur, i) + } + if(r === Infinity) return -1 + return r + Math.floor(target / sum) * nums.length +} + +// another + + /** * @param {number[]} nums * @param {number} target From dfd3206b6194bf008ed0559925d32a29034150e7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 19 Oct 2023 20:30:27 +0800 Subject: [PATCH 1493/2039] Update 322-coin-change.js --- 322-coin-change.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/322-coin-change.js b/322-coin-change.js index 0c795775..4e16731e 100644 --- a/322-coin-change.js +++ b/322-coin-change.js @@ -1,3 +1,24 @@ +/** + * @param {number[]} coins + * @param {number} amount + * @return {number} + */ +const coinChange = function(coins, amount) { + const n = coins.length + const dp = Array(amount + 1).fill(Infinity) + dp[0] = 0 + for(const e of coins) dp[e] = 1 + for(let i = 1; i <= amount; i++) { + for(const e of coins) { + if(i > e) dp[i] = Math.min(dp[i], dp[i - e] + 1) + } + } + // console.log(dp) + return dp[amount] !== Infinity ? dp[amount] : -1 +}; + +// another + /** * @param {number[]} coins * @param {number} amount From 595339634014cc6db321993b47623092d508003d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 20 Oct 2023 02:38:15 -0500 Subject: [PATCH 1494/2039] Update 518-coin-change-2.js --- 518-coin-change-2.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/518-coin-change-2.js b/518-coin-change-2.js index 54db7941..92577234 100644 --- a/518-coin-change-2.js +++ b/518-coin-change-2.js @@ -1,3 +1,29 @@ +/** + * @param {number} amount + * @param {number[]} coins + * @return {number} + */ +const change = function(amount, coins) { + const n = coins.length + const dp = Array.from({length: n + 1}, () => Array(amount + 1).fill(0)) + for(let i = 0; i <= n; i++) { + dp[i][0] = 1 + } + + for(let j = 1; j <= amount; j++) { + for(let i = 1; i <= n; i++) { + const e = coins[i - 1] + dp[i][j] = dp[i - 1][j] + (j >= e ? dp[i][j - e]: 0) + } + } + // console.log(dp) + return dp[n][amount] +}; + +// another + + + /** * @param {number} amount * @param {number[]} coins From 04f3bedeba73d2a0fa98eace74b6929293d0e716 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 21 Oct 2023 21:56:07 +0800 Subject: [PATCH 1495/2039] Update 494-target-sum.js --- 494-target-sum.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/494-target-sum.js b/494-target-sum.js index 86e36c48..2a414a41 100755 --- a/494-target-sum.js +++ b/494-target-sum.js @@ -1,3 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +const findTargetSumWays = function(nums, target) { + const n = nums.length + let res = 0 + for(let i = 0, limit = Math.pow(2, n); i < limit; i++) { + if(helper(i)) res++ + } + + return res + + function helper(mask) { + let sum = 0 + for(let i = 0; i < nums.length; i++) { + if(mask & (1 << i)) { + sum += nums[i] + } else sum -= nums[i] + } + + return sum === target + } +}; + +// another + /** * @param {number[]} nums * @param {number} target From b8c49670e6b80f9bf155465716f10df72ba37237 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Oct 2023 19:05:18 +0800 Subject: [PATCH 1496/2039] Create 2908-minimum-sum-of-mountain-triplets-i.js --- 2908-minimum-sum-of-mountain-triplets-i.js | 34 ++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2908-minimum-sum-of-mountain-triplets-i.js diff --git a/2908-minimum-sum-of-mountain-triplets-i.js b/2908-minimum-sum-of-mountain-triplets-i.js new file mode 100644 index 00000000..d5fc9135 --- /dev/null +++ b/2908-minimum-sum-of-mountain-triplets-i.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumSum = function(nums) { + let pre = [],pmin = [], suf = [], smin = [] + let i = 0 + const n = nums.length + for(let i = 0; i < n; i++) { + const cur = nums[i] + while(pre.length && cur <= nums[pre.at(-1)]) { + pre.pop() + } + if(pre.length) pmin[i] = nums[pre[0]] + pre.push(i) + } + for(let i = n - 1; i >= 0; i--) { + const cur = nums[i] + while(suf.length && cur <= nums[suf.at(-1)]) { + suf.pop() + } + if(suf.length) smin[i] = nums[suf[0]] + suf.push(i) + } + let res = Infinity + + for(let i = 1; i < n - 1;i++) { + if(pmin[i] != null && smin[i] != null) { + res = Math.min(res, nums[i] + pmin[i] + smin[i]) + } + } + + return res === Infinity ? -1 : res +}; From 2ff445f588c8fe3ea1f9d626563186130d4c84e1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Oct 2023 19:05:56 +0800 Subject: [PATCH 1497/2039] Create 2909-minimum-sum-of-mountain-triplets-ii.js --- 2909-minimum-sum-of-mountain-triplets-ii.js | 34 +++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2909-minimum-sum-of-mountain-triplets-ii.js diff --git a/2909-minimum-sum-of-mountain-triplets-ii.js b/2909-minimum-sum-of-mountain-triplets-ii.js new file mode 100644 index 00000000..d5fc9135 --- /dev/null +++ b/2909-minimum-sum-of-mountain-triplets-ii.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumSum = function(nums) { + let pre = [],pmin = [], suf = [], smin = [] + let i = 0 + const n = nums.length + for(let i = 0; i < n; i++) { + const cur = nums[i] + while(pre.length && cur <= nums[pre.at(-1)]) { + pre.pop() + } + if(pre.length) pmin[i] = nums[pre[0]] + pre.push(i) + } + for(let i = n - 1; i >= 0; i--) { + const cur = nums[i] + while(suf.length && cur <= nums[suf.at(-1)]) { + suf.pop() + } + if(suf.length) smin[i] = nums[suf[0]] + suf.push(i) + } + let res = Infinity + + for(let i = 1; i < n - 1;i++) { + if(pmin[i] != null && smin[i] != null) { + res = Math.min(res, nums[i] + pmin[i] + smin[i]) + } + } + + return res === Infinity ? -1 : res +}; From 54e9cda5c51ae85f49e172d174b7e875de40d098 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Oct 2023 19:06:32 +0800 Subject: [PATCH 1498/2039] Create 2910-minimum-number-of-groups-to-create-a-valid-assignment.js --- ...-of-groups-to-create-a-valid-assignment.js | 61 +++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 2910-minimum-number-of-groups-to-create-a-valid-assignment.js diff --git a/2910-minimum-number-of-groups-to-create-a-valid-assignment.js b/2910-minimum-number-of-groups-to-create-a-valid-assignment.js new file mode 100644 index 00000000..37496cc8 --- /dev/null +++ b/2910-minimum-number-of-groups-to-create-a-valid-assignment.js @@ -0,0 +1,61 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minGroupsForValidAssignment = function(nums) { + let mp = new Map(); + for (let i = 0; i < nums.length; i++) { + if (mp.has(nums[i])) { + mp.set(nums[i], mp.get(nums[i]) + 1); + } else { + mp.set(nums[i], 1); + } + } + + let maxi = 0; + let n = nums.length; + + let u = new Map(); + for (let i of nums) { + if (u.has(i)) { + u.set(i, u.get(i) + 1); + } else { + u.set(i, 1); + } + maxi = Math.max(maxi, u.get(i)); + } + + for (let i = maxi; i >= 1; i--) { + if (posi(i, u)) { + let res = 0; + for (let [curr, c] of u) { + let left = c % i; + res += Math.floor(c / i); + if (left > 0) { + res++; + } + } + return res; + } + } + return -1; + } + + function posi(x, u) { + for (let [curr, cnt] of u) { + let left = cnt % x; + let tt = Math.floor(cnt / x); + + if (left < x - 1) { + let req = (x - 1) - left; + if (tt >= req) { + left = x - 1; + } + } + + if (left > 0 && left < x - 1) { + return false; + } + } + return true; + } From 36d332dd52667b4d30b8af6abbfa6d89e3db5705 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Oct 2023 19:07:10 +0800 Subject: [PATCH 1499/2039] Create 2911-minimum-changes-to-make-k-semi-palindromes.js --- ...imum-changes-to-make-k-semi-palindromes.js | 62 +++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 2911-minimum-changes-to-make-k-semi-palindromes.js diff --git a/2911-minimum-changes-to-make-k-semi-palindromes.js b/2911-minimum-changes-to-make-k-semi-palindromes.js new file mode 100644 index 00000000..7e758952 --- /dev/null +++ b/2911-minimum-changes-to-make-k-semi-palindromes.js @@ -0,0 +1,62 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var minimumChanges = function(s, k) { + const ins = new Solution() + return ins.minimumChanges(s,k) +}; + +class Solution { + constructor() { + this.fac = new Array(210).fill(0).map(() => []); // A vector of vectors to store factors of string lengths. + } + + num(st) { + const n = st.length; + let ans = 1e9; + for (const it of this.fac[st.length]) { + const nu = Math.floor(n / it); + let cur = 0; + for (let i = 0; i < Math.floor(nu / 2); i++) { + const i2 = nu - i - 1; + for (let j = 0; j < it; j++) { + if (st[i * it + j] !== st[i2 * it + j]) { + cur++; + } + } + } + ans = Math.min(ans, cur); + } + return ans; + } + + minimumChanges(st, k) { + const n = st.length; + + for (let i = 2; i <= n; i++) { + this.fac[i] = []; + for (let j = 1; j < i; j++) { + if (i % j === 0) { + this.fac[i].push(j); + } + } + } + + const dp = new Array(n + 1).fill(0).map(() => new Array(k + 1).fill(1e9)); + dp[0][0] = 0; + + for (let i = 0; i < n; i++) { + for (let j = 0; j <= i; j++) { + const cur = st.slice(j, i + 1); + const add = this.num(cur); + for (let l = 0; l < k; l++) { + dp[i + 1][l + 1] = Math.min(dp[i + 1][l + 1], dp[j][l] + add); + } + } + } + + return dp[n][k]; + } +} From 7561738d871bee3a90740b91f72118383008577a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Oct 2023 19:36:37 +0800 Subject: [PATCH 1500/2039] Update 416-partition-equal-subset-sum.js --- 416-partition-equal-subset-sum.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/416-partition-equal-subset-sum.js b/416-partition-equal-subset-sum.js index c118c8e6..7c79d633 100644 --- a/416-partition-equal-subset-sum.js +++ b/416-partition-equal-subset-sum.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +const canPartition = function(nums) { + const n = nums.length + const sum = nums.reduce((ac, e) => ac + e, 0) + if(sum % 2 === 1) return false + const target = sum / 2 + const dp = Array.from({length: n + 1}, () => Array(target + 101).fill(0)) + dp[0][0] = 1 + + for(let i = 1; i <= n ; i++) { + const e = nums[i - 1] + for(let s = 0; s < target + 101; s++) { + dp[i][s] = dp[i - 1][s] + if(s >= e) dp[i][s] += dp[i - 1][s - e] + } + } + return dp[n][target] > 0 +}; + +// another + /** * @param {number[]} nums * @return {boolean} From 86a1cdccbeb63d7f1869e156a13139635c52d9be Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Oct 2023 01:54:31 -0500 Subject: [PATCH 1501/2039] Update 2518-number-of-great-partitions.js --- 2518-number-of-great-partitions.js | 31 ++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2518-number-of-great-partitions.js b/2518-number-of-great-partitions.js index 7f2c0e66..a416e323 100644 --- a/2518-number-of-great-partitions.js +++ b/2518-number-of-great-partitions.js @@ -1,3 +1,34 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +function countPartitions(nums, k) { + const mod = 1e9 + 7 + let total = 0 + let res = 1 + const dp = new Array(k).fill(0) + dp[0] = 1 + + for (let a of nums) { + for (let i = k - 1 - a; i >= 0; i--) { + dp[i + a] = (dp[i + a] + dp[i]) % mod + } + res = (res * 2) % mod + total += a + } + + for (let i = 0; i < k; i++) { + res -= total - i < k ? dp[i] : dp[i] * 2 + } + + return ((res % mod) + mod) % mod +} + +// another + + + const ll = BigInt, mod = 1e9 + 7, bmod = ll(mod) From 3f1290a94b50a5fb6593a3ca79e0b5aa79ae68d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Oct 2023 02:29:33 -0500 Subject: [PATCH 1502/2039] Update 2518-number-of-great-partitions.js --- 2518-number-of-great-partitions.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2518-number-of-great-partitions.js b/2518-number-of-great-partitions.js index a416e323..6823b1af 100644 --- a/2518-number-of-great-partitions.js +++ b/2518-number-of-great-partitions.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +function countPartitions(nums, k) { + const bi = BigInt + const mod = bi(1e9 + 7) + const n = nums.length, total = bi(2 ** n) + const sum = nums.reduce((ac, e) => ac + e, 0) + if(sum < 2 * k) return 0 + const dp = Array.from({ length: n + 1}, () => Array(k).fill(0n)) + for(let i = 0; i <= n; i++) dp[i][0] = 1n + + for(let i = 1; i <= n; i++) { + const e = nums[i - 1] + for(let j = 1; j < k; j++) { + dp[i][j] = dp[i - 1][j] + if(j >= e) dp[i][j] = bi(dp[i][j] + dp[i - 1][j - e]) % mod + } + } + const tmp = dp[n].reduce((ac, e) => ac + bi(e), 0n) + return (total - tmp * 2n) % mod +} + +// another + /** * @param {number[]} nums * @param {number} k From 0eb33099934d224a674e524e1f5f0c2154aaff74 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Oct 2023 02:28:11 -0500 Subject: [PATCH 1503/2039] Update 879-profitable-schemes.js --- 879-profitable-schemes.js | 53 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) diff --git a/879-profitable-schemes.js b/879-profitable-schemes.js index ccccac9a..9a1a366c 100644 --- a/879-profitable-schemes.js +++ b/879-profitable-schemes.js @@ -1,3 +1,56 @@ +/** + * @param {number} n + * @param {number} minProfit + * @param {number[]} group + * @param {number[]} profit + * @return {number} + */ +const profitableSchemes = function (n, minProfit, group, profit) { + const m = group.length + const dp = buildMatrix([m + 1, n + 1, minProfit + 1], 0) + const mod = 1e9 + 7 + group.unshift(0) + profit.unshift(0) + dp[0][0][0] = 1 + console.log(group, profit) + for (let i = 0; i < m; i++) { + const g = group[i + 1], + p = profit[i + 1] + for (let j = 0; j <= n; j++) { + for (let k = 0; k <= minProfit; k++) { + dp[i + 1][j][k] += dp[i][j][k] + dp[i + 1][j][k] = dp[i + 1][j][k] % mod + if (j + g <= n) { + const pp = Math.min(minProfit, k + p) + dp[i + 1][j + g][pp] += dp[i][j][k] + dp[i + 1][j + g][pp] = dp[i + 1][j + g][pp] % mod + } + } + } + } + let res = 0 + for (let j = 0; j <= n; j++) { + res = (res + dp[m][j][minProfit]) % mod + } + + return res +} + +function buildMatrix(dimensions, defaultVal) { + if (dimensions.length === 1) return Array(dimensions[0]).fill(defaultVal) + const res = [] + const [len, ...rest] = dimensions + + for (let i = 0; i < len; i++) { + res.push(buildMatrix(rest, defaultVal)) + } + + return res +} + +// another + + /** * @param {number} G * @param {number} P From 6f3c4cd28b5b3c7f414f13a6d9677ad9ca595e0a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 Oct 2023 01:18:08 -0500 Subject: [PATCH 1504/2039] Update 1449-form-largest-integer-with-digits-that-add-up-to-target.js --- ...teger-with-digits-that-add-up-to-target.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1449-form-largest-integer-with-digits-that-add-up-to-target.js b/1449-form-largest-integer-with-digits-that-add-up-to-target.js index 8ceae82d..04f0c568 100644 --- a/1449-form-largest-integer-with-digits-that-add-up-to-target.js +++ b/1449-form-largest-integer-with-digits-that-add-up-to-target.js @@ -1,3 +1,34 @@ +/** + * @param {number[]} cost + * @param {number} target + * @return {string} + */ +const largestNumber = function (cost, target) { + const dp = Array(target + 1).fill('#') + cost.unshift(0) + dp[0] = '' + for (let sum = 0; sum <= target; sum++) { + for (let i = 1; i <= 9; i++) { + const e = cost[i] + if (sum < e) continue + if (dp[sum - e] === '#') continue + const str = dp[sum - e] + `${i}` + // console.log(str) + if ( + str.length > dp[sum].length || + (str.length === dp[sum].length && str > dp[sum]) + ) { + dp[sum] = str + } + } + } +// console.log(dp) + if (dp[target] === '#') return '0' + return dp[target] +} + +// another + /** * @param {number[]} cost * @param {number} target From a5d37aa8410db40b3ecb726f859d8b851d3e1742 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Oct 2023 21:38:10 -0500 Subject: [PATCH 1505/2039] Update 2291-maximum-profit-from-trading-stocks.js --- 2291-maximum-profit-from-trading-stocks.js | 26 ++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/2291-maximum-profit-from-trading-stocks.js b/2291-maximum-profit-from-trading-stocks.js index 4a69461f..27aba95e 100644 --- a/2291-maximum-profit-from-trading-stocks.js +++ b/2291-maximum-profit-from-trading-stocks.js @@ -15,3 +15,29 @@ const maximumProfit = function(present, future, budget) { } return dp[budget]; }; + +// another + +/** + * @param {number[]} present + * @param {number[]} future + * @param {number} budget + * @return {number} + */ +const maximumProfit = function(present, future, budget) { + const n = present.length + const dp = Array.from({ length: n + 1 }, () => Array(budget + 1).fill(0)) + + for(let b = 0; b <= budget; b++) { + for(let i = 1; i <= n; i++) { + const cost = present[i - 1] + const diff = future[i - 1] - cost + dp[i][b] = dp[i - 1][b] + if(b >= cost) { + dp[i][b] = Math.max(dp[i][b], dp[i - 1][b - cost] + diff) + } + } + } + + return dp[n][budget] + }; From 9990ab56a1461feca5fada6a4015c337d9aa0b9b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Oct 2023 22:54:46 +0800 Subject: [PATCH 1506/2039] Create 2902-count-of-sub-multisets-with-bounded-sum.js --- ...count-of-sub-multisets-with-bounded-sum.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2902-count-of-sub-multisets-with-bounded-sum.js diff --git a/2902-count-of-sub-multisets-with-bounded-sum.js b/2902-count-of-sub-multisets-with-bounded-sum.js new file mode 100644 index 00000000..7fbd2d1b --- /dev/null +++ b/2902-count-of-sub-multisets-with-bounded-sum.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} nums + * @param {number} l + * @param {number} r + * @return {number} + */ +var countSubMultisets = function (nums, l, r) { + const a = nums + const counter = (a_or_s) => { + let m = new Map() + for (const x of a_or_s) m.set(x, m.get(x) + 1 || 1) + return m + } + + const mod = 1e9 + 7 + let f = Array(r + 1).fill(0), + m = counter(a), + res = 0 + f[0] = 1 + for (const [x, occ] of m) { + if (x == 0) { + f = f.map((e) => e * (occ + 1)) + } else { + for (let i = x; i <= r; i++) { + f[i] += f[i - x] + f[i] %= mod + } + for (let i = r; i >= (occ + 1) * x; i--) { + f[i] -= f[i - (occ + 1) * x] + f[i] %= mod + } + } + } + for (let i = l; i <= r; i++) { + res += f[i] + res %= mod + } + return (res + mod) % mod +} From 36c0289d5838f28f8ec88a5202a8337e12de0ae3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 30 Oct 2023 02:40:52 -0500 Subject: [PATCH 1507/2039] Create 2826-sorting-three-groups.js --- 2826-sorting-three-groups.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2826-sorting-three-groups.js diff --git a/2826-sorting-three-groups.js b/2826-sorting-three-groups.js new file mode 100644 index 00000000..bab1b9b1 --- /dev/null +++ b/2826-sorting-three-groups.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minimumOperations = function(nums) { + const n = nums.length, { min } = Math + const dp = Array.from({ length: n + 1 }, () => Array(3 + 1).fill(0)) + + for(let i = 1; i <= n; i++) { + const e = nums[i - 1] + dp[i][1] = dp[i - 1][1] + (e === 1 ? 0 : 1) + dp[i][2] = min(dp[i - 1][1], dp[i - 1][2]) + (e === 2 ? 0 : 1) + dp[i][3] = min(dp[i - 1][1], dp[i - 1][2], dp[i - 1][3]) + (e === 3 ? 0 : 1) + } + return min(dp[n][1], dp[n][2], dp[n][3]) +}; From 90e7b13acb64b6e51d20ad65faa41d9cb8e19e50 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 31 Oct 2023 00:04:33 -0500 Subject: [PATCH 1508/2039] Create 2851-string-transformation.js --- 2851-string-transformation.js | 203 ++++++++++++++++++++++++++++++++++ 1 file changed, 203 insertions(+) create mode 100644 2851-string-transformation.js diff --git a/2851-string-transformation.js b/2851-string-transformation.js new file mode 100644 index 00000000..7becb586 --- /dev/null +++ b/2851-string-transformation.js @@ -0,0 +1,203 @@ +class Modulo { + /** + * @param {number} modulo + */ + constructor(modulo) { + /** @type {number} @readonly */ + this.modulo = modulo; + + /** @private @type {undefined | number} */ + this._phi = undefined; + } + + /** + * @returns {number} + */ + getPhi() { + if (this._phi !== undefined) return this._phi; + + let result = this.modulo; + let temp = this.modulo; + for (let i = 2; i <= Math.sqrt(temp); i++) { + if (temp % i === 0) { + result /= i; + result *= i - 1; + } + while (temp % i === 0) temp /= i; + } + if (temp > 1) { + result /= temp; + result *= temp - 1; + } + + this._phi = result; + return result; + } + + /** + * @param {number} a + * @returns {number} + */ + getInverse(a) { + return this.pow(a, this.getPhi() - 1); + } + + /** + * @param {...number} numbers + */ + add(...numbers) { + let result = 0; + for (let number of numbers) { + result = (result + (number % this.modulo)) % this.modulo; + } + + if (result < 0) result += this.modulo; + return result; + } + + /** + * @private + * @param {number} a + * @param {number} b + * @returns {number} + */ + _quickMul(a, b) { + a = ((a % this.modulo) + this.modulo) % this.modulo; + b = ((b % this.modulo) + this.modulo) % this.modulo; + if (a === 0 || b === 0) return 0; + + let result = 0; + while (b) { + while (b % 2 === 0) { + a = (a * 2) % this.modulo; + b /= 2; + } + + if (b % 2 !== 0) { + result = (result + a) % this.modulo; + b--; + } + } + + return result; + } + + /** + * @param {...number} numbers + */ + mul(...numbers) { + let result = 1; + for (let number of numbers) { + if (number > 0 && number < 1) + number = this.getInverse(Math.round(1 / number)); + result = this._quickMul(result, number); + if (result === 0) return 0; + } + + if (result < 0) result += this.modulo; + return result; + } + + /** + * @param {number} a + * @param {number} b + * @returns {number} + */ + div(a, b) { + return this._quickMul(a, this.getInverse(b)); + } + + /** + * @param {number} a + * @param {number} b + * @returns {number} + */ + pow(a, b) { + a = ((a % this.modulo) + this.modulo) % this.modulo; + if (a === 0) return 0; + + let result = 1; + while (b) { + while (b % 2 === 0) { + a = this._quickMul(a, a); + b /= 2; + } + + if (b % 2 !== 0) { + result = this._quickMul(result, a); + b--; + } + } + + return result; + } +} + +const mod = new Modulo(1000000007); + +/** + * @param {string} s + * @param {string} t + * @param {number} k + * @return {number} + */ +var numberOfWays = function (s, t, k) { + s += s; + const BASE = 26; + + const basePows = [1]; + function getBasePow(n) { + while (n >= basePows.length) { + basePows.push(mod.mul(basePows[basePows.length - 1], BASE)); + } + return basePows[n]; + } + + /** @param {string} s */ + function calcHashWord(s, pre = 0) { + let result = pre; + for (let i = 0; i < s.length; i++) { + result = mod.add( + mod.mul(result, BASE), + mod.mul(1 + s.charCodeAt(i), s.charCodeAt(i)) + ); + } + return result; + } + + const prefixHash = []; + prefixHash[-1] = 0; + + for (let i = 0; i < s.length; i++) { + prefixHash.push(calcHashWord(s[i], prefixHash[prefixHash.length - 1])); + } + + function getHash(l, r) { + return mod.add( + prefixHash[r], + -mod.mul(prefixHash[l - 1], getBasePow(r - l + 1)) + ); + } + + const hashedT = calcHashWord(t, 0); + let cntOcc = 0; + let flagFirstMatch = 0; + if (getHash(0, t.length - 1) === hashedT) { + cntOcc++; + flagFirstMatch = 1; + } + + for (let i = 1; i < t.length; i++) { + if (getHash(i, i + t.length - 1) === hashedT) cntOcc++; + } + + if (k == 1) return cntOcc - flagFirstMatch; + let res = mod.mul(cntOcc, mod.pow(t.length - 1, k)); + res = mod.add( + res, + mod.mul(flagFirstMatch * t.length - cntOcc, k % 2 ? -1 : 1) + ); + res = mod.div(res, t.length); + + return res; +}; From 9f09ae2a61e965d89f2b5c1880fd4830e8bb857d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 1 Nov 2023 02:54:30 -0500 Subject: [PATCH 1509/2039] Update 2896-apply-operations-to-make-two-strings-equal.js --- ...ly-operations-to-make-two-strings-equal.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/2896-apply-operations-to-make-two-strings-equal.js b/2896-apply-operations-to-make-two-strings-equal.js index 71acb213..2f43e165 100644 --- a/2896-apply-operations-to-make-two-strings-equal.js +++ b/2896-apply-operations-to-make-two-strings-equal.js @@ -1,3 +1,32 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @param {number} x + * @return {number} + */ +const minOperations = function (s1, s2, x) { + const n = s1.length, arr = [] + for(let i = 0; i < n; i++) { + if(s1[i] !== s2[i]) arr.push(i) + } + const len = arr.length + if(len % 2) return -1 + const cache = new Map() + return dfs(len - 1) + + function dfs(i) { + if(i < 0) return 0 + if(i === 0) return x / 2 + if(cache.has(i)) return cache.get(i) + const res = Math.min(dfs(i - 2) + arr[i] - arr[i - 1], dfs(i - 1) + x/2) + cache.set(i, res) + return res + } +} + +// another + + /** * @param {string} s1 * @param {string} s2 From ac0c775e546796e90f071ccb1603e13a58b78d69 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Nov 2023 01:06:11 -0500 Subject: [PATCH 1510/2039] Create 2900-longest-unequal-adjacent-groups-subsequence-i.js --- ...ngest-unequal-adjacent-groups-subsequence-i.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2900-longest-unequal-adjacent-groups-subsequence-i.js diff --git a/2900-longest-unequal-adjacent-groups-subsequence-i.js b/2900-longest-unequal-adjacent-groups-subsequence-i.js new file mode 100644 index 00000000..ba50d1fb --- /dev/null +++ b/2900-longest-unequal-adjacent-groups-subsequence-i.js @@ -0,0 +1,15 @@ +/** + * @param {number} n + * @param {string[]} words + * @param {number[]} groups + * @return {string[]} + */ +const getWordsInLongestSubsequence = function (n, words, groups) { + let res = [] + res.push(words[0]) + + for(let i = 1; i < n; i++) { + if(groups[i] !== groups[i - 1]) res.push(words[i]) + } + return res +} From cb5f316056574a50b3f469c2aaa81e28667e86e2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Nov 2023 13:06:47 +0800 Subject: [PATCH 1511/2039] Create 2901-longest-unequal-adjacent-groups-subsequence-ii.js --- ...-unequal-adjacent-groups-subsequence-ii.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 2901-longest-unequal-adjacent-groups-subsequence-ii.js diff --git a/2901-longest-unequal-adjacent-groups-subsequence-ii.js b/2901-longest-unequal-adjacent-groups-subsequence-ii.js new file mode 100644 index 00000000..00f99e6d --- /dev/null +++ b/2901-longest-unequal-adjacent-groups-subsequence-ii.js @@ -0,0 +1,48 @@ +/** + * @param {number} n + * @param {string[]} words + * @param {number[]} groups + * @return {string[]} + */ +const getWordsInLongestSubsequence = function(n, words, groups) { + let res = [] + let len = new Array(1001).fill(1) + let next = new Array(1001).fill(-1) + let startNodeWithMaxLen = -1 + let maxLen = 0 + for (let i = n - 1; i >= 0; i--) { + for (let t = i + 1; t < n; t++) { + if (len[i] < len[t] + 1 && check(words, groups, i, t)) { + len[i] = len[t] + 1 + next[i] = t + } + } + if (maxLen < len[i]) { + maxLen = len[i] + startNodeWithMaxLen = i + } + } + let p = startNodeWithMaxLen + while (p !== -1) { + res.push(words[p]) + p = next[p] + } + return res + + function check(words, groups, i, lastInd) { + if ( + groups[i] === groups[lastInd] || + words[i].length !== words[lastInd].length + ) { + return false + } + let diff = 0 + for (let j = 0; j < words[i].length; j++) { + if (words[i][j] !== words[lastInd][j]) { + diff++ + } + } + return diff === 1 + } + +}; From fce45515e93d94bc482083e306938eccff14bc96 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 Nov 2023 22:38:53 +0800 Subject: [PATCH 1512/2039] Create 2919-minimum-increment-operations-to-make-array-beautiful.js --- ...ment-operations-to-make-array-beautiful.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2919-minimum-increment-operations-to-make-array-beautiful.js diff --git a/2919-minimum-increment-operations-to-make-array-beautiful.js b/2919-minimum-increment-operations-to-make-array-beautiful.js new file mode 100644 index 00000000..b0d83880 --- /dev/null +++ b/2919-minimum-increment-operations-to-make-array-beautiful.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minIncrementOperations = function(nums, k) { + const dp = new Array(nums.length).fill(-1) + + const traverse = (index) => { + if (index >= nums.length - 2) return 0 + + if (dp[index] !== -1) return dp[index] + + let res = Infinity; + for (let i = index; i <= index + 2; i++) { + const val = Math.max(k - nums[i], 0) + const next = traverse(i + 1) + res = Math.min(val + next, res) + } + + dp[index] = res + return res + } + + + return traverse(0) +}; From 95ed042e95950db8205489dc90347361317c2eae Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Nov 2023 14:48:47 +0800 Subject: [PATCH 1513/2039] Create 2741-special-permutations.js --- 2741-special-permutations.js | 54 ++++++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 2741-special-permutations.js diff --git a/2741-special-permutations.js b/2741-special-permutations.js new file mode 100644 index 00000000..5264811d --- /dev/null +++ b/2741-special-permutations.js @@ -0,0 +1,54 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const specialPerm = function (nums) { + const s = new Solution() + return s.specialPerm(nums) +} + +class Solution { + constructor() { + this.dp = [] + } + solve(nums, previdx, chosenIndices) { + if (chosenIndices.length === nums.length) { + return 1 + } + + let mask = 0 + for (let index of chosenIndices) { + mask |= 1 << index + } + + if (this.dp[previdx + 1][mask] !== -1) { + return this.dp[previdx + 1][mask] + } + + let tot = 0 + for (let j = 0; j < nums.length; j++) { + if (chosenIndices.includes(j)) { + continue + } + if ( + previdx === -1 || + nums[previdx] % nums[j] === 0 || + nums[j] % nums[previdx] === 0 + ) { + chosenIndices.push(j) + tot += this.solve(nums, j, chosenIndices) + tot %= 1000000007 + chosenIndices.pop() + } + } + return (this.dp[previdx + 1][mask] = tot) + } + + specialPerm(nums) { + this.dp = new Array(20) + .fill(-1) + .map(() => new Array((1 << nums.length) + 5).fill(-1)) + let chosenIndices = [] + return this.solve(nums, -1, chosenIndices) + } +} From 25b83c65a64d6197aa36d97832444af2188b55c5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Nov 2023 22:05:29 +0800 Subject: [PATCH 1514/2039] Create 2842-count-k-subsequences-of-a-string-with-maximum-beauty.js --- ...quences-of-a-string-with-maximum-beauty.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2842-count-k-subsequences-of-a-string-with-maximum-beauty.js diff --git a/2842-count-k-subsequences-of-a-string-with-maximum-beauty.js b/2842-count-k-subsequences-of-a-string-with-maximum-beauty.js new file mode 100644 index 00000000..06ec3d6f --- /dev/null +++ b/2842-count-k-subsequences-of-a-string-with-maximum-beauty.js @@ -0,0 +1,51 @@ +////////////////////////////// combination Template ////////////////////////////////// +const ll = BigInt, + mod = ll(1e9 + 7) +let N + +let fact, ifact, inv +const comb_init = () => { + ;(fact = Array(N)), (ifact = Array(N)), (inv = Array(N)) + fact[0] = ifact[0] = inv[1] = 1n + for (let i = 2; i < N; i++) + inv[i] = ((mod - mod / ll(i)) * inv[mod % ll(i)]) % mod + for (let i = 1; i < N; i++) { + fact[i] = (fact[i - 1] * ll(i)) % mod + ifact[i] = (ifact[i - 1] * inv[i]) % mod + } +} + +const comb = (n, k) => { + if (n < k || k < 0) return 0n + return (((fact[n] * ifact[k]) % mod) * ifact[n - k]) % mod +} +////////////////////////////////////////////////////////////////////// + +const ord = (c) => c.charCodeAt() + +const M = 1e9 + 7 +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const countKSubsequencesWithMaxBeauty = (s, k) => { + N = s.length + 1 + comb_init() + let f = Array(26).fill(0), + res = 1, + pick = 0 + for (const c of s) f[ord(c) - 97]++ + f = f.sort((x, y) => y - x).filter((x) => x > 0) + for (let i = 0; i < k; i++) { + if (f[i] >= f[k - 1]) { + // ways of first k-1 elements + res *= f[i] + res %= M + } + if (f[i] == f[k - 1]) pick++ // count last element needed + } + let lastPick = comb(f.filter((x) => x == f[k - 1]).length, pick) // ways of last element pick up + res = (ll(res) * lastPick) % mod + return res +} From d9d821f7c1b46b0058497d043f3dbc458d14a85e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Nov 2023 21:46:52 +0800 Subject: [PATCH 1515/2039] Create 2850-minimum-moves-to-spread-stones-over-grid.js --- ...inimum-moves-to-spread-stones-over-grid.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2850-minimum-moves-to-spread-stones-over-grid.js diff --git a/2850-minimum-moves-to-spread-stones-over-grid.js b/2850-minimum-moves-to-spread-stones-over-grid.js new file mode 100644 index 00000000..8e6a6086 --- /dev/null +++ b/2850-minimum-moves-to-spread-stones-over-grid.js @@ -0,0 +1,39 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumMoves = function (grid) { + let zeros = [] + let extras = [] + let ans = 0 + for (let r = 0; r < 3; ++r) { + for (let c = 0; c < 3; ++c) { + if (grid[r][c] > 1) { + extras.push([r, c, grid[r][c]]) + } else if (grid[r][c] == 0) { + zeros.push([r, c]) + } + } + } + function solve(index) { + if (index >= zeros.length) { + return 0 + } + let min = Number.MAX_SAFE_INTEGER + let [r, c] = zeros[index] + for (let j = 0; j < extras.length; ++j) { + if (extras[j][2] > 1) { + extras[j][2] -= 1 + min = Math.min( + min, + Math.abs(extras[j][0] - r) + + Math.abs(extras[j][1] - c) + + solve(index + 1), + ) + extras[j][2] += 1 + } + } + return min + } + return solve(0) +} From 1db7b9969120ca74a3ea56d39c6863cc951f914e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Nov 2023 12:54:59 +0800 Subject: [PATCH 1516/2039] Create 2935-maximum-strong-pair-xor-ii.js --- 2935-maximum-strong-pair-xor-ii.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2935-maximum-strong-pair-xor-ii.js diff --git a/2935-maximum-strong-pair-xor-ii.js b/2935-maximum-strong-pair-xor-ii.js new file mode 100644 index 00000000..42ae29a5 --- /dev/null +++ b/2935-maximum-strong-pair-xor-ii.js @@ -0,0 +1,26 @@ +const maximumStrongPairXor= (nums) => { + const A = nums + let res = 0; + for (let i = 20; i >= 0; --i) { + res <<= 1; + let pref = new Map(); + let pref2 = new Map(); + for (let a of A) { + let p = a >> i; + if (!pref.has(p)) { + pref.set(p, a); + pref2.set(p, a); + } + pref.set(p, Math.min(pref.get(p), a)); + pref2.set(p, Math.max(pref2.get(p), a)); + } + for (let [x, val] of pref) { + let y = res ^ 1 ^ x; + if (x >= y && pref.has(y) && pref.get(x) <= pref2.get(y) * 2) { + res |= 1; + break; + } + } + } + return res; +} From a70f84932896f2a9d6b74832665fc0e32ec12e23 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Nov 2023 12:55:54 +0800 Subject: [PATCH 1517/2039] Create 2934-minimum-operations-to-maximize-last-elements-in-arrays.js --- ...ons-to-maximize-last-elements-in-arrays.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2934-minimum-operations-to-maximize-last-elements-in-arrays.js diff --git a/2934-minimum-operations-to-maximize-last-elements-in-arrays.js b/2934-minimum-operations-to-maximize-last-elements-in-arrays.js new file mode 100644 index 00000000..6ee08455 --- /dev/null +++ b/2934-minimum-operations-to-maximize-last-elements-in-arrays.js @@ -0,0 +1,40 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minOperations = function (nums1, nums2) { + const n = nums1.length + let a = nums1[n - 1] + let b = nums2[n - 1] + + let tmp0 = 0 + for (let i = 0; i < n - 1; i++) { + const x = nums1[i] + const y = nums2[i] + + if (Math.min(x, y) > Math.min(a, b)) return -1 + if (Math.max(x, y) > Math.max(a, b)) return -1 + + if (y <= a && x <= b && (x > a || y > b)) { + tmp0++ + } + } + + a = nums2[n - 1] + b = nums1[n - 1] + let tmp1 = 0 + for (let i = 0; i < n - 1; i++) { + const x = nums1[i] + const y = nums2[i] + + if (Math.min(x, y) > Math.min(a, b)) return -1 + if (Math.max(x, y) > Math.max(a, b)) return -1 + + if (y <= a && x <= b && (x > a || y > b)) { + tmp1++ + } + } + + return Math.min(tmp0, tmp1 + 1) +} From 934c049b4f00b493de11c034e86cf8d769fe02ea Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Nov 2023 12:56:32 +0800 Subject: [PATCH 1518/2039] Create 2933-high-access-employees.js --- 2933-high-access-employees.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2933-high-access-employees.js diff --git a/2933-high-access-employees.js b/2933-high-access-employees.js new file mode 100644 index 00000000..4660b7f4 --- /dev/null +++ b/2933-high-access-employees.js @@ -0,0 +1,23 @@ +/** + * @param {string[][]} access_times + * @return {string[]} + */ +var findHighAccessEmployees = function(access_times) { + const map = new Map(); + access_times.sort((a, b) => a[1] - b[1]).forEach((item) => { + const key = item[0]; + const value = parseInt(item[1]); + map.set(key, map.get(key) || []); + map.get(key).push(value); + }); + const ans = []; + map.forEach((value, key) => { + for (let i = 2; i < value.length; i++) { + if (value[i] - value[i - 2] < 100) { + ans.push(key); + break; + } + } + }); + return ans; +}; From 62282d08db74c6047d8f18504efaed976a3b5723 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Nov 2023 12:57:15 +0800 Subject: [PATCH 1519/2039] Create 2932-maximum-strong-pair-xor-i.js --- 2932-maximum-strong-pair-xor-i.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2932-maximum-strong-pair-xor-i.js diff --git a/2932-maximum-strong-pair-xor-i.js b/2932-maximum-strong-pair-xor-i.js new file mode 100644 index 00000000..41a92ef3 --- /dev/null +++ b/2932-maximum-strong-pair-xor-i.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumStrongPairXor = function(nums) { + const n = nums.length + let res = -Infinity + for(let i = 0; i < n; i++) { + const x = nums[i] + for(let j = i; j < n; j++) { + const y = nums[j] + if(Math.abs(x - y) <= Math.min(x, y) && (x ^ y) > res) { + res = x ^ y + } + } + } + return res +}; From 220cc1bce3f3ca79f0235462efb1c7884881822d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 Nov 2023 14:14:00 +0800 Subject: [PATCH 1520/2039] Update 2935-maximum-strong-pair-xor-ii.js --- 2935-maximum-strong-pair-xor-ii.js | 93 ++++++++++++++++++++++++++++++ 1 file changed, 93 insertions(+) diff --git a/2935-maximum-strong-pair-xor-ii.js b/2935-maximum-strong-pair-xor-ii.js index 42ae29a5..6246500b 100644 --- a/2935-maximum-strong-pair-xor-ii.js +++ b/2935-maximum-strong-pair-xor-ii.js @@ -1,3 +1,96 @@ +class Node { + constructor() { + this.links = [null, null] + this.frequency = 0 + } + + containsKey(bit) { + return this.links[bit] !== null + } + + get(bit) { + return this.links[bit] + } + + put(bit, node) { + this.links[bit] = node + } +} + +class Trie { + constructor() { + this.root = new Node() + } + + insert(num) { + let node = this.root + for (let i = 31; i >= 0; i--) { + const bit = (num >> i) & 1 + if (!node.containsKey(bit)) { + node.put(bit, new Node()) + } + node = node.get(bit) + node.frequency++ + } + } + + getMax(num) { + let node = this.root + let res = 0 + for (let i = 31; i >= 0; i--) { + const bit = (num >> i) & 1 + if (node.containsKey(1 - bit) && node.get(1 - bit).frequency > 0) { + res = res | (1 << i) + node = node.get(1 - bit) + } else { + if (node.containsKey(bit) && node.get(bit).frequency > 0) { + node = node.get(bit) + } else { + return 0 + } + } + } + return res + } + + deleteKey(num) { + let node = this.root + for (let i = 31; i >= 0; i--) { + const bit = (num >> i) & 1 + if (node.containsKey(bit)) { + node = node.get(bit) + node.frequency-- + } else { + break + } + } + } +} +/** + * @param {number[]} nums + * @return {number} + */ +function maximumStrongPairXor(nums) { + const n = nums.length + nums.sort((a, b) => a - b) + let maxi = 0 + let j = 0 + const t = new Trie() + t.insert(nums[0]) + for (let i = 1; i < n; i++) { + while (j < i && nums[i] - nums[j] > Math.min(nums[i], nums[j])) { + t.deleteKey(nums[j]) + j++ + } + maxi = Math.max(maxi, t.getMax(nums[i])) + t.insert(nums[i]) + } + return maxi +} + +// another + + const maximumStrongPairXor= (nums) => { const A = nums let res = 0; From 06283d6218a2733cc7bf8d4d479b75319b58da81 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 13 Nov 2023 15:16:11 +0800 Subject: [PATCH 1521/2039] Update 2313-minimum-flips-in-binary-tree-to-get-result.js --- ...imum-flips-in-binary-tree-to-get-result.js | 62 +++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/2313-minimum-flips-in-binary-tree-to-get-result.js b/2313-minimum-flips-in-binary-tree-to-get-result.js index 4354aee3..f11fa541 100644 --- a/2313-minimum-flips-in-binary-tree-to-get-result.js +++ b/2313-minimum-flips-in-binary-tree-to-get-result.js @@ -1,3 +1,65 @@ +/** + * 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 {boolean} result + * @return {number} + */ +const minimumFlips = function(root, result) { + const dp = new Map() + return dfs(root, result) + + function dfs(node, expected) { + if(node.val === 0 || node.val === 1) { + return (!!node.val) === !!expected ? 0 : 1 + } + if(dp.has(node) && dp.get(node).has(expected)) { + return dp.get(node).get(expected) + } + let res = Infinity + + if(node.val === 2) { + if(expected) { + res = Math.min(dfs(node.left, 1), dfs(node.right, 1)) + } else { + res = dfs(node.left, 0) + dfs(node.right, 0) + } + } else if(node.val === 3) { + if(expected) { + res = dfs(node.left, 1) + dfs(node.right, 1) + } else { + res = Math.min(dfs(node.left, 0), dfs(node.right, 0)) + } + } else if(node.val === 4) { + if(expected) { + res = Math.min(dfs(node.left, 0) + dfs(node.right, 1), dfs(node.left, 1) + dfs(node.right, 0)) + } else { + res = Math.min(dfs(node.left, 1) + dfs(node.right, 1), dfs(node.left, 0) + dfs(node.right, 0)) + } + + } else if(node.val === 5) { + const child = node.left || node.right + if(expected) { + res = dfs(child, 0) + } else { + res = dfs(child, 1) + } + } + + if(!dp.has(node)) dp.set(node, new Map()) + dp.get(node).set(expected, res) + return res + } +}; + +// another + /** * Definition for a binary tree node. * function TreeNode(val, left, right) { From 24e90ea7b2fd6135978b93834ef34315132af946 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Nov 2023 13:06:28 +0800 Subject: [PATCH 1522/2039] Update 2458-height-of-binary-tree-after-subtree-removal-queries.js --- ...nary-tree-after-subtree-removal-queries.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/2458-height-of-binary-tree-after-subtree-removal-queries.js b/2458-height-of-binary-tree-after-subtree-removal-queries.js index e3869df4..15e3aad3 100644 --- a/2458-height-of-binary-tree-after-subtree-removal-queries.js +++ b/2458-height-of-binary-tree-after-subtree-removal-queries.js @@ -1,3 +1,54 @@ +/** + * 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[]} queries + * @return {number[]} + */ +const treeQueries = function(root, queries) { + const depth = [], height = [], depthHash = [] + dfs(root, 0) + const res = [] + for(const e of queries) { + const d = depth[e], h = height[e], row = depthHash[d] + if(row.length === 1) { + res.push(d - 1) + } else if(h === row[0]) { + res.push(d + row[1]) + } else { + res.push(d + row[0]) + } + } + return res + + function dfs(node, d) { + if(node == null) return 0 + const {val} = node + const h = Math.max(dfs(node.left, d + 1), dfs(node.right, d + 1)) + depth[val] = d + height[val] = h + if(depthHash[d] == null) depthHash[d] = [] + depthHash[d].push(h) + keepLargestTwo(depthHash[d]) + return h + 1 + } + function keepLargestTwo(arr) { + arr.sort((a,b) => b - a) + if(arr.length > 2) { + arr.splice(2, arr.length - 2) + } + } +}; + +// another + + /** * Definition for a binary tree node. * function TreeNode(val, left, right) { From 2c60bd14698e0bfd6980831b53af13942a89df92 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 Nov 2023 14:13:42 +0800 Subject: [PATCH 1523/2039] Update 2277-closest-node-to-path-in-tree.js --- 2277-closest-node-to-path-in-tree.js | 51 ++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/2277-closest-node-to-path-in-tree.js b/2277-closest-node-to-path-in-tree.js index 275e550d..b8ef00ef 100644 --- a/2277-closest-node-to-path-in-tree.js +++ b/2277-closest-node-to-path-in-tree.js @@ -1,3 +1,54 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[][]} query + * @return {number[]} + */ +const closestNode = function(n, edges, query) { + const g = new Map() + for(const [p, q] of edges) { + if(!g.has(p)) g.set(p, new Set()) + if(!g.has(q)) g.set(q, new Set()) + g.get(p).add(q) + g.get(q).add(p) + } + const dist = Array.from({ length: n }, () => Array(n).fill(null)) + for(let i = 0; i < n; i++) dfs(i, i, 0) + const res = [] + // console.log(dist) + for(const [s, e, t] of query) { + let tmp = Infinity, cur = s, el + while(true) { + if(dist[cur][t] < tmp) { + tmp = dist[cur][t] + el = cur + } + if(cur === e) break + for(const nxt of (g.get(cur) || [])) { + if(dist[cur][e] === dist[nxt][e] + 1) { + cur = nxt + break + } + } + } + res.push(el) + } + + return res + + function dfs(root, node, d) { + dist[root][node] = d + for(const nxt of (g.get(node) || [])) { + if(nxt !== root && dist[root][nxt] == null) { + dfs(root, nxt, d + 1) + } + } + } +}; + +// another + + /** * @param {number} n * @param {number[][]} edges From f4c7ba2c314e29848af4b47dd3ae7231df4fdff0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 17 Nov 2023 13:10:29 +0800 Subject: [PATCH 1524/2039] Create 2920-maximum-points-after-collecting-coins-from-all-nodes.js --- ...s-after-collecting-coins-from-all-nodes.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 2920-maximum-points-after-collecting-coins-from-all-nodes.js diff --git a/2920-maximum-points-after-collecting-coins-from-all-nodes.js b/2920-maximum-points-after-collecting-coins-from-all-nodes.js new file mode 100644 index 00000000..02020d94 --- /dev/null +++ b/2920-maximum-points-after-collecting-coins-from-all-nodes.js @@ -0,0 +1,47 @@ +/** + * @param {number[][]} edges + * @param {number[]} coins + * @param {number} k + * @return {number} + */ +const maximumPoints = function (edges, coins, k) { + const n = coins.length + const g = Array(n) + .fill() + .map(() => []) + for (const edge of edges) { + const [u, v] = edge + g[u].push(v) + g[v].push(u) + } + const dp = Array(n) + .fill() + .map(() => Array(15).fill(-1)) + const dfs = (node, parent, reduce) => { + if (dp[node][reduce] !== -1) { + return dp[node][reduce] + } + if (reduce >= 14) { + return (dp[node][reduce] = 0) + } + let currCoins = coins[node] + for (let j = 0; j < reduce; j++) { + currCoins = Math.floor(currCoins / 2) + } + let way1 = currCoins - k + let way2 = Math.floor(currCoins / 2) + for (const child of g[node]) { + if (child !== parent) { + dfs(child, node, reduce + 1) + dfs(child, node, reduce) + way1 += dp[child][reduce] + way2 += dp[child][reduce + 1] + } + } + dp[node][reduce] = Math.max(way1, way2) + return dp[node][reduce] + } + dfs(0, -1, 0) + + return dp[0][0] +} From 62375ef0f35a4c5ea53a7d06f9b952b178e7980b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 18 Nov 2023 21:34:32 +0800 Subject: [PATCH 1525/2039] Create 2925-maximum-score-after-applying-operations-on-a-tree.js --- ...ore-after-applying-operations-on-a-tree.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 2925-maximum-score-after-applying-operations-on-a-tree.js diff --git a/2925-maximum-score-after-applying-operations-on-a-tree.js b/2925-maximum-score-after-applying-operations-on-a-tree.js new file mode 100644 index 00000000..6bcc7db3 --- /dev/null +++ b/2925-maximum-score-after-applying-operations-on-a-tree.js @@ -0,0 +1,51 @@ +/** + * @param {number[][]} edges + * @param {number[]} values + * @return {number} + */ +var maximumScoreAfterOperations = function(edges, values) { + const n = values.length; + const g = new Array(n).fill(null).map(() => []); + for (const edge of edges) { + const [u, v] = edge; + g[u].push(v); + g[v].push(u); + } + + const subtree = new Array(n); + for (let i = 0; i < n; i++) { + subtree[i] = values[i]; + } + + const pre = (node, parent) => { + for (const child of g[node]) { + if (child !== parent) { + pre(child, node); + subtree[node] += subtree[child]; + } + } + }; + + pre(0, -1); + + const dp = new Array(n).fill(-1); + + const dfs = (node, parent) => { + dp[node] = subtree[node] - values[node]; + let sum = 0; + let cnt = 0; + for (const child of g[node]) { + if (child !== parent) { + dfs(child, node); + cnt++; + sum += dp[child]; + } + } + if (cnt > 0) { + dp[node] = Math.max(dp[node], values[node] + sum); + } + }; + + dfs(0, -1); + return dp[0]; +}; From 81d3a3e2a2d7640a635e55b85fa0eb24fe7fbb47 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Nov 2023 14:32:03 +0800 Subject: [PATCH 1526/2039] Create 2940-find-building-where-alice-and-bob-can-meet.js --- ...d-building-where-alice-and-bob-can-meet.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 2940-find-building-where-alice-and-bob-can-meet.js diff --git a/2940-find-building-where-alice-and-bob-can-meet.js b/2940-find-building-where-alice-and-bob-can-meet.js new file mode 100644 index 00000000..ae2e46db --- /dev/null +++ b/2940-find-building-where-alice-and-bob-can-meet.js @@ -0,0 +1,56 @@ +/** + * @param {number[]} heights + * @param {number[][]} queries + * @return {number[]} + */ +var leftmostBuildingQueries = function (heights, queries) { + const st = [] + const [hs, qs] = [heights, queries] + let n = qs.length; + let ans = new Array(n).fill(-1); + let es = new Array(hs.length).fill().map(() => []); + for (let i = 0; i < n; i++) { + let x = qs[i][0]; + let y = qs[i][1]; + if (x > y) { + [x, y] = [y, x]; + } + if (hs[y] > hs[x] || x === y) { + ans[i] = y; + } else { + es[y].push([hs[x], i]); + } + } + + for (let i = hs.length - 1; i >= 0; i--) { + let n1 = st.length; + for (let [x, y] of es[i]) { + let p = search(x); + if (p < n1 && p >= 0) { + ans[y] = st[p][1]; + } + } + while (st.length > 0 && st[st.length - 1][0] <= hs[i]) { + st.pop(); + } + st.push([hs[i], i]); + } + return ans; + + + function search(x) { + let l = 0; + let r = st.length - 1; + let ans = -1; + while (l <= r) { + let m = Math.floor((l + r) / 2); + if (st[m][0] > x) { + ans = Math.max(ans, m); + l = m + 1; + } else { + r = m - 1; + } + } + return ans; + } +} From 3340470e222b21655a8240986f260bff7e2b65e4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Nov 2023 14:32:48 +0800 Subject: [PATCH 1527/2039] Create 2939-maximum-xor-product.js --- 2939-maximum-xor-product.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2939-maximum-xor-product.js diff --git a/2939-maximum-xor-product.js b/2939-maximum-xor-product.js new file mode 100644 index 00000000..ec022b12 --- /dev/null +++ b/2939-maximum-xor-product.js @@ -0,0 +1,36 @@ +/** + * @param {number} a + * @param {number} b + * @param {number} n + * @return {number} + */ +var maximumXorProduct = function(a, b, n) { + let ans = 0n; + let big = 0n; + let found = false; + a = BigInt(a) + b = BigInt(b) + + for (let i = 50; i >= 0; i--) { + let curr = BigInt(1) << BigInt(i); + + if (((a & curr) == 0n) && ((b & curr) == 0n)) { + if (i < n) ans += curr; + } else if (((a & curr)) && ((b & curr) == 0n)) { + if (big == 0) big = -1; + else if (big == -1 && i < n) ans += curr; + } else if (((a & curr) == 0n) && ((b & curr))) { + if (big == 0) big = 1; + else if (big == 1 && i < n) ans += curr; + } + } + + let mod = BigInt(1000000007); + a ^= ans; + b ^= ans; + a %= mod; + b %= mod; + ans = (a * b) % mod; + + return Number(ans); +}; From 0f0c811e61c25db745b6374acf67c12276f2477d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Nov 2023 14:33:22 +0800 Subject: [PATCH 1528/2039] Create 2938-separate-black-and-white-balls.js --- 2938-separate-black-and-white-balls.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2938-separate-black-and-white-balls.js diff --git a/2938-separate-black-and-white-balls.js b/2938-separate-black-and-white-balls.js new file mode 100644 index 00000000..1e12ea4b --- /dev/null +++ b/2938-separate-black-and-white-balls.js @@ -0,0 +1,18 @@ +/** + * @param {string} s + * @return {number} + */ +var minimumSteps = function(s) { + let n = s.length + let left = n - 1 + let right = n - 1 + let cnt = 0 + while (left >= 0) { + if (s.charAt(left) === '1') { + cnt += right - left + right-- + } + left-- + } + return cnt +}; From 8e06c7ae822d7d073fe6315de6e58c0f85071ecd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Nov 2023 14:33:51 +0800 Subject: [PATCH 1529/2039] Create 2937-make-three-strings-equal.js --- 2937-make-three-strings-equal.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 2937-make-three-strings-equal.js diff --git a/2937-make-three-strings-equal.js b/2937-make-three-strings-equal.js new file mode 100644 index 00000000..47bdc08e --- /dev/null +++ b/2937-make-three-strings-equal.js @@ -0,0 +1,26 @@ +/** + * @param {string} s1 + * @param {string} s2 + * @param {string} s3 + * @return {number} + */ +var findMinimumOperations = function(s1, s2, s3) { + let a = s1.length + let b = s2.length + let c = s3.length + + let min = Math.min(a, Math.min(b, c)) + let i = 0 + for (; i < min; i++) { + let c1 = s1.charAt(i) + let c2 = s2.charAt(i) + let c3 = s3.charAt(i) + if (c1 !== c2 || c2 !== c3) { + break + } + } + if (i === 0) return -1 + let ans = 0 + ans = a - i + b - i + c - i + return ans +}; From d74f8754209770ebb8cfa733aaf3f3de58733648 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Nov 2023 19:29:15 +0800 Subject: [PATCH 1530/2039] Update 1707-maximum-xor-with-an-element-from-array.js --- ...-maximum-xor-with-an-element-from-array.js | 55 +++++++++++++++++++ 1 file changed, 55 insertions(+) diff --git a/1707-maximum-xor-with-an-element-from-array.js b/1707-maximum-xor-with-an-element-from-array.js index 7aa24804..bfe49032 100644 --- a/1707-maximum-xor-with-an-element-from-array.js +++ b/1707-maximum-xor-with-an-element-from-array.js @@ -99,3 +99,58 @@ const maximizeXor = function (nums, queries) { } return result } + +// another +// though not enough memory, this method still provides a method to solve this kind of problem + +class Trie { + constructor() { + this.next = Array(2).fill(null) + } +} +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +const maximizeXor = function(nums, queries) { + nums.sort((a, b) => a - b) + queries.forEach((e, i) => e.push(i)) + queries.sort((a, b) => a[1] - b[1]) + const n = nums.length + let idx = 0 + const res = [] + const root = new Trie() + for(const [x, m, qi] of queries) { + + while(idx < n && nums[idx] <= m) { + let cur = root, val = nums[idx] + for(let i = 29; i >= 0; i--) { + const tmp = (val >> i) & 1 + if(cur.next[tmp] == null) cur.next[tmp] = new Trie() + cur = cur.next[tmp] + } + idx++ + } + if(idx === 0) { + res[qi] = -1 + continue + } + + let tmp = 0, cur = root + for(let i = 29; i >= 0; i--) { + const val = 1 - ((x >> i) & 1) + if(cur.next[val] != null) { + tmp = tmp * 2 + 1 + cur = cur.next[val] + } else { + tmp = tmp * 2 + cur = cur.next[1 - val] + } + + } + + res[qi] = tmp + } + return res +}; From 8caa8cb1936eedd53893728b5092fbb9980840cb Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 20 Nov 2023 19:31:54 +0800 Subject: [PATCH 1531/2039] Update 1707-maximum-xor-with-an-element-from-array.js --- ...-maximum-xor-with-an-element-from-array.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) diff --git a/1707-maximum-xor-with-an-element-from-array.js b/1707-maximum-xor-with-an-element-from-array.js index bfe49032..f33846b8 100644 --- a/1707-maximum-xor-with-an-element-from-array.js +++ b/1707-maximum-xor-with-an-element-from-array.js @@ -1,3 +1,50 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +const maximizeXor = function(nums, queries) { + nums.sort((a, b) => a - b) + queries.forEach((e, i) => e.push(i)) + queries.sort((a, b) => a[1] - b[1]) + const n = nums.length + let idx = 0 + const res = [] + const root = [null, null] + for(const [x, m, qi] of queries) { + while(idx < n && nums[idx] <= m) { + let cur = root, val = nums[idx] + for(let i = 29; i >= 0; i--) { + const tmp = (val >> i) & 1 + if(cur[tmp] == null) cur[tmp] = [null, null] + cur = cur[tmp] + } + idx++ + } + if(idx === 0) { + res[qi] = -1 + continue + } + + let tmp = 0, cur = root + for(let i = 29; i >= 0; i--) { + const val = 1 - ((x >> i) & 1) + if(cur[val] != null) { + tmp = tmp * 2 + 1 + cur = cur[val] + } else { + tmp = tmp * 2 + cur = cur[1 - val] + } + } + res[qi] = tmp + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number[][]} queries From 0cc33a334434fb92e11e3d7c82965f42916baa69 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 Nov 2023 19:43:56 +0800 Subject: [PATCH 1532/2039] Update 1803-count-pairs-with-xor-in-a-range.js --- 1803-count-pairs-with-xor-in-a-range.js | 48 +++++++++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/1803-count-pairs-with-xor-in-a-range.js b/1803-count-pairs-with-xor-in-a-range.js index 1cd9f17c..03ee2ffe 100644 --- a/1803-count-pairs-with-xor-in-a-range.js +++ b/1803-count-pairs-with-xor-in-a-range.js @@ -44,3 +44,51 @@ class Trie { return ans } } + + +// another + +/** + * @param {number[]} nums + * @param {number} low + * @param {number} high + * @return {number} + */ +const countPairs = function(nums, low, high) { + let res = 0, n = nums.length, trie = { cnt: 0 } + for(const e of nums) { + res += helper(e, high + 1) - helper(e, low) + insert(e) + } + return res + + function helper(e, limit) { + let res = 0, cur = trie + for(let i = 14; i >= 0; i--) { + const a = (e >> i) & 1 + const b = (limit >> i) & 1 + if(cur == null) break + if(b === 0) { + cur = cur[a] + continue + } + if(cur[a]) { + res += cur[a].cnt + } + cur = cur[1 - a] + } + + return res + } + + function insert(e) { + let cur = trie + for(let i = 14; i >= 0; i--) { + const tmp = (e >> i) & 1 + if(!(tmp in cur)) cur[tmp] = {cnt:0} + cur[tmp].cnt++ + cur = cur[tmp] + } + } + +}; From 6901a48c60329725728b47328417d3bfff8d53c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 Nov 2023 14:21:39 +0800 Subject: [PATCH 1533/2039] Create 2479-maximum-xor-of-two-non-overlapping-subtrees.js --- ...mum-xor-of-two-non-overlapping-subtrees.js | 102 ++++++++++++++++++ 1 file changed, 102 insertions(+) create mode 100644 2479-maximum-xor-of-two-non-overlapping-subtrees.js diff --git a/2479-maximum-xor-of-two-non-overlapping-subtrees.js b/2479-maximum-xor-of-two-non-overlapping-subtrees.js new file mode 100644 index 00000000..1ffd85a5 --- /dev/null +++ b/2479-maximum-xor-of-two-non-overlapping-subtrees.js @@ -0,0 +1,102 @@ +class TrieNode { + constructor() { + this.next = [null, null] + } +} +const bigIntMinAndMax = (...args) => { + return args.reduce( + ([min, max], e) => { + return [e < min ? e : min, e > max ? e : max] + }, + [args[0], args[0]], + ) +} +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} values + * @return {number} + */ +const maxXor = function (n, edges, values) { + const ins = new Solution() + return Number(ins.maxXor(n, edges, values)) +} + +class Solution { + constructor() { + this.next = [] + this.val = [] + this.values = [] + this.root = null + this.ret = 0n + } + + insert(num) { + let node = this.root + num = BigInt(num) + for (let i = 63n; i >= 0n; i--) { + const d = (num >> i) & 1n + if (node.next[d] === null) { + node.next[d] = new TrieNode() + } + node = node.next[d] + } + } + + find(num) { + num = BigInt(num) + let node = this.root + if (this.root.next[0] === null && this.root.next[1] === null) { + return 0 + } + let ret = 0n + for (let i = 63n; i >= 0n; i--) { + const d = (num >> i) & 1n + if (node.next[1n - d] !== null) { + ret += 1n << i + node = node.next[1n - d] + } else { + ret += 0n + node = node.next[d] + } + } + return ret + } + + maxXor(n, edges, values) { + this.values = values + for (let i = 0; i < n; i++) { + this.next[i] = [] + } + for (let i = 0; i < edges.length; i++) { + const [a, b] = edges[i] + this.next[a].push(b) + this.next[b].push(a) + } + this.root = new TrieNode() + this.dfs(0, -1) + this.dfs2(0, -1) + return this.ret + } + + dfs(cur, parent) { + let v = this.values[cur] + for (let i = 0; i < this.next[cur].length; i++) { + const nxt = this.next[cur][i] + if (nxt === parent) continue + v += this.dfs(nxt, cur) + } + this.val[cur] = v + return v + } + + dfs2(cur, parent) { + for (let i = 0; i < this.next[cur].length; i++) { + const nxt = this.next[cur][i] + if (nxt === parent) continue + this.ret = bigIntMinAndMax(this.ret, this.find(this.val[nxt]))[1] + this.dfs2(nxt, cur) + this.insert(this.val[nxt]) + } + } +} From dfdfb8112fffb3b0be8275832f761348a1cb2f69 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Nov 2023 18:22:19 +0800 Subject: [PATCH 1534/2039] Update 2416-sum-of-prefix-scores-of-strings.js --- 2416-sum-of-prefix-scores-of-strings.js | 41 +++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/2416-sum-of-prefix-scores-of-strings.js b/2416-sum-of-prefix-scores-of-strings.js index 11ea9edf..32d5f713 100644 --- a/2416-sum-of-prefix-scores-of-strings.js +++ b/2416-sum-of-prefix-scores-of-strings.js @@ -1,3 +1,44 @@ +/** + * @param {string[]} words + * @return {number[]} + */ +const sumPrefixScores = (words) => { + const n = words.length + const trie = { _count: 0 } + const result = [] + + // Create our own custom trie with _count property. + // We are storing how many time we passed current node. + for (let i = 0; i < n; i++) { + const word = words[i] + + let node = trie + for (let j = 0; j < word.length; j++) { + if (!node[word[j]]) node[word[j]] = {} + node = node[word[j]] + node._count = (node._count || 0) + 1 + } + } + + // Collect all _count values together as a result + for (let i = 0; i < n; i++) { + const word = words[i] + let count = 0 + + let node = trie + for (let j = 0; j < word.length; j++) { + node = node[word[j]] + count += node._count || 0 + } + + result[i] = count + } + + return result +} + +// another + /** * @param {string[]} words * @return {number[]} From b0a42a8e67517d420d31e98e04d2f7bb1a96f922 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Nov 2023 19:45:06 +0800 Subject: [PATCH 1535/2039] Update 632-smallest-range.js --- 632-smallest-range.js | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/632-smallest-range.js b/632-smallest-range.js index 16153b17..0dcca794 100644 --- a/632-smallest-range.js +++ b/632-smallest-range.js @@ -188,7 +188,7 @@ var smallestRange = function(nums) { // another -class PriorityQueue { +class PQ { constructor(comparator = (a, b) => a > b) { this.heap = [] this.top = 0 @@ -260,7 +260,7 @@ class PriorityQueue { * @return {number[]} */ const smallestRange = function (nums) { - const pq = new PriorityQueue((a, b) => a[0] < b[0]) + const pq = new PQ((a, b) => a[0] < b[0]) const limit = 10 ** 5, n = nums.length, { max } = Math From e69dcb5adc4053dfb6645b30e99f54476465fa61 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Nov 2023 19:51:04 +0800 Subject: [PATCH 1536/2039] Create 2948-make-lexicographically-smallest-array-by-swapping-elements.js --- ...lly-smallest-array-by-swapping-elements.js | 61 +++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 2948-make-lexicographically-smallest-array-by-swapping-elements.js diff --git a/2948-make-lexicographically-smallest-array-by-swapping-elements.js b/2948-make-lexicographically-smallest-array-by-swapping-elements.js new file mode 100644 index 00000000..48a8a6d5 --- /dev/null +++ b/2948-make-lexicographically-smallest-array-by-swapping-elements.js @@ -0,0 +1,61 @@ +//////////////////////////// Template ///////////////////////////////// +function DJSet(n) { + let parent = Array(n).fill(-1); + return { find, union, count, equiv, par, grp } + function find(x) { + return parent[x] < 0 ? x : parent[x] = find(parent[x]); + } + function union(x, y) { + x = find(x); + y = find(y); + if (x == y) return false; + if (parent[x] < parent[y]) [x, y] = [y, x]; + parent[x] += parent[y]; + parent[y] = x; + return true; + } + function count() { // total groups + return parent.filter(v => v < 0).length; + } + function equiv(x, y) { // isConnected + return find(x) == find(y); + } + function par() { + return parent; + } + function grp() { + let groups = []; + for (let i = 0; i < n; i++) groups.push([]); + for (let i = 0; i < n; i++) groups[find(i)].push(i); // sorted and unique + return groups; + } +} +//////////////////////////////////////////////////////////////// +/** + * @param {number[]} nums + * @param {number} limit + * @return {number[]} + */ +var lexicographicallySmallestArray = function(nums, limit) { + let d = nums.map((x, i) => [x, i]).sort((x, y) => x[0] - y[0] || x[1] - y[1]), pairs = []; + for (let i = 1; i < nums.length; i++) { + if (d[i][0] - d[i - 1][0] <= limit) pairs.push([d[i - 1][1], d[i][1]]); + } + return LexicalSmallestArrayWithSwaps(nums, pairs) +}; + + +// reference: https://leetcode.com/problems/smallest-string-with-swaps/ +function LexicalSmallestArrayWithSwaps (a, pairs) { + let n = a.length, ds = new DJSet(n), res = Array(n).fill(0); + for (const [x, y] of pairs) ds.union(x, y); + let groups = ds.grp().filter(e => e.length); + for (const group of groups) { + let ga = []; + for (let i of group) ga.push(a[i]); + ga.sort((x, y) => x - y); + for (let i = 0; i < group.length; i++) res[group[i]] = ga[i]; + } + return res; +}; + From 9c1303d8271d77898f8fb1a4ad3fed1bfdb18407 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Nov 2023 19:51:54 +0800 Subject: [PATCH 1537/2039] Create 2949-count-beautiful-substrings-ii.js --- 2949-count-beautiful-substrings-ii.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2949-count-beautiful-substrings-ii.js diff --git a/2949-count-beautiful-substrings-ii.js b/2949-count-beautiful-substrings-ii.js new file mode 100644 index 00000000..e1f8c0b0 --- /dev/null +++ b/2949-count-beautiful-substrings-ii.js @@ -0,0 +1,27 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var beautifulSubstrings = function(s, k) { + let ans = 0, cur = 0; + let mp = new Map(); + mp.set(0, [-1]); + for (let i = 0; i < s.length; i++) { + let ch = s[i]; + if (ch === 'a' || ch === 'e' || ch === 'i' || ch === 'o' || ch === 'u') { + cur++; + } else { + cur--; + } + for (let x of (mp.get(cur) || []) ) { + let d = (i - x) / 2; + if (Math.pow(d, 2) % k === 0) { + ans++; + } + } + if (!mp.has(cur)) mp.set(cur, []); + mp.get(cur).push(i); + } + return ans; +}; From 4a2985f5d14e959ec42a091b65bab272ccc60016 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 Nov 2023 19:52:38 +0800 Subject: [PATCH 1538/2039] Create 2947-count-beautiful-substrings-i.js --- 2947-count-beautiful-substrings-i.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 2947-count-beautiful-substrings-i.js diff --git a/2947-count-beautiful-substrings-i.js b/2947-count-beautiful-substrings-i.js new file mode 100644 index 00000000..d16869a5 --- /dev/null +++ b/2947-count-beautiful-substrings-i.js @@ -0,0 +1,27 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var beautifulSubstrings = function(s, k) { + let counter=0; + for(let i=0;i Date: Sun, 26 Nov 2023 19:53:06 +0800 Subject: [PATCH 1539/2039] Create 2946-matrix-similarity-after-cyclic-shifts.js --- 2946-matrix-similarity-after-cyclic-shifts.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2946-matrix-similarity-after-cyclic-shifts.js diff --git a/2946-matrix-similarity-after-cyclic-shifts.js b/2946-matrix-similarity-after-cyclic-shifts.js new file mode 100644 index 00000000..e1c852ee --- /dev/null +++ b/2946-matrix-similarity-after-cyclic-shifts.js @@ -0,0 +1,42 @@ +/** + * @param {number[][]} mat + * @param {number} k + * @return {boolean} + */ +var areSimilar = function(mat, k) { + const m = mat.length, n = mat[0].length + const clone = Array.from({ length: m }, () => Array(n).fill(null)) + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + clone[i][j] = mat[i][j] + } + } + for(let i = 0; i < m; i++) { + const odd = i % 2 === 1 + if(odd) { + sr(clone, i) + } else { + sl(clone, i) + } + } + // console.log(clone) + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(mat[i][j] !== clone[i][j]) return false + } + } + + + return true + + function sr(mat, i) { + const row = mat[i] + const idx = k % n + mat[i] = row.slice(n - idx).concat(row.slice(0, n - idx)) + } + function sl(mat, i) { + const row = mat[i] + const idx = k % n + mat[i] = row.slice(idx, n).concat(row.slice(0, idx)) + } +}; From 31587c5e9d9924e53ae782a4d3e49c007c51e89c Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 27 Nov 2023 12:45:25 +0800 Subject: [PATCH 1540/2039] Update 1675-minimize-deviation-in-array.js --- 1675-minimize-deviation-in-array.js | 94 +++++++++++++++++++++++++++++ 1 file changed, 94 insertions(+) diff --git a/1675-minimize-deviation-in-array.js b/1675-minimize-deviation-in-array.js index 4d2821fe..f8fab346 100644 --- a/1675-minimize-deviation-in-array.js +++ b/1675-minimize-deviation-in-array.js @@ -1,3 +1,97 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} +/** + * @param {number[]} nums + * @return {number} + */ +const minimumDeviation = function(nums) { + const pq = new PQ((a, b) => a > b) + let min = Infinity + for(const e of nums) { + const tmp = e % 2 === 1 ? e * 2: e + pq.push(tmp) + min = Math.min(min, tmp) + } + let res = Infinity + while(pq.peek() % 2 === 0) { + const e = pq.pop() + res = Math.min(res, e - min) + min = Math.min(min, e / 2) + pq.push(e / 2) + } + if(pq.size()) { + res = Math.min(res, pq.peek() - min) + } + return res +}; + +// another + /** * @param {number[]} nums * @return {number} From 09e6ece2806bc3e1b3a4528e1740740f4b9ebf46 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 28 Nov 2023 13:28:59 +0800 Subject: [PATCH 1541/2039] Update 1825-finding-mk-average.js --- 1825-finding-mk-average.js | 76 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 76 insertions(+) diff --git a/1825-finding-mk-average.js b/1825-finding-mk-average.js index a6936047..8ef45ae2 100644 --- a/1825-finding-mk-average.js +++ b/1825-finding-mk-average.js @@ -1,3 +1,79 @@ +class BIT { + constructor(n) { + this.arr = new Array(n + 1).fill(0) + } + + update(i, v) { + while (i < this.arr.length) { + this.arr[i] += v + i += i & -i + } + } + + prefixSum(i) { + let res = 0 + while (i > 0) { + res += this.arr[i] + i -= i & -i + } + return res + } + + upper_bound(v) { + const n = Math.floor(Math.log2(this.arr.length)) + let pos = 0 + let s = 0 + for (let i = n; i >= 0; i--) { + if ( + pos + (1 << i) < this.arr.length && + s + this.arr[pos + (1 << i)] <= v + ) { + pos += 1 << i + s += this.arr[pos] + } + } + return pos + 1 + } +} + +class MKAverage { + constructor(m, k) { + this.m = m + this.k = k + this.cnt = new BIT(10 ** 5) + this.bit = new BIT(10 ** 5) + this.q = [] + } + + addElement(num) { + this.q.push(num) + this.cnt.update(num, 1) + this.bit.update(num, num) + if (this.q.length > this.m) { + const x = this.q.shift() + this.cnt.update(x, -1) + this.bit.update(x, -x) + } + } + + calculateMKAverage() { + if (this.q.length < this.m) { + return -1 + } + const l = this.k + const r = this.m - this.k + const i = this.cnt.upper_bound(l) + const j = this.cnt.upper_bound(r) + let ans = this.bit.prefixSum(j) - this.bit.prefixSum(i) + ans += (this.cnt.prefixSum(i) - l) * i + ans -= (this.cnt.prefixSum(j) - r) * j + return Math.floor(ans / (this.m - 2 * this.k)) + } +} + +// another + + /** * @param {number} m * @param {number} k From f789525a2dcf4369041401da76507306443df479 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Nov 2023 13:29:47 +0800 Subject: [PATCH 1542/2039] Update 1847-closest-room.js --- 1847-closest-room.js | 50 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/1847-closest-room.js b/1847-closest-room.js index f2c7aa85..388d0746 100644 --- a/1847-closest-room.js +++ b/1847-closest-room.js @@ -1,3 +1,53 @@ +/** + * @param {number[][]} rooms + * @param {number[][]} queries + * @return {number[]} + */ +var closestRoom = function (rooms, queries) { + const n = rooms.length + const k = queries.length + const indexes = new Array(k) + for (let i = 0; i < k; i++) { + indexes[i] = i + } + rooms.sort((a, b) => b[1] - a[1]) // Sort by decreasing order of room size + indexes.sort((a, b) => queries[b][1] - queries[a][1]) // Sort by decreasing order of query minSize + const roomIdsSoFar = new Set() + const ans = new Array(k) + let i = 0 + for (const index of indexes) { + while (i < n && rooms[i][1] >= queries[index][1]) { + // Add id of the room which its size >= query minSize + roomIdsSoFar.add(rooms[i++][0]) + } + ans[index] = searchClosetRoomId(roomIdsSoFar, queries[index][0]) + if (ans[index] == Infinity || ans[index] == -Infinity) ans[index] = -1 + } + return ans + + function searchClosetRoomId(treeSet, preferredId) { + let floor = -Infinity + let ceiling = Infinity + for (const id of treeSet) { + if (id <= preferredId) { + floor = Math.max(floor, id) + } else { + ceiling = Math.min(ceiling, id) + } + } + if (floor === -Infinity) { + return ceiling + } else if (ceiling === Infinity) { + return floor + } else if (preferredId - floor <= ceiling - preferredId) { + return floor + } else { + return ceiling + } + } +} + +// another /** * @param {number[][]} rooms From 9bfeecb60f22fea8bb6690aa3d3887ac2b77e027 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 Nov 2023 14:13:00 +0800 Subject: [PATCH 1543/2039] Update 1847-closest-room.js --- 1847-closest-room.js | 58 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 58 insertions(+) diff --git a/1847-closest-room.js b/1847-closest-room.js index 388d0746..f23d4cf2 100644 --- a/1847-closest-room.js +++ b/1847-closest-room.js @@ -47,6 +47,64 @@ var closestRoom = function (rooms, queries) { } } +// another + +/** + * @param {number[][]} rooms + * @param {number[][]} queries + * @return {number[]} + */ +const closestRoom = function (rooms, queries) { + const n = rooms.length + const m = queries.length + const idxArr = Array.from({ length: m }, (_, i) => i) + const res = [] + rooms.sort((a, b) => b[1] - a[1]) + idxArr.sort((a, b) => queries[b][1] - queries[a][1]) + const set = new Set() + let j = 0 + for (let i = 0; i < m; i++) { + const q = queries[idxArr[i]] + while (j < n && rooms[j][1] >= q[1]) { + set.add(rooms[j][0]) + j++ + } + res[idxArr[i]] = helper(q[0]) + } + + return res + + function helper(preferedId) { + let floor = -Infinity, + ceil = Infinity + for (const roomId of set) { + if (roomId < preferedId && roomId > floor) { + floor = roomId + } + if (roomId >= preferedId && roomId < ceil) { + ceil = roomId + } + } + let res = -1 + if (floor === -Infinity) { + res = ceil + } else if (ceil === Infinity) { + res = floor + } else { + if (preferedId - floor === ceil - preferedId) { + res = floor + } else if (preferedId - floor < ceil - preferedId) { + res = floor + } else { + res = ceil + } + } + + return res === Infinity || res === -Infinity ? -1 : res + } +} + + // another /** From 47fa994f4fdd77858e22b67b69222f85f934b32a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 30 Nov 2023 19:34:48 +0800 Subject: [PATCH 1544/2039] Create 2612-minimum-reverse-operations.js --- 2612-minimum-reverse-operations.js | 93 ++++++++++++++++++++++++++++++ 1 file changed, 93 insertions(+) create mode 100644 2612-minimum-reverse-operations.js diff --git a/2612-minimum-reverse-operations.js b/2612-minimum-reverse-operations.js new file mode 100644 index 00000000..76c1dec0 --- /dev/null +++ b/2612-minimum-reverse-operations.js @@ -0,0 +1,93 @@ +////////////////////////// Template //////////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_right(a, x, lo = 0, hi = null) { + // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] > x ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_left(a, x, lo = 0, hi = null) { + // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } +} +/////////////////////////////////////////////////////////////////// + +/** + * @param {number} n + * @param {number} p + * @param {number[]} banned + * @param {number} k + * @return {number[]} + */ +var minReverseOperations = function (n, p, banned, k) { + const distances = new Array(n).fill(Number.MAX_SAFE_INTEGER) + for (const x of banned) { + distances[x] = -1 + } + + const nodes = [p], + newNodes = [] + distances[p] = 0 + + while (nodes.length > 0) { + let iMin = Number.MAX_SAFE_INTEGER + let iMax = Number.MIN_SAFE_INTEGER + + for (const node of nodes) { + const base = node - k + 1 + + // j: segment start position + // i: update position + const j2i = (j) => base + (j - base) * 2 + + const update = (i) => { + if (distances[i] === Number.MAX_SAFE_INTEGER) { + distances[i] = distances[node] + 1 + newNodes.push(i) + } + } + + // inclusive + const lo = j2i(Math.max(0, base)) + const hi = j2i(Math.min(node + k, n) - k) + for (let i = lo; i <= Math.min(hi, iMin - 2); i += 2) { + update(i) + } + for (let i = Math.max(lo, iMax + 2); i <= hi; i += 2) { + update(i) + } + iMin = Math.min(iMin, lo) + iMax = Math.max(iMax, hi) + } + + nodes.splice(0, nodes.length, ...newNodes) + newNodes.length = 0 + } + + for (let i = 0; i < n; i++) { + if (distances[i] === Number.MAX_SAFE_INTEGER) { + distances[i] = -1 + } + } + return distances +} From 5c7a5fee0b48d199e952d765986261a6bc1f0506 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 1 Dec 2023 12:29:28 +0800 Subject: [PATCH 1545/2039] Create 2736-maximum-sum-queries.js --- 2736-maximum-sum-queries.js | 79 +++++++++++++++++++++++++++++++++++++ 1 file changed, 79 insertions(+) create mode 100644 2736-maximum-sum-queries.js diff --git a/2736-maximum-sum-queries.js b/2736-maximum-sum-queries.js new file mode 100644 index 00000000..b3381012 --- /dev/null +++ b/2736-maximum-sum-queries.js @@ -0,0 +1,79 @@ +class SegmentTree { + constructor(n) { + this.size = n + this.segTree = Array(n * 2).fill(0) + } + update(index, val) { + let n = this.size, + idx = index + n + this.segTree[idx] = Math.max(this.segTree[idx], val) + idx = Math.floor(idx / 2) + + while (idx > 0) { + this.segTree[idx] = Math.max( + this.segTree[idx * 2], + this.segTree[idx * 2 + 1], + ) + idx = Math.floor(idx / 2) + } + } + maxRange(left, right) { + let n = this.size, + max = 0 + let left_idx = left + n, + right_idx = right + n + while (left_idx <= right_idx) { + if (left_idx % 2 === 1) max = Math.max(max, this.segTree[left_idx++]) + if (right_idx % 2 === 0) max = Math.max(max, this.segTree[right_idx--]) + left_idx = Math.floor(left_idx / 2) + right_idx = Math.floor(right_idx / 2) + } + return max + } +} + + +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number[][]} queries + * @return {number[]} + */ +const maximumSumQueries = function (nums1, nums2, queries) { + let nums = [], + n = nums1.length, + indexMap = {} + for (let i = 0; i < n; i++) { + nums.push([nums1[i], nums2[i]]) + indexMap[nums2[i]] = 1 + } + nums.sort((a, b) => (a[0] === b[0] ? b[1] - a[1] : b[0] - a[0])) + for (let [_x, y] of queries) { + indexMap[y] = 1 + } + let index = 0 + for (let value in indexMap) { + indexMap[value] = index++ // assign a minimized index to each value + } + queries = queries + .map(([x, y], i) => [x, y, i]) + .sort((a, b) => (a[0] === b[0] ? b[1] - a[1] : b[0] - a[0])) + + let m = queries.length, + ans = Array(m) + let segTree = new SegmentTree(index), + numsIndex = 0 + for (let [x, y, queryIndex] of queries) { + while (numsIndex < n && nums[numsIndex][0] >= x) { + segTree.update( + indexMap[nums[numsIndex][1]], + nums[numsIndex][0] + nums[numsIndex][1], + ) + numsIndex++ + } + let max = segTree.maxRange(indexMap[y], index - 1) + ans[queryIndex] = max === 0 ? -1 : max + } + return ans +} + From ba011c5fad22ccaf093e749079d6a9a9c701c46b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Dec 2023 12:35:41 +0800 Subject: [PATCH 1546/2039] Create 2926-maximum-balanced-subsequence-sum.js --- 2926-maximum-balanced-subsequence-sum.js | 98 ++++++++++++++++++++++++ 1 file changed, 98 insertions(+) create mode 100644 2926-maximum-balanced-subsequence-sum.js diff --git a/2926-maximum-balanced-subsequence-sum.js b/2926-maximum-balanced-subsequence-sum.js new file mode 100644 index 00000000..463b1dcf --- /dev/null +++ b/2926-maximum-balanced-subsequence-sum.js @@ -0,0 +1,98 @@ +////////////////////// Template ///////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_right(a, x, lo = 0, hi = null) { + // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] > x ? (hi = mid) : (lo = mid + 1) + } + return lo + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi) + a.splice(lo, 0, x) + } + function bisect_left(a, x, lo = 0, hi = null) { + // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative') + if (hi == null) hi = a.length + while (lo < hi) { + let mid = parseInt((lo + hi) / 2) + a[mid] < x ? (lo = mid + 1) : (hi = mid) + } + return lo + } +} + +function SegmentTreeRMQArray(A) { + // max + let n = A.length, + h = Math.ceil(Math.log2(n)), + len = 2 * 2 ** h, + a = Array(len).fill(Number.MIN_SAFE_INTEGER) + h = 2 ** h + initializeFromArray() + return { update, maxx, tree } + function initializeFromArray() { + for (let i = 0; i < n; i++) a[h + i] = A[i] + for (let i = h - 1; i >= 1; i--) pushup(i) + } + function update(pos, v) { + a[h + pos] = v + for (let i = parent(h + pos); i >= 1; i = parent(i)) pushup(i) + } + function pushup(i) { + a[i] = Math.max(a[left(i)], a[right(i)]) + } + function maxx(l, r) { + // [l, r) + let max = Number.MIN_SAFE_INTEGER + if (l >= r) return max + l += h + r += h + for (; l < r; l = parent(l), r = parent(r)) { + if (l & 1) max = Math.max(max, a[l++]) + if (r & 1) max = Math.max(max, a[--r]) + } + return max + } + function parent(i) { + return i >> 1 + } + function left(i) { + return 2 * i + } + function right(i) { + return 2 * i + 1 + } + function tree() { + return a + } +} +///////////////////////////////////////////////////////////// +/** + * @param {number[]} nums + * @return {number} + */ +const maxBalancedSubsequenceSum = (a) => { + let vals = a.map((x, i) => x - i).sort((x, y) => x - y) + vals = [...new Set(vals)] + let n = a.length, + st = new SegmentTreeRMQArray(Array(n + 1).fill(Number.MIN_SAFE_INTEGER)), + bi = new Bisect() + for (let i = 0; i < n; i++) { + let v = a[i] - i, + idx = bi.bisect_left(vals, v) + let max = st.maxx(0, idx + 1) // query [0, idx] + if (max < 0) max = 0 + st.update(idx, a[i] + max) // each time accumulate previous [0, idx] max, and update new max sum + } + return st.maxx(0, n + 1) // query [0, n] +} From 69504e0425e0ed0c3f9d7cee522487497a8f7822 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Dec 2023 20:36:48 +0800 Subject: [PATCH 1547/2039] Update 2926-maximum-balanced-subsequence-sum.js --- 2926-maximum-balanced-subsequence-sum.js | 43 ++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/2926-maximum-balanced-subsequence-sum.js b/2926-maximum-balanced-subsequence-sum.js index 463b1dcf..2f551a65 100644 --- a/2926-maximum-balanced-subsequence-sum.js +++ b/2926-maximum-balanced-subsequence-sum.js @@ -1,3 +1,46 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxBalancedSubsequenceSum = (nums) => { + const stack = [[-Infinity, 0]]; + for (let i = 0; i < nums.length; i++) { + if (nums[i] > 0) { + const key = nums[i] - i; + + let left = 0, right = stack.length - 1; + while (left <= right) { + const mid = left + Math.floor((right - left) / 2); + if (stack[mid][0] > key) { + right = mid - 1; + } else { + left = mid + 1; + } + } + + const sum = nums[i] + Math.max(0, stack[left - 1][1]); + if (left === stack.length) { + stack.push([key, sum]); + } else { + stack.splice(left, 0, [key, sum]); + } + + let k = left + 1; + while (k < stack.length && sum >= stack[k][1]) { + stack.splice(k, 1); + } + } + } + + if (stack.length > 1) { + return stack[stack.length - 1][1]; + } + + return Math.max(...nums); +} + +// another + ////////////////////// Template ///////////////////////////////// function Bisect() { return { insort_right, insort_left, bisect_left, bisect_right } From 4653d5366b4660247ad7b3925b86d17f684ec4a3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 2 Dec 2023 22:33:47 +0800 Subject: [PATCH 1548/2039] Update 2926-maximum-balanced-subsequence-sum.js --- 2926-maximum-balanced-subsequence-sum.js | 58 ++++++++++++------------ 1 file changed, 29 insertions(+), 29 deletions(-) diff --git a/2926-maximum-balanced-subsequence-sum.js b/2926-maximum-balanced-subsequence-sum.js index 2f551a65..ec53d630 100644 --- a/2926-maximum-balanced-subsequence-sum.js +++ b/2926-maximum-balanced-subsequence-sum.js @@ -3,40 +3,40 @@ * @return {number} */ const maxBalancedSubsequenceSum = (nums) => { - const stack = [[-Infinity, 0]]; - for (let i = 0; i < nums.length; i++) { - if (nums[i] > 0) { - const key = nums[i] - i; + const stack = [[-Infinity, 0]] + for (let i = 0; i < nums.length; i++) { + if (nums[i] > 0) { + const key = nums[i] - i - let left = 0, right = stack.length - 1; - while (left <= right) { - const mid = left + Math.floor((right - left) / 2); - if (stack[mid][0] > key) { - right = mid - 1; - } else { - left = mid + 1; - } - } - - const sum = nums[i] + Math.max(0, stack[left - 1][1]); - if (left === stack.length) { - stack.push([key, sum]); - } else { - stack.splice(left, 0, [key, sum]); - } - - let k = left + 1; - while (k < stack.length && sum >= stack[k][1]) { - stack.splice(k, 1); - } + let left = 0, + right = stack.length - 1 + while (left < right) { + const mid = left + Math.floor((right - left) / 2) + if (stack[mid][0] <= key) { + left = mid + 1 + } else { + right = mid } + } + if (stack[left][0] <= key) left++ + const sum = nums[i] + Math.max(0, stack[left - 1][1]) + if (left === stack.length) { + stack.push([key, sum]) + } else { + stack.splice(left, 0, [key, sum]) + } + let k = left + 1 + while (k < stack.length && sum >= stack[k][1]) { + stack.splice(k, 1) + } } + } - if (stack.length > 1) { - return stack[stack.length - 1][1]; - } + if (stack.length > 1) { + return stack[stack.length - 1][1] + } - return Math.max(...nums); + return Math.max(...nums) } // another From e16628a80de5cd3644af8afad956a997a92f4254 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Dec 2023 14:41:23 +0800 Subject: [PATCH 1549/2039] Create 2953-count-complete-substrings.js --- 2953-count-complete-substrings.js | 65 +++++++++++++++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 2953-count-complete-substrings.js diff --git a/2953-count-complete-substrings.js b/2953-count-complete-substrings.js new file mode 100644 index 00000000..74632582 --- /dev/null +++ b/2953-count-complete-substrings.js @@ -0,0 +1,65 @@ +/** + * @param {string} word + * @param {number} k + * @return {number} + */ +var countCompleteSubstrings = function (word, k) { + let w = word + function calc(s) { + let res = 0; + let v = s.length; + for (let i = 1; i < 27; i++) { + if (i * k > v) break; + let l = i * k; + let len = i * k + let cnt = {}; + for (let j = 0; j < l; j++) { + if (cnt[s[j]] == null) { + cnt[s[j]] = 0; + } + cnt[s[j]]++ + } + let freq = {}; + for (let key in cnt) { + if (freq[cnt[key]] == null) { + freq[cnt[key]] = 0; + } + freq[cnt[key]]++; + } + // console.log(freq) + + if (freq[k] === i) res++; + for (let idx = 0; idx < v - len; idx++) { + if (cnt[s[idx]] == null) cnt[s[idx]] = 0 + if (freq[cnt[s[idx]]] == null) freq[cnt[s[idx]]] = 0 + freq[cnt[s[idx]]]--; + cnt[s[idx]]--; + if (freq[cnt[s[idx]]] == null) freq[cnt[s[idx]]] = 0 + freq[cnt[s[idx]]]++; + + if (cnt[s[idx + len]] == null) cnt[s[idx + len]] = 0 + if (freq[cnt[s[idx + len]]] == null) freq[cnt[s[idx + len]]] = 0 + freq[cnt[s[idx + len]]]--; + cnt[s[idx + len]]++; + if (freq[cnt[s[idx + len]]] == null) freq[cnt[s[idx + len]]] = 0 + freq[cnt[s[idx + len]]]++; + if (freq[k] === i) res++; + } + // console.log(res, freq, cnt) + } + return res; + } + + let idx = 0; + let ans = 0; + let n = w.length; + for (let i = 1; i < n; i++) { + if (Math.abs(w.charCodeAt(i) - w.charCodeAt(i - 1)) > 2) { + ans += calc(w.slice(idx, i)); + idx = i; + } + } + // console.log(ans, idx) + ans += calc(w.slice(idx)); + return ans; +}; From 370f64ea5ebe6b51ce08881769073731e95a8924 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Dec 2023 14:42:00 +0800 Subject: [PATCH 1550/2039] Create 2952-minimum-number-of-coins-to-be-added.js --- 2952-minimum-number-of-coins-to-be-added.js | 29 +++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2952-minimum-number-of-coins-to-be-added.js diff --git a/2952-minimum-number-of-coins-to-be-added.js b/2952-minimum-number-of-coins-to-be-added.js new file mode 100644 index 00000000..1fb390fc --- /dev/null +++ b/2952-minimum-number-of-coins-to-be-added.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} coins + * @param {number} target + * @return {number} + */ +var minimumAddedCoins = function (coins, target) { + coins.sort((a, b) => a - b) + let currin = 1 + let res = 0 + + for (let coin of coins) { + while (coin > currin) { + res += 1 + currin *= 2 + } + currin += coin + + if (currin > target) { + break + } + } + + while (currin <= target) { + res += 1 + currin *= 2 + } + + return res +} From 05874644f42c93be9ed1f586a9db8286c03c59de Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Dec 2023 14:43:15 +0800 Subject: [PATCH 1551/2039] Create 2951-find-the-peaks.js --- 2951-find-the-peaks.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2951-find-the-peaks.js diff --git a/2951-find-the-peaks.js b/2951-find-the-peaks.js new file mode 100644 index 00000000..e564e870 --- /dev/null +++ b/2951-find-the-peaks.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} mountain + * @return {number[]} + */ +var findPeaks = function(mountain) { + const res = [] + const n = mountain.length + for(let i = 1; i < n - 1; i++) { + if(mountain[i] > mountain[i - 1] && mountain[i] > mountain[i + 1]) res.push(i) + } + + return res +}; From b81744b0cc75909abe2357ed8e14469b12861742 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Dec 2023 17:16:58 +0800 Subject: [PATCH 1552/2039] Create 2954-count-the-number-of-infection-sequences.js --- ...count-the-number-of-infection-sequences.js | 163 ++++++++++++++++++ 1 file changed, 163 insertions(+) create mode 100644 2954-count-the-number-of-infection-sequences.js diff --git a/2954-count-the-number-of-infection-sequences.js b/2954-count-the-number-of-infection-sequences.js new file mode 100644 index 00000000..5891fe6a --- /dev/null +++ b/2954-count-the-number-of-infection-sequences.js @@ -0,0 +1,163 @@ +//#region Modulo +class Modulo { + /** + * @param {number} modulo + */ + constructor(modulo) { + /** @type {number} @readonly */ + this.modulo = modulo; + } + + /** + * @param {...number} numbers + */ + add(...numbers) { + let result = 0; + for (let number of numbers) { + result = (result + (number % this.modulo)) % this.modulo; + } + + if (result < 0) result += this.modulo; + return result; + } + + /** + * @private + * @param {number} a + * @param {number} b + * @returns {number} + */ + _quickMul(a, b) { + a = ((a % this.modulo) + this.modulo) % this.modulo; + b = ((b % this.modulo) + this.modulo) % this.modulo; + if (a === 0 || b === 0) return 0; + if (Math.log2(a) + Math.log2(b) < 50) return (a * b) % this.modulo; + + let result = 0; + while (b) { + while (b % 2 === 0) { + a = (a * 2) % this.modulo; + b /= 2; + } + + if (b % 2 !== 0) { + result = (result + a) % this.modulo; + b--; + } + } + + return result; + } + + /** + * @param {...number} numbers + */ + mul(...numbers) { + let result = 1; + for (let number of numbers) { + result = this._quickMul(result, number); + if (result === 0) return 0; + } + + if (result < 0) result += this.modulo; + return result; + } + + /** + * @param {number} a + * @param {number} b + * @returns {number} + */ + pow(a, b) { + a = ((a % this.modulo) + this.modulo) % this.modulo; + if (a === 0) return 0; + + let result = 1; + while (b) { + while (b % 2 === 0) { + a = this._quickMul(a, a); + b /= 2; + } + + if (b % 2 !== 0) { + result = this._quickMul(result, a); + b--; + } + } + + return result; + } +} +//#endregion + +//#region Division +/** @private @type {undefined | number} */ +Modulo.prototype._phi = undefined; + +/** + * @returns {number} + */ +Modulo.prototype.getPhi = function () { + if (this._phi !== undefined) return this._phi; + + let result = this.modulo; + let temp = this.modulo; + for (let i = 2; i <= Math.sqrt(temp); i++) { + if (temp % i === 0) { + result /= i; + result *= i - 1; + } + while (temp % i === 0) temp /= i; + } + if (temp > 1) { + result /= temp; + result *= temp - 1; + } + + this._phi = result; + return result; +}; + +/** + * @param {number} a + * @returns {number} + */ +Modulo.prototype.getInverse = function (a) { + return this.pow(a, this.getPhi() - 1); +}; + +/** + * @param {number} a + * @param {number} b + * @returns {number} + */ +Modulo.prototype.div = function (a, b) { + return this._quickMul(a, this.getInverse(b)); +}; +//#endregion + +let mod = new Modulo(1000000007); + +let FACTS = new Uint32Array(100001); +FACTS[0] = 1; +for (let i = 1; i <= 1e5; ++i) FACTS[i] = mod.mul(FACTS[i - 1], i); + +/** + * @param {number} n + * @param {number[]} sick + * @return {number} + */ +var numberOfSequence = function (n, sick) { + let m = sick.length; + let e = FACTS[n - m]; + let d = mod.mul(FACTS[sick[0]], FACTS[n - 1 - sick[m - 1]]); + + for (let i = 1; i < m; ++i) { + let dis = sick[i] - sick[i - 1] - 1; + if (dis <= 1) continue; + e = mod.mul(e, mod.pow(2, dis - 1)); + d = mod.mul(d, FACTS[dis]); + } + + return mod.div(e, d); +}; From 097b9094310330f4a5e1f507957a9888f93af153 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Dec 2023 20:26:33 +0800 Subject: [PATCH 1553/2039] Update 2952-minimum-number-of-coins-to-be-added.js --- 2952-minimum-number-of-coins-to-be-added.js | 27 +++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2952-minimum-number-of-coins-to-be-added.js b/2952-minimum-number-of-coins-to-be-added.js index 1fb390fc..e106e731 100644 --- a/2952-minimum-number-of-coins-to-be-added.js +++ b/2952-minimum-number-of-coins-to-be-added.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} coins + * @param {number} target + * @return {number} + */ +var minimumAddedCoins = function (coins, target) { + coins.sort((a, b) => a - b) + let current_max = 0; + let additions = 0; + let index = 0; + + while (current_max < target) { + if (index < coins.length && coins[index] <= current_max + 1) { + current_max += coins[index]; + index++; + } else { + current_max += current_max + 1; + additions++; + } + } + + return additions; +} + + +// another + /** * @param {number[]} coins * @param {number} target From 3eca4642129713961bb27b1962b37018c4b88139 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Dec 2023 20:55:07 +0800 Subject: [PATCH 1554/2039] Update 330-patching-array.js --- 330-patching-array.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/330-patching-array.js b/330-patching-array.js index 83e6f9f6..7b101bf8 100644 --- a/330-patching-array.js +++ b/330-patching-array.js @@ -1,3 +1,26 @@ +/** + * @param {number[]} nums + * @param {number} n + * @return {number} + */ +const minPatches = function(nums, n) { + const len = nums.length + let miss = 1, res = 0, i = 0 + while(miss <= n) { + if(i < len && nums[i] <= miss) { + miss += nums[i] + i++ + } else { + res++ + miss += miss + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} n From 8411e0e3df8a046df923bc818d88722c6e53fc37 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Dec 2023 14:05:00 +0800 Subject: [PATCH 1555/2039] Update 2940-find-building-where-alice-and-bob-can-meet.js --- ...d-building-where-alice-and-bob-can-meet.js | 89 +++++++++---------- 1 file changed, 43 insertions(+), 46 deletions(-) diff --git a/2940-find-building-where-alice-and-bob-can-meet.js b/2940-find-building-where-alice-and-bob-can-meet.js index ae2e46db..6a06b0bd 100644 --- a/2940-find-building-where-alice-and-bob-can-meet.js +++ b/2940-find-building-where-alice-and-bob-can-meet.js @@ -4,53 +4,50 @@ * @return {number[]} */ var leftmostBuildingQueries = function (heights, queries) { - const st = [] - const [hs, qs] = [heights, queries] - let n = qs.length; - let ans = new Array(n).fill(-1); - let es = new Array(hs.length).fill().map(() => []); - for (let i = 0; i < n; i++) { - let x = qs[i][0]; - let y = qs[i][1]; - if (x > y) { - [x, y] = [y, x]; - } - if (hs[y] > hs[x] || x === y) { - ans[i] = y; - } else { - es[y].push([hs[x], i]); - } + const st = [] + const [hs, qs] = [heights, queries] + let n = qs.length; + let ans = new Array(n).fill(-1); + let es = new Array(hs.length).fill().map(() => []); + for (let i = 0; i < n; i++) { + let x = qs[i][0]; + let y = qs[i][1]; + if (x > y) { + [x, y] = [y, x]; } - - for (let i = hs.length - 1; i >= 0; i--) { - let n1 = st.length; - for (let [x, y] of es[i]) { - let p = search(x); - if (p < n1 && p >= 0) { - ans[y] = st[p][1]; - } - } - while (st.length > 0 && st[st.length - 1][0] <= hs[i]) { - st.pop(); - } - st.push([hs[i], i]); + if (hs[y] > hs[x] || x === y) { + ans[i] = y; + } else { + es[y].push([hs[x], i]); } - return ans; - - - function search(x) { - let l = 0; - let r = st.length - 1; - let ans = -1; - while (l <= r) { - let m = Math.floor((l + r) / 2); - if (st[m][0] > x) { - ans = Math.max(ans, m); - l = m + 1; - } else { - r = m - 1; - } - } - return ans; + } + for (let i = hs.length - 1; i >= 0; i--) { + let n1 = st.length; + for (let [x, y] of es[i]) { + let p = search(x); + if (p < n1 && p >= 0) { + ans[y] = st[p][1]; + } + } + while (st.length > 0 && st[st.length - 1][0] <= hs[i]) { + st.pop(); } + st.push([hs[i], i]); + } + return ans; + function search(x) { + let l = 0; + let r = st.length - 1; + let ans = -1; + while (l <= r) { + let m = Math.floor((l + r) / 2); + if (st[m][0] > x) { + ans = Math.max(ans, m); + l = m + 1; + } else { + r = m - 1; + } + } + return ans; + } } From 31be44413240bcbf9ee817321254ed66fefaea52 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 4 Dec 2023 18:34:08 +0800 Subject: [PATCH 1556/2039] Update 2940-find-building-where-alice-and-bob-can-meet.js --- ...d-building-where-alice-and-bob-can-meet.js | 107 ++++++++++++++++++ 1 file changed, 107 insertions(+) diff --git a/2940-find-building-where-alice-and-bob-can-meet.js b/2940-find-building-where-alice-and-bob-can-meet.js index 6a06b0bd..d32ecd9f 100644 --- a/2940-find-building-where-alice-and-bob-can-meet.js +++ b/2940-find-building-where-alice-and-bob-can-meet.js @@ -1,3 +1,110 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} +/** + * @param {number[]} heights + * @param {number[][]} queries + * @return {number[]} + */ +const leftmostBuildingQueries = function(heights, queries) { + const n = queries.length, m = heights.length + const res = Array(n).fill(-1) + const pq = new PQ((a,b) => a[0] < b[0]) + const que = Array.from({ length: m }, () => Array()) + for(let i = 0; i < n; i++) { + let [a, b] = queries[i]; + if(a < b && heights[a] < heights[b]) { + res[i] = b + } else if(a > b && heights[a] > heights[b]) { + res[i] = a + } else if(a === b) { + res[i] = a + } else { + que[Math.max(a, b)].push([Math.max(heights[a], heights[b]), i]) + } + } + + for(let i = 0; i < m; i++) { + while(!pq.isEmpty() && pq.peek()[0] < heights[i]) { + const e = pq.pop() + res[e[1]] = i + } + + for(const e of que[i]) { + pq.push(e) + } + } + + return res +}; + +// another + + /** * @param {number[]} heights * @param {number[][]} queries From d9d7eb48e9a7ac923091a2523540ed679ae56a53 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Dec 2023 10:32:36 +0800 Subject: [PATCH 1557/2039] Update 85-maximal-rectangle.js --- 85-maximal-rectangle.js | 48 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/85-maximal-rectangle.js b/85-maximal-rectangle.js index fd57a2d6..2f06ea31 100644 --- a/85-maximal-rectangle.js +++ b/85-maximal-rectangle.js @@ -1,3 +1,51 @@ +/** + * @param {character[][]} matrix + * @return {number} + */ +const maximalRectangle = function(matrix) { + const m = matrix.length, n = matrix[0].length + const heights = Array(n).fill(0), left = Array(n).fill(0), right = Array(n).fill(n) + let res = 0 + for(let i = 0; i < m; i++) { + let l = 0, r = n + for(let j = 0; j < n; j++) { + if(matrix[i][j] === '1') { + heights[j]++ + } else { + heights[j] = 0 + } + } + + for(let j = 0; j < n; j++) { + if(matrix[i][j] === '1') { + left[j] = Math.max(l, left[j]) + } else { + left[j] = 0 + l = j + 1 + } + } + + for(let j = n - 1; j >= 0; j--) { + if(matrix[i][j] === '1') { + right[j] = Math.min(r, right[j]) + } else { + right[j] = n + r = j + } + } + + for(let j = 0; j < n; j++) { + res = Math.max(res, heights[j] * (right[j] - left[j])) + } + + } + + return res +}; + +// another + + /** * @param {character[][]} matrix * @return {number} From 248645d1cc0399463e05e0b831a4249ae70a2b3f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Dec 2023 13:07:04 +0800 Subject: [PATCH 1558/2039] Create 2945-find-maximum-non-decreasing-array-length.js --- ...ind-maximum-non-decreasing-array-length.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2945-find-maximum-non-decreasing-array-length.js diff --git a/2945-find-maximum-non-decreasing-array-length.js b/2945-find-maximum-non-decreasing-array-length.js new file mode 100644 index 00000000..95bf4479 --- /dev/null +++ b/2945-find-maximum-non-decreasing-array-length.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findMaximumLength = function(nums) { + let res = 0 + const n = nums.length + const stk = [[0,0,0]] + let pre = 0 + for(let i = 0, j = 0; i < n; i++) { + pre += nums[i] + j = Math.min(j, stk.length - 1) + while(j + 1 < stk.length && pre >= stk[j + 1][0]) j++ + const [val, preVal, preDp] = stk[j] + const curDp = preDp + 1 + res = curDp + const last = pre - preVal + while(stk.length && stk.at(-1)[0] >= last + pre) stk.pop() + stk.push([last + pre, pre, curDp]) + } + + return res +}; From 00bc41524bf4214d17de4cfeac5ac8b7eed4a4b5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Dec 2023 12:16:42 +0800 Subject: [PATCH 1559/2039] Create 2856-minimum-array-length-after-pair-removals.js --- ...inimum-array-length-after-pair-removals.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2856-minimum-array-length-after-pair-removals.js diff --git a/2856-minimum-array-length-after-pair-removals.js b/2856-minimum-array-length-after-pair-removals.js new file mode 100644 index 00000000..59dd8e37 --- /dev/null +++ b/2856-minimum-array-length-after-pair-removals.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minLengthAfterRemovals = function(nums) { + const map = new Map(), n = nums.length + for(const e of nums) { + if(!map.has(e)) map.set(e, 0) + map.set(e, map.get(e) + 1) + } + let maxFreq = 0 + for(const [k, v] of map) { + maxFreq = Math.max(maxFreq, v) + } + if(maxFreq <= n / 2) { + return n % 2 + } + + return 2 * maxFreq - n +}; From d2705d261687f489358b61c87e44060aecc4df68 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Dec 2023 12:40:29 +0800 Subject: [PATCH 1560/2039] Update 2856-minimum-array-length-after-pair-removals.js --- ...inimum-array-length-after-pair-removals.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/2856-minimum-array-length-after-pair-removals.js b/2856-minimum-array-length-after-pair-removals.js index 59dd8e37..69e868e1 100644 --- a/2856-minimum-array-length-after-pair-removals.js +++ b/2856-minimum-array-length-after-pair-removals.js @@ -1,3 +1,24 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const minLengthAfterRemovals = function(nums) { + const n = nums.length, rightStart = Math.floor((n + 1) / 2) + let i = 0, j = rightStart + let num = 0 + while(i < rightStart && j < n) { + if(nums[i] < nums[j]) { + num += 2 + i++ + j++ + } else j++ + } + + return n - num +}; + +// another + /** * @param {number[]} nums * @return {number} From 1ecbd90de82c248a7a4096174b522fc29914ef2e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Dec 2023 13:56:36 +0800 Subject: [PATCH 1561/2039] Update 2945-find-maximum-non-decreasing-array-length.js --- ...ind-maximum-non-decreasing-array-length.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2945-find-maximum-non-decreasing-array-length.js b/2945-find-maximum-non-decreasing-array-length.js index 95bf4479..44b294ba 100644 --- a/2945-find-maximum-non-decreasing-array-length.js +++ b/2945-find-maximum-non-decreasing-array-length.js @@ -1,3 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const findMaximumLength = function(nums) { + const n = nums.length + const stk = [0] + const preSum = Array(n + 1).fill(0) + const maxLen = Array(n + 1).fill(0) + const last = Array(n + 1).fill(0) + for(let i = 1; i <= n; i++) { + preSum[i] = preSum[i - 1] + nums[i - 1] + } + // console.log(preSum) + let stkPtr = 0 + last[0] = nums[0] + for(let i = 1; i <= n; i++) { + stkPtr = Math.min(stkPtr, stk.length - 1) + while(stkPtr < stk.length - 1 && preSum[stk[stkPtr + 1]] + last[stk[stkPtr + 1]] <= preSum[i]) stkPtr++ + const idx = stk[stkPtr] + maxLen[i] = maxLen[idx] + 1 + last[i] = preSum[i] - preSum[idx] + while(stk.length && preSum[stk.at(-1)] + last[stk.at(-1)] >= preSum[i] + last[i]) stk.pop() + stk.push(i) + } + // console.log(maxLen) + return maxLen[n] +}; + +// another + /** * @param {number[]} nums * @return {number} From 322e9f32a957ea117af2f98daa29306a052b3db6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Dec 2023 13:58:47 +0800 Subject: [PATCH 1562/2039] Update 2945-find-maximum-non-decreasing-array-length.js --- 2945-find-maximum-non-decreasing-array-length.js | 1 - 1 file changed, 1 deletion(-) diff --git a/2945-find-maximum-non-decreasing-array-length.js b/2945-find-maximum-non-decreasing-array-length.js index 44b294ba..1d94bfdb 100644 --- a/2945-find-maximum-non-decreasing-array-length.js +++ b/2945-find-maximum-non-decreasing-array-length.js @@ -15,7 +15,6 @@ const findMaximumLength = function(nums) { let stkPtr = 0 last[0] = nums[0] for(let i = 1; i <= n; i++) { - stkPtr = Math.min(stkPtr, stk.length - 1) while(stkPtr < stk.length - 1 && preSum[stk[stkPtr + 1]] + last[stk[stkPtr + 1]] <= preSum[i]) stkPtr++ const idx = stk[stkPtr] maxLen[i] = maxLen[idx] + 1 From 87487a16259b76deb513ee3000df79f1598a389f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Dec 2023 10:55:21 +0800 Subject: [PATCH 1563/2039] Create 2860-happy-students.js --- 2860-happy-students.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 2860-happy-students.js diff --git a/2860-happy-students.js b/2860-happy-students.js new file mode 100644 index 00000000..0ab1d182 --- /dev/null +++ b/2860-happy-students.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countWays = function(nums) { + const n = nums.length + nums.sort((a, b) => a - b) + let res = 0, num = 0 + if(nums[0] !== 0) res = 1 + for(let i = 0; i < n; i++) { + num++ + if(num > nums[i]) { + if(i + 1 < n && num < nums[i + 1]) res++ + else if(i + 1 === n) res++ + } + } + return res +}; From e407860ef53473ec3a80414d92bbfdc8c6e594ae Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Dec 2023 19:23:22 +0800 Subject: [PATCH 1564/2039] Create 2862-maximum-element-sum-of-a-complete-subset-of-indices.js --- ...ent-sum-of-a-complete-subset-of-indices.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2862-maximum-element-sum-of-a-complete-subset-of-indices.js diff --git a/2862-maximum-element-sum-of-a-complete-subset-of-indices.js b/2862-maximum-element-sum-of-a-complete-subset-of-indices.js new file mode 100644 index 00000000..3489dde0 --- /dev/null +++ b/2862-maximum-element-sum-of-a-complete-subset-of-indices.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumSum = function(nums) { + const n = nums.length; + + // Find squares + let sq = [1]; + while(sq.at(-1) < n) sq.push((sq.length+1) ** 2); + + let res = 0; + for(let i=1; i<=n; ++i) { + let cur = 0; + for(const s of sq) { // s*i will give {i*1, i*4, i*9, ...} + const idx = s*i; + if(idx>n) break; + cur += nums[idx-1]; + } + res = Math.max(res, cur); + } + + return res; +}; From 1e400f9d415ba340b44e1e16573b6dfd3dd65ba2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Dec 2023 20:11:46 +0800 Subject: [PATCH 1565/2039] Create 2960-count-tested-devices-after-test-operations.js --- ...count-tested-devices-after-test-operations.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2960-count-tested-devices-after-test-operations.js diff --git a/2960-count-tested-devices-after-test-operations.js b/2960-count-tested-devices-after-test-operations.js new file mode 100644 index 00000000..014419e9 --- /dev/null +++ b/2960-count-tested-devices-after-test-operations.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} batteryPercentages + * @return {number} + */ +var countTestedDevices = function(batteryPercentages) { + const arr = batteryPercentages + const n = arr.length + let cnt = 0 + for(let i = 0; i < n; i++) { + const e = Math.max(0, arr[i] - cnt) + if(e > 0) { + cnt++ + } + } + return cnt +}; From 90d5259c032af855e5f078c2814c281ca5db6f62 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Dec 2023 20:12:33 +0800 Subject: [PATCH 1566/2039] Create 2961-double-modular-exponentiation.js --- 2961-double-modular-exponentiation.js | 36 +++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 2961-double-modular-exponentiation.js diff --git a/2961-double-modular-exponentiation.js b/2961-double-modular-exponentiation.js new file mode 100644 index 00000000..a6643495 --- /dev/null +++ b/2961-double-modular-exponentiation.js @@ -0,0 +1,36 @@ +/** + * @param {number[][]} variables + * @param {number} target + * @return {number[]} + */ +var getGoodIndices = function (variables, target) { + const res = [] + let index = 0 + for (let v of variables) { + let a = v[0] + let b = v[1] + let c = v[2] + let m = v[3] + let x = pw(a, b, 10) + let y = pw(x, c, m) + // console.log(y) + if (y === BigInt(target)) { + res.push(index) + } + index++ + } + return res + + function pw(a, b, m) { + let res = 1n + a = BigInt(a) + while (b) { + if (b & 1) { + res = (1n * res * a) % BigInt(m) + } + a = (1n * a * a) % BigInt(m) + b >>= 1 + } + return res + } +} From 87c2c65d673e81a2e1f64fc0a3a60be306f808d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Dec 2023 20:13:00 +0800 Subject: [PATCH 1567/2039] Create 2962-count-subarrays-where-max-element-appears-at-least-k-times.js --- ...re-max-element-appears-at-least-k-times.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2962-count-subarrays-where-max-element-appears-at-least-k-times.js diff --git a/2962-count-subarrays-where-max-element-appears-at-least-k-times.js b/2962-count-subarrays-where-max-element-appears-at-least-k-times.js new file mode 100644 index 00000000..c8731fea --- /dev/null +++ b/2962-count-subarrays-where-max-element-appears-at-least-k-times.js @@ -0,0 +1,32 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countSubarrays = function (nums, k) { + const n = nums.length + const mx = Math.max(...nums) + const prefix = new Array(n + 2).fill(0) + for (let i = 1; i <= n; i++) { + prefix[i] = prefix[i - 1] + (nums[i - 1] === mx ? 1 : 0) + } + let res = 0 + for (let i = 0; i < n; i++) { + let l = i + let r = n + while (r - l > 1) { + let mid = Math.floor((l + r) / 2) + if (prefix[mid + 1] - prefix[i] < k) { + l = mid + } else { + r = mid + } + } + res += n - i + if (l === i && k === 1 && nums[i] === mx) { + continue + } + res -= l - i + 1 + } + return res +} From e76d9532d3f07c80b2cdf2cdd4b754078a7635be Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Dec 2023 20:13:26 +0800 Subject: [PATCH 1568/2039] Create 2963-count-the-number-of-good-partitions.js --- 2963-count-the-number-of-good-partitions.js | 54 +++++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 2963-count-the-number-of-good-partitions.js diff --git a/2963-count-the-number-of-good-partitions.js b/2963-count-the-number-of-good-partitions.js new file mode 100644 index 00000000..149c3feb --- /dev/null +++ b/2963-count-the-number-of-good-partitions.js @@ -0,0 +1,54 @@ +class Interval { + constructor(left, right) { + this.left = left + this.right = right + } +} +/** + * @param {number[]} nums + * @return {number} + */ +var numberOfGoodPartitions = function (nums) { + const mod = BigInt(1000000007) + const mapFst = new Map() + const mapLst = new Map() + + for (let i = 0; i < nums.length; i++) { + const item = nums[i] + if (mapFst.has(item)) { + mapLst.set(item, i) + } else { + mapFst.set(item, i) + } + } + + const l = [] + for (const key of mapLst.keys()) { + l.push(new Interval(mapFst.get(key), mapLst.get(key))) + } + l.sort((a, b) => a.left - b.left) + + const st = [] + for (let i = 0; i < l.length; i++) { + const cur = l[i] + if (st.length === 0) { + st.push(cur) + } else { + const pre = st.pop() + if (cur.left < pre.right) { + st.push(new Interval(pre.left, Math.max(pre.right, cur.right))) + } else { + st.push(pre) + st.push(cur) + } + } + } + + let n = nums.length - 1 + while (st.length > 0) { + const item = st.pop() + n -= item.right - item.left + } + + return BigInt(2) ** BigInt(n) % mod +} From 41945beefc779febc3ee2e788b3a91b20773d351 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Dec 2023 11:06:52 +0800 Subject: [PATCH 1569/2039] Create 2680-maximum-or.js --- 2680-maximum-or.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2680-maximum-or.js diff --git a/2680-maximum-or.js b/2680-maximum-or.js new file mode 100644 index 00000000..99d1130f --- /dev/null +++ b/2680-maximum-or.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumOr = function(nums, k) { + let base = 0n, backup = 0n, best = 0n; + k = BigInt(k) + for (let num of nums) { + num = BigInt(num) + backup |= base & num; + base |= num; + } + for (let num of nums) { + num = BigInt(num) + best = max(best, base - num | backup | num << k); + } + return Number(best); +}; + +function max(a, b) { + return a > b ? a : b +} From 1d23d7f02c0264b007910f4075bc926cf17669e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Dec 2023 11:29:19 +0800 Subject: [PATCH 1570/2039] Update 2680-maximum-or.js --- 2680-maximum-or.js | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2680-maximum-or.js b/2680-maximum-or.js index 99d1130f..8a5abec4 100644 --- a/2680-maximum-or.js +++ b/2680-maximum-or.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumOr = function(nums, k) { + let res = 0n + const n = nums.length, pre = Array(n).fill(0), suf = Array(n).fill(0) + pre[0] = nums[0] + suf[n - 1] = nums.at(-1) + for(let i = 1; i < n; i++) { + const e = nums[i] + pre[i] = pre[i - 1] | e + suf[n - 1 - i] = suf[n - i] | nums[n - 1 - i] + } + + k = bi(k) + for(let i = 0; i < n; i++) { + const e = bi(nums[i]) + let tmp = e << k + if(i - 1 >= 0) tmp |= bi(pre[i - 1]) + if(i + 1 < n) tmp |= bi(suf[i + 1]) + + res = max(res, tmp) + } + + return Number(res) +}; +function bi(num) { + return BigInt(num) +} +function max(a, b) { + return a > b ? a : b +} + +// another + + /** * @param {number[]} nums * @param {number} k From 30cb61d17d9800a2c2f350b67c2cb7a97b53aa15 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 14 Dec 2023 21:12:10 +0800 Subject: [PATCH 1571/2039] Update 1625-lexicographically-smallest-string-after-applying-operations.js --- ...allest-string-after-applying-operations.js | 46 +++++++++++++++++++ 1 file changed, 46 insertions(+) diff --git a/1625-lexicographically-smallest-string-after-applying-operations.js b/1625-lexicographically-smallest-string-after-applying-operations.js index f624d743..ed184351 100644 --- a/1625-lexicographically-smallest-string-after-applying-operations.js +++ b/1625-lexicographically-smallest-string-after-applying-operations.js @@ -1,3 +1,49 @@ +/** + * @param {string} s + * @param {number} a + * @param {number} b + * @return {string} + */ +const findLexSmallestString = function(s, a, b) { + let res = s + const visited = new Set() + dfs(s) + return res + + function dfs(str) { + if(isVisited(str)) return + visit(str) + dfs(add(str)) + dfs(rotate(str)) + } + + function isVisited(str) { + return visited.has(str) + } + + function visit(str) { + if(str < res) res = str + visited.add(str) + } + + function add(str) { + const arr = str.split('').map(e => +e) + for(let i = 1; i < str.length; i += 2) { + arr[i] = (arr[i] + a) % 10 + } + return arr.join('') + } + + function rotate(str) { + const n = str.length + const len = b % str.length + const pre = str.slice(0,n - len), suf = str.slice(n - len) + return `${suf}${pre}` + } +}; + +// another + /** * @param {string} s * @param {number} a From e88019b1b341c3bfe5bd0b23623103c597c51690 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 15 Dec 2023 12:38:25 +0800 Subject: [PATCH 1572/2039] Update 795-number-of-subarrays-with-bounded-maximum.js --- ...umber-of-subarrays-with-bounded-maximum.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/795-number-of-subarrays-with-bounded-maximum.js b/795-number-of-subarrays-with-bounded-maximum.js index beb84f9d..61e17d9d 100644 --- a/795-number-of-subarrays-with-bounded-maximum.js +++ b/795-number-of-subarrays-with-bounded-maximum.js @@ -1,3 +1,32 @@ +/** + * @param {number[]} nums + * @param {number} left + * @param {number} right + * @return {number} + */ +const numSubarrayBoundedMax = function(nums, left, right) { + let prev = -1, res = 0, dp = 0 + const n = nums.length + + for(let i = 0; i < n; i++) { + const e = nums[i] + if(e < left) { + + } else if(e > right) { + prev = i + dp = 0 + } else { + dp = i - prev + } + + res += dp + } + + return res +}; + +// another + /** * @param {number[]} A * @param {number} L From fd8d20f2ad8da34b9ea143899a521cbb7a7d09b1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Dec 2023 11:24:54 +0800 Subject: [PATCH 1573/2039] Create 2968-apply-operations-to-maximize-frequency-score.js --- ...-operations-to-maximize-frequency-score.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 2968-apply-operations-to-maximize-frequency-score.js diff --git a/2968-apply-operations-to-maximize-frequency-score.js b/2968-apply-operations-to-maximize-frequency-score.js new file mode 100644 index 00000000..a1f407e6 --- /dev/null +++ b/2968-apply-operations-to-maximize-frequency-score.js @@ -0,0 +1,43 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maxFrequencyScore = function (nums, k) { + nums.sort((a, b) => a - b) + + const n = nums.length + const prefixSum = new Array(n + 1).fill(0) + + for (let i = 0; i < n; ++i) { + prefixSum[i + 1] = prefixSum[i] + nums[i] + } + + let start = 0 + let end = 1 + let maxScore = 1 + + while (end < n) { + ++end + const mid = Math.floor((start + end) / 2) + const target = nums[mid] + let cost = + target * (mid - start) - + (prefixSum[mid] - prefixSum[start]) + + (prefixSum[end] - prefixSum[mid] - target * (end - mid)) + + while (start < end && cost > k) { + ++start + const mid = Math.floor((start + end) / 2) + const target = nums[mid] + cost = + target * (mid - start) - + (prefixSum[mid] - prefixSum[start]) + + (prefixSum[end] - prefixSum[mid] - target * (end - mid)) + } + + maxScore = Math.max(maxScore, end - start) + } + + return maxScore +} From 1319977302d2bf545e9b7d4b778612060114e00f Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Dec 2023 11:25:54 +0800 Subject: [PATCH 1574/2039] Create 2967-minimum-cost-to-make-array-equalindromic.js --- ...inimum-cost-to-make-array-equalindromic.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 2967-minimum-cost-to-make-array-equalindromic.js diff --git a/2967-minimum-cost-to-make-array-equalindromic.js b/2967-minimum-cost-to-make-array-equalindromic.js new file mode 100644 index 00000000..2ec531c4 --- /dev/null +++ b/2967-minimum-cost-to-make-array-equalindromic.js @@ -0,0 +1,42 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minimumCost = function (nums) { + nums.sort((a, b) => a - b) + let costs = [] + let numbersPalindromic = getPalindromic(nums[Math.floor(nums.length / 2)]) + for (let i = 0; i < numbersPalindromic.length; i++) { + costs.push(caculateCost(nums, numbersPalindromic[i])) + } + return Math.min(...costs) +} + +function getPalindromic(number) { + let numbers = [] + let nextNumber = number + let prevNumber = number + while (numbers.length <= 2) { + if (reverseString(nextNumber.toString()) === nextNumber.toString()) { + numbers.push(nextNumber) + } + if (reverseString(prevNumber.toString()) === prevNumber.toString()) { + numbers.push(prevNumber) + } + nextNumber++ + prevNumber-- + } + return numbers +} + +function caculateCost(nums, palindromic) { + let cost = 0 + for (let i = 0; i < nums.length; i++) { + cost += Math.abs(nums[i] - palindromic) + } + return cost +} + +function reverseString(str) { + return str.split('').reverse().join('') +} From c8114352044c69223ab9a38effb29617cd1269e7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Dec 2023 11:26:32 +0800 Subject: [PATCH 1575/2039] Create 2966-divide-array-into-arrays-with-max-difference.js --- ...e-array-into-arrays-with-max-difference.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 2966-divide-array-into-arrays-with-max-difference.js diff --git a/2966-divide-array-into-arrays-with-max-difference.js b/2966-divide-array-into-arrays-with-max-difference.js new file mode 100644 index 00000000..a6bf20b2 --- /dev/null +++ b/2966-divide-array-into-arrays-with-max-difference.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number[][]} + */ +const divideArray = function(nums, k) { + nums.sort((a, b) => a - b) + const res = [], n = nums.length + for(let i = 2; i < n; i += 3) { + if(nums[i] - nums[i - 2] > k) { + return res + } + } + for(let i = 0; i < n;) { + const tmp = [] + let num = 3 + while(num) { + tmp.push(nums[i]) + i++ + num-- + } + res.push(tmp) + } + return res +}; From a715752c6309d764ceb7c434f364964f05c24ccd Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Dec 2023 11:27:13 +0800 Subject: [PATCH 1576/2039] Create 2965-find-missing-and-repeated-values.js --- 2965-find-missing-and-repeated-values.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 2965-find-missing-and-repeated-values.js diff --git a/2965-find-missing-and-repeated-values.js b/2965-find-missing-and-repeated-values.js new file mode 100644 index 00000000..11c0b988 --- /dev/null +++ b/2965-find-missing-and-repeated-values.js @@ -0,0 +1,20 @@ +/** + * @param {number[][]} grid + * @return {number[]} + */ +var findMissingAndRepeatedValues = function(grid) { + const hash = {}, res = [] + const m = grid.length, n = grid[0].length + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + const e = grid[i][j] + if(hash[e] == null) hash[e] = 0 + hash[e]++ + if(hash[e] === 2) res[0] = e + } + } + for(let i = 1; i <= n * n; i++) { + if(hash[i] == null) res[1] = i + } + return res +}; From 531115b741a55c24402b1cd1aacf1457bdfa9440 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Dec 2023 13:17:02 +0800 Subject: [PATCH 1577/2039] Update 2768-number-of-black-blocks.js --- 2768-number-of-black-blocks.js | 48 ++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/2768-number-of-black-blocks.js b/2768-number-of-black-blocks.js index 48067a99..241fd1fe 100644 --- a/2768-number-of-black-blocks.js +++ b/2768-number-of-black-blocks.js @@ -1,3 +1,51 @@ +/** + * @param {number} m + * @param {number} n + * @param {number[][]} coordinates + * @return {number[]} + */ +const countBlackBlocks = function(m, n, coordinates) { + const hash = {} + const key = ([x, y]) => `${x},${y}` + for (const e of coordinates) { + const [x, y] = e + if(x === m - 1 && y === n - 1) { + if(hash[`${x - 1},${y - 1}`]==null) hash[`${x - 1},${y - 1}`] = 0 + hash[`${x - 1},${y - 1}`]++ + } else if(x === m - 1) { + if(hash[`${x - 1},${y - 1}`]==null) hash[`${x - 1},${y - 1}`] = 0 + if(hash[`${x - 1},${y}`]==null) hash[`${x - 1},${y}`] = 0 + hash[`${x - 1},${y}`]++ + hash[`${x - 1},${y - 1}`]++ + } else if(y === n - 1) { + if(hash[`${x - 1},${y - 1}`]==null) hash[`${x - 1},${y - 1}`] = 0 + if(hash[`${x},${y- 1}`]==null) hash[`${x},${y-1}`] = 0 + hash[`${x},${y-1}`]++ + hash[`${x-1},${y - 1}`]++ + } else { + if(hash[`${x - 1},${y - 1}`]==null) hash[`${x - 1},${y - 1}`] = 0 + if(hash[`${x},${y- 1}`]==null) hash[`${x},${y-1}`] = 0 + if(hash[`${x - 1},${y}`]==null) hash[`${x - 1},${y}`] = 0 + if(hash[`${x},${y}`]==null) hash[`${x},${y}`] = 0 + hash[`${x},${y}`]++ + hash[`${x},${y-1}`]++ + hash[`${x-1},${y}`]++ + hash[`${x-1},${y - 1}`]++ + } + } + // console.log(hash) + const res = Array(5).fill(0) + for(const [k, v] of Object.entries(hash)) { + const [x, y] = k.split(',').map(e => +e) + if(x >= 0 && y >= 0) res[v]++ + } + const sum = res.reduce((ac, e) => ac + e, 0) + res[0] = (m - 1) * (n - 1) - sum + return res +}; + +// another + /** * @param {number} m * @param {number} n From 418dc8e0a7080d06660929eed5446bd8545e4570 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Dec 2023 12:19:54 +0800 Subject: [PATCH 1578/2039] Create 2857-count-pairs-of-points-with-distance-k.js --- 2857-count-pairs-of-points-with-distance-k.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2857-count-pairs-of-points-with-distance-k.js diff --git a/2857-count-pairs-of-points-with-distance-k.js b/2857-count-pairs-of-points-with-distance-k.js new file mode 100644 index 00000000..bff65742 --- /dev/null +++ b/2857-count-pairs-of-points-with-distance-k.js @@ -0,0 +1,23 @@ +/** + * @param {number[][]} coordinates + * @param {number} k + * @return {number} + */ +const countPairs = function(coordinates, k) { + const hash = new Map() + const n = coordinates.length + let res = 0 + for(let i = 0; i < n; i++) { + const [x, y] = coordinates[i] + for(let v = 0; v <= k; v++) { + const xx = v ^ x + const yy = (k - v) ^ y + const key = `${xx},${yy}` + res += hash.get(key) || 0 + } + const kk = `${x},${y}` + hash.set(kk, (hash.get(kk) || 0) + 1) + } + + return res +}; From f56e26536535f0c1351bf01f038a9c83126a8e06 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Dec 2023 14:54:15 +0800 Subject: [PATCH 1579/2039] Create 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.js --- ...er-of-neighbors-at-a-threshold-distance.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.js diff --git a/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.js b/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.js new file mode 100644 index 00000000..d728de89 --- /dev/null +++ b/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.js @@ -0,0 +1,42 @@ +function floyd_warshall (n, edges, start) { + let d = [...Array(n)].map(() => Array(n).fill(Number.MAX_SAFE_INTEGER)) + for (const [u, v, cost] of edges) { + // UG + let c = cost == undefined ? 1 : cost + d[u][v] = d[v][u] = c + } + // for (const [u, v, cost] of edges) d[u][v] = cost == undefined ? 1 : cost; // DG + for (let i = start; i < n; i++) d[i][i] = 0 + for (let k = start; k < n; k++) { + for (let i = start; i < n; i++) { + for (let j = start; j < n; j++) { + if (d[i][j] > d[i][k] + d[k][j]) d[i][j] = d[i][k] + d[k][j] + } + } + } + return d +} +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} distanceThreshold + * @return {number} + */ +const findTheCity = function(n, edges, distanceThreshold) { + let dis = floyd_warshall(n, edges, 0), + res = [] + for (let start = 0; start < n; start++) { + let canReach = new Set() + for (let dest = 0; dest < n; dest++) { + if (start == dest) continue + if (dis[start][dest] <= distanceThreshold) canReach.add(dest) + } + res.push([start, canReach.size]) + } + res.sort((x, y) => { + if (x[1] != y[1]) return x[1] - y[1] + return y[0] - x[0] + }) + return res[0][0] +} + From ffea6bf69240c48ff3849690f7a9fbd9fd115acd Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Dec 2023 20:36:07 +0800 Subject: [PATCH 1580/2039] Update 391-perfect-rectangle.js --- 391-perfect-rectangle.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/391-perfect-rectangle.js b/391-perfect-rectangle.js index a6b001fa..d58a967f 100644 --- a/391-perfect-rectangle.js +++ b/391-perfect-rectangle.js @@ -21,3 +21,35 @@ const isRectangleCover = function(rectangles) { } return tls.size === 1 && trs.size === 1 && bls.size === 1 && brs.size === 1 } + +// another + +/** + * @param {number[][]} rectangles + * @return {boolean} + */ +var isRectangleCover = function(rectangles) { + const n = rectangles.length + const rects = rectangles, set = new Set() + let area = 0 + const p = (x, y) => `${x},${y}` + let xmin = Infinity, xmax = -Infinity, ymin = Infinity, ymax = -Infinity + for(const [x,y,a,b] of rects) { + xmin = Math.min(xmin, x) + xmax = Math.max(xmax, a) + ymin = Math.min(ymin, y) + ymax = Math.max(ymax, b) + area += (a - x) * (b - y) + const p0 = p(x,y), p1 = p(a,b),p2=p(x,b),p3=p(a,y) + if(set.has(p0)) set.delete(p0) + else set.add(p0) + if(set.has(p1)) set.delete(p1) + else set.add(p1) + if(set.has(p2)) set.delete(p2) + else set.add(p2) + if(set.has(p3)) set.delete(p3) + else set.add(p3) + } + if(set.size !== 4 || !set.has(p(xmin, ymin)) || !set.has(p(xmax, ymax)) || !set.has(p(xmin, ymax)) || !set.has(p(xmax, ymin)) ) return false + return area === (xmax - xmin) * (ymax - ymin) +}; From f6255faa2d7c3bdcea403c2dd71787a4a5ddb993 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 21 Dec 2023 11:53:43 +0800 Subject: [PATCH 1581/2039] Update 2642-design-graph-with-shortest-path-calculator.js --- ...ign-graph-with-shortest-path-calculator.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/2642-design-graph-with-shortest-path-calculator.js b/2642-design-graph-with-shortest-path-calculator.js index 2d1a48d4..41a0be10 100644 --- a/2642-design-graph-with-shortest-path-calculator.js +++ b/2642-design-graph-with-shortest-path-calculator.js @@ -77,3 +77,59 @@ Graph.prototype.shortestPath = function (node1, node2) { * obj.addEdge(edge) * var param_2 = obj.shortestPath(node1,node2) */ + +// another + +/** + * @param {number} n + * @param {number[][]} edges + */ +const Graph = function(n, edges) { + const matrix = Array.from({ length: n }, () => Array(n).fill(1e12)) + this.mat = matrix + this.n = n + for(let i = 0; i < n; i++) { + this.mat[i][i] = 0 + } + for(const [u,v,c] of edges) { + this.mat[u][v] = c + } + for(let k = 0; k < n; k++) { + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + this.mat[i][j] = Math.min(this.mat[i][j], this.mat[i][k] + this.mat[k][j]) + } + } + } +}; + +/** + * @param {number[]} edge + * @return {void} + */ +Graph.prototype.addEdge = function(edge) { + const [u, v, c] = edge + this.mat[u][v] = Math.min(this.mat[u][v], c) + const n = this.n + for(let i = 0; i < n; i++) { + for(let j = 0; j < n; j++) { + this.mat[i][j] = Math.min(this.mat[i][j], this.mat[i][u] + this.mat[v][j] + c) + } + } +}; + +/** + * @param {number} node1 + * @param {number} node2 + * @return {number} + */ +Graph.prototype.shortestPath = function(node1, node2) { + return this.mat[node1][node2] === 1e12 ? -1 : this.mat[node1][node2] +}; + +/** + * Your Graph object will be instantiated and called as such: + * var obj = new Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */ From 06d84ebf539293f35a18b3bb0b60209623c133bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Dec 2023 16:37:54 +0800 Subject: [PATCH 1582/2039] Create 2959-number-of-possible-sets-of-closing-branches.js --- ...er-of-possible-sets-of-closing-branches.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2959-number-of-possible-sets-of-closing-branches.js diff --git a/2959-number-of-possible-sets-of-closing-branches.js b/2959-number-of-possible-sets-of-closing-branches.js new file mode 100644 index 00000000..5a070465 --- /dev/null +++ b/2959-number-of-possible-sets-of-closing-branches.js @@ -0,0 +1,38 @@ +/** + * @param {number} n + * @param {number} maxDistance + * @param {number[][]} roads + * @return {number} + */ +const numberOfSets = function(n, maxDistance, roads) { + let res = 0; + for(let i = 0; i < 1 << n; i++) { + let g = Array.from({ length: n }, () => Array(n).fill(1e9)); + for(let j = 0; j < roads.length; j++) { + let [x, y, w] = roads[j]; + if((i >> x & 1) && (i >> y & 1)) { + g[x][y] = g[y][x] = Math.min(g[x][y], w); + } + } + for(let j = 0; j < n; j++) { + g[j][j] = 0; + } + for(let p = 0; p < n; p++) { + for(let q = 0; q < n; q++) { + for(let k = 0; k < n; k++) { + g[q][k] = Math.min(g[q][k], g[q][p] + g[p][k]); + } + } + } + let ok = 1; + for(let j = 0; j < n; j++) { + for(let k = 0; k < n; k++) { + if((i >> j & 1) && (i >> k & 1)) { + ok &= (g[j][k] <= maxDistance); + } + } + } + res += ok; + } + return res; +}; From 636e8e760e0e0390b2afa08cc587eab5c5866b3e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Dec 2023 19:40:44 +0800 Subject: [PATCH 1583/2039] Update 2959-number-of-possible-sets-of-closing-branches.js --- ...er-of-possible-sets-of-closing-branches.js | 56 ++++++++++--------- 1 file changed, 29 insertions(+), 27 deletions(-) diff --git a/2959-number-of-possible-sets-of-closing-branches.js b/2959-number-of-possible-sets-of-closing-branches.js index 5a070465..2c497516 100644 --- a/2959-number-of-possible-sets-of-closing-branches.js +++ b/2959-number-of-possible-sets-of-closing-branches.js @@ -5,34 +5,36 @@ * @return {number} */ const numberOfSets = function(n, maxDistance, roads) { - let res = 0; - for(let i = 0; i < 1 << n; i++) { - let g = Array.from({ length: n }, () => Array(n).fill(1e9)); - for(let j = 0; j < roads.length; j++) { - let [x, y, w] = roads[j]; - if((i >> x & 1) && (i >> y & 1)) { - g[x][y] = g[y][x] = Math.min(g[x][y], w); - } - } - for(let j = 0; j < n; j++) { - g[j][j] = 0; - } - for(let p = 0; p < n; p++) { - for(let q = 0; q < n; q++) { - for(let k = 0; k < n; k++) { - g[q][k] = Math.min(g[q][k], g[q][p] + g[p][k]); - } - } + let res = 0 + const {min} = Math + for(let i = 0, limit = 1< Array(n).fill(1e9)) + for(const [u,v,w] of roads) { + if( (1 & (i >> u)) && (1 & (i >> v))) { + mat[u][v] = mat[v][u] = min(w, mat[u][v]) + } + } + for(let x = 0; x < n; x++) mat[x][x] = 0 + + for(let k = 0; k < n; k++) { + for(let x = 0; x < n; x++) { + for(let y = 0; y < n; y++) { + mat[x][y] = min(mat[x][y], mat[x][k] + mat[k][y]) } - let ok = 1; - for(let j = 0; j < n; j++) { - for(let k = 0; k < n; k++) { - if((i >> j & 1) && (i >> k & 1)) { - ok &= (g[j][k] <= maxDistance); - } - } + } + } + + let tmp = true + for(let x = 0; x < n; x++) { + for(let y = 0; y < n; y++) { + if( (1 & (i >> x)) && (1 & (i >> y))) { + tmp &= mat[x][y] <= maxDistance } - res += ok; + } } - return res; + + res += tmp ? 1 : 0 + } + + return res }; From 17ecb6269a5568d9563e1255a72ef612630bdf3a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 23 Dec 2023 19:00:17 +0800 Subject: [PATCH 1584/2039] Update 743-network-delay-time.js --- 743-network-delay-time.js | 55 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) diff --git a/743-network-delay-time.js b/743-network-delay-time.js index bf562c67..893d1432 100644 --- a/743-network-delay-time.js +++ b/743-network-delay-time.js @@ -1,3 +1,58 @@ +/** + * @param {number[][]} times + * @param {number} n + * @param {number} k + * @return {number} + */ +const networkDelayTime = function(times, n, k) { + const g = Array.from({ length: n + 1 }, () => Array(n + 1).fill(Infinity)) + const graph = {} + for(const [u,v,w] of times) { + if(graph[u] == null) graph[u] = {} + graph[u][v] = w + g[u][v] = w + } + for(let k = 1; k <= n; k++) { + for(let i = 1; i <= n; i++) { + for(let j = 1; j <= n; j++) { + g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]) + } + } + } + + let q = [k] + const visited = new Set() + const dis = Array(n + 1).fill(Infinity) + let res = 0 + dis[k] = 0 + // console.log(g) + while(q.length) { + const size = q.length, tmp = [] + for(let i = 0; i < size; i++) { + const e = q[i] + visited.add(e) + for(let nxt of (Object.keys(graph[e] || {}) || [])) { + nxt = +nxt + if(!visited.has(nxt)) { + tmp.push(nxt) + } + if(g[e][nxt]) dis[nxt] = Math.min(dis[nxt], dis[e] + g[e][nxt]) + } + } + + q = tmp + } + // console.log(dis) + for(let i = 1; i <= n; i++) { + if(i === k) continue + res = Math.max(res, dis[i]) + } + + return visited.size === n ? res : -1 +}; + +// another + /** * @param {number[][]} times * @param {number} n From ac8208885efa3210863256501fe37e60b22bf404 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Dec 2023 13:08:32 +0800 Subject: [PATCH 1585/2039] Create 2977-minimum-cost-to-convert-string-ii.js --- 2977-minimum-cost-to-convert-string-ii.js | 78 +++++++++++++++++++++++ 1 file changed, 78 insertions(+) create mode 100644 2977-minimum-cost-to-convert-string-ii.js diff --git a/2977-minimum-cost-to-convert-string-ii.js b/2977-minimum-cost-to-convert-string-ii.js new file mode 100644 index 00000000..6246f37f --- /dev/null +++ b/2977-minimum-cost-to-convert-string-ii.js @@ -0,0 +1,78 @@ +/** + * @param {string} source + * @param {string} target + * @param {string[]} original + * @param {string[]} changed + * @param {number[]} cost + * @return {number} + */ +var minimumCost = function (source, target, original, changed, cost) { + const index = {} + original.forEach((o) => { + if (!(o in index)) { + index[o] = Object.keys(index).length + } + }) + changed.forEach((c) => { + if (!(c in index)) { + index[c] = Object.keys(index).length + } + }) + + const n = Object.keys(index).length + const dis = new Array(n) + .fill(null) + .map(() => new Array(n).fill(Number.POSITIVE_INFINITY)) + + for (let i = 0; i < cost.length; ++i) { + dis[index[original[i]]][index[changed[i]]] = Math.min( + dis[index[original[i]]][index[changed[i]]], + cost[i], + ) + } + + for (let k = 0; k < n; ++k) { + for (let i = 0; i < n; ++i) { + if (dis[i][k] < Number.POSITIVE_INFINITY) { + for (let j = 0; j < n; ++j) { + if (dis[k][j] < Number.POSITIVE_INFINITY) { + dis[i][j] = Math.min(dis[i][j], dis[i][k] + dis[k][j]) + } + } + } + } + } + + const substrLengths = new Set(original.map((o) => o.length)) + + const dp = new Array(target.length + 1).fill(Number.POSITIVE_INFINITY) + dp[0] = 0 + + for (let i = 0; i < target.length; ++i) { + if (dp[i] === Number.POSITIVE_INFINITY) { + continue + } + + if (target[i] === source[i]) { + dp[i + 1] = Math.min(dp[i + 1], dp[i]) + } + + for (const t of substrLengths) { + if (i + t >= dp.length) { + continue + } + + const subSource = source.substring(i, i + t) + const subTarget = target.substring(i, i + t) + + const c1 = subSource in index ? index[subSource] : -1 + const c2 = subTarget in index ? index[subTarget] : -1 + + if (c1 >= 0 && c2 >= 0 && dis[c1][c2] < Number.POSITIVE_INFINITY) { + dp[i + t] = Math.min(dp[i + t], dp[i] + dis[c1][c2]) + } + } + } + + return dp[dp.length - 1] !== Number.POSITIVE_INFINITY ? dp[dp.length - 1] : -1 +} From 389da8f344a4aa142180716a970bf992bf1c479c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Dec 2023 13:09:03 +0800 Subject: [PATCH 1586/2039] Create 2976-minimum-cost-to-convert-string-i.js --- 2976-minimum-cost-to-convert-string-i.js | 39 ++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2976-minimum-cost-to-convert-string-i.js diff --git a/2976-minimum-cost-to-convert-string-i.js b/2976-minimum-cost-to-convert-string-i.js new file mode 100644 index 00000000..bccec13d --- /dev/null +++ b/2976-minimum-cost-to-convert-string-i.js @@ -0,0 +1,39 @@ +/** + * @param {string} source + * @param {string} target + * @param {character[]} original + * @param {character[]} changed + * @param {number[]} cost + * @return {number} + */ +var minimumCost = function(source, target, original, changed, cost) { + const mat = Array.from({ length: 26 }, () => Array(26).fill(Number.MAX_SAFE_INTEGER)) + const a = 'a'.charCodeAt(0) + const len = cost.length + for(let i = 0; i < len; i++) { + const u = original[i].charCodeAt(0) - a + const v = changed[i].charCodeAt(0) - a + const w = cost[i] + mat[u][v] = Math.min(w, mat[u][v]) + } + for(let i = 0; i < 26; i++) mat[i][i] = 0 + + for(let k = 0; k < 26; k++) { + for(let i = 0; i < 26; i++) { + for(let j = 0; j < 26; j++) { + mat[i][j] = Math.min(mat[i][j], mat[i][k] + mat[k][j]) + } + } + } + + let res = 0 + const n = source.length + for(let i = 0; i < n; i++) { + const u = source[i].charCodeAt(0) - a + const v = target[i].charCodeAt(0) - a + if(mat[u][v] === Number.MAX_SAFE_INTEGER) return -1 + res += mat[u][v] + } + + return res +}; From a16354a1aa3f03370db14b0fb140300efa1aaa58 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Dec 2023 13:09:28 +0800 Subject: [PATCH 1587/2039] Create 2975-maximum-square-area-by-removing-fences-from-a-field.js --- ...re-area-by-removing-fences-from-a-field.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 2975-maximum-square-area-by-removing-fences-from-a-field.js diff --git a/2975-maximum-square-area-by-removing-fences-from-a-field.js b/2975-maximum-square-area-by-removing-fences-from-a-field.js new file mode 100644 index 00000000..8cca4a09 --- /dev/null +++ b/2975-maximum-square-area-by-removing-fences-from-a-field.js @@ -0,0 +1,40 @@ +/** + * @param {number} m + * @param {number} n + * @param {number[]} hFences + * @param {number[]} vFences + * @return {number} + */ +const maximizeSquareArea = function (m, n, hFences, vFences) { + hFences.sort((a, b) => a - b) + vFences.sort((a, b) => a - b) + const hSet = new Set(), + vSet = new Set() + + const mod = 10 ** 9 + 7 + + hFences.unshift(1) + hFences.push(m) + vFences.unshift(1) + vFences.push(n) + for (let i = 0; i < vFences.length; i++) { + for (let j = i + 1; j < vFences.length; j++) { + vSet.add(vFences[j] - vFences[i]) + } + } + for (let i = 0; i < hFences.length; i++) { + for (let j = i + 1; j < hFences.length; j++) { + hSet.add(hFences[j] - hFences[i]) + } + } + + let max = -1 + for (const v of vSet) { + if (hSet.has(v)) { + max = Math.max(max, v) + } + } + if (max === -1) return -1 + + return Number((BigInt(max) * BigInt(max)) % BigInt(mod)) +} From a2b78218a8b8fcf4b80f0f6dbd912d9e23e9ea3b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Dec 2023 13:09:59 +0800 Subject: [PATCH 1588/2039] Create 2974-minimum-number-game.js --- 2974-minimum-number-game.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 2974-minimum-number-game.js diff --git a/2974-minimum-number-game.js b/2974-minimum-number-game.js new file mode 100644 index 00000000..81bfdcfb --- /dev/null +++ b/2974-minimum-number-game.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var numberGame = function(nums) { + nums.sort((a, b) => a - b) + const res = [] + for(let i = 0; i < nums.length - 1; i+=2) { + const a = nums[i], b = nums[i + 1] + res.push(b, a) + } + return res +}; From cf27a137173719d67a9d1a636adf96c268aaeb6f Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Dec 2023 11:00:48 +0800 Subject: [PATCH 1589/2039] Update 407-trapping-rain-water-ii.js --- 407-trapping-rain-water-ii.js | 104 ++++++++++++++++++++++++++++++++++ 1 file changed, 104 insertions(+) diff --git a/407-trapping-rain-water-ii.js b/407-trapping-rain-water-ii.js index 21892090..31ef3c93 100644 --- a/407-trapping-rain-water-ii.js +++ b/407-trapping-rain-water-ii.js @@ -1,3 +1,107 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} +/** + * @param {number[][]} heightMap + * @return {number} + */ +const trapRainWater = function(heightMap) { + const pq = new PQ((a, b) => a[1] < b[1]) + const m = heightMap.length, n = heightMap[0].length + const visited = Array.from({ length: m }, () => Array(n).fill(false)) + for(let i = 0; i < m; i++) { + visited[i][0] = visited[i][n - 1] = true + pq.push([[i, 0], heightMap[i][0]]) + pq.push([[i, n - 1], heightMap[i][n - 1]]) + } + for(let j = 0; j < n; j++) { + visited[0][j] = visited[m - 1][j] = true + pq.push([[0, j], heightMap[0][j]]) + pq.push([[m - 1, j], heightMap[m - 1][j]]) + } + const dirs = [[1,0],[-1,0],[0,1],[0,-1]] + let res = 0 + while(!pq.isEmpty()) { + const [coord, h] = pq.pop() + const [r, c] = coord + for(const [dr, dc] of dirs) { + const nr = r + dr, nc = c + dc + if(nr >= 0 && nr < m && nc >= 0 && nc < n && !visited[nr][nc]) { + visited[nr][nc] = true + if (h > heightMap[nr][nc]) res += h - heightMap[nr][nc] + pq.push([[nr, nc], Math.max(heightMap[nr][nc], h)]) + } + } + }/* */ + return res +}; + +// another + /** * @param {number[][]} heightMap * @return {number} From 5da730d69fc66629b990c2c9dfcd14aca79ada8e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Dec 2023 12:25:36 +0800 Subject: [PATCH 1590/2039] Update 2503-maximum-number-of-points-from-grid-queries.js --- ...imum-number-of-points-from-grid-queries.js | 112 ++++++++++++++++++ 1 file changed, 112 insertions(+) diff --git a/2503-maximum-number-of-points-from-grid-queries.js b/2503-maximum-number-of-points-from-grid-queries.js index fbc8688f..af835d99 100644 --- a/2503-maximum-number-of-points-from-grid-queries.js +++ b/2503-maximum-number-of-points-from-grid-queries.js @@ -1,3 +1,115 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +/** + * @param {number[][]} grid + * @param {number[]} queries + * @return {number[]} + */ +const maxPoints = function (grid, queries) { + const m = grid.length, n = grid[0].length, k = queries.length + const q = [...queries] + const pq = new PQ((a, b) => a[1] < b[1]) + const dirs = [[0, 1],[0, -1],[1, 0],[-1,0]] + + q.sort((a, b) => a - b) + const hash = {} + const visited = Array.from({ length: m }, () => Array(n).fill(false)) + + pq.push([[0, 0], grid[0][0]]) + visited[0][0] = true + + let cnt = 0 + for(const e of q) { + while(!pq.isEmpty()) { + const [coord, v] = pq.peek() + const [r, c] = coord + if(e <= v) break + pq.pop() + for(const [dr, dc] of dirs) { + const nr = r + dr, nc = c + dc + if(nr >= 0 && nr < m && nc >= 0 && nc < n && visited[nr][nc] === false) { + visited[nr][nc] = true + pq.push([[nr, nc], grid[nr][nc]]) + } + } + cnt++ + } + + hash[e] = cnt + } +// console.log(hash) + return queries.map(e => hash[e]) +} + +// another + + /** * @param {number[][]} grid * @param {number[]} queries From 319d6cf7a3c5aaf7604d98f0d3fe171ba4946c6d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Dec 2023 19:46:54 +0800 Subject: [PATCH 1591/2039] Update 2577-minimum-time-to-visit-a-cell-in-a-grid.js --- ...-minimum-time-to-visit-a-cell-in-a-grid.js | 107 ++++++++++++++++++ 1 file changed, 107 insertions(+) diff --git a/2577-minimum-time-to-visit-a-cell-in-a-grid.js b/2577-minimum-time-to-visit-a-cell-in-a-grid.js index 05a9d259..7412633f 100644 --- a/2577-minimum-time-to-visit-a-cell-in-a-grid.js +++ b/2577-minimum-time-to-visit-a-cell-in-a-grid.js @@ -1,3 +1,110 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +/** + * @param {number[][]} grid + * @return {number} + */ +const minimumTime = function (grid) { + if (grid[0][1] > 1 && grid[1][0] > 1) return -1; + const dirs = [ + [-1, 0], + [0, 1], + [1, 0], + [0, -1], + ] + let m = grid.length, + n = grid[0].length + const visited = Array.from({ length: m }, () => Array(n).fill(false)) + const pq = new PQ((a, b) => a[0] < b[0]) + pq.push([grid[0][0], 0, 0]) + + while(!pq.isEmpty()) { + const [v, r, c] = pq.pop() + if(r === m - 1 && c === n - 1) return v + if(visited[r][c]) continue + visited[r][c] = true + for(const [dr, dc] of dirs) { + const nr = r + dr, nc = c + dc + if(nr >= 0 && nr < m && nc >= 0 && nc < n && visited[nr][nc] === false) { + const wait = (grid[nr][nc] - v) % 2 === 0 ? 1 : 0 + pq.push([Math.max(v + 1, grid[nr][nc] + wait), nr, nc]) + } + } + } + + return -1 +} + + +// another + + /** * @param {number[][]} grid * @return {number} From b8ebc090737025d7f13733593085673911ac9556 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Dec 2023 14:04:19 +0800 Subject: [PATCH 1592/2039] Update 2662-minimum-cost-of-a-path-with-special-roads.js --- ...nimum-cost-of-a-path-with-special-roads.js | 109 ++++++++++++++++++ 1 file changed, 109 insertions(+) diff --git a/2662-minimum-cost-of-a-path-with-special-roads.js b/2662-minimum-cost-of-a-path-with-special-roads.js index b1e7bb8c..648f3bd3 100644 --- a/2662-minimum-cost-of-a-path-with-special-roads.js +++ b/2662-minimum-cost-of-a-path-with-special-roads.js @@ -1,3 +1,112 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} +/** + * @param {number[]} start + * @param {number[]} target + * @param {number[][]} specialRoads + * @return {number} + */ +const minimumCost = function(start, target, specialRoads) { + const n = specialRoads.length, INF = Number.MAX_SAFE_INTEGER + + const {abs, min, max} = Math + const dis = Array(n).fill(INF) + const pq = new PQ((a,b) => a[0] < b[0]) + + let res = abs(start[0] - target[0]) + abs(start[1] - target[1]) + for(let i = 0; i < n; i++) { + const e = specialRoads[i] + const tmp = abs(e[0] - start[0]) + abs(e[1] - start[1]) + e[4] + dis[i] = tmp + pq.push([tmp, i]) + } + + while(!pq.isEmpty()) { + const [d, i] = pq.pop() + // if(d !== dis[i]) continue + res = min(res, d + abs(target[0] - specialRoads[i][2]) + abs(target[1] - specialRoads[i][3])) + + for(let nxt = 0; nxt < n; nxt++) { + const nv = abs(specialRoads[nxt][0] - specialRoads[i][2]) + abs(specialRoads[nxt][1] - specialRoads[i][3]) + specialRoads[nxt][4] + if(d + nv < dis[nxt]) { + dis[nxt] = d + nv + pq.push([dis[nxt], nxt]) + } + } + } + + return res +}; + + +// another + + /** * @param {number[]} start * @param {number[]} target From 7f83ec00993408384d090bd9eb06ecae19fa325e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Dec 2023 14:07:02 +0800 Subject: [PATCH 1593/2039] Update 2662-minimum-cost-of-a-path-with-special-roads.js --- 2662-minimum-cost-of-a-path-with-special-roads.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/2662-minimum-cost-of-a-path-with-special-roads.js b/2662-minimum-cost-of-a-path-with-special-roads.js index 648f3bd3..ecd4338c 100644 --- a/2662-minimum-cost-of-a-path-with-special-roads.js +++ b/2662-minimum-cost-of-a-path-with-special-roads.js @@ -88,7 +88,7 @@ const minimumCost = function(start, target, specialRoads) { while(!pq.isEmpty()) { const [d, i] = pq.pop() - // if(d !== dis[i]) continue + if(d > dis[i]) continue res = min(res, d + abs(target[0] - specialRoads[i][2]) + abs(target[1] - specialRoads[i][3])) for(let nxt = 0; nxt < n; nxt++) { From c349e00ce10d5f98ff3c76f9fba80b2b09680be8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 29 Dec 2023 13:15:04 +0800 Subject: [PATCH 1594/2039] Create 2699-modify-graph-edge-weights.js --- 2699-modify-graph-edge-weights.js | 146 ++++++++++++++++++++++++++++++ 1 file changed, 146 insertions(+) create mode 100644 2699-modify-graph-edge-weights.js diff --git a/2699-modify-graph-edge-weights.js b/2699-modify-graph-edge-weights.js new file mode 100644 index 00000000..49500eff --- /dev/null +++ b/2699-modify-graph-edge-weights.js @@ -0,0 +1,146 @@ +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} source + * @param {number} destination + * @param {number} target + * @return {number[][]} + */ +const modifiedGraphEdges = function (n, edges, source, destination, target) { + const kMax = Number.MAX_SAFE_INTEGER + const graph = Array(n) + .fill(null) + .map(() => []) + + for (const [u, v, w] of edges) { + if (w === -1) { + continue + } + graph[u].push([v, w]) + graph[v].push([u, w]) + } + + const distToDestination = dijkstra(graph, source, destination) + if (distToDestination < target) { + return [] + } + if (distToDestination === target) { + // Change the weights of negative edges to an impossible value. + for (const edge of edges) { + if (edge[2] === -1) { + edge[2] = kMax + } + } + return edges + } + + for (let i = 0; i < edges.length; i++) { + const [u, v, w] = edges[i] + if (w !== -1) { + continue + } + edges[i][2] = 1 + graph[u].push([v, 1]) + graph[v].push([u, 1]) + const distToDestination = dijkstra(graph, source, destination) + if (distToDestination <= target) { + edges[i][2] += target - distToDestination + // Change the weights of negative edges to an impossible value. + for (let j = i + 1; j < edges.length; j++) { + if (edges[j][2] === -1) { + edges[j][2] = kMax + } + } + return edges + } + } + + return [] +} + +function dijkstra(graph, src, dst) { + const dist = Array(graph.length).fill(Infinity) + const minHeap = new PQ((a, b) => a[0] < b[0]) + + dist[src] = 0 + minHeap.push([dist[src], src]) + + while (!minHeap.isEmpty()) { + const [d, u] = minHeap.pop() + for (const [v, w] of graph[u] || []) { + if (d + w < dist[v]) { + dist[v] = d + w + minHeap.push([dist[v], v]) + } + } + } + + return dist[dst] +} From 4c3700aed37de6a5d6187c9bf923404674a9ba58 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 29 Dec 2023 19:26:08 +0800 Subject: [PATCH 1595/2039] Update 2699-modify-graph-edge-weights.js --- 2699-modify-graph-edge-weights.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/2699-modify-graph-edge-weights.js b/2699-modify-graph-edge-weights.js index 49500eff..73626624 100644 --- a/2699-modify-graph-edge-weights.js +++ b/2699-modify-graph-edge-weights.js @@ -74,7 +74,7 @@ class PQ { * @return {number[][]} */ const modifiedGraphEdges = function (n, edges, source, destination, target) { - const kMax = Number.MAX_SAFE_INTEGER + const kMax = 1e9 const graph = Array(n) .fill(null) .map(() => []) From b93298a0d66f0ed00e3ccbc41b7816557a9178a3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 31 Dec 2023 18:49:59 +0800 Subject: [PATCH 1596/2039] Create 2791-count-paths-that-can-form-a-palindrome-in-a-tree.js --- ...hs-that-can-form-a-palindrome-in-a-tree.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 2791-count-paths-that-can-form-a-palindrome-in-a-tree.js diff --git a/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js b/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js new file mode 100644 index 00000000..797a8d80 --- /dev/null +++ b/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js @@ -0,0 +1,47 @@ +/** + * @param {number[]} parent + * @param {string} s + * @return {number} + */ +const countPalindromePaths = function (parent, s) { + let n = parent.length + let dp = Array(n).fill(undefined) + dp[0] = 0 + + function getDp(x) { + if (dp[x] != undefined) return dp[x] + dp[x] = getDp(parent[x]) ^ getMask(s[x]) + return dp[x] + } + + for (let i = 1; i < n; i++) getDp(i) + dp.sort((a, b) => a - b) + let counter = {} + let res = 0 + + for (let i = 0; i <= n; i++) { + if (counter[dp[i]]) counter[dp[i]]++ + else { + counter[dp[i]] = 1 + + if (i) { + let temp = dp[i - 1] + let cntPrev = counter[temp] + let c = 0 + + while (temp) { + let b = temp & -temp + c += counter[dp[i - 1] ^ b] ?? 0 + temp ^= b + } + + res += c * cntPrev + (cntPrev * (cntPrev - 1)) / 2 + } + } + } + + return res +} +function getMask(c) { + return 1 << (c.charCodeAt() - 97) +} From f73669b57cab48123d7b2c3a5b2f57712f504f45 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 1 Jan 2024 18:21:57 +0800 Subject: [PATCH 1597/2039] Update 2876-count-visited-nodes-in-a-directed-graph.js --- ...count-visited-nodes-in-a-directed-graph.js | 47 ++++++++++--------- 1 file changed, 25 insertions(+), 22 deletions(-) diff --git a/2876-count-visited-nodes-in-a-directed-graph.js b/2876-count-visited-nodes-in-a-directed-graph.js index 0def283d..1fc4fc24 100644 --- a/2876-count-visited-nodes-in-a-directed-graph.js +++ b/2876-count-visited-nodes-in-a-directed-graph.js @@ -2,27 +2,30 @@ * @param {number[]} edges * @return {number[]} */ -var countVisitedNodes = function(edges) { - let n = edges.length, res = new Array(n).fill(0), j = 0; - for (let i = 0; i < n; i++) { - let j = i - let seen = new Set(); - let s = []; - while (!seen.has(j) && res[j] == 0) { - seen.add(j); - s.push(j); - j = edges[j]; - } - if (seen.has(j)) { // hit the cycle - let k = s.length - s.indexOf(j); - for (j = 0; j < k; ++j) { - res[s.pop()] = k; - } - } - while (s.length) { - j = s.pop(); - res[j] = res[edges[j]] + 1; - } +const countVisitedNodes = function(edges) { + const n = edges.length, res = Array(n).fill(0) + for(let i = 0; i < n; i++) { + const visited = new Set() + let j = i, q = [] + while(res[j] === 0 && !visited.has(j)) { + q.push(j) + visited.add(j) + j = edges[j] } - return res; + + if(visited.has(j)) { + const k = q.length - q.indexOf(j) + for(let ii = 0; ii < k; ii++) { + res[q.pop()] = k + } + } + + while(q.length) { + const ii = q.pop() + res[ii] = res[edges[ii]] + 1 + } + + } + + return res }; From cbea16dbae94e4ce01bb8c374b103b785e4823f4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Jan 2024 10:35:10 +0800 Subject: [PATCH 1598/2039] Update 2831-find-the-longest-equal-subarray.js --- 2831-find-the-longest-equal-subarray.js | 28 +++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/2831-find-the-longest-equal-subarray.js b/2831-find-the-longest-equal-subarray.js index a2fdf369..c4a214cb 100644 --- a/2831-find-the-longest-equal-subarray.js +++ b/2831-find-the-longest-equal-subarray.js @@ -17,3 +17,31 @@ const longestEqualSubarray = function(nums, k) { } return maxf; }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const longestEqualSubarray = function(nums, k) { + const n = nums.length, cnt = {} + let i = 0, res = 0 + for(let j = 0; j < n; j++) { + const e = nums[j] + if(cnt[e] == null) cnt[e] = 0 + cnt[e]++ + res = Math.max(res, cnt[e]) + + while(j - i + 1 - res > k) { + const pre = nums[i] + if(cnt[pre] == null) cnt[pre] = 0 + cnt[pre]-- + i++ + res = Math.max(res, cnt[nums[i]]) + } + } + + return res +}; From aa1b47e404f504bf6b43133db0bd755d1a801540 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Jan 2024 10:47:50 +0800 Subject: [PATCH 1599/2039] Update 2831-find-the-longest-equal-subarray.js --- 2831-find-the-longest-equal-subarray.js | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/2831-find-the-longest-equal-subarray.js b/2831-find-the-longest-equal-subarray.js index c4a214cb..db23ba03 100644 --- a/2831-find-the-longest-equal-subarray.js +++ b/2831-find-the-longest-equal-subarray.js @@ -34,12 +34,11 @@ const longestEqualSubarray = function(nums, k) { cnt[e]++ res = Math.max(res, cnt[e]) - while(j - i + 1 - res > k) { + if(j - i + 1 - res > k) { const pre = nums[i] if(cnt[pre] == null) cnt[pre] = 0 cnt[pre]-- i++ - res = Math.max(res, cnt[nums[i]]) } } From 33ef71d5ba1a175ceed2222253a47b3c6bb8714e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Jan 2024 20:24:47 +0800 Subject: [PATCH 1600/2039] Update 2791-count-paths-that-can-form-a-palindrome-in-a-tree.js --- ...hs-that-can-form-a-palindrome-in-a-tree.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js b/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js index 797a8d80..4cc7ad91 100644 --- a/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js +++ b/2791-count-paths-that-can-form-a-palindrome-in-a-tree.js @@ -1,3 +1,44 @@ +/** + * @param {number[]} parent + * @param {string} s + * @return {number} + */ +const countPalindromePaths = function (parent, s) { + const n = parent.length + const nxt = Array.from({ length: n }, () => Array()) + const cnt = {0:0} + for(let i = 1; i < n; i++) { + nxt[parent[i]].push([i, s[i]]) + } + let res = 0 + dfs(0, -1, 0) + return res + + function dfs(node, parent, state) { + if(cnt[state] != null) res += cnt[state] + for(let i = 0; i < 26; i++) { + const tmp = state ^ (1 << i) + if(cnt[tmp] != null) res += cnt[tmp] + } + if(cnt[state] == null) cnt[state] = 0 + cnt[state] += 1 + + for(const [next, ch] of (nxt[node] || [])) { + if(next === parent) continue + dfs(next, node, state ^ getMask(ch)) + } + + } + +} +function getMask(c) { + const a = 'a'.charCodeAt(0) + return 1 << (c.charCodeAt(0) - a) +} + + +// another + /** * @param {number[]} parent * @param {string} s From 0105aaa6c49a9b2227acce092a86c5217060911a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Jan 2024 11:03:43 +0800 Subject: [PATCH 1601/2039] Create 2958-length-of-longest-subarray-with-at-most-k-frequency.js --- ...ngest-subarray-with-at-most-k-frequency.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 2958-length-of-longest-subarray-with-at-most-k-frequency.js diff --git a/2958-length-of-longest-subarray-with-at-most-k-frequency.js b/2958-length-of-longest-subarray-with-at-most-k-frequency.js new file mode 100644 index 00000000..a4688f63 --- /dev/null +++ b/2958-length-of-longest-subarray-with-at-most-k-frequency.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maxSubarrayLength = function(nums, k) { + const n = nums.length, cnt = {}, {max} = Math + let i = 0, res = 0 + for(let j = 0; j < n; j++) { + const e = nums[j] + if(cnt[e] == null) cnt[e] = 0 + cnt[e]++ + while(cnt[e] > k) { + const tmp = nums[i] + cnt[tmp]-- + i++ + } + res = Math.max(res, j - i + 1) + } + + return res +}; From 03326f2cd403148c57a5b1254e73d1c53eef6903 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Jan 2024 10:54:44 +0800 Subject: [PATCH 1602/2039] Update 2962-count-subarrays-where-max-element-appears-at-least-k-times.js --- ...re-max-element-appears-at-least-k-times.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/2962-count-subarrays-where-max-element-appears-at-least-k-times.js b/2962-count-subarrays-where-max-element-appears-at-least-k-times.js index c8731fea..973791cc 100644 --- a/2962-count-subarrays-where-max-element-appears-at-least-k-times.js +++ b/2962-count-subarrays-where-max-element-appears-at-least-k-times.js @@ -1,3 +1,35 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countSubarrays = function (nums, k) { + const n = nums.length + const t = Math.max(...nums) + const cnt = {0: -1} + let i = 0, num = 0 + for(let j = 0; j < n; j++) { + const e = nums[j] + if(e === t) { + num++ + cnt[num] = j + } + } + + let res = 0 + // console.log(cnt) + for(let i = k; i <= num; i++) { + const preLen = cnt[i - k + 1] - cnt[i - k] + const sufLen = n - cnt[i] + res += preLen * sufLen + } + + + return res + } + +// another + /** * @param {number[]} nums * @param {number} k From d2d5a9d2e95c13f427ce96389a9e00081c75c6dd Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Jan 2024 11:32:05 +0800 Subject: [PATCH 1603/2039] Update 2962-count-subarrays-where-max-element-appears-at-least-k-times.js --- ...re-max-element-appears-at-least-k-times.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2962-count-subarrays-where-max-element-appears-at-least-k-times.js b/2962-count-subarrays-where-max-element-appears-at-least-k-times.js index 973791cc..9b4d793f 100644 --- a/2962-count-subarrays-where-max-element-appears-at-least-k-times.js +++ b/2962-count-subarrays-where-max-element-appears-at-least-k-times.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countSubarrays = function (nums, k) { + const n = nums.length + const t = Math.max(...nums) + let i = 0, + num = 0, res = 0 + for (let j = 0; j < n; j++) { + const e = nums[j] + if (e === t) { + num++ + while(num >= k) { + if(nums[i] === t) num-- + i++ + res += n - j + } + } + } + + return res +} + +// another + /** * @param {number[]} nums * @param {number} k From 3d7932c94efa7254ba85144ba0b337b8daa3d180 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Jan 2024 12:52:59 +0800 Subject: [PATCH 1604/2039] Update 2401-longest-nice-subarray.js --- 2401-longest-nice-subarray.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/2401-longest-nice-subarray.js b/2401-longest-nice-subarray.js index 9cd9ef95..b6200957 100644 --- a/2401-longest-nice-subarray.js +++ b/2401-longest-nice-subarray.js @@ -1,3 +1,24 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const longestNiceSubarray = function (nums) { + const n = nums.length + let i = 0, mask = 0, res = 0 + for(let j = 0; j < n; j++) { + const e = nums[j] + while((mask & e) !== 0) { + mask ^= nums[i] + i++ + } + mask |= e + res = Math.max(res, j - i + 1) + } + return res +} + +// another + /** * @param {number[]} nums * @return {number} From f9c336b494ab43f867567f3147e01ab2e93852e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 6 Jan 2024 19:56:18 +0800 Subject: [PATCH 1605/2039] Update 2354-number-of-excellent-pairs.js --- 2354-number-of-excellent-pairs.js | 36 +++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/2354-number-of-excellent-pairs.js b/2354-number-of-excellent-pairs.js index b610661b..1907ddcb 100644 --- a/2354-number-of-excellent-pairs.js +++ b/2354-number-of-excellent-pairs.js @@ -1,3 +1,39 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countExcellentPairs = function(nums, k) { + const n = nums.length, set = new Set() + for(const e of nums) set.add(e) + const cnt = Array(30).fill(0) + for(const e of set) { + const bc = bitCnt(e) + if(cnt[bc] == null) cnt[bc] = 0 + cnt[bc] += 1 + } + let res = 0 + for(let i = 0; i < 30; i++) { + for(let j = 0; j < 30; j++) { + if(i + j >= k) res += cnt[i] * cnt[j] + } + } + + return res + + function bitCnt(num) { + let res = 0 + while(num) { + if(num & 1) res++ + num = num >> 1 + } + + return res + } +}; + +// another + /** * @param {number[]} nums * @param {number} k From a7ceeb164735ac2eb8a09d93b855914b4f8e4aa5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Jan 2024 10:18:56 +0800 Subject: [PATCH 1606/2039] Create 10037-maximum-size-of-a-set-after-removals.js --- 10037-maximum-size-of-a-set-after-removals.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 10037-maximum-size-of-a-set-after-removals.js diff --git a/10037-maximum-size-of-a-set-after-removals.js b/10037-maximum-size-of-a-set-after-removals.js new file mode 100644 index 00000000..29bbdb66 --- /dev/null +++ b/10037-maximum-size-of-a-set-after-removals.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +const maximumSetSize = function(nums1, nums2) { + const n = nums1.length, {min} = Math + const s1 = new Set(nums1), s2 = new Set(nums2) + const common = new Set() + for(const e of s1) { + if(s2.has(e)) common.add(e) + } + const n1 = s1.size, n2 = s2.size, c = common.size + return min(n, min(n1 - c, n / 2) + min(n2 - c, n / 2) + c) +}; From 534ab44c506bfe5572e4eb75627d91e37efa3ac6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Jan 2024 10:20:00 +0800 Subject: [PATCH 1607/2039] Create 10036-minimum-moves-to-capture-the-queen.js --- 10036-minimum-moves-to-capture-the-queen.js | 80 +++++++++++++++++++++ 1 file changed, 80 insertions(+) create mode 100644 10036-minimum-moves-to-capture-the-queen.js diff --git a/10036-minimum-moves-to-capture-the-queen.js b/10036-minimum-moves-to-capture-the-queen.js new file mode 100644 index 00000000..57cd9d85 --- /dev/null +++ b/10036-minimum-moves-to-capture-the-queen.js @@ -0,0 +1,80 @@ +/** + * @param {number} a + * @param {number} b + * @param {number} c + * @param {number} d + * @param {number} e + * @param {number} f + * @return {number} + */ +var minMovesToCaptureTheQueen = function(a, b, c, d, e, f) { + if(rook() || bishop()) return 1 + + return 2 + + function rook() { + if(a === e) { + const min = Math.min(b,f), max = Math.max(b,f) + if(c !== a) return true + else if(d < min || d > max) return true + else return false + } + if(b === f) { + const min = Math.min(a,e), max = Math.max(a,e) + if(d !== b) return true + else if(c < min || c > max) return true + else return false + } + + return false + } + function bishop() { + // c,d,e,f + + const dirs = [[-1, -1], [-1, 1], [1, -1], [1, 1]] + const visited = new Set() + const target = `${e},${f}` + const key = (x, y) => `${x},${y}` + + const ss = new Set() + // top-left + let x = c, y = d + let dd = dirs[0] + while(x + dd[0]>= 1 && x + dd[0]<= 8 && y+ dd[1] >= 1 && y+dd[1] <= 8 && (!(x + dd[0] === a && y +dd[1] === b))) { + ss.add(key(x +dd[0], y +dd[1])) + x += dd[0] + y += dd[1] + } + + // top-right + x = c, y = d + dd = dirs[1] + while(x + dd[0]>= 1 && x + dd[0]<= 8 && y+ dd[1] >= 1 && y+dd[1] <= 8 && (!(x + dd[0] === a && y +dd[1] === b))) { + ss.add(key(x +dd[0], y +dd[1])) + x += dd[0] + y += dd[1] + } + + // bottom-left + x = c, y = d + dd = dirs[2] + while(x + dd[0]>= 1 && x + dd[0]<= 8 && y+ dd[1] >= 1 && y+dd[1] <= 8 && (!(x + dd[0] === a && y +dd[1] === b))) { + ss.add(key(x +dd[0], y +dd[1])) + x += dd[0] + y += dd[1] + } + + // bottom-right + x = c, y = d + dd = dirs[3] + while(x + dd[0]>= 1 && x + dd[0]<= 8 && y+ dd[1] >= 1 && y+dd[1] <= 8 && (!(x + dd[0] === a && y +dd[1] === b))) { + ss.add(key(x +dd[0], y +dd[1])) + x += dd[0] + y += dd[1] + } + if(ss.has(target)) return true + + + return false + } +}; From c9105de39c1d8bbecae6f04f6e1d4a4fd25f32c7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Jan 2024 10:20:40 +0800 Subject: [PATCH 1608/2039] Create 10035-maximum-area-of-longest-diagonal-rectangle.js --- 10035-maximum-area-of-longest-diagonal-rectangle.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 10035-maximum-area-of-longest-diagonal-rectangle.js diff --git a/10035-maximum-area-of-longest-diagonal-rectangle.js b/10035-maximum-area-of-longest-diagonal-rectangle.js new file mode 100644 index 00000000..42991b15 --- /dev/null +++ b/10035-maximum-area-of-longest-diagonal-rectangle.js @@ -0,0 +1,11 @@ +/** + * @param {number[][]} dimensions + * @return {number} + */ +var areaOfMaxDiagonal = function(dimensions) { + let res = 0 + const n = dimensions + const arr = dimensions.map(([l,w]) => [l ** 2 + w ** 2, l * w]) + arr.sort((a, b) => a[0] === b[0] ? b[1] - a[1] : b[0] - a[0]) + return arr[0][1] +}; From ae9cbce3188145a39706828341c786f79e143651 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Jan 2024 12:38:20 +0800 Subject: [PATCH 1609/2039] Update 2461-maximum-sum-of-distinct-subarrays-with-length-k.js --- ...sum-of-distinct-subarrays-with-length-k.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) diff --git a/2461-maximum-sum-of-distinct-subarrays-with-length-k.js b/2461-maximum-sum-of-distinct-subarrays-with-length-k.js index 932c8383..a9700555 100644 --- a/2461-maximum-sum-of-distinct-subarrays-with-length-k.js +++ b/2461-maximum-sum-of-distinct-subarrays-with-length-k.js @@ -1,3 +1,40 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumSubarraySum = function(nums, k) { + let res = 0, i = 0, sum = 0 + const map = new Map(), n = nums.length + for(let j = 0; j < k; j++) { + const e = nums[j] + if(map.get(e) == null) map.set(e, 0) + map.set(e, (map.get(e) || 0) + 1) + sum += e + } + if(map.size === k) res = sum + for(let j = k; j < n; j++) { + const e = nums[j] + if(map.get(e) == null) map.set(e, 0) + map.set(e, (map.get(e) || 0) + 1) + sum += e + + // pre + const tmp = nums[i] + map.set(tmp, map.get(tmp) - 1) + if(map.get(tmp) === 0) map.delete(tmp) + sum -= tmp + i++ + + if(map.size === k) res = Math.max(res, sum) + } + + return res +}; + +// another + + /** * @param {number[]} nums * @param {number} k From 4cfe2550d381efe8c41501f6d224b6234191cad0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 10 Jan 2024 11:53:37 +0800 Subject: [PATCH 1610/2039] Update 2516-take-k-of-each-character-from-left-and-right.js --- ...k-of-each-character-from-left-and-right.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/2516-take-k-of-each-character-from-left-and-right.js b/2516-take-k-of-each-character-from-left-and-right.js index f917b2db..3ef81ae2 100644 --- a/2516-take-k-of-each-character-from-left-and-right.js +++ b/2516-take-k-of-each-character-from-left-and-right.js @@ -1,3 +1,45 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const takeCharacters = function(s, k) { + const n = s.length + const cnt = Array(3).fill(0) + const a = 'a'.charCodeAt(0) + for(const ch of s) { + cnt[ch.charCodeAt(0) - a]++ + } + const target = Array(3).fill(0) + for(let i = 0; i < 3; i++) { + target[i] = cnt[i] - k + } + for(let e of target) { + if(e < 0) return -1 + } + const arr = Array(3).fill(0) + let res = 0 + let i = 0 + for(let j = 0; j < n; j++) { + const idx = s[j].charCodeAt(0) - a + arr[idx]++ + while(!valid()) { + const ii = s[i].charCodeAt(0) - a + arr[ii]-- + i++ + } + res = Math.max(res, j - i + 1) + } + + return n - res + + function valid() { + return arr.every((e, i) => e <= target[i]) + } +}; + +// another + /** * @param {string} s * @param {number} k From c254636462a74e979ef08c8c8f6378c021cad9d2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Jan 2024 10:19:43 +0800 Subject: [PATCH 1611/2039] Update 1838-frequency-of-the-most-frequent-element.js --- ...-frequency-of-the-most-frequent-element.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1838-frequency-of-the-most-frequent-element.js b/1838-frequency-of-the-most-frequent-element.js index b57a76f9..1be16f31 100644 --- a/1838-frequency-of-the-most-frequent-element.js +++ b/1838-frequency-of-the-most-frequent-element.js @@ -1,3 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maxFrequency = function(nums, k) { + nums.sort((a, b) => a - b) + let res = 1 + const n = nums.length + let i = 0, sum = 0 + for(let j = 1; j < n; j++) { + const e = nums[j] + const delta = e - nums[j - 1] + sum += (j - i) * delta + while(sum > k) { + sum -= e - nums[i] + i++ + } + res = Math.max(res, j - i + 1) + } + + + return res +}; + +// another + + /** * @param {number[]} nums * @param {number} k From 5d926374125fe692c745324a8606f33010aa1051 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Jan 2024 12:59:30 +0800 Subject: [PATCH 1612/2039] Update 2953-count-complete-substrings.js --- 2953-count-complete-substrings.js | 74 +++++++++++++++++++++++++++++++ 1 file changed, 74 insertions(+) diff --git a/2953-count-complete-substrings.js b/2953-count-complete-substrings.js index 74632582..fedf13a6 100644 --- a/2953-count-complete-substrings.js +++ b/2953-count-complete-substrings.js @@ -1,3 +1,77 @@ +/** + * @param {string} word + * @param {number} k + * @return {number} + */ +const countCompleteSubstrings = function(word, k) { + const arr = [], { abs } = Math + const n = word.length + const code = ch => ch.charCodeAt(0) + let i = 0 + if(n === 1) arr.push(word) + for(let j = 1; j < n; j++) { + const pre = j - 1 + if(abs(word[j].charCodeAt(0) - word[pre].charCodeAt(0)) > 2) { + arr.push(word.slice(i, j)) + i = j + } + if(j === n - 1) { + arr.push(word.slice(i)) + } + } + // console.log(arr) + let res = 0 + for(const str of arr) { + if(str === '') continue + res += helper(str) + } + + return res + + + function helper(str) { + let res = 0 + const n = str.length, a = code('a') + + for(let i = 1; i <= 26; i++) { + const len = i * k + const arr = Array(26).fill(0) + let pre = 0 + for(let j = 0; j < len && j < n; j++) { + const idx = code(str[j]) - a + arr[idx]++ + } + if(valid(arr, i)) res++ + + for(let j = len; j < n; j++) { + const idx = code(str[j]) - a + arr[idx]++ + const preIdx = code(str[pre]) - a + arr[preIdx]-- + if(valid(arr, i)) res++ + pre++ + } + } + + return res + } + + function valid(arr, num) { + let cnt = 0 + for(const e of arr) { + if(e === 0) continue + if(e !== k) return false + else cnt++ + } + + if(cnt !== num) return false + return true + } +}; + +// another + + /** * @param {string} word * @param {number} k From 97a9003857dac7076ba7229d0d941fbde03280e3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Jan 2024 11:45:34 +0800 Subject: [PATCH 1613/2039] Update 2967-minimum-cost-to-make-array-equalindromic.js --- ...inimum-cost-to-make-array-equalindromic.js | 53 +++++++++++++++++++ 1 file changed, 53 insertions(+) diff --git a/2967-minimum-cost-to-make-array-equalindromic.js b/2967-minimum-cost-to-make-array-equalindromic.js index 2ec531c4..4a4ca258 100644 --- a/2967-minimum-cost-to-make-array-equalindromic.js +++ b/2967-minimum-cost-to-make-array-equalindromic.js @@ -1,3 +1,56 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minimumCost = function (nums) { + nums.sort((a, b) => a - b) + const n = nums.length + const median = nums[Math.floor(n / 2)] + + // Helper function to find the next palindromic number greater than or equal to x + const getNextPalindromic = (x) => { + while (true) { + const strX = String(x) + const revStrX = strX.split('').reverse().join('') + if (strX === revStrX) return x + x++ + } + } + + // Helper function to find the previous palindromic number smaller than or equal to x + const getPrevPalindromic = (x) => { + while (true) { + const strX = String(x) + const revStrX = strX.split('').reverse().join('') + if (strX === revStrX) return x + x-- + } + } + + const candidate1 = getNextPalindromic(median) + const candidate2 = getPrevPalindromic(median) + + let cost1 = 0 + let cost2 = 0 + + // Calculate the cost for candidate1 + for (const num of nums) { + cost1 += Math.abs(num - candidate1) + } + + // Calculate the cost for candidate2 + for (const num of nums) { + cost2 += Math.abs(num - candidate2) + } + + // Return the minimum cost between candidate1 and candidate2 + return Math.min(cost1, cost2) +} + +// another + + + /** * @param {number[]} nums * @return {number} From 99c1c16ddb5ce1919247b1bf52f0a752b190e942 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Jan 2024 13:59:58 +0800 Subject: [PATCH 1614/2039] Update 564-find-the-closest-palindrome.js --- 564-find-the-closest-palindrome.js | 82 ++++++++++++++++++++++++++++++ 1 file changed, 82 insertions(+) diff --git a/564-find-the-closest-palindrome.js b/564-find-the-closest-palindrome.js index 8c12f73c..54db51cb 100644 --- a/564-find-the-closest-palindrome.js +++ b/564-find-the-closest-palindrome.js @@ -1,3 +1,85 @@ +/** + * @param {string} n + * @return {string} + */ +const nearestPalindromic = function(n) { + const {floor} = Math + const str = num => `${num}` + const a = makeSmaller(n), b = makeGreater(n) + // console.log(a, b) + if(delta(b, n) >= delta(n, a)) { + return a + } + return b + + function makeGreater(num) { + const n = num.length + const arr = num.split('') + for(let i = 0, j = n - 1; i <= j;) { + arr[j] = arr[i] + i++ + j-- + } + const tmp = arr.join('') + // console.log(tmp) + if(tmp > num) return tmp + let carry = 1 + + for(let i = floor((n - 1) / 2); i >= 0; i--) { + const cur = +arr[i] + carry + if(cur <= 9) { + arr[i] = str(cur) + carry = 0 + } else { + arr[i] = '0' + carry = 1 + } + arr[n - 1 - i] = arr[i] + } + if(carry) { + const ta = Array(n + 1).fill('0') + ta[0] = '1' + ta[ta.length - 1] = '1' + return ta.join('') + } + return arr.join('') + } + + function makeSmaller(num) { + const n = num.length + const arr = num.split('') + for(let i = 0, j = n - 1; i <= j;) { + arr[j] = arr[i] + i++ + j-- + } + const tmp = arr.join('') + if(tmp < num) return tmp + let carry = 1 + for(let i = floor((n - 1) / 2); i >= 0; i--) { + const cur = +arr[i] - carry + if(cur >= 0) { + arr[i] = str(cur) + carry = 0 + } else { + arr[i] = '9' + carry = 1 + } + arr[n - 1 - i] = arr[i] + } + if(arr[0] === '0' && n > 1) { + return '9'.repeat(n - 1) + } + return arr.join('') + } + function delta(a, b) { + return BigInt(a) - BigInt(b) + } +}; + +// another + + /** * @param {bigint | string} n * @return {string} From 0a92c98cf30e2c339c9af4e3da5cd5cc682a7294 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Jan 2024 14:44:42 +0800 Subject: [PATCH 1615/2039] Create 3008-find-beautiful-indices-in-the-given-array-ii.js --- ...beautiful-indices-in-the-given-array-ii.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3008-find-beautiful-indices-in-the-given-array-ii.js diff --git a/3008-find-beautiful-indices-in-the-given-array-ii.js b/3008-find-beautiful-indices-in-the-given-array-ii.js new file mode 100644 index 00000000..64d5e414 --- /dev/null +++ b/3008-find-beautiful-indices-in-the-given-array-ii.js @@ -0,0 +1,40 @@ +/** + * @param {string} s + * @param {string} a + * @param {string} b + * @param {number} k + * @return {number[]} + */ +var beautifulIndices = function (s, a, b, k) { + let res = [] + let v1 = [] + let v2 = [] + getPatternMatchingIndex(s, a, v1) + getPatternMatchingIndex(s, b, v2) + for (let i = 0, j = 0; i < v1.length; i++) { + while (j < v2.length && v1[i] > v2[j] && Math.abs(v1[i] - v2[j]) > k) { + j++ + } + if (j < v2.length && Math.abs(v1[i] - v2[j]) <= k) { + res.push(v1[i]) + } + } + return res +} + +function getPatternMatchingIndex(s, a, v) { + let t = a + '@' + s + let lps = [0] + for (let i = 1; i < t.length; i++) { + let ind = lps[i - 1] + while (ind > 0 && t[ind] !== t[i]) { + ind = lps[ind - 1] + } + lps.push(t[ind] === t[i] ? ind + 1 : 0) + } + for (let i = 0; i < lps.length; i++) { + if (lps[i] === a.length) { + v.push(i - 2 * a.length) + } + } +} From 338cd2ca135327306b940081b3d4e3d2f7e952d0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Jan 2024 19:18:55 +0800 Subject: [PATCH 1616/2039] Update 330-patching-array.js --- 330-patching-array.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/330-patching-array.js b/330-patching-array.js index 7b101bf8..295d8b70 100644 --- a/330-patching-array.js +++ b/330-patching-array.js @@ -1,3 +1,25 @@ +/** + * @param {number[]} nums + * @param {number} n + * @return {number} + */ +const minPatches = function(nums, n) { + let sum = 1, res = 0, i = 0 + while(sum <= n) { + if(i < nums.length && nums[i] <= sum) { + sum += nums[i] + i++ + } else { + res++ + sum *= 2 + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} n From 62a6e737a706754c0591deaccc74c017923c433f Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 17 Jan 2024 12:58:17 +0800 Subject: [PATCH 1617/2039] Update 1798-maximum-number-of-consecutive-values-you-can-make.js --- ...mber-of-consecutive-values-you-can-make.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/1798-maximum-number-of-consecutive-values-you-can-make.js b/1798-maximum-number-of-consecutive-values-you-can-make.js index 3f896373..2aee0b58 100644 --- a/1798-maximum-number-of-consecutive-values-you-can-make.js +++ b/1798-maximum-number-of-consecutive-values-you-can-make.js @@ -11,3 +11,26 @@ const getMaximumConsecutive = function(coins) { } return res; }; + +// another + +/** + * @param {number[]} coins + * @return {number} + */ +const getMaximumConsecutive = function(coins) { + coins.sort((a, b) => a - b) + let sum = 1, res = 1, i = 0 + while(true) { + const e = coins[i] + if(i >= coins.length) break + if(e <= sum) { + sum += e + i++ + } else { + break + } + } + + return sum +}; From 1402d71851fb27dea0736fdec65836fdcc26756e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 Jan 2024 18:46:04 +0800 Subject: [PATCH 1618/2039] Update 2952-minimum-number-of-coins-to-be-added.js --- 2952-minimum-number-of-coins-to-be-added.js | 25 +++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/2952-minimum-number-of-coins-to-be-added.js b/2952-minimum-number-of-coins-to-be-added.js index e106e731..a2d2e7d5 100644 --- a/2952-minimum-number-of-coins-to-be-added.js +++ b/2952-minimum-number-of-coins-to-be-added.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} coins + * @param {number} target + * @return {number} + */ +const minimumAddedCoins = function(coins, target) { + coins.sort((a,b) => a - b) + const n = coins.length + let sum = 1, i = 0, res = 0 + while(true) { + const e = coins[i] + if(sum > target) break + if(e <= sum) { + sum += e + i++ + } else { + sum *= 2 + res++ + } + } + return res +}; + +// another + /** * @param {number[]} coins * @param {number} target From 68809b798b037183439bf3a4027647af8337b204 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 19 Jan 2024 14:45:36 +0800 Subject: [PATCH 1619/2039] Create 2957-remove-adjacent-almost-equal-characters.js --- ...remove-adjacent-almost-equal-characters.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 2957-remove-adjacent-almost-equal-characters.js diff --git a/2957-remove-adjacent-almost-equal-characters.js b/2957-remove-adjacent-almost-equal-characters.js new file mode 100644 index 00000000..f3d6b9b6 --- /dev/null +++ b/2957-remove-adjacent-almost-equal-characters.js @@ -0,0 +1,19 @@ +/** + * @param {string} word + * @return {number} + */ +var removeAlmostEqualCharacters = function(word) { + const n = word.length, { abs } = Math + + let res = 0 + for(let i = 1; i < n;) { + const delta = abs(word.charCodeAt(i) - word.charCodeAt(i - 1)) + if(delta <= 1) { + res++ + i += 2 + } else i++ + + } + + return res +}; From fc8d8417df096c28563f212fc48334a04bc64306 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Jan 2024 18:21:31 +0800 Subject: [PATCH 1620/2039] Create 2983-palindrome-rearrangement-queries.js --- 2983-palindrome-rearrangement-queries.js | 70 ++++++++++++++++++++++++ 1 file changed, 70 insertions(+) create mode 100644 2983-palindrome-rearrangement-queries.js diff --git a/2983-palindrome-rearrangement-queries.js b/2983-palindrome-rearrangement-queries.js new file mode 100644 index 00000000..291d8bfe --- /dev/null +++ b/2983-palindrome-rearrangement-queries.js @@ -0,0 +1,70 @@ +function canMakePalindromeQueries(s, queries) { + const n = s.length + // Prefix sum (difference) + const psd = [0] + for (let i = 0, j = n - 1; i < j; i++, j--) { + psd.push(psd[psd.length - 1] + (s[i] !== s[j] ? 1 : 0)) + } + // Prefix sum (count) + const cnt = new Array(26).fill(0) + const psc = [cnt.slice()] + for (const c of s) { + cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)]++ + psc.push([...cnt]) + } + const ans = [] + for (const q of queries) { + const a1 = q[0], + b1 = q[1] + 1, + a2 = n - q[0], + b2 = n - 1 - q[1] + const c1 = q[2], + d1 = q[3] + 1, + c2 = n - q[2], + d2 = n - 1 - q[3] + // No difference allowed outside the query ranges + if ( + (min(a1, d2) && psd[min(a1, d2)]) || + (n / 2 > max(b1, c2) && psd[Math.floor(n / 2)] - psd[max(b1, c2)]) || + (d2 > b1 && psd[d2] - psd[b1]) || + (a1 > c2 && psd[a1] - psd[c2]) + ) { + ans.push(false) + } else { + // Intersection of query ranges in the lower half must equate to that in the upper half + const ix1 = psc[d1].map((val, i) => val - (psc[c1][i] || 0)) + const ix2 = psc[b1].map((val, i) => val - (psc[a1][i] || 0)) + if (a1 > d2) { + ix1.forEach( + (val, i) => (ix1[i] -= psc[Math.min(a1, c2)][i] - (psc[d2][i] || 0)), + ) + } + if (c2 > b1) { + ix1.forEach( + (val, i) => (ix1[i] -= psc[c2][i] - (psc[Math.max(b1, d2)][i] || 0)), + ) + } + if (c1 > b2) { + ix2.forEach( + (val, i) => (ix2[i] -= psc[Math.min(c1, a2)][i] - (psc[b2][i] || 0)), + ) + } + if (a2 > d1) { + ix2.forEach( + (val, i) => (ix2[i] -= psc[a2][i] - (psc[Math.max(d1, b2)][i] || 0)), + ) + } + ans.push(ix1.every((val, i) => val >= 0 && val === ix2[i])) + } + } + return ans +} + +// Helper functions +function min(a, b) { + return a < b ? a : b +} + +function max(a, b) { + return a > b ? a : b +} From 954c7ef1bf591f2257f8714cc66a20ddcc05f540 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Jan 2024 15:23:07 +0800 Subject: [PATCH 1621/2039] Update 452-minimum-number-of-arrows-to-burst-balloons.js --- ...imum-number-of-arrows-to-burst-balloons.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/452-minimum-number-of-arrows-to-burst-balloons.js b/452-minimum-number-of-arrows-to-burst-balloons.js index c47b87fa..bd476101 100644 --- a/452-minimum-number-of-arrows-to-burst-balloons.js +++ b/452-minimum-number-of-arrows-to-burst-balloons.js @@ -1,3 +1,25 @@ +/** + * @param {number[][]} points + * @return {number} + */ +const findMinArrowShots = function(points) { + const n = points.length + if(n === 0) return 0 + points.sort((a, b) => a[1] - b[1]) + let res = 1 + let end = points[0][1] + + for(let i = 1; i < n; i++) { + if(end >= points[i][0]) continue + res++ + end = points[i][1] + } + + return res +}; + +// another + /** * @param {number[][]} points * @return {number} From 4f95c59b19e449adb5f75d8be5f84ad3fd81908c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 23 Jan 2024 13:49:57 +0800 Subject: [PATCH 1622/2039] Update 646-maximum-length-of-pair-chain.js --- 646-maximum-length-of-pair-chain.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/646-maximum-length-of-pair-chain.js b/646-maximum-length-of-pair-chain.js index ec50ac9d..9ec23294 100755 --- a/646-maximum-length-of-pair-chain.js +++ b/646-maximum-length-of-pair-chain.js @@ -1,3 +1,26 @@ +/** + * @param {number[][]} pairs + * @return {number} + */ +const findLongestChain = function(pairs) { + let res = 0 + const n = pairs.length + if(n === 0) return res + pairs.sort((a, b) => a[1] - b[1]) + let end = pairs[0][1] + res++ + for(let i = 1; i < n; i++) { + const e = pairs[i] + if(e[0] <= end) continue + res++ + end = e[1] + } + + return res +}; + +// another + /** * @param {number[][]} pairs * @return {number} From 8c45c2d3d3794c8ebbd9893e8130254c20966da3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Jan 2024 13:07:30 +0800 Subject: [PATCH 1623/2039] Update 1024-video-stitching.js --- 1024-video-stitching.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/1024-video-stitching.js b/1024-video-stitching.js index fdc1b195..2ce978c9 100644 --- a/1024-video-stitching.js +++ b/1024-video-stitching.js @@ -1,3 +1,34 @@ +/** + * @param {number[][]} clips + * @param {number} time + * @return {number} + */ +const videoStitching = function(clips, time) { + const n = clips.length + if(time === 0) return 0 + clips.sort((a, b) => a[0] === b[0] ? b[1] - a[1] : a[0] - b[0]) + let res = 0, start = 0, end = 0, nextEnd = 0, idx = 0 + + while(idx < n) { + nextEnd = end + while(idx < n && clips[idx][0] <= end) { + nextEnd = Math.max(nextEnd, clips[idx][1]) + idx++ + } + res++ + if(nextEnd >= time) return res + else if(nextEnd === end) return -1 + else { + end = nextEnd + } + } + + return -1 + +}; + +// anonther + /** * @param {number[][]} clips * @param {number} T From b3f79499eeb5dc62ddcab1acc9ab3c7da753f8c5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Jan 2024 15:24:33 +0800 Subject: [PATCH 1624/2039] Update 757-set-intersection-size-at-least-two.js --- 757-set-intersection-size-at-least-two.js | 31 +++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/757-set-intersection-size-at-least-two.js b/757-set-intersection-size-at-least-two.js index c89077ec..1675a247 100644 --- a/757-set-intersection-size-at-least-two.js +++ b/757-set-intersection-size-at-least-two.js @@ -1,3 +1,34 @@ +/** + * @param {number[][]} intervals + * @return {number} + */ +const intersectionSizeTwo = function (intervals) { + if (intervals.length === 1) return 2 + intervals.sort((a, b) => (a[1] !== b[1] ? a[1] - b[1] : b[0] - a[0])) + let right = intervals[0][1] + let left = right - 1 + let res = 2 + + for (let i = 1, len = intervals.length; i < len; i++) { + const cur = intervals[i] + if(cur[0] <= left) continue + else if(cur[0] <= right) { + res++ + left = right + right = cur[1] + } else { + res += 2 + right = cur[1] + left = right - 1 + } + } + + return res +} + +// another + + /** * @param {number[][]} intervals * @return {number} From c3919bccce04c9fad5d02ffdfcbc2785715b4880 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 26 Jan 2024 11:52:22 +0800 Subject: [PATCH 1625/2039] Update 1326-minimum-number-of-taps-to-open-to-water-a-garden.js --- ...umber-of-taps-to-open-to-water-a-garden.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/1326-minimum-number-of-taps-to-open-to-water-a-garden.js b/1326-minimum-number-of-taps-to-open-to-water-a-garden.js index e228bae1..1acc085e 100644 --- a/1326-minimum-number-of-taps-to-open-to-water-a-garden.js +++ b/1326-minimum-number-of-taps-to-open-to-water-a-garden.js @@ -1,3 +1,35 @@ +/** + * @param {number} n + * @param {number[]} ranges + * @return {number} + */ +const minTaps = function(n, ranges) { + const len = ranges.length, {min, max} = Math + const arr = [] + for(let i = 0; i < len; i++) { + arr.push([max(0, i - ranges[i]), i + ranges[i]]) + } + // arr.sort((a, b) => a[1] === b[1] ? a[0] - b[0]: a[1] - b[1]) + arr.sort((a, b) => a[0] === b[0] ? b[1] - a[1] : a[0] - b[0]) + let res = 0, end = 0, nextEnd = 0, idx = 0 + while(idx < len) { + nextEnd = end + while(idx < len && arr[idx][0] <= end) { + nextEnd = max(nextEnd, arr[idx][1]) + idx++ + } + res++ + if(nextEnd >= n) return res + else if(nextEnd === end) return -1 + end = nextEnd + } + + + return -1 +}; + +// another + /** * @param {number} n * @param {number[]} ranges From f181b21783dcc1abf429b0be03b5be1613e08b8e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Jan 2024 11:01:20 +0800 Subject: [PATCH 1626/2039] Create 3020-find-the-maximum-number-of-elements-in-subset.js --- ...he-maximum-number-of-elements-in-subset.js | 62 +++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 3020-find-the-maximum-number-of-elements-in-subset.js diff --git a/3020-find-the-maximum-number-of-elements-in-subset.js b/3020-find-the-maximum-number-of-elements-in-subset.js new file mode 100644 index 00000000..d2d6f16f --- /dev/null +++ b/3020-find-the-maximum-number-of-elements-in-subset.js @@ -0,0 +1,62 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maximumLength = function (nums) { + const um = new Map() + + for (const val of nums) { + if (um.has(val)) { + um.set(val, um.get(val) + 1) + } else { + um.set(val, 1) + } + } + + if (um.size === 1) { + return 1 + } + + let cnt = 0 + let res = 1 + + for (const [key, value] of um) { + // .5 = 1/2 which is square root + let fnd = Math.pow(key, 0.5) + cnt = 1 + + // yha condition greate than equal 2 isiliye rkha + // to avoid the infinite loop as use calculator + // and find root(2)->root(root(2))...so on + // it will never end + while (fnd >= 2) { + if (um.has(fnd)) { + if (um.get(fnd) >= 2) { + cnt += 2 + } else { + break + } + fnd = Math.pow(fnd, 0.5) + } else { + break + } + } + + res = Math.max(res, cnt) + cnt = 0 + } + + let maxi = 0 + if (um.has(1)) { + maxi = um.get(1) + } + + if (maxi > ans) { + if (maxi & 1) { + return maxi + } + return maxi - 1 + } + + return res +} From fce30493b482ec5828530a4e4a7f6e0f5ad11424 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Jan 2024 11:02:22 +0800 Subject: [PATCH 1627/2039] Create 3019-number-of-changing-keys.js --- 3019-number-of-changing-keys.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 3019-number-of-changing-keys.js diff --git a/3019-number-of-changing-keys.js b/3019-number-of-changing-keys.js new file mode 100644 index 00000000..0d18c3a5 --- /dev/null +++ b/3019-number-of-changing-keys.js @@ -0,0 +1,12 @@ +/** + * @param {string} s + * @return {number} + */ +var countKeyChanges = function(s) { + const ss = s.toLowerCase() + let res = 0 + for(let i = 1;i < ss.length; i++) { + if(ss[i] !== ss[i - 1]) res++ + } + return res +}; From 621186f209612960abb5349eaa73f17e3e538de3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Jan 2024 11:03:04 +0800 Subject: [PATCH 1628/2039] Create 3021-alice-and-bob-playing-flower-game.js --- 3021-alice-and-bob-playing-flower-game.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 3021-alice-and-bob-playing-flower-game.js diff --git a/3021-alice-and-bob-playing-flower-game.js b/3021-alice-and-bob-playing-flower-game.js new file mode 100644 index 00000000..b201a348 --- /dev/null +++ b/3021-alice-and-bob-playing-flower-game.js @@ -0,0 +1,22 @@ +/** + * @param {number} n + * @param {number} m + * @return {number} + */ +var flowerGame = function(n, m) { + let res = 0 + let oddNum = 0, evenNum = 0 + let oddNum1 = 0, evenNum1 = 0 + for(let i = 1; i <= n; i++) { + if(i % 2 === 1) oddNum++ + else evenNum++ + } + for(let i = 1; i <= m; i++) { + if(i % 2 === 1) oddNum1++ + else evenNum1++ + } + res += oddNum * evenNum1 + res += evenNum * oddNum1 + + return res +}; From e39ae144d171a0244c7cff17a907d3bd972beea1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Jan 2024 11:07:12 +0800 Subject: [PATCH 1629/2039] Create 3022-minimize-or-of-remaining-elements-using-operations.js --- ...-of-remaining-elements-using-operations.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 3022-minimize-or-of-remaining-elements-using-operations.js diff --git a/3022-minimize-or-of-remaining-elements-using-operations.js b/3022-minimize-or-of-remaining-elements-using-operations.js new file mode 100644 index 00000000..f82b89ba --- /dev/null +++ b/3022-minimize-or-of-remaining-elements-using-operations.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minOrAfterOperations = function(nums, k) { + let n = nums.length; //length of the array + let res = 0; //this will contain the 'or' of all final elements of array + + //Iterating from MSB to LSB + for (let j = 30; j >= 0; j--) + { + let cnt = 0; //count of elements which have 0 at jth bit + + //we will do & of all elements and store it here in 'cur' variable + let cur = (1 << 30) - 1; //this is basically all last 30 bits set to 1 + + let target = res | ((1 << j) - 1); //jth bit is set 0 here, and bits from 0 to (j-1)th index are set to 1 + + for (let x of nums) + { + cur &= x; + if ((cur | target) == target) + { + cnt++; + cur = (1 << 30) - 1; + } + } + + //we have to keep the jth bit if (n-cnt) is greater than k otherwise we can remove jth bit in less than or equal to k operations + if (n - cnt > k) + { + res |= (1 << j); + } + } + return res; +}; From 6fbb9a2697cdccecdd668e51e88a49dc66d43a00 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Jan 2024 19:57:21 +0800 Subject: [PATCH 1630/2039] Update 2589-minimum-time-to-complete-all-tasks.js --- 2589-minimum-time-to-complete-all-tasks.js | 35 ++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/2589-minimum-time-to-complete-all-tasks.js b/2589-minimum-time-to-complete-all-tasks.js index 6999599c..9f9f7cb8 100644 --- a/2589-minimum-time-to-complete-all-tasks.js +++ b/2589-minimum-time-to-complete-all-tasks.js @@ -1,3 +1,38 @@ +/** + * @param {number[][]} tasks + * @return {number} + */ +const findMinimumTime = function(tasks) { + tasks.sort((a, b) => a[1] - b[1]) + const {max} = Math + let maxEnd = -1 + for(const [s,e,d] of tasks) maxEnd = max(maxEnd, e) + const arr = Array(maxEnd + 1).fill(0) + const n = tasks.length + + for(let i = 0; i < n; i++) { + let [s, e, d] = tasks[i] + let overlap = 0 + for(let j = e; j >= s; j--) { + if(arr[j]) overlap++ + } + if(overlap >= d) continue + let diff = d - overlap + for(let j = e; j >= s; j--) { + if(arr[j] === 0) { + diff-- + arr[j] = 1 + } else continue + if(diff === 0) break + } + + } + + return arr.reduce((ac, e) => ac + e, 0) +}; + +// another + /** * @param {number[][]} tasks * @return {number} From 6965e203eb119f334e26657b392385e765053b50 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 31 Jan 2024 12:19:35 +0800 Subject: [PATCH 1631/2039] Create 1012-numbers-with-repeated-digits.js --- 1012-numbers-with-repeated-digits.js | 32 ++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 1012-numbers-with-repeated-digits.js diff --git a/1012-numbers-with-repeated-digits.js b/1012-numbers-with-repeated-digits.js new file mode 100644 index 00000000..d033da97 --- /dev/null +++ b/1012-numbers-with-repeated-digits.js @@ -0,0 +1,32 @@ +/** + * @param {number} n + * @return {number} + */ +var numDupDigitsAtMostN = function(n) { + const digits = [], {floor} = Math + let tmp = n + 1 + while(tmp) { + digits.push(tmp % 10) + tmp = floor(tmp / 10) + } + let res = 0 + const len = digits.length + let cur = 9 + for(let i = 0; i < len - 1; i++) { + res += cur + cur *= (9 - i) + } + cur = floor(cur / 9) + const seen = Array(10).fill(false) + for(let i = 0; i < len; i++) { + const d = digits[len - i - 1] + for(let j = (i === 0 ? 1 : 0); j < d; j++) { + if(!seen[j]) res += cur + } + cur = floor(cur / (9 - i)) + if(seen[d]) break + seen[d] = true + } + + return n - res +}; From eba8608f42d26a7c908a92a4b19e00721e6e6567 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 31 Jan 2024 16:10:14 +0800 Subject: [PATCH 1632/2039] Update 1012-numbers-with-repeated-digits.js --- 1012-numbers-with-repeated-digits.js | 64 ++++++++++++++++++++++++++++ 1 file changed, 64 insertions(+) diff --git a/1012-numbers-with-repeated-digits.js b/1012-numbers-with-repeated-digits.js index d033da97..dec2580e 100644 --- a/1012-numbers-with-repeated-digits.js +++ b/1012-numbers-with-repeated-digits.js @@ -1,3 +1,67 @@ +/** + * @param {number} n + * @return {number} + */ +function numDupDigitsAtMostN(n) { + let numNoDupDigits = 0; // the number of positive integers less than or equal to n with no repeated digits + + let lst = Array.from(String(n), Number); + let n_digits = lst.length; + + // if n = 8765, lst = [8,7,6,5], + // the number without repeated digit can the the following format: + // XXX + // XX + // X + for (let i = 1; i < n_digits; i++) { + // the number of i digits without repeated digit + // the leading digit cannot be 0 + numNoDupDigits += 9 * perm(9, i - 1); + } + + // and + // 1XXX ~ 7XXX + // 80XX ~ 86XX + // 870X ~ 875X + // 8760 ~ 8764 + let seen = new Set(); + for (let i = 0; i < lst.length; i++) { + let x = lst[i]; + for (let y = (i === 0 ? 1 : 0); y < x; y++) { + if (!seen.has(y)) { + // the leading digit used - y + // for the remaining positions we cannot use digits in set seen and y + numNoDupDigits += perm(9 - i, n_digits - i - 1); + } + } + if (seen.has(x)) { + break; + } + seen.add(x); + } + + // and + // 8765 + if (n_digits === new Set(lst).size) { + numNoDupDigits += 1; + } + + return n - numNoDupDigits; +} + +function perm(m, n) { + let res = 1 + for(let i = 0; i < n; i++) { + res *= m + m-- + } + + return res +} + +// another + + /** * @param {number} n * @return {number} From 792201ab7816a595e2e42bc4aebc5d17820d4aa0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Feb 2024 13:06:15 +0800 Subject: [PATCH 1633/2039] Update 2801-count-stepping-numbers-in-range.js --- 2801-count-stepping-numbers-in-range.js | 76 +++++++++++++++++++++++++ 1 file changed, 76 insertions(+) diff --git a/2801-count-stepping-numbers-in-range.js b/2801-count-stepping-numbers-in-range.js index 8fbb85c9..27af38b6 100644 --- a/2801-count-stepping-numbers-in-range.js +++ b/2801-count-stepping-numbers-in-range.js @@ -1,3 +1,79 @@ +/** + * @param {string} low + * @param {string} high + * @return {number} + */ +var countSteppingNumbers = function (low, high) { + const mod = 1000000007 + let init = () => new Array(101) + .fill(null) + .map(() => + new Array(2) + .fill(null) + .map(() => new Array(2).fill(null).map(() => new Array(11).fill(-1))), + ) +// console.log(dp) + const helper = (pos, tight, isZero, prevDigit, s) => { + if (pos === s.length) { + if (isZero) return 0 + return 1 + } + + if (dp[pos][tight][isZero][prevDigit + 1] !== -1) + return dp[pos][tight][isZero][prevDigit + 1] + + let res = 0 + let limit + + if (tight) limit = parseInt(s[pos]) + else limit = 9 + + for (let curDigit = 0; curDigit <= limit; curDigit++) { + let newTight = tight + if (tight && curDigit < limit) newTight = 0 + + let willBeZero = isZero + if (isZero && curDigit > 0) willBeZero = 0 + + if (isZero) { + res += helper(pos + 1, newTight, willBeZero, curDigit, s) + res %= mod + } else { + if (Math.abs(curDigit - prevDigit) === 1) { + res += helper(pos + 1, newTight, willBeZero, curDigit, s) + res %= mod + } + } + } + + dp[pos][tight][isZero][prevDigit + 1] = res + return res + } + let dp = init() + let l = helper(0, 1, 1, -1, low) + + dp = init() + let r = helper(0, 1, 1, -1, high) + + let res = r - l + res = (res + mod) % mod + + let add = true + for (let i = 1; i < low.length; i++) { + if (Math.abs(low[i] - low[i - 1]) !== 1) { + add = false + break + } + } + if (add) res++ + + res %= mod + return res +} + +// another + + const minus_mod = (x, y, mod) => ((x - y) % mod + mod) % mod; const mod = 1e9 + 7, ll = BigInt; let memo; From d8606e1d1373516540ef97dbb3c11fb7f51040ef Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 3 Feb 2024 17:40:34 +0800 Subject: [PATCH 1634/2039] Create 2827-number-of-beautiful-integers-in-the-range.js --- ...mber-of-beautiful-integers-in-the-range.js | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 2827-number-of-beautiful-integers-in-the-range.js diff --git a/2827-number-of-beautiful-integers-in-the-range.js b/2827-number-of-beautiful-integers-in-the-range.js new file mode 100644 index 00000000..1d2b4390 --- /dev/null +++ b/2827-number-of-beautiful-integers-in-the-range.js @@ -0,0 +1,54 @@ +/** + * @param {number} low + * @param {number} high + * @param {number} k + * @return {number} + */ +const numberOfBeautifulIntegers = function (low, high, k) { + const memo = new Map(); + + function dp(index, diff, isLimit, isZero, numStr, m) { + if (index === numStr.length) { + return Number(isZero) & (diff === 0) & (m === 0); + } + + const memoKey = `${index}-${diff}-${isLimit ? 1 : 0}-${isZero ? 1 : 0}-${numStr}-${m}`; + if (memo.has(memoKey)) { + return memo.get(memoKey); + } + + let res = 0; + if (!isZero) { + res = dp(index + 1, diff, false, false, numStr, m); + } + const bound = isLimit ? parseInt(numStr[index]) : 9; + + for (let d = 1 - Number(isZero); d <= bound; d++) { + if (d % 2 === 1) { + res += dp( + index + 1, + diff + 1, + isLimit && d === bound, + true, + numStr, + (m + d * Math.pow(10, numStr.length - index - 1)) % k + ); + } else { + res += dp( + index + 1, + diff - 1, + isLimit && d === bound, + true, + numStr, + (m + d * Math.pow(10, numStr.length - index - 1)) % k + ); + } + } + + memo.set(memoKey, res); + return res; + } + + return dp(0, 0, true, false, String(high), 0) - dp(0, 0, true, false, String(low - 1), 0); +} + From 3a2a0ba455e4d640b0a86745dca41673e5bfee7a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Feb 2024 17:50:30 +0800 Subject: [PATCH 1635/2039] Create 2999-count-the-number-of-powerful-integers.js --- 2999-count-the-number-of-powerful-integers.js | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 2999-count-the-number-of-powerful-integers.js diff --git a/2999-count-the-number-of-powerful-integers.js b/2999-count-the-number-of-powerful-integers.js new file mode 100644 index 00000000..1a2b8079 --- /dev/null +++ b/2999-count-the-number-of-powerful-integers.js @@ -0,0 +1,54 @@ +/** + * @param {number} num + * @param {number} limit + * @param {string} s + */ +function adjust(num, limit, s) { + let sn = parseInt(s); + let sufMod = 10 ** s.length; + + let suf = num % sufMod; + num = Math.floor(num / sufMod); + if (suf < sn) --num; + + if (num <= 0) return num + 1; + + let sNum = num.toString(); + let res = sNum.charCodeAt(0) - 48; + let tight = 1; + if (res > limit) { + return (limit + 1) ** sNum.length; + } + + for (let i = 1; i < sNum.length; ++i) { + res *= (limit + 1); + + if (tight) { + let c = sNum.charCodeAt(i) - 48; + if (c > limit) { + tight = 0; + res += limit + 1; + } + else { + res += c; + } + } + } + + return res + tight; +} +/** + * @param {number} start + * @param {number} finish + * @param {number} limit + * @param {string} s + * @return {number} + */ +var numberOfPowerfulInt = function (start, finish, limit, s) { + --start; + + let ss = adjust(start, limit, s); + let ff = adjust(finish, limit, s); + + return ff - ss; +}; From 7d586db5b2712dfb0cf27d116c762d05007e27ec Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 5 Feb 2024 19:52:02 +0800 Subject: [PATCH 1636/2039] Update 233-number-of-digit-one.js --- 233-number-of-digit-one.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/233-number-of-digit-one.js b/233-number-of-digit-one.js index 82678200..d3df405e 100644 --- a/233-number-of-digit-one.js +++ b/233-number-of-digit-one.js @@ -1,3 +1,33 @@ +/** + * @param {number} n + * @return {number} + */ +const countDigitOne = function(n) { + let res = 0 + const s = `${n}` + const len = s.length, {floor, pow} = Math + + for(let i = 1; i <= len; i++) { + const np = pow(10, i - 1) + const pre = floor(n / pow(10, i)) + const remain = n % np + + res += pre * np + const e = +s[len - i] + if(e > 1) { + res += np + } else if(e === 1) { + res += remain + 1 + } + } + + return res +}; + + +// another + + /** * @param {number} n * @return {number} From f16a5720a6ee8c1866ca37b1bcd2c5fc30048250 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 15 Feb 2024 16:44:14 +0800 Subject: [PATCH 1637/2039] Update 1367-linked-list-in-binary-tree.js --- 1367-linked-list-in-binary-tree.js | 54 ++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) diff --git a/1367-linked-list-in-binary-tree.js b/1367-linked-list-in-binary-tree.js index 41e48b07..c1dd0e33 100644 --- a/1367-linked-list-in-binary-tree.js +++ b/1367-linked-list-in-binary-tree.js @@ -1,3 +1,57 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * 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 {ListNode} head + * @param {TreeNode} root + * @return {boolean} + */ +const isSubPath = function(head, root) { + return dfs(root) + + function dfs(node) { + if(node == null) return false + if(head.val === node.val) { + let cur = head + let q = [node] + while(q.length) { + const v = cur.val + const tmp = [] + let mark = false + for(const e of q) { + if(e.val === v) { + mark = true + if(e.left) tmp.push(e.left) + if(e.right) tmp.push(e.right) + } + } + if(cur && !mark) break + cur = cur.next + if(cur == null) return true + q = tmp + } + } + return dfs(node.left) || dfs(node.right) + } + +}; + + +// another + + /** * Definition for singly-linked list. * function ListNode(val, next) { From 8f765dca185da2e5bef0c22e61dc7feae743b3d7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 15 Feb 2024 23:08:03 +0800 Subject: [PATCH 1638/2039] Update 1367-linked-list-in-binary-tree.js --- 1367-linked-list-in-binary-tree.js | 60 ++++++++++++++++++++++++++++++ 1 file changed, 60 insertions(+) diff --git a/1367-linked-list-in-binary-tree.js b/1367-linked-list-in-binary-tree.js index c1dd0e33..f186049e 100644 --- a/1367-linked-list-in-binary-tree.js +++ b/1367-linked-list-in-binary-tree.js @@ -1,3 +1,63 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * 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 {ListNode} head + * @param {TreeNode} root + * @return {boolean} + */ +function isSubPath(head, root) { + let needle = convertLinkedListToArray(head); + let lps = computeKMPTable(needle); + return kmpSearch(root, 0); + + function kmpSearch(i, j) { + if (j === needle.length) return true; + if (i === null) return false; + while (j > 0 && i.val !== needle[j]) j = lps[j - 1]; + if (i.val === needle[j]) j++; + return kmpSearch(i.left, j) || kmpSearch(i.right, j); + } + + function computeKMPTable(pattern) { + let n = pattern.length; + let lps = new Array(n); + for (let i = 0; i < n; i++) { + lps[i] = 0; + } + for (let i = 1, j = 0; i < n; i++) { + while (j > 0 && pattern[i] !== pattern[j]) j = lps[j - 1]; + if (pattern[i] === pattern[j]) lps[i] = ++j; + } + return lps; + } + + function convertLinkedListToArray(head) { + let list = []; + while (head !== null) { + list.push(head.val); + head = head.next; + } + return list; + } +} + + +// another + + /** * Definition for singly-linked list. * function ListNode(val, next) { From 2adc62ba1d11a7e1c1febb12e08f1f1c5c08449c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Feb 2024 14:36:06 +0800 Subject: [PATCH 1639/2039] Update 1764-form-array-by-concatenating-subarrays-of-another-array.js --- ...oncatenating-subarrays-of-another-array.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/1764-form-array-by-concatenating-subarrays-of-another-array.js b/1764-form-array-by-concatenating-subarrays-of-another-array.js index 1fd9fc52..c8013442 100644 --- a/1764-form-array-by-concatenating-subarrays-of-another-array.js +++ b/1764-form-array-by-concatenating-subarrays-of-another-array.js @@ -1,3 +1,59 @@ +/** + * @param {number[][]} groups + * @param {number[]} nums + * @return {boolean} + */ +const canChoose = function (groups, nums) { + const dp = new Array(1000).fill(0) + const lsps = preprocess(groups) + let cur = 0 + for (let i = 0; i < groups.length; i++) { + if (cur >= nums.length) return false + cur = find(nums, cur, groups[i], lsps[i]) + if (cur === -1) return false + cur += groups[i].length + } + return true + function find(nums, cur, p, lsp) { + const n = nums.length + dp[cur] = p[0] === nums[cur] ? 1 : 0 + if (lsp.length === 1 && dp[cur] === 1) { + return cur + } + for (let i = cur + 1; i < n; i++) { + let j = dp[i - 1] + while (j > 0 && p[j] !== nums[i]) { + j = lsp[j - 1] + } + dp[i] = j + (p[j] === nums[i]) + if (dp[i] === p.length) { + return i - p.length + 1 + } + } + return -1 + } + + function preprocess(groups) { + const rets = [] + for (let g of groups) { + const n = g.length + const dp = new Array(n) + dp[0] = 0 + for (let i = 1; i < n; i++) { + let j = dp[i - 1] + while (j > 0 && g[j] !== g[i]) { + j = dp[j - 1] + } + dp[i] = j + (g[j] === g[i] ? 1 : 0) + } + rets.push(dp) + } + return rets + } +} + +// another + /** * @param {number[][]} groups * @param {number[]} nums From 0367f0526c19f2d26fe3389e574ead2aec4599e6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 17 Feb 2024 12:31:45 +0800 Subject: [PATCH 1640/2039] Create 2301-match-substring-after-replacement.js --- 2301-match-substring-after-replacement.js | 39 +++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 2301-match-substring-after-replacement.js diff --git a/2301-match-substring-after-replacement.js b/2301-match-substring-after-replacement.js new file mode 100644 index 00000000..8d2d3a0f --- /dev/null +++ b/2301-match-substring-after-replacement.js @@ -0,0 +1,39 @@ +let adj = new Uint8Array(3844); + +/** + * @param {string} ch + */ +function encode(ch) { + let c = ch.charCodeAt(); + if (c >= 97) return c - 97; + if (c >= 65) return c - 39; + return c + 4; +} + +/** + * @param {string} s + * @param {string} sub + * @param {character[][]} mappings + * @return {boolean} + */ +var matchReplacement = function (s, sub, mappings) { + let n = s.length; + let m = sub.length; + + adj.fill(0); + for (let [cf, ct] of mappings) { + adj[encode(cf) * 62 + encode(ct)] = 1; + }; + for (let i = 0; i < 62; ++i) { + adj[i * 62 + i] = 1; + } + + for (let l = n - m; l >= 0; --l) { + for (let d = 0, r = l; ; ++d, ++r) { + if (d == m) return true; + if (!adj[encode(sub[d]) * 62 + encode(s[r])]) break; + } + } + + return false; +}; From e9909d19d87b253ac927b915861b5a69862fe213 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 17 Feb 2024 14:42:13 +0800 Subject: [PATCH 1641/2039] Update 2301-match-substring-after-replacement.js --- 2301-match-substring-after-replacement.js | 41 +++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/2301-match-substring-after-replacement.js b/2301-match-substring-after-replacement.js index 8d2d3a0f..1e507b5e 100644 --- a/2301-match-substring-after-replacement.js +++ b/2301-match-substring-after-replacement.js @@ -1,3 +1,44 @@ +/** + * @param {string} ch + */ +function encode(ch) { + let c = ch.charCodeAt(0) + const a = 'a'.charCodeAt(0) + const A = 'A'.charCodeAt(0) + const zero = '0'.charCodeAt(0) + if (c >= a) return c - a; + if (c >= A) return c - A + 26; + return c - zero + 52; +} + +/** + * @param {string} s + * @param {string} sub + * @param {character[][]} mappings + * @return {boolean} + */ +const matchReplacement = function (s, sub, mappings) { + const adj = Array(62 * 62).fill(0) + const m = s.length, n = sub.length + for(const ch of sub) adj[encode(ch) * 62 + encode(ch)] = 1 + for(const [f, t] of mappings) { + adj[encode(f) * 62 + encode(t)] = 1 + } + + for(let i = m - n; i >= 0; i--) { + for(let si = i, j = 0;; si++, j++) { + if(j === n) return true + if(adj[encode(sub[j]) * 62 + encode(s[si])] === 0) break + } + } + + return false +}; + + +// another + + let adj = new Uint8Array(3844); /** From d7d00a1ebe953862f8a288dfd7b54240a69cd96d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 17 Feb 2024 22:52:15 +0800 Subject: [PATCH 1642/2039] Update 28-implement-strStr().js --- 28-implement-strStr().js | 41 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/28-implement-strStr().js b/28-implement-strStr().js index 98513914..5bd5a760 100755 --- a/28-implement-strStr().js +++ b/28-implement-strStr().js @@ -1,3 +1,44 @@ +/** + * @param {string} haystack + * @param {string} needle + * @return {number} + */ +const strStr = function(haystack, needle) { + const m = haystack.length, n = needle.length + + const lps = process(needle) + for(let j = 0, i = 0; i < m; i++) { + while(j > 0 && haystack[i] !== needle[j]) { + j = lps[j - 1] + } + if(haystack[i] === needle[j]) { + j++ + if(j === n) { + return i - n + 1 + } + } + } + return -1 + + function process(s) { + const n = s.length + const lps = Array(n).fill(0) + for(let len = 0, i = 1; i < n; i++) { + while(len > 0 && s[i] !== s[len]) { + len = lps[len - 1] + } + if(s[i] === s[len]) { + len++ + lps[i] = len + } + } + + return lps + } +}; + +// another + /** * @param {string} haystack * @param {string} needle From bfe549824590f6cbd7988c9c37b4fbcd41a28930 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Feb 2024 16:49:02 +0800 Subject: [PATCH 1643/2039] Create 3045-count-prefix-and-suffix-pairs-ii.js --- 3045-count-prefix-and-suffix-pairs-ii.js | 59 ++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 3045-count-prefix-and-suffix-pairs-ii.js diff --git a/3045-count-prefix-and-suffix-pairs-ii.js b/3045-count-prefix-and-suffix-pairs-ii.js new file mode 100644 index 00000000..ace89667 --- /dev/null +++ b/3045-count-prefix-and-suffix-pairs-ii.js @@ -0,0 +1,59 @@ +class Trie { + constructor() { + this.word = null + this.children = new Array(27) + this.cnt = 0 + } +} +/** + * @param {string[]} words + * @return {number} + */ +var countPrefixSuffixPairs = function (words) { + const M = 31 + let rt1 = new Trie() + let rt2 = new Trie() + let res = 0 + + for (let w of words) { + res += addAndCount(w) + } + + return res + + function addAndCount(w) { + let res = 0 + let pre = rt1 + let suf = rt2 + let n = w.length + + for (let i = 0; i < n; i++) { + let a = w.charAt(i) + let b = w.charAt(n - 1 - i) + + if (!pre.children[a.charCodeAt() & M]) { + pre.children[a.charCodeAt() & M] = new Trie() + } + if (!suf.children[b.charCodeAt() & M]) { + suf.children[b.charCodeAt() & M] = new Trie() + } + + pre = pre.children[a.charCodeAt() & M] + suf = suf.children[b.charCodeAt() & M] + + if (pre.word && suf.word === pre.word) { + res += pre.cnt + } + } + + if (!pre.word) { + pre.word = w + suf.word = w + } + + pre.cnt++ + suf.cnt++ + + return res + } +} From 53acb6e096713ef43d53312ecf48ecdbd67d4e1f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Feb 2024 16:49:42 +0800 Subject: [PATCH 1644/2039] Create 3044-most-frequent-prime.js --- 3044-most-frequent-prime.js | 61 +++++++++++++++++++++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 3044-most-frequent-prime.js diff --git a/3044-most-frequent-prime.js b/3044-most-frequent-prime.js new file mode 100644 index 00000000..8b7fde30 --- /dev/null +++ b/3044-most-frequent-prime.js @@ -0,0 +1,61 @@ +/** + * @param {number[][]} mat + * @return {number} + */ +var mostFrequentPrime = function (mat) { + const DIRS = [ + [1, 1], + [1, -1], + [-1, 1], + [-1, -1], + [1, 0], + [0, 1], + [-1, 0], + [0, -1], + ] + + const m = mat.length + const n = mat[0].length + const f = new Map() + + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + for (const d of DIRS) { + let t = 0 + for ( + let k = i, l = j; + k >= 0 && k < m && l >= 0 && l < n; + k += d[0], l += d[1] + ) { + t = t * 10 + mat[k][l] + f.set(t, (f.get(t) || 0) + 1) + } + } + } + } + + let res = -1 + let maxF = 0 + + for (const [val, freq] of f.entries()) { + if (val <= 10) continue + if (freq >= maxF && isPrime(val)) { + if (freq === maxF) { + res = Math.max(res, val) + } else { + res = val + } + maxF = freq + } + } + + return res +} +function isPrime(N) { + if (N < 2) return false + const R = Math.sqrt(N) + for (let d = 2; d <= R; ++d) { + if (N % d === 0) return false + } + return true +} From 3ddbefa738d3a6d844ff9e95b87b08b28f8788f4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Feb 2024 16:50:17 +0800 Subject: [PATCH 1645/2039] Create 3043-find-the-length-of-the-longest-common-prefix.js --- ...the-length-of-the-longest-common-prefix.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 3043-find-the-length-of-the-longest-common-prefix.js diff --git a/3043-find-the-length-of-the-longest-common-prefix.js b/3043-find-the-length-of-the-longest-common-prefix.js new file mode 100644 index 00000000..266ae19a --- /dev/null +++ b/3043-find-the-length-of-the-longest-common-prefix.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @return {number} + */ +var longestCommonPrefix = function (arr1, arr2) { + let f = new Set() + for (let i of arr1) { + for (; i > 0; i = Math.floor(i / 10)) { + f.add(i) + } + } + let res = 0 + for (let i of arr2) { + for (; i > 0; i = Math.floor(i / 10)) { + if (f.has(i)) { + res = Math.max(res, i.toString().length) + break + } + } + } + return res +} From 35937bcc5d29d58412a81529a14e538750c66742 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Feb 2024 16:50:57 +0800 Subject: [PATCH 1646/2039] Create 3042-count-prefix-and-suffix-pairs-i.js --- 3042-count-prefix-and-suffix-pairs-i.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 3042-count-prefix-and-suffix-pairs-i.js diff --git a/3042-count-prefix-and-suffix-pairs-i.js b/3042-count-prefix-and-suffix-pairs-i.js new file mode 100644 index 00000000..576bdace --- /dev/null +++ b/3042-count-prefix-and-suffix-pairs-i.js @@ -0,0 +1,23 @@ +/** + * @param {string[]} words + * @return {number} + */ +var countPrefixSuffixPairs = function (words) { + let count = 0 + for (let i = 0; i < words.length; i++) { + for (let j = i + 1; j < words.length; j++) { + let str1 = words[i] + let str2 = words[j] + if (isPrefixAndSuffix(str1, str2)) { + count++ + } + } + } + return count + function isPrefixAndSuffix(s1, s2) { + if (s2.startsWith(s1) && s2.endsWith(s1)) { + return true + } + return false + } +} From 4399d7f95a9359b44f8850d31aa843e1547e4f25 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 Feb 2024 18:13:57 +0800 Subject: [PATCH 1647/2039] Update 2851-string-transformation.js --- 2851-string-transformation.js | 67 +++++++++++++++++++++++++++++++++++ 1 file changed, 67 insertions(+) diff --git a/2851-string-transformation.js b/2851-string-transformation.js index 7becb586..84013a0f 100644 --- a/2851-string-transformation.js +++ b/2851-string-transformation.js @@ -1,3 +1,70 @@ +/** + * @param {string} s + * @param {string} t + * @param {number} k + * @return {number} + */ +const numberOfWays = function (s, t, k) { + const n = s.length, + M = 1e9 + 7 + const pos = kmp(s + s.slice(0, n-1), t) + const fk = [0, 0] + calcFK() + + let res = 0 + for (let p of pos) { + if (p === 0) res = (res + fk[0]) % M + else res = (res + fk[1]) % M + } + return res + + function kmp(s, t) { + const m = s.length, + n = t.length + const pi = new Array(n).fill(0) + for (let i = 1; i < n; ++i) { + let j = pi[i - 1] + while (j > 0 && t.charAt(j) !== t.charAt(i)) j = pi[j - 1] + if (j === 0 && t.charAt(0) !== t.charAt(i)) pi[i] = 0 + else pi[i] = j + 1 + } + let j = 0 + const res = [] + for (let i = 0; i < m; ++i) { + while (j >= n || (j > 0 && s.charAt(i) !== t.charAt(j))) j = pi[j - 1] + if (s.charAt(i) === t.charAt(j)) j++ + if (j === n) res.push(i - n + 1) + } + return res + } + + function calcFK() { + fk[1] = + (((powWrap(n - 1, k, M) + BigInt(((k % 2) * 2 - 1)) + BigInt(M)) % BigInt(M)) * powWrap(n, M - 2, M)) % BigInt(M) + fk[0] = (fk[1] - BigInt(((k % 2) * 2 - 1)) + BigInt(M)) % BigInt(M) + // console.log(fk) + fk[1] = Number(fk[1]) + fk[0] = Number(fk[0]) + } + + function powWrap(a,b,M) { + a = BigInt(a) + b = BigInt(b) + M = BigInt(M) + return pow(a,b,M) + } + + function pow(a, b, M) { + if (b === 0n) return 1n + if ((b & 1n) === 0n) return pow((a * a) % M, b >> 1n, M) + return (a * pow((a * a) % M, b >> 1n, M)) % M + } +} + + +// another + + class Modulo { /** * @param {number} modulo From ab956d281c390762fe7687a513801061bc2fc40a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Feb 2024 18:00:33 +0800 Subject: [PATCH 1648/2039] Update 3008-find-beautiful-indices-in-the-given-array-ii.js --- ...beautiful-indices-in-the-given-array-ii.js | 82 +++++++++++++++++++ 1 file changed, 82 insertions(+) diff --git a/3008-find-beautiful-indices-in-the-given-array-ii.js b/3008-find-beautiful-indices-in-the-given-array-ii.js index 64d5e414..578fdaf5 100644 --- a/3008-find-beautiful-indices-in-the-given-array-ii.js +++ b/3008-find-beautiful-indices-in-the-given-array-ii.js @@ -1,3 +1,85 @@ +/** + * @param {string} s + * @param {string} a + * @param {string} b + * @param {number} k + * @return {number[]} + */ +var beautifulIndices = function (s, a, b, k) { + const is = kmp(s, a) + if (is.length === 0) return [] + + const js = kmp(s, b) + if (js.length === 0) return [] + + const answer = [] + let p = 0 + let q = 0 + + while (p < is.length && q < js.length) { + const distance = Math.abs(is[p] - js[q]) + + if (distance <= k) { + answer.push(is[p]) + p++ + } else if (is[p] < js[q]) { + p++ + } else { + q++ + } + } + + return answer +} + +function kmp(str1, str2) { + const pattern = buildPattern(str2) + + const answer = [] + let i = 0 + let j = 0 + + while (i < str1.length) { + if (str1[i] === str2[j]) { + i++ + j++ + + if (j === str2.length) { + answer.push(i - str2.length) + j = pattern[j - 1] + 1 + } + } else if (j > 0) { + j = pattern[j - 1] + 1 + } else { + i++ + } + } + + return answer +} + +function buildPattern(str) { + const pattern = new Array(str.length).fill(-1) + let i = 1 + let j = 0 + + while (i < str.length) { + if (str[i] === str[j]) { + pattern[i] = j + i++ + j++ + } else if (j > 0) { + j = pattern[j - 1] + 1 + } else { + i++ + } + } + + return pattern +} + +// another + /** * @param {string} s * @param {string} a From 95411efab64452837f3e7cfddbc551aa422ef825 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Feb 2024 18:49:56 +0800 Subject: [PATCH 1649/2039] Update 3008-find-beautiful-indices-in-the-given-array-ii.js --- ...beautiful-indices-in-the-given-array-ii.js | 24 +++++++++---------- 1 file changed, 12 insertions(+), 12 deletions(-) diff --git a/3008-find-beautiful-indices-in-the-given-array-ii.js b/3008-find-beautiful-indices-in-the-given-array-ii.js index 578fdaf5..905ac00b 100644 --- a/3008-find-beautiful-indices-in-the-given-array-ii.js +++ b/3008-find-beautiful-indices-in-the-given-array-ii.js @@ -12,7 +12,7 @@ var beautifulIndices = function (s, a, b, k) { const js = kmp(s, b) if (js.length === 0) return [] - const answer = [] + const res = [] let p = 0 let q = 0 @@ -20,7 +20,7 @@ var beautifulIndices = function (s, a, b, k) { const distance = Math.abs(is[p] - js[q]) if (distance <= k) { - answer.push(is[p]) + res.push(is[p]) p++ } else if (is[p] < js[q]) { p++ @@ -29,13 +29,13 @@ var beautifulIndices = function (s, a, b, k) { } } - return answer + return res } function kmp(str1, str2) { const pattern = buildPattern(str2) - const answer = [] + const res = [] let i = 0 let j = 0 @@ -43,33 +43,32 @@ function kmp(str1, str2) { if (str1[i] === str2[j]) { i++ j++ - if (j === str2.length) { - answer.push(i - str2.length) - j = pattern[j - 1] + 1 + res.push(i - str2.length) + j = pattern[j - 1] } } else if (j > 0) { - j = pattern[j - 1] + 1 + j = pattern[j - 1] } else { i++ } } - return answer + return res } function buildPattern(str) { - const pattern = new Array(str.length).fill(-1) + const pattern = new Array(str.length).fill(0) let i = 1 let j = 0 while (i < str.length) { if (str[i] === str[j]) { + j++ pattern[i] = j i++ - j++ } else if (j > 0) { - j = pattern[j - 1] + 1 + j = pattern[j - 1] } else { i++ } @@ -78,6 +77,7 @@ function buildPattern(str) { return pattern } + // another /** From 88d23b08c684c98f34a4455f02595a050ba3bc90 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Feb 2024 20:06:58 +0800 Subject: [PATCH 1650/2039] Create 3031-minimum-time-to-revert-word-to-initial-state-ii.js --- ...time-to-revert-word-to-initial-state-ii.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 3031-minimum-time-to-revert-word-to-initial-state-ii.js diff --git a/3031-minimum-time-to-revert-word-to-initial-state-ii.js b/3031-minimum-time-to-revert-word-to-initial-state-ii.js new file mode 100644 index 00000000..6906f960 --- /dev/null +++ b/3031-minimum-time-to-revert-word-to-initial-state-ii.js @@ -0,0 +1,20 @@ +/** + * @param {string} word + * @param {number} k + * @return {number} + */ +var minimumTimeToInitialState = function(word, k) { + const n = word.length; + let v = 0; + let dp = new Array(n).fill(0); + for (let i = 1; i < n; i++) { + while (v > 0 && word.charAt(i) != word.charAt(v)) { + v = dp[v - 1]; + } + v = dp[i] = v + (word.charAt(i) == word.charAt(v) ? 1 : 0); + } + while (v > 0 && (n - v) % k > 0) { + v = dp[v - 1]; + } + return Math.ceil((n - v) / k); +}; From a96b15806d9059ff8f1643ee50e0b36cc8d93060 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Feb 2024 18:38:29 +0800 Subject: [PATCH 1651/2039] Create 3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js --- ...ray-into-subarrays-with-minimum-cost-ii.js | 651 ++++++++++++++++++ 1 file changed, 651 insertions(+) create mode 100644 3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js diff --git a/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js b/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js new file mode 100644 index 00000000..aa249ecd --- /dev/null +++ b/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js @@ -0,0 +1,651 @@ +//#region AVL Tree +/** + * @typedef {"keep-all" | "override" | "ignore"} DuplicateMode + */ +/** + * @template TItem + * @typedef {(a: TItem, b: TItem) => number} Comparer + */ +/** + * @template TItem + * @typedef {Object} AvlConfigs + * @property {Comparer} comparer + * @property {DuplicateMode} duplicateMode Defines the behavior to add a node when the result of comparer is 0. + * @property {AvlNodesPool} nodesPool Keeping node instances to avoid creating too many AVL Nodes. + */ + +/** + * @template TItem + */ +class AvlNode { + /** @type {AvlNode | undefined} */ + left; + /** @type {AvlNode | undefined} */ + right; + + /** @type {TItem} */ + value; + + /** @type {number} */ + height; + /** @type {number} */ + size; + + /** + * @param {TItem} value + */ + constructor(value) { + this.value = value; + this.height = 1; + this.size = 1; + } + + getBalanceFactor() { + return (this.left?.height ?? 0) - (this.right?.height ?? 0); + } + + recalculateHeight() { + this.height = 1 + Math.max(this.left?.height ?? 0, this.right?.height ?? 0); + } + + recalculateSize() { + this.size = 1 + (this.left?.size ?? 0) + (this.right?.size ?? 0); + } + + dispose() { + delete this.left; + delete this.right; + delete this.height; + delete this.value; + delete this.height; + delete this.size; + } +} + +/** + * @template TItem + */ +class AvlTree { + //#region Constructor + /** + * @param {AvlConfigs} configs + */ + constructor(configs) { + /** @private */ + this._comparer = configs.comparer; + /** @private */ + this._duplicationMode = configs.duplicateMode ?? "keep-all"; + /** @private */ + this._nodesPool = configs.nodesPool; + + /** @private @type {AvlNode | undefined} */ + this._root = undefined; + } + + get size() { + return this._root?.size ?? 0; + } + + /** + * @private + * @param {number} order + * @returns {number} + */ + _adjustOrder(order) { + return ((order % this.size) + this.size) % this.size; + } + + /** + * @private + * @param {AvlNode} parent + * @param {number} parentOrder + */ + _calculateLeftNodeOrder(parent, parentOrder) { + return parentOrder - 1 - (parent?.left?.right?.size ?? 0); + } + + /** + * @private + * @param {AvlNode} parent + * @param {number} parentOrder + */ + _calculateRightNodeOrder(parent, parentOrder) { + return parentOrder + 1 + (parent?.right?.left?.size ?? 0); + } + //#endregion + + //#region Balancing + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateLeft(node) { + let newTop = node.right; + node.right = newTop.left; + newTop.left = node; + + node.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateRight(node) { + let newTop = node.left; + node.left = newTop.right; + newTop.right = node; + + node.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateDoubleLeft(node) { + let newRight = node.right; + let newTop = newRight.left; + node.right = newTop.left; + newRight.left = newTop.right; + newTop.left = node; + newTop.right = newRight; + + node.recalculateHeight(); + newRight.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newRight.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateDoubleRight(node) { + let newLeft = node.left; + let newTop = newLeft.right; + node.left = newTop.right; + newLeft.right = newTop.left; + newTop.right = node; + newTop.left = newLeft; + + node.recalculateHeight(); + newLeft.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newLeft.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _balance(node) { + let bf = node.getBalanceFactor(); + if (bf < -1) { + bf = node.right.getBalanceFactor(); + if (bf < 0) return this._rotateLeft(node); + else return this._rotateDoubleLeft(node); + } else if (bf > 1) { + bf = node.left.getBalanceFactor(); + if (bf > 0) return this._rotateRight(node); + else return this._rotateDoubleRight(node); + } + + return node; + } + //#endregion + + //#region Add + /** + * @private + * @param {TItem} item + * @returns {AvlNode} + */ + _createNode(item) { + if (this._nodesPool) return this._nodesPool.provide(item); + return new AvlNode(item); + } + + /** + * @private + * @param {TItem} item + * @param {AvlNode | undefined} node + * @returns {AvlNode} + */ + _addFromNode(item, node) { + if (!node) return this._createNode(item); + const cmp = this._comparer(item, node.value); + const isToLeftNode = cmp < 0; + + if (cmp == 0) { + switch (this._duplicationMode) { + case "keep-all": + break; + case "override": { + node.value = item; + return node; + } + case "ignore": { + return node; + } + } + } + + if (isToLeftNode) node.left = this._addFromNode(item, node.left); + else node.right = this._addFromNode(item, node.right); + node.recalculateHeight(); + node.recalculateSize(); + return this._balance(node); + } + + /** + * @param {...TItem} items + */ + add(...items) { + for (let i = 0; i < items.length; i++) { + this._root = this._addFromNode(items[i], this._root); + } + } + //#endregion + + //#region Retrieve + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _findLeftMostFromNode(node) { + let res = node; + while (res?.left) res = res.left; + return res; + } + + findLeftMostItem() { + return this._findLeftMostFromNode(this._root)?.value; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _findRightMostFromNode(node) { + let res = node; + while (res?.right) res = res.right; + return res; + } + + findRightMostItem() { + return this._findRightMostFromNode(this._root)?.value; + } + + /** + * @private + * @param {number} order + * @returns {AvlNode} + */ + _getNodeAt(order) { + if (!this.size) return undefined; + + order = this._adjustOrder(order); + let res = this._root; + let leftSize = res; + + while (true) { + leftSize = res.left?.size ?? 0; + if (order === leftSize) return res; + if (order < leftSize) { + res = res.left; + } else { + res = res.right; + order -= leftSize + 1; + } + } + } + + /** + * @param {number} order + * @returns {TItem} + */ + getItemAt(order) { + return this._getNodeAt(order)?.value; + } + + /** + * @param {TItem} item + * @param {number} start + * @returns {number} + */ + findFirstOrder(item, start = 0) { + if (!this.size) return -1; + start = this._adjustOrder(start); + + let node = this._root; + let order = node.left?.size ?? 0; + let res = -1; + + while (node) { + if (order < start) { + order = this._calculateRightNodeOrder(node, order); + node = node.right; + } else { + let cmp = this._comparer(item, node.value); + if (cmp === 0) res = order; + if (cmp <= 0) { + order = this._calculateLeftNodeOrder(node, order); + node = node?.left; + } else { + order = this._calculateRightNodeOrder(node, order); + node = node.right; + } + } + } + + return res; + } + + /** + * @param {TItem} item + * @param {number} end + * @returns {number} + */ + findLastOrder(item, end = -1) { + if (!this.size) return -1; + end = this._adjustOrder(end); + + let node = this._root; + let order = node.left?.size ?? 0; + let res = -1; + + while (node) { + if (order > end) { + order = this._calculateLeftNodeOrder(node, order); + node = node.left; + } else { + let cmp = this._comparer(item, node.value); + if (cmp === 0) res = order; + if (cmp < 0) { + order = this._calculateLeftNodeOrder(node, order); + node = node?.left; + } else { + order = this._calculateRightNodeOrder(node, order); + node = node.right; + } + } + } + + return res; + } + + /** + * @param {TItem} item + * @returns {number} + */ + count(item) { + let first = this.findFirstOrder(item); + if (first === -1) return 0; + let last = this.findLastOrder(item); + return last - first + 1; + } + + /** + * Find the right-est value that can be added to the the left of item + * @param {TItem} item + * @returns {TItem | undefined} + */ + findLeftBound(item) { + let node = this._root; + let res = undefined; + + while (node) { + let cmp = this._comparer(item, node.value); + if (cmp < 0) node = node.left; + else { + res = node.value; + node = node.right; + } + } + + return res; + } + + /** + * Find the left-est value that can be added to the the right of item + * @param {TItem} item + * @returns {TItem | undefined} + */ + findRightBound(item) { + let node = this._root; + let res = undefined; + + while (node) { + let cmp = this._comparer(item, node.value); + if (cmp > 0) node = node.right; + else { + res = node.value; + node = node.left; + } + } + + return res; + } + + /** + * @private + * @param {(item: TItem, order: number) => any} fn + * @param {AvlNode} node + * @param {number} startOrder + */ + _forLeftToRightNode(fn, node, startOrder) { + if (!node) return; + this._forLeftToRightNode(fn, node.left, startOrder); + fn(node.value, startOrder + (node.left?.size ?? 0)); + this._forLeftToRightNode( + fn, + node.right, + startOrder + (node.left?.size ?? 0) + 1 + ); + } + /** + * @param {(item: TItem, order: number) => any} fn + */ + forLeftToRight(fn) { + this._forLeftToRightNode(fn, this._root, 0); + } + + /** + * @private + * @param {(item: TItem, order: number) => any} fn + * @param {AvlNode} node + * @param {number} startOrder + */ + _forRightToLeftNode(fn, node, startOrder) { + if (!node) return; + this._forRightToLeftNode(fn, node.right, startOrder); + fn(node.value, startOrder - (node.right?.size ?? 0)); + this._forRightToLeftNode( + fn, + node.left, + startOrder - (node.right?.size ?? 0) - 1 + ); + } + + /** + * @param {(item: TItem, order: number) => any} fn + */ + forRightToLeft(fn) { + this._forRightToLeftNode(fn, this._root, this.size - 1); + } + //#endregion + + //#region Remove + /** + * @private + * @param {AvlNode} node + */ + _destroyNode(node) { + if (this._nodesPool) this._nodesPool.return(node); + else node.dispose(); + } + + /** + * @private + * @param {TItem} item + * @param {AvlNode | undefined} node + * @returns {AvlNode} + */ + _removeFromNode(item, node) { + if (!node) return node; + + const cmp = this._comparer(item, node.value); + if (cmp < 0) node.left = this._removeFromNode(item, node.left); + else if (cmp > 0) node.right = this._removeFromNode(item, node.right); + else { + if (!node.left) { + let child = node.right; + this._destroyNode(node); + return child; + } + if (!node.right) { + let child = node.left; + this._destroyNode(node); + return child; + } + + let leftMostOfRight = this._findLeftMostFromNode(node.right); + node.value = leftMostOfRight.value; + node.right = this._removeFromNode(leftMostOfRight.value, node.right); + } + node.recalculateHeight(); + node.recalculateSize(); + return this._balance(node); + } + + /** + * @param {...TItem} items + */ + remove(...items) { + for (let i = 0; i < items.length; i++) { + this._root = this._removeFromNode(items[i], this._root); + } + } + + /** + * @param {AvlNode} node + */ + _clearFromNode(node) { + if (!node) return; + if (node.left) this._clearFromNode(node.left); + if (node.right) this._clearFromNode(node.right); + this._destroyNode(node); + } + + clear() { + if (!this._root) return; + this._clearFromNode(this._root); + delete this._root; + } + //#endregion +} +//#endregion + +//#region AVL Nodes Pool +class AvlNodesPool { + /** + * @private + * @type {AvlNode[]} + */ + _nodes = []; + /** + * @private + * @type {number} + */ + _top = 0; + + provide(value) { + if (this._top) { + let result = this._nodes[--this._top]; + result.value = value; + result.left = null; + result.right = null; + result.size = 1; + result.height = 1; + return result; + } + return new AvlNode(value); + } + + /** + * @param {AvlNode} node + */ + return(node) { + if (this._top === this._nodes.length) this._nodes.push(node); + else this._nodes[this._top] = node; + this._top++; + } +} +//#endregion + +let avl = new AvlTree({ + comparer: (a, b) => a - b, + duplicateMode: "keep-all", + nodesPool: new AvlNodesPool(), +}); + +/** + * @param {number[]} nums + * @param {number} k + * @param {number} dist + * @return {number} + */ +var minimumCost = function (nums, k, dist) { + let n = nums.length; + avl.clear(); + + let sum = 0; + for (let i = 1; i < k; ++i) { + sum += nums[i]; + avl.add(nums[i]); + } + let res = sum; + + for (let i = k; i < n; ++i) { + avl.add(nums[i]); + let p = avl.findLastOrder(nums[i]); + if (p < k - 1) { + sum += nums[i]; + sum -= avl.getItemAt(k - 1); + } + if (i - dist > 1) { + p = avl.findLastOrder(nums[i - dist - 1]); + avl.remove(nums[i - dist - 1]); + if (p < k - 1) { + sum -= nums[i - dist - 1]; + sum += avl.getItemAt(k - 2); + } + } + + res = Math.min(res, sum); + } + + return res + nums[0]; +}; From 58485993f2cc747ce8111d9c66662210cd6c8891 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 27 Feb 2024 18:41:27 +0800 Subject: [PATCH 1652/2039] Update 3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js --- ...ray-into-subarrays-with-minimum-cost-ii.js | 83 +++++++++++++++++++ 1 file changed, 83 insertions(+) diff --git a/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js b/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js index aa249ecd..8c181741 100644 --- a/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js +++ b/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.js @@ -1,3 +1,86 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} dist + * @return {number} + */ +var minimumCost = function (nums, k, dist) { + // store k-1 smallest elements + const maxHeap = new PriorityQueue({ compare: (a, b) => b - a }) + // store dist - k + 1 biggest elements + const minHeap = new PriorityQueue({ compare: (a, b) => a - b }) + const maxDiscard = {} + const minDiscard = {} + let sum = nums[0] + let start = 1 + let end = start + while (end - start < k - 1) { + maxHeap.enqueue(nums[end]) + sum += nums[end] + end++ + } + // now there are k-1 elemetns in the Max heap + while (end - start <= dist) { + maxHeap.enqueue(nums[end]) + sum += nums[end] + let dequeued = maxHeap.dequeue() + sum -= dequeued + minHeap.enqueue(dequeued) + end++ + } + + let minSum = sum + while (end < nums.length) { + if (k - 2 === dist) { + sum += nums[end++] + sum -= nums[start++] + } else { + discardMin() + + if (nums[start] < minHeap.front()) { + maxDiscard[nums[start]] = 1 + (maxDiscard[nums[start]] ?? 0) + sum -= nums[start] + + sum += minHeap.front() + maxHeap.enqueue(minHeap.dequeue()) + } else minDiscard[nums[start]] = 1 + (minDiscard[nums[start]] ?? 0) + + maxHeap.enqueue(nums[end]) + sum += nums[end] + + discardMax() + sum -= maxHeap.front() + minHeap.enqueue(maxHeap.dequeue()) + + end++ + start++ + } + minSum = Math.min(minSum, sum) + } + + function discardMax() { + if (maxHeap.isEmpty()) return + + while (maxDiscard[maxHeap.front()]) { + maxDiscard[maxHeap.front()]-- + maxHeap.dequeue() + } + } + function discardMin() { + if (minHeap.isEmpty()) return + + while (minDiscard[minHeap.front()]) { + minDiscard[minHeap.front()]-- + minHeap.dequeue() + } + } + + return minSum +} + +// another + + //#region AVL Tree /** * @typedef {"keep-all" | "override" | "ignore"} DuplicateMode From a07264df26f6b32a099b317b665c45b6681b4882 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 Feb 2024 20:38:03 +0800 Subject: [PATCH 1653/2039] Update 1942-the-number-of-the-smallest-unoccupied-chair.js --- ...number-of-the-smallest-unoccupied-chair.js | 103 ++++++++++++++++++ 1 file changed, 103 insertions(+) diff --git a/1942-the-number-of-the-smallest-unoccupied-chair.js b/1942-the-number-of-the-smallest-unoccupied-chair.js index 0876ec69..643058c6 100644 --- a/1942-the-number-of-the-smallest-unoccupied-chair.js +++ b/1942-the-number-of-the-smallest-unoccupied-chair.js @@ -1,3 +1,106 @@ +/** + * @param {number[][]} times + * @param {number} targetFriend + * @return {number} + */ +const smallestChair = function(times, targetFriend) { + times.forEach((e, i) => e[2] = i) + times.sort((a, b) => a[0] - b[0]) + const pq = new PQ((a, b) => a[1] < b[1]) + const available = new PQ((a, b) => a < b) + const n = times.length + for(let i = 0; i < n; i++) { + available.push(i) + } + const seat = available.pop() + times[0].push(seat) + pq.push(times[0]) + if(times[0][2] === targetFriend) return seat + for(let i = 1; i < n; i++) { + const el = times[i] + const [s, e, idx] = el + while(!pq.isEmpty() && pq.peek()[1] <= s) { + const tmp = pq.pop() + available.push(tmp[3]) + } + const seat = available.pop() + if(targetFriend === idx) return seat + el.push(seat) + pq.push(el) + } + +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + +// another + /** * @param {number[][]} times * @param {number} targetFriend From 492e715b99d556b44c2633d517912aa62cab6b77 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Mar 2024 19:59:47 +0800 Subject: [PATCH 1654/2039] Create 3069-distribute-elements-into-two-arrays-i.js --- 3069-distribute-elements-into-two-arrays-i.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 3069-distribute-elements-into-two-arrays-i.js diff --git a/3069-distribute-elements-into-two-arrays-i.js b/3069-distribute-elements-into-two-arrays-i.js new file mode 100644 index 00000000..966a77aa --- /dev/null +++ b/3069-distribute-elements-into-two-arrays-i.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var resultArray = function(nums) { + const n = nums.length + const a1 = [], a2 = [] + a1.push(nums[0]) + a2.push(nums[1]) + for(let i = 2; i < n; i++) { + const e = nums[i] + const l1 = a1[a1.length - 1], l2 = a2[a2.length - 1] + if(l1 > l2) { + a1.push(e) + } else { + a2.push(e) + } + } + + return a1.concat(a2) +}; From 18c326d50642d54169f07651ea30e7e2d0764862 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Mar 2024 20:00:16 +0800 Subject: [PATCH 1655/2039] Create 3070-count-submatrices-with-top-left-element-and-sum-less-than-k.js --- ...th-top-left-element-and-sum-less-than-k.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 3070-count-submatrices-with-top-left-element-and-sum-less-than-k.js diff --git a/3070-count-submatrices-with-top-left-element-and-sum-less-than-k.js b/3070-count-submatrices-with-top-left-element-and-sum-less-than-k.js new file mode 100644 index 00000000..f451b12f --- /dev/null +++ b/3070-count-submatrices-with-top-left-element-and-sum-less-than-k.js @@ -0,0 +1,26 @@ +/** + * @param {number[][]} grid + * @param {number} k + * @return {number} + */ +var countSubmatrices = function (grid, k) { + const n = grid.length + const m = grid[0].length + const acc = new Array(m + 1).fill(0) + + let res = 0 + for (let i = 0; i < n; i++) { + const tmp = new Array(m + 1).fill(0) + for (let j = 0; j < m; j++) { + tmp[j + 1] = tmp[j] + grid[i][j] + } + + for (let j = 0; j < m; j++) { + acc[j + 1] += tmp[j + 1] + if (acc[j + 1] <= k) { + res += 1 + } + } + } + return res +} From e319489a63323c3bbc618bd9dbf7b4fc8d62c2af Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Mar 2024 20:00:45 +0800 Subject: [PATCH 1656/2039] Create 3071-minimum-operations-to-write-the-letter-y-on-a-grid.js --- ...rations-to-write-the-letter-y-on-a-grid.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 3071-minimum-operations-to-write-the-letter-y-on-a-grid.js diff --git a/3071-minimum-operations-to-write-the-letter-y-on-a-grid.js b/3071-minimum-operations-to-write-the-letter-y-on-a-grid.js new file mode 100644 index 00000000..3caf484f --- /dev/null +++ b/3071-minimum-operations-to-write-the-letter-y-on-a-grid.js @@ -0,0 +1,44 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumOperationsToWriteY = function (grid) { + const mapY = new Map() + const mapNotY = new Map() + const n = grid.length + for (let i = 0; i < n; i++) { + for (let j = 0; j < n; j++) { + let inY = false + if (i <= n / 2) { + if (i === j || i + j === n - 1) { + inY = true + } + } else { + if (j === Math.floor(n / 2)) { + inY = true + } + } + + const item = grid[i][j] + if (inY) { + mapY.set(item, (mapY.get(item) || 0) + 1) + } else { + mapNotY.set(item, (mapNotY.get(item) || 0) + 1) + } + } + } + const countY = n + Math.floor(n / 2) + const countNotY = n * n - countY + let res = Infinity + for (let a = 0; a <= 2; a++) { + for (let b = 0; b <= 2; b++) { + if (a === b) continue + const tmp1 = mapY.get(a) || 0 + const tmp2 = mapNotY.get(b) || 0 + + const tmp = countY - tmp1 + (countNotY - tmp2) + res = Math.min(res, tmp) + } + } + return res +} From fa961879ddf24a908c2e39a3f43aaf8ba5e24193 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Mar 2024 20:02:05 +0800 Subject: [PATCH 1657/2039] Create 3072-distribute-elements-into-two-arrays-ii.js --- ...-distribute-elements-into-two-arrays-ii.js | 657 ++++++++++++++++++ 1 file changed, 657 insertions(+) create mode 100644 3072-distribute-elements-into-two-arrays-ii.js diff --git a/3072-distribute-elements-into-two-arrays-ii.js b/3072-distribute-elements-into-two-arrays-ii.js new file mode 100644 index 00000000..ea9db49d --- /dev/null +++ b/3072-distribute-elements-into-two-arrays-ii.js @@ -0,0 +1,657 @@ +//#region AVL Tree +/** + * @typedef {"keep-all" | "override" | "ignore"} DuplicateMode + */ +/** + * @template TItem + * @typedef {(a: TItem, b: TItem) => number} Comparer + */ +/** + * @template TItem + * @typedef {Object} AvlConfigs + * @property {Comparer} comparer + * @property {DuplicateMode} duplicateMode Defines the behavior to add a node when the result of comparer is 0. + * @property {AvlNodesPool} nodesPool Keeping node instances to avoid creating too many AVL Nodes. + */ + +/** + * @template TItem + */ +class AvlNode { + /** @type {AvlNode | undefined} */ + left; + /** @type {AvlNode | undefined} */ + right; + + /** @type {TItem} */ + value; + + /** @type {number} */ + height; + /** @type {number} */ + size; + + /** + * @param {TItem} value + */ + constructor(value) { + this.value = value; + this.height = 1; + this.size = 1; + } + + getBalanceFactor() { + return (this.left?.height ?? 0) - (this.right?.height ?? 0); + } + + recalculateHeight() { + this.height = 1 + Math.max(this.left?.height ?? 0, this.right?.height ?? 0); + } + + recalculateSize() { + this.size = 1 + (this.left?.size ?? 0) + (this.right?.size ?? 0); + } + + dispose() { + delete this.left; + delete this.right; + delete this.height; + delete this.value; + delete this.height; + delete this.size; + } +} + +/** + * @template TItem + */ +class AvlTree { + //#region Constructor + /** + * @param {AvlConfigs} configs + */ + constructor(configs) { + /** @private */ + this._comparer = configs.comparer; + /** @private */ + this._duplicationMode = configs.duplicateMode ?? "keep-all"; + /** @private */ + this._nodesPool = configs.nodesPool; + + /** @private @type {AvlNode | undefined} */ + this._root = undefined; + } + + get size() { + return this._root?.size ?? 0; + } + + /** + * @private + * @param {number} order + * @returns {number} + */ + _adjustOrder(order) { + return ((order % this.size) + this.size) % this.size; + } + + /** + * @private + * @param {AvlNode} parent + * @param {number} parentOrder + */ + _calculateLeftNodeOrder(parent, parentOrder) { + return parentOrder - 1 - (parent?.left?.right?.size ?? 0); + } + + /** + * @private + * @param {AvlNode} parent + * @param {number} parentOrder + */ + _calculateRightNodeOrder(parent, parentOrder) { + return parentOrder + 1 + (parent?.right?.left?.size ?? 0); + } + //#endregion + + //#region Balancing + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateLeft(node) { + let newTop = node.right; + node.right = newTop.left; + newTop.left = node; + + node.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateRight(node) { + let newTop = node.left; + node.left = newTop.right; + newTop.right = node; + + node.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateDoubleLeft(node) { + let newRight = node.right; + let newTop = newRight.left; + node.right = newTop.left; + newRight.left = newTop.right; + newTop.left = node; + newTop.right = newRight; + + node.recalculateHeight(); + newRight.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newRight.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _rotateDoubleRight(node) { + let newLeft = node.left; + let newTop = newLeft.right; + node.left = newTop.right; + newLeft.right = newTop.left; + newTop.right = node; + newTop.left = newLeft; + + node.recalculateHeight(); + newLeft.recalculateHeight(); + newTop.recalculateHeight(); + node.recalculateSize(); + newLeft.recalculateSize(); + newTop.recalculateSize(); + return newTop; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _balance(node) { + let bf = node.getBalanceFactor(); + if (bf < -1) { + bf = node.right.getBalanceFactor(); + if (bf < 0) return this._rotateLeft(node); + else return this._rotateDoubleLeft(node); + } else if (bf > 1) { + bf = node.left.getBalanceFactor(); + if (bf > 0) return this._rotateRight(node); + else return this._rotateDoubleRight(node); + } + + return node; + } + //#endregion + + //#region Add + /** + * @private + * @param {TItem} item + * @returns {AvlNode} + */ + _createNode(item) { + if (this._nodesPool) return this._nodesPool.provide(item); + return new AvlNode(item); + } + + /** + * @private + * @param {TItem} item + * @param {AvlNode | undefined} node + * @returns {AvlNode} + */ + _addFromNode(item, node) { + if (!node) return this._createNode(item); + const cmp = this._comparer(item, node.value); + const isToLeftNode = cmp < 0; + + if (cmp == 0) { + switch (this._duplicationMode) { + case "keep-all": + break; + case "override": { + node.value = item; + return node; + } + case "ignore": { + return node; + } + } + } + + if (isToLeftNode) node.left = this._addFromNode(item, node.left); + else node.right = this._addFromNode(item, node.right); + node.recalculateHeight(); + node.recalculateSize(); + return this._balance(node); + } + + /** + * @param {TItem} item + */ + add(item) { + this._root = this._addFromNode(item, this._root); + } + //#endregion + + //#region Retrieve + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _findLeftMostFromNode(node) { + let res = node; + while (res?.left) res = res.left; + return res; + } + + findLeftMostItem() { + return this._findLeftMostFromNode(this._root)?.value; + } + + /** + * @private + * @param {AvlNode} node + * @returns {AvlNode} + */ + _findRightMostFromNode(node) { + let res = node; + while (res?.right) res = res.right; + return res; + } + + findRightMostItem() { + return this._findRightMostFromNode(this._root)?.value; + } + + /** + * @private + * @param {number} order + * @returns {AvlNode} + */ + _getNodeAt(order) { + if (!this.size) return undefined; + + order = this._adjustOrder(order); + let res = this._root; + let leftSize = res; + + while (true) { + leftSize = res.left?.size ?? 0; + if (order === leftSize) return res; + if (order < leftSize) { + res = res.left; + } else { + res = res.right; + order -= leftSize + 1; + } + } + } + + /** + * @param {number} order + * @returns {TItem} + */ + getItemAt(order) { + return this._getNodeAt(order)?.value; + } + + /** + * @param {TItem} item + * @param {number} start + * @returns {number} + */ + findFirstOrder(item, start = 0) { + if (!this.size) return -1; + start = this._adjustOrder(start); + + let node = this._root; + let order = node.left?.size ?? 0; + let res = -1; + + while (node) { + if (order < start) { + order = this._calculateRightNodeOrder(node, order); + node = node.right; + } else { + let cmp = this._comparer(item, node.value); + if (cmp === 0) res = order; + if (cmp <= 0) { + order = this._calculateLeftNodeOrder(node, order); + node = node?.left; + } else { + order = this._calculateRightNodeOrder(node, order); + node = node.right; + } + } + } + + return res; + } + + /** + * @param {TItem} item + * @param {number} end + * @returns {number} + */ + findLastOrder(item, end = -1) { + if (!this.size) return -1; + end = this._adjustOrder(end); + + let node = this._root; + let order = node.left?.size ?? 0; + let res = -1; + + while (node) { + if (order > end) { + order = this._calculateLeftNodeOrder(node, order); + node = node.left; + } else { + let cmp = this._comparer(item, node.value); + if (cmp === 0) res = order; + if (cmp < 0) { + order = this._calculateLeftNodeOrder(node, order); + node = node?.left; + } else { + order = this._calculateRightNodeOrder(node, order); + node = node.right; + } + } + } + + return res; + } + + /** + * @param {TItem} item + * @returns {number} + */ + count(item) { + let first = this.findFirstOrder(item); + if (first === -1) return 0; + let last = this.findLastOrder(item); + return last - first + 1; + } + + /** + * Find the right-est value that can be added to the the left of item + * @param {TItem} item + * @returns {TItem | undefined} + */ + findLeftBound(item) { + let node = this._root; + let res = undefined; + + while (node) { + let cmp = this._comparer(item, node.value); + if (cmp < 0) node = node.left; + else { + res = node.value; + node = node.right; + } + } + + return res; + } + + /** + * Find the left-est value that can be added to the the right of item + * @param {TItem} item + * @returns {TItem | undefined} + */ + findRightBound(item) { + let node = this._root; + let res = undefined; + + while (node) { + let cmp = this._comparer(item, node.value); + if (cmp > 0) node = node.right; + else { + res = node.value; + node = node.left; + } + } + + return res; + } + + /** + * @private + * @param {(item: TItem, order: number) => any} fn + * @param {AvlNode} node + * @param {number} startOrder + */ + _forLeftToRightNode(fn, node, startOrder) { + if (!node) return; + this._forLeftToRightNode(fn, node.left, startOrder); + fn(node.value, startOrder + (node.left?.size ?? 0)); + this._forLeftToRightNode( + fn, + node.right, + startOrder + (node.left?.size ?? 0) + 1 + ); + } + /** + * @param {(item: TItem, order: number) => any} fn + */ + forLeftToRight(fn) { + this._forLeftToRightNode(fn, this._root, 0); + } + + /** + * @private + * @param {(item: TItem, order: number) => any} fn + * @param {AvlNode} node + * @param {number} startOrder + */ + _forRightToLeftNode(fn, node, startOrder) { + if (!node) return; + this._forRightToLeftNode(fn, node.right, startOrder); + fn(node.value, startOrder - (node.right?.size ?? 0)); + this._forRightToLeftNode( + fn, + node.left, + startOrder - (node.right?.size ?? 0) - 1 + ); + } + + /** + * @param {(item: TItem, order: number) => any} fn + */ + forRightToLeft(fn) { + this._forRightToLeftNode(fn, this._root, this.size - 1); + } + //#endregion + + //#region Remove + /** + * @private + * @param {AvlNode} node + */ + _destroyNode(node) { + if (this._nodesPool) this._nodesPool.return(node); + else node.dispose(); + } + + /** + * @private + * @param {TItem} item + * @param {AvlNode | undefined} node + * @returns {AvlNode} + */ + _removeFromNode(item, node) { + if (!node) return node; + + const cmp = this._comparer(item, node.value); + if (cmp < 0) node.left = this._removeFromNode(item, node.left); + else if (cmp > 0) node.right = this._removeFromNode(item, node.right); + else { + if (!node.left) { + let child = node.right; + this._destroyNode(node); + return child; + } + if (!node.right) { + let child = node.left; + this._destroyNode(node); + return child; + } + + let leftMostOfRight = this._findLeftMostFromNode(node.right); + node.value = leftMostOfRight.value; + node.right = this._removeFromNode(leftMostOfRight.value, node.right); + } + node.recalculateHeight(); + node.recalculateSize(); + return this._balance(node); + } + + /** + * @param {TItem} item + */ + remove(item) { + this._root = this._removeFromNode(item, this._root); + } + + /** + * @param {AvlNode} node + */ + _clearFromNode(node) { + if (!node) return; + if (node.left) this._clearFromNode(node.left); + if (node.right) this._clearFromNode(node.right); + this._destroyNode(node); + } + + clear() { + if (!this._root) return; + this._clearFromNode(this._root); + delete this._root; + } + //#endregion +} +//#endregion + +//#region AVL Nodes Pool +class AvlNodesPool { + /** + * @private + * @type {AvlNode[]} + */ + _nodes = []; + /** + * @private + * @type {number} + */ + _top = 0; + + provide(value) { + if (this._top) { + let result = this._nodes[--this._top]; + result.value = value; + result.left = null; + result.right = null; + result.size = 1; + result.height = 1; + return result; + } + return new AvlNode(value); + } + + /** + * @param {AvlNode} node + */ + return(node) { + if (this._top === this._nodes.length) this._nodes.push(node); + else this._nodes[this._top] = node; + this._top++; + } +} +//#endregion + +let pool = new AvlNodesPool(); +let avl1 = new AvlTree({ + comparer: (a, b) => b - a, + duplicateMode: "keep-all", + nodesPool: pool, +}); +let avl2 = new AvlTree({ + comparer: (a, b) => b - a, + duplicateMode: "keep-all", + nodesPool: pool, +}); +let addTo1 = new Uint8Array(1e5); + +/** + * @param {number[]} nums + * @return {number[]} + */ +var resultArray = function (nums) { + let n = nums.length; + avl1.clear(); + avl2.clear(); + + addTo1[0] = 1; + avl1.add(nums[0]); + addTo1[1] = 0; + avl2.add(nums[1]); + + for (let i = 2; i < n; ++i) { + let b1 = avl1.findLeftBound(nums[i] + 1); + b1 = b1 == null ? 0 : avl1.findLastOrder(b1) + 1; + let b2 = avl2.findLeftBound(nums[i] + 1); + b2 = b2 == null ? 0 : avl2.findLastOrder(b2) + 1; + + addTo1[i] = b1 > b2 || (b1 == b2 && avl1.size <= avl2.size); + if (addTo1[i]) { + avl1.add(nums[i]); + } else { + avl2.add(nums[i]); + } + } + + let res = new Uint32Array(n); + let l = 0; + let r = avl1.size; + for (let i = 0; i < n; ++i) { + if (addTo1[i]) { + res[l++] = nums[i]; + } else { + res[r++] = nums[i]; + } + } + + return res; +}; From 552f63fb314c66b3fa996f9e5b3b930f26dc3383 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Mar 2024 19:13:10 +0800 Subject: [PATCH 1658/2039] Create 2871-split-array-into-maximum-number-of-subarrays.js --- ...-array-into-maximum-number-of-subarrays.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 2871-split-array-into-maximum-number-of-subarrays.js diff --git a/2871-split-array-into-maximum-number-of-subarrays.js b/2871-split-array-into-maximum-number-of-subarrays.js new file mode 100644 index 00000000..a71c473c --- /dev/null +++ b/2871-split-array-into-maximum-number-of-subarrays.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxSubarrays = function(nums) { + let n = nums.length; + let s = nums[0]; + for (let i = 1; i < n; i++) s &= nums[i]; + if (s > 0) return 1; + + let res = 0; + let l = 0; + let cs = nums[l]; + for (let r = 0; r < n; r++) { + cs &= nums[r]; + if (cs == 0) { + res++; + l = r + 1; + cs = nums[l]; + } + } + + return res; +}; From d5db5343ae4e5bfe3f67d684c2009afef8e31b13 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 7 Mar 2024 18:50:18 +0800 Subject: [PATCH 1659/2039] Update 3022-minimize-or-of-remaining-elements-using-operations.js --- ...-of-remaining-elements-using-operations.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/3022-minimize-or-of-remaining-elements-using-operations.js b/3022-minimize-or-of-remaining-elements-using-operations.js index f82b89ba..d72db393 100644 --- a/3022-minimize-or-of-remaining-elements-using-operations.js +++ b/3022-minimize-or-of-remaining-elements-using-operations.js @@ -35,3 +35,36 @@ var minOrAfterOperations = function(nums, k) { } return res; }; + + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minOrAfterOperations = function(nums, k) { + const n = nums.length; + let ans = 0; + + for (let j = 30; j >= 0; j--) { + let cnt = 0; + let cur = (1 << 30) - 1; + let target = ans | ((1 << j) - 1); + + for (let i = 0; i < n; i++) { + cur &= nums[i]; + if ((cur | target) === target) { + cnt++; + cur = (1 << 30) - 1; + } + } + + if (n - cnt > k) { + ans |= (1 << j); + } + } + + return ans; +}; From 0fb6b0912e268d008a0dbcbb918a2000ab378415 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Mar 2024 20:58:19 +0800 Subject: [PATCH 1660/2039] Create 3027-find-the-number-of-ways-to-place-people-ii.js --- ...d-the-number-of-ways-to-place-people-ii.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 3027-find-the-number-of-ways-to-place-people-ii.js diff --git a/3027-find-the-number-of-ways-to-place-people-ii.js b/3027-find-the-number-of-ways-to-place-people-ii.js new file mode 100644 index 00000000..088053d5 --- /dev/null +++ b/3027-find-the-number-of-ways-to-place-people-ii.js @@ -0,0 +1,25 @@ +/** + * @param {number[][]} points + * @return {number} + */ +var numberOfPairs = function(points) { + points.sort((a, b) => { + if (a[0] === b[0]) return b[1] - a[1]; + return a[0] - b[0]; + }); + + let solution = 0; + for (let i = 0; i < points.length; i++) { + let c = points[i]; + let currentMax = -Infinity; + for (let j = i + 1; j < points.length; j++) { + let t = points[j]; + if (c[1] < t[1]) continue; + if (currentMax >= t[1]) continue; + currentMax = Math.max(currentMax, t[1]); + solution++; + } + } + + return solution; +}; From c61eef20757be3942b8dc7118aa0b3d6e1124440 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Mar 2024 20:09:17 +0800 Subject: [PATCH 1661/2039] Create 3048-earliest-second-to-mark-indices-i.js --- 3048-earliest-second-to-mark-indices-i.js | 31 +++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 3048-earliest-second-to-mark-indices-i.js diff --git a/3048-earliest-second-to-mark-indices-i.js b/3048-earliest-second-to-mark-indices-i.js new file mode 100644 index 00000000..1b9a33f0 --- /dev/null +++ b/3048-earliest-second-to-mark-indices-i.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums + * @param {number[]} changeIndices + * @return {number} + */ +var earliestSecondToMarkIndices = function(nums, changeIndices) { + let isPossible = function (mid) { + let last = new Uint16Array(nums.length); + for (let i = 0; i <= mid; ++i) last[changeIndices[i]] = i; + + let count = 0, marked = 0; + for (let i = 0; i <= mid; ++i) { + if (last[changeIndices[i]] === i) { + count -= nums[changeIndices[i]]; + if (count < 0) return false; + ++marked; + } else { + ++count; + } + } + return marked === nums.length; + }; + + changeIndices = changeIndices.map((x) => x - 1); + let l = 0, r = changeIndices.length - 1; + while (l < r) { + let mid = (l + r) >> 1; + isPossible(mid) ? r = mid : l = mid + 1; + } + return isPossible(l) ? l + 1 : -1; +}; From c380c14e5b33117b5af2fc85706b26d2d9444cf6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Mar 2024 20:31:53 +0800 Subject: [PATCH 1662/2039] Create 3077-maximum-strength-of-k-disjoint-subarrays.js --- ...aximum-strength-of-k-disjoint-subarrays.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3077-maximum-strength-of-k-disjoint-subarrays.js diff --git a/3077-maximum-strength-of-k-disjoint-subarrays.js b/3077-maximum-strength-of-k-disjoint-subarrays.js new file mode 100644 index 00000000..5cb724d4 --- /dev/null +++ b/3077-maximum-strength-of-k-disjoint-subarrays.js @@ -0,0 +1,40 @@ +let pre = Array(10001).fill(0); +let cur = Array(10001).fill(0); +let ps = Array(10001).fill(0); + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumStrength = function (nums, k) { + let n = nums.length; + + ps[0] = 0; + for (let i = 0; i < n; ++i) { + ps[i + 1] = ps[i] + nums[i]; + } + + ++n; + cur.fill(0, 0, n); + + for (let i = 1; i <= k; ++i) { + let tem = pre; + pre = cur; + cur = tem; + + let t = 1 + k - i; + if (!(i & 1)) t = -t; + + let m = pre[i - 1] - ps[i - 1] * t; + cur[i] = ps[i] * t + m; + m = Math.max(m, pre[i] - ps[i] * t); + + for (let j = i + 1; j < n; ++j) { + cur[j] = Math.max(cur[j - 1], ps[j] * t + m); + m = Math.max(m, pre[j] - ps[j] * t); + } + } + + return cur[n - 1]; +}; From a1d929a2ae15613fc064da49fab920571053023e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Mar 2024 20:33:15 +0800 Subject: [PATCH 1663/2039] Create 3076-shortest-uncommon-substring-in-an-array.js --- ...shortest-uncommon-substring-in-an-array.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 3076-shortest-uncommon-substring-in-an-array.js diff --git a/3076-shortest-uncommon-substring-in-an-array.js b/3076-shortest-uncommon-substring-in-an-array.js new file mode 100644 index 00000000..9a5ad533 --- /dev/null +++ b/3076-shortest-uncommon-substring-in-an-array.js @@ -0,0 +1,34 @@ +/** + * @param {string[]} arr + * @return {string[]} + */ +var shortestSubstrings = function(arr) { +function* gen(s) { + const s_len = s.length + for (let i = 0; i < s_len; i++) { + for (let j = i; j < s_len; j++) { + yield s.slice(i, j + 1) + } + } +} + +const ans = [] +const n = arr.length +for (let i = 0; i < n; i++) { + const cur_s = arr[i] + let cur_ans = null + for (const s of gen(cur_s)) { + if (arr.filter((_, j) => j !== i).every((str) => !str.includes(s))) { + if (cur_ans === null) { + cur_ans = s + } else if (s.length < cur_ans.length) { + cur_ans = s + } else if (s.length === cur_ans.length && s < cur_ans) { + cur_ans = s + } + } + } + ans.push(cur_ans || '') +} +return ans +}; From 0592897e5687b5eb6d0724088c8333ed904d4d6e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Mar 2024 20:34:14 +0800 Subject: [PATCH 1664/2039] Create 3075-maximize-happiness-of-selected-children.js --- 3075-maximize-happiness-of-selected-children.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 3075-maximize-happiness-of-selected-children.js diff --git a/3075-maximize-happiness-of-selected-children.js b/3075-maximize-happiness-of-selected-children.js new file mode 100644 index 00000000..2b02155d --- /dev/null +++ b/3075-maximize-happiness-of-selected-children.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} happiness + * @param {number} k + * @return {number} + */ +var maximumHappinessSum = function(happiness, k) { +happiness.sort((a, b) => b - a) +let ans = 0 +for (let i = 0; i < k; i++) { + ans += Math.max(happiness[i] - i, 0) +} +return ans +}; From 9362f4dd7cd3a58197ddd27f2f99971b02df44cc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 10 Mar 2024 20:34:49 +0800 Subject: [PATCH 1665/2039] Create 3074-apple-redistribution-into-boxes.js --- 3074-apple-redistribution-into-boxes.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 3074-apple-redistribution-into-boxes.js diff --git a/3074-apple-redistribution-into-boxes.js b/3074-apple-redistribution-into-boxes.js new file mode 100644 index 00000000..14d29e3f --- /dev/null +++ b/3074-apple-redistribution-into-boxes.js @@ -0,0 +1,18 @@ +/** + * @param {number[]} apple + * @param {number[]} capacity + * @return {number} + */ +var minimumBoxes = function(apple, capacity) { +let total_apple = apple.reduce((a, b) => a + b, 0) +capacity.sort((a, b) => b - a) +let ans = 0 +let cur = 0 +for (let c of capacity) { + cur += c + ans += 1 + if (cur >= total_apple) { + return ans + } +} +}; From 6bbcdbf2109d87150a36e3ffc62828e577bd703a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Mar 2024 12:34:04 +0800 Subject: [PATCH 1666/2039] Update 3074-apple-redistribution-into-boxes.js --- 3074-apple-redistribution-into-boxes.js | 20 ++++++++++---------- 1 file changed, 10 insertions(+), 10 deletions(-) diff --git a/3074-apple-redistribution-into-boxes.js b/3074-apple-redistribution-into-boxes.js index 14d29e3f..37b7dc67 100644 --- a/3074-apple-redistribution-into-boxes.js +++ b/3074-apple-redistribution-into-boxes.js @@ -4,15 +4,15 @@ * @return {number} */ var minimumBoxes = function(apple, capacity) { -let total_apple = apple.reduce((a, b) => a + b, 0) -capacity.sort((a, b) => b - a) -let ans = 0 -let cur = 0 -for (let c of capacity) { - cur += c - ans += 1 - if (cur >= total_apple) { - return ans + const sum = apple.reduce((ac, e) => ac+ e, 0) + capacity.sort((a, b) => b - a) + let res = 0 + let remain = sum, i = 0 + while(remain > 0) { + res++ + remain -= capacity[i] + i++ } -} + + return res }; From 34f8586f155e067c9fa4b50f317a0e0625259061 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 12 Mar 2024 18:47:27 +0800 Subject: [PATCH 1667/2039] Create 3049-earliest-second-to-mark-indices-ii.js --- 3049-earliest-second-to-mark-indices-ii.js | 93 ++++++++++++++++++++++ 1 file changed, 93 insertions(+) create mode 100644 3049-earliest-second-to-mark-indices-ii.js diff --git a/3049-earliest-second-to-mark-indices-ii.js b/3049-earliest-second-to-mark-indices-ii.js new file mode 100644 index 00000000..cd88f7d4 --- /dev/null +++ b/3049-earliest-second-to-mark-indices-ii.js @@ -0,0 +1,93 @@ +function heapfy_up(heap, current) { + if (current == 1) return + let parent = current >> 1 + if (heap[current] < heap[parent]) { + ;[heap[parent], heap[current]] = [heap[current], heap[parent]] + heapfy_up(heap, parent) + } +} + +function heapfy_down(heap, current) { + let left = current << 1 + let right = (current << 1) + 1 + let min = current + if (left < heap.length && heap[left] < heap[min]) min = left + if (right < heap.length && heap[right] < heap[min]) min = right + if (min != current) { + ;[heap[min], heap[current]] = [heap[current], heap[min]] + heapfy_down(heap, min) + } +} + +function heap_pop(heap) { + ;[heap[1], heap[heap.length - 1]] = [heap[heap.length - 1], heap[1]] + heap.pop() + heapfy_down(heap, 1) +} + +function heap_push(heap, num) { + heap.push(num) + heapfy_up(heap, heap.length - 1) +} + +/** + * @param {number[]} nums + * @param {number[]} changeIndices + * @return {number} + */ +var earliestSecondToMarkIndices = function (nums, changeIndices) { + const search = function (ceil) { + let heap = [0] + let set = new Set() + let is_first = new Array(ceil).fill(false) + for (let i = 0; i <= ceil - 1; i++) { + if (set.has(changeIndices[i])) continue + else { + set.add(changeIndices[i]) + is_first[i] = true + } + } + + for (let i = ceil - 1; i >= 0; i--) { + let max_size = (ceil - i + 1) >> 1 + if (nums[changeIndices[i] - 1] == 0) continue + if (is_first[i] == false) continue + if (heap.length - 1 < max_size) { + heap_push(heap, nums[changeIndices[i] - 1]) + continue + } else { + if (heap[1] < nums[changeIndices[i] - 1]) { + heap_pop(heap) + heap_push(heap, nums[changeIndices[i] - 1]) + continue + } + } + } + + let days_on_hand = ceil + 1 - heap.length + 1 + let days_need = nums.length + for (let num of nums) days_need += num + for (let i = 1; i <= heap.length - 1; i++) { + days_need -= heap[i] + } + + if (days_need > days_on_hand) return -1 + else return 1 + } + + let r = changeIndices.length - 1 + let l = nums.length - 1 + if (search(r) == -1) return -1 + + while (l < r) { + let mid = (l + r) >> 1 + let res = search(mid) + if (res == -1) { + l = mid + 1 + } else { + r = mid + } + } + + return l + 1 +} From 21be0308a751fcbde6784f42799a568a2bb5c828 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 14 Mar 2024 18:38:15 +0800 Subject: [PATCH 1668/2039] Create 781-rabbits-in-forest.js --- 781-rabbits-in-forest.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 781-rabbits-in-forest.js diff --git a/781-rabbits-in-forest.js b/781-rabbits-in-forest.js new file mode 100644 index 00000000..870444fa --- /dev/null +++ b/781-rabbits-in-forest.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} answers + * @return {number} + */ +const numRabbits = function(answers) { + const h = {} + for(const e of answers) { + if(h[e] == null) h[e] = 0 + h[e]++ + } + let res = 0 + for(let [k,v] of Object.entries(h)) { + k = +k + if(k >= v ) res += k + 1 + else { + res += Math.ceil(v / (k + 1) ) * (k + 1) + } + } + + return res +}; From 4c5e057e92f94af690f5b7a50e2f750cc9c27ebb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Mar 2024 18:25:40 +0800 Subject: [PATCH 1669/2039] Create 3086-minimum-moves-to-pick-k-ones.js --- 3086-minimum-moves-to-pick-k-ones.js | 29 ++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 3086-minimum-moves-to-pick-k-ones.js diff --git a/3086-minimum-moves-to-pick-k-ones.js b/3086-minimum-moves-to-pick-k-ones.js new file mode 100644 index 00000000..22705b40 --- /dev/null +++ b/3086-minimum-moves-to-pick-k-ones.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} maxChanges + * @return {number} + */ +var minimumMoves = function(nums, k, maxChanges) { + let A = [0]; + for (let i = 0; i < nums.length; i++) { + if (nums[i] > 0) { + A.push(A[A.length - 1] + i); + } + } + + let n = A.length - 1; + let m = Math.max(0, k - maxChanges); + let res = Number.MAX_VALUE; + + for (let l = m; l <= Math.min(n, Math.min(m + 3, k)); l++) { + for (let i = 0; i <= n - l; i++) { + let mid1 = i + Math.floor(l / 2); + let mid2 = i + l - Math.floor(l / 2); + let cur = A[i + l] - A[mid2] - (A[mid1] - A[i]); + res = Math.min(res, cur + (k - l) * 2); + } + } + + return res; +}; From 7edd1bef758834c99a6230868e16072424aa4829 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Mar 2024 18:27:53 +0800 Subject: [PATCH 1670/2039] Create 3085-minimum-deletions-to-make-string-k-special.js --- ...imum-deletions-to-make-string-k-special.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 3085-minimum-deletions-to-make-string-k-special.js diff --git a/3085-minimum-deletions-to-make-string-k-special.js b/3085-minimum-deletions-to-make-string-k-special.js new file mode 100644 index 00000000..560f121a --- /dev/null +++ b/3085-minimum-deletions-to-make-string-k-special.js @@ -0,0 +1,34 @@ +/** + * @param {string} word + * @param {number} k + * @return {number} + */ +var minimumDeletions = function(word, k) { + let freq = new Array(26).fill(0); + let deleted = 0; + let ans = word.length; + + for (let i = 0; i < word.length; i++) { + freq[word.charCodeAt(i) - 'a'.charCodeAt(0)]++; + } + + freq.sort((a, b) => a - b); + + for (let i = 0; i < freq.length; i++) { + let res = deleted; + let minFreq = freq[i]; + + for (let j = freq.length - 1; j > i; j--) { + if (freq[j] - minFreq <= k) { + break; + } + + res += freq[j] - minFreq - k; + } + + ans = Math.min(ans, res); + deleted += freq[i]; + } + + return ans; +}; From 21c881a298683c724e5154616c265ac076cc8d83 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Mar 2024 15:40:13 +0800 Subject: [PATCH 1671/2039] Update 169-majority-element.js --- 169-majority-element.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/169-majority-element.js b/169-majority-element.js index 34d524d4..927293c3 100755 --- a/169-majority-element.js +++ b/169-majority-element.js @@ -1,3 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var majorityElement = function(nums) { + let el, cnt = 0 + for(let e of nums) { + if(cnt === 0) { + el = e + cnt++ + } else if(el === e) { + cnt++ + } else { + cnt-- + } + } + let tmp = 0 + for(const e of nums) { + if(e === el) tmp++ + } + return tmp > Math.floor(nums.length / 2) ? el : null +}; + +// another + /** * @param {number[]} nums * @return {number} From 90c56517f3f6ae167335da28ed237ba6ac4a2608 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Mar 2024 15:43:28 +0800 Subject: [PATCH 1672/2039] Create 3084-count-substrings-starting-and-ending-with-given-character.js --- ...tarting-and-ending-with-given-character.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 3084-count-substrings-starting-and-ending-with-given-character.js diff --git a/3084-count-substrings-starting-and-ending-with-given-character.js b/3084-count-substrings-starting-and-ending-with-given-character.js new file mode 100644 index 00000000..a3a501d1 --- /dev/null +++ b/3084-count-substrings-starting-and-ending-with-given-character.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @param {character} c + * @return {number} + */ +const countSubstrings = function(s, c) { + const n = s.length + const arr = [] + for(let i = 0; i < n; i++) { + if(s[i] === c) { + arr.push(i) + } + } + let len = arr.length + let res = 0 + while(len) { + res += len + len-- + } + + return res +}; From 94cfe98cc3baaecdda7ea842a10e521f049f6261 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Mar 2024 15:44:34 +0800 Subject: [PATCH 1673/2039] Create 3083-existence-of-a-substring-in-a-string-and-its-reverse.js --- ...a-substring-in-a-string-and-its-reverse.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 3083-existence-of-a-substring-in-a-string-and-its-reverse.js diff --git a/3083-existence-of-a-substring-in-a-string-and-its-reverse.js b/3083-existence-of-a-substring-in-a-string-and-its-reverse.js new file mode 100644 index 00000000..51754026 --- /dev/null +++ b/3083-existence-of-a-substring-in-a-string-and-its-reverse.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @return {boolean} + */ +var isSubstringPresent = function(s) { + let res = false + const n = s.length + for(let i = 0; i < n - 1; i++) { + const e = s[i] + s[i + 1] + for(let j = n - 1; j > 0; j--) { + if(s[j] === s[i] && s[j - 1] === s[i + 1]) { + res = true + return res + } + } + } + + return res +}; From d380d4c03402c6ef32fee859a20717d537061bb9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Mar 2024 11:11:55 +0800 Subject: [PATCH 1674/2039] Update 11-container-with-most-water.js --- 11-container-with-most-water.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/11-container-with-most-water.js b/11-container-with-most-water.js index 2b3aa808..763f29d5 100755 --- a/11-container-with-most-water.js +++ b/11-container-with-most-water.js @@ -12,3 +12,27 @@ const maxArea = function(height) { } return res }; + +// another + +/** + * @param {number[]} height + * @return {number} + */ +const maxArea = function(height) { + const n = height.length, {min,max} = Math + let i = 0, j = n - 1, leftMax = height[i], rightMax = height[j] + let res = 0 + while(i < j) { + res = max(res, (j - i) * min(leftMax, rightMax)) + if(leftMax <= rightMax) { + i++ + leftMax = max(leftMax, height[i]) + } else { + j-- + rightMax = max(rightMax, height[j]) + } + } + + return res +}; From 4a74f7fe85f8dd20ceafd61933ecc9f2a1acf8f3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Mar 2024 11:46:40 +0800 Subject: [PATCH 1675/2039] Update 15-3sum.js --- 15-3sum.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/15-3sum.js b/15-3sum.js index 498fc859..65defff5 100755 --- a/15-3sum.js +++ b/15-3sum.js @@ -88,5 +88,37 @@ const threeSum = function(nums) { } } + return res +}; + +// another + +/** + * @param {number[]} nums + * @return {number[][]} + */ +const threeSum = function(nums) { + nums.sort((a, b) => a - b) + const n = nums.length + let res = [] + for(let i = 0; i < n - 2; i++) { + const e = nums[i], target = -e + let l = i + 1, r = n - 1 + while(l < r) { + const tmp = nums[l] + nums[r] + if(tmp < target) l++ + else if(tmp > target) r-- + else { + res.push([nums[i], nums[l], nums[r]]) + l++ + r-- + while(l < r && nums[l] === nums[l - 1]) l++ + while(l < r && nums[r] === nums[r + 1]) r-- + } + } + while(i + 1 < n && nums[i + 1] === e) i++ + } + + return res }; From 1f9f70fdc9194a8f3c472d061d8ccde0c426b4d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Mar 2024 14:02:11 +0800 Subject: [PATCH 1676/2039] Update 16-3sum-closest.js --- 16-3sum-closest.js | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/16-3sum-closest.js b/16-3sum-closest.js index fbe0b658..014c404e 100755 --- a/16-3sum-closest.js +++ b/16-3sum-closest.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +const threeSumClosest = function(nums, target) { + let n = nums.length, {abs, min, max} = Math + let res = nums[0] + nums[1] + nums[2] + nums.sort((a, b) => a - b) + for(let i = 0; i < n - 2; i++) { + let e = nums[i] + let l = i + 1, r = n - 1 + if(i > 0 && nums[i] === nums[i - 1]) continue + while(l < r) { + const tmp = e + nums[l] + nums[r] + if(abs(tmp - target) < abs(res - target)) { + res = tmp + } + if(tmp > target) r-- + else if (tmp < target) l++ + else return tmp + } + } + + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} target From de80e0a414c8f5914a0d1a9747208992175f7491 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Mar 2024 14:46:24 +0800 Subject: [PATCH 1677/2039] Update 18-4sum.js --- 18-4sum.js | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/18-4sum.js b/18-4sum.js index 069b349b..fd34cdf7 100644 --- a/18-4sum.js +++ b/18-4sum.js @@ -88,3 +88,39 @@ function nSum(nums, target, k, start) { } return res; } + + +// another + +/** + * @param {number[]} nums + * @param {number} target + * @return {number[][]} + */ +const fourSum = function(nums, target) { + const res = [], n = nums.length + nums.sort((a, b) => a - b) + for(let a = 0; a < n - 3; a++) { + if(a > 0 && nums[a] === nums[a - 1]) continue + for(let b = a + 1; b < n - 2; b++) { + if(b > a + 1 && nums[b] === nums[a + 1]) continue + if(b > a + 1 && nums[b] === nums[b - 1]) continue + const t = target - nums[a] - nums[b] + let l = b + 1, r = n - 1 + while(l < r) { + const sum = nums[l] + nums[r] + if(sum < t) l++ + else if(sum > t) r-- + else { + res.push([nums[a], nums[b], nums[l], nums[r]]) + l++ + r-- + while(l < r && nums[l] === nums[l - 1]) l++ + while(l < r && nums[r] === nums[r + 1]) r-- + } + } + } + } + + return res +}; From 43a6fcbc1fc9856e6af5b74ba5926512412f5a0d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 20 Mar 2024 13:58:41 +0800 Subject: [PATCH 1678/2039] Update 218-the-skyline-problem.js --- 218-the-skyline-problem.js | 147 +++++++++++++++++++++++++++++++++++++ 1 file changed, 147 insertions(+) diff --git a/218-the-skyline-problem.js b/218-the-skyline-problem.js index 515675d3..0d7016ee 100644 --- a/218-the-skyline-problem.js +++ b/218-the-skyline-problem.js @@ -53,3 +53,150 @@ function combineOutputs(a, b) { } return combined } + + +// another + +/** + * @param {number[][]} buildings + * @return {number[][]} + */ +const getSkyline = function (buildings) { + const n = buildings.length + const arr = [] + const res = [] + for(const [s, e, h] of buildings) { + arr.push([s, -h]) + arr.push([e, h]) + } + arr.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]) + const ms = new MultiSet() + ms.insert(0) + let pre = 0 + for(const [p, h] of arr) { + h < 0 ? ms.insert(-h) : ms.eraseOne(h) + const cur = ms.last() + if(cur !== pre) { + res.push([p, cur]) + pre = cur + } + } + + + return res +} + +//////////////////////// Template ////////////////////////////////// +function Bisect() { + return { insort_right, insort_left, bisect_left, bisect_right } + function insort_right(a, x, lo = 0, hi = null) { + lo = bisect_right(a, x, lo, hi); + a.splice(lo, 0, x); + } + function bisect_right(a, x, lo = 0, hi = null) { // > upper_bound + if (lo < 0) throw new Error('lo must be non-negative'); + if (hi == null) hi = a.length; + while (lo < hi) { + let mid = parseInt((lo + hi) / 2); + a[mid] > x ? hi = mid : lo = mid + 1; + } + return lo; + } + function insort_left(a, x, lo = 0, hi = null) { + lo = bisect_left(a, x, lo, hi); + a.splice(lo, 0, x); + } + function bisect_left(a, x, lo = 0, hi = null) { // >= lower_bound + if (lo < 0) throw new Error('lo must be non-negative'); + if (hi == null) hi = a.length; + while (lo < hi) { + let mid = parseInt((lo + hi) / 2); + a[mid] < x ? lo = mid + 1 : hi = mid; + } + return lo; + } +} + +function MultiSet(elements) { + let a = [], m = new Map(), bi = new Bisect(); + initialize(); + return { insert, first, last, get, search, poll, pollLast, lower_bound, upper_bound, findKth, eraseByIndex, eraseOne, eraseAll, contains, size, clear, show }; + function initialize() { + if (elements) { + for (const x of elements) { + bi.insort_right(a, x); + m.set(x, m.get(x) + 1 || 1); + } + } + } + function insert(x) { + bi.insort_right(a, x); + m.set(x, m.get(x) + 1 || 1); + } + function first() { + return a[0]; + } + function last() { + return a[a.length - 1]; + } + function get(i) { + return a[i]; + } + function poll() { + let res = a[0]; + a.splice(0, 1); + removeOneOrManyMap(m, res); + return res; + } + function pollLast() { + let res = a.pop(); + removeOneOrManyMap(m, res); + return res; + } + function lower_bound(x) { + return bi.bisect_left(a, x); + } + function upper_bound(x) { + return bi.bisect_right(a, x); + } + function findKth(k) { + return a[k - 1]; + } + function search(x) { + return lower_bound(x); + } + function eraseByIndex(idx) { + removeOneOrManyMap(m, a[idx]); + a.splice(idx, 1); + } + function eraseOne(x) { + let idx = lower_bound(x); + if (a[idx] == x) a.splice(idx, 1); + removeOneOrManyMap(m, x); + } + function eraseAll(x) { + if (contains(x)) { + let idx = search(x), occ = m.get(x); + while (occ--) a.splice(idx, 1); + m.delete(x); + } + } + function removeOneOrManyMap(m, x, cnt = 1) { + let occ = m.get(x); + occ > cnt ? m.set(x, occ - cnt) : m.delete(x); + } + function contains(x) { + return m.has(x); + } + function size() { + return a.length; + } + function clear() { + a = []; + m.clear(); + } + function show() { + return a; + } +} +/////////////////////////////////////////////////////////////////// From 4351270c111db3ebcb0399bae2f0855518b063a1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 21 Mar 2024 18:27:31 +0800 Subject: [PATCH 1679/2039] Update 699-falling-squares.js --- 699-falling-squares.js | 54 +++++++++++++++++++++++------------------- 1 file changed, 29 insertions(+), 25 deletions(-) diff --git a/699-falling-squares.js b/699-falling-squares.js index aeebee63..f0d08104 100644 --- a/699-falling-squares.js +++ b/699-falling-squares.js @@ -1,36 +1,40 @@ +class Interval { + constructor(s,e,h) { + this.start = s + this.end = e + this.height = h + } +} /** * @param {number[][]} positions * @return {number[]} */ -class Interval { - constructor(start, end, height) { - this.start = start - this.end = end - this.height = height - } -} -function fallingSquares(positions) { - const intervals = [] +const fallingSquares = function(positions) { + const n = positions.length const res = [] - let h = 0 - for (let pos of positions) { - let cur = new Interval(pos[0], pos[0] + pos[1], pos[1]) - h = Math.max(h, getHeight(intervals, cur)) - res.push(h) + const intervals = [] + let curMax = 0 + for(let i = 0; i < n; i++) { + const [s, len] = positions[i] + const ins = new Interval(s, s + len, len) + curMax = Math.max(curMax, getHeight(intervals, ins)) + res.push(curMax) } - console.log(intervals) + return res -} -function getHeight(intervals, cur) { - let preMaxHeight = 0 - for (let i of intervals) { - if (i.end <= cur.start) continue - if (i.start >= cur.end) continue - preMaxHeight = Math.max(preMaxHeight, i.height) +}; + +function getHeight(intervals, ins) { + let preMax = 0 + for(const e of intervals) { + if(ins.start >= e.end) continue + if(ins.end <= e.start) continue + preMax = Math.max(preMax, e.height) } - cur.height += preMaxHeight - intervals.push(cur) - return cur.height + + ins.height += preMax + intervals.push(ins) + return ins.height } // another From 7aa0135505c5eea96a27fb9b9225173a107f837f Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Mar 2024 14:00:11 +0800 Subject: [PATCH 1680/2039] Update 3072-distribute-elements-into-two-arrays-ii.js --- ...-distribute-elements-into-two-arrays-ii.js | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/3072-distribute-elements-into-two-arrays-ii.js b/3072-distribute-elements-into-two-arrays-ii.js index ea9db49d..e8e54dec 100644 --- a/3072-distribute-elements-into-two-arrays-ii.js +++ b/3072-distribute-elements-into-two-arrays-ii.js @@ -1,3 +1,53 @@ +const binarySearch = function (arr, val) { + let start = 0, + end = arr.length - 1 + while (start < end) { + const mid = Math.floor((start + end) / 2) + if (arr[mid] > val) { + end = mid + } else { + start = mid + 1 + } + } + if (arr[start] <= val) { + start++; + } + return [arr.length - start, start] +} + +/** + * @param {number[]} nums + * @return {number[]} + */ +const resultArray = function(nums) { + const arr1 = [nums[0]], + arr2 = [nums[1]] + let sortedArr1 = [nums[0]], + sortedArr2 = [nums[1]] + for (let i = 2; i < nums.length; i++) { + const n = nums[i], + [gc1, s1] = binarySearch(sortedArr1, n), + [gc2, s2] = binarySearch(sortedArr2, n) + if (gc1 > gc2) { + arr1.push(n) + sortedArr1.splice(s1, 0, n) + } else if (gc2 > gc1) { + arr2.push(n) + sortedArr2.splice(s2, 0, n) + } else if (arr2.length < arr1.length){ + arr2.push(n) + sortedArr2.splice(s2, 0, n) + } else { + arr1.push(n) + sortedArr1.splice(s1, 0, n) + } + } + return [...arr1, ...arr2] +}; + +// another + + //#region AVL Tree /** * @typedef {"keep-all" | "override" | "ignore"} DuplicateMode From 063980a58f9291e463476bc33b2fe3dc9ae5d0f9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 25 Mar 2024 14:19:16 +0800 Subject: [PATCH 1681/2039] Update 3072-distribute-elements-into-two-arrays-ii.js --- ...-distribute-elements-into-two-arrays-ii.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/3072-distribute-elements-into-two-arrays-ii.js b/3072-distribute-elements-into-two-arrays-ii.js index e8e54dec..96356a43 100644 --- a/3072-distribute-elements-into-two-arrays-ii.js +++ b/3072-distribute-elements-into-two-arrays-ii.js @@ -1,3 +1,46 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +const resultArray = function(nums) { + const n = nums.length + const a1 = [nums[0]], a2 = [nums[1]], a1s = [nums[0]], a2s = [nums[1]] + for(let i = 2; i < n; i++) { + const e = nums[i] + const [gc1, s1] = bs(a1s, e) + const [gc2, s2] = bs(a2s, e) + if(gc1 > gc2) { + a1.push(e) + a1s.splice(s1, 0, e) + } else if(gc1 < gc2) { + a2.push(e) + a2s.splice(s2, 0, e) + } else if(a1.length > a2.length) { + a2.push(e) + a2s.splice(s2, 0, e) + } else { + a1.push(e) + a1s.splice(s1, 0, e) + } + } + + return [...a1, ...a2] + + function bs(arr, val) { + const n = arr.length + let l = 0, r = n - 1 + while(l < r) { + const mid = Math.floor((l + r) / 2) + if(arr[mid] > val) r = mid + else l = mid + 1 + } + if(arr[l] <= val) l++ + return [n - l, l] + } +}; + +// another + const binarySearch = function (arr, val) { let start = 0, end = arr.length - 1 From 668efd3743c572691de56e7b63143fdbc59ff257 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Mar 2024 12:42:37 +0800 Subject: [PATCH 1682/2039] Create 2916-subarrays-distinct-element-sum-of-squares-ii.js --- ...rays-distinct-element-sum-of-squares-ii.js | 67 +++++++++++++++++++ 1 file changed, 67 insertions(+) create mode 100644 2916-subarrays-distinct-element-sum-of-squares-ii.js diff --git a/2916-subarrays-distinct-element-sum-of-squares-ii.js b/2916-subarrays-distinct-element-sum-of-squares-ii.js new file mode 100644 index 00000000..041d74da --- /dev/null +++ b/2916-subarrays-distinct-element-sum-of-squares-ii.js @@ -0,0 +1,67 @@ +const MOD = 1e9 + 7; +/** + * @param {number[]} nums + * @return {number} + */ +const sumCounts = function(nums) { + let n = nums.length; + const last_pos = Array(100001).fill(-1); + + const tree = new SegmentTree(n); + let res = 0; + + for (let j = 0; j < n; j ++) { + let st = last_pos[nums[j]] + 1, ed = j; + tree.AddOne(st, ed); + + res = (res + tree.sqr[0]) % MOD; + + last_pos[nums[j]] = j; + } + return res; +}; + + +class SegmentTree { + constructor (n) { + this.n = n + this.lzy = Array(4*n).fill(0); + this.sum = Array(4*n).fill(0); + this.sqr = Array(4*n).fill(0); + } + + update_lzy( l, r, i) { + const {lzy, sum, sqr} = this + + if (l != r) { + lzy[i*2+1] += lzy[i]; + lzy[i*2+2] += lzy[i]; + } + let gap = r-l+1; + let new_sum = sum[i] + lzy[i]*gap; + let new_sqr = sqr[i] + lzy[i]*sum[i]*2 + lzy[i]*lzy[i]*gap; + + sum[i] = new_sum % MOD; + sqr[i] = new_sqr % MOD; + lzy[i] = 0; + } + + AddOne ( x, y, l = 0, r = -1, i = 0) { + const {lzy, sum, sqr, n} = this + if (r == -1) r += n; + this.update_lzy(l, r, i); + + if (r < x || l > y) return; + if (l >= x && r <= y) { + lzy[i] = 1; + return this.update_lzy(l, r, i); + } + + let m = (l+r) >> 1; + this.AddOne (x, y, l, m, i*2+1); + this.AddOne (x, y, m+1, r, i*2+2); + + sum[i] = (sum[i*2+1] + sum[i*2+2]) % MOD; + sqr[i] = (sqr[i*2+1] + sqr[i*2+2]) % MOD; + } +}; From 2f9f65a8812896e5f1f87fd0f04ae94f1d3c74bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Mar 2024 15:50:01 +0800 Subject: [PATCH 1683/2039] Update 2977-minimum-cost-to-convert-string-ii.js --- 2977-minimum-cost-to-convert-string-ii.js | 62 +++++++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/2977-minimum-cost-to-convert-string-ii.js b/2977-minimum-cost-to-convert-string-ii.js index 6246f37f..0d152f85 100644 --- a/2977-minimum-cost-to-convert-string-ii.js +++ b/2977-minimum-cost-to-convert-string-ii.js @@ -1,3 +1,65 @@ +/** + * @param {string} source + * @param {string} target + * @param {string[]} original + * @param {string[]} changed + * @param {number[]} cost + * @return {number} + */ +var minimumCost = function (source, target, original, changed, cost) { + const index = {} + const set = new Set() + for(const e of original) set.add(e) + for(const e of changed) set.add(e) + let idx = 0 + for(const e of set) { + index[e] = idx + idx++ + } + + const n = set.size + const dis = Array.from({ length: n }, () => Array(n).fill(Infinity)) + for(let i = 0; i < original.length; i++) { + const s = index[original[i]], e = index[changed[i]] + dis[s][e] = Math.min(dis[s][e], cost[i]) + } + for(let k = 0; k < n; k++) { + for(let i = 0; i < n; i++) { + if(dis[i][k] === Infinity) continue + for(let j = 0; j < n; j++) { + if(dis[k][j] === Infinity) continue + dis[i][j] = Math.min(dis[i][j], dis[i][k] + dis[k][j]) + } + } + } + const lenSet = new Set() + for(const e of original) lenSet.add(e.length) + const len = source.length + const dp = Array(len + 1).fill(Infinity) + dp[0] = 0 + for(let i = 0; i < len; i++) { + if(dp[i] === Infinity) continue + if(source[i] === target[i]) { + dp[i + 1] = Math.min(dp[i + 1], dp[i]) + } + for(const le of lenSet) { + if(i + le > len) continue + const sub = source.slice(i, i + le) + const subT = target.slice(i, i + le) + const sIdx = index.hasOwnProperty(sub) ? index[sub] : -1 + const tIdx = index.hasOwnProperty(subT) ? index[subT] : -1 + if(sIdx >= 0 && tIdx >= 0 && dis[sIdx][tIdx] !== Infinity) { + dp[i + le] = Math.min(dp[i + le], dp[i] + dis[sIdx][tIdx]) + } + } + } + // console.log(dis,dp) + return dp.at(-1) === Infinity ? -1 : dp.at(-1) +} + +// another + + /** * @param {string} source * @param {string} target From 87af4396e5d9e6d248c9b893a10abefe0fdd60c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 30 Mar 2024 18:45:34 +0800 Subject: [PATCH 1684/2039] Create 3041-maximize-consecutive-elements-in-an-array-after-modification.js --- ...elements-in-an-array-after-modification.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 3041-maximize-consecutive-elements-in-an-array-after-modification.js diff --git a/3041-maximize-consecutive-elements-in-an-array-after-modification.js b/3041-maximize-consecutive-elements-in-an-array-after-modification.js new file mode 100644 index 00000000..f18f6a25 --- /dev/null +++ b/3041-maximize-consecutive-elements-in-an-array-after-modification.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxSelectedElements = function (nums) { + let dp = new Uint32Array(1e6 + 2) + let n = nums.length + nums.sort((a, b) => a - b) + + dp.fill(0, 0, nums[n - 1] + 1) + let res = 1 + for (let i = 0; i < n; ++i) { + let x = nums[i] + dp[x + 1] = dp[x] + 1 + dp[x] = dp[x - 1] + 1 + res = Math.max(res, dp[x], dp[x + 1]) + } + + return res +} From 2860ff373f546b22700b0d94abb7fb36f9506ec7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 1 Apr 2024 12:45:21 +0800 Subject: [PATCH 1685/2039] Update 3077-maximum-strength-of-k-disjoint-subarrays.js --- ...aximum-strength-of-k-disjoint-subarrays.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/3077-maximum-strength-of-k-disjoint-subarrays.js b/3077-maximum-strength-of-k-disjoint-subarrays.js index 5cb724d4..87e664b8 100644 --- a/3077-maximum-strength-of-k-disjoint-subarrays.js +++ b/3077-maximum-strength-of-k-disjoint-subarrays.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumStrength = function(nums, k) { + const n = nums.length; + let dp = new Array(n + 1).fill(0); + + for (let i = 0; i < k; i++) { + let m = k - i; + m = (i % 2 === 0) ? m : -m; + const nextdp = new Array(n + 1).fill(-Infinity); + for (let j = 1; j <= n; j++) { + nextdp[j] = Math.max(nextdp[j-1], dp[j-1]) + nums[j-1] * m; + } + dp = nextdp; + for (let j = 1; j <= n; j++) { + dp[j] = Math.max(dp[j-1], dp[j]); + } + } + return dp[n]; +}; + + +// another + let pre = Array(10001).fill(0); let cur = Array(10001).fill(0); let ps = Array(10001).fill(0); From e240cda597abac5f8a89c7b59b994aef0f315637 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 1 Apr 2024 13:55:28 +0800 Subject: [PATCH 1686/2039] Update 3077-maximum-strength-of-k-disjoint-subarrays.js --- ...aximum-strength-of-k-disjoint-subarrays.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/3077-maximum-strength-of-k-disjoint-subarrays.js b/3077-maximum-strength-of-k-disjoint-subarrays.js index 87e664b8..b37816ec 100644 --- a/3077-maximum-strength-of-k-disjoint-subarrays.js +++ b/3077-maximum-strength-of-k-disjoint-subarrays.js @@ -23,6 +23,33 @@ const maximumStrength = function(nums, k) { }; +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumStrength = function(nums, k) { + let dp = new Array(k + 1).fill(0).map(() => new Array(nums.length + 1).fill(0)); + + for (let i = 1; i <= k; i++) { + let maxSum = Number.MIN_SAFE_INTEGER / 2; + let curr = Number.MIN_SAFE_INTEGER / 2; + let multiplier = (i % 2 === 1) ? (k + 1 - i) : (i - 1 - k); + + for (let j = i - 1; j < nums.length; j++) { + curr = Math.max(curr + nums[j] * multiplier, dp[i - 1][j] + nums[j] * multiplier); + maxSum = Math.max(maxSum, curr); + dp[i][j + 1] = maxSum; + } + } + + return dp[k][nums.length]; +}; + + + // another let pre = Array(10001).fill(0); From 9a9988b991efb70f8ec115216bf4857245a253cd Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Apr 2024 11:48:49 +0800 Subject: [PATCH 1687/2039] Create 3082-find-the-sum-of-the-power-of-all-subsequences.js --- ...d-the-sum-of-the-power-of-all-subsequences.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3082-find-the-sum-of-the-power-of-all-subsequences.js diff --git a/3082-find-the-sum-of-the-power-of-all-subsequences.js b/3082-find-the-sum-of-the-power-of-all-subsequences.js new file mode 100644 index 00000000..200422a2 --- /dev/null +++ b/3082-find-the-sum-of-the-power-of-all-subsequences.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const sumOfPower = function(nums, k) { + const n = nums.length, mod = 1e9 + 7; + const dp = Array(k + 1).fill(0) + dp[0] = 1; + for (const a of nums) { + for (let v = k; v >= 0; v--) { + dp[v] = (dp[v] * 2 % mod + (v >= a ? dp[v - a] : 0)) % mod + } + } + return dp[k]; +}; From 3c391fa597544bc93b048e7580ebe9ee0c247ede Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Apr 2024 12:24:12 +0800 Subject: [PATCH 1688/2039] Update 3082-find-the-sum-of-the-power-of-all-subsequences.js --- ...he-sum-of-the-power-of-all-subsequences.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/3082-find-the-sum-of-the-power-of-all-subsequences.js b/3082-find-the-sum-of-the-power-of-all-subsequences.js index 200422a2..9944513e 100644 --- a/3082-find-the-sum-of-the-power-of-all-subsequences.js +++ b/3082-find-the-sum-of-the-power-of-all-subsequences.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const sumOfPower = function(nums, k) { + const n = nums.length, mod = 1e9 + 7; + const dp = Array.from({ length: n + 1 }, () => Array(k + 1).fill(0)) + dp[0][0] = 1 + let res = 0, pow = 1 + for(const e of nums) { + for(let j = k; j >= e; j--) { + for(let i = n; i > 0; i--) { + dp[i][j] = (dp[i][j] + dp[i - 1][j - e]) % mod + } + } + } + for(let i = n; i > 0; i--) { + res = (res + (dp[i][k] * pow) % mod) % mod + pow *= 2 + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} k From 03c201075e1c6c7e6c7488f6d786feebea309eb5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Apr 2024 12:52:12 +0800 Subject: [PATCH 1689/2039] Create 2930-number-of-strings-which-can-be-rearranged-to-contain-substring.js --- ...-can-be-rearranged-to-contain-substring.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 2930-number-of-strings-which-can-be-rearranged-to-contain-substring.js diff --git a/2930-number-of-strings-which-can-be-rearranged-to-contain-substring.js b/2930-number-of-strings-which-can-be-rearranged-to-contain-substring.js new file mode 100644 index 00000000..d9dac832 --- /dev/null +++ b/2930-number-of-strings-which-can-be-rearranged-to-contain-substring.js @@ -0,0 +1,31 @@ +/** + * @param {number} n + * @return {number} + */ +const stringCount = function(n) { + const LEET = parseInt('1111', 2), + L = parseInt('1000', 2), + FE = parseInt('0100', 2), + SE = parseInt('0010', 2), + T = parseInt('0001', 2), + MOD = 1e9 + 7 + const dp = Array.from({ length: n }, () => Array(16).fill(-1)) + return helper(0, 0) + + function helper(i, mask) { + if(i === n) { + return mask === LEET ? 1 : 0 + } + if(dp[i][mask] !== -1) return dp[i][mask] + + let res = (helper(i + 1, mask | L) + helper(i + 1, mask | T)) % MOD + if(mask & FE) { + res = (res + helper(i + 1, mask | SE)) % MOD + } else { + res = (res + helper(i + 1, mask | FE)) % MOD + } + res = (res + 23 * helper(i + 1, mask)) % MOD + dp[i][mask] = res + return dp[i][mask] + } +}; From 5c61474190ab76336de15f731dcdf2454bd8a2e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Apr 2024 18:59:08 +0800 Subject: [PATCH 1690/2039] Create 3098-find-the-sum-of-subsequence-powers.js --- 3098-find-the-sum-of-subsequence-powers.js | 26 ++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 3098-find-the-sum-of-subsequence-powers.js diff --git a/3098-find-the-sum-of-subsequence-powers.js b/3098-find-the-sum-of-subsequence-powers.js new file mode 100644 index 00000000..4b9902f7 --- /dev/null +++ b/3098-find-the-sum-of-subsequence-powers.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var sumOfPowers = function (nums, k) { + const mod = 1e9 + 7 + + let n, res, a, memo + a = nums + a.sort((x, y) => x - y) + n = a.length + memo = new Map() + const dfs = (i, k, pre, mi) => { + if (k == 0) return mi + if (n - i - 1 < k) return 0 + let ke = i + ' ' + k + ' ' + pre + ' ' + mi + if (memo.has(ke)) return memo.get(ke) + res = dfs(i + 1, k - 1, a[i + 1], Math.min(mi, a[i + 1] - pre)) + res += dfs(i + 1, k, pre, mi) + memo.set(ke, res) + return res % mod + } + res = dfs(-1, k, -Infinity, Infinity) + return res +} From a5b7b3e51aff5b2750cfd71d732d5e1436a57a04 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Apr 2024 17:04:36 +0800 Subject: [PATCH 1691/2039] Update 2954-count-the-number-of-infection-sequences.js --- ...count-the-number-of-infection-sequences.js | 65 +++++++++++++++++++ 1 file changed, 65 insertions(+) diff --git a/2954-count-the-number-of-infection-sequences.js b/2954-count-the-number-of-infection-sequences.js index 5891fe6a..86db31f4 100644 --- a/2954-count-the-number-of-infection-sequences.js +++ b/2954-count-the-number-of-infection-sequences.js @@ -1,3 +1,68 @@ +const MOD = 1e9 + 7; +const MX = 100000; +const big = BigInt + +const FAC = new Array(MX).fill(0); +const INV_FAC = new Array(MX).fill(0); + +FAC[0] = 1; +for (let i = 1; i < MX; i++) { + FAC[i] = mul(FAC[i - 1], i) % MOD; +} + +INV_FAC[MX - 1] = pow(FAC[MX - 1], MOD - 2); +for (let i = MX - 1; i > 0; i--) { + INV_FAC[i - 1] = mul(INV_FAC[i], i) % MOD; +} + +function comb(n, k) { + return mul(mul(FAC[n], INV_FAC[k]), INV_FAC[n - k]) % MOD; +} +/** + * @param {number} n + * @param {number[]} sick + * @return {number} + */ +var numberOfSequence = function(n, sick) { + const a = sick + const m = a.length; + let total = n - m; + let ans = mul(comb(total, a[0]), comb(total - a[0], n - a[m - 1] - 1)); + total -= a[0] + n - a[m - 1] - 1; + let e = 0; + for (let i = 1; i < m; i++) { + const k = a[i] - a[i - 1] - 1; + if (k > 0) { + e += k - 1; + ans = mul(ans, comb(total, k)); + total -= k; + } + } + return mul(ans, pow(2, e)); +}; + +function pow(x, n) { + + const mod = big(MOD) + let res = 1n; + x = big(x) + while (n > 0) { + if (n % 2 === 1) { + res = (res * x) % mod; + } + x = (x * x) % mod; + n = Math.floor(n / 2); + } + return Number(res); +} + +function mul(a, b) { + return Number(big(a) * big(b) % big(MOD)) +} + +// another + + //#region Modulo class Modulo { /** From 49bb420ef73ecde4e0062118c7b692448decf7f6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Apr 2024 12:09:26 +0800 Subject: [PATCH 1692/2039] Create 3105-longest-strictly-increasing-or-strictly-decreasing-subarray.js --- ...reasing-or-strictly-decreasing-subarray.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 3105-longest-strictly-increasing-or-strictly-decreasing-subarray.js diff --git a/3105-longest-strictly-increasing-or-strictly-decreasing-subarray.js b/3105-longest-strictly-increasing-or-strictly-decreasing-subarray.js new file mode 100644 index 00000000..0be0a8fc --- /dev/null +++ b/3105-longest-strictly-increasing-or-strictly-decreasing-subarray.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var longestMonotonicSubarray = function(nums) { + const n = nums.length + return Math.max(inc(), desc()) + + function inc() { + let res = 1, cur = 1 + for(let i = 1; i < n; i++) { + if(nums[i] > nums[i - 1]) { + cur++ + res = Math.max(res, cur) + } else { + cur = 1 + } + } + + return res + } + + function desc() { + let res = 1, cur = 1 + for(let i = 1; i < n; i++) { + if(nums[i] < nums[i - 1]) { + cur++ + res = Math.max(res, cur) + } else { + cur = 1 + } + } + + return res + } +}; From 2e4b11e97ed3a832d06b05035806501ccea8036d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Apr 2024 12:10:04 +0800 Subject: [PATCH 1693/2039] Create 3106-lexicographically-smallest-string-after-operations-with-constraint.js --- ...string-after-operations-with-constraint.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 3106-lexicographically-smallest-string-after-operations-with-constraint.js diff --git a/3106-lexicographically-smallest-string-after-operations-with-constraint.js b/3106-lexicographically-smallest-string-after-operations-with-constraint.js new file mode 100644 index 00000000..c2e9da1b --- /dev/null +++ b/3106-lexicographically-smallest-string-after-operations-with-constraint.js @@ -0,0 +1,37 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +const getSmallestString = function(s, k) { + const n = s.length + s = s + s + const a = 'a'.charCodeAt(0) + let res = '', idx = 0 + for(let j = 0; j < n; j++) { + for(let i = 0; i < 26; i++) { + const len = chk(a + i, j) + if(len === 0) { + res += s[j] + break + } else if(len && len <= k) { + k -= len + res += String.fromCharCode(a + i) + break + } + } + } + + + return res + + function chk(code, targetIdx) { + const targetCode = s[targetIdx].charCodeAt(0) + if(targetCode > code) { + return Math.min(targetCode - code, code + 26 - targetCode) + } else { + return Math.min(code - targetCode, targetCode + 26 - code) + } + + } +}; From e6e824b66bedf43fa59e1d60f951cb864c4a4504 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Apr 2024 12:10:48 +0800 Subject: [PATCH 1694/2039] Create 3107-minimum-operations-to-make-median-of-array-equal-to-k.js --- ...ions-to-make-median-of-array-equal-to-k.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 3107-minimum-operations-to-make-median-of-array-equal-to-k.js diff --git a/3107-minimum-operations-to-make-median-of-array-equal-to-k.js b/3107-minimum-operations-to-make-median-of-array-equal-to-k.js new file mode 100644 index 00000000..af16bb11 --- /dev/null +++ b/3107-minimum-operations-to-make-median-of-array-equal-to-k.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minOperationsToMakeMedianK = function(nums, k) { + nums.sort((a, b) => a - b) + + let n = nums.length + let medIdx = Math.floor(n / 2) + let res = 0 + + for(let i = 0; i < n; i++) { + if(nums[i] < k && medIdx <= i) { + res = res + (k - nums[i]) + } + else if(nums[i] > k && medIdx >= i) { + res = res + (nums[i] - k) + } + } + + return res +}; + From f18d8b95266d2cacae6496ca2a11b1ea3f5febc2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Apr 2024 12:11:22 +0800 Subject: [PATCH 1695/2039] Create 3108-minimum-cost-walk-in-weighted-graph.js --- 3108-minimum-cost-walk-in-weighted-graph.js | 94 +++++++++++++++++++++ 1 file changed, 94 insertions(+) create mode 100644 3108-minimum-cost-walk-in-weighted-graph.js diff --git a/3108-minimum-cost-walk-in-weighted-graph.js b/3108-minimum-cost-walk-in-weighted-graph.js new file mode 100644 index 00000000..d538c09b --- /dev/null +++ b/3108-minimum-cost-walk-in-weighted-graph.js @@ -0,0 +1,94 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[][]} query + * @return {number[]} + */ +var minimumCost = function (n, edges, query) { + const map = new Map() + const ufs = new UFS(n) + + for (let i = 0; i < edges.length; i++) { + const [a, b, e] = edges[i] + ufs.union(a, b) + } + + for (let i = 0; i < edges.length; i++) { + const [a, b, e] = edges[i] + const rootA = ufs.find(a) + const rootB = ufs.find(b) + + const root = ufs.find(a) + let tmp = e + if (map.has(rootA)) { + tmp = e & map.get(rootA) + } + if (map.has(rootB)) { + tmp = e & map.get(rootB) + } + map.set(root, tmp) + } + + const ans = [] + for (let i = 0; i < query.length; i++) { + const [s, t] = query[i] + const rootA = ufs.find(s) + const rootB = ufs.find(t) + + if (rootA !== rootB) { + ans.push(-1) + } else if (s === t) { + ans.push(0) + } else { + ans.push(map.get(rootA)) + } + } + + return ans +} + +class UFS { + constructor(n) { + this.parent = new Array(n).fill(0).map((_, i) => i) + this.rank = new Array(n).fill(0) + this.size = n + this.sz = new Array(n).fill(1) + } + + find(x) { + if (x !== this.parent[x]) { + this.parent[x] = this.find(this.parent[x]) + } + return this.parent[x] + } + + union(x, y) { + const px = this.find(x) + const py = this.find(y) + + if (px === py) { + return false + } + + if (this.rank[px] > this.rank[py]) { + this.parent[py] = px + this.sz[px] += this.sz[py] + } else if (this.rank[px] < this.rank[py]) { + this.parent[px] = py + this.sz[py] += this.sz[px] + } else { + this.parent[px] = py + this.sz[py] += this.sz[px] + this.rank[px]++ + } + + this.size-- + return true + } + + reset() { + this.parent = new Array(n).fill(0).map((_, i) => i) + this.rank = new Array(n).fill(0) + this.size = n + } +} From bf03657fd90f7e5d3998559d97272efd6577c952 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Apr 2024 14:14:28 +0800 Subject: [PATCH 1696/2039] Update 462-minimum-moves-to-equal-array-elements-II.js --- ...inimum-moves-to-equal-array-elements-II.js | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) diff --git a/462-minimum-moves-to-equal-array-elements-II.js b/462-minimum-moves-to-equal-array-elements-II.js index 4919debd..1695d55a 100755 --- a/462-minimum-moves-to-equal-array-elements-II.js +++ b/462-minimum-moves-to-equal-array-elements-II.js @@ -14,3 +14,63 @@ const minMoves2 = function(nums) { } return res; }; + +// another + +/** + * @param {number[]} nums + * @return {number} + */ +const minMoves2 = function (nums) { + const n = nums.length + const mid = Math.floor(n / 2) + const nth = nthElement(nums, mid, (a, b) => a - b) + let res = 0 + for (let i = 0; i < n; i++) { + res += Math.abs(nums[i] - nth) + } + + return res +} + +function nthElement(arr, n, compareFn) { + if (n < 0 || n >= arr.length) { + throw new Error('Invalid index') + } + + const partition = (arr, left, right, pivotIndex) => { + const pivotValue = arr[pivotIndex] + ;[arr[pivotIndex], arr[right]] = [arr[right], arr[pivotIndex]] + let storeIndex = left + + for (let i = left; i < right; i++) { + if (compareFn(arr[i], pivotValue) < 0) { + ;[arr[i], arr[storeIndex]] = [arr[storeIndex], arr[i]] + storeIndex++ + } + } + + ;[arr[right], arr[storeIndex]] = [arr[storeIndex], arr[right]] + return storeIndex + } + + const select = (arr, left, right, k) => { + if (left === right) { + return arr[left] + } + + let pivotIndex = Math.floor(Math.random() * (right - left + 1)) + left + pivotIndex = partition(arr, left, right, pivotIndex) + + if (k === pivotIndex) { + return arr[k] + } else if (k < pivotIndex) { + return select(arr, left, pivotIndex - 1, k) + } else { + return select(arr, pivotIndex + 1, right, k) + } + } + + return select(arr, 0, arr.length - 1, n) +} + From a3a343cb39b561ff7c247073bed4a3373e75f830 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 8 Apr 2024 13:36:57 +0800 Subject: [PATCH 1697/2039] Update 2448-minimum-cost-to-make-array-equal.js --- 2448-minimum-cost-to-make-array-equal.js | 41 ++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/2448-minimum-cost-to-make-array-equal.js b/2448-minimum-cost-to-make-array-equal.js index ea777961..39f0e560 100644 --- a/2448-minimum-cost-to-make-array-equal.js +++ b/2448-minimum-cost-to-make-array-equal.js @@ -29,3 +29,44 @@ const minCost = function (nums, cost) { return res } } + +// another + +/** + * @param {number[]} nums + * @param {number[]} cost + * @return {number} + */ +const minCost = function(nums, cost) { + const n = nums.length + const {min, max, abs, floor} = Math + let l = Infinity, r = -Infinity + + for(const e of nums) { + l = min(e, l) + r = max(e, r) + } + let res = calcCost(l) + while(l < r) { + const mid = floor((l + r) / 2) + const v1 = calcCost(mid) + const v2 = calcCost(mid + 1) + res = min(res, v1, v2) + if(v1 < v2) { + r = mid + } else { + l = mid + 1 + } + } + + return res + + + function calcCost(x) { + let res = 0 + for(let i = 0; i < n; i++) { + res += abs(nums[i] - x) * cost[i] + } + return res + } +}; From adf51d2447e0d3a9c7e5a80ce920ce3d54bcc8a4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 9 Apr 2024 18:32:47 +0800 Subject: [PATCH 1698/2039] Update 2033-minimum-operations-to-make-a-uni-value-grid.js --- ...mum-operations-to-make-a-uni-value-grid.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/2033-minimum-operations-to-make-a-uni-value-grid.js b/2033-minimum-operations-to-make-a-uni-value-grid.js index edb3acc4..43f45805 100644 --- a/2033-minimum-operations-to-make-a-uni-value-grid.js +++ b/2033-minimum-operations-to-make-a-uni-value-grid.js @@ -1,3 +1,30 @@ +/** + * @param {number[][]} grid + * @param {number} x + * @return {number} + */ +function minOperations(grid, x) { + const m = grid.length, n = grid[0].length + const len = m * n, arr = [] + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + arr.push(grid[i][j]) + } + } + arr.sort((a, b) => a - b) + const mid = arr[Math.floor(len / 2)] + let res = 0 + for(const e of arr) { + const d = Math.abs(e - mid) + if(d % x !== 0) return -1 + res += d / x + } + + return res +}; + +// another + /** * @param {number[][]} grid * @param {number} x From b8a22917074ad280f670dc29c7d4823378a069bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Apr 2024 16:43:08 +0800 Subject: [PATCH 1699/2039] Create 3116-kth-smallest-amount-with-single-denomination-combination.js --- ...nt-with-single-denomination-combination.js | 59 +++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 3116-kth-smallest-amount-with-single-denomination-combination.js diff --git a/3116-kth-smallest-amount-with-single-denomination-combination.js b/3116-kth-smallest-amount-with-single-denomination-combination.js new file mode 100644 index 00000000..fd7401cf --- /dev/null +++ b/3116-kth-smallest-amount-with-single-denomination-combination.js @@ -0,0 +1,59 @@ +function calcLcm(a, b) { + let p = a * b + + let t = 0 + while (b) { + t = b + b = a % b + a = t + } + + return p / a +} + +/** + * @param {number[]} coins + * @param {number} k + * @return {number} + */ +var findKthSmallest = function (coins, k) { + let n = coins.length + + let cnt = 0 + let lcm = 1 + let sgn = -1 + let cur = 0 + let res = 0 + + let l = 1 + let r = 50000000000 + + while (l <= r) { + cur = Math.floor((l + r) / 2) + cnt = 0 + bt(0) + + if (cnt >= k) { + res = cur + r = cur - 1 + } else { + l = cur + 1 + } + } + + return res + + function bt(i) { + let bak = lcm + lcm = calcLcm(lcm, coins[i]) + sgn = -sgn + cnt += sgn * Math.floor(cur / lcm) + + ++i + if (i < n) bt(i) + + lcm = bak + sgn = -sgn + if (i < n) bt(i) + } +} From d88619c9d56108273fecab9fbe69c01f71724419 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Apr 2024 16:46:30 +0800 Subject: [PATCH 1700/2039] Create 3117-minimum-sum-of-values-by-dividing-array.js --- ...minimum-sum-of-values-by-dividing-array.js | 243 ++++++++++++++++++ 1 file changed, 243 insertions(+) create mode 100644 3117-minimum-sum-of-values-by-dividing-array.js diff --git a/3117-minimum-sum-of-values-by-dividing-array.js b/3117-minimum-sum-of-values-by-dividing-array.js new file mode 100644 index 00000000..7c6eb968 --- /dev/null +++ b/3117-minimum-sum-of-values-by-dividing-array.js @@ -0,0 +1,243 @@ +//#region Circular Queue +/** + * @template TItem + */ +class CircularQueue { + /** + * @param {number} capacity + */ + constructor(capacity) { + /** + * @private + * @type {number} + */ + this._capacity = capacity + /** + * @private + * @type {number} + */ + this._size = 0 + /** + * @private + * @type {number} + */ + this._bottom = 0 + + /** + * @private + * @type {number} + */ + this._maxSize = 0 + + /** + * @private + * @type {TItem[]} + */ + this._data = Array(capacity).fill(undefined) + } + + /** + * @private + * @param {number} index + * @returns {number} + */ + _getCircularIndex(index) { + const result = index % this._capacity + if (result < 0) result += this._capacity + return result + } + + get capacity() { + return this._capacity + } + + get size() { + return this._size + } + + get nextItem() { + return this._size ? this._data[this._bottom] : undefined + } + + get lastItem() { + return this._size + ? this._data[this._getCircularIndex(this._bottom + this._size - 1)] + : undefined + } + + fromFirst(index) { + return index < this._size + ? this._data[this._getCircularIndex(this._bottom + index)] + : undefined + } + + fromLast(index) { + return index < this._size + ? this._data[ + this._getCircularIndex(this._bottom + this._size - 1 - index) + ] + : undefined + } + + /** + * @param {...TItem} items + */ + enqueue(...items) { + if (this._size + items.length > this._capacity) + throw new Error('Queue capacity exceeded.') + + let queueIndex = (this._bottom + this._size) % this._capacity + this._size += items.length + this._maxSize = Math.max(this._size, this._maxSize) + for (let i = 0; i < items.length; ++i) { + this._data[queueIndex] = items[i] + queueIndex = (queueIndex + 1) % this._capacity + } + } + + /** + * @returns {TItem | undefined} + */ + dequeue() { + if (!this._size) return undefined + + const result = this._data[this._bottom] + this._bottom = (this._bottom + 1) % this._capacity + --this._size + + return result + } + + /** + * @returns {TItem | undefined} + */ + popLast() { + if (!this._size) return undefined + + --this._size + const result = this._data[(this._bottom + this._size) % this._capacity] + + return result + } + + clear() { + this._size = 0 + } + + get maxSize() { + return this._maxSize + } + + asArray() { + let res = [] + for (let i = 0; i < this._size; ++i) { + res.push(this.fromFirst(i)) + } + + return res + } +} +//#endregion + +let oo = 1048575 +let dp = new Uint32Array(10001) +let dq = new CircularQueue(10001) + +//#region Segment tree +let st = new Uint32Array(40004) + +function buildST(nums, root, l, r) { + if (l == r) { + st[root] = nums[l] + return + } + + let m = (l + r) >> 1 + let c = root * 2 + 1 + buildST(nums, c, l, m) + buildST(nums, c + 1, m + 1, r) + + st[root] = st[c] & st[c + 1] +} + +function queryST(ql, qr, root, l, r) { + if (qr < l || ql > r) return oo + if (ql <= l && r <= qr) return st[root] + + let m = (l + r) >> 1 + let c = root * 2 + 1 + let x = queryST(ql, qr, c, l, m) + let y = queryST(ql, qr, c + 1, m + 1, r) + + return x & y +} +//#endregion + + +/** + * @param {number[]} nums + * @param {number[]} andValues + * @return {number} + */ +var minimumValueSum = function (nums, andValues) { + let n = nums.length + let m = andValues.length + buildST(nums, 0, 0, n - 1) + + dp.fill(oo, 0, n) + let a = nums[0] + let t = andValues[0] + for (let i = 0; i < n; ++i) { + a &= nums[i] + + if (a == t) { + dp[i] = nums[i] + } + } + + for (let j = 1; j < m; ++j) { + dq.clear() + t = andValues[j] + let ll = n + let rr = n - 1 + + for (let i = n - 1; i >= 0; --i) { + if (rr > i) { + rr = i + } + + a = queryST(rr, i, 0, 0, n - 1) + while (rr > 1 && a > t && (a & nums[rr - 1]) >= t) { + a &= nums[--rr] + } + + if (a != t || !rr) { + dp[i] = oo + continue + } + + if (ll > rr) { + ll = rr + dq.clear() + dq.enqueue(ll - 1) + } + + while (ll > 1 && (a & nums[ll - 1]) == a) { + --ll + + while (dq.size && dp[ll - 1] <= dp[dq.fromLast(0)]) { + dq.popLast() + } + dq.enqueue(ll - 1) + } + + while (dq.size && dq.fromFirst(0) >= rr) { + dq.dequeue() + } + + dp[i] = Math.min(dp[dq.fromFirst(0)] + nums[i], oo) + } + } + + return dp[n - 1] >= oo ? -1 : dp[n - 1] +} From 2b294c92e96e4ab9432b5cf3cdf60413aba39ad5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Apr 2024 16:47:40 +0800 Subject: [PATCH 1701/2039] Create 3115-maximum-prime-difference.js --- 3115-maximum-prime-difference.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 3115-maximum-prime-difference.js diff --git a/3115-maximum-prime-difference.js b/3115-maximum-prime-difference.js new file mode 100644 index 00000000..9dfe499c --- /dev/null +++ b/3115-maximum-prime-difference.js @@ -0,0 +1,32 @@ +const isPrime = num => { + for(let i = 2, s = Math.sqrt(num); i <= s; i++) { + if(num % i === 0) return false; + } + return num > 1; +} +/** + * @param {number[]} nums + * @return {number} + */ +var maximumPrimeDifference = function(nums) { + let fi = -1, li = nums.length + const n = nums.length + for(let i = 0; i < n; i++) { + const e = nums[i] + if(isPrime(e)) { + fi = i + break + } + } + for(let i = n - 1; i >= 0; i--) { + const e = nums[i] + if(isPrime(e)) { + li = i + break + } + } + + if(fi === -1) return 0 + + return li - fi +}; From 1c11c80a583bd8e2100a624be56eaef26919cbd0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 16 Apr 2024 16:48:18 +0800 Subject: [PATCH 1702/2039] Create 3114-latest-time-you-can-obtain-after-replacing-characters.js --- ...u-can-obtain-after-replacing-characters.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 3114-latest-time-you-can-obtain-after-replacing-characters.js diff --git a/3114-latest-time-you-can-obtain-after-replacing-characters.js b/3114-latest-time-you-can-obtain-after-replacing-characters.js new file mode 100644 index 00000000..df8e8040 --- /dev/null +++ b/3114-latest-time-you-can-obtain-after-replacing-characters.js @@ -0,0 +1,25 @@ +/** + * @param {string} s + * @return {string} + */ +var findLatestTime = function (s) { + let l = s.split('') + + if (l[0] === '?') { + l[0] = l[1] === '?' || parseInt(l[1]) <= 1 ? '1' : '0' + } + + if (l[1] === '?') { + l[1] = l[0] === '1' ? '1' : '9' + } + + if (l[3] === '?') { + l[3] = '5' + } + + if (l[4] === '?') { + l[4] = '9' + } + + return l.join('') +} From 0f4d4c8913068d5ff6aa2ad26f26548f39cffb06 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 Apr 2024 19:53:53 +0800 Subject: [PATCH 1703/2039] Create 1131-maximum-of-absolute-value-expression.js --- 1131-maximum-of-absolute-value-expression.js | 23 ++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 1131-maximum-of-absolute-value-expression.js diff --git a/1131-maximum-of-absolute-value-expression.js b/1131-maximum-of-absolute-value-expression.js new file mode 100644 index 00000000..ca0c1470 --- /dev/null +++ b/1131-maximum-of-absolute-value-expression.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @return {number} + */ +var maxAbsValExpr = function(arr1, arr2) { + let n = arr1.length; + let combs = [ + [1,1],[1,-1],[-1,1],[-1,-1] + ]; + let result = -Infinity; + for(let [p,q] of combs) { + let max = -Infinity, min = Infinity; + for(let i=0; i < n; i++) { + let value = (p * arr1[i]) + (q * arr2[i]) + i; + max = Math.max(max,value); + min = Math.min(min,value); + }; + result = Math.max(result, max-min); + }; + return result; +}; + From 19d3893d4421be858ef7bf62005c87c09ad8b454 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Apr 2024 22:02:01 +0800 Subject: [PATCH 1704/2039] Update 2584-split-the-array-to-make-coprime-products.js --- ...plit-the-array-to-make-coprime-products.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) diff --git a/2584-split-the-array-to-make-coprime-products.js b/2584-split-the-array-to-make-coprime-products.js index 3d148bc2..dae2db5e 100644 --- a/2584-split-the-array-to-make-coprime-products.js +++ b/2584-split-the-array-to-make-coprime-products.js @@ -1,3 +1,54 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var findValidSplit = function(nums) { + const rightCounter = new Map(); + + for (const num of nums) { + for (const [prime, count] of getPrimesCount(num)) { + rightCounter.set(prime, (rightCounter.get(prime) ?? 0) + count); + } + } + + const leftCounter = new Map(); + const common = new Set(); + + for (let i = 0; i < nums.length - 1; i++) { + for (const [prime, count] of getPrimesCount(nums[i])) { + leftCounter.set(prime, (leftCounter.get(prime) ?? 0) + count); + rightCounter.set(prime, rightCounter.get(prime) - count); + + if (rightCounter.get(prime) > 0) common.add(prime); + if (rightCounter.get(prime) === 0) common.delete(prime); + } + + if (common.size === 0) return i; + } + + return -1; +}; + +function getPrimesCount(n) { + const count = new Map(); + + for (let i = 2; (i * i) <= n; i++) { + while (n % i === 0) { + count.set(i, (count.get(i) ?? 0) + 1); + n /= i; + } + } + + if (n > 1) { + count.set(n, (count.get(n) ?? 0) + 1); + } + + return count; +} + +// another + + /** * @param {number[]} nums * @return {number} From 6bb73892e2d0d2cf26efd3a525d06a50db7ca664 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Apr 2024 21:04:02 +0800 Subject: [PATCH 1705/2039] Create 3123-find-edges-in-shortest-paths.js --- 3123-find-edges-in-shortest-paths.js | 139 +++++++++++++++++++++++++++ 1 file changed, 139 insertions(+) create mode 100644 3123-find-edges-in-shortest-paths.js diff --git a/3123-find-edges-in-shortest-paths.js b/3123-find-edges-in-shortest-paths.js new file mode 100644 index 00000000..670b3013 --- /dev/null +++ b/3123-find-edges-in-shortest-paths.js @@ -0,0 +1,139 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {boolean[]} + */ +var findAnswer = function (n, edges) { + let graph = {} + let edgeMapWithIndex = {} + + for (let i = 0; i < n; i++) { + graph[i] = [] + } + + for (let i = 0; i < edges.length; i++) { + let [node1, node2, cost] = edges[i] + graph[node1].push([node2, cost]) + graph[node2].push([node1, cost]) + edgeMapWithIndex[String(node1) + '.' + String(node2)] = i + edgeMapWithIndex[String(node2) + '.' + String(node1)] = i + } + + let distance = new Array(n).fill(Infinity) + distance[0] = 0 + + let pq = new PQ((a, b) => a[1] < b[1]) + + // node,cost + pq.push([0, 0, [0]]) + + let shortestPath = null + let visited = new Array(edges.length).fill(false) + + while (!pq.isEmpty()) { + let [node, currentCost, path] = pq.pop() + + if (node === n - 1) { + if (shortestPath === null) { + shortestPath = currentCost + } else if (shortestPath !== currentCost) { + continue + } + + for (let i = 0; i < path.length - 1; i++) { + let key1 = String(path[i]) + '.' + String(path[i + 1]) + let key2 = String(path[i + 1]) + '.' + String(path[i]) + + if (edgeMapWithIndex[key1] !== undefined) { + visited[edgeMapWithIndex[key1]] = true + } else if (edgeMapWithIndex[key2] !== undefined) { + visited[edgeMapWithIndex[key2]] = true + } + } + continue + } + + if (shortestPath !== null && currentCost >= shortestPath) { + continue + } + + let neighbours = graph[node] + + for (let [neighbour, cost] of neighbours) { + if (currentCost + cost <= distance[neighbour]) { + distance[neighbour] = currentCost + cost + pq.push([neighbour, distance[neighbour], [...path, neighbour]]) + } + } + } + + return visited +} + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From cd6d6a8d9b48e3ac117758d127c2614e38771da3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Apr 2024 12:26:13 +0800 Subject: [PATCH 1706/2039] Create 3131-find-the-integer-added-to-array-i.js --- 3131-find-the-integer-added-to-array-i.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 3131-find-the-integer-added-to-array-i.js diff --git a/3131-find-the-integer-added-to-array-i.js b/3131-find-the-integer-added-to-array-i.js new file mode 100644 index 00000000..59378cf0 --- /dev/null +++ b/3131-find-the-integer-added-to-array-i.js @@ -0,0 +1,10 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var addedInteger = function(nums1, nums2) { + nums1.sort((a,b) => a - b) + nums2.sort((a,b) => a - b) + return nums2[0] - nums1[0] +}; From 89e8154bc6d8627c5489a006aea5fed4bf020c77 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Apr 2024 12:26:54 +0800 Subject: [PATCH 1707/2039] Create 3132-find-the-integer-added-to-array-ii.js --- 3132-find-the-integer-added-to-array-ii.js | 45 ++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 3132-find-the-integer-added-to-array-ii.js diff --git a/3132-find-the-integer-added-to-array-ii.js b/3132-find-the-integer-added-to-array-ii.js new file mode 100644 index 00000000..aae98108 --- /dev/null +++ b/3132-find-the-integer-added-to-array-ii.js @@ -0,0 +1,45 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minimumAddedInteger = function (nums1, nums2) { + nums1.sort((a, b) => a - b) + nums2.sort((a, b) => a - b) + let min = Number.MAX_SAFE_INTEGER + for (let i = 0; i < nums1.length - 1; i++) { + for (let j = i + 1; j < nums1.length; j++) { + const [flag, value] = judgeEqual(nums1, nums2, i, j) + if (flag && min > value) { + min = value + } + } + } + return min +} + +function judgeEqual(nums1, nums2, i, j) { + let m = 0 + let n = 0 + let flag = false + let value = 0 + while (m < nums1.length) { + if (m === i || m === j) { + m++ + continue + } + if (!flag) { + value = nums2[n] - nums1[m] + m++ + n++ + flag = true + continue + } + if (nums2[n] - nums1[m] !== value) { + return [false, 0] + } + m++ + n++ + } + return [true, value] +} From df72253518087cb578d58f21d3f31f67035e4a0b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Apr 2024 12:27:35 +0800 Subject: [PATCH 1708/2039] Create 3133-minimum-array-end.js --- 3133-minimum-array-end.js | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 3133-minimum-array-end.js diff --git a/3133-minimum-array-end.js b/3133-minimum-array-end.js new file mode 100644 index 00000000..037aa7b4 --- /dev/null +++ b/3133-minimum-array-end.js @@ -0,0 +1,39 @@ +/** + * @param {number} n + * @param {number} x + * @return {number} + */ +var minEnd = function (n, x) { + let str = x.toString(2).padStart(50, '0') + + let map = new Map() + let c = 1 + for (let i = str.length - 1; i >= 0; i--) { + if (str[i] === '0') { + map.set(c, i) + c *= 2 + } + } + + let sb = str.split('') + let cur = n + ;[...map.keys()] + .sort((a, b) => b - a) + .forEach((key) => { + if (cur > key) { + cur -= key + sb[map.get(key)] = '1' + } + }) + + let ans = 0 + let step = 1 + for (let i = sb.length - 1; i >= 0; i--) { + if (sb[i] === '1') { + ans += step + } + step *= 2 + } + + return ans +} From a08249c12bbf658a50a7e801cc8f6a0abf1a7d43 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Apr 2024 12:28:09 +0800 Subject: [PATCH 1709/2039] Create 3134-find-the-median-of-the-uniqueness-array.js --- ...find-the-median-of-the-uniqueness-array.js | 61 +++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 3134-find-the-median-of-the-uniqueness-array.js diff --git a/3134-find-the-median-of-the-uniqueness-array.js b/3134-find-the-median-of-the-uniqueness-array.js new file mode 100644 index 00000000..9e7dce3c --- /dev/null +++ b/3134-find-the-median-of-the-uniqueness-array.js @@ -0,0 +1,61 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var medianOfUniquenessArray = function (nums) { + let low = 1 + let high = nums.length + let n = nums.length + + while (low < high) { + let mid = low + Math.floor((high - low) / 2) + if (countDistinct(nums, mid) >= Math.floor(((n * (n + 1)) / 2 + 1) / 2)) { + high = mid + } else { + low = mid + 1 + } + } + + if ( + countDistinct(nums, low - 1) === Math.floor(((n * (n + 1)) / 2 + 1) / 2) + ) { + return low - 1 + } + return low +} + +function countDistinct(nums, k) { + let occurrences = new Map() + let left = 0 + let count = 0 + let result = 0 + + for (let right = 0; right < nums.length; right++) { + occurrences.set(nums[right], (occurrences.get(nums[right]) || 0) + 1) + if (occurrences.get(nums[right]) === 1) { + count++ + } + while (count > k) { + occurrences.set(nums[left], occurrences.get(nums[left]) - 1) + if (occurrences.get(nums[left]) === 0) { + count-- + } + left++ + } + result += right - left + 1 + } + return result +} + +function force(nums) { + let l = [] + for (let i = 0; i < nums.length; i++) { + let set = new Set() + for (let j = i; j < nums.length; j++) { + set.add(nums[j]) + l.push(set.size) + } + } + l.sort((a, b) => a - b) + return l[Math.floor(l.length / 2)] +} From 89ccb83fdfcb13a48e8016ba0c514255cb738344 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 29 Apr 2024 17:21:24 +0800 Subject: [PATCH 1710/2039] Update 787-cheapest-flights-within-k-stops.js --- 787-cheapest-flights-within-k-stops.js | 43 ++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/787-cheapest-flights-within-k-stops.js b/787-cheapest-flights-within-k-stops.js index c0cd2f99..db9dd6dc 100644 --- a/787-cheapest-flights-within-k-stops.js +++ b/787-cheapest-flights-within-k-stops.js @@ -1,3 +1,46 @@ +/** + * @param {number} n + * @param {number[][]} flights + * @param {number} src + * @param {number} dst + * @param {number} K + * @return {number} + */ +const findCheapestPrice = function(n, flights, src, dst, K) { + const arr = Array(n).fill(Infinity) + arr[src] = 0 + const g = {} + for(const [u,v,p] of flights) { + if(g[u] == null) g[u] = [] + g[u].push([v, p]) + } + + let step = 0 + let q = [[src,0]] + while(step < K + 1 && q.length) { + const len = q.length + const row = [] + for(let i = 0; i < len; i++) { + const el = q[i] + const [s, dis] = el + for(const e of (g[s] || [])) { + const [nxt, p] = e + if(arr[nxt] > p + dis) { + arr[nxt] = p + dis + row.push([nxt, arr[nxt]]) + } + + } + } + q = row + step++ + } + + return arr[dst] === Infinity ? -1 : arr[dst] +} + +// another + /** * @param {number} n * @param {number[][]} flights From e3b21c3338308f23a82d0a059043107cb2a25e5a Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 May 2024 20:35:52 +0800 Subject: [PATCH 1711/2039] Update 1514-path-with-maximum-probability.js --- 1514-path-with-maximum-probability.js | 14 ++++++-------- 1 file changed, 6 insertions(+), 8 deletions(-) diff --git a/1514-path-with-maximum-probability.js b/1514-path-with-maximum-probability.js index bd47209e..e134e58b 100644 --- a/1514-path-with-maximum-probability.js +++ b/1514-path-with-maximum-probability.js @@ -6,7 +6,7 @@ * @param {number} end * @return {number} */ -const maxProbability = function (n, edges, succProb, start, end) { +var maxProbability = function (n, edges, succProb, start, end) { const g = {} for (let i = 0; i < edges.length; ++i) { const a = edges[i][0], @@ -16,15 +16,13 @@ const maxProbability = function (n, edges, succProb, start, end) { g[a].push([b, i]) g[b].push([a, i]) } - const p = new Array(n).fill(0) + const p = new Array(n).fill(-1) p[start] = 1 - const pq = new PriorityQueue((a, b) => p[a] > p[b]) + const pq = new PQ((a, b) => p[a] > p[b]) pq.push(start) while (!pq.isEmpty()) { const cur = pq.pop() - if (cur === end) { - return p[end] - } + for (let a of g[cur] || []) { const neighbor = a[0], index = a[1] @@ -34,9 +32,9 @@ const maxProbability = function (n, edges, succProb, start, end) { } } } - return 0 + return p[end] === -1 ? 0 : p[end] } -class PriorityQueue { +class PQ { constructor(comparator = (a, b) => a > b) { this.heap = [] this.top = 0 From c597f2f475e5eddb8bb5b939b7f3b25bce512cdb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 May 2024 14:08:46 +0800 Subject: [PATCH 1712/2039] Create 3136-valid-word.js --- 3136-valid-word.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 3136-valid-word.js diff --git a/3136-valid-word.js b/3136-valid-word.js new file mode 100644 index 00000000..a5f51edb --- /dev/null +++ b/3136-valid-word.js @@ -0,0 +1,27 @@ +/** + * @param {string} word + * @return {boolean} + */ +var isValid = function (word) { + const set = new Set(['a', 'e', 'i', 'o', 'u']) + let ans = true + ans = ans && word.length >= 3 + ans = + ans && + [...word].every( + (char) => + (char >= '0' && char <= '9') || + (char >= 'a' && char <= 'z') || + (char >= 'A' && char <= 'Z'), + ) + ans = ans && [...word].some((char) => set.has(char.toLowerCase())) + ans = + ans && + [...word].some( + (char) => + char.toLowerCase() >= 'a' && + char.toLowerCase() <= 'z' && + !set.has(char.toLowerCase()), + ) + return ans +} From 800294cb625a09423f10611b3d78ab025279a96c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 May 2024 14:09:20 +0800 Subject: [PATCH 1713/2039] Create 3137-minimum-number-of-operations-to-make-word-k-periodic.js --- ...mber-of-operations-to-make-word-k-periodic.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3137-minimum-number-of-operations-to-make-word-k-periodic.js diff --git a/3137-minimum-number-of-operations-to-make-word-k-periodic.js b/3137-minimum-number-of-operations-to-make-word-k-periodic.js new file mode 100644 index 00000000..2180881a --- /dev/null +++ b/3137-minimum-number-of-operations-to-make-word-k-periodic.js @@ -0,0 +1,16 @@ +/** + * @param {string} word + * @param {number} k + * @return {number} + */ +var minimumOperationsToMakeKPeriodic = function (word, k) { + const n = Math.floor(word.length / k) + const map = new Map() + + for (let i = 0; i < word.length; i += k) { + const sub = word.substring(i, i + k) + map.set(sub, (map.get(sub) || 0) + 1) + } + + return n - Math.max(...map.values()) +} From e020460a5334a665d2272bd349ab5eec4de247d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 May 2024 14:09:50 +0800 Subject: [PATCH 1714/2039] Create 3138-minimum-length-of-anagram-concatenation.js --- ...minimum-length-of-anagram-concatenation.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 3138-minimum-length-of-anagram-concatenation.js diff --git a/3138-minimum-length-of-anagram-concatenation.js b/3138-minimum-length-of-anagram-concatenation.js new file mode 100644 index 00000000..823168ce --- /dev/null +++ b/3138-minimum-length-of-anagram-concatenation.js @@ -0,0 +1,31 @@ +/** + * @param {string} s + * @return {number} + */ +var minAnagramLength = function (s) { + const n = s.length + + function checkI(k) { + const set = new Set() + for (let i = 0; i < n; i += k) { + const sub = s + .substring(i, i + k) + .split('') + .sort() + .join('') + set.add(sub) + if (set.size > 1) return false + } + return true + } + + for (let i = 1; i <= n; i++) { + if (n % i === 0) { + if (checkI(i)) { + return i + } + } + } + + return s.length +} From 2ec1c17f4c13275f445a4f21584e7472305d8878 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 5 May 2024 14:10:24 +0800 Subject: [PATCH 1715/2039] Create 3139-minimum-cost-to-equalize-array.js --- 3139-minimum-cost-to-equalize-array.js | 54 ++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 3139-minimum-cost-to-equalize-array.js diff --git a/3139-minimum-cost-to-equalize-array.js b/3139-minimum-cost-to-equalize-array.js new file mode 100644 index 00000000..d7a2e76d --- /dev/null +++ b/3139-minimum-cost-to-equalize-array.js @@ -0,0 +1,54 @@ +/** + * @param {number[]} nums + * @param {number} cost1 + * @param {number} cost2 + * @return {number} + */ +var minCostToEqualizeArray = function (nums, cost1, cost2) { + const big = BigInt + const mod = big(1e9 + 7) + const max = Math.max(...nums) + + cost1 = big(cost1) + cost2 = big(cost2) + + const l = [] + let sum = 0n + for (let i = 0; i < nums.length; i++) { + const diff = big(max - nums[i]) + sum += diff + l.push(diff) + } + l.sort((a ,b) => { + if(a > b) { + return -1; + } else if (a < b){ + return 1; + } else { + return 0; + } + }); + + if (cost1 * 2n <= cost2) { + return Number((sum * cost1) % mod) + } + + let ans = big(1e30) + for (let add = 0; add <= max; add++) { + let tmp = 0n + if (l[0] <= sum / 2n) { + tmp += (sum / 2n) * cost2 + tmp += (sum % 2n) * cost1 + if(tmp < ans) ans = tmp + } else { + tmp += (sum - l[0]) * cost2 + tmp += (l[0] - (sum - l[0])) * cost1 + if(tmp < ans) ans = tmp + } + + l[0]++ + sum += big(nums.length) + } + + return ans % mod +} From 8569327149c1c0a5718c949679b4d4dd4e73b115 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 May 2024 16:36:38 +0800 Subject: [PATCH 1716/2039] Create 2203-minimum-weighted-subgraph-with-the-required-paths.js --- ...ighted-subgraph-with-the-required-paths.js | 64 +++++++++++++++++++ 1 file changed, 64 insertions(+) create mode 100644 2203-minimum-weighted-subgraph-with-the-required-paths.js diff --git a/2203-minimum-weighted-subgraph-with-the-required-paths.js b/2203-minimum-weighted-subgraph-with-the-required-paths.js new file mode 100644 index 00000000..fe35f1de --- /dev/null +++ b/2203-minimum-weighted-subgraph-with-the-required-paths.js @@ -0,0 +1,64 @@ +const initializeGraph = (n) => { + let g = [] + for (let i = 0; i < n; i++) { + g.push([]) + } + return g +} +const packDGCost = (g, ig, edges) => { + for (const [u, v, cost] of edges) { + g[u].push([v, cost]) + ig[v].push([u, cost]) + } +} +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} src1 + * @param {number} src2 + * @param {number} dest + * @return {number} + */ +var minimumWeight = function(n, edges, src1, src2, dest) { + let g = initializeGraph(n), + ig = initializeGraph(n) + packDGCost(g, ig, edges) + /* + src1 -> x + src2 -> x + x -> dest find smallest distance from all nodes to the destination, run Dijkstra in reverse from the destination + */ + let d1 = dijkstra(g, src1), + d2 = dijkstra(g, src2), + d3 = dijkstra(ig, dest), + res = Number.MAX_SAFE_INTEGER + for (let i = 0; i < n; i++) res = Math.min(res, d1[i] + d2[i] + d3[i]) + return res == Number.MAX_SAFE_INTEGER ? -1 : res +} + +const dijkstra = (g, start) => { + // store the shortest distance from startNode to all other nodes + let n = g.length, + dis = Array(n).fill(Number.MAX_SAFE_INTEGER) + let pq = new MinPriorityQueue({ + compare: (x, y) => { + if (x[0] != y[0]) return x[0] - y[0] + return x[1] - y[1] + }, + }) + dis[start] = 0 + pq.enqueue([start, 0]) + while (pq.size()) { + let [cur, d] = pq.dequeue() + if (d > dis[cur]) continue // larger distance, no need to find the route to next node + for (const [child, cost] of g[cur]) { + let toChildCost = d + cost + if (toChildCost < dis[child]) { + // each time total wight/cost to current child is smaller, updated it + dis[child] = toChildCost + pq.enqueue([child, toChildCost]) + } + } + } + return dis +}; From 01dc7d657106e83c21d6a8fd20710c6b707f9aab Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 11 May 2024 18:41:40 +0800 Subject: [PATCH 1717/2039] Create 3112-minimum-time-to-visit-disappearing-nodes.js --- ...inimum-time-to-visit-disappearing-nodes.js | 123 ++++++++++++++++++ 1 file changed, 123 insertions(+) create mode 100644 3112-minimum-time-to-visit-disappearing-nodes.js diff --git a/3112-minimum-time-to-visit-disappearing-nodes.js b/3112-minimum-time-to-visit-disappearing-nodes.js new file mode 100644 index 00000000..96acaeeb --- /dev/null +++ b/3112-minimum-time-to-visit-disappearing-nodes.js @@ -0,0 +1,123 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} disappear + * @return {number[]} + */ +var minimumTime = function(n, edges, disappear) { + const graph = {}; + for (let i = 0; i < n; i++) { + graph[i] = []; + } + for (const [u, v, length] of edges) { + graph[u].push({ node: v, length }); + graph[v].push({ node: u, length }); + } + + const answer = new Array(n).fill(-1); + const pq = new MinHeap(); + const visited = new Set(); + + pq.insert(0, 0); + + while (!pq.isEmpty()) { + const [node, distance] = pq.removeMin(); + + if (visited.has(node)) continue; + visited.add(node); + + answer[node] = distance; + + for (const { node: adjNode, length } of graph[node]) { + if (disappear[adjNode] > distance + length && !visited.has(adjNode)) { + pq.insert(adjNode, distance + length); + } + } + } + + return answer; +}; + +// Basic MinHeap implementation +class MinHeap { + constructor() { + this.heap = []; + } + + insert(node, distance) { + this.heap.push([node, distance]); + this.heapifyUp(); + } + + removeMin() { + [this.heap[0], this.heap[this.heap.length - 1]] = [this.heap[this.heap.length - 1], this.heap[0]]; + const min = this.heap.pop(); + this.heapifyDown(); + return min; + } + + heapifyUp() { + let index = this.heap.length - 1; + while (this.hasParent(index) && this.parent(index)[1] > this.heap[index][1]) { + [this.heap[this.parentIndex(index)], this.heap[index]] = [this.heap[index], this.heap[this.parentIndex(index)]]; + index = this.parentIndex(index); + } + } + + heapifyDown() { + let index = 0; + while (this.hasLeftChild(index)) { + let smallerChildIndex = this.leftChildIndex(index); + if (this.hasRightChild(index) && this.rightChild(index)[1] < this.leftChild(index)[1]) { + smallerChildIndex = this.rightChildIndex(index); + } + + if (this.heap[index][1] < this.heap[smallerChildIndex][1]) { + break; + } else { + [this.heap[index], this.heap[smallerChildIndex]] = [this.heap[smallerChildIndex], this.heap[index]]; + } + index = smallerChildIndex; + } + } + + isEmpty() { + return this.heap.length === 0; + } + + parentIndex(index) { + return Math.floor((index - 1) / 2); + } + + leftChildIndex(index) { + return 2 * index + 1; + } + + rightChildIndex(index) { + return 2 * index + 2; + } + + hasParent(index) { + return this.parentIndex(index) >= 0; + } + + hasLeftChild(index) { + return this.leftChildIndex(index) < this.heap.length; + } + + hasRightChild(index) { + return this.rightChildIndex(index) < this.heap.length; + } + + parent(index) { + return this.heap[this.parentIndex(index)]; + } + + leftChild(index) { + return this.heap[this.leftChildIndex(index)]; + } + + rightChild(index) { + return this.heap[this.rightChildIndex(index)]; + } +} From 74b2154bed02caeca4aff2e898063c7a79d3b796 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 May 2024 21:20:15 +0800 Subject: [PATCH 1718/2039] Create 3149-find-the-minimum-cost-array-permutation.js --- ...find-the-minimum-cost-array-permutation.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 3149-find-the-minimum-cost-array-permutation.js diff --git a/3149-find-the-minimum-cost-array-permutation.js b/3149-find-the-minimum-cost-array-permutation.js new file mode 100644 index 00000000..f9c6e032 --- /dev/null +++ b/3149-find-the-minimum-cost-array-permutation.js @@ -0,0 +1,49 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var findPermutation = function (nums) { + const n = nums.length + const memo = new Array(n).fill(0) + let min = Infinity + let res = null + + recursive([], 0) + + return res + + function recursive (oneCase, acc) { + if (acc > min) return + + let flag = 0 + + for (let i = 0; i < n; i += 1) { + if (!memo[i]) { + flag = 1 + memo[i] = 1 + oneCase.push(i) + recursive( + oneCase, + oneCase.length >= 2 + ? acc + + Math.abs( + oneCase[oneCase.length - 2] - + nums[oneCase[oneCase.length - 1]], + ) + : acc, + ) + memo[i] = 0 + oneCase.pop() + } + } + + if (!flag) { + acc += Math.abs(oneCase[oneCase.length - 1] - nums[oneCase[0]]) + + if (acc < min) { + res = [...oneCase] + min = acc + } + } + } +} From 9d33e89b980d082751861091522fafa00bf423a3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 May 2024 21:20:54 +0800 Subject: [PATCH 1719/2039] Create 3148-maximum-difference-score-in-a-grid.js --- 3148-maximum-difference-score-in-a-grid.js | 41 ++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 3148-maximum-difference-score-in-a-grid.js diff --git a/3148-maximum-difference-score-in-a-grid.js b/3148-maximum-difference-score-in-a-grid.js new file mode 100644 index 00000000..ece4039f --- /dev/null +++ b/3148-maximum-difference-score-in-a-grid.js @@ -0,0 +1,41 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var maxScore = function (grid) { + const rows = grid.length + const cols = grid[0].length + const dp = new Array(rows) + .fill() + .map(() => new Array(cols).fill(-Infinity)) + + dp[rows - 1][cols - 1] = grid[rows - 1][cols - 1] + + let res = -Infinity + + for (let i = rows - 1; i >= 0; i--) { + for (let j = cols - 1; j >= 0; j--) { + if (i < rows - 1) { + dp[i][j] = Math.max(dp[i][j], dp[i + 1][j]) + } + + if (j < cols - 1) { + dp[i][j] = Math.max(dp[i][j], dp[i][j + 1]) + } + + dp[i][j] = Math.max(dp[i][j], grid[i][j]) + } + } + + for (let i = 0; i < rows; i++) { + for (let j = 0; j < cols; j++) { + if (i < rows - 1) { + res = Math.max(res, dp[i + 1][j] - grid[i][j]) + } + if (j < cols - 1) { + res = Math.max(res, dp[i][j + 1] - grid[i][j]) + } + } + } + return res +} From d3ca5f2136bbb94ab4932239d3e4abc2bf6e81a1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 May 2024 21:21:27 +0800 Subject: [PATCH 1720/2039] Create 3147-taking-maximum-energy-from-the-mystic-dungeon.js --- ...-maximum-energy-from-the-mystic-dungeon.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3147-taking-maximum-energy-from-the-mystic-dungeon.js diff --git a/3147-taking-maximum-energy-from-the-mystic-dungeon.js b/3147-taking-maximum-energy-from-the-mystic-dungeon.js new file mode 100644 index 00000000..2c4b1f17 --- /dev/null +++ b/3147-taking-maximum-energy-from-the-mystic-dungeon.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} energy + * @param {number} k + * @return {number} + */ +var maximumEnergy = function (energy, k) { + const n = energy.length + const sum = new Array(n).fill(0) + const arr = new Array(k).fill(0) + + let max = -Infinity + + for (let i = 0; i < n; i++) { + arr[i % k] += energy[i] + } + + for (let i = 0; i < k; i++) { + sum[i] = arr[i] + max = Math.max(sum[i], max) + } + + for (let i = k; i < n; i++) { + sum[i] = sum[i - k] - energy[i - k] + max = Math.max(sum[i], max) + } + + return max +} From 90db0b786cd792a31480ba24bd9947a916d15fad Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 12 May 2024 21:21:57 +0800 Subject: [PATCH 1721/2039] Create 3146-permutation-difference-between-two-strings.js --- ...ermutation-difference-between-two-strings.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 3146-permutation-difference-between-two-strings.js diff --git a/3146-permutation-difference-between-two-strings.js b/3146-permutation-difference-between-two-strings.js new file mode 100644 index 00000000..a0191c21 --- /dev/null +++ b/3146-permutation-difference-between-two-strings.js @@ -0,0 +1,17 @@ +/** + * @param {string} s + * @param {string} t + * @return {number} + */ +var findPermutationDifference = function(s, t) { + let mp1 = {} ,mp2 = {} + for (let i = 0; i < s.length; i++) { + mp1[s[i]] = i + mp2[t[i]] = i + } + let res = 0 + for (let i = 0; i < s.length; i++) { + res += Math.abs(mp1[s[i]] - mp2[s[i]]) + } + return res +}; From d3115a5a5faa31a36fc903fdb2339986deea0637 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 May 2024 17:15:45 +0800 Subject: [PATCH 1722/2039] Update 1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.js --- ...smallest-sum-of-a-matrix-with-sorted-rows.js | 17 ++++++++++------- 1 file changed, 10 insertions(+), 7 deletions(-) diff --git a/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.js b/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.js index 249cfbc6..11628f47 100644 --- a/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.js +++ b/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.js @@ -16,20 +16,23 @@ const kthSmallest = function(mat, k) { if (row === mat.length) return 1; let totalcnt = 0; for(let v of mat[row]) { - const cnt = check(row + 1, v + sum, limit); + let cnt = check(row+1, v+sum, limit); totalcnt += cnt; - if (cnt === 0 || totalcnt > k) break; + if (cnt === 0 || totalcnt > k) break; + } + return totalcnt; }; - while(lo <= hi) { - const m = (lo + (hi - lo) / 2) >> 0; - const cnt = check(0, 0, m); + + while(lo < hi) { + let m = Math.floor((lo+hi)/2); + let cnt = check(0,0,m); if (cnt < k) { - lo = m + 1; + lo = m+1; } else { - hi = m - 1; + hi = m; } } From 5df9c67b035363ab1625ba930b0eaac863d72ccf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 May 2024 21:49:43 +0800 Subject: [PATCH 1723/2039] Update 786-k-th-smallest-prime-fraction.js --- 786-k-th-smallest-prime-fraction.js | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/786-k-th-smallest-prime-fraction.js b/786-k-th-smallest-prime-fraction.js index 28d7e73d..99e39b35 100644 --- a/786-k-th-smallest-prime-fraction.js +++ b/786-k-th-smallest-prime-fraction.js @@ -1,9 +1,10 @@ /** - * @param {number[]} A - * @param {number} K + * @param {number[]} arr + * @param {number} k * @return {number[]} */ -const kthSmallestPrimeFraction = function(A, K) { +var kthSmallestPrimeFraction = function(arr, k) { + const A = arr, K = k let ans = [] let left = 0.0 let right = 1.0 @@ -34,4 +35,4 @@ const kthSmallestPrimeFraction = function(A, K) { } return { count, p, q } } -} +}; From 08d82e4cb6ab2beaf2e70d232bef5c1f600070d4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 May 2024 21:52:03 +0800 Subject: [PATCH 1724/2039] Create 3151-special-array-i.js --- 3151-special-array-i.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 3151-special-array-i.js diff --git a/3151-special-array-i.js b/3151-special-array-i.js new file mode 100644 index 00000000..005d43aa --- /dev/null +++ b/3151-special-array-i.js @@ -0,0 +1,12 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +var isArraySpecial = function (nums) { + for (let i = 0; i < nums.length - 1; i++) { + if (nums[i] % 2 == nums[i + 1] % 2) { + return false + } + } + return true +} From f2b880cc36682d6282eb1a721ae70aa41e863dc8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 May 2024 21:52:49 +0800 Subject: [PATCH 1725/2039] Create 3152-special-array-ii.js --- 3152-special-array-ii.js | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3152-special-array-ii.js diff --git a/3152-special-array-ii.js b/3152-special-array-ii.js new file mode 100644 index 00000000..82743e5e --- /dev/null +++ b/3152-special-array-ii.js @@ -0,0 +1,40 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {boolean[]} + */ +var isArraySpecial = function (nums, queries) { + let n = nums.length + let sameParity = new Array(n - 1).fill(false) + + + for (let i = 0; i < n - 1; ++i) { + if (nums[i] % 2 === nums[i + 1] % 2) { + sameParity[i] = true + } + } + + + let prefixSameParity = new Array(n).fill(0) + for (let i = 1; i < n; ++i) { + prefixSameParity[i] = prefixSameParity[i - 1] + (sameParity[i - 1] ? 1 : 0) + } + + let res = [] + for (const query of queries) { + let start = query[0] + let end = query[1] + if (start === end) { + // A single element subarray is always special + res.push(true) + } else { + if (prefixSameParity[end] - prefixSameParity[start] > 0) { + res.push(false) + } else { + res.push(true) + } + } + } + + return res +} From 58c1557fd7595a9d3588f1d96150b1612c7dc486 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 May 2024 21:53:22 +0800 Subject: [PATCH 1726/2039] Create 3153-sum-of-digit-differences-of-all-pairs.js --- 3153-sum-of-digit-differences-of-all-pairs.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 3153-sum-of-digit-differences-of-all-pairs.js diff --git a/3153-sum-of-digit-differences-of-all-pairs.js b/3153-sum-of-digit-differences-of-all-pairs.js new file mode 100644 index 00000000..03abf0ca --- /dev/null +++ b/3153-sum-of-digit-differences-of-all-pairs.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var sumDigitDifferences = function (nums) { + const numDigits = nums[0].toString().length + const n = nums.length + let totalDiff = 0 + + for (let pos = 0; pos < numDigits; ++pos) { + const digitCount = new Array(10).fill(0) + for (const num of nums) { + const digit = parseInt(num.toString()[pos]) + digitCount[digit]++ + } + for (let digit = 0; digit < 10; ++digit) { + const pairsCount = digitCount[digit] * (n - digitCount[digit]) + totalDiff += pairsCount + } + } + + return Math.floor(totalDiff / 2) +} From 9844c152d6e360fd7dfc9d8706a2ebb6826701ed Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 May 2024 21:54:11 +0800 Subject: [PATCH 1727/2039] Create 3154-find-number-of-ways-to-reach-the-k-th-stair.js --- ...-number-of-ways-to-reach-the-k-th-stair.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 3154-find-number-of-ways-to-reach-the-k-th-stair.js diff --git a/3154-find-number-of-ways-to-reach-the-k-th-stair.js b/3154-find-number-of-ways-to-reach-the-k-th-stair.js new file mode 100644 index 00000000..feefb525 --- /dev/null +++ b/3154-find-number-of-ways-to-reach-the-k-th-stair.js @@ -0,0 +1,30 @@ +/** + * @param {number} k + * @return {number} + */ +var waysToReachStair = function (k) { + const memo = new Map() + + return dfs(1, 0, true) + + function dfs(cur, jump, minus) { + const key = `${cur}-${jump}-${minus}` + if (memo.has(key)) return memo.get(key) + + let ret = 0 + if (cur - 2 > k) { + memo.set(key, ret) + return ret + } + if (cur === k) { + ret += 1 + } + if (cur > 0 && minus) { + ret += dfs(cur - 1, jump, false) + } + ret += dfs(cur + 2 ** jump, jump + 1, true) + + memo.set(key, ret) + return ret + } +} From 326a6fcbfd47061fe365b9abcc1bab65dd671803 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 21 May 2024 20:20:59 +0800 Subject: [PATCH 1728/2039] Update 1201-ugly-number-iii.js --- 1201-ugly-number-iii.js | 43 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1201-ugly-number-iii.js b/1201-ugly-number-iii.js index b2d7011a..b553502c 100644 --- a/1201-ugly-number-iii.js +++ b/1201-ugly-number-iii.js @@ -28,3 +28,46 @@ const nthUglyNumber = function(n, a, b, c) { return b === 0 ? a : gcd(b, a % b) } }; + +// another + +/** + * @param {number} n + * @param {number} a + * @param {number} b + * @param {number} c + * @return {number} + */ +var nthUglyNumber = function (n, a, b, c) { + const {floor} = Math + let lo = 1, + hi = 2 * (1e9 | 0) + ;(a = BigInt(a)), (b = BigInt(b)), (c = BigInt(c)) + let ab = (a * b) / gcd(a, b) + let bc = (b * c) / gcd(b, c) + let ac = (a * c) / gcd(a, c) + let abc = (a * bc) / gcd(a, bc) + + while (lo < hi) { + let mid = lo + ((hi - lo) >> 1) + let cnt = + floor(mid / Number(a)) + + floor(mid / Number(b)) + + floor(mid / Number(c)) - + floor(mid / Number(ab)) - + floor(mid / Number(bc)) - + floor(mid / Number(ac)) + + floor(mid / Number(abc)) + if (cnt < n) { + lo = mid + 1 + } else { + hi = mid + } + } + + return lo + + function gcd(a, b) { + return b ? gcd(b, a % b) : a + } +} From df5844713bbbd812c837f3bf3f673abfb797d285 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 23 May 2024 22:19:13 +0800 Subject: [PATCH 1729/2039] Update 3116-kth-smallest-amount-with-single-denomination-combination.js --- ...nt-with-single-denomination-combination.js | 84 +++++++++++++++++++ 1 file changed, 84 insertions(+) diff --git a/3116-kth-smallest-amount-with-single-denomination-combination.js b/3116-kth-smallest-amount-with-single-denomination-combination.js index fd7401cf..b7c432bf 100644 --- a/3116-kth-smallest-amount-with-single-denomination-combination.js +++ b/3116-kth-smallest-amount-with-single-denomination-combination.js @@ -1,3 +1,87 @@ +/** + * @param {number[]} coins + * @param {number} k + * @return {number} + */ +var findKthSmallest = function (coins, k) { + const n = coins.length; + const dic = new Map(); + for (let i = 1; i <= n; i++) { + const combinations = getCombinations(coins, i); + for (const comb of combinations) { + const lcm = getLCM(comb); + if (!dic.has(i)) { + dic.set(i, []); + } + dic.get(i).push(lcm); + } + } + + function count(dic, target) { + let ans = 0; + for (let i = 1; i <= n; i++) { + const lcms = dic.get(i); + for (const lcm of lcms) { + ans += Math.floor(target / lcm) * Math.pow(-1, i + 1); + } + } + return ans; + } + + let start = Math.min(...coins); + let end = Math.min(...coins) * k; + while (start + 1 < end) { + const mid = Math.floor((start + end) / 2); + if (count(dic, mid) >= k) { + end = mid; + } else { + start = mid; + } + } + if (count(dic, start) >= k) { + return start; + } else { + return end; + } + + function getCombinations(arr, k) { + const combinations = []; + const helper = (start, current) => { + if (current.length === k) { + combinations.push([...current]); + return; + } + for (let i = start; i < arr.length; i++) { + current.push(arr[i]); + helper(i + 1, current); + current.pop(); + } + }; + helper(0, []); + return combinations; + } + + function getLCM(arr) { + const gcd = (a, b) => { + if (b === 0) { + return a; + } + return gcd(b, a % b); + }; + let lcm = arr[0]; + for (let i = 1; i < arr.length; i++) { + const g = gcd(lcm, arr[i]); + lcm = (lcm * arr[i]) / g; + } + return lcm; + } +} + + +// another + + + function calcLcm(a, b) { let p = a * b From df99eef740e4a59ffbf9849921fb47d74e22768b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 May 2024 18:54:35 +0800 Subject: [PATCH 1730/2039] Create 2861-maximum-number-of-alloys.js --- 2861-maximum-number-of-alloys.js | 46 ++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 2861-maximum-number-of-alloys.js diff --git a/2861-maximum-number-of-alloys.js b/2861-maximum-number-of-alloys.js new file mode 100644 index 00000000..d5c0891b --- /dev/null +++ b/2861-maximum-number-of-alloys.js @@ -0,0 +1,46 @@ +/** + * @param {number} n + * @param {number} k + * @param {number} budget + * @param {number[][]} composition + * @param {number[]} stock + * @param {number[]} cost + * @return {number} + */ +var maxNumberOfAlloys = function (n, k, budget, composition, stock, cost) { + let low = 1, + high = 1e9 + let ans = 0 // intialise the ans = 0; + + while (low <= high) { + let mid = low + Math.floor((high - low) / 2) + if (isPossible(n, k, budget, composition, stock, cost, mid)) { + low = mid + 1 + ans = mid // we can form the "mid" quantity of alloys from any of the compositions in the given "budget"; + } else { + high = mid - 1 + } + } + + return ans +} +function isPossible(n, k, budget, composition, stock, costs, fixed_alloy) { + for (let i = 0; i < k; i++) { + let calBudget = 0 + for (let j = 0; j < n; j++) { + // this much quantity of jth metal is required to form the "fixed_alloy"; + let required = 1 * composition[i][j] * fixed_alloy + // subtracting the stocked portion of the jth metal; + required -= stock[j] + if (required > 0) { + // adding the cost for required quantity of jth metal to form the "fixed_alloy"; + calBudget += 1 * required * costs[j] + } + } + // "fixed alloy can be formed with the ith machine"; + if (calBudget <= 1 * budget) return true + } + + // can't be formed with any of the machine; + return false +} From f3c93b029214b23afc5633ba389c6dd85a5adcf1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 May 2024 14:34:18 +0800 Subject: [PATCH 1731/2039] Create 3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js --- ...-subsequence-with-non-adjacent-elements.js | 83 +++++++++++++++++++ 1 file changed, 83 insertions(+) create mode 100644 3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js diff --git a/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js b/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js new file mode 100644 index 00000000..4b978766 --- /dev/null +++ b/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js @@ -0,0 +1,83 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var maximumSumSubsequence = function(nums, queries) { + const ninf = -0x1ffffffffffff; + const mod = 1000000007; + const n = nums.length; + let tree = new Tree(n); + + for (let i = 0; i < n; ++i) { + tree.modify(1, 0, tree.nn, i, nums[i]); + } + for (let i = n; i < tree.nn; ++i) { + tree.modify(1, 0, tree.nn, i, 0); + } + + let ans = 0; + + for (let q of queries) { + let pos = q[0]; + let x = q[1]; + tree.modify(1, 0, tree.nn, pos, x); + ans += mod + tree.query() % mod; // [0, 2*mod) + } + + ans %= mod; + return ans; +}; + +class Tree { + constructor(n) { + this.nn = n; + this.space = new Array(4 * n + 1).fill(null).map(() => ({ mx: [[0, -0x1ffffffffffff], [-0x1ffffffffffff, 0]] })); + for (; ;) { + let low_bit = this.nn & -this.nn; + if (low_bit == this.nn) { + break; + } + this.nn += low_bit; + } + } + + modify(index, sl, sr, q, qv) { + let v = this.space[index]; + if (sl + 1 == sr) { + v.mx = [ + [0, -0x1ffffffffffff], + [-0x1ffffffffffff, qv] + ]; + return; + } + let m = (sl + sr) >> 1; + if (q < m) { + this.modify(index * 2, sl, m, q, qv); + } else { + this.modify(index * 2 + 1, m, sr, q, qv); + } + let l = this.space[index * 2]; + let r = this.space[index * 2 + 1]; + for (let lb of [0, 1]) { + for (let rb of [0, 1]) { + let ans = -0x1ffffffffffff; + ans = Math.max(ans, l.mx[lb][1] + r.mx[0][rb]); + ans = Math.max(ans, l.mx[lb][0] + r.mx[1][rb]); + ans = Math.max(ans, l.mx[lb][0] + r.mx[0][rb]); + v.mx[lb][rb] = ans; + } + } + } + + query() { + let v = this.space[1]; + let ans = -0x1ffffffffffff; + for (let i = 0; i < 2; i++) { + for (let j = 0; j < 2; j++) { + ans = Math.max(ans, v.mx[i][j]); + } + } + return ans; + } +} From 869a79183eb89e1de221ada7966cdba7ea76df85 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 May 2024 14:34:56 +0800 Subject: [PATCH 1732/2039] Create 3164-find-the-number-of-good-pairs-ii.js --- 3164-find-the-number-of-good-pairs-ii.js | 33 ++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3164-find-the-number-of-good-pairs-ii.js diff --git a/3164-find-the-number-of-good-pairs-ii.js b/3164-find-the-number-of-good-pairs-ii.js new file mode 100644 index 00000000..0ac0139c --- /dev/null +++ b/3164-find-the-number-of-good-pairs-ii.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number} + */ +var numberOfPairs = function(nums1, nums2, k) { + const freqMap = new Map() + for (const num of nums2) { + freqMap.set(num, (freqMap.get(num) || 0) + 1) + } + + let res = 0 + + for (const num1 of nums1) { + let factor = 1 + while (factor * factor <= num1) { + if (num1 % factor === 0) { + if (factor % k === 0 && freqMap.has(factor / k)) { + res += freqMap.get(factor / k) + } + if (factor !== num1 / factor) { + if ((num1 / factor) % k === 0 && freqMap.has(num1 / factor / k)) { + res += freqMap.get(num1 / factor / k) + } + } + } + factor++ + } + } + + return res +}; From b55eb2f585df952b05cce33174785b687936c80c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 May 2024 14:35:25 +0800 Subject: [PATCH 1733/2039] Create 3163-string-compression-iii.js --- 3163-string-compression-iii.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3163-string-compression-iii.js diff --git a/3163-string-compression-iii.js b/3163-string-compression-iii.js new file mode 100644 index 00000000..0b170072 --- /dev/null +++ b/3163-string-compression-iii.js @@ -0,0 +1,28 @@ +/** + * @param {string} word + * @return {string} + */ +var compressedString = function(word) { + let res = '' + let c = word[0] + let cnt = 0 + for (let i = 0; i < word.length; i++) { + if (c === word[i]) { + cnt++ + if (cnt === 9) { + res += `${cnt}${c}` + cnt = 0 + } + } else { + if (cnt !== 0) { + res += `${cnt}${c}` + } + c = word[i] + cnt = 1 + } + } + if (cnt !== 0) { + res += `${cnt}${c}` + } + return res +}; From e5d46707d4865330dd47121bb76ef39b533e1f42 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 May 2024 14:35:59 +0800 Subject: [PATCH 1734/2039] Create 3162-find-the-number-of-good-pairs-i.js --- 3162-find-the-number-of-good-pairs-i.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 3162-find-the-number-of-good-pairs-i.js diff --git a/3162-find-the-number-of-good-pairs-i.js b/3162-find-the-number-of-good-pairs-i.js new file mode 100644 index 00000000..9741659c --- /dev/null +++ b/3162-find-the-number-of-good-pairs-i.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number} + */ +var numberOfPairs = function (nums1, nums2, k) { + let res = 0 + for (let i = 0; i < nums1.length; i++) { + for (let j = 0; j < nums2.length; j++) { + if (nums1[i] % (nums2[j] * k) === 0) { + res++ + } + } + } + return res +} From 29bc71cd0224ce092ec1fa2e189d1b4078f70c90 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 26 May 2024 21:52:51 +0800 Subject: [PATCH 1735/2039] Create 3097-shortest-subarray-with-or-at-least-k-ii.js --- ...shortest-subarray-with-or-at-least-k-ii.js | 74 +++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 3097-shortest-subarray-with-or-at-least-k-ii.js diff --git a/3097-shortest-subarray-with-or-at-least-k-ii.js b/3097-shortest-subarray-with-or-at-least-k-ii.js new file mode 100644 index 00000000..c5c4f5fc --- /dev/null +++ b/3097-shortest-subarray-with-or-at-least-k-ii.js @@ -0,0 +1,74 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minimumSubarrayLength = function (nums, k) { + const a = nums + let n = a.length, + st = new SegmentTreeRORQ(a), + res = Number.MAX_SAFE_INTEGER + for (let i = 0; i < n; i++) { + let L = i, + R = n - 1, + len = Number.MAX_SAFE_INTEGER + while (L <= R) { + const mid = L + Math.floor((R - L) / 2) + let v = st.query(i, mid + 1) + if (v >= k) { + len = mid - i + 1 + R = mid - 1 + } else { + L = mid + 1 + } + } + res = Math.min(res, len) + } + return res === Number.MAX_SAFE_INTEGER ? -1 : res +} + +/////////////////////////// Template /////////////////////////// +function SegmentTreeRORQ(A) { + let n = A.length, + h = Math.ceil(Math.log2(n)), + len = 2 * 2 ** h, + a = Array(len).fill(0) + initializeFromArray() + return { update, query, tree } + function initializeFromArray() { + for (let i = 0; i < n; i++) a[n + i] = A[i] + for (let i = n - 1; i >= 1; i--) pushup(i) + } + function update(pos, v) { + a[n + pos] = v + for (let i = parent(n + pos); i >= 1; i = parent(i)) pushup(i) + } + function pushup(i) { + a[i] = a[left(i)] | a[right(i)] + } + function query(l, r) { + // [L, R) + let or = 0 + if (l >= r) return 0 + l += n + r += n + for (; l < r; l = parent(l), r = parent(r)) { + if (l & 1) or |= a[l++] + if (r & 1) or |= a[--r] + } + return or + } + function parent(i) { + return i >> 1 + } + function left(i) { + return 2 * i + } + function right(i) { + return 2 * i + 1 + } + function tree() { + return a + } +} +//////////////////////////////////////////////////////////////// From a451c7d9de94c3db9cdcf9ecbfe7cedbb10c2d86 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 27 May 2024 12:14:38 +0800 Subject: [PATCH 1736/2039] Update 992-subarrays-with-k-different-integers.js --- 992-subarrays-with-k-different-integers.js | 30 ++++++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/992-subarrays-with-k-different-integers.js b/992-subarrays-with-k-different-integers.js index f597e751..921973e8 100644 --- a/992-subarrays-with-k-different-integers.js +++ b/992-subarrays-with-k-different-integers.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const subarraysWithKDistinct = function(nums, k) { + return mostK(k) - mostK(k - 1) + + function mostK(k) { + const map = new Map(), n = nums.length + let i = 0, j = 0, res = 0 + for(; j < n; j++) { + const e = nums[j] + map.set(e, (map.get(e) || 0) + 1) + while(map.size > k) { + const tmp = nums[i] + map.set(tmp, map.get(tmp) - 1) + if(map.get(tmp) === 0) map.delete(tmp) + i++ + } + res += j - i + 1 + } + + + return res + } +}; + +// another + /** * @param {number[]} nums * @param {number} k From ba8b453db22418fd4e2cb577d0cb4eaf9f5a70ca Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 29 May 2024 17:30:25 +0800 Subject: [PATCH 1737/2039] Update 3-longest-substring-without-repeating-characters.js --- ...-substring-without-repeating-characters.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/3-longest-substring-without-repeating-characters.js b/3-longest-substring-without-repeating-characters.js index 78f0636b..d345eadf 100755 --- a/3-longest-substring-without-repeating-characters.js +++ b/3-longest-substring-without-repeating-characters.js @@ -1,3 +1,24 @@ +/** + * @param {string} s + * @return {number} + */ +const lengthOfLongestSubstring = function(s) { + const n = s.length, hash = {} + let res = 0 + let i = -1 + for(j = 0;j < n; j++) { + const e = s[j] + if(hash[e] != null) i = Math.max(i, hash[e]) + hash[e] = j + res = Math.max(res, j - i) + } + + return res +}; + + +// another + /** * @param {string} s * @return {number} From bc990f615860d34c6d84ecb9cc279aeea8fcfa86 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Jun 2024 18:27:06 +0800 Subject: [PATCH 1738/2039] Update 2537-count-the-number-of-good-subarrays.js --- 2537-count-the-number-of-good-subarrays.js | 24 ++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/2537-count-the-number-of-good-subarrays.js b/2537-count-the-number-of-good-subarrays.js index 58df8f51..8eb898ce 100644 --- a/2537-count-the-number-of-good-subarrays.js +++ b/2537-count-the-number-of-good-subarrays.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countGood = function(nums, k) { + let res = 0; + const count = new Map(); + for(let i = 0, j = 0; j < nums.length; j++){ + k -= count.get(nums[j]) || 0; + count.set(nums[j], (count.get(nums[j]) || 0)+1); + + while(k <= 0){ + count.set(nums[i],count.get(nums[i])-1); + k += count.get(nums[i]); + i++ + } + res += i; + } + return res; +}; + +// another + /** * @param {number[]} nums * @param {number} k From 8f8bc5357601979c5ea57724fc5e397ad3316704 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jun 2024 17:04:03 +0800 Subject: [PATCH 1739/2039] Create 3168-minimum-number-of-chairs-in-a-waiting-room.js --- ...imum-number-of-chairs-in-a-waiting-room.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 3168-minimum-number-of-chairs-in-a-waiting-room.js diff --git a/3168-minimum-number-of-chairs-in-a-waiting-room.js b/3168-minimum-number-of-chairs-in-a-waiting-room.js new file mode 100644 index 00000000..8fa89084 --- /dev/null +++ b/3168-minimum-number-of-chairs-in-a-waiting-room.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @return {number} + */ +var minimumChairs = function(s) { + let currentChairs = 0 + let maxChairsNeeded = 0 + + for (let event of s) { + if (event === 'E') { + currentChairs++ + maxChairsNeeded = Math.max(maxChairsNeeded, currentChairs) + } else if (event === 'L') { + currentChairs-- + } + } + + return maxChairsNeeded +}; From df0956dc3c70c5df156a31ca5c6d9d28ef931cb6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jun 2024 17:04:56 +0800 Subject: [PATCH 1740/2039] Create 3169-count-days-without-meetings.js --- 3169-count-days-without-meetings.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 3169-count-days-without-meetings.js diff --git a/3169-count-days-without-meetings.js b/3169-count-days-without-meetings.js new file mode 100644 index 00000000..17da932d --- /dev/null +++ b/3169-count-days-without-meetings.js @@ -0,0 +1,27 @@ +/** + * @param {number} days + * @param {number[][]} meetings + * @return {number} + */ +var countDays = function (days, meetings) { + let uniqueMeetings = Array.from(new Set(meetings.map(JSON.stringify))).map( + JSON.parse, + ) + uniqueMeetings.sort((a, b) => a[0] - b[0]) + let mergedMeetings = [uniqueMeetings[0]] + for (let i = 1; i < uniqueMeetings.length; i++) { + if (uniqueMeetings[i][0] <= mergedMeetings[mergedMeetings.length - 1][1]) { + mergedMeetings[mergedMeetings.length - 1][1] = Math.max( + mergedMeetings[mergedMeetings.length - 1][1], + uniqueMeetings[i][1], + ) + } else { + mergedMeetings.push(uniqueMeetings[i]) + } + } + let totalWork = mergedMeetings.reduce( + (acc, meeting) => acc + (meeting[1] - meeting[0] + 1), + 0, + ) + return days - totalWork +} From 260b77e4e51f0a9f040a9b8897978627fc2f7844 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jun 2024 17:05:27 +0800 Subject: [PATCH 1741/2039] Create 3170-lexicographically-minimum-string-after-removing-stars.js --- ...lly-minimum-string-after-removing-stars.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 3170-lexicographically-minimum-string-after-removing-stars.js diff --git a/3170-lexicographically-minimum-string-after-removing-stars.js b/3170-lexicographically-minimum-string-after-removing-stars.js new file mode 100644 index 00000000..e0bb7c0e --- /dev/null +++ b/3170-lexicographically-minimum-string-after-removing-stars.js @@ -0,0 +1,36 @@ +/** + * @param {string} s + * @return {string} + */ +var clearStars = function (s) { + let starPos = [] + for (let i = 0; i < s.length; i++) { + if (s[i] === '*') { + starPos.push(i) + } + } + let toDel = new Set(starPos) + if (starPos.length === 0) { + return s + } + let chsPos = Array.from({ length: 26 }, () => []) + for (let i = 0; i < s.length; i++) { + if (s[i] === '*') { + for (let j = 0; j < 26; j++) { + if (chsPos[j].length > 0) { + toDel.add(chsPos[j].pop()) + break + } + } + } else { + chsPos[s.charCodeAt(i) - 'a'.charCodeAt(0)].push(i) + } + } + let t = '' + for (let i = 0; i < s.length; i++) { + if (!toDel.has(i)) { + t += s[i] + } + } + return t +} From d9cbc3a37c67cb4d8dcb5ebff644cee00b533d44 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Jun 2024 21:22:44 +0800 Subject: [PATCH 1742/2039] Create 3130-find-all-possible-stable-binary-arrays-ii.js --- ...nd-all-possible-stable-binary-arrays-ii.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 3130-find-all-possible-stable-binary-arrays-ii.js diff --git a/3130-find-all-possible-stable-binary-arrays-ii.js b/3130-find-all-possible-stable-binary-arrays-ii.js new file mode 100644 index 00000000..8518dd04 --- /dev/null +++ b/3130-find-all-possible-stable-binary-arrays-ii.js @@ -0,0 +1,42 @@ +let MOD = 1000000007; + +function createDpArray() { + return Array.from({ length: 1001 }, () => new Uint32Array(1001)); +} + +let dp0 = createDpArray(); +let dp1 = createDpArray(); + +/** + * @param {number} zero + * @param {number} one + * @param {number} limit + * @return {number} + */ +var numberOfStableArrays = function (zero, one, limit) { + ++limit; + + for (let i = 0; i <= zero; ++i) { + for (let j = 0; j <= one; ++j) { + if (!i && !j) continue; + if (!i) { + dp1[i][j] = j < limit; + dp0[i][j] = 0; + continue; + } + if (!j) { + dp0[i][j] = i < limit; + dp1[i][j] = 0; + continue; + } + + dp1[i][j] = (dp0[i][j - 1] + dp1[i][j - 1]) % MOD; + if (j >= limit) dp1[i][j] = (dp1[i][j] - dp0[i][j - limit] + MOD) % MOD; + + dp0[i][j] = (dp0[i - 1][j] + dp1[i - 1][j]) % MOD; + if (i >= limit) dp0[i][j] = (dp0[i][j] - dp1[i - limit][j] + MOD) % MOD; + } + } + + return (dp0[zero][one] + dp1[zero][one]) % MOD; +}; From abea6ac0b17867d000e2e1ae3e488f6e651291cc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Jun 2024 13:43:07 +0800 Subject: [PATCH 1743/2039] Update 1473-paint-house-iii.js --- 1473-paint-house-iii.js | 48 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/1473-paint-house-iii.js b/1473-paint-house-iii.js index d5fc1315..6ae1b718 100644 --- a/1473-paint-house-iii.js +++ b/1473-paint-house-iii.js @@ -1,3 +1,51 @@ +/** + * @param {number[]} houses + * @param {number[][]} cost + * @param {number} m + * @param {number} n + * @param {number} target + * @return {number} + */ +const minCost = function (houses, cost, m, n, target) { + const dp = Array(m) + .fill(null) + .map(() => + Array(target) + .fill(null) + .map(() => Array(n + 1).fill(0)) + ) + + const res = dfs(0, target, -1) + return res === Infinity ? -1 : res + + function dfs(i, t, p) { + if (i === m && t === 0) { + return 0 + } else if (t < 0 || m - i < t || (i === m && t > 0)) { + return Infinity + } else if (p > -1 && dp[i][t][p]) { + return dp[i][t][p] + } else { + let res = Infinity + if (houses[i]) { + const tmp = houses[i] !== p ? 1 : 0 + res = dfs(i + 1, t - tmp, houses[i]) + } else { + for (let k = 1; k <= n; k++) { + const tmp = k !== p ? 1 : 0 + res = Math.min(res, cost[i][k - 1] + dfs(i + 1, t - tmp, k)) + } + } + if (p > -1) { + dp[i][t][p] = res + } + return res + } + } +} + +// another + /** * @param {number[]} houses * @param {number[][]} cost From aedd57c6b3e66edd8fa0915ff77eb5512757ee02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 5 Jun 2024 17:19:43 +0800 Subject: [PATCH 1744/2039] Create 3122-minimum-number-of-operations-to-satisfy-conditions.js --- ...ber-of-operations-to-satisfy-conditions.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3122-minimum-number-of-operations-to-satisfy-conditions.js diff --git a/3122-minimum-number-of-operations-to-satisfy-conditions.js b/3122-minimum-number-of-operations-to-satisfy-conditions.js new file mode 100644 index 00000000..0d99473c --- /dev/null +++ b/3122-minimum-number-of-operations-to-satisfy-conditions.js @@ -0,0 +1,33 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const minimumOperations = function(grid) { + const m = grid.length, n = grid[0].length + const dp = Array.from({ length: n }, () => Array(10).fill(Infinity)) + for(let i = 0; i < n; i++) { + for(let v = 0; v < 10; v++) { + let cost = 0 + + for(let j = 0; j < m; j++) { + if(grid[j][i] !== v) cost++ + } + + if(i == 0) dp[i][v] = cost + else { + for(let p = 0; p < 10; p++) { + if(p === v) continue + dp[i][v] = Math.min(dp[i][v], dp[i - 1][p] + cost) + } + } + } + } + + let res = Infinity + + for(let v = 0; v < 10; v++) { + res = Math.min(res, dp[n - 1][v]) + } + + return res +}; From 6596039b5d2c670ea8801247a0fd7e2e37752d2b Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 6 Jun 2024 13:26:25 +0800 Subject: [PATCH 1745/2039] Update 198-house-robber.js --- 198-house-robber.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/198-house-robber.js b/198-house-robber.js index 3ce91fff..17f82e5f 100644 --- a/198-house-robber.js +++ b/198-house-robber.js @@ -31,3 +31,18 @@ const rob = function(nums) { return dp[n] }; + +// another +/** + * @param {number[]} nums + * @return {number} + */ +const rob = function(nums) { + const n = nums.length + const dp = Array(n + 1).fill(0) + for(let i = 1; i <= n; i++) { + const e = nums[i - 1] + dp[i] = Math.max(dp[i - 1], (i === 1 ? 0 : dp[i - 2]) + e) + } + return dp[n] +}; From 0803af6edb6f8b2a5967f26c211ea957ad27aed0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 Jun 2024 18:36:04 +0800 Subject: [PATCH 1746/2039] Update 337-house-robber-iii.js --- 337-house-robber-iii.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/337-house-robber-iii.js b/337-house-robber-iii.js index a1417bf8..9ec5af05 100644 --- a/337-house-robber-iii.js +++ b/337-house-robber-iii.js @@ -1,3 +1,29 @@ +/** + * 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} + */ +const rob = function(root) { + if(root == null) return 0 + return Math.max(...dfs(root)) + + function dfs(node) { + if(node == null) return [0, 0] + const l = dfs(node.left), r = dfs(node.right) + return [node.val + l[1] + r[1], Math.max(...l) + Math.max(...r)] + } +}; + +// another + + /** * Definition for a binary tree node. * function TreeNode(val) { From 431cecdc14d877ac8afc36f2c55070f774d60e6e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jun 2024 19:45:05 +0800 Subject: [PATCH 1747/2039] Create 3181-maximum-total-reward-using-operations-ii.js --- ...aximum-total-reward-using-operations-ii.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 3181-maximum-total-reward-using-operations-ii.js diff --git a/3181-maximum-total-reward-using-operations-ii.js b/3181-maximum-total-reward-using-operations-ii.js new file mode 100644 index 00000000..d9c941b4 --- /dev/null +++ b/3181-maximum-total-reward-using-operations-ii.js @@ -0,0 +1,56 @@ +/** + * @param {number[]} rewardValues + * @return {number} + */ +var maxTotalReward = function (rewardValues) { + rewardValues.sort((a, b) => a-b); + + let dp = new Uint8Array(rewardValues.at(-1)*2).fill(0); + let max = rewardValues.at(-1); + + dp[0] = 1; + + for(let i = 0; i < rewardValues.length; ++i) { + let val = rewardValues[i]; + if(i > 0 && rewardValues[i-1] === val) { continue; } + let curMax = Math.min(val-1, (max-val)-1); + + + for(let j = 0; j <= curMax; ++j) { + if(dp[j] === 1) { + let found = j + val; + dp[found] = 1; + } else if(dp[j] === 2) { + //skip ahead + j += 100; + } else { + //determine how big the gap is + let runStart = j; + let target = runStart + 100; + while(j < curMax && j <= target && dp[j] === 0) { + ++j; + } + + if(j >= target) { + //the gap is at least 100, mark it as skippable + dp[runStart] = 2; + } + if(dp[j]) { --j; } + } + } + + //we found max-1, since we're including max, no need to continue + if(dp[max-1]) { + break; + } + + } + + for(let i = dp.length-1; i >= 0; --i) { + if(dp[i]) { + return i + max; + } + } + + return -1; +} From 2501db9762cf44c73de8ccd77f7e8f61bad651a5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jun 2024 19:45:38 +0800 Subject: [PATCH 1748/2039] Create 3180-maximum-total-reward-using-operations-i.js --- ...maximum-total-reward-using-operations-i.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 3180-maximum-total-reward-using-operations-i.js diff --git a/3180-maximum-total-reward-using-operations-i.js b/3180-maximum-total-reward-using-operations-i.js new file mode 100644 index 00000000..a89e6d64 --- /dev/null +++ b/3180-maximum-total-reward-using-operations-i.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} rewardValues + * @return {number} + */ +var maxTotalReward = function (rewardValues) { + rewardValues.sort((a, b) => a - b) + const ts = new Set([0]) + for (const item of rewardValues) { + const set = new Set() + for (const t of ts) { + if (t < item) { + set.add(t + item) + } + } + for (const value of set) { + ts.add(value) + } + } + return Math.max(...ts) +} From 9ff98e376afb4156079dd45b9da6694039287283 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jun 2024 19:46:08 +0800 Subject: [PATCH 1749/2039] Create 3179-find-the-n-th-value-after-k-seconds.js --- 3179-find-the-n-th-value-after-k-seconds.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 3179-find-the-n-th-value-after-k-seconds.js diff --git a/3179-find-the-n-th-value-after-k-seconds.js b/3179-find-the-n-th-value-after-k-seconds.js new file mode 100644 index 00000000..09ae164a --- /dev/null +++ b/3179-find-the-n-th-value-after-k-seconds.js @@ -0,0 +1,17 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var valueAfterKSeconds = function(n, k) { + const mod = 1e9 + 7 + let a = new Array(n).fill(1) + + for (let i = 0; i < k; i++) { + for (let j = 1; j < n; j++) { + a[j] = (a[j] + a[j - 1]) % mod + } + } + + return a[n - 1] +}; From c825e86bcdda941c330d23bf491071c1ccdb7c02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Jun 2024 19:46:40 +0800 Subject: [PATCH 1750/2039] Create 3178-find-the-child-who-has-the-ball-after-k-seconds.js --- ...find-the-child-who-has-the-ball-after-k-seconds.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 3178-find-the-child-who-has-the-ball-after-k-seconds.js diff --git a/3178-find-the-child-who-has-the-ball-after-k-seconds.js b/3178-find-the-child-who-has-the-ball-after-k-seconds.js new file mode 100644 index 00000000..18916378 --- /dev/null +++ b/3178-find-the-child-who-has-the-ball-after-k-seconds.js @@ -0,0 +1,11 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var numberOfChild = function(n, k) { + let l = 2 * (n-1) + let r = k % l + if (r < n) return r + else return l - r +}; From ba97c288353faf199ee892cff935eb45b29f0eb6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Jun 2024 12:06:57 +0800 Subject: [PATCH 1751/2039] Update 3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js --- ...-subsequence-with-non-adjacent-elements.js | 137 +++++++++--------- 1 file changed, 71 insertions(+), 66 deletions(-) diff --git a/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js b/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js index 4b978766..e51d1067 100644 --- a/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js +++ b/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js @@ -3,81 +3,86 @@ * @param {number[][]} queries * @return {number} */ -var maximumSumSubsequence = function(nums, queries) { - const ninf = -0x1ffffffffffff; - const mod = 1000000007; - const n = nums.length; - let tree = new Tree(n); +var maximumSumSubsequence = function (nums, queries) { + const ninf = -Infinity + const mod = 1e9 + 7 + const n = nums.length + let tree = new Tree(n) - for (let i = 0; i < n; ++i) { - tree.modify(1, 0, tree.nn, i, nums[i]); - } - for (let i = n; i < tree.nn; ++i) { - tree.modify(1, 0, tree.nn, i, 0); - } + for (let i = 0; i < n; ++i) { + tree.modify(1, 0, tree.nn, i, nums[i]) + } + for (let i = n; i < tree.nn; ++i) { + tree.modify(1, 0, tree.nn, i, 0) + } - let ans = 0; + let res = 0 - for (let q of queries) { - let pos = q[0]; - let x = q[1]; - tree.modify(1, 0, tree.nn, pos, x); - ans += mod + tree.query() % mod; // [0, 2*mod) - } + for (let q of queries) { + let pos = q[0] + let x = q[1] + tree.modify(1, 0, tree.nn, pos, x) + res += mod + (tree.query() % mod) // [0, 2*mod) + } - ans %= mod; - return ans; -}; + res %= mod + return res +} class Tree { - constructor(n) { - this.nn = n; - this.space = new Array(4 * n + 1).fill(null).map(() => ({ mx: [[0, -0x1ffffffffffff], [-0x1ffffffffffff, 0]] })); - for (; ;) { - let low_bit = this.nn & -this.nn; - if (low_bit == this.nn) { - break; - } - this.nn += low_bit; - } + constructor(n) { + this.nn = n + this.space = new Array(4 * n + 1).fill(null).map(() => ({ + mx: [ + [0, -0x1ffffffffffff], + [-0x1ffffffffffff, 0], + ], + })) + for (;;) { + let low_bit = this.nn & -this.nn + if (low_bit == this.nn) { + break + } + this.nn += low_bit } + } - modify(index, sl, sr, q, qv) { - let v = this.space[index]; - if (sl + 1 == sr) { - v.mx = [ - [0, -0x1ffffffffffff], - [-0x1ffffffffffff, qv] - ]; - return; - } - let m = (sl + sr) >> 1; - if (q < m) { - this.modify(index * 2, sl, m, q, qv); - } else { - this.modify(index * 2 + 1, m, sr, q, qv); - } - let l = this.space[index * 2]; - let r = this.space[index * 2 + 1]; - for (let lb of [0, 1]) { - for (let rb of [0, 1]) { - let ans = -0x1ffffffffffff; - ans = Math.max(ans, l.mx[lb][1] + r.mx[0][rb]); - ans = Math.max(ans, l.mx[lb][0] + r.mx[1][rb]); - ans = Math.max(ans, l.mx[lb][0] + r.mx[0][rb]); - v.mx[lb][rb] = ans; - } - } + modify(index, sl, sr, q, qv) { + let v = this.space[index] + if (sl + 1 == sr) { + v.mx = [ + [0, -0x1ffffffffffff], + [-0x1ffffffffffff, qv], + ] + return + } + let m = (sl + sr) >> 1 + if (q < m) { + this.modify(index * 2, sl, m, q, qv) + } else { + this.modify(index * 2 + 1, m, sr, q, qv) + } + let l = this.space[index * 2] + let r = this.space[index * 2 + 1] + for (let lb of [0, 1]) { + for (let rb of [0, 1]) { + let ans = -0x1ffffffffffff + ans = Math.max(ans, l.mx[lb][1] + r.mx[0][rb]) + ans = Math.max(ans, l.mx[lb][0] + r.mx[1][rb]) + ans = Math.max(ans, l.mx[lb][0] + r.mx[0][rb]) + v.mx[lb][rb] = ans + } } + } - query() { - let v = this.space[1]; - let ans = -0x1ffffffffffff; - for (let i = 0; i < 2; i++) { - for (let j = 0; j < 2; j++) { - ans = Math.max(ans, v.mx[i][j]); - } - } - return ans; + query() { + let v = this.space[1] + let ans = -0x1ffffffffffff + for (let i = 0; i < 2; i++) { + for (let j = 0; j < 2; j++) { + ans = Math.max(ans, v.mx[i][j]) + } } + return ans + } } From 54699c69f6926668f1976a11b8abf68e81575921 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Jun 2024 13:07:17 +0800 Subject: [PATCH 1752/2039] Update 3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js --- ...-subsequence-with-non-adjacent-elements.js | 93 +++++++++++++++++++ 1 file changed, 93 insertions(+) diff --git a/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js b/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js index e51d1067..64433f77 100644 --- a/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js +++ b/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.js @@ -1,3 +1,96 @@ +const M = 1e9 + 7 +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var maximumSumSubsequence = function (nums, queries) { + const n = nums.length + const root = new SegTreeNode(0, n - 1, nums) + let res = 0 + for (const q of queries) { + root.updateRange(q[0], q[1]) + res += Math.max(root.info00, root.info01, root.info10, root.info11) + res %= M + } + return res +} + +class SegTreeNode { + constructor(a, b, vals) { + this.left = null + this.right = null + this.start = a + this.end = b + if (a === b) { + this.info11 = vals[a] + this.info01 = -1e18 + this.info10 = -1e18 + this.info00 = 0 + return + } + const mid = Math.floor((a + b) / 2) + this.left = new SegTreeNode(a, mid, vals) + this.right = new SegTreeNode(mid + 1, b, vals) + this.info11 = Math.max( + this.left.info10 + this.right.info01, + this.left.info11 + this.right.info01, + this.left.info10 + this.right.info11, + ) + this.info00 = Math.max( + this.left.info00 + this.right.info00, + this.left.info01 + this.right.info00, + this.left.info00 + this.right.info10, + ) + this.info10 = Math.max( + this.left.info10 + this.right.info00, + this.left.info10 + this.right.info10, + this.left.info11 + this.right.info00, + ) + this.info01 = Math.max( + this.left.info00 + this.right.info01, + this.left.info01 + this.right.info01, + this.left.info00 + this.right.info11, + ) + } + + updateRange(a, val) { + if (a < this.start || a > this.end) { + return + } + if (this.start === this.end) { + this.info00 = 0 + this.info11 = val + return + } + this.left.updateRange(a, val) + this.right.updateRange(a, val) + this.info11 = Math.max( + this.left.info10 + this.right.info01, + this.left.info11 + this.right.info01, + this.left.info10 + this.right.info11, + ) + this.info00 = Math.max( + this.left.info00 + this.right.info00, + this.left.info01 + this.right.info00, + this.left.info00 + this.right.info10, + ) + this.info10 = Math.max( + this.left.info10 + this.right.info00, + this.left.info10 + this.right.info10, + this.left.info11 + this.right.info00, + ) + this.info01 = Math.max( + this.left.info00 + this.right.info01, + this.left.info01 + this.right.info01, + this.left.info00 + this.right.info11, + ) + } +} + +// another + + /** * @param {number[]} nums * @param {number[][]} queries From a972890178aedcdae7352df6fe02936b3451d30e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jun 2024 15:02:16 +0800 Subject: [PATCH 1753/2039] Create 3187-peaks-in-array.js --- 3187-peaks-in-array.js | 86 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 86 insertions(+) create mode 100644 3187-peaks-in-array.js diff --git a/3187-peaks-in-array.js b/3187-peaks-in-array.js new file mode 100644 index 00000000..21184be7 --- /dev/null +++ b/3187-peaks-in-array.js @@ -0,0 +1,86 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +var countOfPeaks = function (nums, queries) { + const n = nums.length + const bit = new BIT() + bit.init(n) + for (let i = 0; i < n; i++) { + if (isPeak(nums, i)) { + bit.add(i + 1, 1) + } + } + const res = [] + for (const q of queries) { + if (q[0] === 1) { + const [l, r] = [q[1], q[2]] + let cnt = bit.query(r + 1) - bit.query(l) + if (isPeak(nums, l)) { + cnt-- + } + if (isPeak(nums, r)) { + cnt-- + } + if (isPeak(nums, l) && l === r) { + cnt++ + } + res.push(cnt) + } else { + const [idx, val] = [q[1], q[2]] + if (isPeak(nums, idx)) { + bit.add(idx + 1, -1) + } + if (idx > 0 && isPeak(nums, idx - 1)) { + bit.add(idx, -1) + } + if (idx < n - 1 && isPeak(nums, idx + 1)) { + bit.add(idx + 2, -1) + } + nums[idx] = val + if (isPeak(nums, idx)) { + bit.add(idx + 1, 1) + } + if (idx > 0 && isPeak(nums, idx - 1)) { + bit.add(idx, 1) + } + if (idx < n - 1 && isPeak(nums, idx + 1)) { + bit.add(idx + 2, 1) + } + } + } + return res +} +function isPeak(nums, i) { + if (i === 0 || i === nums.length - 1) { + return false + } + return nums[i] > nums[i - 1] && nums[i] > nums[i + 1] +} + +class BIT { + constructor() { + this.tree = [] + } + + init(n) { + this.tree = new Array(n + 1).fill(0) + } + + add(i, val) { + while (i < this.tree.length) { + this.tree[i] += val + i += i & -i + } + } + + query(i) { + let sum = 0 + while (i > 0) { + sum += this.tree[i] + i -= i & -i + } + return sum + } +} From 648628c0185ce50a5385c02a152fe2185df31e35 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jun 2024 15:02:45 +0800 Subject: [PATCH 1754/2039] Create 3186-maximum-total-damage-with-spell-casting.js --- ...maximum-total-damage-with-spell-casting.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3186-maximum-total-damage-with-spell-casting.js diff --git a/3186-maximum-total-damage-with-spell-casting.js b/3186-maximum-total-damage-with-spell-casting.js new file mode 100644 index 00000000..d6de86f5 --- /dev/null +++ b/3186-maximum-total-damage-with-spell-casting.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} power + * @return {number} + */ +var maximumTotalDamage = function (power) { + power.sort((a, b) => a - b) + const freqMap = new Map() + for (const p of power) { + freqMap.set(p, (freqMap.get(p) || 0) + 1) + } + const uniqueDamages = Array.from(freqMap.keys()).sort((a, b) => a - b) + const n = uniqueDamages.length + const dp = new Array(n + 1).fill(0) + for (let i = 0; i < n; i++) { + const damage = uniqueDamages[i] + const totalDamage = damage * freqMap.get(damage) + + dp[i + 1] = Math.max(dp[i + 1], dp[i]) + + let j = i - 1 + while (j >= 0 && uniqueDamages[j] >= damage - 2) { + j-- + } + dp[i + 1] = Math.max(dp[i + 1], (j >= 0 ? dp[j + 1] : 0) + totalDamage) + } + + return dp[n] +} From a64a20af78bdf3d9ef9eb5f0b1ce38e97fb736de Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jun 2024 15:03:17 +0800 Subject: [PATCH 1755/2039] Create 3185-count-pairs-that-form-a-complete-day-ii.js --- ...count-pairs-that-form-a-complete-day-ii.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 3185-count-pairs-that-form-a-complete-day-ii.js diff --git a/3185-count-pairs-that-form-a-complete-day-ii.js b/3185-count-pairs-that-form-a-complete-day-ii.js new file mode 100644 index 00000000..5ceff702 --- /dev/null +++ b/3185-count-pairs-that-form-a-complete-day-ii.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} hours + * @return {number} + */ +var countCompleteDayPairs = function(hours) { + const map = new Map() + const n = hours.length + let res = 0 + for(let i = 0; i < n; i++) { + const e = hours[i] + const remain = e % 24 + if(remain === 0 || remain === 24) res += (map.get(24) || 0) + (map.get(0) || 0) + else res += (map.get(24 - remain) || 0) + // console.log('res', res) + map.set(remain, (map.get(remain) || 0) + 1) + } + // console.log(map) + + return res +}; From e8c54c1c5dae796f8fc358490d6cdc0c313b009f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Jun 2024 15:03:42 +0800 Subject: [PATCH 1756/2039] Create 3184-count-pairs-that-form-a-complete-day-i.js --- 3184-count-pairs-that-form-a-complete-day-i.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 3184-count-pairs-that-form-a-complete-day-i.js diff --git a/3184-count-pairs-that-form-a-complete-day-i.js b/3184-count-pairs-that-form-a-complete-day-i.js new file mode 100644 index 00000000..01f56b42 --- /dev/null +++ b/3184-count-pairs-that-form-a-complete-day-i.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} hours + * @return {number} + */ +var countCompleteDayPairs = function(hours) { + let res = 0 + const n = hours.length + for(let i = 0; i < n; i++) { + for(let j = i + 1; j < n; j++) { + if((hours[i] + hours[j]) % 24 === 0) res++ + } + } + return res +}; From c8ec9701acc0e0dd89ce0e73560697550ede2aa8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Jun 2024 12:41:53 +0800 Subject: [PATCH 1757/2039] Update 218-the-skyline-problem.js --- 218-the-skyline-problem.js | 43 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/218-the-skyline-problem.js b/218-the-skyline-problem.js index 0d7016ee..39846b9c 100644 --- a/218-the-skyline-problem.js +++ b/218-the-skyline-problem.js @@ -1,3 +1,46 @@ +/** + * @param {number[][]} buildings + * @return {number[][]} + */ +var getSkyline = function(buildings) { + const edgeSet = new Set(); + for (let i = 0; i < buildings.length; i++) { + const [from, to] = buildings[i]; + edgeSet.add(from); + edgeSet.add(to); + } + const positions = [...edgeSet]; + positions.sort((a, b) => a - b); + + const pq = new PriorityQueue({compare: (a, b) => b[2] - a[2]}); + + const result = []; + + let j = 0; + for (let i = 0; i < positions.length; i++) { + const position = positions[i]; + + for (j; j < buildings.length && buildings[j][0] <= position; j++) { + pq.enqueue(buildings[j]); + } + + while (!pq.isEmpty() && pq.front()[1] <= position) { + pq.dequeue(); + } + + let maxHeight = pq.front()?.[2] ?? 0; + + if (!result.length || result.at(-1)[1] !== maxHeight) { + result.push([position, maxHeight]); + } + } + + return result; +}; + +// another + + /** * @param {number[][]} buildings * @return {number[][]} From e436aa03991ffc281ef0c07b09ae94de4c1feff1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jun 2024 20:33:39 +0800 Subject: [PATCH 1758/2039] Create 3194-minimum-average-of-smallest-and-largest-elements.js --- ...m-average-of-smallest-and-largest-elements.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3194-minimum-average-of-smallest-and-largest-elements.js diff --git a/3194-minimum-average-of-smallest-and-largest-elements.js b/3194-minimum-average-of-smallest-and-largest-elements.js new file mode 100644 index 00000000..e8182c15 --- /dev/null +++ b/3194-minimum-average-of-smallest-and-largest-elements.js @@ -0,0 +1,16 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minimumAverage = function(nums) { + nums.sort((a, b) => a - b) + const arr = [] + let i = 0, j = nums.length - 1 + while(i < j) { + let a = nums[i], b = nums[j] + arr.push((a+b)/2) + i++ + j-- + } + return Math.min(...arr) +}; From b0c43519273957f1f25e18ef27876eaa1ae0bfda Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jun 2024 20:34:08 +0800 Subject: [PATCH 1759/2039] Create 3195-find-the-minimum-area-to-cover-all-ones-i.js --- ...nd-the-minimum-area-to-cover-all-ones-i.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 3195-find-the-minimum-area-to-cover-all-ones-i.js diff --git a/3195-find-the-minimum-area-to-cover-all-ones-i.js b/3195-find-the-minimum-area-to-cover-all-ones-i.js new file mode 100644 index 00000000..7b0e8296 --- /dev/null +++ b/3195-find-the-minimum-area-to-cover-all-ones-i.js @@ -0,0 +1,19 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumArea = function(grid) { + const m = grid.length, n = grid[0].length + let rmax = -1, rmin = Infinity, cmax = -1, cmin = Infinity + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + if(grid[i][j] === 1) { + rmin = Math.min(rmin, i) + cmin = Math.min(cmin, j) + rmax = Math.max(rmax, i) + cmax = Math.max(cmax, j) + } + } + } + return (rmax - rmin + 1) * (cmax - cmin + 1) +}; From 4acddd32420cdd6d35a507ad2c36242d22ea13c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jun 2024 20:34:42 +0800 Subject: [PATCH 1760/2039] Create 3196-maximize-total-cost-of-alternating-subarrays.js --- ...ize-total-cost-of-alternating-subarrays.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 3196-maximize-total-cost-of-alternating-subarrays.js diff --git a/3196-maximize-total-cost-of-alternating-subarrays.js b/3196-maximize-total-cost-of-alternating-subarrays.js new file mode 100644 index 00000000..d6e45781 --- /dev/null +++ b/3196-maximize-total-cost-of-alternating-subarrays.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumTotalCost = function (nums) { + const n = nums.length + const cache = new Map() + + return dfs(n - 1) + function dfs(i) { + if (cache.has(i)) return cache.get(i) + if (i === 0) { + return nums[0] + } else if (i === 1) { + return nums[0] + Math.abs(nums[1]) + } else { + const result = Math.max( + dfs(i - 1) + nums[i], + dfs(i - 2) + nums[i - 1] - nums[i], + ) + cache.set(i, result) + return result + } + } +} From 598755a129ee6c84b94ae0c124169192af818bc6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 23 Jun 2024 20:35:23 +0800 Subject: [PATCH 1761/2039] Create 3198-find-the-minimum-area-to-cover-all-ones-ii.js --- ...d-the-minimum-area-to-cover-all-ones-ii.js | 117 ++++++++++++++++++ 1 file changed, 117 insertions(+) create mode 100644 3198-find-the-minimum-area-to-cover-all-ones-ii.js diff --git a/3198-find-the-minimum-area-to-cover-all-ones-ii.js b/3198-find-the-minimum-area-to-cover-all-ones-ii.js new file mode 100644 index 00000000..5bdd1380 --- /dev/null +++ b/3198-find-the-minimum-area-to-cover-all-ones-ii.js @@ -0,0 +1,117 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumSum = function (grid) { + const n = grid.length + const m = grid[0].length + let ans = n * m + + for (let i = 0; i < n - 1; i++) { + const grid1 = grid.slice(0, i + 1).map((row) => row.slice()) + const ret1 = minimumArea(grid1) + + for (let j = 0; j < m - 1; j++) { + const grid2 = grid.slice(i + 1).map((row) => row.slice(0, j + 1)) + const grid3 = grid.slice(i + 1).map((row) => row.slice(j + 1)) + // console.log(grid1, grid2, grid3); + const ret2 = minimumArea(grid2) + const ret3 = minimumArea(grid3) + ans = Math.min(ans, ret1 + ret2 + ret3) + } + } + + for (let i = 0; i < n - 1; i++) { + const grid1 = grid.slice(i + 1).map((row) => row.slice()) + const ret1 = minimumArea(grid1) + + for (let j = 0; j < m - 1; j++) { + const grid2 = grid.slice(0, i + 1).map((row) => row.slice(0, j + 1)) + const grid3 = grid.slice(0, i + 1).map((row) => row.slice(j + 1)) + // console.log(grid1, grid2, grid3); + const ret2 = minimumArea(grid2) + const ret3 = minimumArea(grid3) + ans = Math.min(ans, ret1 + ret2 + ret3) + } + } + + for (let j = 0; j < m - 1; j++) { + const grid1 = grid.map((row) => row.slice(0, j + 1)) + const ret1 = minimumArea(grid1) + + for (let i = 0; i < n - 1; i++) { + const grid2 = grid.slice(0, i + 1).map((row) => row.slice(j + 1)) + const grid3 = grid.slice(i + 1).map((row) => row.slice(j + 1)) + // console.log(grid1, grid2, grid3); + const ret2 = minimumArea(grid2) + const ret3 = minimumArea(grid3) + ans = Math.min(ans, ret1 + ret2 + ret3) + } + } + + for (let j = 0; j < m - 1; j++) { + const grid1 = grid.map((row) => row.slice(j + 1)) + const ret1 = minimumArea(grid1) + + for (let i = 0; i < n - 1; i++) { + const grid2 = grid.slice(0, i + 1).map((row) => row.slice(0, j + 1)) + const grid3 = grid.slice(i + 1).map((row) => row.slice(0, j + 1)) + // console.log(grid1, grid2, grid3); + const ret2 = minimumArea(grid2) + const ret3 = minimumArea(grid3) + ans = Math.min(ans, ret1 + ret2 + ret3) + } + } + + for (let i = 0; i < n - 1; i++) { + const grid1 = grid.slice(0, i + 1).map((row) => row.slice()) + const ret1 = minimumArea(grid1) + + for (let k = i + 1; k < n - 1; k++) { + const grid2 = grid.slice(i + 1, k + 1).map((row) => row.slice()) + const grid3 = grid.slice(k + 1).map((row) => row.slice()) + + const ret2 = minimumArea(grid2) + const ret3 = minimumArea(grid3) + ans = Math.min(ans, ret1 + ret2 + ret3) + } + } + + for (let j = 0; j < m - 1; j++) { + const grid1 = grid.map((row) => row.slice(0, j + 1)) + const ret1 = minimumArea(grid1) + + for (let k = j + 1; k < m - 1; k++) { + const grid2 = grid.map((row) => row.slice(j + 1, k + 1)) + const grid3 = grid.map((row) => row.slice(k + 1)) + const ret2 = minimumArea(grid2) + const ret3 = minimumArea(grid3) + ans = Math.min(ans, ret1 + ret2 + ret3) + } + } + + return ans + + function minimumArea(grid) { + const n = grid.length + const m = grid[0].length + let x1 = n + let x2 = 0 + let y1 = m + let y2 = 0 + + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + if (grid[i][j] === 1) { + x1 = Math.min(x1, i) + x2 = Math.max(x2, i) + y1 = Math.min(y1, j) + y2 = Math.max(y2, j) + } + } + } + + const ret = (x2 - x1 + 1) * (y2 - y1 + 1) + return ret + } +} From ff490a66c9d4ee4704d3d25abde5c0e63ebe1af6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 25 Jun 2024 12:16:07 +0800 Subject: [PATCH 1762/2039] Create 3161-block-placement-queries.js --- 3161-block-placement-queries.js | 89 +++++++++++++++++++++++++++++++++ 1 file changed, 89 insertions(+) create mode 100644 3161-block-placement-queries.js diff --git a/3161-block-placement-queries.js b/3161-block-placement-queries.js new file mode 100644 index 00000000..e33d5d7c --- /dev/null +++ b/3161-block-placement-queries.js @@ -0,0 +1,89 @@ +/** + * @param {number[][]} queries + * @return {boolean[]} + */ +var getResults = function(queries) { + const max = queries.reduce((max, [_, x, sz = 0]) => Math.max(max, x, sz), 0) + 1; + const segmentTree = new SegmentTree(max) + const results = []; + for (const [type, x, sz = 0] of queries) { + if (type === 1) { + segmentTree.add(x); + } else { + results.push(segmentTree.query(x)[2] >= sz) + } + } + return results; +}; + +class SegmentTree { + n = 0 + minBlock = [] + maxBlock = [] + max = [] + + constructor(n) { + this.n = n + this.minBlock = new Array(2 * 2 ** Math.ceil(Math.log2(n))).fill(0); + this.maxBlock = new Array(2 * 2 ** Math.ceil(Math.log2(n))).fill(0); + this.max = new Array(2 * 2 ** Math.ceil(Math.log2(n))).fill(1); + this.populate() + } + + populate(idx = 0, l = 0, r = this.n - 1) { + if (l === r) return; + const mid = l + r >> 1; + this.populate(idx * 2 + 1, l, mid); + this.populate(idx * 2 + 2, mid + 1, r); + this.max[idx] = r - l + 1; + } + + update(idx, l, r) { + const left = idx * 2 + 1; + const leftSplit = this.maxBlock[left] > 0; + const right = idx * 2 + 2; + const rightSplit = this.minBlock[right] > 0; + + if (leftSplit && rightSplit) { + this.minBlock[idx] = this.minBlock[left]; + this.maxBlock[idx] = this.maxBlock[right]; + this.max[idx] = Math.max(this.max[left], this.max[right], this.minBlock[right] - this.maxBlock[left]); + } else if (leftSplit) { + this.minBlock[idx] = this.minBlock[left]; + this.maxBlock[idx] = this.maxBlock[left]; + this.max[idx] = r - this.maxBlock[left] + 1; + } else if (rightSplit) { + this.minBlock[idx] = this.minBlock[right]; + this.maxBlock[idx] = this.maxBlock[right]; + this.max[idx] = this.minBlock[right] - l; + } + } + + + add(x, idx = 0, l = 0, r = this.n - 1) { + if (l === r) { + this.minBlock[idx] = x; + this.maxBlock[idx] = x; + return; + } + const mid = l + r >> 1; + if (x <= mid + 1) this.add(x, idx * 2 + 1, l, mid); + else this.add(x, idx * 2 + 2, mid + 1, r); + this.update(idx, l, r) + } + + query(x, idx = 0, l = 0, r = this.n - 1) { + if (x <= l) return [0, 0, 0]; + if (x > r) return [this.minBlock[idx], this.maxBlock[idx], this.max[idx]]; + const mid = l + r >> 1; + if (x <= mid + 1) return this.query(x, idx * 2 + 1, l, mid); + const [lMinBlock, lMaxBlock, lMax] = this.query(x, idx * 2 + 1, l, mid); + const [rMinBlock, rMaxBlock, rMax] = this.query(x, idx * 2 + 2, mid + 1, r); + const leftEnd = lMaxBlock || l; + return [ + lMinBlock || rMinBlock, + rMaxBlock || lMaxBlock, + Math.max(lMax, rMax, (rMinBlock ? Math.min(rMinBlock, x) : x) - leftEnd) + ] + } +} From 90a75e8b320bc5427b6fc4c305011e2c387ccf6c Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Jun 2024 17:59:05 +0800 Subject: [PATCH 1763/2039] Create 3171-find-subarray-with-bitwise-or-closest-to-k.js --- ...d-subarray-with-bitwise-or-closest-to-k.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3171-find-subarray-with-bitwise-or-closest-to-k.js diff --git a/3171-find-subarray-with-bitwise-or-closest-to-k.js b/3171-find-subarray-with-bitwise-or-closest-to-k.js new file mode 100644 index 00000000..2aba1d29 --- /dev/null +++ b/3171-find-subarray-with-bitwise-or-closest-to-k.js @@ -0,0 +1,33 @@ + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minimumDifference = function(nums, k) { + const bits = new Array(32).fill(0); + let res = Number.MAX_SAFE_INTEGER, n = nums.length; + let left = 0, right = 0; + while (right < n) { + let curr = update(nums[right], 1); + res = Math.min(res, Math.abs(curr - k)); + while (left < right && curr > k) { + curr = update(nums[left++], -1); + res = Math.min(res, Math.abs(curr - k)); + } + right++; + } + return res; + function update(num, val) { + let res = 0; + for (let i = 0; i < 32; i++) { + if ((num >> i) & 1) { + bits[i] += val; + } + if (bits[i]) res |= 1 << i; + } + return res; + } +}; + + From b039bd5dddd5affac5ff226c647bbaca291c8e1f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Jun 2024 12:05:37 +0800 Subject: [PATCH 1764/2039] Update 3187-peaks-in-array.js --- 3187-peaks-in-array.js | 128 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 128 insertions(+) diff --git a/3187-peaks-in-array.js b/3187-peaks-in-array.js index 21184be7..44d7bf11 100644 --- a/3187-peaks-in-array.js +++ b/3187-peaks-in-array.js @@ -84,3 +84,131 @@ class BIT { return sum } } + +// another + +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +var countOfPeaks = function (nums, queries) { + const n = nums.length + const peak = new Array(n).fill(0) + + for (let i = 1; i < n - 1; ++i) { + if (nums[i] > nums[i - 1] && nums[i] > nums[i + 1]) peak[i] = 1 + } + + const ans = [] + const st = new SegmentTree(n) + st.build(0, 0, n - 1, peak) + + for (let i = 0; i < queries.length; ++i) { + const q = queries + const type = q[i][0] + + if (type === 1) { + const l = q[i][1] + const r = q[i][2] + + if (l === r) { + ans.push(0) + continue + } + + let red = 0 + + if (peak[l] === 1) ++red + + if (peak[r] === 1) ++red + + const res = st.query(0, 0, n - 1, l, r) + ans.push(res - red) + } else if (type === 2) { + const p = q[i][1] + const x = q[i][2] + + nums[p] = x + + if (p - 1 >= 0 && p + 1 < n) { + if (nums[p] > nums[p - 1] && nums[p] > nums[p + 1]) { + st.update(0, 0, n - 1, p, 1) + peak[p] = 1 + } else { + st.update(0, 0, n - 1, p, 0) + peak[p] = 0 + } + } + + if (p - 2 >= 0 && p < n) { + if (nums[p - 1] > nums[p - 2] && nums[p - 1] > nums[p]) { + st.update(0, 0, n - 1, p - 1, 1) + peak[p - 1] = 1 + } else { + st.update(0, 0, n - 1, p - 1, 0) + peak[p - 1] = 0 + } + } + + if (p >= 0 && p + 2 < n) { + if (nums[p + 1] > nums[p] && nums[p + 1] > nums[p + 2]) { + st.update(0, 0, n - 1, p + 1, 1) + peak[p + 1] = 1 + } else { + st.update(0, 0, n - 1, p + 1, 0) + peak[p + 1] = 0 + } + } + } + } + + return ans +} + +class SegmentTree { + constructor(n) { + this.seg = new Array(4 * n + 1).fill(0) + } + + build(ind, low, high, arr) { + if (low === high) { + this.seg[ind] = arr[low] + return + } + + const mid = Math.floor((low + high) / 2) + + this.build(2 * ind + 1, low, mid, arr) + this.build(2 * ind + 2, mid + 1, high, arr) + + this.seg[ind] = this.seg[2 * ind + 1] + this.seg[2 * ind + 2] + } + + query(ind, low, high, l, r) { + if (r < low || high < l) return 0 + + if (low >= l && high <= r) return this.seg[ind] + + const mid = Math.floor((low + high) / 2) + const left = this.query(2 * ind + 1, low, mid, l, r) + const right = this.query(2 * ind + 2, mid + 1, high, l, r) + + return left + right + } + + update(ind, low, high, i, val) { + if (low === high) { + this.seg[ind] = val + return + } + + const mid = Math.floor((low + high) / 2) + + if (i <= mid) this.update(2 * ind + 1, low, mid, i, val) + else this.update(2 * ind + 2, mid + 1, high, i, val) + + this.seg[ind] = this.seg[2 * ind + 1] + this.seg[2 * ind + 2] + } +} + From cca1990a0b5376823a5853432ba116537fb0e4fe Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jun 2024 15:59:18 +0800 Subject: [PATCH 1765/2039] Create 3200-maximum-height-of-a-triangle.js --- 3200-maximum-height-of-a-triangle.js | 46 ++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 3200-maximum-height-of-a-triangle.js diff --git a/3200-maximum-height-of-a-triangle.js b/3200-maximum-height-of-a-triangle.js new file mode 100644 index 00000000..76d80fbd --- /dev/null +++ b/3200-maximum-height-of-a-triangle.js @@ -0,0 +1,46 @@ +/** + * @param {number} red + * @param {number} blue + * @return {number} + */ +const maxHeightOfTriangle = function(red, blue) { + let blueFirst = 0, redFirst = 0 + let bb = blue, rb = red + let b = 1, r = 2 + let bl = 0, rl = 0 + while(bb >= b) { + bl++ + bb -= b + b += 2 + } + while(rb >= r && rl < bl) { + rl++ + rb -= r + r += 2 + } + if(bl - rl > 1) bl = rl + 1 + + blueFirst = bl + rl + + bb = blue, rb = red + b = 2, r = 1 + bl = 0, rl = 0 + while(rb >= r) { + rl++ + rb -= r + r += 2 + } + + while(bb >= b && bl < rl) { + bl++ + bb -= b + b += 2 + } + if(rl - bl > 1) rl = bl + 1 + + redFirst = bl + rl + + + // return blueFirst + return Math.max(blueFirst, redFirst) +}; From a88ed9a04fd1b5d07e9e78fd28c86c0dc011da61 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jun 2024 15:59:49 +0800 Subject: [PATCH 1766/2039] Create 3201-find-the-maximum-length-of-valid-subsequence-i.js --- ...e-maximum-length-of-valid-subsequence-i.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 3201-find-the-maximum-length-of-valid-subsequence-i.js diff --git a/3201-find-the-maximum-length-of-valid-subsequence-i.js b/3201-find-the-maximum-length-of-valid-subsequence-i.js new file mode 100644 index 00000000..2e32d6ca --- /dev/null +++ b/3201-find-the-maximum-length-of-valid-subsequence-i.js @@ -0,0 +1,51 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumLength = function (nums) { + const n = nums.length + const arr = new Array(n) + let zeroCnt = 0 + let firstZeroIdx = -1 + let firstOneIdx = -1 + for (let i = 0; i < n; i++) { + arr[i] = nums[i] % 2 + if (arr[i] === 0) { + if (firstZeroIdx < 0) { + firstZeroIdx = i + } + zeroCnt++ + } else { + if (firstOneIdx < 0) { + firstOneIdx = i + } + } + } + const oneCnt = n - zeroCnt + // Assume the subsequence's modulo is 0 + let res = Math.max(zeroCnt, oneCnt) + // Modulo is 1 + if (firstZeroIdx >= 0) { + let tmp = 1 + let last = 0 + for (let i = firstZeroIdx + 1; i < n; i++) { + if ((last ^ arr[i]) === 1) { + tmp++ + last = arr[i] + } + } + res = Math.max(res, tmp) + } + if (firstOneIdx >= 0) { + let tmp = 1 + let last = 1 + for (let i = firstOneIdx + 1; i < n; i++) { + if ((last ^ arr[i]) === 1) { + tmp++ + last = arr[i] + } + } + res = Math.max(res, tmp) + } + return res +} From 75c4cdbab702cc8102990bb0ab9d2febef26186a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jun 2024 16:00:21 +0800 Subject: [PATCH 1767/2039] Create 3202-find-the-maximum-length-of-valid-subsequence-ii.js --- ...-maximum-length-of-valid-subsequence-ii.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 3202-find-the-maximum-length-of-valid-subsequence-ii.js diff --git a/3202-find-the-maximum-length-of-valid-subsequence-ii.js b/3202-find-the-maximum-length-of-valid-subsequence-ii.js new file mode 100644 index 00000000..6b361e6c --- /dev/null +++ b/3202-find-the-maximum-length-of-valid-subsequence-ii.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maximumLength = function (nums, k) { + const n = nums.length; + const dp = Array.from({ length: n }, () => Array(k).fill(1)); + table(nums, k, dp); + + let maxLength = 0; + for (const row of dp) { + for (const length of row) { + maxLength = Math.max(maxLength, length); + } + } + return maxLength; +} +function table(nums, k, dp) { + const n = nums.length; + for (let i = 0; i < n; i++) { + for (let j = 0; j < i; j++) { + const remainder = (nums[i] + nums[j]) % k; + dp[i][remainder] = Math.max(dp[i][remainder], dp[j][remainder] + 1); + } + } +} + + + From c3d0937ea692f0492d4aca233bbe1ed847c6906e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Jun 2024 16:00:52 +0800 Subject: [PATCH 1768/2039] Create 3203-find-minimum-diameter-after-merging-two-trees.js --- ...inimum-diameter-after-merging-two-trees.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 3203-find-minimum-diameter-after-merging-two-trees.js diff --git a/3203-find-minimum-diameter-after-merging-two-trees.js b/3203-find-minimum-diameter-after-merging-two-trees.js new file mode 100644 index 00000000..78df2dd8 --- /dev/null +++ b/3203-find-minimum-diameter-after-merging-two-trees.js @@ -0,0 +1,47 @@ +/** + * @param {number[][]} edges1 + * @param {number[][]} edges2 + * @return {number} + */ +var minimumDiameterAfterMerge = function (edges1, edges2) { + const getDiameter = (edges) => { + if (edges.length === 0) { + return 0 + } + const graph = new Map() + for (const [u, v] of edges) { + if (!graph.has(u)) { + graph.set(u, []) + } + graph.get(u).push(v) + if (!graph.has(v)) { + graph.set(v, []) + } + graph.get(v).push(u) + } + + function dfs(node, parent) { + // return longest path length and farthest node + let res = [0, node] + for (const neighbor of graph.get(node) || []) { + if (neighbor === parent) { + continue + } + const tmp = dfs(neighbor, node) + if (tmp[0] > res[0]) res = tmp + } + res[0] += 1 + return res + } + + const [_, endNode] = dfs(0, -1) + const [diameter, __] = dfs(endNode, -1) + return diameter - 1 + } + + const diameter1 = getDiameter(edges1) + const diameter2 = getDiameter(edges2) + const radius1 = Math.floor((diameter1 + 1) / 2) + const radius2 = Math.floor((diameter2 + 1) / 2) + return Math.max(radius1 + radius2 + 1, diameter1, diameter2) +} From 1cc6aec69ae0fb60dd9295e5e28f94c428262991 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Jul 2024 11:33:06 +0800 Subject: [PATCH 1769/2039] Update 56-merge-intervals.js --- 56-merge-intervals.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/56-merge-intervals.js b/56-merge-intervals.js index a772b911..244a9fad 100644 --- a/56-merge-intervals.js +++ b/56-merge-intervals.js @@ -1,3 +1,28 @@ +/** + * @param {number[][]} intervals + * @return {number[][]} + */ +const merge = function(intervals) { + intervals.sort((a, b) => a[0] - b[0]) + const res = [] + let cur = intervals[0] + const n = intervals.length + res.push(cur) + for(let i = 1; i < n; i++) { + const e = intervals[i] + if(e[0] <= cur[1]) { + cur[1] = Math.max(e[1], cur[1]) + } else { + res.push(e) + cur = e + } + } + + return res +}; + +// another + /** * @param {number[][]} intervals * @return {number[][]} From ffde7b2501073aed618953c56c2fbaa5cee1ae77 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 3 Jul 2024 12:04:40 +0800 Subject: [PATCH 1770/2039] Update 57-insert-interval.js --- 57-insert-interval.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/57-insert-interval.js b/57-insert-interval.js index 60d4663b..d7611a1c 100644 --- a/57-insert-interval.js +++ b/57-insert-interval.js @@ -1,3 +1,30 @@ +/** + * @param {number[][]} intervals + * @param {number[]} newInterval + * @return {number[][]} + */ +const insert = function(intervals, newInterval) { + const res = [], n = intervals.length + let i = 0 + while(i < n && intervals[i][1] < newInterval[0]) { + res.push(intervals[i]) + i++ + } + while(i < n && intervals[i][0] <= newInterval[1]) { + newInterval[0] = Math.min(newInterval[0], intervals[i][0]) + newInterval[1] = Math.max(newInterval[1], intervals[i][1]) + i++ + } + res.push(newInterval) + while(i < n) { + res.push(intervals[i]) + i++ + } + + return res +}; + +// another /** * @param {number[][]} intervals * @param {number[]} newInterval From b67f5fe68b04d26c5dbb37e6fd1dc307c6707de1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Jul 2024 12:00:02 +0800 Subject: [PATCH 1771/2039] Update 986-interval-list-intersections.js --- 986-interval-list-intersections.js | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/986-interval-list-intersections.js b/986-interval-list-intersections.js index d82ad773..362e81d3 100644 --- a/986-interval-list-intersections.js +++ b/986-interval-list-intersections.js @@ -21,3 +21,29 @@ const intervalIntersection = function (A, B) { } return intersection } + +// another + +/** + * @param {number[][]} firstList + * @param {number[][]} secondList + * @return {number[][]} + */ +const intervalIntersection = function(firstList, secondList) { + const res = []; + let i = 0; + let j = 0; + while (i < firstList.length && j < secondList.length) { + const [start1, end1] = firstList[i]; + const [start2, end2] = secondList[j]; + if (start1 <= end2 && start2 <= end1) { + res.push([Math.max(start1, start2), Math.min(end1, end2)]); + } + if (end1 < end2) { + i++; + } else { + j++; + } + } + return res; +}; From 28fed09b4d29d4b5f5a21e1bb67a9cc6c0f3b9bf Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 5 Jul 2024 17:11:29 +0800 Subject: [PATCH 1772/2039] Update 1589-maximum-sum-obtained-of-any-permutation.js --- ...maximum-sum-obtained-of-any-permutation.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/1589-maximum-sum-obtained-of-any-permutation.js b/1589-maximum-sum-obtained-of-any-permutation.js index 54b7f955..2a42dd8b 100644 --- a/1589-maximum-sum-obtained-of-any-permutation.js +++ b/1589-maximum-sum-obtained-of-any-permutation.js @@ -1,3 +1,33 @@ +/** + * @param {number[]} nums + * @param {number[][]} requests + * @return {number} + */ +const maxSumRangeQuery = function(nums, requests) { + nums.sort((a, b) => b - a) + const n = nums.length + const arr = Array(n).fill(0) + for(const [s, e] of requests) { + arr[s] += 1 + if(e + 1 < n) arr[e + 1] -= 1 + } + for(let i = 1; i < n; i++) { + arr[i] += arr[i - 1] + } + arr.sort((a, b) => b - a) + + let res = 0 + const mod = 1e9 + 7 + + for(let i = 0; i < n; i++) { + res = (res + nums[i] * arr[i]) % mod + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number[][]} requests From 28e69519052c8bb973dc3f79459509461f3d27e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Jul 2024 16:38:00 +0800 Subject: [PATCH 1773/2039] Create 3210-find-the-encrypted-string.js --- 3210-find-the-encrypted-string.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3210-find-the-encrypted-string.js diff --git a/3210-find-the-encrypted-string.js b/3210-find-the-encrypted-string.js new file mode 100644 index 00000000..76e5c960 --- /dev/null +++ b/3210-find-the-encrypted-string.js @@ -0,0 +1,16 @@ +/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var getEncryptedString = function(s, k) { + const ss=s+s + const n = s.length + let res = '' + for(let i = 0; i < n; i++) { + const idx = (i + k) % n + res += ss[idx] + } + + return res +}; From e64ea0038abc24dc0f3881b1e922892f85fbcbfa Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Jul 2024 16:38:33 +0800 Subject: [PATCH 1774/2039] Create 3211-generate-binary-strings-without-adjacent-zeros.js --- ...e-binary-strings-without-adjacent-zeros.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 3211-generate-binary-strings-without-adjacent-zeros.js diff --git a/3211-generate-binary-strings-without-adjacent-zeros.js b/3211-generate-binary-strings-without-adjacent-zeros.js new file mode 100644 index 00000000..7e1be42e --- /dev/null +++ b/3211-generate-binary-strings-without-adjacent-zeros.js @@ -0,0 +1,24 @@ +/** + * @param {number} n + * @return {string[]} + */ +var validStrings = function(n) { + const set= new Set() + bt(1, '0') + bt(1, '1') + return Array.from(set) + + function bt(i, cur) { + if(i === n) { + set.add(cur) + return + } + const last = cur[cur.length - 1] + if(last === '0') { + bt(i + 1, cur + '1') + } else { + bt(i + 1, cur + '1') + bt(i + 1, cur + '0') + } + } +}; From 8b87f257dc42ea9cb8f4a576a11195bfc0b011f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Jul 2024 16:39:04 +0800 Subject: [PATCH 1775/2039] Create 3212-count-submatrices-with-equal-frequency-of-x-and-y.js --- ...atrices-with-equal-frequency-of-x-and-y.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 3212-count-submatrices-with-equal-frequency-of-x-and-y.js diff --git a/3212-count-submatrices-with-equal-frequency-of-x-and-y.js b/3212-count-submatrices-with-equal-frequency-of-x-and-y.js new file mode 100644 index 00000000..5e2a229b --- /dev/null +++ b/3212-count-submatrices-with-equal-frequency-of-x-and-y.js @@ -0,0 +1,37 @@ +/** + * @param {character[][]} grid + * @return {number} + */ +var numberOfSubmatrices = function (grid) { + let r = grid.length + let c = grid[0].length + let prex = new Array(r + 1).fill(0).map(() => new Array(c + 1).fill(0)) + let prey = new Array(r + 1).fill(0).map(() => new Array(c + 1).fill(0)) + + for (let i = 1; i <= r; i++) { + for (let j = 1; j <= c; j++) { + prex[i][j] = + prex[i - 1][j] + + prex[i][j - 1] - + prex[i - 1][j - 1] + + (grid[i - 1][j - 1] === 'X' ? 1 : 0) + prey[i][j] = + prey[i - 1][j] + + prey[i][j - 1] - + prey[i - 1][j - 1] + + (grid[i - 1][j - 1] === 'Y' ? 1 : 0) + } + } + + let res = 0 + for (let i = 0; i < r; i++) { + for (let j = 0; j < c; j++) { + let cx = prex[i + 1][j + 1] - prex[0][j + 1] - prex[i + 1][0] + prex[0][0] + let cy = prey[i + 1][j + 1] - prey[0][j + 1] - prey[i + 1][0] + prey[0][0] + if (cx === cy && cx > 0) { + res++ + } + } + } + return res +} From 080b770b1afc84039d6782248d7f57fe4608bc42 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 7 Jul 2024 16:39:33 +0800 Subject: [PATCH 1776/2039] Create 3213-construct-string-with-minimum-cost.js --- 3213-construct-string-with-minimum-cost.js | 59 ++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 3213-construct-string-with-minimum-cost.js diff --git a/3213-construct-string-with-minimum-cost.js b/3213-construct-string-with-minimum-cost.js new file mode 100644 index 00000000..1f8666b3 --- /dev/null +++ b/3213-construct-string-with-minimum-cost.js @@ -0,0 +1,59 @@ +const mx = 1000000000 +/** + * @param {string} target + * @param {string[]} words + * @param {number[]} costs + * @return {number} + */ +var minimumCost = function (target, words, costs) { + const n = target.length + const dp = new Array(n + 1).fill(mx) + const t = new Trie(30) + + for (let i = 0; i < words.length; i++) { + t.insert(words[i], costs[i]) + } + + dp[n] = 0 + + for (let i = n - 1; i >= 0; i--) { + let cur = t + for (let j = i; j <= n && cur !== null; j++) { + if (cur.cost !== mx) { + dp[i] = Math.min(dp[j] + cur.cost, dp[i]) + } + if (j < n) { + cur = cur.sons[target.charCodeAt(j) - 'a'.charCodeAt(0)] + } + } + } + + return dp[0] === mx ? -1 : dp[0] +} + +class Trie { + constructor(range) { + this.range = range + this.cost = mx + this.sons = new Array(range).fill(null) + } + + insert(str, cost) { + let cur = this + for (let c of str) { + if (cur.sons[c.charCodeAt(0) - 'a'.charCodeAt(0)] === null) { + cur.sons[c.charCodeAt(0) - 'a'.charCodeAt(0)] = new Trie(this.range) + } + cur = cur.sons[c.charCodeAt(0) - 'a'.charCodeAt(0)] + } + cur.cost = Math.min(cur.cost, cost) + } + + destroy() { + for (let t of this.sons) { + if (t !== null) { + t.destroy() + } + } + } +} From f8beae1e6d2b0c090a54c9c3e86b911bbc0b3aa7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Jul 2024 10:31:59 +0800 Subject: [PATCH 1777/2039] Update 218-the-skyline-problem.js --- 218-the-skyline-problem.js | 85 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 85 insertions(+) diff --git a/218-the-skyline-problem.js b/218-the-skyline-problem.js index 39846b9c..81f1f00c 100644 --- a/218-the-skyline-problem.js +++ b/218-the-skyline-problem.js @@ -1,3 +1,88 @@ +/** + * @param {number[][]} buildings + * @return {number[][]} + */ +const getSkyline = function(buildings) { + const hash = {} + for(const b of buildings) { + const [s, e, h] = b + if(hash[s] == null) hash[s] = [] + if(hash[e] == null) hash[e] = [] + hash[s].push(h) + hash[e].push(-h) + } + const ms = new MultiSet() + const res = [] + + for(const [pos, hs] of Object.entries(hash)) { + for(const h of hs) { + if(h > 0) { + ms.add(h) + } else { + ms.remove(-h) + } + } + const h = ms.max || 0 + if(res.length === 0 || res[res.length - 1][1] !== h) { + res.push([+pos, h]) + } + } + + + return res +}; + +class MultiSet { + constructor() { + this.countMap = new Map() + this.valueList = [] + } + remove(value) { + if(!this.countMap.has(value)) return false + let index = binarySearch(this.valueList, value) + if (this.countMap.get(value) === 1) { + this.valueList.splice(index, 1) + this.countMap.delete(value) + } else { + this.countMap.set(value, (this.countMap.get(value) || 0) - 1) + } + return true + } + add(value) { + let index = binarySearch(this.valueList, value) + if (index < 0) { + this.valueList.splice(-index - 1, 0, value) + this.countMap.set(value, 1) + } else { + this.countMap.set(value, this.countMap.get(value) + 1) + } + } + get max() { + return this.valueList[this.valueList.length - 1] + } + get min() { + return this.valueList[0] + } +} + +function binarySearch(arr, val) { + let l = 0, r = arr.length + while( l < r ) { + const mid = Math.floor((l + r) / 2) + if(arr[mid] < val) { + l = mid + 1 + } else { + r = mid + } + } + if(arr[l] !== val) return -(l + 1) + + return l +} + +// another + + /** * @param {number[][]} buildings * @return {number[][]} From 851893a275e7b5273a25ba7db128a6ed8046fe20 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Jul 2024 13:39:13 +0800 Subject: [PATCH 1778/2039] Update 3213-construct-string-with-minimum-cost.js --- 3213-construct-string-with-minimum-cost.js | 95 ++++++++++++++++++++++ 1 file changed, 95 insertions(+) diff --git a/3213-construct-string-with-minimum-cost.js b/3213-construct-string-with-minimum-cost.js index 1f8666b3..0b505d8a 100644 --- a/3213-construct-string-with-minimum-cost.js +++ b/3213-construct-string-with-minimum-cost.js @@ -1,3 +1,98 @@ +/** + * @param {string} target + * @param {string[]} words + * @param {number[]} costs + * @return {number} + */ +var minimumCost = function (target, words, costs) { + let ac = new AhoCorasick() + for (let i = 0; i < words.length; i++) { + ac.put(words[i], costs[i]) + } + ac.build_fail() + + let n = target.length + let f = new Array(n + 1).fill(Infinity) + f[0] = 0 + let cur = (root = ac.root) + for (let i = 1; i <= n; i++) { + cur = cur.son[target.charCodeAt(i - 1) - 'a'.charCodeAt(0)] + if (cur.len) { + f[i] = Math.min(f[i], f[i - cur.len] + cur.cost) + } + let fail = cur.last + while (fail !== root) { + let tmp = f[i - fail.len] + fail.cost + if (tmp < f[i]) { + f[i] = tmp + } + fail = fail.last + } + } + return f[n] === Infinity ? -1 : f[n] +} + +class Node { + constructor() { + this.son = new Array(26).fill(null) + this.fail = null + this.last = null + this.len = 0 + this.cost = Infinity + } +} + +class AhoCorasick { + constructor() { + this.root = new Node() + } + + put(s, cost) { + let cur = this.root + for (let i = 0; i < s.length; i++) { + let b = s.charCodeAt(i) - 'a'.charCodeAt(0) + if (cur.son[b] === null) { + cur.son[b] = new Node() + } + cur = cur.son[b] + } + cur.len = s.length + cur.cost = Math.min(cur.cost, cost) + } + + build_fail() { + this.root.fail = this.root.last = this.root + let q = [] + for (let i = 0; i < this.root.son.length; i++) { + let son = this.root.son[i] + if (son === null) { + this.root.son[i] = this.root + } else { + son.fail = son.last = this.root + q.push(son) + } + } + while (q.length > 0) { + let cur = q.shift() + for (let i = 0; i < cur.son.length; i++) { + let son = cur.son[i] + if (son === null) { + cur.son[i] = cur.fail.son[i] + continue + } + son.fail = cur.fail.son[i] + son.last = son.fail.len ? son.fail : son.fail.last + q.push(son) + } + } + } +} + + + + +// TLE below + const mx = 1000000000 /** * @param {string} target From 68c3a80e05d5d41c877b506926753b06c5f06f30 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 12 Jul 2024 11:58:28 +0800 Subject: [PATCH 1779/2039] Create 2617-minimum-number-of-visited-cells-in-a-grid.js --- ...nimum-number-of-visited-cells-in-a-grid.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 2617-minimum-number-of-visited-cells-in-a-grid.js diff --git a/2617-minimum-number-of-visited-cells-in-a-grid.js b/2617-minimum-number-of-visited-cells-in-a-grid.js new file mode 100644 index 00000000..c29802c8 --- /dev/null +++ b/2617-minimum-number-of-visited-cells-in-a-grid.js @@ -0,0 +1,56 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumVisitedCells = function (grid) { + const m = grid.length, + n = grid[0].length + const dp = Array(m) + .fill(0) + .map(() => Array(n).fill(Infinity)), + colStacks = Array(n) + .fill(0) + .map(() => []) // colStacks[j] = stack of row indexes for column j + dp[m - 1][n - 1] = 1 + colStacks[n - 1].push(m - 1) + + for (let i = m - 1; i >= 0; i--) { + let rowStack = i === m - 1 ? [n - 1] : [] // stack of column indexes for row i + for (let j = n - 1; j >= 0; j--) { + let colIndex = findIndex(rowStack, grid[i][j] + j) + if (colIndex >= 0) + dp[i][j] = Math.min(dp[i][j], 1 + dp[i][rowStack[colIndex]]) + let colStack = colStacks[j], + rowIndex = findIndex(colStack, grid[i][j] + i) + if (rowIndex >= 0) + dp[i][j] = Math.min(dp[i][j], 1 + dp[colStack[rowIndex]][j]) + + while ( + rowStack.length && + dp[i][rowStack[rowStack.length - 1]] >= dp[i][j] + ) + rowStack.pop() + rowStack.push(j) + while ( + colStack.length && + dp[colStack[colStack.length - 1]][j] >= dp[i][j] + ) + colStack.pop() + colStack.push(i) + } + } + return dp[0][0] === Infinity ? -1 : dp[0][0] + } + + function findIndex(stack, maxIndex) { + if (!stack.length) return -1 + let low = 0, + high = stack.length - 1 + while (low < high) { + let mid = Math.floor((low + high) / 2) + if (stack[mid] <= maxIndex) high = mid + else low = mid + 1 + } + return stack[low] <= maxIndex ? low : -1 + } + From 2b71861c7b8e4cbc26e1743a5612764b8835f646 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Jul 2024 22:34:49 +0800 Subject: [PATCH 1780/2039] Create 3216-lexicographically-smallest-string-after-a-swap.js --- ...cographically-smallest-string-after-a-swap.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3216-lexicographically-smallest-string-after-a-swap.js diff --git a/3216-lexicographically-smallest-string-after-a-swap.js b/3216-lexicographically-smallest-string-after-a-swap.js new file mode 100644 index 00000000..a4d57bf8 --- /dev/null +++ b/3216-lexicographically-smallest-string-after-a-swap.js @@ -0,0 +1,16 @@ +/** + * @param {string} s + * @return {string} + */ +var getSmallestString = function(s) { + const arr = s.split('') + const n = arr.length + for(let i = 1; i < n; i++) { + const valid = +arr[i] % 2 === +arr[i - 1] % 2 + if(valid && (+arr[i] < +arr[i - 1])) { + ;[arr[i - 1], arr[i]] = [arr[i], arr[i - 1]] + return arr.join('') + } + } + return s +}; From 4554214ade6746b6c40080cbfefef67dc973bf94 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Jul 2024 22:35:18 +0800 Subject: [PATCH 1781/2039] Create 3217-delete-nodes-from-linked-list-present-in-array.js --- ...nodes-from-linked-list-present-in-array.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 3217-delete-nodes-from-linked-list-present-in-array.js diff --git a/3217-delete-nodes-from-linked-list-present-in-array.js b/3217-delete-nodes-from-linked-list-present-in-array.js new file mode 100644 index 00000000..d83363b4 --- /dev/null +++ b/3217-delete-nodes-from-linked-list-present-in-array.js @@ -0,0 +1,38 @@ +/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {number[]} nums + * @param {ListNode} head + * @return {ListNode} + */ +var modifiedList = function(nums, head) { + const arr = [] + let cur = head + while(cur) { + arr.push(cur) + cur = cur.next + } + const set = new Set(nums) + let i = 0 + for(const e of arr) { + if(set.has(e.val)) { + arr[i] = null + } + i++ + } + const res = arr.filter(e => e != null) + for(let i = 0; i < res.length; i++) { + const e = res[i] + if(i === res.length - 1) { + e.next = null + break + } + e.next = res[i + 1] + } + return res[0] +}; From 721f84e7c821d5f26ae0b25f483d166ed6f36cf1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Jul 2024 22:35:45 +0800 Subject: [PATCH 1782/2039] Create 3218-minimum-cost-for-cutting-cake-i.js --- 3218-minimum-cost-for-cutting-cake-i.js | 40 +++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3218-minimum-cost-for-cutting-cake-i.js diff --git a/3218-minimum-cost-for-cutting-cake-i.js b/3218-minimum-cost-for-cutting-cake-i.js new file mode 100644 index 00000000..5ad408c9 --- /dev/null +++ b/3218-minimum-cost-for-cutting-cake-i.js @@ -0,0 +1,40 @@ +class Cut { + constructor(cost, type) { + this.cost = cost + this.type = type + } +} +/** + * @param {number} m + * @param {number} n + * @param {number[]} horizontalCut + * @param {number[]} verticalCut + * @return {number} + */ +var minimumCost = function (m, n, horizontalCut, verticalCut) { + const cuts = [] + for (let i = 0; i < horizontalCut.length; i++) { + cuts.push(new Cut(horizontalCut[i], 'H')) + } + for (let j = 0; j < verticalCut.length; j++) { + cuts.push(new Cut(verticalCut[j], 'V')) + } + + cuts.sort((a, b) => -a.cost + b.cost) + + let totalCost = 0 + let horizontalSegments = 1 + let verticalSegments = 1 + + for (const cut of cuts) { + if (cut.type === 'H') { + totalCost += cut.cost * verticalSegments + horizontalSegments++ + } else { + totalCost += cut.cost * horizontalSegments + verticalSegments++ + } + } + + return totalCost +} From d40cce155c2c3d7f12d05ca7c4a5910b39bf25db Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 14 Jul 2024 22:36:18 +0800 Subject: [PATCH 1783/2039] Create 3219-minimum-cost-for-cutting-cake-ii.js --- 3219-minimum-cost-for-cutting-cake-ii.js | 40 ++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3219-minimum-cost-for-cutting-cake-ii.js diff --git a/3219-minimum-cost-for-cutting-cake-ii.js b/3219-minimum-cost-for-cutting-cake-ii.js new file mode 100644 index 00000000..fca6dce0 --- /dev/null +++ b/3219-minimum-cost-for-cutting-cake-ii.js @@ -0,0 +1,40 @@ +class Cut { + constructor(cost, type) { + this.cost = cost + this.type = type + } +} +/** + * @param {number} m + * @param {number} n + * @param {number[]} horizontalCut + * @param {number[]} verticalCut + * @return {number} + */ +var minimumCost = function(m, n, horizontalCut, verticalCut) { + let cuts = [] + for (let i = 0; i < horizontalCut.length; i++) { + cuts.push(new Cut(horizontalCut[i], 'H')) + } + for (let j = 0; j < verticalCut.length; j++) { + cuts.push(new Cut(verticalCut[j], 'V')) + } + + cuts.sort((a, b) => -a.cost + b.cost) + + let ans = 0 + let hCount = 1 + let vCount = 1 + + for (let cut of cuts) { + if (cut.type === 'H') { + ans += cut.cost * vCount + hCount++ + } else { + ans += cut.cost * hCount + vCount++ + } + } + + return ans +}; From cca30549cac59a4111d18d20635792b95e99349e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 15 Jul 2024 10:40:02 +0800 Subject: [PATCH 1784/2039] Update 2963-count-the-number-of-good-partitions.js --- 2963-count-the-number-of-good-partitions.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/2963-count-the-number-of-good-partitions.js b/2963-count-the-number-of-good-partitions.js index 149c3feb..4e94ff51 100644 --- a/2963-count-the-number-of-good-partitions.js +++ b/2963-count-the-number-of-good-partitions.js @@ -1,3 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const numberOfGoodPartitions = function(nums) { + const n = nums.length, mod = 1e9 + 7, lastIdxHash = {} + let res = 1 + for (let i = 0; i < n; i++) lastIdxHash[nums[i]] = i + let j = 0 + for(let i = 0; i < n; i++) { + if(i > j) res = (res * 2) % mod + j = Math.max(j, lastIdxHash[nums[i]]) + } + + + return res +}; + +// another + class Interval { constructor(left, right) { this.left = left From 60cc6fe7c06409952aac5a69bac4d4220bf2b1d9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 18 Jul 2024 11:23:33 +0800 Subject: [PATCH 1785/2039] Create 3197-find-the-minimum-area-to-cover-all-ones-ii.js --- ...d-the-minimum-area-to-cover-all-ones-ii.js | 122 ++++++++++++++++++ 1 file changed, 122 insertions(+) create mode 100644 3197-find-the-minimum-area-to-cover-all-ones-ii.js diff --git a/3197-find-the-minimum-area-to-cover-all-ones-ii.js b/3197-find-the-minimum-area-to-cover-all-ones-ii.js new file mode 100644 index 00000000..7d16a72e --- /dev/null +++ b/3197-find-the-minimum-area-to-cover-all-ones-ii.js @@ -0,0 +1,122 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const minimumSum = function(grid) { + const m = grid.length, n = grid[0].length + let res = Infinity +// case 1 +/* +1 | 2 | 3 +*/ +for(let i = 0; i < n - 2; i++) { + const one = calc(0, m - 1, 0, i, grid) + for(let j = i + 1; j < n - 1; j++) { + const two = calc(0, m - 1, i + 1, j, grid) + const three = calc(0, m - 1, j + 1, n - 1, grid) + res = Math.min(res, one + two + three) + } +} + + +// case 2 +/* +1 +- +2 +- +3 +*/ +for(let i = 0; i < m - 2; i++) { + const one = calc(0, i, 0, n - 1, grid) + for(let j = i + 1; j < m - 1; j++) { + const two = calc(i + 1, j, 0, n - 1, grid) + const three = calc(j + 1, m - 1, 0, n - 1, grid) + res = Math.min(res, one + two + three) + } +} + + +// case 3 +/* +2 | 3 +----- + 1 +*/ +for(let i = m - 1; i >= 1; i--) { + const one = calc(i, m - 1, 0, n - 1, grid) + for(let j = 0; j < n - 1; j++) { + const two = calc(0, i - 1, 0, j, grid) + const three = calc(0, i - 1, j + 1, n - 1, grid) + res = Math.min(res, one + two + three) + } + +} + + +// case 4 +/* +2 | +--| 1 +3 | +*/ +for(let i = n - 1; i >= 1; i--) { + const one = calc(0, m - 1, i, n - 1, grid) + for(let j = 0; j < m - 1; j++) { + const two = calc(0, j, 0, i - 1, grid) + const three = calc(j + 1, m - 1, 0, i - 1, grid) + res = Math.min(res, one + two + three) + } + } + + +// case 5 +/* + 1 +----- +2 | 3 +*/ +for(let i = 0; i < m - 1; i++) { + const one = calc(0, i, 0, n - 1, grid) + for(let j = 0; j < n - 1; j++) { + const two = calc(i + 1, m - 1, 0, j, grid) + const three = calc(i + 1, m - 1, j + 1, n - 1, grid) + res = Math.min(res, one + two + three) + } + +} + + +// case 6 +/* + | 2 + 1 |-- + | 3 +*/ +for(let j = 0; j < n - 1; j++) { + const one = calc(0, m - 1, 0, j, grid) + for(let i = 0; i < m - 1; i++) { + const two = calc(0, i, j + 1, n - 1, grid) + const three = calc(i + 1, m - 1, j + 1, n - 1, grid) + res = Math.min(res, one + two + three) + } +} + + return res +}; + +function calc(rs, re, cs, ce, grid) { + + let rmin = Infinity, rmax = -Infinity, cmin = Infinity, cmax = -Infinity + for(let i = rs; i <= re; i++) { + for(let j = cs; j <= ce; j++) { + if(grid[i][j] === 1) { + rmin = Math.min(rmin, i) + rmax = Math.max(rmax, i) + cmin = Math.min(cmin, j) + cmax = Math.max(cmax, j) + } + } + } + return (rmax - rmin + 1) * (cmax - cmin + 1) +} From c4119a5b20dd4c082f1be71a75114f13e72a22e1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 19 Jul 2024 11:10:20 +0800 Subject: [PATCH 1786/2039] Update 3186-maximum-total-damage-with-spell-casting.js --- ...maximum-total-damage-with-spell-casting.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/3186-maximum-total-damage-with-spell-casting.js b/3186-maximum-total-damage-with-spell-casting.js index d6de86f5..7db66a9f 100644 --- a/3186-maximum-total-damage-with-spell-casting.js +++ b/3186-maximum-total-damage-with-spell-casting.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} power + * @return {number} + */ +const maximumTotalDamage = function(power) { + const freq = new Map() + for (const p of power) { + freq.set(p, (freq.get(p) || 0) + 1) + } + const sorted = Array.from(freq.keys()).sort((a, b) => a - b) + const n = sorted.length + const dp = Array(n+1).fill(0) + dp[1] = sorted[0] * freq.get(sorted[0]) + for(let i = 2; i <= n; i++) { + const val = sorted[i-1] + const cur = val * freq.get(val) + let j = i - 2 + + if(j >= 0 && sorted[j] + 1 === val) { + j-- + } + if(j >= 0 && sorted[j] + 2 === val) { + j-- + } + + if(j >= 0) { + dp[i] = Math.max(dp[i-1], dp[j+1] + cur) + } else { + dp[i] = Math.max(dp[i-1], cur) + } + + } + + return dp[n] +}; + +// another + /** * @param {number[]} power * @return {number} From 5054e4e2cd7b3963f0ab87c044c9c4929cf5dfc2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Jul 2024 18:57:41 +0800 Subject: [PATCH 1787/2039] Create 3144-minimum-substring-partition-of-equal-character-frequency.js --- ...-partition-of-equal-character-frequency.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3144-minimum-substring-partition-of-equal-character-frequency.js diff --git a/3144-minimum-substring-partition-of-equal-character-frequency.js b/3144-minimum-substring-partition-of-equal-character-frequency.js new file mode 100644 index 00000000..e543b411 --- /dev/null +++ b/3144-minimum-substring-partition-of-equal-character-frequency.js @@ -0,0 +1,40 @@ +/** + * @param {string} s + * @return {number} + */ +var minimumSubstringsInPartition = function (s) { + const n = s.length; + const dp = new Array(n + 1).fill(); + dp[0] = 0; + const chars = new Array(26).fill(); + + for (let i = 0; i < n; i++) { + dp[i + 1] = 1 + dp[i]; + chars.forEach((_, idx) => (chars[idx] = undefined)); + const idxOne = s.charCodeAt(i) - 97; + chars[idxOne] = 1; + + for (let j = i - 1; j >= 0; j--) { + const idxTwo = s.charCodeAt(j) - 97; + chars[idxTwo] = (chars[idxTwo] || 0) + 1; + if (isOk(chars)) { + dp[i + 1] = Math.min(dp[j] + 1, dp[i + 1]); + } + } + } + + return dp[n]; +}; + +function isOk(chars) { + let freq = undefined; + for (let i = 0; i < chars.length; i++) { + if (chars[i] === undefined) continue; + if (freq === undefined) { + freq = chars[i]; + } else if (chars[i] !== freq) { + return false; + } + } + return true; +} From 2b9097010b809e585d1a270de185d949ad70c0c3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Jul 2024 15:36:14 +0800 Subject: [PATCH 1788/2039] Create 3226-number-of-bit-changes-to-make-two-integers-equal.js --- ...-bit-changes-to-make-two-integers-equal.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3226-number-of-bit-changes-to-make-two-integers-equal.js diff --git a/3226-number-of-bit-changes-to-make-two-integers-equal.js b/3226-number-of-bit-changes-to-make-two-integers-equal.js new file mode 100644 index 00000000..b9150e96 --- /dev/null +++ b/3226-number-of-bit-changes-to-make-two-integers-equal.js @@ -0,0 +1,33 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var minChanges = function(n, k) { + const s = num2bin(n) + const t = num2bin(k) + let res = 0 + const len = s.length + + for(let i = 0; i < len; i++) { + const e = s[i], e1 = t[i] + if(e !== e1) { + if(e === '1') { + res++ + } else { + return -1 + } + } + } + + return res +}; + +function num2bin(n) { + let tmp = (n >>> 0).toString(2) + if(tmp.length < 32) { + return '0'.repeat(32 - tmp.length) + tmp + } + + return tmp +} From 50e1d5c9bbdde5c455fef6602986c53151400f2f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Jul 2024 15:36:47 +0800 Subject: [PATCH 1789/2039] Create 3227-vowels-game-in-a-string.js --- 3227-vowels-game-in-a-string.js | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 3227-vowels-game-in-a-string.js diff --git a/3227-vowels-game-in-a-string.js b/3227-vowels-game-in-a-string.js new file mode 100644 index 00000000..48c81e27 --- /dev/null +++ b/3227-vowels-game-in-a-string.js @@ -0,0 +1,12 @@ +/** + * @param {string} s + * @return {boolean} + */ +var doesAliceWin = function(s) { + let v = 0 + for(let c of s){ + if(c ==='a' || c ==='e' || c ==='i' || c ==='o'|| c ==='u') v++ + } + if(v === 0) return false + else return true +}; From 5394aa91abc4614fdb441fae998a369c44212738 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Jul 2024 15:37:17 +0800 Subject: [PATCH 1790/2039] Create 3228-maximum-number-of-operations-to-move-ones-to-the-end.js --- ...r-of-operations-to-move-ones-to-the-end.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 3228-maximum-number-of-operations-to-move-ones-to-the-end.js diff --git a/3228-maximum-number-of-operations-to-move-ones-to-the-end.js b/3228-maximum-number-of-operations-to-move-ones-to-the-end.js new file mode 100644 index 00000000..f4b76f1d --- /dev/null +++ b/3228-maximum-number-of-operations-to-move-ones-to-the-end.js @@ -0,0 +1,29 @@ +/** + * @param {string} s + * @return {number} + */ +var maxOperations = function(s) { + let ss = '' + for (let ch of s) { + if (ss === '') { + ss += ch + continue + } + if (ch === '0' && ss[ss.length - 1] === '0') { + continue + } else { + ss += ch + } + } + s = ss + let res = 0 + let cnt = 0 + for (let i = 0; i < s.length; i++) { + if (s[i] === '0') { + res += cnt + } else { + cnt += 1 + } + } + return res +}; From b89bff4fe0e7a42a9e5566e10e0fa7ce615806b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 21 Jul 2024 15:37:56 +0800 Subject: [PATCH 1791/2039] Create 3229-minimum-operations-to-make-array-equal-to-target.js --- ...perations-to-make-array-equal-to-target.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 3229-minimum-operations-to-make-array-equal-to-target.js diff --git a/3229-minimum-operations-to-make-array-equal-to-target.js b/3229-minimum-operations-to-make-array-equal-to-target.js new file mode 100644 index 00000000..a1edda5b --- /dev/null +++ b/3229-minimum-operations-to-make-array-equal-to-target.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @param {number[]} target + * @return {number} + */ +var minimumOperations = function(nums, target) { + if (nums.length !== target.length) { + return -1 + } + + const diff = nums.map((num, i) => -num + target[i]) + + let res = 0 + for (let i = 0; i < diff.length; i++) { + if (i === 0 || diff[i] * diff[i - 1] <= 0) { + res += Math.abs(diff[i]) + } else { + res += Math.max(Math.abs(diff[i]) - Math.abs(diff[i - 1]), 0) + } + } + + return res +}; From 0f4d954864330209ddd79e346863cd2b61d309d3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 22 Jul 2024 13:06:45 +0800 Subject: [PATCH 1792/2039] Update 3202-find-the-maximum-length-of-valid-subsequence-ii.js --- ...-maximum-length-of-valid-subsequence-ii.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/3202-find-the-maximum-length-of-valid-subsequence-ii.js b/3202-find-the-maximum-length-of-valid-subsequence-ii.js index 6b361e6c..f0e09cd1 100644 --- a/3202-find-the-maximum-length-of-valid-subsequence-ii.js +++ b/3202-find-the-maximum-length-of-valid-subsequence-ii.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumLength = function(nums, k) { + const n = nums.length; + const dp = Array.from({ length: k + 1 }, () => Array(k + 1).fill(0)); + let res = 0 + for(const e of nums) { + const cur = e % k; + for(let remain = 0; remain < k; remain++) { + const prev = (k + remain - cur) % k; + dp[cur][remain] = Math.max(dp[cur][remain], dp[prev][remain] + 1) + res = Math.max(res, dp[cur][remain]) + } + } + + return res +}; + +// another + + /** * @param {number[]} nums * @return {number} From a5c884e63afc0370fe19748e365aba9136c267bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 23 Jul 2024 11:25:09 +0800 Subject: [PATCH 1793/2039] Update 3196-maximize-total-cost-of-alternating-subarrays.js --- ...ize-total-cost-of-alternating-subarrays.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/3196-maximize-total-cost-of-alternating-subarrays.js b/3196-maximize-total-cost-of-alternating-subarrays.js index d6e45781..e2c72e8f 100644 --- a/3196-maximize-total-cost-of-alternating-subarrays.js +++ b/3196-maximize-total-cost-of-alternating-subarrays.js @@ -1,3 +1,25 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maximumTotalCost = function(nums) { + const n = nums.length; + const dp = Array.from({ length: n + 1 }, () => Array(2).fill(0)); + dp[1][0] = nums[0] + dp[1][1] = nums[0] + for (let i = 2; i <= n; i++) { + const e = nums[i - 1] + dp[i][0] = Math.max(dp[i - 1][1], dp[i - 1][0]) + e + dp[i][1] = dp[i - 1][0] - e + } + + + return Math.max(dp[n][0], dp[n][1]) +}; + +// another + + /** * @param {number[]} nums * @return {number} From e2b9b277e3645ef42aa78b4939c015524b909529 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 24 Jul 2024 11:37:11 +0800 Subject: [PATCH 1794/2039] Create 3176-find-the-maximum-length-of-a-good-subsequence-i.js --- ...-maximum-length-of-a-good-subsequence-i.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 3176-find-the-maximum-length-of-a-good-subsequence-i.js diff --git a/3176-find-the-maximum-length-of-a-good-subsequence-i.js b/3176-find-the-maximum-length-of-a-good-subsequence-i.js new file mode 100644 index 00000000..f8f16f5a --- /dev/null +++ b/3176-find-the-maximum-length-of-a-good-subsequence-i.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumLength = function (nums, k) { + const n = nums.length + const res = Array(k + 1).fill(0) + const dp = Array.from({ length: k + 1 }, () => new Map()) + for (const a of nums) { + for (let i = k; i >= 0; i--) { + const v = dp[i].get(a) || 0 + dp[i].set(a, Math.max(v + 1, i > 0 ? res[i - 1] + 1 : 0)) + res[i] = Math.max(res[i], dp[i].get(a)) + } + } + + return res[k] +} From c161a43a60c5a59b3f8a24421c04569059b556a4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 25 Jul 2024 10:32:53 +0800 Subject: [PATCH 1795/2039] Create 3177-find-the-maximum-length-of-a-good-subsequence-ii.js --- ...maximum-length-of-a-good-subsequence-ii.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 3177-find-the-maximum-length-of-a-good-subsequence-ii.js diff --git a/3177-find-the-maximum-length-of-a-good-subsequence-ii.js b/3177-find-the-maximum-length-of-a-good-subsequence-ii.js new file mode 100644 index 00000000..d5739f7b --- /dev/null +++ b/3177-find-the-maximum-length-of-a-good-subsequence-ii.js @@ -0,0 +1,19 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maximumLength = function(nums, k) { + const n = nums.length; + const res = Array(k + 1).fill(0); + const dp = Array.from({ length: k + 1 }, () => new Map()); + for (const a of nums) { + for (let i = k; i >= 0; i--) { + const v = dp[i].get(a) || 0; + const vv = Math.max(v + 1, i > 0 ? res[i - 1] + 1 : 0) + dp[i].set(a, vv); + res[i] = Math.max(res[i], vv); + } + } + return res[k] +}; From c1466600c3d127416530111f1cfd4a5c41dcd73f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 26 Jul 2024 13:02:10 +0800 Subject: [PATCH 1796/2039] Update 629-k-inverse-pairs-array.js --- 629-k-inverse-pairs-array.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/629-k-inverse-pairs-array.js b/629-k-inverse-pairs-array.js index 4ea54181..e653e9b5 100644 --- a/629-k-inverse-pairs-array.js +++ b/629-k-inverse-pairs-array.js @@ -1,3 +1,27 @@ +/** + * @param {number} n + * @param {number} k + * @return {number} + */ +const kInversePairs = function(n, k) { + const mod = 1e9 + 7 + const dp = Array.from({ length: n + 1 }, () => Array(k + 1).fill(0)) + for(let i = 0; i <= n; i++) dp[i][0] = 1 + for(let i = 2; i <= n; i++) { + for(let j = 1; j <= k; j++) { + if(j >= i) dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - i]) % mod + else dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod + + if(dp[i][j] < 0) dp[i][j] += mod + } + } + + return dp[n][k] +}; + +// another + + /** * @param {number} n * @param {number} k From a918f2d842c8dc2ccf658d563b2076580d8b4b02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 27 Jul 2024 19:57:35 +0800 Subject: [PATCH 1797/2039] Create 3193-count-the-number-of-inversions.js --- 3193-count-the-number-of-inversions.js | 78 ++++++++++++++++++++++++++ 1 file changed, 78 insertions(+) create mode 100644 3193-count-the-number-of-inversions.js diff --git a/3193-count-the-number-of-inversions.js b/3193-count-the-number-of-inversions.js new file mode 100644 index 00000000..04abfd9c --- /dev/null +++ b/3193-count-the-number-of-inversions.js @@ -0,0 +1,78 @@ +/** + * @param {number} n + * @param {number[][]} requirements + * @return {number} + */ +var numberOfPermutations = function(n, requirements) { + // setup map/vector for tracking inversions + let inv = new Array(n + 1).fill(-1); + for (let req of requirements) { + if (inv[req[0] + 1] === -1) { + inv[req[0] + 1] = req[1]; + } else { + return 0; + } + } + + // sanity check + // if length of the sequence is l + // then there can be at most l*(l-1)/2 inversion pairs + // in the case of decreasing order + for (let i = 1; i <= n; i++) { + if (inv[i] > (i * (i - 1)) / 2) { + return 0; + } + } + + // dp[len][inv] + // solution for the prefix of length len, and inv inversion pairs + + // setup dp + const m = 400; + const MOD = 1e9 + 7; + let dp = Array.from({ length: n + 1 }, () => new Array(m + 1).fill(0)); + + // base case + // i == 0, dp[0][j] = 0, j > 1, in memset + // i == 0 && j == 0, dp[0][0] = 1 + dp[0][0] = 1; + + /* + Note: + suppose we have a sequence of length (l-1), and we want to extend it to + a sequence of length l, then what can happen to the number of inversion? + + you can increase the number of inversions by at most (l-1). + + so we need to check dp[i-1][j] for dp[i][c] + where j = c-0, c-1, ..... , c-(l-1) + */ + + // recursion + for (let i = 1; i <= n; i++) { // length + // case 1, we have a requirement given + // then just iterate for that value, + if (inv[i] !== -1) { + for (let k = 0; k < i; k++) { + if (inv[i] - k < 0) break; + dp[i][inv[i]] = (dp[i][inv[i]] + dp[i - 1][inv[i] - k]) % MOD; + } + } + // case 2 when we don't have any given requirement + // then iterate over all the values + else { + for (let c = 0; c <= m; c++) { + // maximum number of inversions + if (c > (i * (i - 1)) / 2) break; + + for (let k = 0; k < i; k++) { + if (c - k < 0) break; + dp[i][c] = (dp[i][c] + dp[i - 1][c - k]) % MOD; + } + } + } + } + + // return the ans + return dp[n][inv[n]]; +}; From e8041d2bdcacdb081f1ef8af9340e027132de4dc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Jul 2024 15:17:47 +0800 Subject: [PATCH 1798/2039] Create 3232-find-if-digit-game-can-be-won.js --- 3232-find-if-digit-game-can-be-won.js | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 3232-find-if-digit-game-can-be-won.js diff --git a/3232-find-if-digit-game-can-be-won.js b/3232-find-if-digit-game-can-be-won.js new file mode 100644 index 00000000..01b19f48 --- /dev/null +++ b/3232-find-if-digit-game-can-be-won.js @@ -0,0 +1,13 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +var canAliceWin = function(nums) { + const sum = nums.reduce((ac, e) => ac + e, 0) + let as = 0 + for(const e of nums) { + if(e < 10) as += e + } + + return as !== sum - as +}; From d6de59ff65173eebdbf88492098b20c14a2266d0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Jul 2024 15:18:33 +0800 Subject: [PATCH 1799/2039] Create 3233-find-the-count-of-numbers-which-are-not-special.js --- ...-count-of-numbers-which-are-not-special.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 3233-find-the-count-of-numbers-which-are-not-special.js diff --git a/3233-find-the-count-of-numbers-which-are-not-special.js b/3233-find-the-count-of-numbers-which-are-not-special.js new file mode 100644 index 00000000..96cb6e7f --- /dev/null +++ b/3233-find-the-count-of-numbers-which-are-not-special.js @@ -0,0 +1,38 @@ +/** + * @param {number} l + * @param {number} r + * @return {number} + */ +const nonSpecialCount = function (l, r) { + let res = 0 + for ( + let i = Math.floor(Math.sqrt(l)) - 10; + i <= Math.floor(Math.sqrt(r)) + 10; + i++ + ) { + if (isPrime(i) && l <= i * i && i * i <= r) { + res += 1 + } + } + return r - l + 1 - res +} + +function isPrime(n) { + if (n <= 1) { + return false + } + if (n <= 3) { + return true + } + if (n % 2 === 0 || n % 3 === 0) { + return false + } + let i = 5 + while (i * i <= n) { + if (n % i === 0 || n % (i + 2) === 0) { + return false + } + i += 6 + } + return true +} From e663b849ab87864b3680e5309844a5d1893c002a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Jul 2024 15:19:03 +0800 Subject: [PATCH 1800/2039] Create 3234-count-the-number-of-substrings-with-dominant-ones.js --- ...number-of-substrings-with-dominant-ones.js | 55 +++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 3234-count-the-number-of-substrings-with-dominant-ones.js diff --git a/3234-count-the-number-of-substrings-with-dominant-ones.js b/3234-count-the-number-of-substrings-with-dominant-ones.js new file mode 100644 index 00000000..a285974c --- /dev/null +++ b/3234-count-the-number-of-substrings-with-dominant-ones.js @@ -0,0 +1,55 @@ +/** + * @param {string} s + * @return {number} + */ +var numberOfSubstrings = function(s) { + const n = s.length; + let result = 0; + + // Iterate through possible zero counts (1 to sqrt(n)) + for (let k = 1; k <= Math.floor(Math.sqrt(n)); k++) { + const zeros = []; // Array to store positions of zeros + let lastzero = -1; // Position of the zero before the first zero in our window + let ones = 0; // Count of ones in our current window + + // Scan through the string + for (let right = 0; right < n; right++) { + if (s[right] === '0') { + zeros.push(right); + // If we have more than k zeros, remove the leftmost one + while (zeros.length > k) { + ones -= (zeros[0] - lastzero - 1); // Subtract ones between lastzero and the removed zero + lastzero = zeros.shift(); + } + } else { + ones++; + } + + // If we have exactly k zeros and at least k^2 ones + if (zeros.length === k && ones >= k ** 2) { + // Add the minimum of: + // 1. Number of ways to extend to the left (zeros[0] - lastzero) + // 2. Number of ways to extend to the right (ones - k^2 + 1) + result += Math.min(zeros[0] - lastzero, ones - k ** 2 + 1); + } + } + } + + // Handle all-ones substrings + let i = 0; + while (i < n) { + if (s[i] === '0') { + i++; + continue; + } + let sz = 0; + while (i < n && s[i] === '1') { + sz++; + i++; + } + // Add number of all-ones substrings + result += (sz * (sz + 1)) / 2; + } + + return result; +}; From 510f462e69e714380509a5d8d3d8ae0351ec3849 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 28 Jul 2024 15:19:31 +0800 Subject: [PATCH 1801/2039] Create 3235-check-if-the-rectangle-corner-is-reachable.js --- ...ck-if-the-rectangle-corner-is-reachable.js | 68 +++++++++++++++++++ 1 file changed, 68 insertions(+) create mode 100644 3235-check-if-the-rectangle-corner-is-reachable.js diff --git a/3235-check-if-the-rectangle-corner-is-reachable.js b/3235-check-if-the-rectangle-corner-is-reachable.js new file mode 100644 index 00000000..04a3269c --- /dev/null +++ b/3235-check-if-the-rectangle-corner-is-reachable.js @@ -0,0 +1,68 @@ +/** + * @param {number} X + * @param {number} Y + * @param {number[][]} circles + * @return {boolean} + */ +var canReachCorner = function(X, Y, circles) { + let width = X, height = Y + const numCircles = circles.length + const circleInfo = circles.map((circle) => [circle[0], circle[1], circle[2]]) + const adjacencyList = Array.from({ length: numCircles + 4 }, () => []) + + for (let i = 0; i < numCircles; i++) { + const [x, y, radius] = circleInfo[i] + + if (x - radius <= 0) { + adjacencyList[i].push(numCircles) + adjacencyList[numCircles].push(i) + } + if (width - x <= radius) { + adjacencyList[i].push(numCircles + 2) + adjacencyList[numCircles + 2].push(i) + } + if (y - radius <= 0) { + adjacencyList[i].push(numCircles + 1) + adjacencyList[numCircles + 1].push(i) + } + if (height - y <= radius) { + adjacencyList[i].push(numCircles + 3) + adjacencyList[numCircles + 3].push(i) + } + + for (let j = i + 1; j < numCircles; j++) { + const [x2, y2, radius2] = circleInfo[j] + const dx = x - x2 + const dy = y - y2 + const distanceSquared = dx * dx + dy * dy + const radiusSum = radius + radius2 + + if (distanceSquared <= radiusSum * radiusSum) { + adjacencyList[i].push(j) + adjacencyList[j].push(i) + } + } + } + + function bfs(startNode, targetNode1, targetNode2) { + const queue = [startNode] + const visited = Array(numCircles + 4).fill(0) + visited[startNode] = 1 + + while (queue.length > 0) { + const currentNode = queue.shift() + for (const neighbor of adjacencyList[currentNode]) { + if (!visited[neighbor]) { + visited[neighbor] = 1 + queue.push(neighbor) + } + } + } + return visited[targetNode1] || visited[targetNode2] + } + + return !( + bfs(numCircles, numCircles + 1, numCircles + 2) || + bfs(numCircles + 3, numCircles + 2, numCircles + 1) + ) +}; From 92d166ccb967141b0034d4a9508930a86df9176e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 2 Aug 2024 18:53:12 +0800 Subject: [PATCH 1802/2039] Create 3209-number-of-subarrays-with-and-value-of-k.js --- ...number-of-subarrays-with-and-value-of-k.js | 46 +++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 3209-number-of-subarrays-with-and-value-of-k.js diff --git a/3209-number-of-subarrays-with-and-value-of-k.js b/3209-number-of-subarrays-with-and-value-of-k.js new file mode 100644 index 00000000..9a46894b --- /dev/null +++ b/3209-number-of-subarrays-with-and-value-of-k.js @@ -0,0 +1,46 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countSubarrays = function (nums, k) { + return atLeastK(nums, k) - atLeastK(nums, k + 1) +} + +function atLeastK(nums, k) { + let ans = 0 + let temp = new Array(32).fill(0) + + let l = 0 + for (let r = 0; r < nums.length; r++) { + for (let i = 0; i < 32; i++) { + if ((1 << i) & nums[r]) { + temp[i]++ + } + } + + while (r - l + 1 > 0 && calc(temp, r - l + 1) < k) { + for (let i = 0; i < 32; i++) { + if ((1 << i) & nums[l]) { + temp[i]-- + } + } + l++ + } + ans += r - l + 1 + } + + return ans +} + +// function to calculate the AND from frequency vector +function calc(temp, w) { + let ans = 0 + for (let i = 0; i < 32; i++) { + if (temp[i] === w) { + ans += 1 << i + } + } + + return ans +} From a60ab31926e4928ea155fefb203e5ef312c41edb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 3 Aug 2024 18:16:52 +0800 Subject: [PATCH 1803/2039] Create 2867-count-valid-paths-in-a-tree.js --- 2867-count-valid-paths-in-a-tree.js | 97 +++++++++++++++++++++++++++++ 1 file changed, 97 insertions(+) create mode 100644 2867-count-valid-paths-in-a-tree.js diff --git a/2867-count-valid-paths-in-a-tree.js b/2867-count-valid-paths-in-a-tree.js new file mode 100644 index 00000000..519dd339 --- /dev/null +++ b/2867-count-valid-paths-in-a-tree.js @@ -0,0 +1,97 @@ +let eratosthenesSieve; + +/** + * @param {number} n + */ +function initEratosthenesSieve(n) { + eratosthenesSieve = Array(n + 1).fill(1); + eratosthenesSieve[0] = 0; + eratosthenesSieve[1] = 0; + + for (let i = 2; i <= n; i++) { + if (eratosthenesSieve[i]) { + for (let j = 2 * i; j <= n; j += i) { + eratosthenesSieve[j] = 0; + } + } + } +} +initEratosthenesSieve(100000); + +/** + * @typedef {{ parent: number, children: number[], p0: number, p1: number, res }} TNode + */ + +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var countPaths = function(n, edges) { + /** @type {TNode[]} */ + let nodes = [undefined]; + + for (let i = 1; i <= n; i++) nodes.push({ + parent: 0, + children: [], + p0: 0, + p1: 0, + }); + + for (let [u,v] of edges) { + nodes[u].children.push(v); + nodes[v].children.push(u); + } + + function buildRoot(x, parent) { + const node = nodes[x]; + node.parent = parent; + + for (let c of node.children) { + if (c !== parent) buildRoot(c, x) + } + } + + buildRoot(1); + let res = 0; + + function dp(x) { + const isPrime = eratosthenesSieve[x]; + const node = nodes[x]; + let exc = 0; + let cp0 = 0; + let cp1 = 0; + + for (let c of node.children) { + if (c !== node.parent) { + dp(c); + let nodeC = nodes[c]; + cp0 += nodeC.p0; + cp1 += nodeC.p1; + + if (isPrime) { + exc += nodeC.p0 * (nodeC.p0 - 1) / 2 - nodeC.p0; + } + else { + exc += nodeC.p0 * nodeC.p1; + } + } + } + + if (isPrime) { + node.p0 = 0; + node.p1 = cp0 + 1; + res += cp0 * (cp0 - 1) / 2 - exc; + } + else { + node.p0 = cp0 + 1; + node.p1 = cp1; + res += (cp0 + 1) * cp1 - exc + } + } + + dp(1); + + return res; +}; + From 911f8df4858b7b730b7039b6914e2daca3867172 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Aug 2024 17:56:35 +0800 Subject: [PATCH 1804/2039] Create 2973-find-number-of-coins-to-place-in-tree-nodes.js --- ...-number-of-coins-to-place-in-tree-nodes.js | 133 ++++++++++++++++++ 1 file changed, 133 insertions(+) create mode 100644 2973-find-number-of-coins-to-place-in-tree-nodes.js diff --git a/2973-find-number-of-coins-to-place-in-tree-nodes.js b/2973-find-number-of-coins-to-place-in-tree-nodes.js new file mode 100644 index 00000000..a9a5f44e --- /dev/null +++ b/2973-find-number-of-coins-to-place-in-tree-nodes.js @@ -0,0 +1,133 @@ +/** + * @param {number[][]} edges + * @param {number[]} cost + * @return {number[]} + */ +var placedCoins = function (edges, cost) { + let tree = buildRootedTree(buildGraph(cost.length, edges), 0) + let res = Array(cost.length).fill() + + function solve(root) { + let node = tree[root] + let c = cost[root] + + if (c > 0) node.max1 = c + else node.min1 = c + + for (let child of node.aNodes) { + solve(child) + let childNode = tree[child] + opt(node, childNode.max1) + opt(node, childNode.max2) + opt(node, childNode.max3) + opt(node, childNode.min1) + opt(node, childNode.min2) + opt(node, childNode.min3) + } + + let cnt = + !!node.min1 + + !!node.min2 + + !!node.min3 + + !!node.max1 + + !!node.max2 + + !!node.max3 + if (cnt < 3) { + res[root] = 1 + return + } + + res[root] = 0 + let v = node.max1 * node.max2 * node.max3 + if (v > res[root]) res[root] = v + v = node.max1 * node.min1 * node.min2 + if (v > res[root]) res[root] = v + } + + solve(0) + return res +} + +/** + * @typedef {{ aNodes: number[] }} TGraphNode + * @param {number} n + * @param {[number,number,number?][]} edges + * @return {TGraphNode[]} + */ +function buildGraph(n, edges) { + /** @type {TGraphNode[]} */ + let nodes = [] + for (let i = 0; i < n; i++) nodes.push({ aNodes: [] }) + + let m = edges.length + for (let i = 0; i < m; i++) { + let [u, v] = edges[i] + nodes[u].aNodes.push(v) + nodes[v].aNodes.push(u) + } + + return nodes +} + +/** + * @typedef {{ parent: number, min1, min2, min3, max1, max2, max3 }} TTreeNode + * @param {(TGraphNode & TTreeNode)[]} graph + * @param {number} root + * @param {number?} parent + * @return {(TGraphNode & TTreeNode)[]} + */ +function buildRootedTree(graph, root, parent) { + let node = graph[root] + node.parent = parent + + let m = node.aNodes.length + let parentIndex = undefined + for (let i = 0; i < m; i++) { + if (node.aNodes[i] == parent) parentIndex = i + else buildRootedTree(graph, node.aNodes[i], root) + } + + if (parentIndex != undefined) { + node.aNodes[parentIndex] = node.aNodes[m - 1] + node.aNodes.pop() + } + + node.max1 = 0 + node.max2 = 0 + node.max3 = 0 + node.min1 = 0 + node.min2 = 0 + node.min3 = 0 + return graph +} + +/** + * @param {TTreeNode} node + * @param {number} cost + */ +function opt(node, cost) { + if (!cost) return + if (cost > 0) { + if (cost >= node.max1) { + node.max3 = node.max2 + node.max2 = node.max1 + node.max1 = cost + } else if (cost >= node.max2) { + node.max3 = node.max2 + node.max2 = cost + } else if (cost > node.max3) { + node.max3 = cost + } + } else { + if (cost <= node.min1) { + node.min3 = node.min2 + node.min2 = node.min1 + node.min1 = cost + } else if (cost <= node.min2) { + node.min3 = node.min2 + node.min2 = cost + } else if (cost < node.min3) { + node.min3 = cost + } + } +} From f9e97503e87b11821ae9184f58eaec99fc13398c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 4 Aug 2024 18:05:26 +0800 Subject: [PATCH 1805/2039] Create 3244-shortest-distance-after-road-addition-queries-ii.js --- ...distance-after-road-addition-queries-ii.js | 351 ++++++++++++++++++ 1 file changed, 351 insertions(+) create mode 100644 3244-shortest-distance-after-road-addition-queries-ii.js diff --git a/3244-shortest-distance-after-road-addition-queries-ii.js b/3244-shortest-distance-after-road-addition-queries-ii.js new file mode 100644 index 00000000..5a992a9c --- /dev/null +++ b/3244-shortest-distance-after-road-addition-queries-ii.js @@ -0,0 +1,351 @@ +/** + * @param {number} n + * @param {number[][]} queries + * @return {number[]} + */ +var shortestDistanceAfterQueries = function(n, queries) { + let tree = new SplayTree(), res = []; + for (let i = 0; i < n; i++) tree.insert(i); + for (const [l, r] of queries) { + while (1) { + let pre = tree.higher(l); + if (pre >= r) break; + tree.remove(pre); + } + res.push(tree.size() - 1); + } + return res; +}; + +///////////////////////// Template ////////////////////////////// +class SplayNode { + constructor(value) { + this.parent = null; + this.left = null; + this.right = null; + this.val = value; + this.sum = value; + this.sz = 1; + } + update() { + this.sz = (this.left != null ? this.left.sz : 0) + (this.right != null ? this.right.sz : 0) + 1; + this.sum = (this.left != null ? this.left.sum : 0) + (this.right != null ? this.right.sum : 0) + this.val; + } + isLeft() { + return this.parent != null && this.parent.left == this; + } + isRight() { + return this.parent != null && this.parent.right == this; + } + isRoot(guard = null) { + return this.parent == guard; + } +} + +// MultiSet +class SplayTree { + constructor() { + this.root = null; + this.cmp = (x, y) => x >= y ? 0 : 1; + } + zig(x) { // right rotation + let y = x.parent; + if (x.right != null) x.right.parent = y; + y.left = x.right; + x.right = y; + if (y.isLeft()) { + y.parent.left = x; + } else if (y.isRight()) { + y.parent.right = x; + } + x.parent = y.parent; + y.parent = x; + y.update(); + x.update(); + } + zag(x) { // left rotation + let y = x.parent; + if (x.left != null) x.left.parent = y; + y.right = x.left; + x.left = y; + if (y.isLeft()) { + y.parent.left = x; + } else if (y.isRight()) { + y.parent.right = x; + } + x.parent = y.parent; + y.parent = x; + y.update(); + x.update(); + } + zigzig(x) { // RR + this.zig(x.parent); + this.zig(x); + } + zigzag(x) { // RL + this.zig(x); + this.zag(x); + } + zagzag(x) { // LL + this.zag(x.parent); + this.zag(x); + } + zagzig(x) { // LR + this.zag(x); + this.zig(x); + } + splay(node, guard = null) { // splay node under guard, default splay to root + while (!node.isRoot(guard)) { + if (node.parent.isRoot(guard)) { + if (node.isLeft()) { + this.zig(node); + } else { + this.zag(node); + } + } else { + if (node.parent.isLeft()) { + if (node.isLeft()) { + this.zigzig(node); + } else { + this.zagzig(node); + } + } else { + if (node.isRight()) { + this.zagzag(node); + } else { + this.zigzag(node); + } + } + } + } + if (guard == null) this.root = node; + } + LastNode(x) { + this.splay(x); + let node = x.left; + if (node == null) return null; + while (node.right != null) node = node.right; + this.splay(node); + return node; + } + NextNode(x) { + this.splay(x); + let node = x.right; + if (node == null) return null; + while (node.left != null) node = node.left; + this.splay(node); + return node; + } + find(value) { + return this.findFirstOf(value); + } + findFirstOf(value) { + let node = this.root, res = null, last_visited = null; + while (node != null) { + last_visited = node; + if (this.cmp(value, node.val)) { + node = node.left; + } else if (this.cmp(node.val, value)) { + node = node.right; + } else { + res = node; + node = node.left; + } + } + if (last_visited != null) this.splay(last_visited); + return res; + } + findLastOf(value) { + let node = this.root, res = null, last_visited = null; + while (node != null) { + last_visited = node; + if (this.cmp(value, node.val)) { + node = node.left; + } else if (this.cmp(node.val, value)) { + node = node.right; + } else { + res = node; + node = node.right; + } + } + if (last_visited != null) this.splay(last_visited); + return res; + } + findRankOf(node) { + this.splay(node); + return node.left == null ? 0 : node.left.sz; + } + findSuccessorOf(value) { + let node = this.root, res = null, last_visited = null; + while (node != null) { + last_visited = node; + if (this.cmp(value, node.val)) { + res = node; + node = node.left; + } else { + node = node.right; + } + } + if (last_visited != null) this.splay(last_visited); + return res; + } + findPrecursorOf(value) { + let node = this.root, res = null, last_visited = null; + while (node != null) { + last_visited = node; + if (this.cmp(node.val, value)) { + res = node; + node = node.right; + } else { + node = node.left; + } + } + if (last_visited != null) this.splay(last_visited); + return res; + } + findKthNode(rank) { + if (rank < 0 || rank >= this.size()) return null; + let node = this.root; + while (node != null) { + let leftsize = node.left == null ? 0 : node.left.sz; + if (leftsize == rank) break; + if (leftsize > rank) { + node = node.left; + } else { + rank -= leftsize + 1; + node = node.right; + } + } + this.splay(node); + return node; + } + make(value) { + return new SplayNode(value); + } + removeNode(node) { + node = null; + } + + // -------------------------------- Public Usage -------------------------------------- + insert(value) { // allow duplicates LST.set() + if (this.root == null) { + this.root = this.make(value); + return this.root; + } + let node = this.root; + while (node != null) { + if (this.cmp(value, node.val)) { + if (node.left == null) { + node.left = this.make(value); + node.left.parent = node; + node = node.left; + break; + } + node = node.left; + } else { + if (node.right == null) { + node.right = this.make(value); + node.right.parent = node; + node = node.right; + break; + } + node = node.right; + } + } + this.splay(node); + return node; + } + remove(value) { // remove one node, not all LST.unset() + let node = this.find(value); + if (node == null) return false; + this.splay(node); + if (node.left == null) { + this.root = node.right; + if (node.right != null) node.right.parent = null; + this.removeNode(node); + return true; + } + if (node.right == null) { + this.root = node.left; + if (node.left != null) node.left.parent = null; + this.removeNode(node); + return true; + } + let last_node = this.LastNode(node); + let next_node = this.NextNode(node); + this.splay(last_node); + this.splay(next_node, last_node); + this.removeNode(next_node.left); + next_node.left = null; + next_node.update(); + last_node.update(); + return true; + } + has(value) { // LST.get() + return this.count(value) > 0; + } + count(value) { + let x = this.findFirstOf(value); + if (x == null) return 0; + let rank_x = this.findRankOf(x); + let y = this.findLastOf(value); + let rank_y = this.findRankOf(y); + return rank_y - rank_x + 1; + } + rankOf(value) { // The number of elements strictly less than value + let x = this.findPrecursorOf(value); + return x == null ? 0 : this.findRankOf(x) + 1; + } + findKth(rank) { // (0-indexed) + let x = this.findKthNode(rank); + return x == null ? null : (x.val); + } + higher(value) { // > upper_bound() + let node = this.findSuccessorOf(value); + return node == null ? null : (node.val); + } + lower(value) { // < + let node = this.findPrecursorOf(value); + return node == null ? null : (node.val); + } + ceiling(value) { // >= lower_bound() LST.next(value) + return this.has(value) ? value : this.higher(value); + } + floor(value) { // <= LST.prev(value) + return this.has(value) ? value : this.lower(value); + } + first() { + return this.findKth(0); + } + last() { + return this.findKth(this.size() - 1); + } + poll() { + let res = this.first(); + this.remove(res); + return res; + } + pollLast() { + let res = this.last(); + this.remove(res); + return res; + } + size() { + return this.root == null ? 0 : this.root.sz; + } + isEmpty() { + return this.root == null; + } + show() { + let res = []; + const dfs = (x) => { + if (x == null) return; + dfs(x.left); + res.push(x.val); + dfs(x.right); + }; + dfs(this.root); + return res; + } +} + From 04a300d694bfcf79814162810f46f13d0787208f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Aug 2024 12:14:09 +0800 Subject: [PATCH 1806/2039] Update 3203-find-minimum-diameter-after-merging-two-trees.js --- ...inimum-diameter-after-merging-two-trees.js | 52 +++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/3203-find-minimum-diameter-after-merging-two-trees.js b/3203-find-minimum-diameter-after-merging-two-trees.js index 78df2dd8..99d3cb1a 100644 --- a/3203-find-minimum-diameter-after-merging-two-trees.js +++ b/3203-find-minimum-diameter-after-merging-two-trees.js @@ -45,3 +45,55 @@ var minimumDiameterAfterMerge = function (edges1, edges2) { const radius2 = Math.floor((diameter2 + 1) / 2) return Math.max(radius1 + radius2 + 1, diameter1, diameter2) } + +// another + +/** + * @param {number[][]} edges1 + * @param {number[][]} edges2 + * @return {number} + */ +var minimumDiameterAfterMerge = function(edges1, edges2) { + const [d1, i, j] = diameter(edges1); + const [d2, ii, jj] = diameter(edges2); + return Math.max(d1, d2, Math.floor((d1 + 1) / 2) + Math.floor((d2 + 1) / 2) + 1); + function farthest(G, i) { + const n = G.length; + const bfs = [i]; + const seen = new Array(n).fill(0); + seen[i] = 1; + let res = -1; + let maxd = -1; + for (let k = 0; k < bfs.length; k++) { + const node = bfs[k]; + for (let j = 0; j < G[node].length; j++) { + const neighbor = G[node][j]; + if (seen[neighbor] === 0) { + seen[neighbor] = seen[node] + 1; + bfs.push(neighbor); + if (seen[neighbor] > maxd) { + res = neighbor; + maxd = seen[neighbor]; + } + } + } + } + return [res, maxd - 1]; + } + + function diameter(edges) { + if (edges.length === 0) { + return [0, 0, 0]; + } + const n = edges.length + 1; + const G = Array.from({ length: n }, () => []); + for (let k = 0; k < edges.length; k++) { + const [i, j] = edges[k]; + G[i].push(j); + G[j].push(i); + } + let [v1, d] = farthest(G, 0); + [v1, d] = farthest(G, v1); + return [d, v1, v1]; + } +}; From 0f9582e1e30f37a94e30541ada62496c4b35988e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 6 Aug 2024 13:03:54 +0800 Subject: [PATCH 1807/2039] Update 3203-find-minimum-diameter-after-merging-two-trees.js --- 3203-find-minimum-diameter-after-merging-two-trees.js | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/3203-find-minimum-diameter-after-merging-two-trees.js b/3203-find-minimum-diameter-after-merging-two-trees.js index 99d3cb1a..c6d788b9 100644 --- a/3203-find-minimum-diameter-after-merging-two-trees.js +++ b/3203-find-minimum-diameter-after-merging-two-trees.js @@ -57,13 +57,14 @@ var minimumDiameterAfterMerge = function(edges1, edges2) { const [d1, i, j] = diameter(edges1); const [d2, ii, jj] = diameter(edges2); return Math.max(d1, d2, Math.floor((d1 + 1) / 2) + Math.floor((d2 + 1) / 2) + 1); + function farthest(G, i) { const n = G.length; const bfs = [i]; const seen = new Array(n).fill(0); seen[i] = 1; - let res = -1; - let maxd = -1; + let res = 0; + let maxd = 0; for (let k = 0; k < bfs.length; k++) { const node = bfs[k]; for (let j = 0; j < G[node].length; j++) { @@ -93,7 +94,8 @@ var minimumDiameterAfterMerge = function(edges1, edges2) { G[j].push(i); } let [v1, d] = farthest(G, 0); - [v1, d] = farthest(G, v1); - return [d, v1, v1]; + let [v2, d2] = farthest(G, v1); + return [d2, v1, v2]; } }; + From f4d3a0f89e1204d3724dce074b3a5b21fc120789 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 8 Aug 2024 15:25:55 +0800 Subject: [PATCH 1808/2039] Update 662-maximum-width-of-binary-tree.js --- 662-maximum-width-of-binary-tree.js | 34 +++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) diff --git a/662-maximum-width-of-binary-tree.js b/662-maximum-width-of-binary-tree.js index 7f457617..9c8f8874 100644 --- a/662-maximum-width-of-binary-tree.js +++ b/662-maximum-width-of-binary-tree.js @@ -1,3 +1,37 @@ +/** + * 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} + */ +const widthOfBinaryTree = function (root) { + let max = 1n + const stack = [] + const bi = BigInt + const width = (root, level, pos) => { + if (root == null) return + if (level >= stack.length) stack.push(pos) + else { + // console.log(stack) + const tmp = pos - stack[level] + 1n + if(tmp > max) max = tmp + } + width(root.left, level + 1, 2n * pos) + width(root.right, level + 1, 2n * pos + 1n) + } + width(root, 0, 1n) + return Number(max) +} + + +// another + /** * Definition for a binary tree node. * function TreeNode(val) { From 36d3b43d56e13cb3922cf22fcfb5c541342b45f6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 Aug 2024 20:59:04 +0800 Subject: [PATCH 1809/2039] Update 3213-construct-string-with-minimum-cost.js --- 3213-construct-string-with-minimum-cost.js | 124 +++++++++++++++------ 1 file changed, 87 insertions(+), 37 deletions(-) diff --git a/3213-construct-string-with-minimum-cost.js b/3213-construct-string-with-minimum-cost.js index 0b505d8a..cb8cf652 100644 --- a/3213-construct-string-with-minimum-cost.js +++ b/3213-construct-string-with-minimum-cost.js @@ -88,67 +88,117 @@ class AhoCorasick { } } +// another +class TrieNode { + constructor() { + this.sfx = null // Suffix link + this.dict = null // Dictionary link + this.child = new Array(26).fill(null) + this.word_id = -1 // Index of the word ending at this node + } +} +// Speeds up Trie construction +const preallocated_nodes = Array.from({ length: 50005 }, () => new TrieNode()) - -// TLE below - -const mx = 1000000000 /** * @param {string} target * @param {string[]} words * @param {number[]} costs * @return {number} */ -var minimumCost = function (target, words, costs) { +function minimumCost(target, words, costs) { + const trie = new Trie(words, costs) const n = target.length - const dp = new Array(n + 1).fill(mx) - const t = new Trie(30) + const dp = new Array(n + 1).fill(Infinity) + dp[0] = 0 - for (let i = 0; i < words.length; i++) { - t.insert(words[i], costs[i]) + for (let i = 1; i <= n; ++i) { + const suffixes = trie.suffixesAfterAppending(target[i - 1]) + for (const j of suffixes) { + dp[i] = Math.min(dp[i], dp[i - words[j].length] + costs[j]) + } } - dp[n] = 0 + return dp[n] === Infinity ? -1 : dp[n] +} - for (let i = n - 1; i >= 0; i--) { - let cur = t - for (let j = i; j <= n && cur !== null; j++) { - if (cur.cost !== mx) { - dp[i] = Math.min(dp[j] + cur.cost, dp[i]) +class Trie { + constructor(words, costs) { + this.count = 0 + this.root = this.newTrieNode() + this.root.sfx = this.root.dict = this.root + + for (let i = 0; i < words.length; ++i) { + const word = words[i] + let u = this.root + for (const c of word) { + const index = c.charCodeAt(0) - 'a'.charCodeAt(0) + if (!u.child[index]) { + u.child[index] = this.newTrieNode() + } + u = u.child[index] } - if (j < n) { - cur = cur.sons[target.charCodeAt(j) - 'a'.charCodeAt(0)] + if (u.word_id < 0 || costs[i] < costs[u.word_id]) { + u.word_id = i } } - } - return dp[0] === mx ? -1 : dp[0] -} + // BFS is used to set up the suffix and dictionary links for each node + // The suffix link of a node points to the longest proper suffix of the word represented by the node that is also a prefix of some word in the dictionary. + // The dictionary link is used to quickly find the next node in the dictionary chain. + const queue = [this.root] + while (queue.length > 0) { + const u = queue.shift() + for (let i = 0; i < 26; ++i) { + const v = u.child[i] + if (!v) continue + + let p = u.sfx + while (p !== this.root && !p.child[i]) { + p = p.sfx + } -class Trie { - constructor(range) { - this.range = range - this.cost = mx - this.sons = new Array(range).fill(null) - } + if (u !== this.root && p.child[i]) { + v.sfx = p.child[i] + } else { + v.sfx = this.root + } - insert(str, cost) { - let cur = this - for (let c of str) { - if (cur.sons[c.charCodeAt(0) - 'a'.charCodeAt(0)] === null) { - cur.sons[c.charCodeAt(0) - 'a'.charCodeAt(0)] = new Trie(this.range) + v.dict = v.sfx.word_id >= 0 ? v.sfx : v.sfx.dict + queue.push(v) } - cur = cur.sons[c.charCodeAt(0) - 'a'.charCodeAt(0)] } - cur.cost = Math.min(cur.cost, cost) + this.curr = this.root } - destroy() { - for (let t of this.sons) { - if (t !== null) { - t.destroy() + newTrieNode() { + preallocated_nodes[this.count] = new TrieNode() + return preallocated_nodes[this.count++] + } + + // This method is used to update the current node and find all matching suffixes after appending a character + suffixesAfterAppending(letter) { + const index = letter.charCodeAt(0) - 'a'.charCodeAt(0) + + // It follows suffix links until it finds a child node corresponding to the character or reaches the root. + while (this.curr !== this.root && !this.curr.child[index]) { + this.curr = this.curr.sfx + } + + // If a valid child node is found, it updates the current node and collects all word IDs reachable through the dictionary links. + const result = [] + if (this.curr.child[index]) { + this.curr = this.curr.child[index] + let u = this.curr + if (u.word_id < 0) { + u = u.dict + } + while (u.word_id >= 0) { + result.push(u.word_id) + u = u.dict } } + return result } } From 4f3155c05a5495d62742a9952675ee7dfb9ca625 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 14 Aug 2024 13:22:27 +0800 Subject: [PATCH 1810/2039] Update 1674-minimum-moves-to-make-array-complementary.js --- ...nimum-moves-to-make-array-complementary.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/1674-minimum-moves-to-make-array-complementary.js b/1674-minimum-moves-to-make-array-complementary.js index c257d2e2..3c5243ef 100644 --- a/1674-minimum-moves-to-make-array-complementary.js +++ b/1674-minimum-moves-to-make-array-complementary.js @@ -116,4 +116,31 @@ const minMoves = function (nums, limit) { return res } +// another + +/** + * @param {number[]} nums + * @param {number} limit + * @return {number} + */ +const minMoves = function(nums, limit) { + const n = nums.length + const arr = Array(2 * limit + 2).fill(0) + for(let i = 0; i < n / 2; i++) { + const a = nums[i], b = nums[n - 1 - i] + const l = Math.min(a, b), r = Math.max(a, b) + arr[l + 1]-- + arr[l + r]-- + arr[l + r + 1]++ + arr[r + limit + 1]++ + } + let res = n, cur = n + for(let e of arr) { + cur += e + res = Math.min(res, cur) + } + + return res +}; + From 5581777febe9b1662cef1e80d174b494c9ef6fc5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 15 Aug 2024 11:37:33 +0800 Subject: [PATCH 1811/2039] Create 3224-minimum-array-changes-to-make-differences-equal.js --- ...array-changes-to-make-differences-equal.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 3224-minimum-array-changes-to-make-differences-equal.js diff --git a/3224-minimum-array-changes-to-make-differences-equal.js b/3224-minimum-array-changes-to-make-differences-equal.js new file mode 100644 index 00000000..52dce081 --- /dev/null +++ b/3224-minimum-array-changes-to-make-differences-equal.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minChanges = function(nums, k) { + const n = nums.length + const arr = Array(1e5 + 1).fill(0) + for(let i = 0; i < n /2; i++) { + const a = nums[i], b = nums[n - 1 - i] + const l = Math.min(a, b), r = Math.max(a, b) + const maxDiff = Math.max(l, r, k - l) + arr[0]-- + arr[r - l]-- + arr[r - l + 1]++ + arr[maxDiff + 1]++ + } + let res = n, cur = n + for(const e of arr) { + cur += e + res = Math.min(res, cur) + } + return res +}; From 1403e6348e93af51c7e27926313d41dfafc59c8e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 16 Aug 2024 12:17:42 +0800 Subject: [PATCH 1812/2039] Update 834-sum-of-distances-in-tree.js --- 834-sum-of-distances-in-tree.js | 41 +++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/834-sum-of-distances-in-tree.js b/834-sum-of-distances-in-tree.js index 673af449..2e4df1d7 100644 --- a/834-sum-of-distances-in-tree.js +++ b/834-sum-of-distances-in-tree.js @@ -1,3 +1,44 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +var sumOfDistancesInTree = function(n, edges) { + const res = new Array(n).fill(0); + const count = new Array(n).fill(1); + const graph = Array.from({ length: n }, () => []); + for (const [u, v] of edges) { + graph[u].push(v); + graph[v].push(u); + } + dfs1(0, -1); + dfs2(0, -1); + + return res + + function dfs1(node, parent) { + for (const child of graph[node]) { + if (child === parent) { + continue; + } + dfs1(child, node); + count[node] += count[child]; + res[node] += res[child] + count[child]; + } + } + function dfs2(node, parent) { + for (const child of graph[node]) { + if (child === parent) { + continue; + } + res[child] = res[node] - count[child] + n - count[child]; + dfs2(child, node); + } + } +}; + +// another + /** * @param {number} N * @param {number[][]} edges From e18939edb5ae63fc19659f805efdb590a70d87d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 Aug 2024 13:07:46 +0800 Subject: [PATCH 1813/2039] Create 3241-time-taken-to-mark-all-nodes.js --- 3241-time-taken-to-mark-all-nodes.js | 66 ++++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 3241-time-taken-to-mark-all-nodes.js diff --git a/3241-time-taken-to-mark-all-nodes.js b/3241-time-taken-to-mark-all-nodes.js new file mode 100644 index 00000000..d5268745 --- /dev/null +++ b/3241-time-taken-to-mark-all-nodes.js @@ -0,0 +1,66 @@ +/** + * @param {number[][]} edges + * @return {number[]} + */ +var timeTaken = function(edges) { + let n = edges.length + 1; + let adj = Array.from({ length: n }, () => []); + for (let edge of edges) { + adj[edge[0]].push(edge[1]); + adj[edge[1]].push(edge[0]); + } + + // first, use 0 as root and calculate below: + // far1[i]: the farthest children for the subtree with root i + // far2[i]: the second farthest children for the subtree with root i + let far1 = Array(n).fill(0); + let far2 = Array(n).fill(0); + buildFar(0, adj, far1, far2); + + // by far1 and far2, we can use re-rooting to help us find the answer + let ans = Array(n).fill(0); + calcOthers(0, 0, adj, far1, far2, ans); + + return ans; +}; + +function buildFar(curr, adj, far1, far2) { + let maxChild1 = 0, maxChild2 = 0; + // Iterate through each child (branch), and find the two farthest children. + for (let child of adj[curr]) { + if (child <= curr) continue; + + buildFar(child, adj, far1, far2); + let dist = ((child & 1) ? 1 : 2) + far1[child]; + if (dist >= maxChild1) { + maxChild2 = maxChild1; + maxChild1 = dist; + } else if (dist > maxChild2) { + maxChild2 = dist; + } + } + + far1[curr] = maxChild1; + far2[curr] = maxChild2; +} + +function calcOthers(curr, parentDist, adj, far1, far2, ans) { + // parentDist: the farthest distance when node[parent] is the root + + ans[curr] = Math.max(parentDist, far1[curr]); + + for (let child of adj[curr]) { + if (child < curr) continue; + + let toParent = (curr & 1) ? 1 : 2; + let toChild = (child & 1) ? 1 : 2; + // For this child, exclude itself or it is not correct + // (If the branch containing this child is the farthest for node curr, we should use the second farthest) + let farthestChildExceptThisChild = (far1[curr] === (toChild + far1[child])) ? far2[curr] : far1[curr]; + + calcOthers(child, toParent + Math.max(parentDist, farthestChildExceptThisChild), adj, far1, far2, ans); + } +} + + + From 3bbddffca52d98991c56cecd1111422c5d441715 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 Aug 2024 16:17:08 +0800 Subject: [PATCH 1814/2039] Update 1707-maximum-xor-with-an-element-from-array.js --- ...-maximum-xor-with-an-element-from-array.js | 62 +++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/1707-maximum-xor-with-an-element-from-array.js b/1707-maximum-xor-with-an-element-from-array.js index f33846b8..b7104d10 100644 --- a/1707-maximum-xor-with-an-element-from-array.js +++ b/1707-maximum-xor-with-an-element-from-array.js @@ -1,3 +1,65 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +var maximizeXor = function(nums, queries) { + nums.sort((a, b) => a - b) + const n = nums.length + queries.forEach((query, index) => { + query.push(index) + }) + queries.sort((a, b) => a[1] - b[1]) + const trie = new Trie() + let i = 0 + const res = [] + queries.forEach(([x, m, index]) => { + while (i < n && nums[i] <= m) { + trie.insert(nums[i]) + i++ + } + + res[index] = trie.query(x) + + }) + return res +}; + +class Trie { + constructor() { + this.root = {} + } + insert(num) { + let node = this.root + for (let i = 31; i >= 0; i--) { + const bit = (num >> i) & 1 + if (!node[bit]) { + node[bit] = {} + } + node = node[bit] + } + } + query(num) { + let node = this.root + if (Object.keys(node).length === 0) return -1 + let res = 0 + for (let i = 31; i >= 0; i--) { + const bit = (num >> i) & 1 + if(node == null) break + if (node[1 - bit]) { + res |= 1 << i + node = node[1 - bit] + } else { + node = node[bit] + } + } + return res + } +} + +// another + + /** * @param {number[]} nums * @param {number[][]} queries From ae7d047e485e7d1ef50f944a59d3cf4f587b1a95 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 25 Aug 2024 19:34:16 +0800 Subject: [PATCH 1815/2039] Create 3261-count-substrings-that-satisfy-k-constraint-ii.js --- ...substrings-that-satisfy-k-constraint-ii.js | 72 +++++++++++++++++++ 1 file changed, 72 insertions(+) create mode 100644 3261-count-substrings-that-satisfy-k-constraint-ii.js diff --git a/3261-count-substrings-that-satisfy-k-constraint-ii.js b/3261-count-substrings-that-satisfy-k-constraint-ii.js new file mode 100644 index 00000000..2d536e71 --- /dev/null +++ b/3261-count-substrings-that-satisfy-k-constraint-ii.js @@ -0,0 +1,72 @@ +/** + * @param {string} s + * @param {number} k + * @param {number[][]} queries + * @return {number[]} + */ +var countKConstraintSubstrings = function(s, k, queries) { + let binaryString = s, maxZerosOnes = k, queriesList = queries + let length = binaryString.length; + let zeroPrefixSum = Array(length + 1).fill(0); + + for (let idx = 0; idx < length; idx++) { + zeroPrefixSum[idx + 1] = (binaryString[idx] === '0' ? 1 : 0) + zeroPrefixSum[idx]; + } + + let endIndex = Array(length).fill(0); + + for (let start = 0; start < length; start++) { + let end = start; + let low = start, high = length - 1; + + while (low <= high) { + let mid = low + Math.floor((high - low) / 2); + let zeroCount = zeroPrefixSum[mid + 1] - zeroPrefixSum[start]; + let oneCount = mid + 1 - start - zeroCount; + + if (zeroCount <= maxZerosOnes || oneCount <= maxZerosOnes) { + end = mid; + low = mid + 1; + } else { + high = mid - 1; + } + } + endIndex[start] = end; + } + + for (let i = 0; i < length; i++) { + zeroPrefixSum[i + 1] = (endIndex[i] - i + 1) + zeroPrefixSum[i]; + } + + let results = []; + + /* Template by Bharadwaj ( LEETCODE JAVASCRIPT ) */ + /* Youtube : https://youtube.com/@code-with-Bharadwaj */ + /* Portfolio : https://manu-bharadwaj-portfolio.vercel.app/ */ + + for (let query of queriesList) { + let left = query[0]; + let right = query[1]; + let validIndex = left - 1; + let low = left, high = right; + let totalCount = 0; + + while (low <= high) { + let mid = low + Math.floor((high - low) / 2); + + if (endIndex[mid] < right) { + validIndex = mid; + low = mid + 1; + } else { + high = mid - 1; + } + } + + totalCount += zeroPrefixSum[validIndex + 1] - zeroPrefixSum[left]; + let difference = right - validIndex; + totalCount += (difference * (difference + 1)) / 2; + results.push(totalCount); + } + + return results; +}; From cad1ed69467f99c8eaf6041359c4c86feab5ce7e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 28 Aug 2024 13:56:18 +0800 Subject: [PATCH 1816/2039] Update 907-sum-of-subarray-minimums.js --- 907-sum-of-subarray-minimums.js | 35 +++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/907-sum-of-subarray-minimums.js b/907-sum-of-subarray-minimums.js index 52e0a139..ffb2c2a1 100644 --- a/907-sum-of-subarray-minimums.js +++ b/907-sum-of-subarray-minimums.js @@ -67,3 +67,38 @@ const sumSubarrayMins = function (arr) { return res } + +// another + +/** + * @param {number[]} arr + * @return {number} + */ +const sumSubarrayMins = function(arr) { + const stk1 = [], stk2 = [] + const len = arr.length, mod = 1e9 + 7 + const left = new Array(len), right = new Array(len) + for(let i = 0; i < len; i++) { + left[i] = i + 1 + right[i] = len - i + } + for(let i = 0; i < len; i++) { + while(stk1.length && arr[stk1[stk1.length - 1]] > arr[i]) { + stk1.pop() + } + left[i] = i - (stk1.length ? stk1[stk1.length - 1] : -1) + stk1.push(i) + + while(stk2.length && arr[stk2[stk2.length - 1]] > arr[i]) { + let index = stk2.pop() + right[index] = i - index + } + stk2.push(i) + } + + let res = 0 + for(let i = 0; i < len; i++) { + res = (res + arr[i] * left[i] * right[i]) % mod + } + return res +}; From 2602592b0af90d98917cbc7c63f5628749227ceb Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 5 Sep 2024 17:04:05 +0800 Subject: [PATCH 1817/2039] Create 2972-count-the-number-of-incremovable-subarrays-ii.js --- ...the-number-of-incremovable-subarrays-ii.js | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 2972-count-the-number-of-incremovable-subarrays-ii.js diff --git a/2972-count-the-number-of-incremovable-subarrays-ii.js b/2972-count-the-number-of-incremovable-subarrays-ii.js new file mode 100644 index 00000000..e21dcf60 --- /dev/null +++ b/2972-count-the-number-of-incremovable-subarrays-ii.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var incremovableSubarrayCount = function(nums) { + let n = nums.length; + let l = 0; + while (nums[l + 1] > nums[l]) ++l; + if (l + 1 == n) return (n * (n + 1)) / 2; + + let res = l + 2; + let r = n; + do { + --r; + while (l >= 0 && nums[l] >= nums[r]) --l; + res += l + 2 + } + while (nums[r] > nums[r-1]) + + return res; +}; From 6dc38794f4807a783fc05356ce160c848263d765 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Sep 2024 18:02:12 +0800 Subject: [PATCH 1818/2039] Create 3283-maximum-number-of-moves-to-kill-all-pawns.js --- ...ximum-number-of-moves-to-kill-all-pawns.js | 126 ++++++++++++++++++ 1 file changed, 126 insertions(+) create mode 100644 3283-maximum-number-of-moves-to-kill-all-pawns.js diff --git a/3283-maximum-number-of-moves-to-kill-all-pawns.js b/3283-maximum-number-of-moves-to-kill-all-pawns.js new file mode 100644 index 00000000..228f3afb --- /dev/null +++ b/3283-maximum-number-of-moves-to-kill-all-pawns.js @@ -0,0 +1,126 @@ +/** + * @param {number} kx + * @param {number} ky + * @param {number[][]} positions + * @return {number} + */ +var maxMoves = function (kx, ky, positions) { + //alice goes first + //alice wants to maximize result + + //add the starting position + positions.unshift([kx, ky]) + + let dp = new Float64Array(positions.length * 2 ** positions.length) + let degreesBetweenPawnPairs = new Float64Array( + positions.length * positions.length, + ) + + computeAllDegreesBetweenPawns() + + //if the mask is equal to this, we've visited all pawns + let targetMask = (1 << positions.length) - 1 + + //alice starts, so we set maximize to true + return dfs(0, true, 1) + + function dfs(pawn1Idx, maximize, mask) { + if (mask === targetMask) { + return 0 + } + + let dpIdx = pawn1Idx * 2 ** positions.length + mask + if (dp[dpIdx] > 0) { + return dp[dpIdx] - 1 + } + + let best = Infinity + let worst = 0 + + for (let pawn2Idx = 0; pawn2Idx < positions.length; ++pawn2Idx) { + if (mask & (1 << pawn2Idx)) { + continue + } + + let cur = degreeBetween(pawn1Idx, pawn2Idx) + cur += dfs(pawn2Idx, !maximize, mask | (1 << pawn2Idx)) + + best = Math.min(best, cur) + worst = Math.max(worst, cur) + } + + let ret + if (maximize) { + ret = worst + } else { + ret = best + } + + dp[dpIdx] = ret + 1 + return ret + } + + function computeAllDegreesBetweenPawns() { + let targets = new Map(positions.map(([x, y], idx) => [y * 50 + x, idx])) + + let visited = new Array(50 * 50).fill(0) + const MOVES = [ + [2, 1], + [-2, 1], + [2, -1], + [-2, -1], + [1, -2], + [1, 2], + [-1, 2], + [-1, -2], + ] + + for (let i = 0; i < positions.length; ++i) { + let q = [positions[i]] + let q2 = [] + let steps = 0 + + visited[positions[i][1] * 50 + positions[i][0]] = i + + while (q.length) { + let [x, y] = q.pop() + + { + let dpIdx = y * 50 + x + if (targets.has(dpIdx)) { + let v1 = i + let v2 = targets.get(dpIdx) + degreesBetweenPawnPairs[v1 * positions.length + v2] = steps + degreesBetweenPawnPairs[v2 * positions.length + v1] = steps + } + } + + for (let [offx, offy] of MOVES) { + let newX = x + offx + let newY = y + offy + + if (newX >= 50 || newY >= 50 || newX < 0 || newY < 0) { + continue + } + let visitedDpIdx = newY * 50 + newX + if (visited[visitedDpIdx] === i) { + continue + } + visited[visitedDpIdx] = i + q2.push([newX, newY]) + } + + if (!q.length) { + ;[q2, q] = [q, q2] + ++steps + } + } + } + } + + function degreeBetween(i, j) { + return degreesBetweenPawnPairs[i * positions.length + j] + } +} + + From d0d8753925c1d429cdfc67981eb595dbc7e47f83 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Sep 2024 18:03:06 +0800 Subject: [PATCH 1819/2039] Create 3282-reach-end-of-array-with-max-score.js --- 3282-reach-end-of-array-with-max-score.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 3282-reach-end-of-array-with-max-score.js diff --git a/3282-reach-end-of-array-with-max-score.js b/3282-reach-end-of-array-with-max-score.js new file mode 100644 index 00000000..2fb4bb45 --- /dev/null +++ b/3282-reach-end-of-array-with-max-score.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var findMaximumScore = function(nums) { + let n = nums.length + + if(n==1)return 0 + let res = 0,mx = nums[0],prev = nums[0] + for(let i=1;imx)mx = nums[i] + } + return res +}; From 616f5ff37a9a5d79556ee2845f9a50d3534d25c6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Sep 2024 18:03:40 +0800 Subject: [PATCH 1820/2039] Create 3281-maximize-score-of-numbers-in-ranges.js --- 3281-maximize-score-of-numbers-in-ranges.js | 30 +++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 3281-maximize-score-of-numbers-in-ranges.js diff --git a/3281-maximize-score-of-numbers-in-ranges.js b/3281-maximize-score-of-numbers-in-ranges.js new file mode 100644 index 00000000..9a71ae2e --- /dev/null +++ b/3281-maximize-score-of-numbers-in-ranges.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} start + * @param {number} d + * @return {number} + */ +var maxPossibleScore = function (start, d) { + start.sort((a, b) => a - b) + let low = 0, + high = start[start.length - 1] + d - start[0] + while (low <= high) { + let mid = low + Math.floor((high - low) / 2) + if (f(start, d, mid)) { + low = mid + 1 + } else { + high = mid - 1 + } + } + return low - 1 +} +function f(start, d, mini) { + let ans = start[0] + for (let i = 1; i < start.length; i++) { + let nextMin = ans + mini + if (nextMin > start[i] + d) { + return false + } + ans = Math.max(start[i], nextMin) + } + return true +} From ca8a47c3069ef8ba0220677e6f53361c93480ecb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 8 Sep 2024 18:04:24 +0800 Subject: [PATCH 1821/2039] Create 3280-convert-date-to-binary.js --- 3280-convert-date-to-binary.js | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 3280-convert-date-to-binary.js diff --git a/3280-convert-date-to-binary.js b/3280-convert-date-to-binary.js new file mode 100644 index 00000000..48190272 --- /dev/null +++ b/3280-convert-date-to-binary.js @@ -0,0 +1,31 @@ +/** + * @param {string} date + * @return {string} + */ +var convertDateToBinary = function(date) { + let temp = [], res =[] + for(let i of date){ + if(i=='-'){ + temp = dec_to_bin(temp.join('')) + res.push(...temp) + temp = [] + res.push('-') + } + else temp.push(i) + } + temp = dec_to_bin(temp.join('')) + res.push(...temp) + return res.join('') +}; + +function dec_to_bin( a){ + let b = +(a) + let res = [] + while(b>0){ + if(b&1)res.push('1') + else res.push('0') + b>>=1 + } + res.reverse() + return res +} From 074366407f9cc85ca35161bf83aa8febfb2ccf8b Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 13 Sep 2024 13:15:35 +0800 Subject: [PATCH 1822/2039] Update 691-stickers-to-spell-word.js --- 691-stickers-to-spell-word.js | 39 +++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/691-stickers-to-spell-word.js b/691-stickers-to-spell-word.js index 8c0574c5..b81b80ea 100644 --- a/691-stickers-to-spell-word.js +++ b/691-stickers-to-spell-word.js @@ -1,3 +1,42 @@ +/** + * @param {string[]} stickers + * @param {string} target + * @return {number} + */ +const minStickers = function(stickers, target) { + const n = target.length + const limit = 1 << n + const dp = Array(limit).fill(Infinity) + dp[0] = 0 + for(let state = 0; state < limit; state++) { + if(dp[state] === Infinity) continue + for(let s of stickers) { + const ns = helper(state, target, s) + dp[ns] = Math.min(dp[ns], dp[state] + 1) + } + + } + + return dp[limit - 1] === Infinity ? -1 : dp[limit - 1] + + function helper(state, target, s) { + const n = target.length + for(const ch of s) { + for(let i = 0; i < n; i++) { + if(target[i] === ch && ((state >> i) & 1) === 0) { + state |= (1 << i) + break + } + } + } + + return state + } +}; + +// another + + /** * @param {string[]} stickers * @param {string} target From 0e865b87317bca08a57829db66ee89e5309e62b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 14 Sep 2024 13:34:13 +0800 Subject: [PATCH 1823/2039] Update 1125-smallest-sufficient-team.js --- 1125-smallest-sufficient-team.js | 44 ++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/1125-smallest-sufficient-team.js b/1125-smallest-sufficient-team.js index 4b890c98..a617f780 100644 --- a/1125-smallest-sufficient-team.js +++ b/1125-smallest-sufficient-team.js @@ -1,3 +1,47 @@ +/** + * @param {string[]} req_skills + * @param {string[][]} people + * @return {number[]} + */ +var smallestSufficientTeam = function(req_skills, people) { + const n = req_skills.length, m = people.length + const limit = 1 << n + const reqSet = new Set(req_skills) + const si = {} + for(let i = 0; i < n; i++) si[req_skills[i]] = i + const ps = {} + for(let i = 0; i < m; i++) { + const p = people[i] + let mask = 0 + for(const s of p) { + if(!reqSet.has(s)) continue + mask |= (1 << si[s]) + } + ps[i] = mask + } + const res = Array.from({ length: limit }, () => new Array()) + let dp = Array(limit).fill(Infinity) + dp[0] = 0 + for(let i = 0; i < m; i++) { + const pMask = ps[i] + const dp2 = [...dp] + for(let mask = 0; mask < limit; mask++) { + const newMask = mask | pMask + if(dp2[newMask] > dp[mask] + 1) { + dp2[newMask] = dp[mask] + 1 + res[newMask] = [...res[mask]] + res[newMask].push(i) + } + } + dp = dp2 + } + + return res[limit - 1] +}; + +// another + + /** * @param {string[]} req_skills * @param {string[][]} people From d121bbab4c24be42a74c8b12cde11b9af79d85b5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Sep 2024 16:17:26 +0800 Subject: [PATCH 1824/2039] Create 3295-report-spam-message.js --- 3295-report-spam-message.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 3295-report-spam-message.js diff --git a/3295-report-spam-message.js b/3295-report-spam-message.js new file mode 100644 index 00000000..125acf6d --- /dev/null +++ b/3295-report-spam-message.js @@ -0,0 +1,27 @@ +/** + * @param {string[]} message + * @param {string[]} bannedWords + * @return {boolean} + */ +var reportSpam = function(message, bannedWords) { + let res = false + const m = message.length, n = bannedWords.length + let cnt = 0 + const bs = new Set(bannedWords) + for(let i = 0; i < m; i++) { + const str = message[i] + /* + for(let j = 0; j < n; j++) { + const e = bannedWords[j] + if(str === e) { + cnt++ + break + } + } + */ + if(bs.has(str)) cnt++ + if(cnt >= 2) return true + } + + return res +}; From a422d87bd503ee0a6b0999febcc1d647617ed0e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Sep 2024 16:18:37 +0800 Subject: [PATCH 1825/2039] Create 3296-minimum-number-of-seconds-to-make-mountain-height-zero.js --- ...of-seconds-to-make-mountain-height-zero.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 3296-minimum-number-of-seconds-to-make-mountain-height-zero.js diff --git a/3296-minimum-number-of-seconds-to-make-mountain-height-zero.js b/3296-minimum-number-of-seconds-to-make-mountain-height-zero.js new file mode 100644 index 00000000..369cd1c9 --- /dev/null +++ b/3296-minimum-number-of-seconds-to-make-mountain-height-zero.js @@ -0,0 +1,31 @@ +/** + * @param {number} mountainHeight + * @param {number[]} workerTimes + * @return {number} + */ +var minNumberOfSeconds = function (mountainHeight, workerTimes) { + let low = 0, + high = 1e18 + while (low < high) { + let mid = low + Math.floor((high - low) / 2) + let totalHeightReduced = 0 + for (let workerTime of workerTimes) { + totalHeightReduced += f(mid, workerTime) + if (totalHeightReduced >= mountainHeight) break + } + if (totalHeightReduced >= mountainHeight) high = mid + else low = mid + 1 + } + return low +} +function f(T, workerTime) { + let low = 0, + high = 1e6 + while (low < high) { + let mid = low + Math.floor((high - low + 1) / 2) + let timeRequired = (workerTime * mid * (mid + 1)) / 2 + if (timeRequired <= T) low = mid + else high = mid - 1 + } + return low +} From 1dfef76e331b88d39ff39fa060f807caf501e052 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Sep 2024 16:19:29 +0800 Subject: [PATCH 1826/2039] Create 3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i.js --- ...can-be-rearranged-to-contain-a-string-i.js | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i.js diff --git a/3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i.js b/3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i.js new file mode 100644 index 00000000..541fc927 --- /dev/null +++ b/3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i.js @@ -0,0 +1,44 @@ +/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +var validSubstringCount = function (word1, word2) { + const mp1 = new Array(26).fill(0) + const mp2 = new Array(26).fill(0) + let missing = 0 + + for (const c of word2) { + mp1[c.charCodeAt(0) - 'a'.charCodeAt(0)]++ + } + + for (let i = 0; i < 26; i++) { + if (mp1[i] > 0) { + missing += mp1[i] + } + } + + let res = 0 + let left = 0 + const n = word1.length + + for (let right = 0; right < n; right++) { + const c = word1[right].charCodeAt(0) - 'a'.charCodeAt(0) + mp2[c]++ + if (mp1[c] > 0 && mp2[c] <= mp1[c]) { + missing-- + } + + while (missing === 0) { + res += n - right + const left_char = word1[left].charCodeAt(0) - 'a'.charCodeAt(0) + if (mp1[left_char] > 0 && mp2[left_char] <= mp1[left_char]) { + missing++ + } + mp2[left_char]-- + left++ + } + } + + return res +} From 8ff315bd5814ea8c83139223af14ceead7b2919c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Sep 2024 16:20:18 +0800 Subject: [PATCH 1827/2039] Create 3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js --- ...an-be-rearranged-to-contain-a-string-ii.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js diff --git a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js new file mode 100644 index 00000000..6c77b42b --- /dev/null +++ b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js @@ -0,0 +1,49 @@ +/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +var validSubstringCount = function (word1, word2) { + const mp1 = new Array(26).fill(0) + const mp2 = new Array(26).fill(0) + let count = 0 + + for (const c of word2) { + mp1[c.charCodeAt(0) - 'a'.charCodeAt(0)]++ + } + + for (let i = 0; i < 26; i++) { + if (mp1[i] > 0) { + count += mp1[i] + } + } + + let res = 0 + let left = 0 + + for (let right = 0; right < word1.length; right++) { + mp2[word1.charCodeAt(right) - 'a'.charCodeAt(0)]++ + if ( + mp1[word1.charCodeAt(right) - 'a'.charCodeAt(0)] > 0 && + mp2[word1.charCodeAt(right) - 'a'.charCodeAt(0)] <= + mp1[word1.charCodeAt(right) - 'a'.charCodeAt(0)] + ) { + count-- + } + + while (count === 0) { + res += word1.length - right + if ( + mp1[word1.charCodeAt(left) - 'a'.charCodeAt(0)] > 0 && + mp2[word1.charCodeAt(left) - 'a'.charCodeAt(0)] <= + mp1[word1.charCodeAt(left) - 'a'.charCodeAt(0)] + ) { + count++ + } + mp2[word1.charCodeAt(left) - 'a'.charCodeAt(0)]-- + left++ + } + } + + return res +} From bb76d23baf3fa11cf3dafd4d5cfec6436c6fe9d7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Sep 2024 18:13:07 +0800 Subject: [PATCH 1828/2039] Update 1799-maximize-score-after-n-operations.js --- 1799-maximize-score-after-n-operations.js | 40 +++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/1799-maximize-score-after-n-operations.js b/1799-maximize-score-after-n-operations.js index 28e97a5c..4e4ec0cf 100644 --- a/1799-maximize-score-after-n-operations.js +++ b/1799-maximize-score-after-n-operations.js @@ -1,3 +1,43 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const maxScore = function (nums) { + const len = nums.length + const n = len / 2 + const allMask = 2 ** 14 - 1 + const memo = Array.from({ length: n + 1 }, () => Array()) + + return helper(1, 0) + + function helper(op, mask) { + if(op > n) return 0 + if(memo[op][mask]) return memo[op][mask] + + let res = 0 + for(let i = 0; i < len; i++) { + const a = nums[i] + for(let j = i + 1; j < len; j++) { + const b = nums[j] + const newMask = (1 << i) + (1 << j) + if((mask & newMask) === 0) { + res = Math.max(res, op * gcd(a, b) + helper(op + 1, mask | newMask)) + } + } + } + // console.log(res) + memo[op][mask] = res + + return memo[op][mask] + } +} + +function gcd(a, b) { + return b === 0 ? a : gcd(b, a % b) +} + +// another + /** * @param {number[]} nums * @return {number} From 8c0ff0c66bd1e7a171dad4b2269af6c574a68cb9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Sep 2024 12:42:49 +0800 Subject: [PATCH 1829/2039] Update 1994-the-number-of-good-subsets.js --- 1994-the-number-of-good-subsets.js | 86 ++++++++++++++++++++++++++++++ 1 file changed, 86 insertions(+) diff --git a/1994-the-number-of-good-subsets.js b/1994-the-number-of-good-subsets.js index 8ca7236d..bcf0f37d 100644 --- a/1994-the-number-of-good-subsets.js +++ b/1994-the-number-of-good-subsets.js @@ -1,3 +1,89 @@ +const M = 1e9 + 7 + +/** + * @param {number[]} nums + * @return {number} + */ +const numberOfGoodSubsets = function (nums) { + const set = new Set([ + 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, + ]) + const map = new Map() + let count1 = 0 + + for (const x of nums) { + if (set.has(x)) { + map.set(x, (map.get(x) || 0) + 1) + } + if (x === 1) { + count1++ + } + } + + const n = map.size + const count = [] + const digit = [] + for (const [key, value] of map) { + digit.push(key) + count.push(value) + } + + let ret = 0 + for (let state = 1; state < 1 << n; state++) { + let flag = 1 + for (let i = 0; i < n; i++) { + if (((state >> i) & 1) === 0) continue + for (let j = i + 1; j < n; j++) { + if (((state >> j) & 1) === 0) continue + if (gcd(digit[i], digit[j]) !== 1) { + flag = 0 + break + } + } + if (flag === 0) break + } + + if (flag === 0) continue + + let ans = 1 + for (let i = 0; i < n; i++) { + if (((state >> i) & 1) === 0) continue + ans = mul(ans, count[i]) + } + ret = (ret + ans) % M + } + + ret = mul(ret, quickMul(2, count1)) + return ret +} + +function quickMul(x, N) { + if (N === 0) { + return 1 + } + const y = quickMul(x, Math.floor(N / 2)) + return N % 2 === 0 ? mul(y, y) : mul(y, y, x) +} + +function mul(...arr) { + let res = 1n + for (const e of arr) { + res *= BigInt(e) + } + + return Number(res % BigInt(M)) +} + +function gcd(a, b) { + while (b) { + ;[a, b] = [b, a % b] + } + return a +} + +// another + + /** * @param {number[]} nums * @return {number} From bf53c5c67ceba811902185f59f657e4731decfba Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 24 Sep 2024 17:34:52 +0800 Subject: [PATCH 1830/2039] Update 1994-the-number-of-good-subsets.js --- 1994-the-number-of-good-subsets.js | 67 ++++++++++++++++++++++++++++++ 1 file changed, 67 insertions(+) diff --git a/1994-the-number-of-good-subsets.js b/1994-the-number-of-good-subsets.js index bcf0f37d..56f86517 100644 --- a/1994-the-number-of-good-subsets.js +++ b/1994-the-number-of-good-subsets.js @@ -1,3 +1,70 @@ +const primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] +const M = 1e9 + 7 +/** + * @param {number[]} nums + * @return {number} + */ +var numberOfGoodSubsets = function (nums) { + const n = primes.length + const dp = new Array(1 << n).fill(0) + dp[0] = 1 + + const map = new Map() + for (const x of nums) { + map.set(x, (map.get(x) || 0) + 1) + } + + let count1 = 0 + for (const [x, count] of map) { + if (x === 1) continue + const encode = encoding(x) + if (encode === -1) continue + + for (let state = (1 << n) - 1; state >= 1; state--) { + if (state - encode === (state ^ encode)) { + dp[state] = (dp[state] + ((dp[state - encode] * count) % M)) % M + } + } + } + + let ret = 0 + for (let state = 1; state < 1 << n; state++) { + ret = (ret + dp[state]) % M + } + + let power2 = 1 + for (let i = 0; i < (map.get(1) || 0); i++) { + power2 = (power2 * 2) % M + } + + return mul(ret, power2) +} + +function mul(...arr) { + let res = 1n + for (const e of arr) { + res *= BigInt(e) + } + + return Number(res % BigInt(M)) +} + +function encoding(num) { + let encode = 0 + for (let i = 0; i < primes.length; i++) { + if (num % primes[i] === 0) { + encode += 1 << i + num /= primes[i] + } + if (num % primes[i] === 0) { + return -1 + } + } + return encode +} + +// another + const M = 1e9 + 7 /** From 97fc11deeba92e1eeaf19fbd39cc8290862a8834 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Sep 2024 10:55:42 +0800 Subject: [PATCH 1831/2039] Update 2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js --- ...-length-of-two-palindromic-subsequences.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js b/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js index f6126c88..49a6f516 100644 --- a/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js +++ b/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js @@ -1,3 +1,46 @@ +/** + * @param {string} s + * @return {number} + */ +const maxProduct = function(s) { + const n = s.length + const limit = (1 << n) - 1 + let res = 0 + for(let mask = 1; mask < limit; mask++) { + res = Math.max(res, lp(mask) * lp(limit - mask)) + } + return res + + function lp(state) { + if(state === 0) return 0 + const str = [] + let idx = 0 + // console.log((state)) + while(idx < s.length) { + // console.log((state >>> 0).toString(2)) + if((state >> idx) & 1) str.push(s[s.length - 1 - idx]) + idx++ + } + // console.log(str) + const len = str.length + const dp = Array.from({ length: len }, () => Array(len).fill(0)) + for(let i = 0; i < len; i++) dp[i][i] = 1 + + for(let length = 2; length <= len; length++) { + for(let i = 0; i + length - 1 < len; i++) { + const j = i + length - 1 + if(str[i] === str[j]) dp[i][j] = dp[i + 1][j - 1] + 2 + else dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]) + } + } + + // console.log(dp, len) + return dp[0][len - 1] + } +}; + +// another + /** * @param {string} s * @return {number} From 99536f2f5026e3925024415d5c2e3fd1f72e5c13 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 26 Sep 2024 14:51:26 +0800 Subject: [PATCH 1832/2039] Update 1125-smallest-sufficient-team.js --- 1125-smallest-sufficient-team.js | 43 ++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/1125-smallest-sufficient-team.js b/1125-smallest-sufficient-team.js index a617f780..2e8e9754 100644 --- a/1125-smallest-sufficient-team.js +++ b/1125-smallest-sufficient-team.js @@ -1,3 +1,46 @@ +/** + * @param {string[]} req_skills + * @param {string[][]} people + * @return {number[]} + */ +var smallestSufficientTeam = function(req_skills, people) { + const n = req_skills.length, m = people.length + const limit = 1 << n + const reqSet = new Set(req_skills) + const si = {} + for(let i = 0; i < n; i++) si[req_skills[i]] = i + const ps = {} + for(let i = 0; i < m; i++) { + const p = people[i] + let mask = 0 + for(const s of p) { + if(!reqSet.has(s)) continue + mask |= (1 << si[s]) + } + ps[i] = mask + } + const res = Array.from({ length: limit }, () => new Array()) + let dp = Array(limit).fill(Infinity) + dp[0] = 0 + for(let i = 0; i < m; i++) { + const pMask = ps[i] + // const dp2 = [...dp] + for(let mask = 0; mask < limit; mask++) { + const newMask = mask | pMask + if(dp[newMask] > dp[mask] + 1) { + dp[newMask] = dp[mask] + 1 + res[newMask] = [...res[mask]] + res[newMask].push(i) + } + } + // dp = dp2 + } + + return res[limit - 1] +}; + +// another + /** * @param {string[]} req_skills * @param {string[][]} people From c5d45d8586471644d1492e8c7d920d73f3664fce Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Sep 2024 12:21:45 +0800 Subject: [PATCH 1833/2039] Create 3276-select-cells-in-grid-with-maximum-score.js --- ...select-cells-in-grid-with-maximum-score.js | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 3276-select-cells-in-grid-with-maximum-score.js diff --git a/3276-select-cells-in-grid-with-maximum-score.js b/3276-select-cells-in-grid-with-maximum-score.js new file mode 100644 index 00000000..bdb2ac33 --- /dev/null +++ b/3276-select-cells-in-grid-with-maximum-score.js @@ -0,0 +1,45 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var maxScore = function (grid) { + const n = grid.length + const m = grid[0].length + const values = [] + + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + values.push([grid[i][j], i, j]) + } + } + + values.sort((a, b) => b[0] - a[0]) + const dp = {} + + return recur(values, 0, 0, dp) +} + +function recur(values, idx, mask_row, dp) { + const n = values.length + if (idx === n) return 0 + + const key = `${idx},${mask_row}` + if (key in dp) return dp[key] + + let ans = 0 + const row = values[idx][1] + if ((1 << row) & mask_row) { + ans += recur(values, idx + 1, mask_row, dp) + } else { + let j = idx + while (j < n && values[idx][0] === values[j][0]) j++ + + const ans1 = values[idx][0] + recur(values, j, mask_row | (1 << row), dp) + const ans2 = recur(values, idx + 1, mask_row, dp) + + ans = Math.max(ans1, ans2) + } + + dp[key] = ans + return ans +} From 8ee2cfe184a68a325cee04b5c5346b8912b27932 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 30 Sep 2024 11:43:09 +0800 Subject: [PATCH 1834/2039] Update 1494-parallel-courses-ii.js --- 1494-parallel-courses-ii.js | 52 +++++++++++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/1494-parallel-courses-ii.js b/1494-parallel-courses-ii.js index 0882499f..17397e68 100644 --- a/1494-parallel-courses-ii.js +++ b/1494-parallel-courses-ii.js @@ -1,3 +1,55 @@ +/** + * @param {number} n + * @param {number[][]} relations + * @param {number} k + * @return {number} + */ +const minNumberOfSemesters = function(n, relations, k) { + const limit = (1 << n) + const dp = Array(limit).fill(Number.MAX_SAFE_INTEGER) + const preCourse = Array(n).fill(0) + const preState = Array(limit).fill(0) + + for(const [s, d] of relations) { + preCourse[d - 1] |= (1 << (s - 1)) + } + for(let state = 0; state < limit; state++) { + for(let i = 0; i < n; i++) { + if(state & (1 << i)) { + preState[state] |= preCourse[i] + } + } + if(preState[state] === 0 && bitCnt(state) <= k) dp[state] = 1 + } + dp[0] = 0 + for(let state = 1; state < limit; state++) { + for(let sub = state; sub >= 0; sub = (sub - 1) & state) { + if( + bitCnt(state) - bitCnt(sub) <= k && + ((preState[state] & sub) === preState[state]) + ) { + // console.log('d', state, sub, dp) + dp[state] = Math.min(dp[state], dp[sub] + 1) + } + if(sub === 0) break + } + } + + // console.log(limit) + return dp[limit - 1] +}; + +function bitCnt(num) { + let res = 0 + while(num) { + res++ + num &= (num - 1) + } + return res +} + +// another + /** * @param {number} n * @param {number[][]} dependencies From 67267993fb0611557e4e77dadde106fc6627b1ac Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Oct 2024 16:52:52 +0800 Subject: [PATCH 1835/2039] Update 638-shopping-offers.js --- 638-shopping-offers.js | 43 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/638-shopping-offers.js b/638-shopping-offers.js index 9870b16c..9f031c87 100644 --- a/638-shopping-offers.js +++ b/638-shopping-offers.js @@ -1,3 +1,46 @@ +/** + * @param {number[]} price + * @param {number[][]} special + * @param {number[]} needs + * @return {number} + */ +const shoppingOffers = function (price, special, needs) { + return helper(price, special, needs, 0); +} + + +function helper(price, special, needs, pos) { + let local_min = directPurchase(price, needs); + for (let i = pos; i < special.length; i++) { + let offer = special[i]; + let temp = []; + for (let j = 0; j < needs.length; j++) { + if (needs[j] < offer[j]) { // check if the current offer is valid + temp = null; + break; + } + temp.push(needs[j] - offer[j]); + } + + if (temp !== null) { // use the current offer and try next + local_min = Math.min(local_min, offer[offer.length - 1] + helper(price, special, temp, i)); + } + } + + return local_min; +} + +function directPurchase(price, needs) { + let total = 0; + for (let i = 0; i < needs.length; i++) { + total += price[i] * needs[i]; + } + + return total; +} + +// another + /** * @param {number[]} price * @param {number[][]} special From aa7ad7cdad55ca1017e37f945c934759884cf468 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 11 Oct 2024 16:54:19 +0800 Subject: [PATCH 1836/2039] Update 638-shopping-offers.js --- 638-shopping-offers.js | 49 +++++++++++++++++++++++------------------- 1 file changed, 27 insertions(+), 22 deletions(-) diff --git a/638-shopping-offers.js b/638-shopping-offers.js index 9f031c87..49747e60 100644 --- a/638-shopping-offers.js +++ b/638-shopping-offers.js @@ -5,40 +5,45 @@ * @return {number} */ const shoppingOffers = function (price, special, needs) { - return helper(price, special, needs, 0); + return helper(price, special, needs, 0) } - function helper(price, special, needs, pos) { - let local_min = directPurchase(price, needs); - for (let i = pos; i < special.length; i++) { - let offer = special[i]; - let temp = []; - for (let j = 0; j < needs.length; j++) { - if (needs[j] < offer[j]) { // check if the current offer is valid - temp = null; - break; - } - temp.push(needs[j] - offer[j]); - } + let local_min = directPurchase(price, needs) + for (let i = pos; i < special.length; i++) { + let offer = special[i] + let temp = [] + for (let j = 0; j < needs.length; j++) { + if (needs[j] < offer[j]) { + // check if the current offer is valid + temp = null + break + } + temp.push(needs[j] - offer[j]) + } - if (temp !== null) { // use the current offer and try next - local_min = Math.min(local_min, offer[offer.length - 1] + helper(price, special, temp, i)); - } + if (temp !== null) { + // use the current offer and try next + local_min = Math.min( + local_min, + offer[offer.length - 1] + helper(price, special, temp, i), + ) } + } - return local_min; + return local_min } function directPurchase(price, needs) { - let total = 0; - for (let i = 0; i < needs.length; i++) { - total += price[i] * needs[i]; - } + let total = 0 + for (let i = 0; i < needs.length; i++) { + total += price[i] * needs[i] + } - return total; + return total } + // another /** From f0e6a773d5ae325409a33f87c7edaf4143bf0abf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Oct 2024 22:02:23 +0800 Subject: [PATCH 1837/2039] Create 1545-find-kth-bit-in-nth-binary-string.js --- 1545-find-kth-bit-in-nth-binary-string.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 1545-find-kth-bit-in-nth-binary-string.js diff --git a/1545-find-kth-bit-in-nth-binary-string.js b/1545-find-kth-bit-in-nth-binary-string.js new file mode 100644 index 00000000..86e2aa48 --- /dev/null +++ b/1545-find-kth-bit-in-nth-binary-string.js @@ -0,0 +1,17 @@ +/** + * @param {number} n + * @param {number} k + * @return {character} + */ +var findKthBit = function(n, k) { + let count = 0, l = (1 << n) - 1; + while (k > 1) { + if (k == Math.floor(l / 2) + 1) return count % 2 == 0 ? '1' : '0'; + if (k > l / 2) { + k = l + 1 - k; + count++; + } + l = Math.floor(l / 2); + } + return count % 2 === 0 ? '0' : '1'; +}; From ee21cb486cee00163a1d33a64aa8c67bb03120be Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 14 Oct 2024 12:46:30 +0800 Subject: [PATCH 1838/2039] Update 2376-count-special-integers.js --- 2376-count-special-integers.js | 56 ++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) diff --git a/2376-count-special-integers.js b/2376-count-special-integers.js index c2f74b4f..af386f2f 100644 --- a/2376-count-special-integers.js +++ b/2376-count-special-integers.js @@ -58,3 +58,59 @@ const countSpecialNumbers = function (n) { return (dp[idx][tight][mask] = ans) } } + +// another + +const dp = Array.from({ length: 11 }, () => + Array.from({ length: 2 }, () => Array(1024).fill(-1)), +) + +function gogo(s, tight = 1, pos = 0, mask = 0) { + // Base case + if (pos === s.length) { + // Mask = 0, represents 00000...0 which should not be counted + return mask !== 0 + } + + // DP state + if (dp[pos][tight][mask] !== -1) { + return dp[pos][tight][mask] + } + + let ans = 0 + + if (tight === 1) { + // Limit the current digit + for (let i = 0; i <= s[pos] - '0'; i++) { + // Check if digit repeated, ie, present in the mask + if (mask & (1 << i)) continue + + const newMask = mask === 0 && i === 0 ? mask : mask | (1 << i) + + if (i === s[pos] - '0') { + // Tight case + ans += gogo(s, 1, pos + 1, newMask) + } else { + ans += gogo(s, 0, pos + 1, newMask) + } + } + } else { + for (let i = 0; i <= 9; i++) { + // Check if digit repeated, ie, present in the mask + if (mask & (1 << i)) continue + + const newMask = mask === 0 && i === 0 ? mask : mask | (1 << i) + ans += gogo(s, 0, pos + 1, newMask) + } + } + return (dp[pos][tight][mask] = ans) +} +/** + * @param {number} n + * @return {number} + */ +var countSpecialNumbers = function (n) { + const s = n.toString() + dp.forEach((arr) => arr.forEach((innerArr) => innerArr.fill(-1))) + return gogo(s) +} From 1cd3d557eeea7cd15621699e7d73955b05a44774 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 15 Oct 2024 14:42:40 +0800 Subject: [PATCH 1839/2039] Update 1012-numbers-with-repeated-digits.js --- 1012-numbers-with-repeated-digits.js | 49 ++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/1012-numbers-with-repeated-digits.js b/1012-numbers-with-repeated-digits.js index dec2580e..b9c88524 100644 --- a/1012-numbers-with-repeated-digits.js +++ b/1012-numbers-with-repeated-digits.js @@ -94,3 +94,52 @@ var numDupDigitsAtMostN = function(n) { return n - res }; + +// another + +/** + * @param {number} n + * @return {number} + */ +var numDupDigitsAtMostN = function(n) { + return n - helper(n) + function helper(num) { + let res = 0 + const s = `${num}` + const slen = s.length + for(let len = 1; len < slen; len++) { + res += perm(10, len) - perm(9, len - 1) + } + const visited = Array(10).fill(null) + dfs(s, 0, visited) + + return res + function dfs(s, i, visited) { + const n = s.length + if(i === n) { + res++ + return + } + for(let d = 0; d <= 9; d++) { + if(d === 0 && i === 0) continue + if(visited[d]) continue + if(d < +s[i]) { + res += perm(10 - i - 1, n - i - 1) + } else if(d === +s[i]) { + visited[d] = 1 + dfs(s, i + 1, visited) + visited[d] = 0 + } + } + } + } + + function perm(m, n) { + if(n === 0) return 1 + let res = 1 + for(let i = 0; i < n; i++) { + res *= m - i + } + return res + } +}; From ff475e3e3a5e6a6039684554fd532f4da6b13f27 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 16 Oct 2024 15:22:18 +0800 Subject: [PATCH 1840/2039] Create 2719-count-of-integers.js --- 2719-count-of-integers.js | 59 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 2719-count-of-integers.js diff --git a/2719-count-of-integers.js b/2719-count-of-integers.js new file mode 100644 index 00000000..0dae13c5 --- /dev/null +++ b/2719-count-of-integers.js @@ -0,0 +1,59 @@ +/** + * @param {string} num1 + * @param {string} num2 + * @param {number} min_sum + * @param {number} max_sum + * @return {number} + */ +const count = function (num1, num2, min_sum, max_sum) { + const mod = 1e9 + 7 + let res = 0 + res = + (cntNoGreater(num2, max_sum) - cntNoGreater(num2, min_sum - 1) + mod) % mod - + (cntNoGreater(num1, max_sum) - cntNoGreater(num1, min_sum - 1) + mod) % mod + res = (res + mod) % mod + const sum1 = calc(num1) + if (sum1 >= min_sum && sum1 <= max_sum) { + res = (res + 1) % mod + } + + return res + + function cntNoGreater(num, maxSum) { + const memo = Array.from({ length: 2 }, () => + Array.from({ length: 23 }, () => Array(401).fill(-1)) + ) + return dfs(num, maxSum, 0, 0, 1, memo) + } + function dfs(num, maxSum, idx, sum, isSame, memo) { + if(sum > maxSum) { + return 0 + } + if (idx === num.length) { + return 1 + } + if(memo[isSame][idx][sum] !== -1) { + return memo[isSame][idx][sum] + } + let res = 0 + if(isSame) { + for(let i = 0; i < num[idx]; i++) { + res = (res + dfs(num, maxSum, idx + 1, sum + i, 0, memo)) % mod + } + res = (res + dfs(num, maxSum, idx + 1, sum + +num[idx], 1, memo)) % mod + } else { + for (let i = 0; i <= 9; i++) { + res = (res + dfs(num, maxSum, idx + 1, sum + i, 0, memo)) % mod + } + } + + return memo[isSame][idx][sum] = res + } + function calc(num) { + let res = 0 + for (const e of num) { + res += +e + } + return res + } +} From f8f14d7fda468276539f0704f097dc56e383ed81 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 17 Oct 2024 15:14:08 +0800 Subject: [PATCH 1841/2039] Update 2801-count-stepping-numbers-in-range.js --- 2801-count-stepping-numbers-in-range.js | 62 +++++++++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/2801-count-stepping-numbers-in-range.js b/2801-count-stepping-numbers-in-range.js index 27af38b6..17ea13df 100644 --- a/2801-count-stepping-numbers-in-range.js +++ b/2801-count-stepping-numbers-in-range.js @@ -109,3 +109,65 @@ const countSteppingNumbers = (low, high) => { return minus_mod(x, y, mod); }; +// another + + +/** + * @param {string} low + * @param {string} high + * @return {number} + */ +const countSteppingNumbers = function(low, high) { + const mod = 1e9 + 7 + let res = 0 + res = (helper(high) - helper(low) + isSteppingNumber(low) + mod) % mod + + return res + + function helper(num) { + let res = 0 + const n = num.length + const memo = Array.from({ length: 2 }, () => Array.from({ length: 11 }, () => Array.from({ length: n + 1 }, () => -1))) + for (let len = 1; len < n; len++) { + for(let i = 1; i < 10; i++){ + res = (res + dfs(len - 1, i, false, num, memo)) % mod + } + } + const d = num[0] - '0' + for(let i = 1; i < d; i++){ + res = (res + dfs(n - 1, i, false, num, memo)) % mod + } + res = (res + dfs(n - 1, d, true, num, memo)) % mod + return res + } + function dfs(len, prev, isSame, num, memo) { + if(len === 0) return 1 + if(memo[+isSame][prev][len] !== -1) return memo[+isSame][prev][len] + let res = 0 + if(isSame){ + const d = num[num.length - len] - '0' + if(prev + 1 < d) res = (res + dfs(len - 1, prev + 1, false, num, memo)) % mod + else if(prev + 1 === d) res = (res + dfs(len - 1, prev + 1, true, num, memo)) % mod + if(prev - 1 >= 0 && prev - 1 < d) res = (res + dfs(len - 1, prev - 1, false, num, memo)) % mod + else if(prev - 1 === d) res = (res + dfs(len - 1, prev - 1, true, num, memo)) % mod + + + } else { + if(prev + 1 < 10) res = (res + dfs(len - 1, prev + 1, false, num, memo)) % mod + if(prev - 1 >= 0) res = (res + dfs(len - 1, prev - 1, false, num, memo)) % mod + } + + memo[+isSame][prev][len] = res + + return res + } + function isSteppingNumber(num){ + if(num.length === 1) return 1 + for(let i = 1; i < num.length; i++){ + if(Math.abs(num[i] - num[i - 1]) !== 1) return 0 + } + return 1 + } +}; + + From d5950f84b308c3e5fe531ac80affcdc4c59daa68 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 21 Oct 2024 21:04:49 +0800 Subject: [PATCH 1842/2039] Create 3258-count-substrings-that-satisfy-k-constraint-i.js --- ...-substrings-that-satisfy-k-constraint-i.js | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 3258-count-substrings-that-satisfy-k-constraint-i.js diff --git a/3258-count-substrings-that-satisfy-k-constraint-i.js b/3258-count-substrings-that-satisfy-k-constraint-i.js new file mode 100644 index 00000000..af54fbc5 --- /dev/null +++ b/3258-count-substrings-that-satisfy-k-constraint-i.js @@ -0,0 +1,27 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var countKConstraintSubstrings = function(s, k) { + let res = 0 + const n = s.length + for(let len = 1; len <= n; len++) { + for(let j = 0; j + len <= n; j++) { + const sub = s.slice(j, j + len) + if(valid(sub)) res++ + } + } + + return res + + function valid(str) { + let one = 0 + const n = str.length + for(const e of str) { + if(e === '1') one++ + } + + return one <= k || n - one <= k + } +}; From 0aeb8d9074da769c836d8aef5e6805902d12f3c4 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 22 Oct 2024 13:30:16 +0800 Subject: [PATCH 1843/2039] Update 3258-count-substrings-that-satisfy-k-constraint-i.js --- ...-substrings-that-satisfy-k-constraint-i.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/3258-count-substrings-that-satisfy-k-constraint-i.js b/3258-count-substrings-that-satisfy-k-constraint-i.js index af54fbc5..04445896 100644 --- a/3258-count-substrings-that-satisfy-k-constraint-i.js +++ b/3258-count-substrings-that-satisfy-k-constraint-i.js @@ -1,3 +1,33 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +const countKConstraintSubstrings = function (s, k) { + const n = s.length + let res = 0, + l = 0, + r = 0, + zero = 0, + one = 0 + while (r < n) { + if (s[r] === "0") zero++ + else one++ + while (zero > k && one > k) { + if (s[l] === "0") zero-- + else one-- + l++ + } + res += r - l + 1 + r++ + } + + return res +} + +// another + + /** * @param {string} s * @param {number} k From 8d0ac4060478fd39a2be9c84dfb71166e4e9a30d Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 24 Oct 2024 15:46:36 +0800 Subject: [PATCH 1844/2039] Update 76-minimum-window-substring.js --- 76-minimum-window-substring.js | 38 ++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/76-minimum-window-substring.js b/76-minimum-window-substring.js index a6fbcb99..7b3ac3e1 100644 --- a/76-minimum-window-substring.js +++ b/76-minimum-window-substring.js @@ -1,3 +1,41 @@ +/** + * @param {string} s + * @param {string} t + * @return {string} + */ +var minWindow = function(s, t) { + const a = 'a'.charCodeAt(0) + const A = 'A'.charCodeAt(0) + const arr = new Array(52).fill(0) + const n = s.length + const idx = (ch) => { + const code = ch.charCodeAt(0) + return code - (code >= a ? a : A) + (code >= a ? 26 : 0) + } + for (const ch of t) { + arr[idx(ch)]++ + } + let l = 0, r = 0 + let res = '' + while(r < n) { + const i = idx(s[r]) + arr[i]-- + while(l < r && arr[idx(s[l])] < 0) { + arr[idx(s[l])]++ + l++ + } + const tmp = s.slice(l, r + 1) + if(arr.every(x => x <= 0) && (res === '' || tmp.length < res.length)) { + res = tmp + } + r++ + } + + return res +}; + +// another + /** * @param {string} s * @param {string} t From a8f1e1675da9a69bfc4a1b5f1030075e2643b87f Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 24 Oct 2024 17:14:24 +0800 Subject: [PATCH 1845/2039] Update 992-subarrays-with-k-different-integers.js --- 992-subarrays-with-k-different-integers.js | 31 ++++++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/992-subarrays-with-k-different-integers.js b/992-subarrays-with-k-different-integers.js index 921973e8..21afa918 100644 --- a/992-subarrays-with-k-different-integers.js +++ b/992-subarrays-with-k-different-integers.js @@ -108,3 +108,34 @@ const subarraysWithKDistinct = function (A, K) { } } +// another + +const subarraysWithKDistinct = function (nums, k) { + const n = nums.length + const atMost = (k) => { + const freq = new Array(n + 1).fill(0) + let l = 0, + r = 0 + let res = 0 + let cnt = 0 + while (r < n) { + if (freq[nums[r]] === 0) { + cnt++ + } + freq[nums[r]]++ + while (cnt > k) { + freq[nums[l]]-- + if (freq[nums[l]] === 0) { + cnt-- + } + l++ + } + res += r - l + 1 + r++ + } + return res + } + return atMost(k) - atMost(k - 1) +} + + From 4e9105a593a67341de9dfab00e0742da5534de67 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 25 Oct 2024 11:48:46 +0800 Subject: [PATCH 1846/2039] Update 3-longest-substring-without-repeating-characters.js --- ...-substring-without-repeating-characters.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) diff --git a/3-longest-substring-without-repeating-characters.js b/3-longest-substring-without-repeating-characters.js index d345eadf..773dc4ff 100755 --- a/3-longest-substring-without-repeating-characters.js +++ b/3-longest-substring-without-repeating-characters.js @@ -40,6 +40,36 @@ const lengthOfLongestSubstring = function(s) { // another +/** + * @param {string} s + * @return {number} + */ +const lengthOfLongestSubstring = function(s) { + const n = s.length, hash = {} + let res = 0 + let l = 0, r = 0 + while(r < n) { + const ch = s[r] + if(hash[ch] == null) hash[ch] = 0 + hash[ch]++ + while(hash[s[l]] > 1) { + hash[s[l]]-- + l++ + } + while(l <= r && Object.keys(hash).length !== r - l + 1) { + hash[s[l]]-- + if(hash[s[l]] === 0) delete hash[s[l]] + l++ + } + res = Math.max(res, r - l + 1) + r++ + } + + return res +}; + +// another + /** * @param {string} s * @return {number} From ae3212f1d1fb4b48c821bb3a0d4310a67263a539 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Oct 2024 03:15:26 -0700 Subject: [PATCH 1847/2039] Create 3337-total-characters-in-string-after-transformations-ii.js --- ...ters-in-string-after-transformations-ii.js | 76 +++++++++++++++++++ 1 file changed, 76 insertions(+) create mode 100644 3337-total-characters-in-string-after-transformations-ii.js diff --git a/3337-total-characters-in-string-after-transformations-ii.js b/3337-total-characters-in-string-after-transformations-ii.js new file mode 100644 index 00000000..c0bab8a1 --- /dev/null +++ b/3337-total-characters-in-string-after-transformations-ii.js @@ -0,0 +1,76 @@ +const MOD = 1e9 + 7; +const MODn = BigInt(MOD); +/** + * @param {string} s + * @param {number} t + * @param {number[]} nums + * @return {number} + */ +var lengthAfterTransformations = function(s, t, nums) { + let vec = new Array(26).fill(0); + for(let i = 0; i < s.length; ++i) { + let chr = s.charCodeAt(i) - 'a'.charCodeAt(0); + vec[chr] += 1; + } + let mat = new Array(26).fill(0).map(_ => new Array(26).fill(0n)); + for(let i = 0; i < 26; ++i) { + let count = nums[i]; + let j = (i + 1) % 26; + while(count > 0) { + mat[i][j] = 1n; + --count; + + j = (j + 1) % 26; + } + + } + + mat = matPow(mat, t); + let result = 0; + for(let i = 0; i < 26; ++i) { + for(let j = 0; j < 26; ++j) { + result += vec[i] * Number(mat[i][j]); + } + result = result % MOD; + } + + return result; +}; + + + +function multiplyInto(mat1, mat2, output, tmp) { + + for(let i = 0; i < output.length; ++i) { + for(let j = 0; j < output[0].length; ++j) { + let result = 0n; + for(let k = 0; k < output.length; ++k) { + result += mat1[i][k] * mat2[k][j]; + result %= MODn; + } + tmp[i][j] = result; + } + } + + for(let i = 0; i < output.length; ++i) { + for(let j = 0; j < output[0].length; ++j) { + output[i][j] = tmp[i][j]; + } + } +} + +function matPow(mat, exp) { + const result = new Array(mat.length).fill(0).map(_ => mat[0].slice(0).fill(0n)); + const tmp = new Array(mat.length).fill(0).map(_ => mat[0].slice(0)); + for(let i = 0; i < result.length; ++i) { + result[i][i] = 1n; + } + + while (exp) { + if (exp & 1) { multiplyInto(mat, result, result, tmp); } + multiplyInto(mat, mat, mat, tmp); + exp >>>= 1; + } + + return result; +} From f4834577772f5b917eb5aeee5ef18cf072397ddf Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Oct 2024 03:16:01 -0700 Subject: [PATCH 1848/2039] Create 3336-find-the-number-of-subsequences-with-equal-gcd.js --- ...e-number-of-subsequences-with-equal-gcd.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 3336-find-the-number-of-subsequences-with-equal-gcd.js diff --git a/3336-find-the-number-of-subsequences-with-equal-gcd.js b/3336-find-the-number-of-subsequences-with-equal-gcd.js new file mode 100644 index 00000000..68092e4e --- /dev/null +++ b/3336-find-the-number-of-subsequences-with-equal-gcd.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var subsequencePairCount = function(nums) { + const a = nums + let n = a.length, + ans = 0, + M = 1e9 + 7, + dp = Array.from({ length: n }, () => + Array.from({ length: 1 + Math.max(...a) }, () => + new Array(1 + Math.max(...a)).fill(-1) + ) + ) + + let recu = (idx, gcd_1, gcd_2) => { + if (idx === n) + return (gcd_1 === gcd_2 && gcd_1 !== 0) + + if (dp.at(idx).at(gcd_1).at(gcd_2) !== -1) + return dp.at(idx).at(gcd_1).at(gcd_2) + + let ans = recu(idx + 1, gcd_1, gcd_2) + + recu(idx + 1, Math.gcd(gcd_1, a.at(idx)), gcd_2) + + recu(idx + 1, gcd_1, Math.gcd(gcd_2, a.at(idx))) + ans %= M + + return dp[idx][gcd_1][gcd_2] = ans + } + + return recu(0, 0, 0) +}; +Math.gcd = function(a, b) { + if (b === 0) + return a + return Math.gcd(b, a % b) +} From 93791f9eb6fa6bd3b317293edf170e56c5da8f57 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Oct 2024 03:16:29 -0700 Subject: [PATCH 1849/2039] Create 3335-total-characters-in-string-after-transformations-i.js --- ...cters-in-string-after-transformations-i.js | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 3335-total-characters-in-string-after-transformations-i.js diff --git a/3335-total-characters-in-string-after-transformations-i.js b/3335-total-characters-in-string-after-transformations-i.js new file mode 100644 index 00000000..6e029569 --- /dev/null +++ b/3335-total-characters-in-string-after-transformations-i.js @@ -0,0 +1,25 @@ +/** + * @param {string} s + * @param {number} t + * @return {number} + */ +var lengthAfterTransformations = function (s, t) { + const MOD = 10 ** 9 + 7 + let charCounts = new Array(26).fill(0) + + for (const c of s) { + charCounts[c.charCodeAt(0) - 'a'.charCodeAt(0)] += 1 + } + + for (let i = 0; i < t; i++) { + const newCounts = new Array(26).fill(0) + for (let j = 0; j < 25; j++) { + newCounts[j + 1] += charCounts[j] + } + newCounts[0] = (newCounts[0] + charCounts[25]) % MOD + newCounts[1] = (newCounts[1] + charCounts[25]) % MOD + charCounts = newCounts + } + + return charCounts.reduce((a, b) => (a + b) % MOD, 0) +} From 3c5c9acf078a42b20e4f74e16f0b3110f0c24541 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 27 Oct 2024 03:16:57 -0700 Subject: [PATCH 1850/2039] Create 3334-find-the-maximum-factor-score-of-array.js --- ...-find-the-maximum-factor-score-of-array.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 3334-find-the-maximum-factor-score-of-array.js diff --git a/3334-find-the-maximum-factor-score-of-array.js b/3334-find-the-maximum-factor-score-of-array.js new file mode 100644 index 00000000..eab4ecba --- /dev/null +++ b/3334-find-the-maximum-factor-score-of-array.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxScore = function (nums) { + const n = nums.length + if (n === 1) { + return nums[0] * nums[0] + } + + const totalGcd = gcdOfArray(nums) + const totalLcm = lcmOfArray(nums) + let res = totalGcd * totalLcm + + for (let i = 0; i < n; i++) { + const remaining = nums.slice(0, i).concat(nums.slice(i + 1)) + const currentGcd = gcdOfArray(remaining) + const currentLcm = lcmOfArray(remaining) + res = Math.max(res, currentGcd * currentLcm) + } + + return res +} + +function lcm(a, b) { + return (a / gcd(a, b)) * b +} +function gcd(a, b) { + return b ? gcd(b, a % b) : a +} + +function lcmOfArray(arr) { + return arr.reduce((acc, val) => lcm(acc, val)) +} + +function gcdOfArray(arr) { + return arr.reduce((acc, val) => gcd(acc, val)) +} + From 7ad535dc1228124484f03737278743e003427a07 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 28 Oct 2024 13:19:43 +0800 Subject: [PATCH 1851/2039] Update 2537-count-the-number-of-good-subarrays.js --- 2537-count-the-number-of-good-subarrays.js | 40 ++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/2537-count-the-number-of-good-subarrays.js b/2537-count-the-number-of-good-subarrays.js index 8eb898ce..59b89eff 100644 --- a/2537-count-the-number-of-good-subarrays.js +++ b/2537-count-the-number-of-good-subarrays.js @@ -81,3 +81,43 @@ const countGood = function(nums, k) { } return res; }; + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const countGood = function(nums, k) { + let res = 0 + let total = 0 + let i = 0, j = 0 + const n = nums.length + const cnt = {} + while(i < n) { + while(j < n && total < k) { + total += calc(cnt, nums[j], 1) + cnt[nums[j]] = (cnt[nums[j]] || 0) + 1 + j++ + } + if(total >= k) { + res += n - j + 1 + } + total += calc(cnt, nums[i], -1) + cnt[nums[i]]-- + + i++ + } + + return res + + function calc(cnt, num, delta) { + const tmp = cnt[num] || 0 + let res = tmp * (tmp - 1) / 2 + const tmp1 = tmp + delta + const tmp2 = tmp1 * (tmp1 - 1) / 2 + res = tmp2 - res + return res + } +}; From 282c827a2ed3c95d4ad373ac6265021223a799b8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 29 Oct 2024 13:46:05 +0800 Subject: [PATCH 1852/2039] Update 3134-find-the-median-of-the-uniqueness-array.js --- ...find-the-median-of-the-uniqueness-array.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/3134-find-the-median-of-the-uniqueness-array.js b/3134-find-the-median-of-the-uniqueness-array.js index 9e7dce3c..0bdfa43b 100644 --- a/3134-find-the-median-of-the-uniqueness-array.js +++ b/3134-find-the-median-of-the-uniqueness-array.js @@ -1,3 +1,52 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const medianOfUniquenessArray = function(nums) { + const n = nums.length; + const {floor} = Math; + const total = (n * (n + 1)) / 2; + const half = floor((total + 1) / 2); + let l = 1, r = n + while(l < r) { + const mid = l + floor((r - l) / 2); + if (atMostK(nums, mid) >= half) { + r = mid; + } else { + l = mid + 1; + } + } + return l + + function atMostK(nums, k) { + const hash = new Map(), n = nums.length; + let res = 0 + let i = 0, j = 0 + while(j < n) { + const e = nums[j] + if(!hash.has(e)) hash.set(e, 0) + hash.set(e, hash.get(e) + 1) + while(i < j && hash.size > k) { + + hash.set(nums[i], hash.get(nums[i]) - 1) + if(hash.get(nums[i]) === 0) { + hash.delete(nums[i]) + } + i++ + } + res += j - i + 1 + + j++ + } + + return res + } +}; + + +// another + + /** * @param {number[]} nums * @return {number} From 73cf5d1faf65ecb87feed2d59cf90c2d0820a638 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 31 Oct 2024 13:42:37 +0800 Subject: [PATCH 1853/2039] Update 3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js --- ...an-be-rearranged-to-contain-a-string-ii.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) diff --git a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js index 6c77b42b..a21dc780 100644 --- a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js +++ b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js @@ -47,3 +47,44 @@ var validSubstringCount = function (word1, word2) { return res } + +// another + +/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +const validSubstringCount = function(word1, word2) { + const n = word1.length; + const target = Array(26).fill(0); + const a = 'a'.charCodeAt(0); + for(const ch of word2) { + target[ch.charCodeAt(0) - a]++; + } + const cur = Array(26).fill(0); + let j = 0 + let res = 0 + for(let i = 0; i < n; i++) { + const e = word1[i].charCodeAt(0) - a + while(j < n && !valid(cur, target)) { + cur[word1[j].charCodeAt(0) - a]++; + j++ + } + if(valid(cur, target)) { + res += (n - 1) - (j - 1) + 1 + } + cur[e]--; + } + + return res + + function valid(arr, target) { + for(let i = 0; i < 26; i++) { + if(arr[i] < target[i]) { + return false; + } + } + return true; + } +}; From fae5fc7b009bcb1b9e3f597a45741cf749e09635 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 31 Oct 2024 15:24:09 +0800 Subject: [PATCH 1854/2039] Update 3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js --- ...an-be-rearranged-to-contain-a-string-ii.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js index a21dc780..0111f0d6 100644 --- a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js +++ b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js @@ -1,3 +1,26 @@ +function validSubstringCount(w1, w2) { + const cnt = {}; + for (const ch of w2) { + cnt[ch] = (cnt[ch] || 0) + 1; + } + let match = Object.keys(cnt).length, res = 0, j = 0; + + for (let i = 0; i < w1.length; i++) { + cnt[w1[i]] = (cnt[w1[i]] || 0) - 1; + match -= cnt[w1[i]] === 0 ? 1 : 0; + + while (match === 0) { + res += w1.length - i; + match += cnt[w1[j]] === 0 ? 1 : 0; + cnt[w1[j]] = (cnt[w1[j]] || 0) + 1; + j++; + } + } + return res; +} + +// another + /** * @param {string} word1 * @param {string} word2 From 3ad902aa8a1a1f1a1feb13596c47342e50983095 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 31 Oct 2024 15:39:25 +0800 Subject: [PATCH 1855/2039] Update 3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js --- ...an-be-rearranged-to-contain-a-string-ii.js | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js index 0111f0d6..9de78eab 100644 --- a/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js +++ b/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.js @@ -1,3 +1,46 @@ +/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +const validSubstringCount = function(word1, word2) { + const n = word1.length; + const target = Array(26).fill(0); + const a = 'a'.charCodeAt(0); + for(const ch of word2) { + target[ch.charCodeAt(0) - a]++; + } + const targetCnt = target.reduce((acc, cur) => acc += cur > 0 ? 1 : 0, 0); + const cur = Array(26).fill(0); + + let j = 0 + let cnt = 0 + let res = 0 + for(let i = 0; i < n; i++) { + const e = word1[i].charCodeAt(0) - a + while(j < n && cnt < targetCnt) { + const idx= word1[j].charCodeAt(0) - a; + cur[idx]++; + if(cur[idx] === target[idx]) { + cnt++; + } + j++ + } + if(cnt === targetCnt) { + res += (n - 1) - (j - 1) + 1 + } + cur[e]--; + if(cur[e] === target[e] - 1) { + cnt--; + } + } + return res +}; + +// another + + + function validSubstringCount(w1, w2) { const cnt = {}; for (const ch of w2) { From 0c66305a06c56d921c0cc37126092dbcd86915e8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Nov 2024 12:45:36 +0800 Subject: [PATCH 1856/2039] Create 3093-longest-common-suffix-queries.js --- 3093-longest-common-suffix-queries.js | 55 +++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 3093-longest-common-suffix-queries.js diff --git a/3093-longest-common-suffix-queries.js b/3093-longest-common-suffix-queries.js new file mode 100644 index 00000000..61abc5d8 --- /dev/null +++ b/3093-longest-common-suffix-queries.js @@ -0,0 +1,55 @@ +/** + * @param {string[]} wordsContainer + * @param {string[]} wordsQuery + * @return {number[]} + */ +const stringIndices = function(wordsContainer, wordsQuery) { + const root = new TrieNode(); + const arr = [] + for (let i = 0; i < wordsContainer.length; i++) { + arr.push({ word: wordsContainer[i], index: i }); + } + arr.sort((a, b) => { + if (a.word.length !== b.word.length) return a.word.length - b.word.length; + else return a.index - b.index; + }) + for(let i = arr.length - 1; i >= 0; i--) { + let node = root; + const s = arr[i].word; + for(let j = s.length - 1; j >= 0; j--) { + const charIndex = s[j].charCodeAt(0) - 'a'.charCodeAt(0); + if(node.next[charIndex] === null) { + node.next[charIndex] = new TrieNode(); + } + node = node.next[charIndex]; + node.idx = arr[i].index; + } + } + root.idx = arr[0].index; + const res = [] + for(const query of wordsQuery) { + let node = root; + let ans = -1; + for(let i = query.length - 1; i >= 0; i--) { + const charIndex = query[i].charCodeAt(0) - 'a'.charCodeAt(0); + if(node.next[charIndex] !== null) { + node = node.next[charIndex]; + } else { + ans = node.idx; + break; + } + } + if(ans === -1) { + ans = node.idx; + } + res.push(ans); + } + return res; +}; + +class TrieNode { + constructor() { + this.next = new Array(26).fill(null); + this.idx = -1; + } +} From d02d1cb693291cc183123893800d5e2e4cb2193c Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Nov 2024 12:51:31 +0800 Subject: [PATCH 1857/2039] Update 3093-longest-common-suffix-queries.js --- 3093-longest-common-suffix-queries.js | 87 +++++++++++++-------------- 1 file changed, 43 insertions(+), 44 deletions(-) diff --git a/3093-longest-common-suffix-queries.js b/3093-longest-common-suffix-queries.js index 61abc5d8..1866b181 100644 --- a/3093-longest-common-suffix-queries.js +++ b/3093-longest-common-suffix-queries.js @@ -3,53 +3,52 @@ * @param {string[]} wordsQuery * @return {number[]} */ -const stringIndices = function(wordsContainer, wordsQuery) { - const root = new TrieNode(); +const stringIndices = function (wordsContainer, wordsQuery) { + const root = new TrieNode() const arr = [] - for (let i = 0; i < wordsContainer.length; i++) { - arr.push({ word: wordsContainer[i], index: i }); + for (let i = 0; i < wordsContainer.length; i++) { + arr.push({ word: wordsContainer[i], index: i }) + } + arr.sort((a, b) => { + if (a.word.length !== b.word.length) return a.word.length - b.word.length + else return a.index - b.index + }) + for (let i = arr.length - 1; i >= 0; i--) { + let node = root + const s = arr[i].word + for (let j = s.length - 1; j >= 0; j--) { + const charIndex = s[j].charCodeAt(0) - 'a'.charCodeAt(0) + if (node.next[charIndex] === null) { + node.next[charIndex] = new TrieNode() + } + node = node.next[charIndex] + node.idx = arr[i].index } - arr.sort((a, b) => { - if (a.word.length !== b.word.length) return a.word.length - b.word.length; - else return a.index - b.index; - }) - for(let i = arr.length - 1; i >= 0; i--) { - let node = root; - const s = arr[i].word; - for(let j = s.length - 1; j >= 0; j--) { - const charIndex = s[j].charCodeAt(0) - 'a'.charCodeAt(0); - if(node.next[charIndex] === null) { - node.next[charIndex] = new TrieNode(); - } - node = node.next[charIndex]; - node.idx = arr[i].index; - } + } + root.idx = arr[0].index + const res = [] + for (const query of wordsQuery) { + let node = root + let ans = -1 + for (let i = query.length - 1; i >= 0; i--) { + const charIndex = query[i].charCodeAt(0) - 'a'.charCodeAt(0) + if (node.next[charIndex] !== null) { + node = node.next[charIndex] + } else { + break + } } - root.idx = arr[0].index; - const res = [] - for(const query of wordsQuery) { - let node = root; - let ans = -1; - for(let i = query.length - 1; i >= 0; i--) { - const charIndex = query[i].charCodeAt(0) - 'a'.charCodeAt(0); - if(node.next[charIndex] !== null) { - node = node.next[charIndex]; - } else { - ans = node.idx; - break; - } - } - if(ans === -1) { - ans = node.idx; - } - res.push(ans); - } - return res; -}; + + ans = node.idx + + res.push(ans) + } + return res +} class TrieNode { - constructor() { - this.next = new Array(26).fill(null); - this.idx = -1; - } + constructor() { + this.next = new Array(26).fill(null) + this.idx = -1 + } } From 5e7d7b36ff4922ead2fd98a7b0f632124cf6f31d Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 5 Nov 2024 17:00:05 +0800 Subject: [PATCH 1858/2039] Update 3076-shortest-uncommon-substring-in-an-array.js --- ...shortest-uncommon-substring-in-an-array.js | 65 +++++++++++++++++++ 1 file changed, 65 insertions(+) diff --git a/3076-shortest-uncommon-substring-in-an-array.js b/3076-shortest-uncommon-substring-in-an-array.js index 9a5ad533..51afd4bf 100644 --- a/3076-shortest-uncommon-substring-in-an-array.js +++ b/3076-shortest-uncommon-substring-in-an-array.js @@ -1,3 +1,68 @@ +/** + * @param {string[]} arr + * @return {string[]} + */ +const shortestSubstrings = function (arr) { + const ans = [] + const head = new Node() + for (const s of arr) { + for (let i = 0; i < s.length; ++i) add(head, s, i) + } + for (const s of arr) { + let res = s + s + for (let i = 0; i < s.length; ++i) remove(head, s, i) + for (let i = 0; i < s.length; ++i) { + const t = check(head, s, i) + if (t.length < res.length || (t.length === res.length && t < res)) res = t + } + ans.push(res.length <= s.length ? res : "") + // add back the current string to the trie + for (let i = 0; i < s.length; ++i) add(head, s, i) + } + return ans + + function add(head, s, ind) { + let ptr = head + for (let i = ind; i < s.length; ++i) { + const c = s.charCodeAt(i) - "a".charCodeAt(0) + if (ptr.child[c] === null) ptr.child[c] = new Node() + ptr = ptr.child[c] + ptr.count++ + } + } + + function remove(head, s, ind) { + let ptr = head + for (let i = ind; i < s.length; ++i) { + ptr = ptr.child[s.charCodeAt(i) - "a".charCodeAt(0)] + ptr.count-- + } + } + + function check(head, s, ind) { + let ptr = head + let ans = "" + for (let i = ind; i < s.length; ++i) { + const c = s.charCodeAt(i) - "a".charCodeAt(0) + if (ptr.child[c] === null) return ans + ans += s[i] + ptr = ptr.child[c] + if (ptr.count < 1) return ans + } + return s + s + } +} + +class Node { + constructor() { + this.child = new Array(26).fill(null) + this.count = 0 + } +} + +// another + + /** * @param {string[]} arr * @return {string[]} From dc59c61e56ef5ed96f215256157a20d10b551818 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 6 Nov 2024 13:29:01 +0800 Subject: [PATCH 1859/2039] Update 3076-shortest-uncommon-substring-in-an-array.js --- ...shortest-uncommon-substring-in-an-array.js | 64 +++++++++++++++++++ 1 file changed, 64 insertions(+) diff --git a/3076-shortest-uncommon-substring-in-an-array.js b/3076-shortest-uncommon-substring-in-an-array.js index 51afd4bf..5f202f58 100644 --- a/3076-shortest-uncommon-substring-in-an-array.js +++ b/3076-shortest-uncommon-substring-in-an-array.js @@ -1,3 +1,67 @@ +/** + * @param {string[]} arr + * @return {string[]} + */ +const shortestSubstrings = function (arr) { + const root = new Node() + const res = [] + for (const s of arr) { + for (let i = 0; i < s.length; ++i) { + add(root, s, i) + } + } + for (const s of arr) { + const tmpRoot = new Node() + let resStr = s + s + for (let i = 0; i < s.length; ++i) { + add(tmpRoot, s, i) + } + + for (let i = 0; i < s.length; ++i) { + const t = check(root, tmpRoot, s, i) + if ( + t.length < resStr.length || + (t.length === resStr.length && t < resStr) + ) { + resStr = t + } + } + res.push(resStr.length <= s.length ? resStr : "") + } + + return res + function add(node, str, start) { + let ptr = node + for (let i = start; i < str.length; ++i) { + const c = str.charCodeAt(i) - "a".charCodeAt(0) + if (ptr.child[c] === null) ptr.child[c] = new Node() + ptr = ptr.child[c] + ptr.count++ + } + } + function check(root, node, str, start) { + let ptr1 = root + let ptr2 = node + let res = "" + for (let i = start; i < str.length; ++i) { + const chIdx = str.charCodeAt(i) - "a".charCodeAt(0) + res += str[i] + ptr1 = ptr1.child[chIdx] + ptr2 = ptr2.child[chIdx] + if (ptr1.count === ptr2.count) return res + } + return str + str + } +} +class Node { + constructor() { + this.child = new Array(26).fill(null) + this.count = 0 + } +} + +// another + /** * @param {string[]} arr * @return {string[]} From c3e8486c5e7eae9487cd9836a825d6104f522e2e Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 8 Nov 2024 15:03:02 +0800 Subject: [PATCH 1860/2039] Update 778-swim-in-rising-water.js --- 778-swim-in-rising-water.js | 106 ++++++++++++++++++++++++++++++++++++ 1 file changed, 106 insertions(+) diff --git a/778-swim-in-rising-water.js b/778-swim-in-rising-water.js index c39e9372..22e51580 100644 --- a/778-swim-in-rising-water.js +++ b/778-swim-in-rising-water.js @@ -1,3 +1,109 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +const swimInWater = function(grid) { + const pq = new PQ((a, b) => a[0] < b[0]) + const dirs = [ + [0, 1], + [0, -1], + [1, 0], + [-1, 0] + ] + const n = grid.length + const visited = Array.from({ length: n }, () => Array(n).fill(false)) + pq.push([grid[0][0], 0, 0]) + visited[0][0] = true + let res = 0 + + while (!pq.isEmpty()) { + const [h, x, y] = pq.pop() + res = Math.max(res, h) + if (x === n - 1 && y === n - 1) { + return res + } + for (const [dx, dy] of dirs) { + const nx = x + dx + const ny = y + dy + if (nx < 0 || nx >= n || ny < 0 || ny >= n || visited[nx][ny]) { + continue + } + pq.push([grid[nx][ny], nx, ny]) + visited[nx][ny] = true + } + } +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } + } + +// another + /** * @param {number[][]} grid * @return {number} From 68cf95b624d2d66e2b24b8f6bc71a2858c62da05 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Nov 2024 06:05:33 -0800 Subject: [PATCH 1861/2039] Update 787-cheapest-flights-within-k-stops.js --- 787-cheapest-flights-within-k-stops.js | 28 ++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/787-cheapest-flights-within-k-stops.js b/787-cheapest-flights-within-k-stops.js index db9dd6dc..416e42a9 100644 --- a/787-cheapest-flights-within-k-stops.js +++ b/787-cheapest-flights-within-k-stops.js @@ -1,3 +1,31 @@ +/** + * @param {number} n + * @param {number[][]} flights + * @param {number} src + * @param {number} dst + * @param {number} k + * @return {number} + */ +var findCheapestPrice = function(n, flights, src, dst, k) { + let cost = new Array(n).fill(Number.MAX_SAFE_INTEGER); + cost[src] = 0; + + for (let i = 0; i <= k; i++) { + let temp = [...cost]; + for (let [curr, next, price] of flights) { + if (cost[curr] === Number.MAX_SAFE_INTEGER) { + continue; + } + temp[next] = Math.min(temp[next], cost[curr] + price); + } + cost = temp; + } + + return cost[dst] === Number.MAX_SAFE_INTEGER ? -1 : cost[dst]; +}; + +// another + /** * @param {number} n * @param {number[][]} flights From 2dc3c96f6ca65a57cd7197d4f3feebff151e8df9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 9 Nov 2024 06:31:26 -0800 Subject: [PATCH 1862/2039] Update 787-cheapest-flights-within-k-stops.js --- 787-cheapest-flights-within-k-stops.js | 29 +++++++++++++------------- 1 file changed, 14 insertions(+), 15 deletions(-) diff --git a/787-cheapest-flights-within-k-stops.js b/787-cheapest-flights-within-k-stops.js index 416e42a9..ea51e87f 100644 --- a/787-cheapest-flights-within-k-stops.js +++ b/787-cheapest-flights-within-k-stops.js @@ -7,23 +7,22 @@ * @return {number} */ var findCheapestPrice = function(n, flights, src, dst, k) { - let cost = new Array(n).fill(Number.MAX_SAFE_INTEGER); - cost[src] = 0; - - for (let i = 0; i <= k; i++) { - let temp = [...cost]; - for (let [curr, next, price] of flights) { - if (cost[curr] === Number.MAX_SAFE_INTEGER) { - continue; - } - temp[next] = Math.min(temp[next], cost[curr] + price); - } - cost = temp; - } - - return cost[dst] === Number.MAX_SAFE_INTEGER ? -1 : cost[dst]; + let cost = Array(n).fill(Infinity) + cost[src] = 0 + + for(let i = 0; i <= k; i++) { + const tmp = [...cost] + for(const [f, t, p] of flights) { + if(cost[f] === Infinity) continue + tmp[t] = Math.min(tmp[t], cost[f] + p) + } + cost = tmp + } + + return cost[dst] === Infinity ? -1 : cost[dst] }; + // another /** From 154527e1a799ab7c5332b5c1995b385f1d427305 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Nov 2024 12:45:27 +0800 Subject: [PATCH 1863/2039] Create 3349-adjacent-increasing-subarrays-detection-i.js --- ...jacent-increasing-subarrays-detection-i.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3349-adjacent-increasing-subarrays-detection-i.js diff --git a/3349-adjacent-increasing-subarrays-detection-i.js b/3349-adjacent-increasing-subarrays-detection-i.js new file mode 100644 index 00000000..98346711 --- /dev/null +++ b/3349-adjacent-increasing-subarrays-detection-i.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {boolean} + */ +var hasIncreasingSubarrays = function (nums, k) { + const n = nums.length + + for (let i = 0; i <= n - 2 * k; ++i) { + let firstIncreasing = true + let secondIncreasing = true + + for (let j = i; j < i + k - 1; ++j) { + if (nums[j] >= nums[j + 1]) { + firstIncreasing = false + break + } + } + + if (!firstIncreasing) continue + + for (let j = i + k; j < i + 2 * k - 1; ++j) { + if (nums[j] >= nums[j + 1]) { + secondIncreasing = false + break + } + } + + if (firstIncreasing && secondIncreasing) return true + } + + return false +} From 35e3bffffee739bc1bcf002a2e38e7e9a9c8f930 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Nov 2024 12:46:10 +0800 Subject: [PATCH 1864/2039] Create 3350-adjacent-increasing-subarrays-detection-ii.js --- ...acent-increasing-subarrays-detection-ii.js | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 3350-adjacent-increasing-subarrays-detection-ii.js diff --git a/3350-adjacent-increasing-subarrays-detection-ii.js b/3350-adjacent-increasing-subarrays-detection-ii.js new file mode 100644 index 00000000..537a67a3 --- /dev/null +++ b/3350-adjacent-increasing-subarrays-detection-ii.js @@ -0,0 +1,39 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxIncreasingSubarrays = function (nums) { + const n = nums.length + + const increasingRun = new Array(n).fill(1) + for (let i = n - 2; i >= 0; --i) { + if (nums[i] < nums[i + 1]) { + increasingRun[i] = increasingRun[i + 1] + 1 + } + } + + let left = 1, + right = Math.floor(n / 2) + let res = 0 + + while (left <= right) { + const mid = left + Math.floor((right - left) / 2) + let found = false + + for (let i = 0; i <= n - 2 * mid; ++i) { + if (increasingRun[i] >= mid && increasingRun[i + mid] >= mid) { + found = true + break + } + } + + if (found) { + res = mid + left = mid + 1 + } else { + right = mid - 1 + } + } + + return res +} From 6b4f4cf5c576b7a5e011488a58e56aa69f95f283 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Nov 2024 12:47:02 +0800 Subject: [PATCH 1865/2039] Create 3351-sum-of-good-subsequences.js --- 3351-sum-of-good-subsequences.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 3351-sum-of-good-subsequences.js diff --git a/3351-sum-of-good-subsequences.js b/3351-sum-of-good-subsequences.js new file mode 100644 index 00000000..ce62e9df --- /dev/null +++ b/3351-sum-of-good-subsequences.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var sumOfGoodSubsequences = function (nums) { + const mod = 1000000007n; + const MAX = 100005; + const sum = new Array(MAX).fill(0n); + const cnt = new Array(MAX).fill(0n); + + for (let i = nums.length - 1; i >= 0; i--) { + const v = nums[i]; + cnt[v]++; + + const tmp = 1n + cnt[v + 1] + (cnt[v - 1] || 0n); + cnt[v] += cnt[v + 1]; + cnt[v] += cnt[v - 1] || 0n; + + sum[v] += BigInt(v) * tmp; + + sum[v] += sum[v + 1]; + sum[v] += sum[v - 1] || 0n; + + cnt[v] %= mod; + sum[v] %= mod; + } + + return Number(sum.reduce((a, b) => (a + b) % mod, 0n)); +} From 27cff671ca04466f2682f918eb7057cbd8522a1b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Nov 2024 14:33:59 +0800 Subject: [PATCH 1866/2039] Update 3351-sum-of-good-subsequences.js --- 3351-sum-of-good-subsequences.js | 39 ++++++++++++-------------------- 1 file changed, 14 insertions(+), 25 deletions(-) diff --git a/3351-sum-of-good-subsequences.js b/3351-sum-of-good-subsequences.js index ce62e9df..84b8b7a2 100644 --- a/3351-sum-of-good-subsequences.js +++ b/3351-sum-of-good-subsequences.js @@ -2,28 +2,17 @@ * @param {number[]} nums * @return {number} */ -var sumOfGoodSubsequences = function (nums) { - const mod = 1000000007n; - const MAX = 100005; - const sum = new Array(MAX).fill(0n); - const cnt = new Array(MAX).fill(0n); - - for (let i = nums.length - 1; i >= 0; i--) { - const v = nums[i]; - cnt[v]++; - - const tmp = 1n + cnt[v + 1] + (cnt[v - 1] || 0n); - cnt[v] += cnt[v + 1]; - cnt[v] += cnt[v - 1] || 0n; - - sum[v] += BigInt(v) * tmp; - - sum[v] += sum[v + 1]; - sum[v] += sum[v - 1] || 0n; - - cnt[v] %= mod; - sum[v] %= mod; - } - - return Number(sum.reduce((a, b) => (a + b) % mod, 0n)); -} +const sumOfGoodSubsequences = function(nums) { + const limit = 1e5 + 10; + const mod = 1e9 + 7; + const count = Array(limit).fill(0); + const total = Array(limit).fill(0); + let res = 0; + for(const e of nums) { + count[e + 1] = (count[e] + count[e + 1] + count[e + 2] + 1) % mod + const cur = total[e] + total[e + 2] + e * (count[e] + count[e + 2] + 1) + total[e + 1] = (total[e + 1] + cur) % mod + res =(res + cur) % mod + } + return res +}; From 3a115fa586b539e67ec8a5a4efebe5315bd8e98e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 11 Nov 2024 16:27:23 +0800 Subject: [PATCH 1867/2039] Create 3352-count-k-reducible-numbers-less-than-n.js --- 3352-count-k-reducible-numbers-less-than-n.js | 58 +++++++++++++++++++ 1 file changed, 58 insertions(+) create mode 100644 3352-count-k-reducible-numbers-less-than-n.js diff --git a/3352-count-k-reducible-numbers-less-than-n.js b/3352-count-k-reducible-numbers-less-than-n.js new file mode 100644 index 00000000..5ce98c75 --- /dev/null +++ b/3352-count-k-reducible-numbers-less-than-n.js @@ -0,0 +1,58 @@ +const ll = BigInt, + mod = ll(1e9 + 7), + N = 1e4 + 15 +let fact = Array(N).fill(0), + ifact = Array(N).fill(0), + inv = Array(N).fill(0) +const hcomb = (p, q) => (p == 0 && q == 0 ? 1 : comb(p + q - 1, q)) +const comb_init = () => { + fact[0] = ifact[0] = inv[1] = 1n // factorial, inverse factorial + for (let i = 2; i < N; i++) + inv[i] = ((mod - mod / ll(i)) * inv[mod % ll(i)]) % mod + for (let i = 1; i < N; i++) { + fact[i] = (fact[i - 1] * ll(i)) % mod + ifact[i] = (ifact[i - 1] * inv[i]) % mod + } +} + +// combination mod pick k from n +const comb = (n, k) => { + if (n < k || k < 0) return 0 + return (((fact[n] * ifact[k]) % mod) * ifact[n - k]) % mod +} + +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var countKReducibleNumbers = function (s, k) { + let dp = new Array(1000).fill(0) + for (let i = 2; i < 1000; i++) { + dp[i] = dp[bitCnt(i)] + 1 + } + let c1 = 0 + let n = s.length + let res = 0n + comb_init() + for (let i = 0; i < n; i++) { + if (s[i] === "1") { + for (let c2 = 0; c2 < n - i; c2++) { + if (c1 + c2 > 0 && dp[c1 + c2] + 1 <= k) { + res = res + comb(n - i - 1, c2) + } + } + c1++ + } + } + return Number(res % mod) + + function bitCnt(num) { + let cnt = 0 + while (num) { + cnt += num & 1 + num >>= 1 + } + return cnt + } +} From e47fab6385cc88f165bb9e703c44eed4e3d74e4b Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 13 Nov 2024 13:48:01 +0800 Subject: [PATCH 1868/2039] Update 1786-number-of-restricted-paths-from-first-to-last-node.js --- ...estricted-paths-from-first-to-last-node.js | 114 ++++++++++++++++++ 1 file changed, 114 insertions(+) diff --git a/1786-number-of-restricted-paths-from-first-to-last-node.js b/1786-number-of-restricted-paths-from-first-to-last-node.js index 6a80fd88..511174a9 100644 --- a/1786-number-of-restricted-paths-from-first-to-last-node.js +++ b/1786-number-of-restricted-paths-from-first-to-last-node.js @@ -1,3 +1,117 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +const countRestrictedPaths = function(n, edges) { + const g = {} + for (let [u, v, w] of edges) { + g[u] = g[u] || [] + g[u].push([v, w]) + g[v] = g[v] || [] + g[v].push([u, w]) + } + const dist = Array(n + 1).fill(Infinity) + dist[n] = 0 + const pq = new PQ((a, b) => a[0] < b[0]) + pq.push([0, n]) + while(!pq.isEmpty()) { + const [d, u] = pq.pop() + if (d !== dist[u]) continue + for (let [v, w] of (g[u] || [])) { + if (dist[v] > dist[u] + w) { + dist[v] = dist[u] + w + pq.push([dist[v], v]) + } + } + } + const mod = 1e9 + 7 + const memo = Array(n + 1).fill(null) + const dfs = (src) => { + if (memo[src] !== null) return memo[src] + if (src === n) return 1 + let res = 0 + for (let [v, w] of (g[src] || [])) { + if (dist[src] > dist[v]) { + res = (res + dfs(v)) % mod + } + } + return memo[src] = res + } + return dfs(1) +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } + } + +// another + + /** * @param {number} n * @param {number[][]} edges From ad8bff65e31f1bb1b5371c7ca528c6a86b7f634f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Nov 2024 05:21:54 -0800 Subject: [PATCH 1869/2039] Create 3354-make-array-elements-equal-to-zero.js --- 3354-make-array-elements-equal-to-zero.js | 33 +++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3354-make-array-elements-equal-to-zero.js diff --git a/3354-make-array-elements-equal-to-zero.js b/3354-make-array-elements-equal-to-zero.js new file mode 100644 index 00000000..7f7a6c0d --- /dev/null +++ b/3354-make-array-elements-equal-to-zero.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums + * @return {number} + */ +const countValidSelections = function (nums) { + let res = 0 + for (let i = 0; i < nums.length; i++) { + if (nums[i] === 0) { + if (canZeroOut(i, -1)) { + res += 1 + } + if (canZeroOut(i, 1)) { + res += 1 + } + } + } + return res + function canZeroOut(start, direction) { + let tempNums = nums.slice() + let curr = start + + while (curr >= 0 && curr < tempNums.length) { + if (tempNums[curr] === 0) { + curr += direction + } else { + tempNums[curr] -= 1 + direction *= -1 + curr += direction + } + } + return tempNums.every((x) => x === 0) + } +} From 35f6563b677494d7289464ff55288c1e30c393c2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Nov 2024 05:22:27 -0800 Subject: [PATCH 1870/2039] Create 3355-zero-array-transformation-i.js --- 3355-zero-array-transformation-i.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 3355-zero-array-transformation-i.js diff --git a/3355-zero-array-transformation-i.js b/3355-zero-array-transformation-i.js new file mode 100644 index 00000000..db5e35b7 --- /dev/null +++ b/3355-zero-array-transformation-i.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {boolean} + */ +var isZeroArray = function(nums, queries) { + const n = nums.length + const arr = Array(n + 1).fill(0) + for(const [l, r] of queries) { + arr[l]++ + arr[r + 1]-- + } + + for(let i = 1; i <= n; i++) { + arr[i] += arr[i - 1] + } + for(let i = 0; i < n; i++) { + if(nums[i] > arr[i]) return false + } + + return true +}; From 4c69a8f737a85381310ed100229ae27fd222722f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Nov 2024 05:22:54 -0800 Subject: [PATCH 1871/2039] Create 3356-zero-array-transformation-ii.js --- 3356-zero-array-transformation-ii.js | 37 ++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 3356-zero-array-transformation-ii.js diff --git a/3356-zero-array-transformation-ii.js b/3356-zero-array-transformation-ii.js new file mode 100644 index 00000000..eeefa1d4 --- /dev/null +++ b/3356-zero-array-transformation-ii.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var minZeroArray = function (nums, queries) { + if (nums.every((num) => num === 0)) return 0 + const n = nums.length + const delta = new Array(n + 1).fill(0) + + for (let index = 0; index < queries.length; index++) { + const query = queries[index] + const l = query[0] + const r = query[1] + const diff = query[2] + + delta[l] += diff + if (r + 1 < n) { + delta[r + 1] -= diff + } + + let curDiff = 0 + let success = true + + for (let i = 0; i < n; i++) { + curDiff += delta[i] + if (nums[i] > curDiff) { + success = false + break + } + } + + if (!success) continue + return index + 1 + } + return -1 +} From cd33c0f9fd4e79a10c86ebfb4c279feb2ab2a8d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 18 Nov 2024 12:55:44 +0800 Subject: [PATCH 1872/2039] Update 2577-minimum-time-to-visit-a-cell-in-a-grid.js --- ...-minimum-time-to-visit-a-cell-in-a-grid.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2577-minimum-time-to-visit-a-cell-in-a-grid.js b/2577-minimum-time-to-visit-a-cell-in-a-grid.js index 7412633f..765f81e5 100644 --- a/2577-minimum-time-to-visit-a-cell-in-a-grid.js +++ b/2577-minimum-time-to-visit-a-cell-in-a-grid.js @@ -1,3 +1,41 @@ +/** + * @param {number[][]} grid + * @return {number} + */ +var minimumTime = function(grid) { + if(grid[0][0] > 0) return -1 + if(grid[0][1] > 1 && grid[1][0] > 1) return -1 + const m = grid.length, n = grid[0].length; + const pq = new PQ((a, b) => a[0] < b[0]); + pq.push([0, 0, 0]); + const dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]]; + const dist = Array.from({ length: m }, () => Array(n).fill(-1)); + + while (!pq.isEmpty()) { + const [t, i, j] = pq.pop(); + if (dist[i][j] !== -1) continue; + dist[i][j] = t + if (i === m - 1 && j === n - 1) break; + for(const [di, dj] of dirs) { + const ni = i + di, nj = j + dj; + if (ni < 0 || ni >= m || nj < 0 || nj >= n) continue; + if (dist[ni][nj] !== -1) continue; + if(grid[ni][nj] <= t + 1) { + pq.push([t + 1, ni, nj]); + } else if ((grid[ni][nj] - t) % 2 === 0) { + pq.push([grid[ni][nj] + 1, ni, nj]); + } else { + pq.push([grid[ni][nj], ni, nj]); + } + } + } + + return dist[m - 1][n - 1]; +}; + + +// another + class PQ { constructor(comparator = (a, b) => a > b) { this.heap = [] From e0d9cdd5740e1e0ab8eb2abef1fa682cbfabd483 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 19 Nov 2024 15:40:06 +0800 Subject: [PATCH 1873/2039] Update 2662-minimum-cost-of-a-path-with-special-roads.js --- ...nimum-cost-of-a-path-with-special-roads.js | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/2662-minimum-cost-of-a-path-with-special-roads.js b/2662-minimum-cost-of-a-path-with-special-roads.js index ecd4338c..0133ae63 100644 --- a/2662-minimum-cost-of-a-path-with-special-roads.js +++ b/2662-minimum-cost-of-a-path-with-special-roads.js @@ -1,3 +1,41 @@ +/** + * @param {number[]} start + * @param {number[]} target + * @param {number[][]} specialRoads + * @return {number} + */ +const minimumCost = function(start, target, specialRoads) { + const n = specialRoads.length; + let res = Infinity; + const pq = new PQ((a, b) => a[0] < b[0]); + const dist = Array(n).fill(Infinity); + const { abs } = Math; + for(let i = 0; i < n; i++) { + const [x, y, x2, y2, cost] = specialRoads[i]; + dist[i] = abs(start[0] - x) + abs(start[1] - y) + cost; + pq.push([dist[i], i]); + } + res = abs(target[0] - start[0]) + abs(target[1] - start[1]) + while(!pq.isEmpty()) { + const [d, i] = pq.pop(); + if(d !== dist[i]) continue; + const e = specialRoads[i]; + res = Math.min(res, d + abs(target[0] - e[2]) + abs(target[1] - e[3])); + for(let j = 0; j < n; j++) { + const w = abs(e[2] - specialRoads[j][0]) + abs(e[3] - specialRoads[j][1]) + specialRoads[j][4]; + if(d + w < dist[j]) { + dist[j] = d + w; + pq.push([dist[j], j]); + } + } + } + + return res +}; + +// another + + class PQ { constructor(comparator = (a, b) => a > b) { this.heap = [] From 6a80d376f0f13b3758908124e570f4486a632696 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 21 Nov 2024 12:38:17 +0800 Subject: [PATCH 1874/2039] Update 3112-minimum-time-to-visit-disappearing-nodes.js --- ...inimum-time-to-visit-disappearing-nodes.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/3112-minimum-time-to-visit-disappearing-nodes.js b/3112-minimum-time-to-visit-disappearing-nodes.js index 96acaeeb..ec24d5cc 100644 --- a/3112-minimum-time-to-visit-disappearing-nodes.js +++ b/3112-minimum-time-to-visit-disappearing-nodes.js @@ -1,3 +1,35 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} disappear + * @return {number[]} + */ +const minimumTime = function(n, edges, disappear) { + const g = Array.from({ length: n }, () => []) + for (const [u, v, w] of edges) { + g[u].push([v, w]) + g[v].push([u, w]) + } + const pq = new PQ((a, b) => a[1] < b[1]) + pq.push([0, 0]) + const res = Array(n).fill(-1) + while(!pq.isEmpty()) { + const [u, t] = pq.pop() + if (res[u] !== -1) continue + res[u] = t + for(const [v, w] of g[u]) { + if (res[v] === -1 && t + w < disappear[v]) { + pq.push([v, t + w]) + } + } + } + + return res +}; + +// another + + /** * @param {number} n * @param {number[][]} edges From 9b4cdf58c4b6b8a89b1f3b1c617a6e68360339fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 22 Nov 2024 13:06:13 +0800 Subject: [PATCH 1875/2039] Update 3123-find-edges-in-shortest-paths.js --- 3123-find-edges-in-shortest-paths.js | 59 ++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) diff --git a/3123-find-edges-in-shortest-paths.js b/3123-find-edges-in-shortest-paths.js index 670b3013..3694b4ad 100644 --- a/3123-find-edges-in-shortest-paths.js +++ b/3123-find-edges-in-shortest-paths.js @@ -1,3 +1,62 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {boolean[]} + */ +const findAnswer = function (n, edges) { + const m = edges.length + const res = Array(m).fill(false) + const MAX = Number.MAX_SAFE_INTEGER + const g = Array(n) + .fill(null) + .map(() => []) + for (const [u, v, w] of edges) { + g[u].push([v, w]) + g[v].push([u, w]) + } + const dist = Array(n).fill(MAX) + dist[0] = 0 + const pq = new PQ((a, b) => a[1] < b[1]) + pq.push([0, 0]) + while (!pq.isEmpty()) { + const [u, d] = pq.pop() + if (d > dist[u]) continue + for (const [v, w] of g[u]) { + if (dist[v] > d + w) { + dist[v] = d + w + pq.push([v, dist[v]]) + } + } + } + const dist1 = Array(n).fill(MAX) + dist1[n - 1] = 0 + pq.push([n - 1, 0]) + while (!pq.isEmpty()) { + const [u, d] = pq.pop() + if (d > dist1[u]) continue + for (const [v, w] of g[u]) { + if (dist1[v] > d + w) { + dist1[v] = d + w + pq.push([v, dist1[v]]) + } + } + } + for (let i = 0; i < m; i++) { + const [u, v, w] = edges[i] + if ( + dist[u] + dist1[v] + w === dist[n - 1] || + dist[v] + dist1[u] + w === dist[n - 1] + ) { + res[i] = true + } + } + + return res +} + +// another + + /** * @param {number} n * @param {number[][]} edges From b1e7aff6a0cfa61738e2850c59eed5d3487217b9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Nov 2024 02:50:53 -0800 Subject: [PATCH 1876/2039] Create 3342-find-minimum-time-to-reach-last-room-ii.js --- ...find-minimum-time-to-reach-last-room-ii.js | 99 +++++++++++++++++++ 1 file changed, 99 insertions(+) create mode 100644 3342-find-minimum-time-to-reach-last-room-ii.js diff --git a/3342-find-minimum-time-to-reach-last-room-ii.js b/3342-find-minimum-time-to-reach-last-room-ii.js new file mode 100644 index 00000000..ce21d124 --- /dev/null +++ b/3342-find-minimum-time-to-reach-last-room-ii.js @@ -0,0 +1,99 @@ +/** + * @param {number[][]} moveTime + * @return {number} + */ +var minTimeToReach = function (moveTime) { + const a = moveTime + let m = a.length, n = a.at(0).length + + let pq = new _PriorityQueue((x, y) => { + if (x.at(0) !== y.at(0)) return x.at(0) - y.at(0) + if (x.at(2) !== y.at(2)) return x.at(2) - y.at(2) + }) + pq.push([0, 0, 0, 1]) + + let di = new Array(m).fill().map(() => new Array(n).fill(1e15)) + di[0][0] = 0 + + while (pq.size()) { + let fr = pq.top() + pq.pop() + + let d = fr.at(0), x = fr.at(1), y = fr.at(2), st = fr.at(3) + + if (x == m - 1 && y == n - 1) + return d + + new Array([-1, 0], [0, -1], [0, 1], [1, 0]).forEach(([dx, dy]) => { + if (0 <= x + dx && x + dx < m && 0 <= y + dy && y + dy < n) + { + let tmp = Math.max(a.at(x + dx).at(y + dy) - d, 0) + + if (di.at(x + dx).at(y + dy) > d + tmp + st) { + di[x + dx][y + dy] = d + tmp + st + pq.push([di.at(x + dx).at(y + dy), x + dx, y + dy, (st === 1 ? 2 : 1)]) + } + } + }) + } +} + + +// Binary Heap +class _PriorityQueue { + constructor(cmp) { + this.arr = new Array() + this.cmp = cmp || ((a, b) => a - b) + } + + push(x) { + this.arr.push(x) + this.heapifyUp() + } + + heapifyUp() { + let cId = this.size() - 1, + pId = this.parentIndex(cId) + while (cId > 0 && this.cmp(this.arr.at(cId), this.arr.at(pId)) < 0) + { + Math.swap(this.arr, cId, pId) + cId = pId + pId = this.parentIndex(cId) + } + } + + pop() { + if (this.size() === 0) + return + this.arr[0] = this.arr.pop() + this.heapifyDown() + } + + heapifyDown() { + let pId = 0, + lcId = this.leftChildIndex(pId), + rcId = this.rightChildIndex(pId) + while (lcId < this.size()) + { + let sc = lcId + if (rcId < this.size() && this.cmp(this.arr.at(rcId), this.arr.at(lcId)) < 0) + sc = rcId + + if (this.cmp(this.arr.at(pId), this.arr.at(sc)) <= 0) + return + + Math.swap(this.arr, pId, sc) + pId = sc + lcId = this.leftChildIndex(pId) + rcId = this.rightChildIndex(pId) + } + } + + size() { return this.arr.length } + top() { return this.arr.at(0) } + parentIndex = (x) => Math.trunc((x - 1) / 2) + leftChildIndex = (x) => 2 * x + 1 + rightChildIndex = (x) => 2 * x + 2 +} + +Math.swap = (obj, i, j) => [obj[i], obj[j]] = [obj[j], obj[i]] From addc36851bb025571a3e3b5291822bafab5515af Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Nov 2024 03:11:46 -0800 Subject: [PATCH 1877/2039] Create 3367-maximize-sum-of-weights-after-edge-removals.js --- ...mize-sum-of-weights-after-edge-removals.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 3367-maximize-sum-of-weights-after-edge-removals.js diff --git a/3367-maximize-sum-of-weights-after-edge-removals.js b/3367-maximize-sum-of-weights-after-edge-removals.js new file mode 100644 index 00000000..c0c65a96 --- /dev/null +++ b/3367-maximize-sum-of-weights-after-edge-removals.js @@ -0,0 +1,51 @@ +/** + * @param {number[][]} edges + * @param {number} k + * @return {number} + */ +var maximizeSumOfWeights = function(edges, k) { + const n = edges.length + 1; + const g = Array.from({ length: n }, () => ({})); + + for (const [x, y, w] of edges) { + g[x][y] = g[y][x] = w; + } + + function dfs(idx, p) { + const ret = [0, 0]; + const h = []; + + for (const ch in g[idx]) { + if (ch != p) { + const [a, b] = dfs(ch, idx); + h.push([a - b, a, b]); + } + } + + h.sort((a, b) => b[0] - a[0]); // Max-heap simulation + let take = 0; + let take_k = 0; + let leave_k = 0; + let leave = 0; + let ct = 0; + + while (h.length) { + const [_, a, b] = h.pop(); + ct += 1; + if (ct <= k - 1) { + take += b; + } else if (ct === k) { + take_k = b; + leave_k = a; + } else { + leave += a; + } + } + + const v = take + take_k + leave; + const w = take + leave_k + leave + (p !== -1 ? g[p][idx] : 0); + return [v, Math.max(v, w)]; + } + + return dfs(0, -1)[1]; +}; From 36eaa9cf73e3a5161bc189575e004b2b338c10f0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Nov 2024 03:13:07 -0800 Subject: [PATCH 1878/2039] Create 3366-minimum-array-sum.js --- 3366-minimum-array-sum.js | 42 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 3366-minimum-array-sum.js diff --git a/3366-minimum-array-sum.js b/3366-minimum-array-sum.js new file mode 100644 index 00000000..30021e40 --- /dev/null +++ b/3366-minimum-array-sum.js @@ -0,0 +1,42 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} op1 + * @param {number} op2 + * @return {number} + */ +var minArraySum = function(nums, k, op1, op2) { + const n = nums.length; + const cache = new Map(); + + function dp(idx, left1, left2) { + if (idx === n) { + return 0; + } + const key = `${idx},${left1},${left2}`; + if (cache.has(key)) { + return cache.get(key); + } + + let ret = nums[idx] + dp(idx + 1, left1, left2); + if (left1 && left2) { + if (nums[idx] >= k) { + ret = Math.min(ret, Math.floor((nums[idx] - k + 1) / 2) + dp(idx + 1, left1 - 1, left2 - 1)); + } + if (Math.floor((nums[idx] + 1) / 2) >= k) { + ret = Math.min(ret, Math.floor((nums[idx] + 1) / 2) - k + dp(idx + 1, left1 - 1, left2 - 1)); + } + } + if (left1) { + ret = Math.min(ret, Math.floor((nums[idx] + 1) / 2) + dp(idx + 1, left1 - 1, left2)); + } + if (left2 && nums[idx] >= k) { + ret = Math.min(ret, nums[idx] - k + dp(idx + 1, left1, left2 - 1)); + } + + cache.set(key, ret); + return ret; + } + + return dp(0, op1, op2); +}; From c6ae1f195aa96c2458c57bc84345c7823b629042 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Nov 2024 03:13:51 -0800 Subject: [PATCH 1879/2039] Create 3365-rearrange-k-substrings-to-form-target-string.js --- ...ange-k-substrings-to-form-target-string.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 3365-rearrange-k-substrings-to-form-target-string.js diff --git a/3365-rearrange-k-substrings-to-form-target-string.js b/3365-rearrange-k-substrings-to-form-target-string.js new file mode 100644 index 00000000..2d743b98 --- /dev/null +++ b/3365-rearrange-k-substrings-to-form-target-string.js @@ -0,0 +1,31 @@ +/** + * @param {string} s + * @param {string} t + * @param {number} k + * @return {boolean} + */ +var isPossibleToRearrange = function (s, t, k) { + const d = Math.floor(s.length / k) + if (s === t) return true + const map = new Map() + + for (let i = 0; i < s.length; i += d) { + const req = s.substring(i, i + d) + if (map.has(req)) { + map.set(req, map.get(req) + 1) + } else { + map.set(req, 1) + } + } + + for (let i = 0; i < t.length; i += d) { + const tar = t.substring(i, i + d) + if (!map.has(tar)) return false + else if (map.get(tar) < 1) return false + else { + map.set(tar, map.get(tar) - 1) + } + } + + return true +} From 358efc4adcc7ebd70552b965e0c094c899615fb0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 24 Nov 2024 03:14:19 -0800 Subject: [PATCH 1880/2039] Create 3364-minimum-positive-sum-subarray.js --- 3364-minimum-positive-sum-subarray.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 3364-minimum-positive-sum-subarray.js diff --git a/3364-minimum-positive-sum-subarray.js b/3364-minimum-positive-sum-subarray.js new file mode 100644 index 00000000..efec413a --- /dev/null +++ b/3364-minimum-positive-sum-subarray.js @@ -0,0 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} l + * @param {number} r + * @return {number} + */ +var minimumSumSubarray = function (nums, l, r) { + let sum = Infinity + for (let i = l; i <= r; i++) { + sum = Math.min(minPos(nums, i), sum) + } + return sum === Infinity ? -1 : sum +} + +function minPos(num, k) { + let s = 0 + let min = Infinity + for (let i = 0; i < k; i++) { + s += num[i] + } + if (s > 0) min = s + for (let i = k; i < num.length; i++) { + s += num[i] - num[i - k] + if (s > 0) min = Math.min(min, s) + } + return min +} From 6a72cebd0f773a080d3534434f688735532f625f Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 26 Nov 2024 15:47:51 +0800 Subject: [PATCH 1881/2039] Update 210-course-schedule-ii.js --- 210-course-schedule-ii.js | 50 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/210-course-schedule-ii.js b/210-course-schedule-ii.js index 350c4d33..acfd8832 100644 --- a/210-course-schedule-ii.js +++ b/210-course-schedule-ii.js @@ -104,3 +104,53 @@ const findOrder = function(numCourses, prerequisites) { return true } } + +// another + +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @return {number[]} + */ +var findOrder = function(numCourses, prerequisites) { + const inDegree = new Array(numCourses).fill(0); + const graph = {}; + for (let i = 0;i < prerequisites.length;i++) { + const e = prerequisites[i]; + inDegree[e[0]]++; + if (graph[e[1]]) { + graph[e[1]].push(e[0]); + } else { + graph[e[1]] = [e[0]]; + } + } + let q = [] + for (let i = 0;i < inDegree.length;i++) { + if (inDegree[i] === 0) { + q.push(i); + } + } + const res = [] + let count = 0; + while(q.length) { + const tmp = [] + const size = q.length + for(let i = 0;i < size;i++) { + const node = q[i] + res.push(node) + count++ + if (graph[node]) { + for (let j = 0;j < graph[node].length;j++) { + inDegree[graph[node][j]]-- + if (inDegree[graph[node][j]] === 0) { + tmp.push(graph[node][j]) + } + } + } + } + + q = tmp + } + + return count === numCourses ? res : []; +}; From efeceffe1b4e077f17cb82951d4ff12d42adc771 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Nov 2024 12:32:30 +0800 Subject: [PATCH 1882/2039] Update 310-minimum-height-trees.js --- 310-minimum-height-trees.js | 50 +++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/310-minimum-height-trees.js b/310-minimum-height-trees.js index eeaa1111..9bdaed7f 100644 --- a/310-minimum-height-trees.js +++ b/310-minimum-height-trees.js @@ -1,3 +1,53 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +var findMinHeightTrees = function(n, edges) { + if(n === 1) return [0] + if(n === 2) return [0, 1] + const g = {} + const degree = new Array(n).fill(0) + for(const [u, v] of edges) { + degree[u]++ + degree[v]++ + if(g[u] == null) g[u] = [] + if(g[v] == null) g[v] = [] + g[u].push(v) + g[v].push(u) + } + let q = [] + for(let i = 0; i < n; i++) { + if(degree[i] === 1) q.push(i) + } + let cnt = 0 + while(q.length) { + const size = q.length + const tmp = [] + for(let i = 0; i < size; i++) { + const node = q[i] + cnt++ + for(const nxt of (g[node] || [])) { + degree[nxt]-- + if(degree[nxt] === 1) { + tmp.push(nxt) + } + } + } + + q = tmp + if(n - cnt <= 2) break + } + + const res = [] + while(q.length) { + res.push(q.pop()) + } + return res +}; + +// another + /** * @param {number} n * @param {number[][]} edges From 76d4d56494c9d3b00c801f537888b2d0ad36897c Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 28 Nov 2024 12:55:05 +0800 Subject: [PATCH 1883/2039] Update 802-find-eventual-safe-states.js --- 802-find-eventual-safe-states.js | 49 ++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/802-find-eventual-safe-states.js b/802-find-eventual-safe-states.js index f1d74624..14b46cd1 100644 --- a/802-find-eventual-safe-states.js +++ b/802-find-eventual-safe-states.js @@ -1,3 +1,52 @@ +/** + * @param {number[][]} graph + * @return {number[]} + */ +var eventualSafeNodes = function (graph) { + const n = graph.length + const g = {}, + rg = {} + for (let i = 0; i < n; i++) { + const arr = graph[i] + g[i] = new Set(arr) + for (let j of arr) { + if (!rg[j]) { + rg[j] = new Set() + } + rg[j].add(i) + } + } + let q = [] + for (let i = 0; i < n; i++) { + if (g[i].size === 0) { + q.push(i) + } + } + const res = [] + while (q.length) { + const size = q.length + const nxt = [] + for (let i = 0; i < size; i++) { + const node = q[i] + res.push(node) + for (let j of rg[node] || []) { + g[j].delete(node) + if (g[j].size === 0) { + nxt.push(j) + } + } + } + + q = nxt + } + + res.sort((a, b) => a - b) + return res +} + +// another + + /** * @param {number[][]} graph * @return {number[]} From c2a66bad266f8b942f2b8253dfa3df4789ce6265 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Dec 2024 00:27:23 -0800 Subject: [PATCH 1884/2039] Create 3370-smallest-number-with-all-set-bits.js --- 3370-smallest-number-with-all-set-bits.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 3370-smallest-number-with-all-set-bits.js diff --git a/3370-smallest-number-with-all-set-bits.js b/3370-smallest-number-with-all-set-bits.js new file mode 100644 index 00000000..1fecd416 --- /dev/null +++ b/3370-smallest-number-with-all-set-bits.js @@ -0,0 +1,11 @@ +/** + * @param {number} n + * @return {number} + */ +var smallestNumber = function(n) { + let x = n + while ((x & (x + 1)) !== 0) { + x += 1 + } + return x +}; From 49558784037504485c805ec2595702729e2ef2bc Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Dec 2024 00:28:04 -0800 Subject: [PATCH 1885/2039] Create 3371-identify-the-largest-outlier-in-an-array.js --- ...dentify-the-largest-outlier-in-an-array.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3371-identify-the-largest-outlier-in-an-array.js diff --git a/3371-identify-the-largest-outlier-in-an-array.js b/3371-identify-the-largest-outlier-in-an-array.js new file mode 100644 index 00000000..3e6b4784 --- /dev/null +++ b/3371-identify-the-largest-outlier-in-an-array.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var getLargestOutlier = function (nums) { + let totalSum = 0 + for (let num of nums) { + totalSum += num + } + + const freqMap = new Map() + for (let num of nums) { + freqMap.set(num, (freqMap.get(num) || 0) + 1) + } + let res = Number.MIN_SAFE_INTEGER + + for (let sumElement of nums) { + let potentialOutlier = totalSum - 2 * sumElement + + if (freqMap.has(potentialOutlier)) { + if (potentialOutlier === sumElement && freqMap.get(sumElement) < 2) { + continue + } + res = Math.max(res, potentialOutlier) + } + } + return res +} From 5dcbf9ac0c51f88df422a621cf5b2b8e38cb922d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Dec 2024 00:28:36 -0800 Subject: [PATCH 1886/2039] Create 3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.js --- ...f-target-nodes-after-connecting-trees-i.js | 53 +++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.js diff --git a/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.js b/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.js new file mode 100644 index 00000000..d20c097d --- /dev/null +++ b/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.js @@ -0,0 +1,53 @@ +/** + * @param {number[][]} edges1 + * @param {number[][]} edges2 + * @param {number} k + * @return {number[]} + */ +var maxTargetNodes = function (edges1, edges2, k) { + const n = edges1.length + 1 + const m = edges2.length + 1 + + const adj1 = Array.from({ length: n }, () => []) + const adj2 = Array.from({ length: m }, () => []) + + for (const edge of edges1) { + const [u, v] = edge + adj1[u].push(v) + adj1[v].push(u) + } + for (const edge of edges2) { + const [u, v] = edge + adj2[u].push(v) + adj2[v].push(u) + } + + const good1 = new Array(n).fill(0) + const good2 = new Array(m).fill(0) + + for (let i = 0; i < n; i++) { + dfs(i, -1, 0, i, k + 1, good1, adj1) + } + + for (let i = 0; i < m; i++) { + dfs(i, -1, 0, i, k, good2, adj2) + } + + const mx = Math.max(...good2) + + const res = new Array(n) + for (let i = 0; i < n; i++) { + res[i] = good1[i] + mx + } + return res +} + +function dfs(node, parent, distance, root, k, good, adj) { + if (distance >= k) return + good[root]++ + for (const neighbor of adj[node]) { + if (neighbor !== parent) { + dfs(neighbor, node, distance + 1, root, k, good, adj) + } + } +} From 3212f8631cdbd0da3cfc7eee4c1f830e712cfac3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 1 Dec 2024 00:29:13 -0800 Subject: [PATCH 1887/2039] Create 3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii.js --- ...-target-nodes-after-connecting-trees-ii.js | 90 +++++++++++++++++++ 1 file changed, 90 insertions(+) create mode 100644 3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii.js diff --git a/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii.js b/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii.js new file mode 100644 index 00000000..c1ca4e20 --- /dev/null +++ b/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii.js @@ -0,0 +1,90 @@ +class Graph { + constructor(n) { + this.n = n + this.adj = Array.from({ length: n }, () => []) + this.weight = new Map() + for (let i = 0; i < n; i++) { + this.weight.set(i, new Map()) + } + } + + addEdgeOri(i, j, w = 0) { + this.adj[i].push(j) + this.weight.get(i).set(j, w) + } + + addEdge(i, j, w = 0) { + // Add w to v's list. + this.adj[i].push(j) + // Add v to w's list + this.adj[j].push(i) + this.weight.get(i).set(j, w) + this.weight.get(j).set(i, w) + } +} + +function dijkstra(graph, source) { + const ans = new Array(graph.n).fill(Number.MAX_SAFE_INTEGER / 2) + const pq = new MinPriorityQueue({ priority: (item) => item[1] }) + pq.enqueue([source, 0]) + + while (pq.size() > 0) { + const [item, dis] = pq.dequeue().element + if (ans[item] <= dis) continue + ans[item] = dis + + graph.adj[item].forEach((neighbor) => { + if (ans[neighbor] >= Number.MAX_SAFE_INTEGER / 2) { + pq.enqueue([neighbor, dis + graph.weight.get(item).get(neighbor)]) + } + }) + } + return ans +} + +function maxTargetNodes(edges1, edges2) { + const n = edges1.length + 1 + const m = edges2.length + 1 + const g1 = new Graph(n) + const g2 = new Graph(m) + + edges1.forEach(([a, b]) => g1.addEdge(a, b, 1)) + edges2.forEach(([a, b]) => g2.addEdge(a, b, 1)) + + const dis1 = dijkstra(g1, 0) + const dis2 = dijkstra(g2, 0) + + const a0 = new Set() + const a1 = new Set() + const b0 = new Set() + const b1 = new Set() + + for (let i = 0; i < dis1.length; i++) { + if (dis1[i] % 2 === 0) { + a0.add(i) + } else { + a1.add(i) + } + } + + for (let i = 0; i < dis2.length; i++) { + if (dis2[i] % 2 === 0) { + b0.add(i) + } else { + b1.add(i) + } + } + + const b = Math.max(b0.size, b1.size) + const ans = [] + + for (let i = 0; i < n; i++) { + if (a0.has(i)) { + ans.push(a0.size + b) + } else { + ans.push(a1.size + b) + } + } + + return ans +} From ee5ed076a879b182b134a3f59cef475d7741e91a Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 2 Dec 2024 11:48:27 +0800 Subject: [PATCH 1888/2039] Update 1462-course-schedule-iv.js --- 1462-course-schedule-iv.js | 53 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) diff --git a/1462-course-schedule-iv.js b/1462-course-schedule-iv.js index abbcaf55..d06b42f0 100644 --- a/1462-course-schedule-iv.js +++ b/1462-course-schedule-iv.js @@ -1,3 +1,56 @@ +/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @param {number[][]} queries + * @return {boolean[]} + */ +var checkIfPrerequisite = function(numCourses, prerequisites, queries) { + const g = {} + const n = numCourses + const indegree = Array(n).fill(0) + for(const [a, b] of prerequisites) { + if(!g[a]) { + g[a] = [] + } + g[a].push(b) + indegree[b]++ + } + const q = [] + for(let i = 0; i < n; i++) { + if(indegree[i] === 0) { + q.push(i) + } + } + const res = [] + const hash = {} + for(const e of q) { + dfs(e, new Set()) + } + for(let i = 0; i < queries.length; i++) { + const [a, b] = queries[i] + res.push(hash[a] && hash[a].has(b)) + } + + return res + function dfs(cur, set) { + if(hash[cur]) { + return hash[cur] + } + hash[cur] = new Set() + if(g[cur]) { + for(const e of g[cur]) { + for(const x of dfs(e, set)) { + hash[cur].add(x) + } + } + } + hash[cur].add(cur) + return hash[cur] + } +}; + +// another + /** * @param {number} numCourses * @param {number[][]} prerequisites From 64055328f6e6a0acd631f3e9dc012adddeac3f25 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 3 Dec 2024 15:26:31 +0800 Subject: [PATCH 1889/2039] Update 1591-strange-printer-ii.js --- 1591-strange-printer-ii.js | 68 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 68 insertions(+) diff --git a/1591-strange-printer-ii.js b/1591-strange-printer-ii.js index 4dd5b521..1db9c901 100644 --- a/1591-strange-printer-ii.js +++ b/1591-strange-printer-ii.js @@ -1,3 +1,71 @@ +/** + * @param {number[][]} targetGrid + * @return {boolean} + */ +const isPrintable = function(targetGrid) { + // solve the problem: BFS + // 1. find the top-left and bottom-right corner of each color + // 2. check if there is a circle in the graph + // 3. if there is a circle, return false + // 4. if there is no circle, return true + const m = targetGrid.length; + const n = targetGrid[0].length; + const left = new Array(61).fill(n); + const right = new Array(61).fill(-1); + const top = new Array(61).fill(m); + const bottom = new Array(61).fill(-1); + const next = new Array(61).fill(null).map(() => []); + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + const color = targetGrid[i][j]; + left[color] = Math.min(left[color], j); + right[color] = Math.max(right[color], j); + top[color] = Math.min(top[color], i); + bottom[color] = Math.max(bottom[color], i); + } + } + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + for (let color = 1; color <= 60; color++) { + if (i >= top[color] && i <= bottom[color] && j >= left[color] && j <= right[color]) { + if (color !== targetGrid[i][j]) { + next[targetGrid[i][j]].push(color); + } + } + } + } + } + const numNodes = 61; + const inDegree = new Array(numNodes).fill(0); + for (let i = 0; i < numNodes; i++) { + for (const j of next[i]) { + inDegree[j]++; + } + } + const queue = []; + let count = 0; + for (let i = 0; i < numNodes; i++) { + if (inDegree[i] === 0) { + queue.push(i); + count++; + } + } + while (queue.length > 0) { + const curCourse = queue.shift(); + for (const child of next[curCourse]) { + inDegree[child]--; + if (inDegree[child] === 0) { + queue.push(child); + count++; + } + } + } + return count === numNodes; +}; + +// another + + /** * @param {number[][]} targetGrid * @return {boolean} From 24d0cde73f3eefbd00da494971c8416dad2b2701 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 4 Dec 2024 15:40:02 +0800 Subject: [PATCH 1890/2039] Update 1632-rank-transform-of-a-matrix.js --- 1632-rank-transform-of-a-matrix.js | 88 ++++++++++++++++++++++++++++++ 1 file changed, 88 insertions(+) diff --git a/1632-rank-transform-of-a-matrix.js b/1632-rank-transform-of-a-matrix.js index 69233377..6145eff0 100644 --- a/1632-rank-transform-of-a-matrix.js +++ b/1632-rank-transform-of-a-matrix.js @@ -1,3 +1,91 @@ +class UF { + constructor(n) { + this.parent = new Array(n + 1).fill(0).map((_, i) => i); + } + union(x, y) { + const rootX = this.find(x); + const rootY = this.find(y); + if (rootX !== rootY) { + this.parent[rootX] = rootY; + } + } + find(x) { + if (x !== this.parent[x]) { + this.parent[x] = this.find(this.parent[x]); + } + return this.parent[x]; + } +} + +// Update the matrixRankTransform function to use the union-find functions +var matrixRankTransform = function(matrix) { + const m = matrix.length + const n = matrix[0].length + const uf = new UF(m * n) + const res = Array.from({ length: m }, () => Array(n).fill(-1)) + + for (let i = 0; i < m; i++) { + const tmp = [] + for (let j = 0; j < n; j++) { + tmp.push([matrix[i][j], i * n + j]) + } + tmp.sort((a, b) => a[0] - b[0]) + for (let j = 1; j < n; j++) { + if (tmp[j][0] === tmp[j - 1][0] && uf.find(tmp[j][1]) !== uf.find(tmp[j - 1][1])) { + uf.union(tmp[j][1], tmp[j - 1][1]) + } + } + } + + for (let j = 0; j < n; j++) { + const tmp = [] + for (let i = 0; i < m; i++) { + tmp.push([matrix[i][j], i * n + j]) + } + tmp.sort((a, b) => a[0] - b[0]) + for (let i = 1; i < m; i++) { + if (tmp[i][0] === tmp[i - 1][0] && uf.find(tmp[i][1]) !== uf.find(tmp[i - 1][1])) { + uf.union(tmp[i][1], tmp[i - 1][1]) + } + } + } + + const nums = [], group = {} + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + const key = i * n + j + const root = uf.find(key) + if(group[root] == null) group[root] = [] + group[root].push(key) + nums.push([matrix[i][j], key]) + } + } + nums.sort((a, b) => a[0] - b[0]) + const rowMax = Array(m).fill(0) + const colMax = Array(n).fill(0) + for(const e of nums) { + const [val, key] = e + const [i, j] = [Math.floor(key / n), key % n] + if(res[i][j] !== -1) continue + let rank = 0 + for(const k of group[uf.find(key)]) { + const [x, y] = [Math.floor(k / n), k % n] + rank = Math.max(rank, rowMax[x], colMax[y]) + } + rank++ + for(const k of group[uf.find(key)]) { + const [x, y] = [Math.floor(k / n), k % n] + res[x][y] = rank + rowMax[x] = rank + colMax[y] = rank + } + } + + return res +}; + +// another + /** * @param {number[][]} matrix * @return {number[][]} From 742673af2720aaeff9a23774e98e3f31c6dd7894 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 5 Dec 2024 15:33:01 +0800 Subject: [PATCH 1891/2039] Update 1857-largest-color-value-in-a-directed-graph.js --- ...largest-color-value-in-a-directed-graph.js | 67 +++++++++++++++++++ 1 file changed, 67 insertions(+) diff --git a/1857-largest-color-value-in-a-directed-graph.js b/1857-largest-color-value-in-a-directed-graph.js index ed99ed48..670144e8 100644 --- a/1857-largest-color-value-in-a-directed-graph.js +++ b/1857-largest-color-value-in-a-directed-graph.js @@ -1,3 +1,70 @@ +/** + * @param {string} colors + * @param {number[][]} edges + * @return {number} + */ +const largestPathValue = function(colors, edges) { + const n = colors.length; + const m = edges.length; + const adj = Array(n).fill(0).map(() => []); + const inDegree = Array(n).fill(0); + for (const [u, v] of edges) { + adj[u].push(v); + inDegree[v]++; + } + let res = 1 + const colorSet = new Set(colors); + const a = 'a'.charCodeAt(0); + for(const e of colorSet) { + const tmp = helper(e.charCodeAt(0) - a); + if(tmp === -1) return -1; + res = Math.max(res, tmp); + } + + return res + + function code(ch) { + return ch.charCodeAt(0) - 'a'.charCodeAt(0); + } + function helper(k) { + const ind = [...inDegree]; + const count = Array(n).fill(0); + let nodes = 0 + let res = 0 + let q = [] + for(let i = 0; i < n; i++) { + if(ind[i] === 0) { + q.push(i); + nodes++ + count[i] = code(colors[i]) === k ? 1 : 0; + } + } + + while(q.length) { + const size = q.length; + const tmp = [] + for(let i = 0; i < size; i++) { + const e = q[i]; + for(const v of adj[e]) { + count[v] = Math.max(count[v], count[e] + (code(colors[v]) === k ? 1 : 0)); + res = Math.max(res, count[v]); + ind[v]--; + if(ind[v] === 0) { + tmp.push(v); + nodes++ + } + } + } + + q = tmp + } + + return nodes === n ? res : -1 + } +}; + +// another + /** * @param {string} colors * @param {number[][]} edges From db023e5ec3aaf455cbac420811b2e0032a9595b3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 6 Dec 2024 13:58:34 +0800 Subject: [PATCH 1892/2039] Update 2050-parallel-courses-iii.js --- 2050-parallel-courses-iii.js | 45 ++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/2050-parallel-courses-iii.js b/2050-parallel-courses-iii.js index 1be35f37..521a0eb0 100644 --- a/2050-parallel-courses-iii.js +++ b/2050-parallel-courses-iii.js @@ -1,3 +1,48 @@ +/** + * @param {number} n + * @param {number[][]} relations + * @param {number[]} time + * @return {number} + */ +const minimumTime = function(n, relations, time) { + const adj = Array(n + 1).fill(0).map(() => []); + const inDegree = Array(n + 1).fill(0); + for (const [u, v] of relations) { + adj[u].push(v); + inDegree[v]++; + } + let q = [] + const finishTime = Array(n + 1).fill(0); + for(let i = 1; i <= n; i++) { + if(inDegree[i] === 0) { + q.push(i); + finishTime[i] = time[i - 1]; + } + } + + + while(q.length) { + const size = q.length; + const tmp = [] + for(let i = 0; i < size; i++) { + const e = q[i]; + for(const v of adj[e]) { + inDegree[v]--; + finishTime[v] = Math.max(finishTime[v], finishTime[e] + time[v - 1]); + if(inDegree[v] === 0) { + tmp.push(v); + } + } + } + + q = tmp + } + + return Math.max(...finishTime.slice(1)) +}; + +// another + /** * @param {number} n * @param {number[][]} relations From 19b8f4177d430e1d9b90797dcd2fa918c4e0eaef Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Dec 2024 10:19:50 +0800 Subject: [PATCH 1893/2039] Create 3379-transformed-array.js --- 3379-transformed-array.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 3379-transformed-array.js diff --git a/3379-transformed-array.js b/3379-transformed-array.js new file mode 100644 index 00000000..2daeba3f --- /dev/null +++ b/3379-transformed-array.js @@ -0,0 +1,22 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var constructTransformedArray = function(nums) { + const n = nums.length; + const res = new Array(n).fill(0); + for (let i = 0; i < n; i++) { + if (nums[i] === 0) { + res[i] = nums[i]; + } else if (nums[i] > 0) { + const ind = (i + nums[i]) % n; + res[i] = nums[ind]; + } else { + const neg = Math.abs(nums[i]) % n; + const ind = (i - neg + n) % n; + // console.log(ind); + res[i] = nums[ind]; + } + } + return res; +}; From ef4c6a62e541a4047b9b6f6e757b34edfe1a176b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Dec 2024 10:20:33 +0800 Subject: [PATCH 1894/2039] Create 3380-maximum-area-rectangle-with-point-constraints-i.js --- ...area-rectangle-with-point-constraints-i.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 3380-maximum-area-rectangle-with-point-constraints-i.js diff --git a/3380-maximum-area-rectangle-with-point-constraints-i.js b/3380-maximum-area-rectangle-with-point-constraints-i.js new file mode 100644 index 00000000..8247c400 --- /dev/null +++ b/3380-maximum-area-rectangle-with-point-constraints-i.js @@ -0,0 +1,41 @@ +/** + * @param {number[][]} points + * @return {number} + */ +var maxRectangleArea = function (points) { + const n = points.length + const st = new Set() + for (const i of points) st.add(i[0] + ',' + i[1]) + let res = -1 + + for (let i = 0; i < n; i++) { + for (let j = i + 1; j < n; j++) { + const x1 = points[i][0], + y1 = points[i][1], + x2 = points[j][0], + y2 = points[j][1] + if (x1 === x2 || y1 === y2) continue + if (st.has(x1 + ',' + y2) && st.has(x2 + ',' + y1)) { + const min1 = Math.min(x1, x2), + max1 = Math.max(x1, x2), + min2 = Math.min(y1, y2), + max2 = Math.max(y1, y2) + let isid = true + for (const point of points) { + const cx = point[0], + cy = point[1] + if ( + (cx > min1 && cx < max1 && cy > min2 && cy < max2) || + ((cx === min1 || cx === max1) && cy > min2 && cy < max2) || + ((cy === min2 || cy === max2) && cx > min1 && cx < max1) + ) { + isid = false + break + } + } + if (isid) res = Math.max(res, (max1 - min1) * (max2 - min2)) + } + } + } + return res +} From 95c09955f9b260b2a926bf5aa53c7072ace2f5c5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Dec 2024 10:21:08 +0800 Subject: [PATCH 1895/2039] Create 3381-maximum-subarray-sum-with-length-divisible-by-k.js --- ...subarray-sum-with-length-divisible-by-k.js | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 3381-maximum-subarray-sum-with-length-divisible-by-k.js diff --git a/3381-maximum-subarray-sum-with-length-divisible-by-k.js b/3381-maximum-subarray-sum-with-length-divisible-by-k.js new file mode 100644 index 00000000..d84efd15 --- /dev/null +++ b/3381-maximum-subarray-sum-with-length-divisible-by-k.js @@ -0,0 +1,36 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maxSubarraySum = function (nums, k) { + const n = nums.length + let res = -Infinity + const pre_sum = new Array(n + 1).fill(0) + + for (let i = 0; i < n; i++) { + pre_sum[i + 1] = pre_sum[i] + nums[i] + } + + const groups = Array.from({ length: k }, (_, i) => [pre_sum[i]]) + + for (let i = k; i <= n; i++) { + const idx = i % k + groups[idx].push(pre_sum[i]) + } + + for (let i = 0; i < k; i++) { + const group = groups[i] + const mx_dp = new Array(group.length + 1).fill(-Infinity) + + for (let j = group.length - 1; j >= 0; j--) { + mx_dp[j] = Math.max(mx_dp[j + 1], group[j]) + } + + for (let j = 0; j < group.length; j++) { + res = Math.max(res, mx_dp[j + 1] - group[j]) + } + } + + return res +} From 0f1910065e7f5c6a15f9a727f3035311cffcc8b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 9 Dec 2024 12:26:04 +0800 Subject: [PATCH 1896/2039] Create 3382-maximum-area-rectangle-with-point-constraints-ii.js --- ...rea-rectangle-with-point-constraints-ii.js | 85 +++++++++++++++++++ 1 file changed, 85 insertions(+) create mode 100644 3382-maximum-area-rectangle-with-point-constraints-ii.js diff --git a/3382-maximum-area-rectangle-with-point-constraints-ii.js b/3382-maximum-area-rectangle-with-point-constraints-ii.js new file mode 100644 index 00000000..7d1912cc --- /dev/null +++ b/3382-maximum-area-rectangle-with-point-constraints-ii.js @@ -0,0 +1,85 @@ +/** + * @param {number[]} xCoord + * @param {number[]} yCoord + * @return {number} + */ +var maxRectangleArea = function (xCoord, yCoord) { + const n = xCoord.length + const co = [] + const sy = imap(yCoord) + + for (let i = 0; i < n; i++) { + co.push([xCoord[i], binarySearch(sy, yCoord[i])]) + } + co.sort((a, b) => a[0] - b[0] || a[1] - b[1]) + + let result = -1 + const map = new Map() + const mapX = new Map() + const ft = new Array(sy.length + 1).fill(0) + for (let i = 0; i < co.length; i++) { + addFenwick(ft, co[i][1], 1) + + if (i - 1 >= 0 && co[i][0] === co[i - 1][0]) { + const yc = (BigInt(co[i][1]) << 32n) | BigInt(co[i - 1][1]) + const aft = sumFenwick(ft, co[i][1]) - sumFenwick(ft, co[i - 1][1] - 1) + + if (map.has(yc)) { + const bef = map.get(yc) + if (aft === bef + 2) { + const x = mapX.get(yc) + const S = + BigInt(co[i][0] - x) * BigInt(sy[co[i][1]] - sy[co[i - 1][1]]) + result = Number(BigInt(result) > S ? result : S) + } + } + + map.set(yc, aft) + mapX.set(yc, co[i][0]) + } + } + + return result + + function sumFenwick(ft, i) { + let sum = 0 + for (i += 1; i > 0; i -= i & -i) { + sum += ft[i] + } + return sum + } + + function addFenwick(ft, i, v) { + if (v === 0 || i < 0) return + for (i += 1; i < ft.length; i += i & -i) { + ft[i] += v + } + } + + function imap(a) { + const imap = Array.from(a) + imap.sort((a, b) => a - b) + let p = 1 + + for (let i = 1; i < imap.length; i++) { + if (imap[i] !== imap[p - 1]) imap[p++] = imap[i] + } + + return imap.slice(0, p) + } + + function binarySearch(nums, target) { + let left = 0 + let right = nums.length - 1 + while (left <= right) { + const mid = (left + right) >> 1 + if (nums[mid] === target) return mid + if (nums[mid] < target) { + left = mid + 1 + } else { + right = mid - 1 + } + } + return -1 + } +} From 23b830fb26070709cc9143ad6368f1fb436f22f8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 10 Dec 2024 14:11:44 +0800 Subject: [PATCH 1897/2039] Update 2360-longest-cycle-in-a-graph.js --- 2360-longest-cycle-in-a-graph.js | 49 ++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/2360-longest-cycle-in-a-graph.js b/2360-longest-cycle-in-a-graph.js index da87392d..32eed7a3 100644 --- a/2360-longest-cycle-in-a-graph.js +++ b/2360-longest-cycle-in-a-graph.js @@ -1,3 +1,52 @@ +/** + * @param {number[]} edges + * @return {number} + */ +const longestCycle = function(edges) { + const n = edges.length; + const visited = new Array(n).fill(false); + const ind = new Array(n).fill(0); + for (let i = 0; i < n; i++) { + if (edges[i] !== -1) { + ind[edges[i]]++; + } + } + let q = [] + for(let i = 0; i < n; i++) { + if (ind[i] === 0) { + q.push(i); + } + } + while(q.length) { + const node = q.pop() + visited[node] = true; + const nxt = edges[node]; + if(nxt !== -1) { + ind[nxt]--; + if (ind[nxt] === 0) { + q.push(nxt); + } + } + } + let res = -1 + for(let i = 0; i < n; i++) { + if (!visited[i]) { + let cnt = 0 + let cur = i + while (!visited[cur]) { + visited[cur] = true + cur = edges[cur] + cnt++ + } + res = Math.max(res, cnt) + } + } + + return res +}; + +// another + /** * @param {number[]} edges * @return {number} From 2367355064afd45adc62fb4e6b63215bc89ec32d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 11 Dec 2024 15:57:39 +0800 Subject: [PATCH 1898/2039] Update 2392-build-a-matrix-with-conditions.js --- 2392-build-a-matrix-with-conditions.js | 66 ++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) diff --git a/2392-build-a-matrix-with-conditions.js b/2392-build-a-matrix-with-conditions.js index 8bd4d8ac..a18b14d3 100644 --- a/2392-build-a-matrix-with-conditions.js +++ b/2392-build-a-matrix-with-conditions.js @@ -1,3 +1,69 @@ +/** + * @param {number} k + * @param {number[][]} rowConditions + * @param {number[][]} colConditions + * @return {number[][]} + */ +const buildMatrix = function(k, rowConditions, colConditions) { + const col = topo(k, colConditions); + const row = topo(k, rowConditions); + if(col.length === 0 || row.length === 0) return [] + + const res = Array.from({length: k}, () => Array.from({length: k}, () => 0)); + const colHash = {}, rowHash = {}; + for(let i = 0; i < k; i++) { + colHash[col[i]] = i; + rowHash[row[i]] = i; + } + for(let i = 1; i <= k; i++) { + res[rowHash[i]][colHash[i]] = i + } + + return res + + function topo(k, conditions) { + const n = conditions.length; + const ind = new Array(k + 1).fill(0); + const adj = Array.from({length: k + 1}, () => []); + for(let i = 0; i < n; i++) { + const [a, b] = conditions[i]; + adj[a].push(b); + ind[b]++; + } + // console.log(adj, ind) + let q = [] + for(let i = 1; i <= k; i++) { + if (ind[i] === 0) { + q.push(i); + } + } + const res = [] + + while(q.length) { + const size = q.length + const tmp = [] + for(let i = 0; i < size; i++) { + + const node = q[i] + res.push(node) + for(const nxt of adj[node]) { + ind[nxt]--; + if (ind[nxt] === 0) { + tmp.push(nxt); + } + } + } + q = tmp + } + // console.log(res) + if(res.length !== k) return [] + return res + } +}; + +// another + + /** * @param {number} k * @param {number[][]} rowConditions From 4687b6cec89218708f7ff3fcdcd9beb727c51029 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 12 Dec 2024 17:40:52 +0800 Subject: [PATCH 1899/2039] Update 2440-create-components-with-same-value.js --- 2440-create-components-with-same-value.js | 65 +++++++++++++++++++++++ 1 file changed, 65 insertions(+) diff --git a/2440-create-components-with-same-value.js b/2440-create-components-with-same-value.js index fc6e910c..06735c00 100644 --- a/2440-create-components-with-same-value.js +++ b/2440-create-components-with-same-value.js @@ -1,3 +1,68 @@ +/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +var componentValue = function(nums, edges) { + const n = nums.length; + if(n === 1) return 0; + const total = nums.reduce((a, b) => a + b, 0); + const g = Array.from({ length: n }, () => []); + const indegree = Array(n).fill(0); + for (const [u, v] of edges) { + g[u].push(v); + g[v].push(u); + indegree[u]++; + indegree[v]++; + } + const sums = [] + for(let s = 1; s * s <= total; s++) { + if(total % s === 0) { + sums.push(s); + sums.push(total / s); + } + } + sums.sort((a, b) => a - b); + let res = 0 + for(const s of sums) { + const ind = [...indegree]; + const q = []; + const visited = Array(n).fill(false); + const sum = [...nums]; + for(let i = 0; i < n; i++) { + if(ind[i] === 1) { + q.push(i); + visited[i] = true; + } + } + let flag = true; + while(q.length) { + const cur = q.shift(); + if(sum[cur] > s) { + flag = false; + break; + } else if(sum[cur] === s) { + sum[cur] = 0 + } + for(const next of g[cur]) { + if(visited[next]) continue; + sum[next] += sum[cur]; + ind[next]--; + if(ind[next] === 1) { + q.push(next); + visited[next] = true; + } + } + } + if(flag) return total / s - 1; + + } + return 0 +}; + +// another + + /** * @param {number[]} nums * @param {number[][]} edges From d09846527d50f6d4b818cfba27be8379f97340a2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 13 Dec 2024 16:31:07 +0800 Subject: [PATCH 1900/2039] Update 2603-collect-coins-in-a-tree.js --- 2603-collect-coins-in-a-tree.js | 66 +++++++++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) diff --git a/2603-collect-coins-in-a-tree.js b/2603-collect-coins-in-a-tree.js index 211e4335..7b174eb3 100644 --- a/2603-collect-coins-in-a-tree.js +++ b/2603-collect-coins-in-a-tree.js @@ -1,3 +1,69 @@ +/** + * @param {number[]} coins + * @param {number[][]} edges + * @return {number} + */ +var collectTheCoins = function(coins, edges) { + let n = coins.length; + let next = Array.from({ length: n }, () => new Set()); + + let degree = new Array(n).fill(0); + for (let edge of edges) { + let a = edge[0], + b = edge[1]; + next[a].add(b); + next[b].add(a); + degree[a]++; + degree[b]++; + } + + let deleted = new Array(n).fill(0); + let q = []; + for (let i = 0; i < n; i++) { + if (degree[i] === 1 && coins[i] === 0) q.push(i); + } + while (q.length > 0) { + let len = q.length; + while (len--) { + let cur = q.shift(); + deleted[cur] = 1; + for (let nxt of next[cur]) { + degree[nxt]--; + next[nxt].delete(cur); + if (degree[nxt] === 1 && coins[nxt] === 0) q.push(nxt); + } + } + } + + let depth = new Array(n).fill(-1); + for (let i = 0; i < n; i++) { + if (degree[i] === 1 && deleted[i] === 0) { + q.push(i); + depth[i] = 1; + } + } + while (q.length > 0) { + let len = q.length; + while (len--) { + let cur = q.shift(); + for (let nxt of next[cur]) { + degree[nxt]--; + next[nxt].delete(cur); + depth[nxt] = Math.max(depth[nxt], depth[cur] + 1); + if (degree[nxt] === 1) q.push(nxt); + } + } + } + + let ret = 0; + for (let i = 0; i < n; i++) ret += depth[i] >= 3; + + if (ret >= 1) return (ret - 1) * 2; + else return 0; +}; + +// another + let a, cum, res, v, sum, g; const initializeGraph = (n) => { let g = []; for (let i = 0; i < n; i++) { g.push([]); } return g; }; const packUG = (g, edges) => { for (const [u, v] of edges) { g[u].push(v); g[v].push(u); } }; From 5746c33822d82c37deb635d513589c87a50c0f2a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 17 Dec 2024 11:11:42 +0800 Subject: [PATCH 1901/2039] Update 930-binary-subarrays-with-sum.js --- 930-binary-subarrays-with-sum.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/930-binary-subarrays-with-sum.js b/930-binary-subarrays-with-sum.js index 785bf86c..546d03a5 100644 --- a/930-binary-subarrays-with-sum.js +++ b/930-binary-subarrays-with-sum.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} goal + * @return {number} + */ +var numSubarraysWithSum = function(nums, goal) { + const n = nums.length + const hash = { 0: 1 } + let res = 0 + let sum = 0 + for(let i = 0; i < n; i++) { + const e = nums[i] + sum += e + const diff = sum - goal + if(hash[diff] != null) res += hash[diff] + if(hash[sum] == null) hash[sum] = 1 + else hash[sum]++ + } + + return res +}; + +// another + /** * @param {number[]} A * @param {number} S From 0419215cd2b62b7a8b9e490fd27c736936068ce0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 Dec 2024 10:57:51 +0800 Subject: [PATCH 1902/2039] Update 974-subarray-sums-divisible-by-k.js --- 974-subarray-sums-divisible-by-k.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/974-subarray-sums-divisible-by-k.js b/974-subarray-sums-divisible-by-k.js index 26306870..6c456912 100644 --- a/974-subarray-sums-divisible-by-k.js +++ b/974-subarray-sums-divisible-by-k.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var subarraysDivByK = function(nums, k) { + const n = nums.length; + const prefix = new Array(n).fill(0); + for(let i = 0; i < n; i++) { + prefix[i] = (prefix[i - 1] || 0) + nums[i]; + } + const count = new Array(k + 1).fill(0); + count[0] = 1; + let res = 0 + for(let i = 0; i < n; i++) { + const remain = ((prefix[i] % k) + k) % k + res += count[remain]; + count[remain]++; + } + return res +}; + +// another + /** * @param {number[]} nums * @param {number} k From e89a69061c28c6807730a202a878c7c03f30d4f1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 20 Dec 2024 10:39:42 +0800 Subject: [PATCH 1903/2039] Update 1371-find-the-longest-substring-containing-vowels-in-even-counts.js --- ...string-containing-vowels-in-even-counts.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js index 0c65e37a..b2c505d0 100644 --- a/1371-find-the-longest-substring-containing-vowels-in-even-counts.js +++ b/1371-find-the-longest-substring-containing-vowels-in-even-counts.js @@ -1,3 +1,38 @@ +/** + * @param {string} s + * @return {number} + */ +var findTheLongestSubstring = function(s) { + const hash = {0: -1}; + const vowels = 'aeiou'; + const vowelsSet = new Set(vowels); + const n = s.length; + const key = (ch) => { + const idx = vowels.indexOf(ch); + return idx === -1 ? 0 : 1 << idx; + } + let state = 0; + let res = 0; + for(let i = 0; i < n; i++) { + const ch = s[i] + let tmp = state; + if(vowelsSet.has(ch)) { + tmp ^= key(ch); + } + if(hash[tmp] === undefined) { + hash[tmp] = i; + }else { + res = Math.max(res, i - hash[tmp]); + } + + state = tmp + } + + return res +}; + +// another + /** * @param {string} s * @return {number} From 9817c607e37c748a246734f48930ce2c92473a24 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Dec 2024 11:19:26 +0800 Subject: [PATCH 1904/2039] Update 1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js --- ...s-that-can-form-two-arrays-of-equal-xor.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js b/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js index 02a65836..efc5f02f 100644 --- a/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js +++ b/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js @@ -1,4 +1,32 @@ +/** + * @param {number[]} arr + * @return {number} + */ +var countTriplets = function(arr) { + const n = arr.length + const prefix = new Array(n + 1).fill(0) + for(let i = 0; i < n; i++) { + prefix[i + 1] = prefix[i] ^ arr[i] + } + let res = 0, xor = 0 + const hash = {0: [-1]} + for(let i = 0; i < n; i++) { + const e = arr[i] + xor ^= e + if(hash[xor] === undefined) { + hash[xor] = [] + } else { + for(const prev of hash[xor]) { + res += Math.max(0, i - prev - 1) + } + } + hash[xor].push(i) + } + return res +}; + +// another /** * @param {number[]} arr * @return {number} From 8244f727571332e435dccbe5549434bbc9e253fb Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Dec 2024 11:28:58 +0800 Subject: [PATCH 1905/2039] Update 1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js --- ...s-that-can-form-two-arrays-of-equal-xor.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js b/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js index efc5f02f..3c66d205 100644 --- a/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js +++ b/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.js @@ -67,3 +67,31 @@ const countTriplets = function(arr) { } return res }; +/* + +you have an array : a[0], a[1].... a[n - 1] + + +First things first: +We need to understand small fact, if xor(a[0....i]) has appeared before at index j then it means xor(a[j+1.....i]) = 0 +Another fact, if xor(a[i....j]) = 0 so this subarray will add (j - i - 1) to the answer. + + +Now say currently we are at index i and let xor([0...i]) = x. + + +Now say x has occurred 3 times previously at indices (i1, i2, i3) + + +our answer for i will be = (i - i1 - 1) + (i - i2 - 1) + (i - i3 - 1) + + +if you simplify this further you get f * i - (i1 + i2 + i3) - f = (i - 1) * f - (i1 + i2 + i3) + + +f = no. of times x has occurred previously. + + +(i1 + i2 + i3) = sum of all the indices where x has occurred previously. + +*/ From 77b74af39f0a43f1128d9e8c90895fd1681bd3a8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 Dec 2024 11:04:13 +0800 Subject: [PATCH 1906/2039] Update 1590-make-sum-divisible-by-p.js --- 1590-make-sum-divisible-by-p.js | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1590-make-sum-divisible-by-p.js b/1590-make-sum-divisible-by-p.js index 182ae5a0..4c903d90 100644 --- a/1590-make-sum-divisible-by-p.js +++ b/1590-make-sum-divisible-by-p.js @@ -1,3 +1,32 @@ +/** + * @param {number[]} nums + * @param {number} p + * @return {number} + */ +var minSubarray = function(nums, p) { + const n = nums.length + const sum = nums.reduce((acc, cur) => acc + cur, 0) + const target = sum % p + if(target === 0) return 0 + const hash = {0: -1} + let res = n + let curSum = 0 + for(let i = 0; i < n; i++) { + const e = nums[i] + curSum += e + const remain = curSum % p + const diff = (remain - target + p) % p + if(hash[diff] != null) { + res = Math.min(res, i - hash[diff]) + } + hash[remain] = i + } + + return res === n ? -1 : res +}; + +// another + /** * @param {number[]} nums * @param {number} p From c8509094c4c1ddcb76f576903c059e98627fa378 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 25 Dec 2024 11:35:17 +0800 Subject: [PATCH 1907/2039] Update 235-lowest-common-ancestor-of-a-binary-search-tree.js --- 235-lowest-common-ancestor-of-a-binary-search-tree.js | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/235-lowest-common-ancestor-of-a-binary-search-tree.js b/235-lowest-common-ancestor-of-a-binary-search-tree.js index 205bcf3d..f6716919 100644 --- a/235-lowest-common-ancestor-of-a-binary-search-tree.js +++ b/235-lowest-common-ancestor-of-a-binary-search-tree.js @@ -29,6 +29,7 @@ const lowestCommonAncestor = function(root, p, q) { * this.left = this.right = null; * } */ + /** * @param {TreeNode} root * @param {TreeNode} p @@ -36,8 +37,8 @@ const lowestCommonAncestor = function(root, p, q) { * @return {TreeNode} */ const lowestCommonAncestor = function(root, p, q) { - while((root.val - p.val) * (root.val - q.val) > 0) { - root = root.val > p.val ? root.left : root.right - } - return root + while((root.val - p.val) * (root.val - q.val) > 0) { + root = p.val < root.val ? root.left : root.right + } + return root }; From 2b9a89b48544bd6dc36d7c13955ced7477f8e935 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Dec 2024 11:02:18 +0800 Subject: [PATCH 1908/2039] Update 1915-number-of-wonderful-substrings.js --- 1915-number-of-wonderful-substrings.js | 29 ++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/1915-number-of-wonderful-substrings.js b/1915-number-of-wonderful-substrings.js index 99f3a690..800696e7 100644 --- a/1915-number-of-wonderful-substrings.js +++ b/1915-number-of-wonderful-substrings.js @@ -1,3 +1,32 @@ +/** + * @param {string} word + * @return {number} + */ +const wonderfulSubstrings = function(word) { + const n = word.length; + let mask = 0 + const hash = {0: 1}, a = 'a'.charCodeAt(0) + let res = 0 + + for(let i = 0; i < n; i++) { + const idx = word.charCodeAt(i) - a + mask ^= (1 << idx) + + res += hash[mask] || 0 + for(let j = 0; j < 10; j++) { + const newMask = mask ^ (1 << j) + res += hash[newMask] || 0 + } + + if(hash[mask] == null) hash[mask] = 0 + hash[mask]++ + } + + return res +}; + +// another + /** * @param {string} word * @return {number} From 9cb24d64d19a0681b54d537255a60ebbe901d57e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Dec 2024 01:56:33 -0800 Subject: [PATCH 1909/2039] Update 2949-count-beautiful-substrings-ii.js --- 2949-count-beautiful-substrings-ii.js | 78 +++++++++++++++++++++------ 1 file changed, 62 insertions(+), 16 deletions(-) diff --git a/2949-count-beautiful-substrings-ii.js b/2949-count-beautiful-substrings-ii.js index e1f8c0b0..a9497f70 100644 --- a/2949-count-beautiful-substrings-ii.js +++ b/2949-count-beautiful-substrings-ii.js @@ -1,27 +1,73 @@ +const set = new Set(['a', 'e', 'i', 'o', 'u']); /** * @param {string} s * @param {number} k * @return {number} */ var beautifulSubstrings = function(s, k) { - let ans = 0, cur = 0; - let mp = new Map(); - mp.set(0, [-1]); - for (let i = 0; i < s.length; i++) { - let ch = s[i]; - if (ch === 'a' || ch === 'e' || ch === 'i' || ch === 'o' || ch === 'u') { - cur++; + const primes = Eratosthenes(k); + let m = 1; + + for (const p of primes) { + let count = 0; + while (k % p === 0) { + count++; + k /= p; + } + if (count !== 0 && count % 2 === 1) { + m *= Math.pow(p, (count + 1) / 2); + } else if (count !== 0 && count % 2 === 0) { + m *= Math.pow(p, count / 2); + } + } + m *= 2; + + const n = s.length; + s = '#' + s; // Prepend a character to ensure 1-based indexing + let ret = 0; + + const map = new Map(); + map.set(0, new Map()); + map.get(0).set(0, 1); + + let count = 0; + + for (let i = 1; i <= n; i++) { + if (set.has(s[i])) { + count++; } else { - cur--; + count--; + } + + if (map.has(count) && map.get(count).has(i % m)) { + ret += map.get(count).get(i % m); } - for (let x of (mp.get(cur) || []) ) { - let d = (i - x) / 2; - if (Math.pow(d, 2) % k === 0) { - ans++; - } + + if (!map.has(count)) { + map.set(count, new Map()); } - if (!mp.has(cur)) mp.set(cur, []); - mp.get(cur).push(i); + map.get(count).set(i % m, (map.get(count).get(i % m) || 0) + 1); } - return ans; + + return ret; }; + +function Eratosthenes(n) { + const q = Array(n + 1).fill(0); + const primes = []; + + for (let i = 2; i <= Math.sqrt(n); i++) { + if (q[i] === 1) continue; + for (let j = i * 2; j <= n; j += i) { + q[j] = 1; + } + } + + for (let i = 2; i <= n; i++) { + if (q[i] === 0) { + primes.push(i); + } + } + + return primes; +} From eef52030e28da09aeb627efd03f65af9f0158844 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 31 Dec 2024 13:04:45 +0800 Subject: [PATCH 1910/2039] Update 2488-count-subarrays-with-median-k.js --- 2488-count-subarrays-with-median-k.js | 36 +++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) diff --git a/2488-count-subarrays-with-median-k.js b/2488-count-subarrays-with-median-k.js index 54a7d129..fadcdcb5 100644 --- a/2488-count-subarrays-with-median-k.js +++ b/2488-count-subarrays-with-median-k.js @@ -25,3 +25,39 @@ const permutationArrayWithMedianK = (a, k) => { } return res; }; + + +// another + +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countSubarrays = function(nums, k) { + const n = nums.length; + for(let i = 0; i < n; i++) { + nums[i] = nums[i] < k ? -1 : nums[i] === k ? 0 : 1 + } + const evenSum = {} + const oddSum = {} + evenSum[0] = 1 + let sum = 0 + let res = 0 + for(let i = 0; i < n; i++) { + sum += nums[i] + if(i % 2 === 0) { + if(evenSum[sum] != null) res += evenSum[sum] + if(oddSum[sum - 1] != null) res += oddSum[sum - 1] + if(oddSum[sum] == null) oddSum[sum] = 0 + oddSum[sum]++ + } else { + if(oddSum[sum] != null) res += oddSum[sum] + if(evenSum[sum - 1] != null) res += evenSum[sum - 1] + if(evenSum[sum] == null) evenSum[sum] = 0 + evenSum[sum]++ + } + } + // console.log(evenSum, oddSum, nums) + return res +}; From 4e4214f3a83bff363312bfbe6f16c256b361ac30 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Jan 2025 15:17:09 +0800 Subject: [PATCH 1911/2039] Update 3381-maximum-subarray-sum-with-length-divisible-by-k.js --- ...subarray-sum-with-length-divisible-by-k.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/3381-maximum-subarray-sum-with-length-divisible-by-k.js b/3381-maximum-subarray-sum-with-length-divisible-by-k.js index d84efd15..7dcf1c3f 100644 --- a/3381-maximum-subarray-sum-with-length-divisible-by-k.js +++ b/3381-maximum-subarray-sum-with-length-divisible-by-k.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maxSubarraySum = function(nums, k) { + const ps = [0] + for (const e of nums) { + ps.push(ps[ps.length - 1] + e) + } + let res = Number.MIN_SAFE_INTEGER + for (let p = 0; p < k; ++p) { + let sum = 0 + for (let i = p; i + k <= nums.length; i += k) { + const n = ps[i + k] - ps[i] + sum = Math.max(n, sum + n) + res = Math.max(res, sum) + } + } + return res +} + +// another + /** * @param {number[]} nums * @param {number} k From ee51d068f0c93dd7ac3269474b47ae590cc7c7af Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 2 Jan 2025 17:14:47 +0800 Subject: [PATCH 1912/2039] Update 795-number-of-subarrays-with-bounded-maximum.js --- ...umber-of-subarrays-with-bounded-maximum.js | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) diff --git a/795-number-of-subarrays-with-bounded-maximum.js b/795-number-of-subarrays-with-bounded-maximum.js index 61e17d9d..2634c6fd 100644 --- a/795-number-of-subarrays-with-bounded-maximum.js +++ b/795-number-of-subarrays-with-bounded-maximum.js @@ -1,3 +1,52 @@ +/** + * @param {number[]} nums + * @param {number} left + * @param {number} right + * @return {number} + */ +const numSubarrayBoundedMax = function(nums, left, right) { + const n = nums.length; + let res = 0 + const preLargerOrEqual = Array(n).fill(-1) + const postLarger = Array(n).fill(n) + let stk = [] + stk.push(0) + for(let i = 1; i < n; i++) { + const e = nums[i] + while(stk.length && nums[stk[stk.length - 1]] < e) { + stk.pop() + } + if(stk.length) { + preLargerOrEqual[i] = stk[stk.length - 1] + } + stk.push(i) + } + stk = [] + stk.push(n - 1) + for(let i = n - 2; i >= 0; i--) { + const e = nums[i] + while(stk.length && nums[stk[stk.length - 1]] <= e) { + stk.pop() + } + if(stk.length) { + postLarger[i] = stk[stk.length - 1] + } + stk.push(i) + } + for(let i = 0; i < n; i++) { + const e = nums[i] + if(e >= left && e <= right) { + const pre = preLargerOrEqual[i] + const post = postLarger[i] + res += (i - pre) * (post - i) + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} left From 7485378d4b7bd25c476f9d988c9d72d61e774d4f Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 3 Jan 2025 15:06:33 +0800 Subject: [PATCH 1913/2039] Update 1625-lexicographically-smallest-string-after-applying-operations.js --- ...allest-string-after-applying-operations.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/1625-lexicographically-smallest-string-after-applying-operations.js b/1625-lexicographically-smallest-string-after-applying-operations.js index ed184351..ec693a8b 100644 --- a/1625-lexicographically-smallest-string-after-applying-operations.js +++ b/1625-lexicographically-smallest-string-after-applying-operations.js @@ -1,3 +1,51 @@ +/** + * @param {string} s + * @param {number} a + * @param {number} b + * @return {string} + */ +const findLexSmallestString = function(s, a, b) { + let res = s; + const n = s.length; + + let evenLimit = 10; + if (b % 2 === 0) evenLimit = 1; + + for (let i = 0; i < evenLimit; i++) { + for (let j = 0; j < 10; j++) { + let t = s.split(''); + + for (let k = 0; k < n; k += 2) { + t[k] = (parseInt(t[k]) + a * i) % 10; + } + for (let k = 1; k < n; k += 2) { + t[k] = (parseInt(t[k]) + a * j) % 10; + } + + t = t.join(''); + let p = t; + const gcdValue = gcd(n, b); + for (let k = 0; k <= n / gcdValue; k++) { + p = p.slice(n - b) + p.slice(0, n - b); + res = res < p ? res : p; + } + } + } + + return res; +}; + + +function gcd(x, y) { + while (y !== 0) { + let temp = y; + y = x % y; + x = temp; + } + return x; +} +// another + /** * @param {string} s * @param {number} a From 5741d55332efe251d61a24e3367bd4de25d9b6fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 6 Jan 2025 12:13:47 +0800 Subject: [PATCH 1914/2039] Update 1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js --- ...ters-to-satisfy-one-of-three-conditions.js | 52 +++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js index aa948052..503c429e 100644 --- a/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js +++ b/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js @@ -1,3 +1,55 @@ +/** + * @param {string} a + * @param {string} b + * @return {number} + */ +const minCharacters = function(a, b) { + const n = a.length, m = b.length; + const freqA = Array(26).fill(0), freqB = Array(26).fill(0); + const ac = 'a'.charCodeAt(0) + for(let i = 0; i < n; i++) { + freqA[a.charCodeAt(i) - ac]++ + } + for(let i = 0; i < m; i++) { + freqB[b.charCodeAt(i) - ac]++ + } + let res = Infinity + for(let i = 0; i < 26; i++) { + if(i > 0) { + let change = 0 + for(let j = 0; j < i; j++) { + change += freqA[j] + } + for(let j = i; j < 26; j++) { + change += freqB[j] + } + res = Math.min(res, change) + change = 0 + for(let j = 0; j < i; j++) { + change += freqB[j] + } + for(let j = i; j < 26; j++) { + change += freqA[j] + } + res = Math.min(res, change) + } + let change = 0 + for(let j = 0; j < 26; j++) { + if(j !== i) { + change += freqA[j] + change += freqB[j] + } + } + res = Math.min(res, change) + } + + return res +}; + + +// another + + /** * @param {string} a * @param {string} b From 5668d6b5b799f03f28881b839ae205f07cd581f1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 7 Jan 2025 14:24:11 +0800 Subject: [PATCH 1915/2039] Update 2013-detect-squares.js --- 2013-detect-squares.js | 53 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) diff --git a/2013-detect-squares.js b/2013-detect-squares.js index 3cb84312..4efeefa0 100644 --- a/2013-detect-squares.js +++ b/2013-detect-squares.js @@ -1,4 +1,57 @@ +var DetectSquares = function() { + this.mat = Array.from({length: 1001}, () => Array.from({length: 1001}, () => 0)); + this.ya = new Map() +}; + +/** + * @param {number[]} point + * @return {void} + */ +DetectSquares.prototype.add = function(point) { + const [x, y] = point; + this.mat[x][y]++; + if(this.ya.get(y) == null) this.ya.set(y, new Map()) + if(this.ya.get(y).get(x) == null) this.ya.get(y).set(x, 0) + this.ya.get(y).set(x, this.ya.get(y).get(x) + 1) +}; + +/** + * @param {number[]} point + * @return {number} + */ +DetectSquares.prototype.count = function(point) { + const [x, y] = point; + let res = 0 + if(!this.ya.has(y)) return res + for(const [key, cnt] of this.ya.get(y)) { + const i = +key + const d = Math.abs(x - i) + if(d === 0) continue + let j = y + d + if(j >= 0 && j < 1001) { + res += cnt * this.mat[x][j] * this.mat[i][j] + } + j = y - d + if(j >= 0 && j < 1001) { + res += cnt * this.mat[x][j] * this.mat[i][j] + } + } + + return res +}; + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = new DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */ + +// another + + + const DetectSquares = function() { this.pts = [] this.ptsCnt = {} From b9ad1ffe5a4d7a0524dc842979d43e4963884026 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 9 Jan 2025 12:19:15 +0800 Subject: [PATCH 1916/2039] Update 2768-number-of-black-blocks.js --- 2768-number-of-black-blocks.js | 35 ++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) diff --git a/2768-number-of-black-blocks.js b/2768-number-of-black-blocks.js index 241fd1fe..6f299cd7 100644 --- a/2768-number-of-black-blocks.js +++ b/2768-number-of-black-blocks.js @@ -1,3 +1,38 @@ +/** + * @param {number} m + * @param {number} n + * @param {number[][]} coordinates + * @return {number[]} + */ +var countBlackBlocks = function(m, n, coordinates) { + + const map = new Map(); + for (const [x, y] of coordinates) { + for(let i = x - 1; i <= x; i++) { + for(let j = y - 1; j <= y; j++) { + if(i >= 0 && j >= 0 && i < m - 1 && j < n - 1) { + const key = encode(i, j); + map.set(key, (map.get(key) || 0) + 1); + } + } + } + } + const res = Array(5).fill(0); + for (const count of map.values()) { + res[count]++; + } + + res[0] = (m - 1) * (n - 1) - res[1] - res[2] - res[3] - res[4]; + return res; + + function encode(x, y) { + return x * n + y; + } +}; + +// another + + /** * @param {number} m * @param {number} n From 0734dff7819d07202ee18fc59df203be7236ffe7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 10 Jan 2025 10:46:30 +0800 Subject: [PATCH 1917/2039] Update 2857-count-pairs-of-points-with-distance-k.js --- 2857-count-pairs-of-points-with-distance-k.js | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) diff --git a/2857-count-pairs-of-points-with-distance-k.js b/2857-count-pairs-of-points-with-distance-k.js index bff65742..e85d888c 100644 --- a/2857-count-pairs-of-points-with-distance-k.js +++ b/2857-count-pairs-of-points-with-distance-k.js @@ -1,3 +1,34 @@ +/** + * @param {number[][]} coordinates + * @param {number} k + * @return {number} + */ +var countPairs = function(coordinates, k) { + const map = new Map(); + const n = coordinates.length; + const MUL = 1e6 + let res = 0; + for(let i = 0; i < n; i++) { + const [x, y] = coordinates[i]; + for(let e = 0; e <= k; e++) { + const x2 = x ^ e; + const y2 = (k - e) ^ y; + const key = code(x2, y2); + res += map.get(key) || 0; + } + const key = code(x, y); + map.set(key, (map.get(key) || 0) + 1); + } + + return res + + function code(x, y) { + return x * MUL + y + } +}; + +// another + /** * @param {number[][]} coordinates * @param {number} k From c9aec0116e789798aa5a794c84cabbd072e4a6b5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 11 Jan 2025 04:26:27 -0800 Subject: [PATCH 1918/2039] Create 3404-count-special-subsequences.js --- 3404-count-special-subsequences.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 3404-count-special-subsequences.js diff --git a/3404-count-special-subsequences.js b/3404-count-special-subsequences.js new file mode 100644 index 00000000..69fc7410 --- /dev/null +++ b/3404-count-special-subsequences.js @@ -0,0 +1,21 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var numberOfSubsequences = function(nums) { + let n = nums.length; + let res = 0; + const cnt = new Map(); + for (let r = 4; r < n - 2; ++r) { + let q = r - 2; + for (let p = 0; p < q - 1; ++p) { + let key = 1.0 * nums[p] / nums[q]; + cnt.set(key, (cnt.get(key) || 0) + 1); + } + for (let s = r + 2; s < n; ++s) { + let key = 1.0 * nums[s] / nums[r]; + res += cnt.get(key) || 0; + } + } + return res; +}; From 12b4f865244ef14cdf52661dd9072252f6c91afe Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 13 Jan 2025 10:42:43 +0800 Subject: [PATCH 1919/2039] Update 435-non-overlapping-intervals.js --- 435-non-overlapping-intervals.js | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/435-non-overlapping-intervals.js b/435-non-overlapping-intervals.js index 5b57a608..7f4ffa45 100644 --- a/435-non-overlapping-intervals.js +++ b/435-non-overlapping-intervals.js @@ -1,3 +1,21 @@ +/** + * @param {number[][]} intervals + * @return {number} + */ +var eraseOverlapIntervals = function(intervals) { + intervals.sort((a, b) => a[1] - b[1]); + let res = 0 + let end = -Infinity + for(const [start, finish] of intervals) { + if(start < end) res++ + else end = finish + } + + return res +}; + +// another + /** * @param {number[][]} intervals * @return {number} From d5d600931e83e60f356ef8dc38b70c259db3ca5e Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 14 Jan 2025 10:47:29 +0800 Subject: [PATCH 1920/2039] Update 452-minimum-number-of-arrows-to-burst-balloons.js --- ...imum-number-of-arrows-to-burst-balloons.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/452-minimum-number-of-arrows-to-burst-balloons.js b/452-minimum-number-of-arrows-to-burst-balloons.js index bd476101..ca8f8d45 100644 --- a/452-minimum-number-of-arrows-to-burst-balloons.js +++ b/452-minimum-number-of-arrows-to-burst-balloons.js @@ -1,3 +1,25 @@ +/** + * @param {number[][]} points + * @return {number} + */ +var findMinArrowShots = function(points) { + points.sort((a, b) => a[1] - b[1]); + if(points.length === 0) return 0 + let res = 1 + let end = points[0][1] + for(let i = 1; i < points.length; i++) { + const [s,e] = points[i] + if(s > end) { + res++ + end = e + } + } + + return res +}; + +// another + /** * @param {number[][]} points * @return {number} From ea84c7f9af48324493f97028fdcb0c433e54b2e9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Jan 2025 10:36:41 +0800 Subject: [PATCH 1921/2039] Update 646-maximum-length-of-pair-chain.js --- 646-maximum-length-of-pair-chain.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/646-maximum-length-of-pair-chain.js b/646-maximum-length-of-pair-chain.js index 9ec23294..3a0661cd 100755 --- a/646-maximum-length-of-pair-chain.js +++ b/646-maximum-length-of-pair-chain.js @@ -1,3 +1,23 @@ +/** + * @param {number[][]} pairs + * @return {number} + */ +var findLongestChain = function(pairs) { + pairs.sort((a, b) => a[1] - b[1]); + if(pairs.length === 0) return 0 + let res = 1 + let end = pairs[0][1] + for(let i = 1; i < pairs.length; i++) { + if(pairs[i][0] > end) { + res++ + end = pairs[i][1] + } + } + return res +}; + +// another + /** * @param {number[][]} pairs * @return {number} From f0987e3a55d07bb25189fa935af2302f1fb61332 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 Jan 2025 11:50:01 +0800 Subject: [PATCH 1922/2039] Update 757-set-intersection-size-at-least-two.js --- 757-set-intersection-size-at-least-two.js | 28 +++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/757-set-intersection-size-at-least-two.js b/757-set-intersection-size-at-least-two.js index 1675a247..6ee71d49 100644 --- a/757-set-intersection-size-at-least-two.js +++ b/757-set-intersection-size-at-least-two.js @@ -1,3 +1,31 @@ +/** + * @param {number[][]} intervals + * @return {number} + */ +var intersectionSizeTwo = function(intervals) { + intervals.sort((a, b) => a[1] === b[1] ? b[0] - a[0] : a[1] - b[1]); + let res = 2 + let a = intervals[0][1] - 1, b = intervals[0][1] + + for(const [s, e] of intervals) { + if(s <= a) continue + else if(s <= b) { + res++ + a = b + b = e + } else { + res += 2 + a = e - 1 + b = e + } + } + + return res +}; + +// another + + /** * @param {number[][]} intervals * @return {number} From a7c0626917c81bf0f27c97f001a542838b35e786 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 24 Jan 2025 05:05:42 -0800 Subject: [PATCH 1923/2039] Create 3413-maximum-coins-from-k-consecutive-bags.js --- 3413-maximum-coins-from-k-consecutive-bags.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 3413-maximum-coins-from-k-consecutive-bags.js diff --git a/3413-maximum-coins-from-k-consecutive-bags.js b/3413-maximum-coins-from-k-consecutive-bags.js new file mode 100644 index 00000000..b2928c3e --- /dev/null +++ b/3413-maximum-coins-from-k-consecutive-bags.js @@ -0,0 +1,35 @@ +/** + * @param {number[][]} coins + * @param {number} k + * @return {number} + */ +var maximumCoins = function(coins, k) { + coins.sort((a, b) => a[0] - b[0]); + const n = coins.length; + + let res = 0, cur = 0; + for (let i = 0, j = 0; i < n; ++i) { + while (j < n && coins[j][1] <= coins[i][0] + k - 1) { + cur +=(coins[j][1] - coins[j][0] + 1) * (coins[j][2]); + j++; + } + if (j < n) { + const part = Math.max(0, coins[i][0] + k - 1 - coins[j][0] + 1) * (coins[j][2]); + res = Math.max(res, cur + part); + } + cur -= (coins[i][1] - coins[i][0] + 1) * (coins[i][2]); + } + + cur = 0; + for (let i = 0, j = 0; i < n; ++i) { + cur += 1 * (coins[i][1] - coins[i][0] + 1) * (coins[i][2]); + while (coins[j][1] < coins[i][1] - k + 1) { + cur -= 1 * (coins[j][1] - coins[j][0] + 1) * (coins[j][2]); + j++; + } + const part = 1 * Math.max(0, coins[i][1] - k - coins[j][0] + 1) * (coins[j][2]); + res = Math.max(res, cur - part); + } + + return res; +}; From 1dab92d53fe336be991797bb7429d8d2ed99d3bb Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 7 Feb 2025 23:07:37 -0800 Subject: [PATCH 1924/2039] Create 3395-subsequences-with-a-unique-middle-mode-i.js --- ...ubsequences-with-a-unique-middle-mode-i.js | 63 +++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 3395-subsequences-with-a-unique-middle-mode-i.js diff --git a/3395-subsequences-with-a-unique-middle-mode-i.js b/3395-subsequences-with-a-unique-middle-mode-i.js new file mode 100644 index 00000000..0ec3f8f9 --- /dev/null +++ b/3395-subsequences-with-a-unique-middle-mode-i.js @@ -0,0 +1,63 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var subsequencesWithMiddleMode = function(nums) { + const n = nums.length; + // 总方案数为C(n,5) + let ans = comb(n, 5); + const mod = 10 ** 9 + 7; + // 统计不合法的个数 + // 记录每个元素的个数 + const hash = new Map(); + for (const num of nums) hash.set(num, (hash.get(num) || 0) + 1); + const pre = new Map(); // 记录之前的元素情况 + // 枚举x，作为子序列最中间的数 + for (let i = 0; i < n - 2; i++) { + const x = nums[i]; + hash.set(x, hash.get(x) - 1); // 更新右边元素的个数 + if (i > 1) { + const right = n - 1 - i; // 右边元素个数 + const left = i; // 左边元素个数 + const preX = pre.get(x) || 0; // 左边x元素个数 + const sufX = hash.get(x) || 0; // 右边x元素个数 + // 不合法：只有一个x的情况，左边选取不是x的两个，右边选取不是x的两个 + ans -= comb(left - preX, 2) * comb(right - sufX, 2); + // 不合法：有两个x，但是要有一个y，出现在2次以上 + for (const [y, sufY] of hash) { + if (y === x) continue; + const preY = pre.get(y) || 0; + // 左边两个Y，右边一个X, yy x xz(z可以为y) + ans -= comb(preY, 2) * sufX * (right - sufX); + // 右边两个Y，左边一个X，zx x yy (z可以为y) + ans -= comb(sufY, 2) * preX * (left - preX); + // 左右各一个y，另一个x在左边，xy x yz(z !== y,避免重复) + ans -= preY * preX * sufY * (right - sufX - sufY); + // 左右各一个y，另一个x在右边，zy x yx(z !== y,避免重复) + ans -= preY * sufY * sufX * (left - preX - preY); + } + } + pre.set(x, (pre.get(x) || 0) + 1); // 更新左边元素的个数 + } + return ans % mod; +}; + + +/** + * @description 求组合数 + * @param {number} n + * @param {number} m + * @returns {number} + */ +function comb(n, m) { + if (n < m) return 0; + let top = 1; + let bottom = 1; + let start = 0; + while (start < m) { + top *= n - start; + bottom *= m - start; + start++; + } + return top / bottom; +} From 052d006894c8f2b1fa162f2550a4099764e89eaa Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Feb 2025 02:21:45 -0800 Subject: [PATCH 1925/2039] Create 3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js --- ...mum-sums-of-at-most-size-k-subsequences.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js diff --git a/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js b/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js new file mode 100644 index 00000000..6813ab11 --- /dev/null +++ b/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minMaxSums = function(nums, k) { + nums.sort((a, b) => a - b) + let res = 0n + const MOD = 1e9 + 7 + const ncr = Array.from({ length: nums.length + 1 }, () => + Array(k + 1).fill(0), + ) + + ncr[0][0] = 1 + for (let n = 1; n <= nums.length; n++) { + ncr[n][0] = 1 + for (let r = 1; r <= k; r++) + ncr[n][r] = (ncr[n - 1][r - 1] + ncr[n - 1][r]) % MOD + } + + for (let n = 0; n < nums.length; n++) { + let numberOfSubsequences = 0 + for (let r = 0; r <= k - 1; r++) + if (n >= r) + numberOfSubsequences = (numberOfSubsequences + ncr[n][r]) % MOD + res = + (res + + ((BigInt(nums[n] + nums[nums.length - n - 1]) * + BigInt(numberOfSubsequences)) % + BigInt(MOD))) % + BigInt(MOD) + } + return Number(res) +}; From 391a9eb8aa41fccda5593423d018de2f8bc823fe Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 9 Feb 2025 03:54:08 -0800 Subject: [PATCH 1926/2039] Update 3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js --- ...mum-sums-of-at-most-size-k-subsequences.js | 40 +++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js b/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js index 6813ab11..7f057c86 100644 --- a/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js +++ b/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences.js @@ -1,3 +1,43 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minMaxSums = function(nums, k) { + const big = BigInt + const mod = big(1e9 + 7) + const n = nums.length + const comb = Array.from({ length: n + 1 }, () => Array(k + 1).fill(0n)) + + comb[0][0] = 1n + for(let i = 1; i <= n; i++) { + comb[i][0] = 1n + for(let j = 1; j <= k; j++) { + comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j] + comb[i][j] %= mod + } + } + + nums.sort((a, b) => a - b) + + let res = 0n + + for(let i = 0; i < n; i++) { + const e = big(nums[i]) + for(let j = 0; j <= Math.min(i, k - 1); j++) { + res += (comb[i][j] * e) % mod + } + for(let j = 0; j < k; j++) { + res += (comb[n - 1 - i][j] * e) % mod + } + } + + + return Number(res % mod) +}; + +// another + /** * @param {number[]} nums * @param {number} k From 8269155622ad32e94e11f5315b94f15a0c06f539 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Feb 2025 03:17:18 -0800 Subject: [PATCH 1927/2039] Update 3209-number-of-subarrays-with-and-value-of-k.js --- ...number-of-subarrays-with-and-value-of-k.js | 54 +++++++++---------- 1 file changed, 27 insertions(+), 27 deletions(-) diff --git a/3209-number-of-subarrays-with-and-value-of-k.js b/3209-number-of-subarrays-with-and-value-of-k.js index 9a46894b..64a0b79b 100644 --- a/3209-number-of-subarrays-with-and-value-of-k.js +++ b/3209-number-of-subarrays-with-and-value-of-k.js @@ -3,44 +3,44 @@ * @param {number} k * @return {number} */ -var countSubarrays = function (nums, k) { - return atLeastK(nums, k) - atLeastK(nums, k + 1) -} +var countSubarrays = function(nums, k) { + return atLeastK(nums, k) - atLeastK(nums, k + 1); +}; function atLeastK(nums, k) { - let ans = 0 - let temp = new Array(32).fill(0) + let res = 0; + let temp = new Array(32).fill(0); - let l = 0 - for (let r = 0; r < nums.length; r++) { - for (let i = 0; i < 32; i++) { - if ((1 << i) & nums[r]) { - temp[i]++ - } - } + let l = 0; + for (let r = 0; r < nums.length; r++) { + for (let i = 0; i < 32; i++) { + if ((1 << i) & nums[r]) { + temp[i]++; + } + } - while (r - l + 1 > 0 && calc(temp, r - l + 1) < k) { - for (let i = 0; i < 32; i++) { - if ((1 << i) & nums[l]) { - temp[i]-- + while ((r - l + 1) > 0 && calc(temp, r - l + 1) < k) { + for (let i = 0; i < 32; i++) { + if ((1 << i) & nums[l]) { + temp[i]--; + } + } + l++; } - } - l++ + res += (r - l + 1); } - ans += r - l + 1 - } - return ans + return res; } // function to calculate the AND from frequency vector function calc(temp, w) { - let ans = 0 - for (let i = 0; i < 32; i++) { - if (temp[i] === w) { - ans += 1 << i + let res = 0; + for (let i = 0; i < 32; i++) { + if (temp[i] === w) { + res += (1 << i); + } } - } - return ans + return res; } From a627800d4a57a35422a9161b709536565e91edae Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Feb 2025 03:46:32 -0800 Subject: [PATCH 1928/2039] Create 3290-maximum-multiplication-score.js --- 3290-maximum-multiplication-score.js | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 3290-maximum-multiplication-score.js diff --git a/3290-maximum-multiplication-score.js b/3290-maximum-multiplication-score.js new file mode 100644 index 00000000..ed6eb065 --- /dev/null +++ b/3290-maximum-multiplication-score.js @@ -0,0 +1,17 @@ +/** + * @param {number[]} a + * @param {number[]} b + * @return {number} + */ +var maxScore = function(a, b) { + const dp = Array(4).fill(-4 * 1e5 * 1e5) + const {max} = Math + for(const e of b) { + dp[3] = max(dp[3], dp[2] + e * a[3]) + dp[2] = max(dp[2], dp[1] + e * a[2]) + dp[1] = max(dp[1], dp[0] + e * a[1]) + dp[0] = max(dp[0], e * a[0]) + } + + return dp[3] +}; From f4d938d4034f566e95de1b4b7a05a2cf2301030d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 14 Feb 2025 03:39:13 -0800 Subject: [PATCH 1929/2039] Update 3350-adjacent-increasing-subarrays-detection-ii.js --- ...acent-increasing-subarrays-detection-ii.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/3350-adjacent-increasing-subarrays-detection-ii.js b/3350-adjacent-increasing-subarrays-detection-ii.js index 537a67a3..c091eba0 100644 --- a/3350-adjacent-increasing-subarrays-detection-ii.js +++ b/3350-adjacent-increasing-subarrays-detection-ii.js @@ -1,3 +1,27 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxIncreasingSubarrays = function (nums) { + const n = nums.length + let up = 1, preMaxUp = 0, res = 0 + + for(let i = 1; i < n; i++) { + if(nums[i] > nums[i - 1]) up++ + else { + preMaxUp = up + up = 1 + } + res = Math.max(res, Math.max(~~(up / 2), Math.min(preMaxUp, up))) + } + + + return res +} + + +// another + /** * @param {number[]} nums * @return {number} From e45b007d4bf02cc2c48c37e06d8b0ee59c56d831 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 17 Feb 2025 03:50:50 -0800 Subject: [PATCH 1930/2039] Update 3366-minimum-array-sum.js --- 3366-minimum-array-sum.js | 50 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/3366-minimum-array-sum.js b/3366-minimum-array-sum.js index 30021e40..b784f5c3 100644 --- a/3366-minimum-array-sum.js +++ b/3366-minimum-array-sum.js @@ -1,3 +1,53 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} op1 + * @param {number} op2 + * @return {number} + */ +var minArraySum = function(nums, k, op1, op2) { + let dp = Array.from({ length: op1 + 1 }, () => Array(op2 + 1).fill(Infinity)) + const {min, floor, ceil} = Math + + dp[op1][op2] = 0 + + for(const e of nums) { + const nxt = Array.from({ length: op1 + 1 }, () => Array(op2 + 1).fill(Infinity)) + for(let i = 0; i <= op1; i++) { + for(let j = 0; j <= op2; j++) { + nxt[i][j] = min(nxt[i][j], dp[i][j] + e) + if(i > 0) { + const cur = ceil(e / 2) + nxt[i - 1][j] = min(nxt[i - 1][j], dp[i][j] + cur) + if(cur >= k && j > 0) { + nxt[i - 1][j - 1] = min(nxt[i - 1][j - 1], dp[i][j] + cur - k) + } + } + if(j > 0 && e >= k) { + const cur = e - k + nxt[i][j - 1] = min(nxt[i][j - 1], dp[i][j] + cur) + if(i > 0) { + nxt[i - 1][j - 1] = min(nxt[i - 1][j - 1], dp[i][j] + ceil(cur / 2)) + } + } + } + } + + dp = nxt + } + + let res = Infinity + for(let i = 0; i <= op1; i++) { + for(let j = 0; j <= op2; j++) { + res = Math.min(res, dp[i][j]) + } + } + + return res +}; + +// another + /** * @param {number[]} nums * @param {number} k From e5ec049eb9c66e48dc42b5c25a00f6128c8f4c1a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Feb 2025 07:01:05 -0800 Subject: [PATCH 1931/2039] Create 3376-minimum-time-to-break-locks-i.js --- 3376-minimum-time-to-break-locks-i.js | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 3376-minimum-time-to-break-locks-i.js diff --git a/3376-minimum-time-to-break-locks-i.js b/3376-minimum-time-to-break-locks-i.js new file mode 100644 index 00000000..9925ba38 --- /dev/null +++ b/3376-minimum-time-to-break-locks-i.js @@ -0,0 +1,25 @@ +/** + * @param {number[]} strength + * @param {number} k + * @return {number} + */ +var findMinimumTime = function(strength, k) { + strength.sort((a, b) => a - b) + const n = strength.length, {floor} = Math + let res = Infinity + f(0, 1, 0) + return res + + function f(mask, x, tmp) { + if(mask === (1 << n) - 1) { + res = Math.min(res, tmp) + return + } + let sum = x, add = 0 + for(let i = 0; i < n; i++) { + if(mask & (1 << i)) continue + add = floor((strength[i] + x - 1) / x) + f(mask | (1 << i), x + k, tmp + add) + } + } +}; From a530000a6ba5fe764905207afa2c09d9e7bd5fca Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Feb 2025 07:04:35 -0800 Subject: [PATCH 1932/2039] Update 3376-minimum-time-to-break-locks-i.js --- 3376-minimum-time-to-break-locks-i.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/3376-minimum-time-to-break-locks-i.js b/3376-minimum-time-to-break-locks-i.js index 9925ba38..7deee055 100644 --- a/3376-minimum-time-to-break-locks-i.js +++ b/3376-minimum-time-to-break-locks-i.js @@ -15,7 +15,7 @@ var findMinimumTime = function(strength, k) { res = Math.min(res, tmp) return } - let sum = x, add = 0 + let add = 0 for(let i = 0; i < n; i++) { if(mask & (1 << i)) continue add = floor((strength[i] + x - 1) / x) From bc37c34df536db0e14ca36e60b004c4c2127cf03 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Feb 2025 07:06:34 -0800 Subject: [PATCH 1933/2039] Update 3376-minimum-time-to-break-locks-i.js --- 3376-minimum-time-to-break-locks-i.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/3376-minimum-time-to-break-locks-i.js b/3376-minimum-time-to-break-locks-i.js index 7deee055..450bba1c 100644 --- a/3376-minimum-time-to-break-locks-i.js +++ b/3376-minimum-time-to-break-locks-i.js @@ -18,7 +18,7 @@ var findMinimumTime = function(strength, k) { let add = 0 for(let i = 0; i < n; i++) { if(mask & (1 << i)) continue - add = floor((strength[i] + x - 1) / x) + add = ceil(strength[i] / x) f(mask | (1 << i), x + k, tmp + add) } } From 1b287d130ba11c7074b3b3e17bd3c45d1b2e1b9d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 19 Feb 2025 23:48:03 -0800 Subject: [PATCH 1934/2039] Create 3393-count-paths-with-the-given-xor-value.js --- 3393-count-paths-with-the-given-xor-value.js | 29 ++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 3393-count-paths-with-the-given-xor-value.js diff --git a/3393-count-paths-with-the-given-xor-value.js b/3393-count-paths-with-the-given-xor-value.js new file mode 100644 index 00000000..8403c4b1 --- /dev/null +++ b/3393-count-paths-with-the-given-xor-value.js @@ -0,0 +1,29 @@ +/** + * @param {number[][]} grid + * @param {number} k + * @return {number} + */ +const countPathsWithXorValue = function(grid, k) { + const m = grid.length, n = grid[0].length + const mod = 1e9 + 7 + const dp = Array.from({length: m}, () => Array.from({length: n}, () => Array(16).fill(0))) + dp[0][0][grid[0][0]] = 1 + + for(let i = 0; i < m; i++) { + for(let j = 0; j < n; j++) { + for(let v = 0; v < 16; v++) { + if(dp[i][j][v] <= 0) continue + if(i + 1 < m) { + const e = grid[i + 1][j] + dp[i + 1][j][v ^ e] = (dp[i + 1][j][v ^ e] + dp[i][j][v]) % mod + } + if(j + 1 < n) { + const e = grid[i][j + 1] + dp[i][j + 1][v ^ e] = (dp[i][j + 1][v ^ e] + dp[i][j][v]) % mod + } + } + } + } + + return dp[m - 1][n - 1][k] +}; From e3e171579e46ef3a4e4a4d98a0c58ed825edee41 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 21 Feb 2025 00:49:37 -0800 Subject: [PATCH 1935/2039] Create 3444-minimum-increments-for-target-multiples-in-an-array.js --- ...ements-for-target-multiples-in-an-array.js | 62 +++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 3444-minimum-increments-for-target-multiples-in-an-array.js diff --git a/3444-minimum-increments-for-target-multiples-in-an-array.js b/3444-minimum-increments-for-target-multiples-in-an-array.js new file mode 100644 index 00000000..f7115be1 --- /dev/null +++ b/3444-minimum-increments-for-target-multiples-in-an-array.js @@ -0,0 +1,62 @@ +/** + * @param {number[]} nums + * @param {number[]} target + * @return {number} + */ +var minimumIncrements = function(nums, target) { + const k = target.length; + const mpp = new Map(); + + for (let mask = 1; mask < (1 << k); mask++) { + const subset = []; + for (let i = 0; i < k; i++) { + if (mask & (1 << i)) { + subset.push(target[i]); + } + } + let currlcm = subset[0]; + for (let j = 1; j < subset.length; j++) { + currlcm = lcm(currlcm, subset[j]); + } + mpp.set(mask, currlcm); + } + + const fullmask = (1 << k) - 1; + const dp = new Array(1 << k).fill(Infinity); + dp[0] = 0; + + for (const num of nums) { + const maskcost = []; + for (const [mask, lcmval] of mpp) { + const rm = num % lcmval; + const cost = (rm === 0) ? 0 : (lcmval - rm); + maskcost.push([mask, cost]); + } + + const newdp = [...dp]; + for (let prevmask = 0; prevmask < (1 << k); prevmask++) { + if (dp[prevmask] === Infinity) continue; + for (const [mask, cost] of maskcost) { + const nmask = prevmask | mask; + const ncost = dp[prevmask] + cost; + if (ncost < newdp[nmask]) { + newdp[nmask] = ncost; + } + } + } + + dp.splice(0, dp.length, ...newdp); + } + + return dp[fullmask] === Infinity ? -1 : dp[fullmask]; +}; +function gcd(a, b) { + while (b) { + [a, b] = [b, a % b]; + } + return a; +} + +function lcm(a, b) { + return (a / gcd(a, b)) * b; +} From db354ae71082421008268e25728329381b802475 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 26 Feb 2025 03:19:12 -0800 Subject: [PATCH 1936/2039] Create 3458-select-k-disjoint-special-substrings.js --- 3458-select-k-disjoint-special-substrings.js | 53 ++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 3458-select-k-disjoint-special-substrings.js diff --git a/3458-select-k-disjoint-special-substrings.js b/3458-select-k-disjoint-special-substrings.js new file mode 100644 index 00000000..e25307b5 --- /dev/null +++ b/3458-select-k-disjoint-special-substrings.js @@ -0,0 +1,53 @@ +/** + * @param {string} s + * @param {number} k + * @return {boolean} + */ +var maxSubstringLength = function (s, k) { + const n = s.length; + const first = Array(26).fill(-1); + const last = Array(26).fill(-1); + + for (let i = 0; i < n; i++) { + const c = s.charCodeAt(i) - 'a'.charCodeAt(0); + if (first[c] === -1) first[c] = i; + last[c] = i; + } + + const intervals = []; + for (let i = 0; i < n; i++) { + const c = s.charCodeAt(i) - 'a'.charCodeAt(0); + if (i !== first[c]) continue; + + let j = last[c]; + for (let k = i; k <= j; k++) { + j = Math.max(j, last[s.charCodeAt(k) - 'a'.charCodeAt(0)]); + } + + let flag = true; + for (let k = i; k <= j; k++) { + if (first[s.charCodeAt(k) - 'a'.charCodeAt(0)] < i) { + flag = false; + break; + } + } + if (!flag) continue; + + if (i === 0 && j === n - 1) continue; + + intervals.push([i, j]); + } + + intervals.sort((a, b) => a[1] - b[1]); + + let cnt = 0; + let currend = -1; + for (const i of intervals) { + if (i[0] > currend) { + cnt++; + currend = i[1]; + } + } + + return cnt >= k; +} From 852870dd3980c52ced7ba8b5ffdd239bb5eb038e Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 27 Feb 2025 02:42:49 -0800 Subject: [PATCH 1937/2039] Create 3394-check-if-grid-can-be-cut-into-sections.js --- ...-check-if-grid-can-be-cut-into-sections.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 3394-check-if-grid-can-be-cut-into-sections.js diff --git a/3394-check-if-grid-can-be-cut-into-sections.js b/3394-check-if-grid-can-be-cut-into-sections.js new file mode 100644 index 00000000..82710629 --- /dev/null +++ b/3394-check-if-grid-can-be-cut-into-sections.js @@ -0,0 +1,30 @@ +/** + * @param {number} n + * @param {number[][]} rectangles + * @return {boolean} + */ +var checkValidCuts = function(n, rectangles) { + const vertical = []; + const horizontal = []; + for (const it of rectangles) { + vertical.push([it[1], it[3]]) + horizontal.push([it[0], it[2]]) + } + const mergeH = mergeIntervals(horizontal); + const mergeV = mergeIntervals(vertical); + return mergeH.length >= 3 || mergeV.length >= 3; +}; +function mergeIntervals(intervals) { + if (intervals.length <= 1) return intervals; + intervals.sort((a, b) => a[0] - b[0]); + const merged = []; + merged.push(intervals[0]); + for (let i = 1; i < intervals.length; ++i) { + if (intervals[i][0] < merged[merged.length - 1][1]) { + merged[merged.length - 1][1] = Math.max(merged[merged.length - 1][1], intervals[i][1]); + } else { + merged.push(intervals[i]); + } + } + return merged; +} From 96df7e43fb31bd1e00a290f862d06802462af2a7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Mar 2025 03:34:49 -0800 Subject: [PATCH 1938/2039] Create 2202-maximize-the-topmost-element-after-k-moves.js --- ...-maximize-the-topmost-element-after-k-moves.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 2202-maximize-the-topmost-element-after-k-moves.js diff --git a/2202-maximize-the-topmost-element-after-k-moves.js b/2202-maximize-the-topmost-element-after-k-moves.js new file mode 100644 index 00000000..244e6835 --- /dev/null +++ b/2202-maximize-the-topmost-element-after-k-moves.js @@ -0,0 +1,15 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumTop = function(nums, k) { + const n = nums.length + if(k === 0) return n >= 1 ? nums[0] : -1 + if(k === 1) return n === 1 ? -1 : nums[1] + if(n === 1) return k % 2 === 0 ? nums[0] : -1 + const tmp = nums.slice(0, Math.min(k - 1, n)) + let res = Math.max(...tmp) + if(k < n) res = Math.max(res, nums[k]) + return res +}; From b7d6d71a1f76c879022bd422966d174932b4bce8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Mar 2025 02:19:46 -0800 Subject: [PATCH 1939/2039] Create 3471-find-the-largest-almost-missing-integer.js --- ...find-the-largest-almost-missing-integer.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 3471-find-the-largest-almost-missing-integer.js diff --git a/3471-find-the-largest-almost-missing-integer.js b/3471-find-the-largest-almost-missing-integer.js new file mode 100644 index 00000000..abe842fa --- /dev/null +++ b/3471-find-the-largest-almost-missing-integer.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var largestInteger = function (nums, k) { + const freq = new Map() + + for (let i = 0; i <= nums.length - k; i++) { + const sub = new Set(nums.slice(i, i + k)) + for (const num of sub) { + freq.set(num, (freq.get(num) || 0) + 1) + } + } + + let ans = -1 + for (const [num, count] of freq) { + if (count === 1) { + ans = Math.max(ans, num) + } + } + return ans +} From 4189a78ad291865425f64281363fd4c98fac1b2a Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Mar 2025 02:20:26 -0800 Subject: [PATCH 1940/2039] Create 3472-longest-palindromic-subsequence-after-at-most-k-operations.js --- ...-subsequence-after-at-most-k-operations.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 3472-longest-palindromic-subsequence-after-at-most-k-operations.js diff --git a/3472-longest-palindromic-subsequence-after-at-most-k-operations.js b/3472-longest-palindromic-subsequence-after-at-most-k-operations.js new file mode 100644 index 00000000..2636a181 --- /dev/null +++ b/3472-longest-palindromic-subsequence-after-at-most-k-operations.js @@ -0,0 +1,32 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var longestPalindromicSubsequence = function (s, k) { + const n = s.length + const dp = Array.from({ length: n }, () => + Array.from({ length: n }, () => Array(k + 1).fill(-1)), + ) + + function cost(a, b) { + const diff = Math.abs(a.charCodeAt(0) - b.charCodeAt(0)) + return Math.min(diff, 26 - diff) + } + + function dfs(i, j, rem) { + if (i > j) return 0 + if (i === j) return 1 + if (dp[i][j][rem] !== -1) return dp[i][j][rem] + + let res = Math.max(dfs(i + 1, j, rem), dfs(i, j - 1, rem)) + const c = cost(s[i], s[j]) + if (c <= rem) { + res = Math.max(res, 2 + dfs(i + 1, j - 1, rem - c)) + } + dp[i][j][rem] = res + return res + } + + return dfs(0, n - 1, k) +} From 5da7e555e0e86516a1159faf7fd761738a444ab9 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Mar 2025 02:20:58 -0800 Subject: [PATCH 1941/2039] Create 3473-sum-of-k-subarrays-with-length-at-least-m.js --- ...m-of-k-subarrays-with-length-at-least-m.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3473-sum-of-k-subarrays-with-length-at-least-m.js diff --git a/3473-sum-of-k-subarrays-with-length-at-least-m.js b/3473-sum-of-k-subarrays-with-length-at-least-m.js new file mode 100644 index 00000000..7ca52435 --- /dev/null +++ b/3473-sum-of-k-subarrays-with-length-at-least-m.js @@ -0,0 +1,33 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} m + * @return {number} + */ +var maxSum = function (nums, k, m) { + const n = nums.length + + const prefix = new Array(n + 1).fill(0) + for (let i = 0; i < n; i++) { + prefix[i + 1] = prefix[i] + nums[i] + } + + const dp = Array.from({ length: k + 1 }, () => + new Array(n + 1).fill(Number.MIN_SAFE_INTEGER / 2), + ) + for (let i = 0; i <= n; i++) { + dp[0][i] = 0 + } + for (let j = 0; j < k; j++) { + const best = new Array(n + 1).fill(0) + best[0] = dp[j][0] - prefix[0] + for (let i = 1; i <= n; i++) { + best[i] = Math.max(best[i - 1], dp[j][i] - prefix[i]) + } + for (let i = m; i <= n; i++) { + const candidate = prefix[i] + best[i - m] + dp[j + 1][i] = i === m ? candidate : Math.max(dp[j + 1][i - 1], candidate) + } + } + return dp[k][n] +} From 28071f16b6aabced873386089c081bb7a5a7c349 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 2 Mar 2025 02:21:31 -0800 Subject: [PATCH 1942/2039] Create 3474-lexicographically-smallest-generated-string.js --- ...cographically-smallest-generated-string.js | 59 +++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 3474-lexicographically-smallest-generated-string.js diff --git a/3474-lexicographically-smallest-generated-string.js b/3474-lexicographically-smallest-generated-string.js new file mode 100644 index 00000000..061efbba --- /dev/null +++ b/3474-lexicographically-smallest-generated-string.js @@ -0,0 +1,59 @@ +/** + * @param {string} str1 + * @param {string} str2 + * @return {string} + */ +var generateString = function (str1, str2) { + const n = str1.length + const m = str2.length + const len = n + m - 1 + const c = '*' + + const ans = new Array(len).fill(c) + const forced = new Array(len).fill(false) + + for (let i = 0; i < n; i++) { + if (str1[i] === 'T') { + for (let j = 0; j < m; j++) { + const pos = i + j + if (ans[pos] === c) { + ans[pos] = str2[j] + forced[pos] = true + } else { + if (ans[pos] !== str2[j]) return '' + } + } + } + } + + for (let i = 0; i < len; i++) { + if (ans[i] === c) { + ans[i] = 'a' + } + } + + for (let i = 0; i < n; i++) { + if (str1[i] === 'F') { + let windowEqual = true + for (let j = 0; j < m; j++) { + if (ans[i + j] !== str2[j]) { + windowEqual = false + break + } + } + if (windowEqual) { + let modified = false + for (let j = m - 1; j >= 0; j--) { + const pos = i + j + if (!forced[pos]) { + ans[pos] = 'b' + modified = true + break + } + } + if (!modified) return '' + } + } + } + return ans.join('') +} From d2685c34c3b8401aa7ff6ac55b4db12430f42cc1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 Mar 2025 02:12:33 -0800 Subject: [PATCH 1943/2039] Create 2498-frog-jump-ii.js --- 2498-frog-jump-ii.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 2498-frog-jump-ii.js diff --git a/2498-frog-jump-ii.js b/2498-frog-jump-ii.js new file mode 100644 index 00000000..e9fc24fc --- /dev/null +++ b/2498-frog-jump-ii.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} stones + * @return {number} + */ +var maxJump = function(stones) { + let res = stones[1]-stones[0]; + const {max} = Math + for(let i = 3; i < stones.length; i+=2) res = max(res, stones[i]-stones[i-2]); + for(let i = 2; i < stones.length; i+=2) res = max(res, stones[i]-stones[i-2]); + return res; +}; From 3271b36b49f517aef80e07b0a2a93e253f198927 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Mar 2025 22:58:04 -0800 Subject: [PATCH 1944/2039] Create 2499-minimum-total-cost-to-make-arrays-unequal.js --- ...nimum-total-cost-to-make-arrays-unequal.js | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 2499-minimum-total-cost-to-make-arrays-unequal.js diff --git a/2499-minimum-total-cost-to-make-arrays-unequal.js b/2499-minimum-total-cost-to-make-arrays-unequal.js new file mode 100644 index 00000000..67815bc5 --- /dev/null +++ b/2499-minimum-total-cost-to-make-arrays-unequal.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minimumTotalCost = function(nums1, nums2) { + const n = nums1.length; + let ans = 0; + const freq = new Map(); + let maxFrequency = 0, maxFrequencyValue = 0, toSwap = 0; + + for (let i = 0; i < n; i++) { + if (nums1[i] === nums2[i]) { + freq.set(nums1[i], (freq.get(nums1[i]) || 0) + 1); + if (freq.get(nums1[i]) > maxFrequency) { + maxFrequencyValue = nums1[i]; + } + maxFrequency = Math.max(maxFrequency, freq.get(nums1[i])); + toSwap++; + ans += i; + } + } + + for (let i = 0; i < n; i++) { + if (maxFrequency > toSwap / 2 && nums1[i] !== nums2[i] && nums1[i] !== maxFrequencyValue && nums2[i] !== maxFrequencyValue) { + ans += i; + toSwap++; + } + } + + if (maxFrequency > toSwap / 2) return -1; + + return ans; +}; From ff2d09a0a5a7bad3613d3ef8f156e83d9d7cfc0e Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 5 Mar 2025 04:14:12 -0800 Subject: [PATCH 1945/2039] Update 2499-minimum-total-cost-to-make-arrays-unequal.js --- ...nimum-total-cost-to-make-arrays-unequal.js | 43 ++++++++++--------- 1 file changed, 22 insertions(+), 21 deletions(-) diff --git a/2499-minimum-total-cost-to-make-arrays-unequal.js b/2499-minimum-total-cost-to-make-arrays-unequal.js index 67815bc5..a759f069 100644 --- a/2499-minimum-total-cost-to-make-arrays-unequal.js +++ b/2499-minimum-total-cost-to-make-arrays-unequal.js @@ -4,31 +4,32 @@ * @return {number} */ var minimumTotalCost = function(nums1, nums2) { - const n = nums1.length; - let ans = 0; - const freq = new Map(); - let maxFrequency = 0, maxFrequencyValue = 0, toSwap = 0; - - for (let i = 0; i < n; i++) { - if (nums1[i] === nums2[i]) { - freq.set(nums1[i], (freq.get(nums1[i]) || 0) + 1); - if (freq.get(nums1[i]) > maxFrequency) { - maxFrequencyValue = nums1[i]; - } - maxFrequency = Math.max(maxFrequency, freq.get(nums1[i])); - toSwap++; - ans += i; + const n = nums1.length, {floor, max} = Math + let res = 0 + const freq = new Map() + let maxFreq = 0, maxFreqVal = 0, toSwap = 0 + for(let i = 0; i < n; i++) { + if(nums1[i] === nums2[i]) { + const e = nums1[i] + freq.set(e, (freq.get(e) || 0) + 1) + res += i + const f = freq.get(e) + toSwap++ + if(f > maxFreq) { + maxFreqVal = e } + maxFreq = max(maxFreq, f) } + } - for (let i = 0; i < n; i++) { - if (maxFrequency > toSwap / 2 && nums1[i] !== nums2[i] && nums1[i] !== maxFrequencyValue && nums2[i] !== maxFrequencyValue) { - ans += i; - toSwap++; - } + for(let i = 0; i < n; i++) { + if(maxFreq > floor(toSwap / 2) && nums1[i] !== nums2[i] && nums1[i] !== maxFreqVal && nums2[i] !== maxFreqVal) { + toSwap++ + res += i } + } - if (maxFrequency > toSwap / 2) return -1; + if(maxFreq > floor(toSwap / 2)) return -1 - return ans; + return res }; From a01ba1dd301697540a78088c104c7a465a06712c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 Mar 2025 23:08:42 -0800 Subject: [PATCH 1946/2039] Create 3477-fruits-into-baskets-ii.js --- 3477-fruits-into-baskets-ii.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 3477-fruits-into-baskets-ii.js diff --git a/3477-fruits-into-baskets-ii.js b/3477-fruits-into-baskets-ii.js new file mode 100644 index 00000000..ef332803 --- /dev/null +++ b/3477-fruits-into-baskets-ii.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} fruits + * @param {number[]} baskets + * @return {number} + */ +var numOfUnplacedFruits = function (fruits, baskets) { + for (let i = 0; i < fruits.length; i++) { + for (let j = 0; j < baskets.length; j++) { + if (baskets[j] >= fruits[i]) { + baskets[j] = -1 + break + } + } + } + let res = 0 + for (let i = 0; i < baskets.length; i++) { + res += baskets[i] !== -1 ? 1 : 0 + } + return res +} From aa69bb5984c5be8059d9e5055ee279b5621ecbdb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 Mar 2025 23:09:11 -0800 Subject: [PATCH 1947/2039] Create 3478-choose-k-elements-with-maximum-sum.js --- 3478-choose-k-elements-with-maximum-sum.js | 120 +++++++++++++++++++++ 1 file changed, 120 insertions(+) create mode 100644 3478-choose-k-elements-with-maximum-sum.js diff --git a/3478-choose-k-elements-with-maximum-sum.js b/3478-choose-k-elements-with-maximum-sum.js new file mode 100644 index 00000000..864f3886 --- /dev/null +++ b/3478-choose-k-elements-with-maximum-sum.js @@ -0,0 +1,120 @@ +/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number[]} + */ +var findMaxSum = function (nums1, nums2, k) { + const n = nums1.length; + const answer = new Array(n).fill(0); + + const pairs = new Array(n); + for (let i = 0; i < n; i++) { + pairs[i] = new Pair(nums1[i], nums2[i], i); + } + + pairs.sort((a, b) => a.num1 - b.num1); + + const minHeap = new PQ((a, b) => a < b); + let currentSum = 0; + + let i = 0; + while (i < n) { + let j = i; + while (j < n && pairs[j].num1 === pairs[i].num1) { + answer[pairs[j].index] = currentSum; + j++; + } + for (let t = i; t < j; t++) { + const value = pairs[t].num2; + if (minHeap.size() < k) { + minHeap.push(value); + currentSum += value; + } else if (!minHeap.isEmpty() && value > minHeap.peek()) { + currentSum -= minHeap.peek(); + minHeap.pop(); + minHeap.push(value); + currentSum += value; + } + } + i = j; + } + + return answer; +} +class Pair { + constructor(num1, num2, index) { + this.num1 = num1; + this.num2 = num2; + this.index = index; + } +} + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} + From 20abf684cf0d80a777ed7d17bd33d91776e3794b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 Mar 2025 23:09:33 -0800 Subject: [PATCH 1948/2039] Create 3479-fruits-into-baskets-iii.js --- 3479-fruits-into-baskets-iii.js | 73 +++++++++++++++++++++++++++++++++ 1 file changed, 73 insertions(+) create mode 100644 3479-fruits-into-baskets-iii.js diff --git a/3479-fruits-into-baskets-iii.js b/3479-fruits-into-baskets-iii.js new file mode 100644 index 00000000..d9077763 --- /dev/null +++ b/3479-fruits-into-baskets-iii.js @@ -0,0 +1,73 @@ +/** + * @param {number[]} fruits + * @param {number[]} baskets + * @return {number} + */ +var numOfUnplacedFruits = function (fruits, baskets) { + const n = fruits.length + const segTree = new SegmentTree(baskets) + let unplaced = 0 + + for (const fruit of fruits) { + const idx = segTree.query(fruit) + if (idx === -1) { + unplaced++ + } else { + segTree.update(idx, -1) + } + } + return unplaced +} +class SegmentTree { + constructor(baskets) { + this.n = baskets.length + this.tree = new Array(4 * this.n) + this.build(baskets, 1, 0, this.n - 1) + } + + build(baskets, node, start, end) { + if (start === end) { + this.tree[node] = baskets[start] + } else { + const mid = Math.floor((start + end) / 2) + this.build(baskets, 2 * node, start, mid) + this.build(baskets, 2 * node + 1, mid + 1, end) + this.tree[node] = Math.max(this.tree[2 * node], this.tree[2 * node + 1]) + } + } + + update(pos, val) { + this.updateNode(1, 0, this.n - 1, pos, val) + } + + updateNode(node, start, end, pos, val) { + if (start === end) { + this.tree[node] = val + } else { + const mid = Math.floor((start + end) / 2) + if (pos <= mid) { + this.updateNode(2 * node, start, mid, pos, val) + } else { + this.updateNode(2 * node + 1, mid + 1, end, pos, val) + } + this.tree[node] = Math.max(this.tree[2 * node], this.tree[2 * node + 1]) + } + } + + query(required) { + if (this.tree[1] < required) return -1 + return this.queryNode(1, 0, this.n - 1, required) + } + + queryNode(node, start, end, required) { + if (start === end) { + return start + } + const mid = Math.floor((start + end) / 2) + if (this.tree[2 * node] >= required) { + return this.queryNode(2 * node, start, mid, required) + } else { + return this.queryNode(2 * node + 1, mid + 1, end, required) + } + } +} From 6e1732c6685681a69a650e4249541ac05456f327 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 8 Mar 2025 23:09:58 -0800 Subject: [PATCH 1949/2039] Create 3480-maximize-subarrays-after-removing-one-conflicting-pair.js --- ...ays-after-removing-one-conflicting-pair.js | 113 ++++++++++++++++++ 1 file changed, 113 insertions(+) create mode 100644 3480-maximize-subarrays-after-removing-one-conflicting-pair.js diff --git a/3480-maximize-subarrays-after-removing-one-conflicting-pair.js b/3480-maximize-subarrays-after-removing-one-conflicting-pair.js new file mode 100644 index 00000000..ce7077f2 --- /dev/null +++ b/3480-maximize-subarrays-after-removing-one-conflicting-pair.js @@ -0,0 +1,113 @@ +/** + * @param {number} n + * @param {number[][]} conflictingPairs + * @return {number} + */ +var maxSubarrays = function (n, conflictingPairs) { + const best = new Array(n + 2).fill(n + 1) + const second = new Array(n + 2).fill(n + 1) + const freq = new Array(n + 2).fill(0) + + for (const pair of conflictingPairs) { + let [a, b] = pair + if (a > b) { + ;[a, b] = [b, a] + } + if (b < best[a]) { + second[a] = best[a] + best[a] = b + freq[a] = 1 + } else if (b === best[a]) { + freq[a]++ + } else if (b < second[a]) { + second[a] = b + } + } + + const F = new Array(n + 2).fill(0) + const M = new Array(n + 2).fill(0) + F[n + 1] = n + 1 + F[n] = best[n] + M[n] = n + for (let i = n - 1; i >= 1; i--) { + if (best[i] <= F[i + 1]) { + F[i] = best[i] + M[i] = i + } else { + F[i] = F[i + 1] + M[i] = M[i + 1] + } + } + + let origTotal = 0 + for (let i = 1; i <= n; i++) { + origTotal += F[i] - i + } + + const indicesByM = Array.from({ length: n + 2 }, () => []) + for (let i = 1; i <= n; i++) { + const idx = M[i] + indicesByM[idx].push(i) + } + + const rmq = new RMQ(best, n) + let bestTotal = origTotal + + for (let a = 1; a <= n; a++) { + if (best[a] === n + 1) continue + if (freq[a] > 1) continue + const B = best[a] + const newB = second[a] + const T = a < n ? F[a + 1] : n + 1 + const effectiveCandidate = Math.min(newB, T) + if (effectiveCandidate <= B) continue + + let delta = 0 + for (const i of indicesByM[a]) { + const curOld = B + let candidate + if (i < a) { + candidate = rmq.query(i, a - 1) + } else { + candidate = n + 1 + } + const newVal = Math.min(candidate, effectiveCandidate) + let improvement = newVal - curOld + if (improvement < 0) improvement = 0 + delta += improvement + } + const candidateTotal = origTotal + delta + bestTotal = Math.max(bestTotal, candidateTotal) + } + + return bestTotal +} + +class RMQ { + constructor(arr, n) { + this.n = n + this.log = new Array(n + 2).fill(0) + for (let i = 2; i <= n; i++) { + this.log[i] = this.log[Math.floor(i / 2)] + 1 + } + const K = this.log[n] + 1 + this.st = Array.from({ length: n + 1 }, () => new Array(K).fill(0)) + for (let i = 1; i <= n; i++) { + this.st[i][0] = arr[i] + } + for (let j = 1; j < K; j++) { + for (let i = 1; i + (1 << j) - 1 <= n; i++) { + this.st[i][j] = Math.min( + this.st[i][j - 1], + this.st[i + (1 << (j - 1))][j - 1], + ) + } + } + } + + query(L, R) { + if (L > R) return Infinity + const j = this.log[R - L + 1] + return Math.min(this.st[L][j], this.st[R - (1 << j) + 1][j]) + } +} From 2705feb5aa4169ee01f96c4a89fa3030c8e062fd Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Mar 2025 20:19:18 -0700 Subject: [PATCH 1950/2039] Update 2576-find-the-maximum-number-of-marked-indices.js --- 2576-find-the-maximum-number-of-marked-indices.js | 11 +++++------ 1 file changed, 5 insertions(+), 6 deletions(-) diff --git a/2576-find-the-maximum-number-of-marked-indices.js b/2576-find-the-maximum-number-of-marked-indices.js index de2fe1c7..2672d5af 100644 --- a/2576-find-the-maximum-number-of-marked-indices.js +++ b/2576-find-the-maximum-number-of-marked-indices.js @@ -2,17 +2,16 @@ * @param {number[]} nums * @return {number} */ -const maxNumOfMarkedIndices = function(nums) { +var maxNumOfMarkedIndices = function(nums) { let res = 0 - const n = nums.length + const n = nums.length nums.sort((a, b) => a - b) - for(let i = 0, j = n - Math.floor(n / 2); j < n; j++) { + for(let i = 0, j = Math.floor((n + 1) / 2); j < n; j++) { if(nums[i] * 2 <= nums[j]) { - res += 2 - i++ + res += 2 + i++ } } - return res }; From bf461b1db3bf3c99b4c078662e459e33e11445f8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 14 Mar 2025 04:58:51 -0700 Subject: [PATCH 1951/2039] Update 2745-construct-the-longest-new-string.js --- 2745-construct-the-longest-new-string.js | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/2745-construct-the-longest-new-string.js b/2745-construct-the-longest-new-string.js index 523bcf91..cc895595 100644 --- a/2745-construct-the-longest-new-string.js +++ b/2745-construct-the-longest-new-string.js @@ -1,3 +1,27 @@ +/** + * @param {number} x + * @param {number} y + * @param {number} z + * @return {number} + */ +var longestString = function(x, y, z) { + // x + y + // y + x + // y + z + // z + z + let res = 0 + const {min} = Math + const minXY = min(x, y) + if(x === y) res = 2 * x + 2 * y + 2 * z + else { + res = (minXY * 2 + (minXY + 1) * 2 + 2 * z) + } + + return res +}; + +// another + /** * @param {number} x * @param {number} y From 624472e83be72f2d61d94443501943a7b6d11301 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Mar 2025 03:56:52 -0700 Subject: [PATCH 1952/2039] Create 3487-maximum-unique-subarray-sum-after-deletion.js --- 3487-maximum-unique-subarray-sum-after-deletion.js | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 3487-maximum-unique-subarray-sum-after-deletion.js diff --git a/3487-maximum-unique-subarray-sum-after-deletion.js b/3487-maximum-unique-subarray-sum-after-deletion.js new file mode 100644 index 00000000..f632eb4d --- /dev/null +++ b/3487-maximum-unique-subarray-sum-after-deletion.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxSum = function(nums) { + if (nums.every(num => num < 0)) { + return Math.max(...nums) + } + return Array.from(new Set(nums)).filter(num => num > 0).reduce((acc, num) => acc + num, 0) + +}; From 9005ea8e3a83bdf7894dad61acbce966d0ef9cdb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Mar 2025 03:57:17 -0700 Subject: [PATCH 1953/2039] Create 3488-closest-equal-element-queries.js --- 3488-closest-equal-element-queries.js | 72 +++++++++++++++++++++++++++ 1 file changed, 72 insertions(+) create mode 100644 3488-closest-equal-element-queries.js diff --git a/3488-closest-equal-element-queries.js b/3488-closest-equal-element-queries.js new file mode 100644 index 00000000..489101fe --- /dev/null +++ b/3488-closest-equal-element-queries.js @@ -0,0 +1,72 @@ +/** + * @param {number[]} nums + * @param {number[]} queries + * @return {number[]} + */ +var solveQueries = function (nums, queries) { + const prabhatSize = nums.length; + const prabhatMap = new Map(); + + for (let prabhatIndex = 0; prabhatIndex < prabhatSize; prabhatIndex++) { + if (!prabhatMap.has(nums[prabhatIndex])) { + prabhatMap.set(nums[prabhatIndex], []); + } + prabhatMap.get(nums[prabhatIndex]).push(prabhatIndex); + } + + for (const prabhatList of prabhatMap.values()) { + prabhatList.sort((a, b) => a - b); + } + + const res = new Array(queries.length); + + for (let i = 0; i < queries.length; i++) { + const prabhatQuery = queries[i]; + const prabhatValue = nums[prabhatQuery]; + const prabhatIndexList = prabhatMap.get(prabhatValue); + + if (prabhatIndexList.length < 2) { + res[i] = -1; + continue; + } + + let prabhatPos = binarySearch(prabhatIndexList, prabhatQuery); + if (prabhatPos < 0) { + prabhatPos = -prabhatPos - 1; + } + + const prabhatLeftIndex = (prabhatPos - 1 + prabhatIndexList.length) % prabhatIndexList.length; + const prabhatRightIndex = (prabhatPos + 1) % prabhatIndexList.length; + + const prabhatLeftCandidate = prabhatIndexList[prabhatLeftIndex]; + const prabhatRightCandidate = prabhatIndexList[prabhatRightIndex]; + + let prabhatDistLeft = Math.abs(prabhatQuery - prabhatLeftCandidate); + let prabhatDistRight = Math.abs(prabhatQuery - prabhatRightCandidate); + + prabhatDistLeft = Math.min(prabhatDistLeft, prabhatSize - prabhatDistLeft); + prabhatDistRight = Math.min(prabhatDistRight, prabhatSize - prabhatDistRight); + + res[i] = Math.min(prabhatDistLeft, prabhatDistRight); + } + + return res; +} + + +function binarySearch(arr, target) { + let left = 0; + let right = arr.length - 1; + + while (left <= right) { + const mid = Math.floor((left + right) / 2); + if (arr[mid] === target) { + return mid; // Found the target + } else if (arr[mid] < target) { + left = mid + 1; + } else { + right = mid - 1; + } + } + return -(left + 1); // Target not found +} From 61cb71b49cb9c74371c79fe8e13156cdf4081796 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Mar 2025 03:57:53 -0700 Subject: [PATCH 1954/2039] Create 3489-zero-array-transformation-iv.js --- 3489-zero-array-transformation-iv.js | 37 ++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 3489-zero-array-transformation-iv.js diff --git a/3489-zero-array-transformation-iv.js b/3489-zero-array-transformation-iv.js new file mode 100644 index 00000000..d016ab29 --- /dev/null +++ b/3489-zero-array-transformation-iv.js @@ -0,0 +1,37 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var minZeroArray = function (nums, queries) { + if (nums.every((num) => num === 0)) return 0 + + function canZero(k) { + for (let i = 0; i < nums.length; i++) { + const target = nums[i] + const values = [] + for (let j = 0; j < k; j++) { + const [l, r, v] = queries[j] + if (i >= l && i <= r) { + values.push(v) + } + } + const dp = new Array(target + 1).fill(false) + dp[0] = true + for (const v of values) { + for (let s = target; s >= v; s--) { + if (dp[s - v]) dp[s] = true + } + } + if (!dp[target]) return false + } + return true + } + + for (let i = 0; i < queries.length; i++) { + if (canZero(i + 1)) { + return i + 1 + } + } + return -1 +} From 595c3ab1094a499193e0895268f2a03f9967d9c1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 16 Mar 2025 03:58:27 -0700 Subject: [PATCH 1955/2039] Create 3490-count-beautiful-numbers.js --- 3490-count-beautiful-numbers.js | 63 +++++++++++++++++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 3490-count-beautiful-numbers.js diff --git a/3490-count-beautiful-numbers.js b/3490-count-beautiful-numbers.js new file mode 100644 index 00000000..481277db --- /dev/null +++ b/3490-count-beautiful-numbers.js @@ -0,0 +1,63 @@ +/** + * @param {number} l + * @param {number} r + * @return {number} + */ +var beautifulNumbers = function (l, r) { + const toDigits = (n) => Array.from(String(n), Number) + + const countUpTo = (x) => (x < 0 ? 0n : dp(toDigits(x))) + return Number(countUpTo(r) - countUpTo(l - 1)) + + function dp(digits) { + const n = digits.length + + const seen = new Map() + + function dfs(pos, tight, started, s, p, hasZero) { + if (pos === n) { + if (!started) return 0n + return hasZero || (s !== 0 && p % s === 0) ? 1n : 0n + } + const key = state(pos, tight, started, s, p, hasZero) + if (seen.has(key)) return seen.get(key) + + let ans = 0n + const limit = tight ? digits[pos] : 9 + for (let d = 0; d <= limit; d++) { + const newTight = tight && d === limit + if (!started && d === 0) { + ans += dfs(pos + 1, newTight, false, 0, 1, false) + } else { + const newStarted = true + if (d === 0) { + ans += dfs(pos + 1, newTight, newStarted, s + d, 0, true) + } else { + const newP = !started ? d : p * d + ans += dfs(pos + 1, newTight, newStarted, s + d, newP, hasZero) + } + } + } + seen.set(key, ans) + return ans + } + return dfs(0, true, false, 0, 1, false) + } +} + +function state(pos, tight, started, s, p, hasZero) { + return `${pos},${tight},${started},${s},${p},${hasZero}` +} +/* +class State { + constructor(pos, tight, started, s, p, hasZero) { + this.pos = pos + this.tight = tight + this.started = started + this.s = s + this.p = p + this.hasZero = hasZero + } +} +*/ + From 1a48277c9f51d031a2b9c3a91fad9c3cd227bdc3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 18 Mar 2025 07:54:26 -0700 Subject: [PATCH 1956/2039] Create 3301-maximize-the-total-height-of-unique-towers.js --- ...imize-the-total-height-of-unique-towers.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 3301-maximize-the-total-height-of-unique-towers.js diff --git a/3301-maximize-the-total-height-of-unique-towers.js b/3301-maximize-the-total-height-of-unique-towers.js new file mode 100644 index 00000000..6c3f633b --- /dev/null +++ b/3301-maximize-the-total-height-of-unique-towers.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} maximumHeight + * @return {number} + */ +var maximumTotalSum = function(maximumHeight) { + const n = maximumHeight.length; + maximumHeight.sort((a, b) => a - b); + + let sum = 0; + let lastAssignedHeight = Number.MAX_SAFE_INTEGER; + + for (let i = n - 1; i >= 0; i--) { + const currentHeight = Math.min(maximumHeight[i], lastAssignedHeight - 1); + + if (currentHeight < 1) { + return -1; + } + + sum += currentHeight; + lastAssignedHeight = currentHeight; + } + + return sum; +}; From d1c49db55d9e986b0d625c6e0faf5b8a353bed82 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Mar 2025 00:03:50 +0800 Subject: [PATCH 1957/2039] Create 3500-minimum-cost-to-divide-array-into-subarrays.js --- ...mum-cost-to-divide-array-into-subarrays.js | 74 +++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 3500-minimum-cost-to-divide-array-into-subarrays.js diff --git a/3500-minimum-cost-to-divide-array-into-subarrays.js b/3500-minimum-cost-to-divide-array-into-subarrays.js new file mode 100644 index 00000000..c8b802b0 --- /dev/null +++ b/3500-minimum-cost-to-divide-array-into-subarrays.js @@ -0,0 +1,74 @@ +class ConvexHullTrick { + constructor() { + this.lines = [] + this.pointer = 0 + } + + addLine(m, b) { + const newLine = { m, b, xLeft: 0 } + while (this.lines.length > 0) { + const last = this.lines[this.lines.length - 1] + const x = this.intersect(newLine, last) + if (x <= last.xLeft) { + this.lines.pop() + } else { + break + } + } + if (this.lines.length === 0) { + newLine.xLeft = -Infinity + } else { + newLine.xLeft = this.intersect(newLine, this.lines[this.lines.length - 1]) + } + this.lines.push(newLine) + } + + query(x) { + if (this.pointer >= this.lines.length) this.pointer = this.lines.length - 1 + while ( + this.pointer < this.lines.length - 1 && + this.lines[this.pointer + 1].xLeft <= x + ) { + this.pointer++ + } + return this.lines[this.pointer].m * x + this.lines[this.pointer].b + } + + intersect(line1, line2) { + return (line2.b - line1.b) / (line1.m - line2.m) + } +} + +function minimumCost(nums, cost, k) { + const n = nums.length + const preNum = new Array(n + 1).fill(0) + const preCost = new Array(n + 1).fill(0) + + for (let i = 0; i < n; i++) { + preNum[i + 1] = preNum[i] + nums[i] + preCost[i + 1] = preCost[i] + cost[i] + } + + const inf = Number.MAX_SAFE_INTEGER / 2 + const dp = Array.from({ length: n + 1 }, () => new Array(n + 1).fill(inf)) + dp[0][0] = 0 + + for (let j = 1; j <= n; j++) { + const cht = new ConvexHullTrick() + for (let l = j - 1; l < n; l++) { + if (dp[l][j - 1] < inf) { + cht.addLine(-preCost[l], dp[l][j - 1]) + } + } + for (let i = j; i <= n; i++) { + const query = cht.query(preNum[i] + k * j) + dp[i][j] = (preNum[i] + k * j) * preCost[i] + query + } + } + + let ans = inf + for (let j = 1; j <= n; j++) { + ans = Math.min(ans, dp[n][j]) + } + return ans +} From 20c354926a0ab5fdeb06633928c25483eac873d5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Mar 2025 00:04:24 +0800 Subject: [PATCH 1958/2039] Create 3499-maximize-active-section-with-trade-i.js --- 3499-maximize-active-section-with-trade-i.js | 39 ++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 3499-maximize-active-section-with-trade-i.js diff --git a/3499-maximize-active-section-with-trade-i.js b/3499-maximize-active-section-with-trade-i.js new file mode 100644 index 00000000..6db89c42 --- /dev/null +++ b/3499-maximize-active-section-with-trade-i.js @@ -0,0 +1,39 @@ +/** + * @param {string} s + * @return {number} + */ +var maxActiveSectionsAfterTrade = function (s) { + const n = s.length + const c1 = Array.from(s).filter((char) => char === '1').length + + let ans = 0 + let i = 0 + while (i < n) { + if (s[i] === '1') { + const start = i + while (i < n && s[i] === '1') { + i++ + } + const end = i - 1 + if (start > 0 && end < n - 1) { + let leftZeros = 0 + let j = start - 1 + while (j >= 0 && s[j] === '0') { + leftZeros++ + j-- + } + let rightZeros = 0 + j = end + 1 + while (j < n && s[j] === '0') { + rightZeros++ + j++ + } + const more = leftZeros + rightZeros + ans = Math.max(ans, more) + } + } else { + i++ + } + } + return c1 + ans +} From b98eab3dcb9ca95801604bb5fca6e8d38550ae2f Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 30 Mar 2025 00:04:51 +0800 Subject: [PATCH 1959/2039] Create 3498-reverse-degree-of-a-string.js --- 3498-reverse-degree-of-a-string.js | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 3498-reverse-degree-of-a-string.js diff --git a/3498-reverse-degree-of-a-string.js b/3498-reverse-degree-of-a-string.js new file mode 100644 index 00000000..3d554ea5 --- /dev/null +++ b/3498-reverse-degree-of-a-string.js @@ -0,0 +1,10 @@ +/** + * @param {string} s + * @return {number} + */ +var reverseDegree = function(s) { + return Array.from(s).reduce((sum, ch, i) => { + const pos = 'z'.charCodeAt(0) - ch.charCodeAt(0) + 1 + return sum + pos * (i + 1) + }, 0) +}; From 0a0476a927069b40066939d171d917ec96e4de7d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Apr 2025 04:52:04 -0700 Subject: [PATCH 1960/2039] Create 3508-implement-router.js --- 3508-implement-router.js | 96 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 96 insertions(+) create mode 100644 3508-implement-router.js diff --git a/3508-implement-router.js b/3508-implement-router.js new file mode 100644 index 00000000..37ce3c33 --- /dev/null +++ b/3508-implement-router.js @@ -0,0 +1,96 @@ +class Router { + constructor(memoryLimit) { + this.memoryLimit = memoryLimit; + this.storage = []; + this.packetSet = new Set(); + this.destMap = new Map(); + } + + addPacket(source, destination, timestamp) { + const packet = [source, destination, timestamp]; + if (this.packetSet.has(packet.toString())) { + return false; + } + + if (this.storage.length >= this.memoryLimit) { + this._removeOldest(); + } + + this.storage.push(packet); + this.packetSet.add(packet.toString()); + + if (!this.destMap.has(destination)) { + this.destMap.set(destination, []); + } + + this.destMap.get(destination).push(timestamp); + return true; + } + + forwardPacket() { + if (this.storage.length === 0) { + return []; + } + + const packet = this.storage.shift(); + const [source, destination, timestamp] = packet; + this.packetSet.delete(packet.toString()); + + const tsList = this.destMap.get(destination); + const idx = this._binarySearch(tsList, timestamp); + if (idx < tsList.length && tsList[idx] === timestamp) { + tsList.splice(idx, 1); + } + + if (tsList.length === 0) { + this.destMap.delete(destination); + } + + return [source, destination, timestamp]; + } + + getCount(destination, startTime, endTime) { + if (!this.destMap.has(destination)) { + return 0; + } + + const tsList = this.destMap.get(destination); + const leftIndex = this._binarySearch(tsList, startTime); + const rightIndex = this._binarySearch(tsList, endTime, true); + return rightIndex - leftIndex; + } + + _removeOldest() { + if (this.storage.length > 0) { + const packet = this.storage.shift(); + const [source, destination, timestamp] = packet; + this.packetSet.delete(packet.toString()); + + const tsList = this.destMap.get(destination); + const idx = this._binarySearch(tsList, timestamp); + if (idx < tsList.length && tsList[idx] === timestamp) { + tsList.splice(idx, 1); + } + + if (tsList.length === 0) { + this.destMap.delete(destination); + } + } + } + + _binarySearch(arr, target, isRight = false) { + let left = 0; + let right = arr.length; + + while (left < right) { + const mid = Math.floor((left + right) / 2); + if (arr[mid] < target || (isRight && arr[mid] === target)) { + left = mid + 1; + } else { + right = mid; + } + } + + return left; + } +} From 31a713916c15cf6e4d1e60265648bcae3c222b96 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Apr 2025 04:52:46 -0700 Subject: [PATCH 1961/2039] Create 3507-minimum-pair-removal-to-sort-array-i.js --- 3507-minimum-pair-removal-to-sort-array-i.js | 34 ++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 3507-minimum-pair-removal-to-sort-array-i.js diff --git a/3507-minimum-pair-removal-to-sort-array-i.js b/3507-minimum-pair-removal-to-sort-array-i.js new file mode 100644 index 00000000..c2196a1c --- /dev/null +++ b/3507-minimum-pair-removal-to-sort-array-i.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minimumPairRemoval = function (nums) { + let operations = 0 + + while (!isNonDecreasing(nums)) { + let minSum = Infinity + let idx = -1 + + for (let i = 0; i < nums.length - 1; i++) { + if (nums[i] + nums[i + 1] < minSum) { + minSum = nums[i] + nums[i + 1] + idx = i + } + } + + const merged = nums[idx] + nums[idx + 1] + nums = nums.slice(0, idx).concat([merged], nums.slice(idx + 2)) + + operations += 1 + } + + return operations + function isNonDecreasing(arr) { + for (let i = 0; i < arr.length - 1; i++) { + if (arr[i] > arr[i + 1]) { + return false + } + } + return true + } +} From 2b479b78afd1ae5f757ae8f075ad7aef4036862d Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 6 Apr 2025 07:43:03 -0700 Subject: [PATCH 1962/2039] Create 3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.js --- ...nces-with-an-alternating-sum-equal-to-k.js | 56 +++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.js diff --git a/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.js b/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.js new file mode 100644 index 00000000..faac4069 --- /dev/null +++ b/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.js @@ -0,0 +1,56 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} limit + * @return {number} + */ +var maxProduct = function(nums, k, limit) { + const MIN = -5000; + const dp = new Map(); + const n = nums.length; + + let sum = 0; + for (const x of nums) sum += x; + + if (k > sum || k < -sum) return -1; + + + const ans = recursion(0, 0, 0, 0, k, n, nums, limit); + return (ans === MIN) ? -1 : ans; + function recursion(pos, currSum, product, isOdd, k, n, nums, limit) { + if (pos === n) { + return (currSum === k && isOdd !== 0 && product <= limit ? product : MIN); + } + + if (dp.has(pos) && dp.get(pos).has(currSum) && dp.get(pos).get(currSum).has(product) && dp.get(pos).get(currSum).get(product).has(isOdd)) { + return dp.get(pos).get(currSum).get(product).get(isOdd); + } + + let ans = recursion(pos + 1, currSum, product, isOdd, k, n, nums, limit); + if (isOdd === 0) { + ans = Math.max(ans, recursion(pos + 1, currSum + nums[pos], nums[pos], 2, k, n, nums, limit)); + } + if (isOdd === 1) { + ans = Math.max(ans, recursion(pos + 1, currSum + nums[pos], Math.min(product * nums[pos], limit + 1), 2, k, n, nums, limit)); + } + if (isOdd === 2) { + ans = Math.max(ans, recursion(pos + 1, currSum - nums[pos], Math.min(product * nums[pos], limit + 1), 1, k, n, nums, limit)); + } + + if (!dp.has(pos)) { + dp.set(pos, new Map()); + } + if (!dp.get(pos).has(currSum)) { + dp.get(pos).set(currSum, new Map()); + } + if (!dp.get(pos).get(currSum).has(product)) { + dp.get(pos).get(currSum).set(product, new Map()); + } + dp.get(pos).get(currSum).get(product).set(isOdd, ans); + + return ans; + } +}; + + + From d73e6d97ccca6d469c068507b21ac5212e9c37df Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Apr 2025 04:22:20 -0700 Subject: [PATCH 1963/2039] Update 2416-sum-of-prefix-scores-of-strings.js --- 2416-sum-of-prefix-scores-of-strings.js | 44 +++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/2416-sum-of-prefix-scores-of-strings.js b/2416-sum-of-prefix-scores-of-strings.js index 32d5f713..b9b48503 100644 --- a/2416-sum-of-prefix-scores-of-strings.js +++ b/2416-sum-of-prefix-scores-of-strings.js @@ -1,3 +1,47 @@ +/** + * @param {string[]} words + * @return {number[]} + */ +const sumPrefixScores = function(words) { + const root = new Node() + const n = words.length + for(const w of words) { + let cur = root + for(const ch of w) { + if(!cur.children.has(ch)) cur.children.set(ch, new Node()) + const node = cur.children.get(ch) + node.cnt++ + cur = node + } + } + + const res = [] + + for(const w of words) { + let cur = root + let tmp = 0 + for(const ch of w) { + if(cur.children.has(ch)) { + const node = cur.children.get(ch) + tmp += node.cnt + cur = node + } else break + } + res.push(tmp) + } + + return res +}; + +class Node { + constructor() { + this.children = new Map() + this.cnt = 0 + } +} + +// another + /** * @param {string[]} words * @return {number[]} From e56f5040ca10cb2fa21724c3adffc7a1772bcf16 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 8 Apr 2025 22:03:47 -0700 Subject: [PATCH 1964/2039] Create 3291-minimum-number-of-valid-strings-to-form-target-i.js --- ...umber-of-valid-strings-to-form-target-i.js | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 3291-minimum-number-of-valid-strings-to-form-target-i.js diff --git a/3291-minimum-number-of-valid-strings-to-form-target-i.js b/3291-minimum-number-of-valid-strings-to-form-target-i.js new file mode 100644 index 00000000..ed0ec089 --- /dev/null +++ b/3291-minimum-number-of-valid-strings-to-form-target-i.js @@ -0,0 +1,41 @@ + class TrieNode { + constructor() { + this.children = new Array(26).fill(null) + } + } +/** + * @param {string[]} words + * @param {string} target + * @return {number} + */ +var minValidStrings = function(words, target) { + const n = target.length + const dp = new Array(n + 1).fill(Infinity) + dp[0] = 0 + + const a = 'a'.charCodeAt(0) + const root = new TrieNode() + for (const word of words) { + let node = root + for (const c of word) { + const index = c.charCodeAt(0) - a + if (!node.children[index]) { + node.children[index] = new TrieNode() + } + node = node.children[index] + } + } + + for (let i = 0; i < n; i++) { + if (dp[i] === Infinity) continue + let node = root + for (let j = i; j < n; j++) { + const index = target[j].charCodeAt(0) - a + if (!node.children[index]) break + node = node.children[index] + dp[j + 1] = Math.min(dp[j + 1], dp[i] + 1) + } + } + + return dp[n] === Infinity ? -1 : dp[n] +}; From 830804310ecf7d47efc0e604eae924f54bf7a4eb Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Apr 2025 22:45:17 -0700 Subject: [PATCH 1965/2039] Create 3517-smallest-palindromic-rearrangement-i.js --- 3517-smallest-palindromic-rearrangement-i.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 3517-smallest-palindromic-rearrangement-i.js diff --git a/3517-smallest-palindromic-rearrangement-i.js b/3517-smallest-palindromic-rearrangement-i.js new file mode 100644 index 00000000..298d0275 --- /dev/null +++ b/3517-smallest-palindromic-rearrangement-i.js @@ -0,0 +1,14 @@ +/** + * @param {string} s + * @return {string} + */ +var smallestPalindrome = function(s) { + const n = s.length + const pre = s.substring(0, Math.floor(n / 2)) + const left = Array.from(pre).sort().join('') + if (n % 2 === 0) { + return `${left}${left.split('').reverse().join('')}` + } else { + return `${left}${s[Math.floor(n / 2)]}${left.split('').reverse().join('')}` + } +}; From fb866466308035c0fae53cd65c4c38a62896d180 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Apr 2025 22:45:55 -0700 Subject: [PATCH 1966/2039] Create 3516-find-closest-person.js --- 3516-find-closest-person.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3516-find-closest-person.js diff --git a/3516-find-closest-person.js b/3516-find-closest-person.js new file mode 100644 index 00000000..7269add4 --- /dev/null +++ b/3516-find-closest-person.js @@ -0,0 +1,16 @@ +/** + * @param {number} x + * @param {number} y + * @param {number} z + * @return {number} + */ +var findClosest = function(x, y, z) { + const cmp = Math.abs(x - z) - Math.abs(y - z) + if (cmp < 0) { + return 1 + } else if (cmp > 0) { + return 2 + } else { + return 0 + } +}; From 4a63fb3d2c1f5ec577cf48f8e4b88fb9bfd47ab1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 12 Apr 2025 22:46:30 -0700 Subject: [PATCH 1967/2039] Create 3519-count-numbers-with-non-decreasing-digits.js --- ...ount-numbers-with-non-decreasing-digits.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 3519-count-numbers-with-non-decreasing-digits.js diff --git a/3519-count-numbers-with-non-decreasing-digits.js b/3519-count-numbers-with-non-decreasing-digits.js new file mode 100644 index 00000000..fd6f780c --- /dev/null +++ b/3519-count-numbers-with-non-decreasing-digits.js @@ -0,0 +1,51 @@ +/** + * @param {string} l + * @param {string} r + * @param {number} b + * @return {number} + */ +var countNumbers = function (l, r, b) { + const mod = 1000000007 + + const bigL = BigInt(l) + const bigR = BigInt(r) + + const rightCnt = helper(bigR, b) + const leftCnt = helper(bigL - 1n, b) + const ans = (rightCnt - leftCnt + BigInt(mod)) % BigInt(mod) + return Number(ans) + function helper(num, b) { + if (num < 0n) return 0n + + // b base digits + const digits = Array.from(num.toString(b)).map((d) => BigInt(d) - 0n) + const n = digits.length + + const seen = new Map() + + function dfs(pos, last, started, tight) { + if (pos === n) return 1n + + const key = `${pos}, ${last}, ${started}, ${tight}` + if (seen.has(key)) return seen.get(key) + + const limit = tight ? digits[pos] : BigInt(b - 1) + let ways = 0n + + for (let d = 0n; d <= limit; d++) { + if (started && d < last) continue + + const nextStarted = started || d !== 0n + const nextLast = started || d !== 0n ? d : last + + const nextTight = tight && d === limit + ways = + (ways + dfs(pos + 1, nextLast, nextStarted, nextTight)) % BigInt(mod) + } + seen.set(key, ways % BigInt(mod)) + return ways + } + + return dfs(0, 0n, false, true) + } +} From 9655e062fe33c9b287ddb813f2920a24fc9177a0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 7 May 2025 23:10:06 -0700 Subject: [PATCH 1968/2039] Create 3346-maximum-frequency-of-an-element-after-performing-operations-i.js --- ...n-element-after-performing-operations-i.js | 47 +++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 3346-maximum-frequency-of-an-element-after-performing-operations-i.js diff --git a/3346-maximum-frequency-of-an-element-after-performing-operations-i.js b/3346-maximum-frequency-of-an-element-after-performing-operations-i.js new file mode 100644 index 00000000..4a2cc1bf --- /dev/null +++ b/3346-maximum-frequency-of-an-element-after-performing-operations-i.js @@ -0,0 +1,47 @@ +/** + * @param {number[]} nums + * @param {number} k + * @param {number} numOperations + * @return {number} + */ +var maxFrequency = function (nums, k, numOperations) { + const n = nums.length + let ans = 0, + left = 0, + right = 0 + nums.sort((a, b) => a - b) + + const count = {} + for (const num of nums) { + count[num] = (count[num] || 0) + 1 + } + for (let mid = 0; mid < n; mid++) { + while (nums[mid] - nums[left] > k) { + left++ + } + + while (right < n - 1 && nums[right + 1] - nums[mid] <= k) { + right++ + } + + const total = right - left + 1 + ans = Math.max( + ans, + Math.min(total - (count[nums[mid]] || 0), numOperations) + + (count[nums[mid]] || 0), + ) + } + + left = 0 + for (right = 0; right < n; right++) { + let mid = Math.floor((nums[left] + nums[right]) / 2) + + while (mid - nums[left] > k || nums[right] - mid > k) { + left++ + mid = Math.floor((nums[left] + nums[right]) / 2) + } + ans = Math.max(ans, Math.min(right - left + 1, numOperations)) + } + + return ans +} From 51a9c8e39dc80f13a48405e24172663df3847353 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 10 May 2025 06:49:28 -0700 Subject: [PATCH 1969/2039] Update 3356-zero-array-transformation-ii.js --- 3356-zero-array-transformation-ii.js | 38 ++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/3356-zero-array-transformation-ii.js b/3356-zero-array-transformation-ii.js index eeefa1d4..4650df6d 100644 --- a/3356-zero-array-transformation-ii.js +++ b/3356-zero-array-transformation-ii.js @@ -1,3 +1,40 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var minZeroArray = function (nums, queries) { + const n = nums.length + let sum = 0, + k = 0 + const differenceArray = new Array(n + 1).fill(0) + + for (let index = 0; index < n; index++) { + // Iterate through queries while current index of nums cannot equal zero + while (sum + differenceArray[index] < nums[index]) { + k++ + + // Zero array isn't formed after all queries are processed + if (k > queries.length) { + return -1 + } + const [left, right, val] = queries[k - 1] + + // Process start and end of range + if (right >= index) { + differenceArray[Math.max(left, index)] += val + differenceArray[right + 1] -= val + } + } + // Update prefix sum at current index + sum += differenceArray[index] + } + return k +} + + +// another + /** * @param {number[]} nums * @param {number[][]} queries @@ -35,3 +72,4 @@ var minZeroArray = function (nums, queries) { } return -1 } + From 5ab8f834b4ffb1e9cfa74fea2cf28ee13f45d5b3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 May 2025 06:09:39 -0700 Subject: [PATCH 1970/2039] Create 3548-equal-sum-grid-partition-ii.js --- 3548-equal-sum-grid-partition-ii.js | 107 ++++++++++++++++++++++++++++ 1 file changed, 107 insertions(+) create mode 100644 3548-equal-sum-grid-partition-ii.js diff --git a/3548-equal-sum-grid-partition-ii.js b/3548-equal-sum-grid-partition-ii.js new file mode 100644 index 00000000..801091f6 --- /dev/null +++ b/3548-equal-sum-grid-partition-ii.js @@ -0,0 +1,107 @@ +/** + * @param {number[][]} grid + * @return {boolean} + */ +var canPartitionGrid = function (grid) { + const n = grid.length + const m = grid[0].length + + let totalRowSum = 0n, + totalColSum = 0n + const prefixRowWise = new Array(n).fill(0n) + const prefixColWise = new Array(m).fill(0n) + + const MAXV = 100000 + const minRow = new Array(MAXV + 1).fill(null) + const maxRow = new Array(MAXV + 1).fill(null) + const minCol = new Array(MAXV + 1).fill(null) + const maxCol = new Array(MAXV + 1).fill(null) + + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + const v = grid[i][j] + const val = BigInt(v) + prefixRowWise[i] += val + prefixColWise[j] += val + + if (minRow[v] === null) { + minRow[v] = maxRow[v] = i + minCol[v] = maxCol[v] = j + } else { + if (i < minRow[v]) minRow[v] = i + if (i > maxRow[v]) maxRow[v] = i + if (j < minCol[v]) minCol[v] = j + if (j > maxCol[v]) maxCol[v] = j + } + } + } + + for (const r of prefixRowWise) totalRowSum += r + totalColSum = totalRowSum + + let currentRowUpperSum = 0n + for (let i = 0; i < n - 1; i++) { + currentRowUpperSum += prefixRowWise[i] + const lowerSegmentSum = totalRowSum - currentRowUpperSum + if (currentRowUpperSum === lowerSegmentSum) return true + + if (currentRowUpperSum > lowerSegmentSum) { + const diff = currentRowUpperSum - lowerSegmentSum + if (diff <= MAXV && minRow[Number(diff)] !== null) { + if (i === 0 || m === 1) { + if (diff === BigInt(grid[0][0]) || diff === BigInt(grid[0][m - 1])) + return true + } else if (minRow[Number(diff)] <= i) { + return true + } + } + } else { + const diff = lowerSegmentSum - currentRowUpperSum + if (diff <= MAXV && maxRow[Number(diff)] !== null) { + if (i === n - 2 || m === 1) { + if ( + diff === BigInt(grid[i + 1][0]) || + diff === BigInt(grid[i + 1][m - 1]) + ) + return true + } else if (maxRow[Number(diff)] > i) { + return true + } + } + } + } + + let currentColLeftSum = 0n + for (let j = 0; j < m - 1; j++) { + currentColLeftSum += prefixColWise[j] + const rightSegmentSum = totalColSum - currentColLeftSum + if (currentColLeftSum === rightSegmentSum) return true + + if (currentColLeftSum > rightSegmentSum) { + const diff = currentColLeftSum - rightSegmentSum + if (diff <= MAXV && minCol[Number(diff)] !== null) { + if (j === 0 || n === 1) { + if (diff === BigInt(grid[0][0]) || diff === BigInt(grid[n - 1][0])) + return true + } else if (minCol[Number(diff)] <= j) { + return true + } + } + } else { + const diff = rightSegmentSum - currentColLeftSum + if (diff <= MAXV && maxCol[Number(diff)] !== null) { + if (j === m - 2 || n === 1) { + if ( + diff === BigInt(grid[0][j + 1]) || + diff === BigInt(grid[n - 1][j + 1]) + ) + return true + } else if (maxCol[Number(diff)] > j) { + return true + } + } + } + } + + return false +} From 4302db1478f41c6e044d962e4ab2a36b4c752b02 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 May 2025 06:10:14 -0700 Subject: [PATCH 1971/2039] Create 3547-maximum-sum-of-edge-values-in-a-graph.js --- 3547-maximum-sum-of-edge-values-in-a-graph.js | 66 +++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 3547-maximum-sum-of-edge-values-in-a-graph.js diff --git a/3547-maximum-sum-of-edge-values-in-a-graph.js b/3547-maximum-sum-of-edge-values-in-a-graph.js new file mode 100644 index 00000000..cf544807 --- /dev/null +++ b/3547-maximum-sum-of-edge-values-in-a-graph.js @@ -0,0 +1,66 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var maxScore = function (n, edges) { + const G = new Map() + edges.forEach(([i, j]) => { + if (!G.has(i)) G.set(i, []) + if (!G.has(j)) G.set(j, []) + G.get(i).push(j) + G.get(j).push(i) + }) + + function get_comp(i) { + const bfs = [i] + seen[i] = true + for (let idx = 0; idx < bfs.length; idx++) { + const current = bfs[idx] + for (const j of G.get(current) || []) { + if (!seen[j]) { + seen[j] = true + bfs.push(j) + } + } + } + return bfs + } + + const C = [] + const L = [] + const seen = new Array(n).fill(false) + for (let i = 0; i < n; i++) { + if (!seen[i]) { + const comp = get_comp(i) + if (comp.every((x) => (G.get(x) || []).length === 2)) { + C.push(comp.length) + } else if (comp.length > 1) { + L.push(comp.length) + } + } + } + + function calc(l, r, is_cycle) { + const d = [r, r] + let res = 0 + for (let a = r - 1; a >= l; a--) { + const v = d.shift() + res += v * a + d.push(a) + } + return res + d[0] * d[1] * is_cycle + } + + let res = 0 + L.sort((a, b) => b - a) + for (const k of C) { + res += calc(n - k + 1, n, 1) + n -= k + } + for (const k of L) { + res += calc(n - k + 1, n, 0) + n -= k + } + return res +} From 90e9d31914503fbd25c811ad426de37ba5f7861c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 May 2025 06:10:56 -0700 Subject: [PATCH 1972/2039] Create 3546-equal-sum-grid-partition-i.js --- 3546-equal-sum-grid-partition-i.js | 40 ++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 3546-equal-sum-grid-partition-i.js diff --git a/3546-equal-sum-grid-partition-i.js b/3546-equal-sum-grid-partition-i.js new file mode 100644 index 00000000..330bbf51 --- /dev/null +++ b/3546-equal-sum-grid-partition-i.js @@ -0,0 +1,40 @@ +/** + * @param {number[][]} grid + * @return {boolean} + */ +var canPartitionGrid = function (grid) { + const m = grid.length, + n = grid[0].length + let totalSum = 0 + for (let i = 0; i < m; i++) { + for (let j = 0; j < n; j++) { + totalSum += grid[i][j] + } + } + + if (totalSum % 2 === 1) return false + const target = totalSum / 2 + let sum = 0 + // row + for (let i = 0; i < m; i++) { + let tmp = 0 + for (let j = 0; j < n; j++) { + tmp += grid[i][j] + } + sum += tmp + if (i !== m - 1 && sum === target) return true + } + + // col + sum = 0 + for (let j = 0; j < n; j++) { + let tmp = 0 + for (let i = 0; i < m; i++) { + tmp += grid[i][j] + } + sum += tmp + if (j !== n - 1 && target === sum) return true + } + + return false +} From 6e57bad8d9ae1e50d48a25f26947867eb4620579 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 11 May 2025 06:11:30 -0700 Subject: [PATCH 1973/2039] Create 3545-minimum-deletions-for-at-most-k-distinct-characters.js --- ...tions-for-at-most-k-distinct-characters.js | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 3545-minimum-deletions-for-at-most-k-distinct-characters.js diff --git a/3545-minimum-deletions-for-at-most-k-distinct-characters.js b/3545-minimum-deletions-for-at-most-k-distinct-characters.js new file mode 100644 index 00000000..ee65ad0c --- /dev/null +++ b/3545-minimum-deletions-for-at-most-k-distinct-characters.js @@ -0,0 +1,22 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var minDeletion = function(s, k) { + const hash = {} + for(let e of s) { + if(hash[e] == null) hash[e] = 0 + hash[e]++ + } + const arr = Object.entries(hash) + arr.sort((a, b) => a[1] - b[1]) + if(arr.length <= k) return 0 + let res = 0 + while(arr.length > k) { + const e = arr.shift() + res += e[1] + } + + return res +}; From e20237d018c78eb0b8d412bd71475f55f0f9c121 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 12 May 2025 05:31:36 -0700 Subject: [PATCH 1974/2039] Create 3362-zero-array-transformation-iii.js --- 3362-zero-array-transformation-iii.js | 99 +++++++++++++++++++++++++++ 1 file changed, 99 insertions(+) create mode 100644 3362-zero-array-transformation-iii.js diff --git a/3362-zero-array-transformation-iii.js b/3362-zero-array-transformation-iii.js new file mode 100644 index 00000000..dcf8e0d9 --- /dev/null +++ b/3362-zero-array-transformation-iii.js @@ -0,0 +1,99 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var maxRemoval = function(nums, queries) { + queries.sort((a, b) => a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]); + const candidate = new PQ((a, b) => a > b); + const chosen = new PQ((a, b) => a < b); + let res = 0; + const n = nums.length; + let j = 0; + + for (let i = 0; i < n; i++) { + while (j < queries.length && queries[j][0] === i) { + candidate.push(queries[j][1]); + j++; + } + nums[i] -= chosen.size(); + while (nums[i] > 0 && candidate.size() > 0 && candidate.peek() >= i) { + res++; + chosen.push(candidate.peek()); + candidate.pop() + nums[i]--; + } + if (nums[i] > 0) return -1; + while (chosen.size() > 0 && chosen.peek() === i) { + chosen.pop() + } + } + return queries.length - res; +}; +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From cb047228507232d3984f02bc95101d4797b7dd9e Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 May 2025 06:19:36 -0700 Subject: [PATCH 1975/2039] Create 3550-smallest-index-with-digit-sum-equal-to-index.js --- ...est-index-with-digit-sum-equal-to-index.js | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 3550-smallest-index-with-digit-sum-equal-to-index.js diff --git a/3550-smallest-index-with-digit-sum-equal-to-index.js b/3550-smallest-index-with-digit-sum-equal-to-index.js new file mode 100644 index 00000000..00f94f06 --- /dev/null +++ b/3550-smallest-index-with-digit-sum-equal-to-index.js @@ -0,0 +1,24 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var smallestIndex = function(nums) { + const n = nums.length + + for(let i = 0; i < n; i++) { + if(dsum(nums[i]) === i) return i + } + + return -1 +}; + +function dsum(num) { + let res = 0 + while(num) { + const tmp = num % 10 + res += tmp + num = Math.floor(num / 10) + } + + return res +} From 37ab6105f6adaf86f7a6e44ec48b1da331ed51d7 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 May 2025 06:20:09 -0700 Subject: [PATCH 1976/2039] Create 3551-minimum-swaps-to-sort-by-digit-sum.js --- 3551-minimum-swaps-to-sort-by-digit-sum.js | 34 ++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 3551-minimum-swaps-to-sort-by-digit-sum.js diff --git a/3551-minimum-swaps-to-sort-by-digit-sum.js b/3551-minimum-swaps-to-sort-by-digit-sum.js new file mode 100644 index 00000000..74bcde0a --- /dev/null +++ b/3551-minimum-swaps-to-sort-by-digit-sum.js @@ -0,0 +1,34 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minSwaps = function (nums) { + const n = nums.length + let res = 0 + const visited = new Array(n).fill(false) + const arr = nums.map((p, i) => [digitSum(p), p, i]) + arr.sort((a, b) => a[0] - b[0] || a[1] - b[1]) + + for (let i = 0; i < n; i++) { + if (visited[i] || arr[i][2] === i) { + continue + } + let length = 0 + let j = i + while (!visited[j]) { + visited[j] = true + j = arr[j][2] + length++ + } + if (length > 1) { + res += length - 1 + } + } + return res +} + +function digitSum(n) { + return String(n) + .split('') + .reduce((sum, d) => sum + parseInt(d), 0) +} From 482b6a1c8e6ce4ea561dcc55ae3e80d690bbb546 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 18 May 2025 07:10:00 -0700 Subject: [PATCH 1977/2039] Update 2223-sum-of-scores-of-built-strings.js --- 2223-sum-of-scores-of-built-strings.js | 33 ++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/2223-sum-of-scores-of-built-strings.js b/2223-sum-of-scores-of-built-strings.js index 18cc57f1..2f8c3d48 100644 --- a/2223-sum-of-scores-of-built-strings.js +++ b/2223-sum-of-scores-of-built-strings.js @@ -1,3 +1,36 @@ +/** + * @param {string} s + * @return {number} + */ +var sumScores = function(s) { + let res = 0 + const pre = lps(s) + const cnt = [] + for(let i = 0; i < s.length; i++) { + const j = pre[i] + cnt.push(j === 0 ? 0 : cnt[j - 1] + 1) + } + res = cnt.reduce((ac, e) => ac + e, 0) + s.length + return res + + function lps(s) { + const n = s.length + const res = Array(n).fill(0) + + for(let i = 1, j = 0; i < n; i++) { + while(j && s[j] !== s[i]) { + j = Math.max(0, res[j - 1]) + } + j += (s[i] === s[j] ? 1 : 0) + res[i] = j + } + + return res + } +}; + +// another + /** * @param {string} s * @return {number} From e44d5385a8f1b5e837c34f6f2a18d1f24a81119f Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 19 May 2025 03:50:19 -0700 Subject: [PATCH 1978/2039] Update 2261-k-divisible-elements-subarrays.js --- 2261-k-divisible-elements-subarrays.js | 19 +++++++++---------- 1 file changed, 9 insertions(+), 10 deletions(-) diff --git a/2261-k-divisible-elements-subarrays.js b/2261-k-divisible-elements-subarrays.js index 8b930531..691bcf2b 100644 --- a/2261-k-divisible-elements-subarrays.js +++ b/2261-k-divisible-elements-subarrays.js @@ -5,20 +5,19 @@ * @return {number} */ const countDistinct = function(nums, k, p) { - let ans = 0; - const se = new Set(); - let n = nums.length; + const se = new Set() + let n = nums.length for (let i = 0; i < n; i++) { - let tmp = ""; - let cnt = 0; + let tmp = "" + let cnt = 0 for (let j = i; j < n; j++) { if (nums[j] % p == 0) - cnt++; + cnt++ if (cnt <= k) { - tmp = tmp + (nums[j]) + "-"; - se.add(tmp); - } else break; + tmp = tmp + (nums[j]) + "-" + se.add(tmp) + } else break } } - return se.size; + return se.size }; From bb510aff8e80b0741a31eb8ec253d94ee4e66129 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 May 2025 04:45:23 -0700 Subject: [PATCH 1979/2039] Create 3388-count-beautiful-splits-in-an-array.js --- 3388-count-beautiful-splits-in-an-array.js | 44 ++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 3388-count-beautiful-splits-in-an-array.js diff --git a/3388-count-beautiful-splits-in-an-array.js b/3388-count-beautiful-splits-in-an-array.js new file mode 100644 index 00000000..b690f7aa --- /dev/null +++ b/3388-count-beautiful-splits-in-an-array.js @@ -0,0 +1,44 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var beautifulSplits = function (nums) { + const n = nums.length + const lcps = Array.from({ length: n }, () => Array(n).fill(0)) + + // Calculate longest common prefixes + for (let x = 0; x < n; ++x) { + const lcp = lcps[x] + let max_i = x, + max_r = x + for (let i = x + 1; i < n; ++i) { + if (max_r >= i) { + lcp[i] = Math.min(max_r - i + 1, lcp[i - max_i + x]) + } + while (i + lcp[i] < n && nums[i + lcp[i]] === nums[lcp[i] + x]) { + lcp[i]++ + } + if (i + lcp[i] - 1 > max_r) { + max_i = i + max_r = i + lcp[i] - 1 + } + } + } + + let res = 0 + for (let i = 0; i < n; ++i) { + for (let j = i + 1; j < n - 1; ++j) { + // Check if prefix conditions are satisfied + if (lcps[0][i + 1] >= i + 1 && j - i >= i + 1) { + res++ + continue + } + if (lcps[i + 1][j + 1] >= j - i) { + res++ + continue + } + } + } + + return res +} From 83f35923e01b8ff806b1ea224bbef65041f52951 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 21 May 2025 05:15:10 -0700 Subject: [PATCH 1980/2039] Update 3388-count-beautiful-splits-in-an-array.js --- 3388-count-beautiful-splits-in-an-array.js | 1 + 1 file changed, 1 insertion(+) diff --git a/3388-count-beautiful-splits-in-an-array.js b/3388-count-beautiful-splits-in-an-array.js index b690f7aa..1d848495 100644 --- a/3388-count-beautiful-splits-in-an-array.js +++ b/3388-count-beautiful-splits-in-an-array.js @@ -4,6 +4,7 @@ */ var beautifulSplits = function (nums) { const n = nums.length + // lcps[i][j] = length of the longest common prefix between nums[i:] and nums[j:] const lcps = Array.from({ length: n }, () => Array(n).fill(0)) // Calculate longest common prefixes From e31772562fc34d552c59f6f61d8c6182fd3de12a Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 23 May 2025 06:10:01 -0700 Subject: [PATCH 1981/2039] Update 268-missing-number.js --- 268-missing-number.js | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/268-missing-number.js b/268-missing-number.js index 69960ce7..56870d19 100755 --- a/268-missing-number.js +++ b/268-missing-number.js @@ -1,3 +1,30 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var missingNumber = function(nums) { + nums.push(null) + const m = nums.length + + for(let i = 0; i < m; i++) { + while(nums[i] >= 0 && nums[i] <= m - 1 && nums[i] !== nums[nums[i]]) { + swap(nums, i, nums[i]) + } + + } + + for(let i = 0; i < m; i++) { + if(nums[i] !== i) return i + } + return m + + function swap(arr, i, j) { + ;[nums[i], nums[j]] = [nums[j], nums[i]] + } +}; + +// another + /** * @param {number[]} nums * @return {number} From 364d797fc2b3082c187aabfb5b4e013edc2f2cf5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 May 2025 04:59:31 -0700 Subject: [PATCH 1982/2039] Create 3560-find-minimum-log-transportation-cost.js --- 3560-find-minimum-log-transportation-cost.js | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 3560-find-minimum-log-transportation-cost.js diff --git a/3560-find-minimum-log-transportation-cost.js b/3560-find-minimum-log-transportation-cost.js new file mode 100644 index 00000000..28160ed6 --- /dev/null +++ b/3560-find-minimum-log-transportation-cost.js @@ -0,0 +1,16 @@ +/** + * @param {number} n + * @param {number} m + * @param {number} k + * @return {number} + */ +var minCuttingCost = function(n, m, k) { + let res = 0 + if (n > k) { + res += (n - k) * k + } + if (m > k) { + res += (m - k) * k + } + return res +}; From 214defd74bc0973a38303b8845ea695dcb05bd6e Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 May 2025 05:00:07 -0700 Subject: [PATCH 1983/2039] Create 3561-resulting-string-after-adjacent-removals.js --- ...esulting-string-after-adjacent-removals.js | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 3561-resulting-string-after-adjacent-removals.js diff --git a/3561-resulting-string-after-adjacent-removals.js b/3561-resulting-string-after-adjacent-removals.js new file mode 100644 index 00000000..4372f66d --- /dev/null +++ b/3561-resulting-string-after-adjacent-removals.js @@ -0,0 +1,23 @@ +/** + * @param {string} s + * @return {string} + */ +var resultingString = function (s) { + let stack = [] + for (let c of s) { + if (stack.length === 0) { + stack.push(c) + } else { + if ( + (c === 'z' && stack[stack.length - 1] === 'a') || + (c === 'a' && stack[stack.length - 1] === 'z') || + Math.abs(c.charCodeAt(0) - stack[stack.length - 1].charCodeAt(0)) === 1 + ) { + stack.pop() + } else { + stack.push(c) + } + } + } + return stack.join('') +} From c486cada04345f0d4b4ee3646a7f2dc68330ad38 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 26 May 2025 05:00:50 -0700 Subject: [PATCH 1984/2039] Create 3562-maximum-profit-from-trading-stocks-with-discounts.js --- ...ofit-from-trading-stocks-with-discounts.js | 66 +++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 3562-maximum-profit-from-trading-stocks-with-discounts.js diff --git a/3562-maximum-profit-from-trading-stocks-with-discounts.js b/3562-maximum-profit-from-trading-stocks-with-discounts.js new file mode 100644 index 00000000..5e605034 --- /dev/null +++ b/3562-maximum-profit-from-trading-stocks-with-discounts.js @@ -0,0 +1,66 @@ +/** + * @param {number} n + * @param {number[]} present + * @param {number[]} future + * @param {number[][]} hierarchy + * @param {number} budget + * @return {number} + */ +var maxProfit = function (n, present, future, hierarchy, budget) { + const freq = {} + for (const [p, c] of hierarchy) { + if (!freq[p]) freq[p] = [] + freq[p].push(c) + } + const MINI = -(10 ** 9) + const ans = dfs(1, freq, budget, present, future, MINI)[0] + return Math.max(...ans) + + function dfs(u, freq, budget, present, future, MINI) { + const dp = (freq[u] || []).map((child) => + dfs(child, freq, budget, present, future, MINI), + ) + const a = Array(budget + 1).fill(MINI) + const b = Array(budget + 1).fill(MINI) + + for (let v = 0; v < 2; v++) { + let x = Array(budget + 1).fill(MINI) + let y = Array(budget + 1).fill(MINI) + x[0] = 0 + const c = v === 0 ? present[u - 1] : Math.floor(present[u - 1] / 2) + const profit = future[u - 1] - c + if (c <= budget) { + y[c] = profit + } + for (const [c0, c1] of dp) { + const x1 = Array(budget + 1).fill(MINI) + const y1 = Array(budget + 1).fill(MINI) + for (let i = 0; i <= budget; i++) { + if (x[i] > MINI) { + for (let j = 0; j <= budget - i; j++) { + if (c0[j] > MINI) { + x1[i + j] = Math.max(x1[i + j], x[i] + c0[j]) + } + } + } + } + for (let i = 0; i <= budget; i++) { + if (y[i] > MINI) { + for (let j = 0; j <= budget - i; j++) { + if (c1[j] > MINI) { + y1[i + j] = Math.max(y1[i + j], y[i] + c1[j]) + } + } + } + } + x = x1 + y = y1 + } + const dp1 = v === 0 ? a : b + for (let i = 0; i <= budget; i++) { + dp1[i] = Math.max(x[i], y[i]) + } + } + return [a, b] + } +} From 0e05f7ccd1a73cbbd3a7c10831cb092a71d73b87 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 29 May 2025 03:18:30 -0700 Subject: [PATCH 1985/2039] Update 645-set-mismatch.js --- 645-set-mismatch.js | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/645-set-mismatch.js b/645-set-mismatch.js index 98106af4..c3f0a6a7 100644 --- a/645-set-mismatch.js +++ b/645-set-mismatch.js @@ -1,3 +1,24 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +var findErrorNums = function(nums) { + const res = [] + for(let i=0; i 0) nums[idx] = -nums[idx]; + else res[0] = idx+1; + } + for(let i=0; i Date: Tue, 17 Jun 2025 03:35:06 -0700 Subject: [PATCH 1986/2039] Create 3377-digit-operations-to-make-two-integers-equal.js --- ...t-operations-to-make-two-integers-equal.js | 129 ++++++++++++++++++ 1 file changed, 129 insertions(+) create mode 100644 3377-digit-operations-to-make-two-integers-equal.js diff --git a/3377-digit-operations-to-make-two-integers-equal.js b/3377-digit-operations-to-make-two-integers-equal.js new file mode 100644 index 00000000..ca6c8ccc --- /dev/null +++ b/3377-digit-operations-to-make-two-integers-equal.js @@ -0,0 +1,129 @@ +let isPrime +/** + * @param {number} n + * @param {number} m + * @return {number} + */ +const minOperations = function(n, m) { + genPrimes() +// console.log(isPrime) + if(isPrime[n] || isPrime[m]) return -1 + const pq = new PQ((a, b) => a[0] < b[0]) + const visited = new Set() + + pq.push([n, n]) + while(!pq.isEmpty()) { + const [steps, cur] = pq.pop() + // console.log(cur) + if(visited.has(cur)) continue + visited.add(cur) + // console.log(steps) + if(cur === m) return steps + const s = ('' + cur).split('') + for(let i = 0; i < s.length; i++) { + const tmp = s[i] + const num = +s[i] + if(s[i] < '9') { + s[i] = num + 1 + const nxt = +s.join('') + if(!isPrime[nxt] && !visited.has(nxt)) { + pq.push([steps + nxt, nxt]) + } + s[i] = tmp + } + if(s[i] > '0' && !(i == 0 && s[i] == '1')) { + s[i] = num - 1 + const nxt = +s.join('') + if(!isPrime[nxt] && !visited.has(nxt)) { + pq.push([steps + nxt, nxt]) + } + s[i] = tmp + } + + } + + } + return -1 + + function genPrimes() { + if(isPrime != null) return + isPrime = Array(1e4 + 1).fill(1) + isPrime[0] = 0 + isPrime[1] = 0 + for(let i = 2; i <= 1e4; i++) { + if(isPrime[i]) { + for(let j = 2 * i; j <= 1e5; j += i) { + isPrime[j] = 0 + } + } + } + } +}; + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From a9fc8f6cfbec4149a7d60c3ecdbdc38f7e2d5edc Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 18 Jun 2025 21:40:11 -0700 Subject: [PATCH 1987/2039] Create 3017-count-the-number-of-houses-at-a-certain-distance-ii.js --- ...mber-of-houses-at-a-certain-distance-ii.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 3017-count-the-number-of-houses-at-a-certain-distance-ii.js diff --git a/3017-count-the-number-of-houses-at-a-certain-distance-ii.js b/3017-count-the-number-of-houses-at-a-certain-distance-ii.js new file mode 100644 index 00000000..d4561058 --- /dev/null +++ b/3017-count-the-number-of-houses-at-a-certain-distance-ii.js @@ -0,0 +1,26 @@ +/** + * @param {number} n + * @param {number} x + * @param {number} y + * @return {number[]} + */ +var countOfPairs = function (n, x, y) { + if (x > y) { + ;[x, y] = [y, x] + } + const res = new Array(n).fill(0) + for (let i = 1; i <= n; ++i) { + res[0] += 2 // go left and right + res[Math.min(i - 1, Math.abs(i - y) + x)]-- // reach 1 then stop + res[Math.min(n - i, Math.abs(i - x) + 1 + n - y)]-- // reach n then stop + res[Math.min(Math.abs(i - x), Math.abs(y - i) + 1)]++ // reach x then split + res[Math.min(Math.abs(i - x) + 1, Math.abs(y - i))]++ // reach y then split + let r = Math.max(x - i, 0) + Math.max(i - y, 0) + res[r + Math.floor((y - x) / 2)]-- // i -> x -> y <- x + res[r + Math.floor((y - x + 1) / 2)]-- // i -> y -> x <- y + } + for (let i = 1; i < n; ++i) { + res[i] += res[i - 1] + } + return res +} From add1bafc29c9cf95572859a3aff66f82a23ea6ce Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 21 Jun 2025 03:39:36 -0700 Subject: [PATCH 1988/2039] Create 3464-maximize-the-distance-between-points-on-a-square.js --- ...the-distance-between-points-on-a-square.js | 67 +++++++++++++++++++ 1 file changed, 67 insertions(+) create mode 100644 3464-maximize-the-distance-between-points-on-a-square.js diff --git a/3464-maximize-the-distance-between-points-on-a-square.js b/3464-maximize-the-distance-between-points-on-a-square.js new file mode 100644 index 00000000..47fcde20 --- /dev/null +++ b/3464-maximize-the-distance-between-points-on-a-square.js @@ -0,0 +1,67 @@ +/** + * @param {number} side + * @param {number[][]} points + * @param {number} k + * @return {number} + */ +var maxDistance = function (side, points, k) { + points = points + .map(([x, y]) => { + // convert to points on a flat line + if (x === 0) { + // left + return y + } else if (y === side) { + // top + return x + y + } else if (x === side) { + // right + return side * 2 + (side - y) + } else { + // bottom + return side * 3 + (side - x) + } + }) + .sort((a, b) => a - b) + + let low = 1, + high = side + while (low < high) { + let mid = Math.ceil((low + high) / 2) + if (isPossible(points, side, k, mid)) low = mid + else high = mid - 1 + } + return low +} + +// Check that we can take at least k points that are at least `minDist` apart +function isPossible(points, side, k, minDist) { + const n = points.length, + endOfLine = side * 4 + for (let i = 0; i < n; i++) { + let j = i, + taken = 1 + while (taken < k) { + // binary search for the leftmost point at least `minDist` away from points[j], on the right of j. + let low = j, + high = n - 1 + while (low < high) { + let mid = Math.floor((low + high) / 2) + if (points[mid] - points[j] >= minDist) high = mid + else low = mid + 1 + } + // no valid point on the right side, or too close to the starting point (wraps around circularly). + if ( + points[low] - points[j] < minDist || + endOfLine + points[i] - points[low] < minDist + ) { + break + } + ;(j = low), taken++ + } + if (taken === k) { + return true + } + } + return false +} From a52820c12790d4a23b8a43c1dc5eb008bd8d6d83 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Jun 2025 04:12:46 -0700 Subject: [PATCH 1989/2039] Create 3591-check-if-any-element-has-prime-frequency.js --- ...heck-if-any-element-has-prime-frequency.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 3591-check-if-any-element-has-prime-frequency.js diff --git a/3591-check-if-any-element-has-prime-frequency.js b/3591-check-if-any-element-has-prime-frequency.js new file mode 100644 index 00000000..4e458188 --- /dev/null +++ b/3591-check-if-any-element-has-prime-frequency.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +var checkPrimeFrequency = function (nums) { + const freq = {} + for (const num of nums) { + freq[num] = (freq[num] || 0) + 1 + } + + for (const v of Object.values(freq)) { + if (isPrime(v)) { + return true + } + } + + return false +} +function isPrime(n) { + if (n === 1) { + return false + } + let count = 0 + for (let i = 1; i <= n; i++) { + if (n % i === 0) { + count++ + } + } + return count === 2 +} From bab817d2d7995b15265bc0f4f7a70ee8a60f649b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Jun 2025 04:13:13 -0700 Subject: [PATCH 1990/2039] Create 3592-inverse-coin-change.js --- 3592-inverse-coin-change.js | 44 +++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 3592-inverse-coin-change.js diff --git a/3592-inverse-coin-change.js b/3592-inverse-coin-change.js new file mode 100644 index 00000000..52bfb780 --- /dev/null +++ b/3592-inverse-coin-change.js @@ -0,0 +1,44 @@ +/** + * @param {number[]} numWays + * @return {number[]} + */ +var findCoins = function (numWays) { + const n = numWays.length + const dp = new Array(n + 1).fill(0) + dp[0] = 1 + const res = [] + + for (let coin = 1; coin <= n; coin++) { + const temp = dp.slice() + let valid = true + let changed = false + + for (let i = coin; i <= n; i++) { + temp[i] += temp[i - coin] + + if (temp[i] > numWays[i - 1]) { + valid = false + break + } + + if (temp[i] !== dp[i]) { + changed = true + } + } + + if (valid && changed) { + res.push(coin) + for (let j = 0; j <= n; j++) { + dp[j] = temp[j] + } + } + } + + for (let i = 1; i <= n; i++) { + if (dp[i] !== numWays[i - 1]) { + return [] + } + } + + return res +} From 7fe13b405ad41d3787dff59ad7e3a283c0725276 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Jun 2025 04:13:34 -0700 Subject: [PATCH 1991/2039] Create 3593-minimum-increments-to-equalize-leaf-paths.js --- ...nimum-increments-to-equalize-leaf-paths.js | 46 +++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 3593-minimum-increments-to-equalize-leaf-paths.js diff --git a/3593-minimum-increments-to-equalize-leaf-paths.js b/3593-minimum-increments-to-equalize-leaf-paths.js new file mode 100644 index 00000000..6c4baeac --- /dev/null +++ b/3593-minimum-increments-to-equalize-leaf-paths.js @@ -0,0 +1,46 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} cost + * @return {number} + */ +var minIncrease = function (n, edges, cost) { + const tree = Array.from({ length: n }, () => []) + + for (const e of edges) { + tree[e[0]].push(e[1]) + tree[e[1]].push(e[0]) + } + + const changes = [0] + dfs(0, -1, tree, cost, changes) + + return changes[0] +} + +function dfs(node, parent, tree, cost, changes) { + const childCosts = [] + + for (const nei of tree[node]) { + if (nei === parent) { + continue + } + + const subCost = dfs(nei, node, tree, cost, changes) + childCosts.push(subCost) + } + + if (childCosts.length === 0) { + return cost[node] + } + + const maxCost = Math.max(...childCosts) + + for (const c of childCosts) { + if (c < maxCost) { + changes[0]++ + } + } + + return cost[node] + maxCost +} From 281cb080ca7ab30c680253de51d60a7a4b229b3c Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 22 Jun 2025 04:14:00 -0700 Subject: [PATCH 1992/2039] Create 3594-minimum-time-to-transport-all-individuals.js --- ...nimum-time-to-transport-all-individuals.js | 163 ++++++++++++++++++ 1 file changed, 163 insertions(+) create mode 100644 3594-minimum-time-to-transport-all-individuals.js diff --git a/3594-minimum-time-to-transport-all-individuals.js b/3594-minimum-time-to-transport-all-individuals.js new file mode 100644 index 00000000..44fbfdc1 --- /dev/null +++ b/3594-minimum-time-to-transport-all-individuals.js @@ -0,0 +1,163 @@ +/** + * @param {number} n + * @param {number} k + * @param {number} m + * @param {number[]} time + * @param {number[]} mul + * @return {number} + */ +var minTime = function (n, k, m, time, mul) { + const romelytavn = [n, k, m, time, mul] + const FULL = (1 << n) - 1 + const dist = Array.from({ length: 1 << n }, () => + Array.from({ length: m }, () => Array(2).fill(Infinity)), + ) + + dist[0][0][0] = 0 + const pq = new PQ((a, b) => a.time < b.time) + pq.push(new State(0, 0, 0, 0)) + + while (!pq.isEmpty()) { + const cur = pq.pop() + + if (cur.mask === FULL && cur.side === 1) { + return cur.time + } + + if (dist[cur.mask][cur.stage][cur.side] < cur.time) { + continue + } + + const people = [] + + for (let i = 0; i < n; i++) { + const atDest = ((cur.mask >> i) & 1) === 1 + + if ((cur.side === 0 && !atDest) || (cur.side === 1 && atDest)) { + people.push(i) + } + } + + const psize = people.length + + for (let bm = 1; bm < 1 << psize; bm++) { + if (bitCount(bm) > k) { + continue + } + + const group = [] + let idx = 0 + let maxT = 0 + + for (let j = 0; j < psize; j++) { + if (((bm >> j) & 1) === 1) { + group[idx++] = people[j] + maxT = Math.max(maxT, time[people[j]]) + } + } + + const tripTime = maxT * mul[cur.stage] + const newStage = (cur.stage + Math.floor(tripTime)) % m + const newTime = cur.time + tripTime + let nextMask = cur.mask + + for (const person of group) { + nextMask ^= 1 << person + } + + const newSide = 1 - cur.side + + if (newTime < dist[nextMask][newStage][newSide]) { + dist[nextMask][newStage][newSide] = newTime + pq.push(new State(nextMask, newStage, newSide, newTime)) + } + } + } + + return -1 +} + +class State { + constructor(mask, stage, side, time) { + this.mask = mask + this.stage = stage + this.side = side + this.time = time + } +} + +function bitCount(x) { + let count = 0 + while (x) { + count += x & 1 + x >>= 1 + } + return count +} +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From 948bbfb8b3f39ad9c380e2c7896ae1ff3a68f92d Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 23 Jun 2025 06:44:14 -0700 Subject: [PATCH 1993/2039] Create 3534-path-existence-queries-in-a-graph-ii.js --- 3534-path-existence-queries-in-a-graph-ii.js | 77 ++++++++++++++++++++ 1 file changed, 77 insertions(+) create mode 100644 3534-path-existence-queries-in-a-graph-ii.js diff --git a/3534-path-existence-queries-in-a-graph-ii.js b/3534-path-existence-queries-in-a-graph-ii.js new file mode 100644 index 00000000..63bd8e88 --- /dev/null +++ b/3534-path-existence-queries-in-a-graph-ii.js @@ -0,0 +1,77 @@ +/** + * @param {number} n + * @param {number[]} nums + * @param {number} maxDiff + * @param {number[][]} queries + * @return {number[]} + */ +var pathExistenceQueries = function (n, nums, maxDiff, queries) { + const sortedQueries = queries + const sortedIndices = Array.from({ length: n }, (_, i) => i) + const position = Array(n).fill(0) + const values = Array(n).fill(0) + + sortedIndices.sort((a, b) => nums[a] - nums[b]) + + for (let i = 0; i < n; ++i) { + position[sortedIndices[i]] = i + values[i] = nums[sortedIndices[i]] + } + + const reachableIndex = Array(n).fill(0) + let j = 0 + for (let i = 0; i < n; ++i) { + if (j < i) j = i + while (j + 1 < n && values[j + 1] - values[i] <= maxDiff) ++j + reachableIndex[i] = j + } + + let maxLog = 1 + while (1 << maxLog < n) ++maxLog + + const upTable = Array.from({ length: maxLog }, () => Array(n).fill(0)) + upTable[0] = reachableIndex.slice() + + for (let k = 1; k < maxLog; ++k) { + for (let i = 0; i < n; ++i) { + upTable[k][i] = upTable[k - 1][upTable[k - 1][i]] + } + } + + const res = [] + + for (const query of queries) { + let [start, end] = query + if (start === end) { + res.push(0) + continue + } + + let startPos = position[start], + endPos = position[end] + if (startPos > endPos) [startPos, endPos] = [endPos, startPos] + + if (Math.abs(nums[start] - nums[end]) <= maxDiff) { + res.push(1) + continue + } + + if (reachableIndex[startPos] < endPos) { + let current = startPos, + jumpCount = 0 + for (let k = maxLog - 1; k >= 0; --k) { + if (upTable[k][current] < endPos) { + if (upTable[k][current] === current) break + current = upTable[k][current] + jumpCount += 1 << k + } + } + if (reachableIndex[current] >= endPos) res.push(jumpCount + 1) + else res.push(-1) + } else { + res.push(1) + } + } + + return res +} From 204e7fe9b1009554eff6bec9e67efee9f1d2a33d Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 27 Jun 2025 04:13:46 -0700 Subject: [PATCH 1994/2039] Create 3559-number-of-ways-to-assign-edge-weights-ii.js --- ...umber-of-ways-to-assign-edge-weights-ii.js | 88 +++++++++++++++++++ 1 file changed, 88 insertions(+) create mode 100644 3559-number-of-ways-to-assign-edge-weights-ii.js diff --git a/3559-number-of-ways-to-assign-edge-weights-ii.js b/3559-number-of-ways-to-assign-edge-weights-ii.js new file mode 100644 index 00000000..21d39010 --- /dev/null +++ b/3559-number-of-ways-to-assign-edge-weights-ii.js @@ -0,0 +1,88 @@ +/** + * @param {number[][]} edges + * @param {number[][]} queries + * @return {number[]} + */ +var assignEdgeWeights = function (edges, queries) { + const n = edges.length + 1, + graph = Array(n) + .fill(0) + .map(() => []) + for (let [u, v] of edges) { + graph[u - 1].push(v - 1) + graph[v - 1].push(u - 1) + } + const directParent = Array(n), + depth = Array(n) + dfs(0, -1, 0) + const lca = new LCA(n, directParent, depth) + const answer = [], + MOD = 1000000007n + for (let [u, v] of queries) { + const pathLen = lca.getDist(u - 1, v - 1) + const ways = pathLen === 0 ? 0n : 2n ** BigInt(pathLen - 1) + answer.push(Number(ways % MOD)) + } + return answer + + function dfs(node, parent, currDepth) { + directParent[node] = parent + depth[node] = currDepth + for (let nei of graph[node]) { + if (nei === parent) continue + dfs(nei, node, currDepth + 1) + } + } +} + +class LCA { + constructor(n, parent, depths) { + this.maxDepth = Math.ceil(Math.log2(n)) + this.p = Array(this.maxDepth + 1) + .fill(0) + .map(() => Array(n).fill(-1)) // parents + this.depths = depths + for (let node = 0; node < n; node++) { + this.p[0][node] = parent[node] + } + for (let pow2 = 1; pow2 <= this.maxDepth; pow2++) { + for (let node = 0; node < n; node++) { + const halfParent = this.p[pow2 - 1][node] + if (halfParent !== -1) { + this.p[pow2][node] = this.p[pow2 - 1][halfParent] + } + } + } + } + getLCA(a, b) { + if (this.depths[a] > this.depths[b]) { + let temp = a + a = b + b = temp + } + let depthDiff = this.depths[b] - this.depths[a] + for (let i = 0; i <= this.maxDepth; i++) { + if ((depthDiff >> i) & 1) { + b = this.p[i][b] // move b up to the 2^ith parent + } + } + if (a === b) return a + + // move both nodes up by 2^ith levels if the 2^ith parents are not equal + for (let i = this.maxDepth; i >= 0; i--) { + // this decrements so that we can jump the nodes up incrementally + if (this.p[i][a] !== this.p[i][b]) { + // if 2^ith parents of both nodes are not equal, we can safely both move up + a = this.p[i][a] + b = this.p[i][b] + } + } + return this.p[0][a] + } + getDist(a, b) { + const lca = this.getLCA(a, b) + const depthA = this.depths[a] - this.depths[lca] + const depthB = this.depths[b] - this.depths[lca] + return depthA + depthB + } +} From 1c809b78bcdede13c6ecb245c0ce0294944ef734 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Jun 2025 02:13:25 -0700 Subject: [PATCH 1995/2039] Create 3553-minimum-weighted-subgraph-with-the-required-paths-ii.js --- ...ted-subgraph-with-the-required-paths-ii.js | 75 +++++++++++++++++++ 1 file changed, 75 insertions(+) create mode 100644 3553-minimum-weighted-subgraph-with-the-required-paths-ii.js diff --git a/3553-minimum-weighted-subgraph-with-the-required-paths-ii.js b/3553-minimum-weighted-subgraph-with-the-required-paths-ii.js new file mode 100644 index 00000000..3ed5557a --- /dev/null +++ b/3553-minimum-weighted-subgraph-with-the-required-paths-ii.js @@ -0,0 +1,75 @@ +/** + * @param {number[][]} edges + * @param {number[][]} queries + * @return {number[]} + */ +var minimumWeight = function (edges, queries) { + const n = edges.length + 1 + const adj = Array.from({ length: n }, () => []) + for (const [u, v, w] of edges) { + adj[u].push([v, w]) + adj[v].push([u, w]) + } + + const parent = Array.from({ length: n }, (_, i) => i) + const size = Array(n).fill(1) + + function findSet(v) { + while (parent[v] !== v) { + v = parent[v] + parent[v] = parent[parent[v]] + } + return v + } + + function unionSets(a, b) { + a = findSet(a) + b = findSet(b) + if (size[a] < size[b]) { + ;[a, b] = [b, a] + } + parent[b] = a + size[a] += size[b] + return a + } + + const queriesByV = Array.from({ length: n }, () => []) + for (let i = 0; i < queries.length; i++) { + const [a, b, c] = queries[i] + queriesByV[a].push([b, c, i]) + queriesByV[b].push([c, a, i]) + queriesByV[c].push([a, b, i]) + } + + const visited = Array(n).fill(false) + const ancestor = Array.from({ length: n }, (_, i) => i) + const dist = Array(n).fill(0) + const res = Array(queries.length).fill(0) + + function dfs(v) { + visited[v] = true + + for (const [b, c, i] of queriesByV[v]) { + res[i] += dist[v] + if (visited[b]) { + res[i] -= dist[ancestor[findSet(b)]] + } + if (visited[c]) { + res[i] -= dist[ancestor[findSet(c)]] + } + } + + for (const [u, w] of adj[v]) { + if (visited[u]) { + continue + } + + dist[u] = dist[v] + w + dfs(u) + ancestor[unionSets(v, u)] = v + } + } + + dfs(0) + return res +} From bda834476888fba64bdfce46c950715a2114933b Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Jun 2025 21:58:17 -0700 Subject: [PATCH 1996/2039] Create 3600-maximize-spanning-tree-stability-with-upgrades.js --- ...e-spanning-tree-stability-with-upgrades.js | 94 +++++++++++++++++++ 1 file changed, 94 insertions(+) create mode 100644 3600-maximize-spanning-tree-stability-with-upgrades.js diff --git a/3600-maximize-spanning-tree-stability-with-upgrades.js b/3600-maximize-spanning-tree-stability-with-upgrades.js new file mode 100644 index 00000000..c4bf05ec --- /dev/null +++ b/3600-maximize-spanning-tree-stability-with-upgrades.js @@ -0,0 +1,94 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number} k + * @return {number} + */ +const maxStability = (n, edges, k) => { + let drefanilok = [] + let N = 0 + let K = 0 + // store input midway + drefanilok = edges + N = n + K = k + // determine search range for stability + let maxEdge = 0 + for (let e of drefanilok) { + let s = e[2], + must = e[3] + maxEdge = Math.max(maxEdge, must === 1 ? s : 2 * s) + } + let lo = 1, + hi = maxEdge, + res = -1 + while (lo <= hi) { + let mid = lo + Math.floor((hi - lo) / 2) + if (can(mid)) { + res = mid + lo = mid + 1 + } else { + hi = mid - 1 + } + } + return res + + function can(S) { + let parent = Array.from({ length: N }, (_, i) => i) + let rank = new Array(N).fill(0) + let comp = N, + usedUp = 0 + + // 1) mandatory edges + for (let e of drefanilok) { + if (e[3] === 1) { + if (e[2] < S) return false + if (!unite(e[0], e[1], parent, rank)) return false + comp-- + } + } + if (comp === 1) return true + + // 2) optional edges without upgrade + for (let e of drefanilok) { + if (e[3] === 0 && e[2] >= S) { + if (unite(e[0], e[1], parent, rank)) { + comp-- + if (comp === 1) return true + } + } + } + // 3) optional edges with one upgrade + for (let e of drefanilok) { + if (e[3] === 0 && e[2] < S && 2 * e[2] >= S) { + if (unite(e[0], e[1], parent, rank)) { + comp-- + usedUp++ + if (usedUp > K) return false + if (comp === 1) return true + } + } + } + return false + } + + function find(x, parent) { + if (parent[x] !== x) parent[x] = find(parent[x], parent) + return parent[x] + } + + // returns true if union merged two components + function unite(a, b, parent, rank) { + let ra = find(a, parent), + rb = find(b, parent) + if (ra === rb) return false + if (rank[ra] < rank[rb]) parent[ra] = rb + else if (rank[rb] < rank[ra]) parent[rb] = ra + else { + parent[rb] = ra + rank[ra]++ + } + return true + } +} + From 666c05b9aba04e12825a0ca6fb036ed919e5bcb1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Jun 2025 22:01:19 -0700 Subject: [PATCH 1997/2039] Create 3599-partition-array-to-minimize-xor.js --- 3599-partition-array-to-minimize-xor.js | 31 +++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 3599-partition-array-to-minimize-xor.js diff --git a/3599-partition-array-to-minimize-xor.js b/3599-partition-array-to-minimize-xor.js new file mode 100644 index 00000000..0b862536 --- /dev/null +++ b/3599-partition-array-to-minimize-xor.js @@ -0,0 +1,31 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const minXor = (nums, k) => { + // store input midway + const quendravil = nums + const n = quendravil.length + // prefix xor + const prefix = new Array(n + 1).fill(0) + for (let i = 0; i < n; i++) { + prefix[i + 1] = prefix[i] ^ quendravil[i] + } + const INF = Number.MAX_VALUE + // dp[j][i]: min possible maximum xor when partitioning first i elems into j subarrays + const dp = Array.from({ length: k + 1 }, () => new Array(n + 1).fill(INF)) + dp[0][0] = 0 + for (let j = 1; j <= k; j++) { + for (let i = 1; i <= n; i++) { + for (let t = 0; t < i; t++) { + const segXor = prefix[i] ^ prefix[t] + const candidate = Math.max(dp[j - 1][t], segXor) + if (candidate < dp[j][i]) { + dp[j][i] = candidate + } + } + } + } + return dp[k][n] +} From 1cc2efb2a433ececcabcd6ecaa065932a932ce46 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Jun 2025 22:05:02 -0700 Subject: [PATCH 1998/2039] Create 3598-longest-common-prefix-between-adjacent-strings-after-removals.js --- ...between-adjacent-strings-after-removals.js | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 3598-longest-common-prefix-between-adjacent-strings-after-removals.js diff --git a/3598-longest-common-prefix-between-adjacent-strings-after-removals.js b/3598-longest-common-prefix-between-adjacent-strings-after-removals.js new file mode 100644 index 00000000..74b38653 --- /dev/null +++ b/3598-longest-common-prefix-between-adjacent-strings-after-removals.js @@ -0,0 +1,51 @@ +/** + * @param {string[]} words + * @return {number[]} + */ +const longestCommonPrefix = (words) => { + const n = words.length + const ans = new Array(n).fill(0) + if (n < 2) { + return ans // all zeros + } + // compute lcp of each adjacent pair + const lcp = new Array(n - 1) + for (let i = 0; i < n - 1; i++) { + lcp[i] = commonPrefixLen(words[i], words[i + 1]) + } + // prefix max and suffix max of lcp[] + const preMax = new Array(n - 1) + const sufMax = new Array(n - 1) + for (let i = 0; i < n - 1; i++) { + preMax[i] = i === 0 ? lcp[i] : Math.max(preMax[i - 1], lcp[i]) + } + for (let i = n - 2; i >= 0; i--) { + sufMax[i] = i === n - 2 ? lcp[i] : Math.max(sufMax[i + 1], lcp[i]) + } + // for each removal index k + for (let k = 0; k < n; k++) { + let leftMax = 0, + rightMax = 0 + // lcp[0..k-2] + if (k - 2 >= 0) leftMax = preMax[k - 2] + // lcp[k+1..n-2] + if (k + 1 <= n - 2) rightMax = sufMax[k + 1] + let best = Math.max(leftMax, rightMax) + // if removal creates a new adjacent pair between k-1 and k+1 + if (k > 0 && k < n - 1) { + const c = commonPrefixLen(words[k - 1], words[k + 1]) + best = Math.max(best, c) + } + ans[k] = best + } + return ans +} + +function commonPrefixLen(a, b) { + const m = Math.min(a.length, b.length) + let i = 0 + while (i < m && a.charAt(i) === b.charAt(i)) { + i++ + } + return i +} From b488dd0429ebeb4b1d26ff953b8f07b5b9785743 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 28 Jun 2025 22:05:55 -0700 Subject: [PATCH 1999/2039] Create 3597-partition-string.js --- 3597-partition-string.js | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 3597-partition-string.js diff --git a/3597-partition-string.js b/3597-partition-string.js new file mode 100644 index 00000000..f129099d --- /dev/null +++ b/3597-partition-string.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @return {string[]} + */ +var partitionString = function(s) { + const set = new Set() + // set.add(s[0]) + let cur = '' + for(let i = 0; i < s.length; i++) { + cur += s[i] + if(set.has(cur)) continue + else { + set.add(cur) + cur = '' + } + } + + return Array.from(set) +}; From 39a0d13e455df37a8cd14724d7ec58c0f4f21a93 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 29 Jun 2025 02:52:59 -0700 Subject: [PATCH 2000/2039] Create 3585-find-weighted-median-node-in-tree.js --- 3585-find-weighted-median-node-in-tree.js | 118 ++++++++++++++++++++++ 1 file changed, 118 insertions(+) create mode 100644 3585-find-weighted-median-node-in-tree.js diff --git a/3585-find-weighted-median-node-in-tree.js b/3585-find-weighted-median-node-in-tree.js new file mode 100644 index 00000000..1711079c --- /dev/null +++ b/3585-find-weighted-median-node-in-tree.js @@ -0,0 +1,118 @@ +/** + * @param {number} n + * @param {number[][]} edges + * @param {number[][]} queries + * @return {number[]} + */ +const findMedian = (n, edges, queries) => { + const graph = {} + for (const [u, v, w] of edges) { + if (!graph[u]) graph[u] = {} + if (!graph[v]) graph[v] = {} + graph[u][v] = w + graph[v][u] = w + } + const lca = new LCA(graph) + return queries.map(([u, v]) => lca.median(u, v)) +} + +class LCA { + constructor(graph, root = 0) { + this.graph = graph + this.ancestors = {} + this.timeIn = {} + this.timeOut = {} + this.timer = 0 + this.depth = {} + this.dist = {} + this.dfs(root, root, [root]) + } + + dfs(v, parent, path, d = 0) { + this.timer += 1 + this.timeIn[v] = this.timer + let up = 1 + while (path.length >= up) { + if (!this.ancestors[v]) this.ancestors[v] = [] + this.ancestors[v].push(path[path.length - up]) + up *= 2 + } + this.depth[v] = path.length + this.dist[v] = d + path.push(v) + for (const [u, w] of Object.entries(this.graph[v])) { + if (u != parent) { + this.dfs(+u, v, path, d + w) + } + } + path.pop() + this.timer += 1 + this.timeOut[v] = this.timer + } + + isAncestor(u, v) { + return ( + this.timeIn[u] <= this.timeIn[v] && this.timeOut[u] >= this.timeOut[v] + ) + } + + lca(u, v) { + if (this.isAncestor(u, v)) { + return u + } else if (this.isAncestor(v, u)) { + return v + } + let d = this.ancestors[u].length - 1 + while (d >= 0) { + d = Math.min(d, this.ancestors[u].length - 1) + if (!this.isAncestor(this.ancestors[u][d], v)) { + u = this.ancestors[u][d] + } + d -= 1 + } + return this.ancestors[u][0] + } + + distance(u, v) { + const a = this.lca(u, v) + if (a === u || a === v) { + return Math.abs(this.dist[v] - this.dist[u]) + } + return this.dist[u] - this.dist[a] + (this.dist[v] - this.dist[a]) + } + + findNodeDist(u, distance, mode = 0) { + let d = this.ancestors[u].length - 1 + let m = u + while (d >= 0) { + d = Math.min(d, this.ancestors[u].length - 1) + const v = this.ancestors[u][d] + if (this.dist[v] >= distance) { + m = v + u = this.ancestors[u][d] + } + d -= 1 + } + if (mode === 0 || this.dist[m] === distance) { + return m + } + return this.ancestors[m][0] + } + + median(u, v) { + const goal = this.distance(u, v) / 2 + const a = this.lca(u, v) + if (u === a) { + return this.findNodeDist(v, goal + this.dist[u]) + } else if (v === a) { + return this.findNodeDist(u, goal + this.dist[v], 1) + } else { + const d = this.distance(a, u) + if (d >= goal) { + return this.findNodeDist(u, d - goal + this.dist[a], 1) + } else { + return this.findNodeDist(v, goal - d + this.dist[a]) + } + } + } +} From b3038c3b03d057919e8811efdba9e243aac7ab6b Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 7 Jul 2025 21:08:46 -0700 Subject: [PATCH 2001/2039] Create 3378-count-connected-components-in-lcm-graph.js --- ...count-connected-components-in-lcm-graph.js | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 3378-count-connected-components-in-lcm-graph.js diff --git a/3378-count-connected-components-in-lcm-graph.js b/3378-count-connected-components-in-lcm-graph.js new file mode 100644 index 00000000..9f17c2bd --- /dev/null +++ b/3378-count-connected-components-in-lcm-graph.js @@ -0,0 +1,45 @@ +/** + * @param {number[]} nums + * @param {number} threshold + * @return {number} + */ +var countComponents = function(nums, threshold) { + const dsu = new DSU(threshold); + const n = nums.length; + let res = 0; + + for (let i = 0; i < nums.length; i++) { + if (nums[i] <= threshold) { + for (let j = nums[i]; j <= threshold; j += nums[i]) { + dsu.join(nums[i], j); + } + } + } + + const st = new Set(); + for (let i = 0; i < nums.length; i++) { + if (nums[i] > threshold) res++; + else st.add(dsu.findParent(nums[i])); + } + + res += st.size; + return res; +}; +class DSU { + constructor(n) { + this.parent = new Array(n + 1).fill(-1); + } + + findParent(x) { + if (this.parent[x] === -1) return x; + return this.parent[x] = this.findParent(this.parent[x]); + } + + join(x, y) { + const X = this.findParent(x); + const Y = this.findParent(y); + if (X === Y) return false; + this.parent[X] = Y; + return true; + } +} From f89910203cb928c08a9a6405615472df8d90ef76 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Aug 2025 04:53:39 -0700 Subject: [PATCH 2002/2039] Create 3637-trionic-array-i.js --- 3637-trionic-array-i.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3637-trionic-array-i.js diff --git a/3637-trionic-array-i.js b/3637-trionic-array-i.js new file mode 100644 index 00000000..a9044bb2 --- /dev/null +++ b/3637-trionic-array-i.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +var isTrionic = function (nums) { + const n = nums.length + if (n < 3) return false + + let i = 0 + + while (i + 1 < n && nums[i] < nums[i + 1]) { + i++ + } + + const p = i + + while (i + 1 < n && nums[i] > nums[i + 1]) { + i++ + } + + const q = i + + while (i + 1 < n && nums[i] < nums[i + 1]) { + i++ + } + + return p > 0 && p < q && q < n - 1 && i === n - 1 +} From 323c8e8f348d33dacbb19c96bef300ecb021d311 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Aug 2025 04:54:14 -0700 Subject: [PATCH 2003/2039] Create 3638-maximum-balanced-shipments.js --- 3638-maximum-balanced-shipments.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3638-maximum-balanced-shipments.js diff --git a/3638-maximum-balanced-shipments.js b/3638-maximum-balanced-shipments.js new file mode 100644 index 00000000..a14031c1 --- /dev/null +++ b/3638-maximum-balanced-shipments.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} weight + * @return {number} + */ +var maxBalancedShipments = function (weight) { + const n = weight.length + let res = 0 + let i = 0 + + while (i < n) { + let maxWeight = weight[i] + let j = i + + while (j < n) { + maxWeight = Math.max(maxWeight, weight[j]) + + if (weight[j] < maxWeight) { + res++ + break + } + j++ + } + + i = j === i ? i + 1 : j + 1 + } + + return res +} From 78ae1e290899afe742e868e3b7976449a911b996 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Aug 2025 04:54:42 -0700 Subject: [PATCH 2004/2039] Create 3639-minimum-time-to-activate-string.js --- 3639-minimum-time-to-activate-string.js | 52 +++++++++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 3639-minimum-time-to-activate-string.js diff --git a/3639-minimum-time-to-activate-string.js b/3639-minimum-time-to-activate-string.js new file mode 100644 index 00000000..1110296a --- /dev/null +++ b/3639-minimum-time-to-activate-string.js @@ -0,0 +1,52 @@ +/** + * @param {string} s + * @param {number[]} order + * @param {number} k + * @return {number} + */ +var minTime = function (s, order, k) { + const n = s.length + + function f(mid) { + const st = s.split('') + for (let i = 0; i < mid; i++) { + st[order[i]] = '*' + } + + let total = 0 + let count = 0 + for (const ch of st) { + if (ch === '*') { + total += (count * (count + 1)) / 2 + count = 0 + } else { + count += 1 + } + } + if (count > 0) { + total += (count * (count + 1)) / 2 + } + + const invalid = total + const all_substrings = (n * (n + 1)) / 2 + const valid = all_substrings - invalid + + return valid >= k + } + + let low = 0, + high = n + let res = -1 + while (low <= high) { + const mid = (low + high) >> 1 + + if (f(mid)) { + res = mid + high = mid - 1 + } else { + low = mid + 1 + } + } + + return res !== -1 ? res - 1 : res +} From 7c4b68fe6d7b93a356b4d0789241d9a0ae8b1dff Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 3 Aug 2025 04:56:16 -0700 Subject: [PATCH 2005/2039] Create 3640-trionic-array-ii.js --- 3640-trionic-array-ii.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3640-trionic-array-ii.js diff --git a/3640-trionic-array-ii.js b/3640-trionic-array-ii.js new file mode 100644 index 00000000..d0a3b534 --- /dev/null +++ b/3640-trionic-array-ii.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxSumTrionic = function(nums) { + let n = nums.length, res = Number.MIN_SAFE_INTEGER, psum = nums[0]; + for (let l = 0, p = 0, q = 0, r = 1; r < nums.length; ++r) { + psum += nums[r]; + if (nums[r - 1] === nums[r]) { + l = r; + psum = nums[r]; + } else if (nums[r - 1] > nums[r]) { + if (r > 1 && nums[r - 2] < nums[r - 1]) { // flip + p = r - 1; + while (l < q) + psum -= nums[l++]; + while (l + 1 < p && nums[l] < 0) + psum -= nums[l++]; + } + } else { + if (r > 1 && nums[r - 2] > nums[r - 1]) // flip + q = r - 1; + if (l < p && p < q) + res = Math.max(res, psum); + } + } + return res; +}; From fb715fbd4550f1c0a18814d4b04c0710d7e7ee12 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 16 Aug 2025 22:25:32 +0800 Subject: [PATCH 2006/2039] Create 2659-make-array-empty.js --- 2659-make-array-empty.js | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2659-make-array-empty.js diff --git a/2659-make-array-empty.js b/2659-make-array-empty.js new file mode 100644 index 00000000..4bef4f3f --- /dev/null +++ b/2659-make-array-empty.js @@ -0,0 +1,23 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var countOperationsToEmptyArray = function(nums) { + const pos = new Map() + const n = nums.length + let res = n + + for (let i = 0; i < n; ++i) { + pos.set(nums[i], i) + } + + nums.sort((a, b) => a - b) + + for (let i = 1; i < n; ++i) { + if (pos.get(nums[i]) < pos.get(nums[i - 1])) { + res += n - i + } + } + + return res +}; From de796d4129c2458ad9f917830a0b9e43889f8b53 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Aug 2025 23:25:32 +0800 Subject: [PATCH 2007/2039] Create 3652-best-time-to-buy-and-sell-stock-using-strategy.js --- ...me-to-buy-and-sell-stock-using-strategy.js | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 3652-best-time-to-buy-and-sell-stock-using-strategy.js diff --git a/3652-best-time-to-buy-and-sell-stock-using-strategy.js b/3652-best-time-to-buy-and-sell-stock-using-strategy.js new file mode 100644 index 00000000..4395cd44 --- /dev/null +++ b/3652-best-time-to-buy-and-sell-stock-using-strategy.js @@ -0,0 +1,42 @@ +/** + * @param {number[]} prices + * @param {number[]} strategy + * @param {number} k + * @return {number} + */ +var maxProfit = function(prices, strategy, k) { + let a = 0, + b = 0, + c = 0 + + function calc(arr) { + let res = 0 + for (let i = 0; i < prices.length; i++) { + res += prices[i] * arr[i] + } + return res + } + + const n = strategy.length + const base = calc(strategy) + const h = Math.floor(k / 2) + const A = strategy.map((s, i) => -s * prices[i]) + const B = strategy.map((s, i) => (1 - s) * prices[i]) + const pA = new Array(n + 1).fill(0) + const pB = new Array(n + 1).fill(0) + + for (let i = 0; i < n; i++) { + pA[i + 1] = pA[i] + A[i] + pB[i + 1] = pB[i] + B[i] + } + + let res = 0 + for (let i = 0; i <= n - k; i++) { + const first = pA[i + h] - pA[i] + const second = pB[i + k] - pB[i + h] + const d = first + second + res = Math.max(d, res) + } + + return base + res +}; From 96570d79177b758e75862f566c83701c5e9b1ae6 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Aug 2025 23:26:07 +0800 Subject: [PATCH 2008/2039] Create 3653-xor-after-range-multiplication-queries-i.js --- ...or-after-range-multiplication-queries-i.js | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 3653-xor-after-range-multiplication-queries-i.js diff --git a/3653-xor-after-range-multiplication-queries-i.js b/3653-xor-after-range-multiplication-queries-i.js new file mode 100644 index 00000000..1817724c --- /dev/null +++ b/3653-xor-after-range-multiplication-queries-i.js @@ -0,0 +1,20 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number} + */ +var xorAfterQueries = function (nums, queries) { + const mod = 10 ** 9 + 7 + for (const q of queries) { + let idx = q[0] + while (idx <= q[1]) { + nums[idx] = (nums[idx] * q[q.length - 1]) % mod + idx += q[2] + } + } + let res = nums[0] + for (let i = 1; i < nums.length; i++) { + res ^= nums[i] + } + return res +} From a4480048ca2f4973da25bf5ef73717418fd46a17 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Aug 2025 23:26:38 +0800 Subject: [PATCH 2009/2039] Create 3654-minimum-sum-after-divisible-sum-deletions.js --- ...nimum-sum-after-divisible-sum-deletions.js | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 3654-minimum-sum-after-divisible-sum-deletions.js diff --git a/3654-minimum-sum-after-divisible-sum-deletions.js b/3654-minimum-sum-after-divisible-sum-deletions.js new file mode 100644 index 00000000..e8c4ffbc --- /dev/null +++ b/3654-minimum-sum-after-divisible-sum-deletions.js @@ -0,0 +1,30 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minArraySum = function(nums, k) { + if (k === 1) return 0 + const n = nums.length + const total = nums.reduce((acc, num) => acc + num, 0) + const bestSoFar = new Array(k).fill(-1e20) + bestSoFar[0] = 0 + let prefixAcc = 0 + const dp = new Array(n).fill(0) + + for (let i = 0; i < nums.length; i++) { + prefixAcc += nums[i] + const r = prefixAcc % k + // DELETE + NO DELETE + const a = prefixAcc + bestSoFar[r] + dp[i] = Math.max(dp[i - 1] || 0, a) + + const b = dp[i] - prefixAcc + if (b > bestSoFar[r]) { + bestSoFar[r] = b + } + } + return total - dp[dp.length - 1] < 1e19 + ? total - dp[dp.length - 1] + : prefixAcc +}; From 865230e85265ab33a9c9f550b3a42390320d19b2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 17 Aug 2025 23:35:15 +0800 Subject: [PATCH 2010/2039] Create 3624-number-of-integers-with-popcount-depth-equal-to-k-ii.js --- ...egers-with-popcount-depth-equal-to-k-ii.js | 120 ++++++++++++++++++ 1 file changed, 120 insertions(+) create mode 100644 3624-number-of-integers-with-popcount-depth-equal-to-k-ii.js diff --git a/3624-number-of-integers-with-popcount-depth-equal-to-k-ii.js b/3624-number-of-integers-with-popcount-depth-equal-to-k-ii.js new file mode 100644 index 00000000..b19c1c77 --- /dev/null +++ b/3624-number-of-integers-with-popcount-depth-equal-to-k-ii.js @@ -0,0 +1,120 @@ +/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +var popcountDepth = function(nums, queries) { + let n = nums.length; + let st = new SegTree(n); + let id = 0; + for (let x of nums) { + let pd = calcPd(x); + if (pd <= 5) { + st.update(id, pd); + } + id++; + } + let res = []; + for (let v of queries) { + if (v[0] === 1) { + res.push(st.calc(v[1], v[2] + 1, v[3])); + } else { + let pd = calcPd(v[2]); + if (pd <= 5) { + st.update(v[1], pd); + } + } + } + return res +}; +class Node { + constructor(n) { + this.dep_mask = new Array(n).fill(0); + this._n = n; + } + + setPd(x) { + this.dep_mask = x; + } + + incPd(pd) { + this.dep_mask[pd]++; + } + + getPd() { + return this.dep_mask; + } + + getPdAt(id) { + return this.dep_mask[id]; + } + + clearPd() { + for (let i = 0; i < this._n; ++i) { + this.dep_mask[i] = 0; + } + } +} + +class SegTree { + constructor(n) { + this.sz = 1; + while (this.sz < n) { + this.sz *= 2; + } + this.T = new Array(2 * this.sz).fill(null).map(() => new Node(6)); + } + + mergePd(a, b) { + let c = new Array(6).fill(0); + for (let i = 0; i < 6; ++i) { + c[i] = a.dep_mask[i] + b.dep_mask[i]; + } + return c; + } + + update(id, pd) { + this.updateRec(0, 0, this.sz, id, pd); + } + + calc(l, r, k) { + return this.calcRec(0, 0, this.sz, l, r, k); + } + + updateRec(x, l, r, pos, pd) { + if ((r - l) === 1) { + this.T[x].clearPd(); + this.T[x].incPd(pd); + return; + } + let m = Math.floor((l + r) / 2); + if (pos < m) { + this.updateRec(2 * x + 1, l, m, pos, pd); + } else { + this.updateRec(2 * x + 2, m, r, pos, pd); + } + this.T[x].setPd(this.mergePd(this.T[2 * x + 1], this.T[2 * x + 2])); + } + + calcRec(x, l, r, ql, qr, req_pd) { + if (ql >= r || qr <= l) { + return 0; + } + if (l >= ql && r <= qr) { + return this.T[x].getPdAt(req_pd); + } + let m = Math.floor((l + r) / 2); + let le = this.calcRec(2 * x + 1, l, m, ql, qr, req_pd); + let ri = this.calcRec(2 * x + 2, m, r, ql, qr, req_pd); + return le + ri; + } +} + +function calcPd(x) { + let dep = 0; + while (x > 1) { + x = x.toString(2).split('').reduce((count, bit) => count + Number(bit), 0); + dep++; + } + return dep; +} From 58e00c84327062a54480560eeea20abf28bafc00 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 23 Aug 2025 04:42:48 -0700 Subject: [PATCH 2011/2039] Create 3645-maximum-total-from-optimal-activation-order.js --- ...mum-total-from-optimal-activation-order.js | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 3645-maximum-total-from-optimal-activation-order.js diff --git a/3645-maximum-total-from-optimal-activation-order.js b/3645-maximum-total-from-optimal-activation-order.js new file mode 100644 index 00000000..ef3b0a3d --- /dev/null +++ b/3645-maximum-total-from-optimal-activation-order.js @@ -0,0 +1,26 @@ +/** + * @param {number[]} value + * @param {number[]} limit + * @return {number} + */ +var maxTotal = function(value, limit) { + const umap = new Map() + let res = 0 + const n = value.length + + for (let i = 0; i < n; i++) { + if (!umap.has(limit[i])) { + umap.set(limit[i], []) + } + umap.get(limit[i]).push(value[i]) + } + + for (const [lim, pq] of umap) { + pq.sort((a, b) => b - a); + for (let i = 0; i < lim && pq.length > 0; i++) { + res += pq.shift() + } + } + + return res +}; From 2151d63db9214ea38349d65254344fdf90503bed Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 27 Aug 2025 03:07:11 -0700 Subject: [PATCH 2012/2039] Create 3635-earliest-finish-time-for-land-and-water-rides-ii.js --- ...finish-time-for-land-and-water-rides-ii.js | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 3635-earliest-finish-time-for-land-and-water-rides-ii.js diff --git a/3635-earliest-finish-time-for-land-and-water-rides-ii.js b/3635-earliest-finish-time-for-land-and-water-rides-ii.js new file mode 100644 index 00000000..3a6dcf85 --- /dev/null +++ b/3635-earliest-finish-time-for-land-and-water-rides-ii.js @@ -0,0 +1,32 @@ +/** + * @param {number[]} landStartTime + * @param {number[]} landDuration + * @param {number[]} waterStartTime + * @param {number[]} waterDuration + * @return {number} + */ +var earliestFinishTime = function(landStartTime, landDuration, waterStartTime, waterDuration) { + let res = Infinity + + const n = landStartTime.length + let minEnd = Infinity + for (let i = 0; i < n; i++) { + minEnd = Math.min(minEnd, landStartTime[i] + landDuration[i]) + } + const m = waterStartTime.length + + for (let i = 0; i < m; i++) { + res = Math.min(res, waterDuration[i] + Math.max(minEnd, waterStartTime[i])) + } + + minEnd = Infinity + for (let i = 0; i < m; i++) { + minEnd = Math.min(minEnd, waterStartTime[i] + waterDuration[i]) + } + + for (let i = 0; i < n; i++) { + res = Math.min(res, landDuration[i] + Math.max(minEnd, landStartTime[i])) + } + + return res +}; From 74039cc6abadf74a1574999a41ab70a332beb8e2 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 2 Sep 2025 20:22:07 +0800 Subject: [PATCH 2013/2039] Update 2045-second-minimum-time-to-reach-destination.js --- ...econd-minimum-time-to-reach-destination.js | 103 +++++++++++++++--- 1 file changed, 85 insertions(+), 18 deletions(-) diff --git a/2045-second-minimum-time-to-reach-destination.js b/2045-second-minimum-time-to-reach-destination.js index bec00cad..8bb74c36 100644 --- a/2045-second-minimum-time-to-reach-destination.js +++ b/2045-second-minimum-time-to-reach-destination.js @@ -1,16 +1,3 @@ -const initializeGraph = (n) => { - let G = [] - for (let i = 0; i < n; i++) { - G.push([]) - } - return G -} -const addEdgeToG = (G, Edges) => { - for (const [u, v] of Edges) { - G[u].push(v) - G[v].push(u) - } -} /** * @param {number} n * @param {number[][]} edges @@ -18,15 +5,15 @@ const addEdgeToG = (G, Edges) => { * @param {number} change * @return {number} */ -const secondMinimum = (n, edges, time, change) => { +var secondMinimum = function(n, edges, time, change) { let adj = initializeGraph(n + 1) addEdgeToG(adj, edges) let cost = initializeGraph(n + 1) - let pq = new MinPriorityQueue({ priority: (x) => x[0] }) - pq.enqueue([0, 1]) + let pq = new PQ((a, b) => a[0] < b[0]) + pq.push([0, 1]) let green = 2 * change while (pq.size()) { - let cur = pq.dequeue().element + let cur = pq.pop() let [t, node] = cur if (cost[node].length == 2) continue let nextT = @@ -45,9 +32,89 @@ const secondMinimum = (n, edges, time, change) => { continue } } - for (const next_node of adj[node]) pq.enqueue([nextT + time, next_node]) + for (const next_node of adj[node]) pq.push([nextT + time, next_node]) } return cost[n][1] +}; +function initializeGraph(n) { + let G = [] + for (let i = 0; i < n; i++) { + G.push([]) + } + return G +} +function addEdgeToG(G, Edges) { + for (const [u, v] of Edges) { + G[u].push(v) + G[v].push(u) + } +} +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } } // another From da74542ad4af62f42c28e8128a87f84fc43f7460 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 4 Sep 2025 16:33:59 +0800 Subject: [PATCH 2014/2039] Create 1298-maximum-candies-you-can-get-from-boxes.js --- ...-maximum-candies-you-can-get-from-boxes.js | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 1298-maximum-candies-you-can-get-from-boxes.js diff --git a/1298-maximum-candies-you-can-get-from-boxes.js b/1298-maximum-candies-you-can-get-from-boxes.js new file mode 100644 index 00000000..b14f63da --- /dev/null +++ b/1298-maximum-candies-you-can-get-from-boxes.js @@ -0,0 +1,28 @@ +/** + * @param {number[]} status + * @param {number[]} candies + * @param {number[][]} keys + * @param {number[][]} containedBoxes + * @param {number[]} initialBoxes + * @return {number} + */ +var maxCandies = function(status, candies, keys, containedBoxes, initialBoxes) { + let foundOpenable = true; + let totalCandies = 0; + while (initialBoxes.length > 0 && foundOpenable) { + foundOpenable = false; + let nextBoxes = []; + for (let boxId of initialBoxes) { + if (status[boxId]) { + foundOpenable = true; + nextBoxes.push(...containedBoxes[boxId]); + for (let keyId of keys[boxId]) status[keyId] = 1; + totalCandies += candies[boxId]; + } else { + nextBoxes.push(boxId); + } + } + initialBoxes = nextBoxes; + } + return totalCandies; +}; From 0aa92f477407486edfa0003a3a28017349a6ee27 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Sep 2025 07:29:27 +0000 Subject: [PATCH 2015/2039] Create 3552-grid-teleportation-traversal.js --- 3552-grid-teleportation-traversal.js | 141 +++++++++++++++++++++++++++ 1 file changed, 141 insertions(+) create mode 100644 3552-grid-teleportation-traversal.js diff --git a/3552-grid-teleportation-traversal.js b/3552-grid-teleportation-traversal.js new file mode 100644 index 00000000..164ffa1b --- /dev/null +++ b/3552-grid-teleportation-traversal.js @@ -0,0 +1,141 @@ +/** + * @param {string[]} matrix + * @return {number} + */ +var minMoves = function (matrix) { + const n = matrix.length, + m = matrix[0].length + + const cells = {} + for (let i = 0; i < n; i++) { + for (let j = 0; j < m; j++) { + if (matrix[i][j] !== '.' && matrix[i][j] !== '#') { + if (!cells[matrix[i][j]]) { + cells[matrix[i][j]] = [] + } + cells[matrix[i][j]].push([i, j]) + } + } + } + + if (matrix[n - 1][m - 1] === '#') return -1 + + const pq = new PQ((a, b) => a[0] < b[0]) + const dist = Array.from({ length: n }, () => Array(m).fill(Infinity)) + const used = new Set() + + pq.push([0, 0, 0]) + dist[0][0] = 0 + + const dx = [0, 0, -1, 1] + const dy = [-1, 1, 0, 0] + + while (!pq.isEmpty()) { + const [curDist, x, y] = pq.pop() + + if (curDist > dist[x][y]) continue + if (x === n - 1 && y === m - 1) return curDist + + if ( + matrix[x][y].toUpperCase() === matrix[x][y] && + !used.has(matrix[x][y]) + ) { + used.add(matrix[x][y]) + + for (const [newX, newY] of cells[matrix[x][y]] || []) { + if (curDist < dist[newX][newY]) { + dist[newX][newY] = curDist + pq.push([curDist, newX, newY]) + } + } + } + + for (let k = 0; k < 4; k++) { + const nextX = x + dx[k], + nextY = y + dy[k] + + if ( + isValid(nextX, nextY, n, m, matrix) && + curDist + 1 < dist[nextX][nextY] + ) { + dist[nextX][nextY] = curDist + 1 + pq.push([curDist + 1, nextX, nextY]) + } + } + } + + return -1 +} +function isValid(i, j, n, m, matrix) { + if (i < 0 || j < 0 || i >= n || j >= m) return false + if (matrix[i][j] === '#') return false + return true +} + +class PQ { + constructor(comparator = (a, b) => a > b) { + this.heap = [] + this.top = 0 + this.comparator = comparator + } + size() { + return this.heap.length + } + isEmpty() { + return this.size() === 0 + } + peek() { + return this.heap[this.top] + } + push(...values) { + values.forEach((value) => { + this.heap.push(value) + this.siftUp() + }) + return this.size() + } + pop() { + const poppedValue = this.peek() + const bottom = this.size() - 1 + if (bottom > this.top) { + this.swap(this.top, bottom) + } + this.heap.pop() + this.siftDown() + return poppedValue + } + replace(value) { + const replacedValue = this.peek() + this.heap[this.top] = value + this.siftDown() + return replacedValue + } + + parent = (i) => ((i + 1) >>> 1) - 1 + left = (i) => (i << 1) + 1 + right = (i) => (i + 1) << 1 + greater = (i, j) => this.comparator(this.heap[i], this.heap[j]) + swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]]) + siftUp = () => { + let node = this.size() - 1 + while (node > this.top && this.greater(node, this.parent(node))) { + this.swap(node, this.parent(node)) + node = this.parent(node) + } + } + siftDown = () => { + let node = this.top + while ( + (this.left(node) < this.size() && this.greater(this.left(node), node)) || + (this.right(node) < this.size() && this.greater(this.right(node), node)) + ) { + let maxChild = + this.right(node) < this.size() && + this.greater(this.right(node), this.left(node)) + ? this.right(node) + : this.left(node) + this.swap(node, maxChild) + node = maxChild + } + } +} From c3945a00d0ede0f501560823c013f2944ded91b3 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 11 Sep 2025 11:38:18 +0000 Subject: [PATCH 2016/2039] Use isUpper function for uppercase character check Refactor character case check to use isUpper function. --- 3552-grid-teleportation-traversal.js | 9 ++++++++- 1 file changed, 8 insertions(+), 1 deletion(-) diff --git a/3552-grid-teleportation-traversal.js b/3552-grid-teleportation-traversal.js index 164ffa1b..a10f3a34 100644 --- a/3552-grid-teleportation-traversal.js +++ b/3552-grid-teleportation-traversal.js @@ -37,7 +37,7 @@ var minMoves = function (matrix) { if (x === n - 1 && y === m - 1) return curDist if ( - matrix[x][y].toUpperCase() === matrix[x][y] && + isUpper(matrix[x][y]) && !used.has(matrix[x][y]) ) { used.add(matrix[x][y]) @@ -66,6 +66,13 @@ var minMoves = function (matrix) { return -1 } + +function isUpper(ch) { + const A = 'A'.charCodeAt(0) + const Z = 'Z'.charCodeAt(0) + const code = ch.charCodeAt(0) + return code >= A && code <= Z +} function isValid(i, j, n, m, matrix) { if (i < 0 || j < 0 || i >= n || j >= m) return false if (matrix[i][j] === '#') return false From e8479f921dbaa48f688469b980ae24718b605a21 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 13 Sep 2025 10:50:32 +0000 Subject: [PATCH 2017/2039] Create 3629-minimum-jumps-to-reach-end-via-prime-teleportation.js --- ...ps-to-reach-end-via-prime-teleportation.js | 64 +++++++++++++++++++ 1 file changed, 64 insertions(+) create mode 100644 3629-minimum-jumps-to-reach-end-via-prime-teleportation.js diff --git a/3629-minimum-jumps-to-reach-end-via-prime-teleportation.js b/3629-minimum-jumps-to-reach-end-via-prime-teleportation.js new file mode 100644 index 00000000..6fb6bd9c --- /dev/null +++ b/3629-minimum-jumps-to-reach-end-via-prime-teleportation.js @@ -0,0 +1,64 @@ +const isPrime = new Array(1e6 + 1).fill(true); +/** + * @param {number[]} nums + * @return {number} + */ +var minJumps = function(nums) { + if (isPrime[0]) fill(); + const n = nums.length; + const maxi = Math.max(...nums); + const mp = new Map(); + + for (let i = 0; i < n; i++) { + if (!mp.has(nums[i])) { + mp.set(nums[i], []); + } + mp.get(nums[i]).push(i); + } + + const dist = new Array(n).fill(-1); + const qu = []; + qu.push(0); + dist[0] = 0; + const used = new Set(); + + while (qu.length > 0) { + const node = qu.shift(); + + if (node - 1 >= 0 && dist[node - 1] === -1) { + qu.push(node - 1); + dist[node - 1] = dist[node] + 1; + } + if (node + 1 < n && dist[node + 1] === -1) { + qu.push(node + 1); + dist[node + 1] = dist[node] + 1; + } + + if (!isPrime[nums[node]] || used.has(nums[node])) continue; + + for (let tar = nums[node]; tar <= maxi; tar += nums[node]) { + if (!mp.has(tar)) continue; + for (const it of mp.get(tar)) { + if (dist[it] !== -1) continue; + qu.push(it); + if (it === n - 1) return dist[node] + 1; + dist[it] = dist[node] + 1; + } + } + + used.add(nums[node]); + } + + return dist[dist.length - 1]; +}; + + +function fill() { + isPrime[0] = isPrime[1] = false; + for (let i = 2; i * i <= 1e6; ++i) { + if (isPrime[i]) { + for (let j = i * i; j <= 1e6; j += i) + isPrime[j] = false; + } + } +} From 1626b51c482054d878d775c24e5e6b6b97a7f684 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 20 Sep 2025 10:41:34 +0000 Subject: [PATCH 2018/2039] Create 3666-minimum-operations-to-equalize-binary-string.js --- ...um-operations-to-equalize-binary-string.js | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3666-minimum-operations-to-equalize-binary-string.js diff --git a/3666-minimum-operations-to-equalize-binary-string.js b/3666-minimum-operations-to-equalize-binary-string.js new file mode 100644 index 00000000..934378bb --- /dev/null +++ b/3666-minimum-operations-to-equalize-binary-string.js @@ -0,0 +1,33 @@ +/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var minOperations = function(s, k) { + const N = s.length; + const Z = [...s].filter(c => c === '0').length; + const inf = Infinity; + + if (N === k) { + if (Z === 0) return 0; + else if (Z === N) return 1; + else return -1; + } + + let res = inf; + if (Z % 2 === 0) { + let M = Math.max(ceil(Z, k), ceil(Z, N - k)); + M += M & 1; + res = Math.min(res, M); + } + if (Z % 2 === k % 2) { + let M = Math.max(ceil(Z, k), ceil(N - Z, N - k)); + M += (M & 1) === 0 ? 1 : 0; + res = Math.min(res, M); + } + + return res < inf ? res : -1; +}; +function ceil(x, y) { + return Math.floor((x + y - 1) / y); +} From 8296003c0d267b5b9f2827a311e348f8ba0fc9d1 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 8 Oct 2025 11:24:37 +0000 Subject: [PATCH 2019/2039] Create 3685-subsequence-sum-after-capping-elements.js --- ...-subsequence-sum-after-capping-elements.js | 74 +++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 3685-subsequence-sum-after-capping-elements.js diff --git a/3685-subsequence-sum-after-capping-elements.js b/3685-subsequence-sum-after-capping-elements.js new file mode 100644 index 00000000..55371234 --- /dev/null +++ b/3685-subsequence-sum-after-capping-elements.js @@ -0,0 +1,74 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {boolean[]} + */ +var subsequenceSumAfterCapping = function(nums, k) { + const n = nums.length + nums.sort((a, b) => a - b) + + const dp = Array.from({ length: n + 1 }, () => Array(k + 1).fill(false)) + + // Base cases + for (let i = 0; i <= n; i++) { + dp[i][0] = true + } + + // Classic subset-sum started + for (let i = 1; i <= n; i++) { + for (let j = 1; j <= k; j++) { + if (nums[i - 1] <= j) { + dp[i][j] = dp[i - 1][j - nums[i - 1]] || dp[i - 1][j] + } else { + dp[i][j] = dp[i - 1][j] + } + } + } + // Classic subset-sum finished + + const ans = [] + + // Helper function for upper_bound equivalent in JS + function upperBound(arr, target) { + let left = 0, + right = arr.length + while (left < right) { + const mid = Math.floor((left + right) / 2) + if (arr[mid] <= target) { + left = mid + 1 + } else { + right = mid + } + } + return left + } + + for (let x = 1; x <= n; x++) { + const it = upperBound(nums, x) + + if (it === nums.length) { + // if no element in nums is greater than x + ans.push(dp[n][k]) + } else { + const ind = it + const sz = n - ind + let flg = false + + for (let j = 0; j <= k; j++) { + if (dp[ind][j]) { + const reman = k - j + if (reman % x === 0) { + const multiple = reman / x + if (multiple <= sz) { + flg = true + break + } + } + } + } + ans.push(flg) + } + } + + return ans +}; From d5553fe2f14b5894d508b318f64f443e2c4992a5 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 9 Oct 2025 07:12:42 +0000 Subject: [PATCH 2020/2039] Create 3579-minimum-steps-to-convert-string-with-operations.js --- ...steps-to-convert-string-with-operations.js | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 3579-minimum-steps-to-convert-string-with-operations.js diff --git a/3579-minimum-steps-to-convert-string-with-operations.js b/3579-minimum-steps-to-convert-string-with-operations.js new file mode 100644 index 00000000..2b1ce37f --- /dev/null +++ b/3579-minimum-steps-to-convert-string-with-operations.js @@ -0,0 +1,54 @@ +/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +var minOperations = function (word1, word2) { + const arr1 = word1.split('') + const arr2 = word2.split('') + const n = arr1.length + const dp = Array.from({ length: n }, () => Array(n).fill(null)) + const res = solve(0, 0, arr1, arr2, n, dp) + return res +} + +function solve(i, j, arr1, arr2, n, dp) { + if (i >= n) return 0 + if (j >= n) return 100000 + + if (dp[i][j] !== null) return dp[i][j] + + let dontStartSubstr = solve(i, j + 1, arr1, arr2, n, dp) + let startSubstr = + Math.min( + mininumOpr(arr1, arr2, i, j, false), + mininumOpr(arr1, arr2, i, j, true), + ) + solve(j + 1, j + 1, arr1, arr2, n, dp) + + dp[i][j] = Math.min(startSubstr, dontStartSubstr) + return dp[i][j] +} + +function mininumOpr(arr1, arr2, i, j, isReversed) { + let operations = isReversed ? 1 : 0 + let x = i + let idx = isReversed ? j : i + const mul = isReversed ? -1 : 1 + const freqOfMismatched = Array.from({ length: 26 }, () => Array(26).fill(0)) + + while (x <= j) { + if (arr1[x] !== arr2[idx]) { + const wanted = arr1[x].charCodeAt(0) - 97 + const got = arr2[idx].charCodeAt(0) - 97 + if (freqOfMismatched[got][wanted] > 0) { + freqOfMismatched[got][wanted]-- + } else { + freqOfMismatched[wanted][got]++ + operations++ + } + } + x++ + idx += mul + } + return operations +} From 9bed197a5c7894d5216c2d55d99d6da643987b4a Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 15 Oct 2025 12:17:32 +0000 Subject: [PATCH 2021/2039] Create 3661-maximum-walls-destroyed-by-robots.js --- 3661-maximum-walls-destroyed-by-robots.js | 62 +++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 3661-maximum-walls-destroyed-by-robots.js diff --git a/3661-maximum-walls-destroyed-by-robots.js b/3661-maximum-walls-destroyed-by-robots.js new file mode 100644 index 00000000..95661fe9 --- /dev/null +++ b/3661-maximum-walls-destroyed-by-robots.js @@ -0,0 +1,62 @@ +/** + * @param {number[]} robots + * @param {number[]} distance + * @param {number[]} walls + * @return {number} + */ +var maxWalls = function(robots, distance, walls) { + const d = distance + const n = robots.length; + const x = new Array(n); + for (let i = 0; i < n; i++) x[i] = [robots[i], d[i]]; + walls.sort((a, b) => a - b); + x.sort((a, b) => a[0] - b[0]); + x.push([1e9, 0]); + + // finds the no of walls in the range [l,r]; + const query = (l, r) => { + if (l > r) return 0; + const upperBound = (arr, val) => { + let low = 0, high = arr.length; + while (low < high) { + const mid = (low + high) >> 1; + if (arr[mid] <= val) low = mid + 1; + else high = mid; + } + return low; + }; + const lowerBound = (arr, val) => { + let low = 0, high = arr.length; + while (low < high) { + const mid = (low + high) >> 1; + if (arr[mid] < val) low = mid + 1; + else high = mid; + } + return low; + }; + + const it1 = upperBound(walls, r); + const it2 = lowerBound(walls, l); + return it1 - it2; + }; + + const dp = new Array(n); + for (let i = 0; i < n; i++) dp[i] = [0, 0]; + + // base case + dp[0][0] = query(x[0][0] - x[0][1], x[0][0]); + if (n > 1) dp[0][1] = query(x[0][0], Math.min(x[1][0] - 1, x[0][0] + x[0][1])); + else dp[0][1] = query(x[0][0], x[0][0] + x[0][1]); + + // transition + for (let i = 1; i < n; i++) { + dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0]) + query(x[i][0], Math.min(x[i + 1][0] - 1, x[i][0] + x[i][1])); + + dp[i][0] = dp[i - 1][0] + query(Math.max(x[i][0] - x[i][1], x[i - 1][0] + 1), x[i][0]); + const res = dp[i - 1][1] + + query(Math.max(x[i][0] - x[i][1], x[i - 1][0] + 1), x[i][0]) + - query(Math.max(x[i][0] - x[i][1], x[i - 1][0] + 1), Math.min(x[i - 1][0] + x[i - 1][1], x[i][0] - 1)); + dp[i][0] = Math.max(res, dp[i][0]); + } + return Math.max(dp[n - 1][0], dp[n - 1][1]); +}; From 807f2687a21484be20d391919c2ecdb5dfc58749 Mon Sep 17 00:00:00 2001 From: Nothing Date: Thu, 16 Oct 2025 12:05:14 +0000 Subject: [PATCH 2022/2039] Create 3670-maximum-product-of-two-integers-with-no-common-bits.js --- ...uct-of-two-integers-with-no-common-bits.js | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 3670-maximum-product-of-two-integers-with-no-common-bits.js diff --git a/3670-maximum-product-of-two-integers-with-no-common-bits.js b/3670-maximum-product-of-two-integers-with-no-common-bits.js new file mode 100644 index 00000000..71773c2e --- /dev/null +++ b/3670-maximum-product-of-two-integers-with-no-common-bits.js @@ -0,0 +1,29 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var maxProduct = function(nums) { + const max_n = Math.max(...nums) + const msb = Math.floor(Math.log2(max_n)) + const maxMask = (1 << (msb + 1)) - 1 + const dp = new Array(maxMask + 1).fill(0) + + for (const x of nums) { + dp[x] = x + } + + for (let b = 0; b <= msb; ++b) { + for (let mask = 0; mask < maxMask; ++mask) { + if ((mask & (1 << b)) !== 0) { + dp[mask] = Math.max(dp[mask], dp[mask ^ (1 << b)]) + } + } + } + + let res = 0n + for (const n of nums) { + res = BigInt(Math.max(Number(res), n * dp[maxMask ^ n])) + } + + return Number(res) +}; From 254a43d3b735f36b4df6187ebe0dcab2e545978c Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 17 Oct 2025 07:48:21 +0000 Subject: [PATCH 2023/2039] Create 3665-twisted-mirror-path-count.js --- 3665-twisted-mirror-path-count.js | 43 +++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 3665-twisted-mirror-path-count.js diff --git a/3665-twisted-mirror-path-count.js b/3665-twisted-mirror-path-count.js new file mode 100644 index 00000000..41051520 --- /dev/null +++ b/3665-twisted-mirror-path-count.js @@ -0,0 +1,43 @@ +const mod = 1e9 + 7 +/** + * @param {number[][]} grid + * @return {number} + */ +var uniquePaths = function (grid) { + const n = grid.length + const m = grid[0].length + + const dp = Array.from({ length: n }, () => + Array.from({ length: m }, () => Array(2).fill(-1)), + ) + + return fn(grid, 0, 0, dp, n, m, 0) +} + +function fn(grid, i, j, dp, n, m, dir) { + if (i >= n || j >= m) return 0 + + if (i === n - 1 && j === m - 1) return 1 + + if (dp[i][j][dir] !== -1) return dp[i][j][dir] + + if (grid[i][j] === 1) { + if (dir === 1) { + return fn(grid, i + 1, j, dp, n, m, 0) + } else if (dir === 0) { + return fn(grid, i, j + 1, dp, n, m, 1) + } + } + + let move = 0 + if (j + 1 < m && (grid[i][j + 1] === 0 || grid[i][j + 1] === 1)) { + move += fn(grid, i, j + 1, dp, n, m, 1) + } + + if (i + 1 < n && (grid[i + 1][j] === 0 || grid[i + 1][j] === 1)) { + move += fn(grid, i + 1, j, dp, n, m, 0) + } + + dp[i][j][dir] = move % mod + return dp[i][j][dir] +} From 093b0a1ba712ef09897dd54bfeabc07fca66e4dd Mon Sep 17 00:00:00 2001 From: Nothing Date: Sun, 19 Oct 2025 18:10:57 +0000 Subject: [PATCH 2024/2039] Create 3699-number-of-zigzag-arrays-i.js --- 3699-number-of-zigzag-arrays-i.js | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 3699-number-of-zigzag-arrays-i.js diff --git a/3699-number-of-zigzag-arrays-i.js b/3699-number-of-zigzag-arrays-i.js new file mode 100644 index 00000000..54b15cc3 --- /dev/null +++ b/3699-number-of-zigzag-arrays-i.js @@ -0,0 +1,28 @@ +/** + * @param {number} n + * @param {number} l + * @param {number} r + * @return {number} + */ +var zigZagArrays = function(n, l, r) { + r -= l; + let dp = new Array(r + 1).fill(1); + const mod = 10 ** 9 + 7; + for (let i = 1; i < n; i++) { + let pre = 0; + if (i & 1) { + for (let v = 0; v <= r; v++) { + let pre2 = pre + dp[v]; + dp[v] = pre; + pre = pre2 % mod; + } + } else { + for (let v = r; v >= 0; v--) { + let pre2 = pre + dp[v]; + dp[v] = pre; + pre = pre2 % mod; + } + } + } + return (dp.reduce((a, b) => a + b, 0) * 2) % mod; +}; From 3e0a0e73d41c604a184b8a6882a669a3ba945c26 Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 24 Oct 2025 15:14:46 +0000 Subject: [PATCH 2025/2039] Create 2513-minimize-the-maximum-of-two-arrays.js --- 2513-minimize-the-maximum-of-two-arrays.js | 55 ++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 2513-minimize-the-maximum-of-two-arrays.js diff --git a/2513-minimize-the-maximum-of-two-arrays.js b/2513-minimize-the-maximum-of-two-arrays.js new file mode 100644 index 00000000..31764255 --- /dev/null +++ b/2513-minimize-the-maximum-of-two-arrays.js @@ -0,0 +1,55 @@ +/** + * @param {number} divisor1 + * @param {number} divisor2 + * @param {number} uniqueCnt1 + * @param {number} uniqueCnt2 + * @return {number} + */ +var minimizeSet = function(divisor1, divisor2, uniqueCnt1, uniqueCnt2) { + let d1 = divisor1, d2 = divisor2, u1 = uniqueCnt1, u2 = uniqueCnt2 + let lo = 1n, hi = 10n ** 17n; + while (hi > lo + 1n) { + let mid = (lo + hi) >> 1n; + if (check(Number(d1), Number(d2), Number(u1), Number(u2), Number(mid))) hi = mid; + else lo = mid; + } + return Number(hi); +}; + +function gcd(a, b) { + while (b !== 0) { + [a, b] = [b, a % b]; + } + return a; +} + +function lcm(a, b) { + return (a / gcd(a, b)) * b; +} + +function check(d1, d2, u1, u2, x) { + const A = Math.floor(x / d1); // A = # of numbers divisible by d1 + const A_ = x - A; // A' = # of numbers not divisible by d1 + const B = Math.floor(x / d2); // B = # of numbers divisible by d2 + const B_ = x - B; // B' = # of numbers not divisible by d2 + const AIB = Math.floor(x / lcm(d1, d2)); // A Intersection B = # of numbers divisible by BOTH d1 AND d2 + const AuB = A + B - AIB; // A Union B = # of numbers divisible by EITHER d1 OR d2 + const A_I_B_ = x - AuB; // (A' Union B') = (A Intersection B)' = # of numbers not divisible by NEITHER OF THEM + + // needA = # of numbers needed to have at least u1 numbers of set1, these numbers + // don't include (A' Union B') + const needA = (A_ - A_I_B_ >= u1) ? 0 : u1 - (A_ - A_I_B_); + + // needB = # of numbers needed to have at least u2 numbers of set2, these numbers + // don't include (A' Union B') + const needB = (B_ - A_I_B_ >= u2) ? 0 : u2 - (B_ - A_I_B_); + + /* + Why not consider (A' Union B') ? + -> I will assign those numbers to whichever set needs it. + */ + + // Available (A' Union B') value should be more than the needed # of values to make sets + return (A_I_B_ >= needA + needB); +} + From a7f3241e246d345e0aca2ff97478de6713748dd0 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Oct 2025 09:05:50 +0000 Subject: [PATCH 2026/2039] Update 2513-minimize-the-maximum-of-two-arrays.js --- 2513-minimize-the-maximum-of-two-arrays.js | 51 ++++++++-------------- 1 file changed, 19 insertions(+), 32 deletions(-) diff --git a/2513-minimize-the-maximum-of-two-arrays.js b/2513-minimize-the-maximum-of-two-arrays.js index 31764255..b894fd36 100644 --- a/2513-minimize-the-maximum-of-two-arrays.js +++ b/2513-minimize-the-maximum-of-two-arrays.js @@ -6,14 +6,25 @@ * @return {number} */ var minimizeSet = function(divisor1, divisor2, uniqueCnt1, uniqueCnt2) { - let d1 = divisor1, d2 = divisor2, u1 = uniqueCnt1, u2 = uniqueCnt2 - let lo = 1n, hi = 10n ** 17n; - while (hi > lo + 1n) { - let mid = (lo + hi) >> 1n; - if (check(Number(d1), Number(d2), Number(u1), Number(u2), Number(mid))) hi = mid; - else lo = mid; - } - return Number(hi); + let l = 1, r = 1e18 + const {floor: flr} = Math + while(l < r) { + const mid = l + flr((r - l) / 2) + if(notEnough(mid)) l = mid + 1 + else r = mid + } + return l + + + function notEnough(n) { + const a = n - flr(n / divisor1) + const b = n - flr(n / divisor2) + const c = n - (flr(n / divisor1) + flr(n / divisor2) - flr( n / lcm(divisor1, divisor2))) + if(a < uniqueCnt1) return true + if(b < uniqueCnt2) return true + if(a + b - c < uniqueCnt1 + uniqueCnt2) return true + return false + } }; function gcd(a, b) { @@ -27,29 +38,5 @@ function lcm(a, b) { return (a / gcd(a, b)) * b; } -function check(d1, d2, u1, u2, x) { - const A = Math.floor(x / d1); // A = # of numbers divisible by d1 - const A_ = x - A; // A' = # of numbers not divisible by d1 - const B = Math.floor(x / d2); // B = # of numbers divisible by d2 - const B_ = x - B; // B' = # of numbers not divisible by d2 - const AIB = Math.floor(x / lcm(d1, d2)); // A Intersection B = # of numbers divisible by BOTH d1 AND d2 - const AuB = A + B - AIB; // A Union B = # of numbers divisible by EITHER d1 OR d2 - const A_I_B_ = x - AuB; // (A' Union B') = (A Intersection B)' = # of numbers not divisible by NEITHER OF THEM - - // needA = # of numbers needed to have at least u1 numbers of set1, these numbers - // don't include (A' Union B') - const needA = (A_ - A_I_B_ >= u1) ? 0 : u1 - (A_ - A_I_B_); - - // needB = # of numbers needed to have at least u2 numbers of set2, these numbers - // don't include (A' Union B') - const needB = (B_ - A_I_B_ >= u2) ? 0 : u2 - (B_ - A_I_B_); - /* - Why not consider (A' Union B') ? - -> I will assign those numbers to whichever set needs it. - */ - - // Available (A' Union B') value should be more than the needed # of values to make sets - return (A_I_B_ >= needA + needB); -} From c9e52c60e662cf31ac4fe2527e4505cb0956d7f8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 25 Oct 2025 16:24:16 +0000 Subject: [PATCH 2027/2039] Create 2528-maximize-the-minimum-powered-city.js --- 2528-maximize-the-minimum-powered-city.js | 38 +++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 2528-maximize-the-minimum-powered-city.js diff --git a/2528-maximize-the-minimum-powered-city.js b/2528-maximize-the-minimum-powered-city.js new file mode 100644 index 00000000..59d10ffd --- /dev/null +++ b/2528-maximize-the-minimum-powered-city.js @@ -0,0 +1,38 @@ +/** + * @param {number[]} stations + * @param {number} r + * @param {number} k + * @return {number} + */ +var maxPower = function(stations, r, k) { + let lo = 0, hi = Number.MAX_SAFE_INTEGER + const { floor: flr, min } = Math + const n = stations.length + while(lo < hi) { + const mid = hi - flr((hi - lo) / 2) + if(isOk(stations.slice(0),k, mid)) lo = mid + else hi = mid - 1 + } + + return lo + + function isOk(sc,k, m) { + let sum = 0 + for(let i = 0; i < min(n, r); i++) { + sum += sc[i] + } + for(let i = 0; i < n; i++) { + if(i + r < n) sum += sc[i + r] + if(i - r - 1 >= 0) sum -= sc[i - r - 1] + if(sum >= m) continue + const diff = m - sum + if(k < diff) return false + sc[min(n - 1, i + r)] += diff + sum = m + k -= diff + } + + return true + } + +}; From 60c3db5c6a8baccae42525b113d0f700d6d7214f Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 27 Oct 2025 13:27:36 +0000 Subject: [PATCH 2028/2039] Update 2563-count-the-number-of-fair-pairs.js --- 2563-count-the-number-of-fair-pairs.js | 29 ++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/2563-count-the-number-of-fair-pairs.js b/2563-count-the-number-of-fair-pairs.js index 3bdf0771..3db06363 100644 --- a/2563-count-the-number-of-fair-pairs.js +++ b/2563-count-the-number-of-fair-pairs.js @@ -38,3 +38,32 @@ function low(arr, target) { } return count; } + +// another + +/** + * @param {number[]} nums + * @param {number} lower + * @param {number} upper + * @return {number} + */ +const countFairPairs = function(nums, lower, upper) { + nums.sort((a, b) => a - b) + return lowerBound(nums, upper + 1) - lowerBound(nums, lower) +}; + +function lowerBound(nums, value) { + let l = 0, r = nums.length - 1 + let res = 0 + while(l < r) { + const sum = nums[l] + nums[r] + if(sum < value) { + res += r - l + l++ + } else { + r-- + } + } + + return res +} From 28c4c349ab082b69f781f14bc08a8aea347c2ddc Mon Sep 17 00:00:00 2001 From: Nothing Date: Fri, 31 Oct 2025 06:30:08 +0000 Subject: [PATCH 2029/2039] Update 2861-maximum-number-of-alloys.js --- 2861-maximum-number-of-alloys.js | 23 +++++++++-------------- 1 file changed, 9 insertions(+), 14 deletions(-) diff --git a/2861-maximum-number-of-alloys.js b/2861-maximum-number-of-alloys.js index d5c0891b..41c009ed 100644 --- a/2861-maximum-number-of-alloys.js +++ b/2861-maximum-number-of-alloys.js @@ -7,40 +7,35 @@ * @param {number[]} cost * @return {number} */ -var maxNumberOfAlloys = function (n, k, budget, composition, stock, cost) { - let low = 1, +const maxNumberOfAlloys = function(n, k, budget, composition, stock, cost) { + let low = 0, high = 1e9 - let ans = 0 // intialise the ans = 0; + let res = 0 - while (low <= high) { - let mid = low + Math.floor((high - low) / 2) + while (low < high) { + let mid = high - Math.floor((high - low) / 2) if (isPossible(n, k, budget, composition, stock, cost, mid)) { - low = mid + 1 - ans = mid // we can form the "mid" quantity of alloys from any of the compositions in the given "budget"; + low = mid } else { high = mid - 1 } } - return ans -} + return low +}; + function isPossible(n, k, budget, composition, stock, costs, fixed_alloy) { for (let i = 0; i < k; i++) { let calBudget = 0 for (let j = 0; j < n; j++) { - // this much quantity of jth metal is required to form the "fixed_alloy"; let required = 1 * composition[i][j] * fixed_alloy - // subtracting the stocked portion of the jth metal; required -= stock[j] if (required > 0) { - // adding the cost for required quantity of jth metal to form the "fixed_alloy"; calBudget += 1 * required * costs[j] } } - // "fixed alloy can be formed with the ith machine"; if (calBudget <= 1 * budget) return true } - // can't be formed with any of the machine; return false } From 5db012ad136b123c953bdf054f43d030b693d426 Mon Sep 17 00:00:00 2001 From: Nothing Date: Sat, 1 Nov 2025 11:52:55 +0000 Subject: [PATCH 2030/2039] Create 3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.js --- ...f-the-prices-is-less-than-or-equal-to-k.js | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.js diff --git a/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.js b/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.js new file mode 100644 index 00000000..11d26787 --- /dev/null +++ b/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.js @@ -0,0 +1,35 @@ +/** + * @param {number} k + * @param {number} x + * @return {number} + */ +var findMaximumNumber = function(k, x) { + let l = 0n; + let r = 10n ** 20n; + + while (l + 1n < r) { + let m = (l + r) >> 1n; + + if (F(Number(m + 1n)) <= k) l = m; + else r = m; + } + + return Number(l); + + function F(m) { + let count = 0; + + for (let i = 1; i < 80; i++) { + let bit = (i * x) - 1; + let S = 1n << BigInt(bit); + let B = BigInt(m) / S; + + count += Number(S) * Math.floor(Number(B) / 2); + if ((Number(B) & 1) === 1) { + count += Number(BigInt(m) % S); + } + } + + return count; + } +}; From befe95a06aa74efe8bbafa06f7f56599f2b26211 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 3 Nov 2025 11:58:22 +0000 Subject: [PATCH 2031/2039] Create 3399-smallest-substring-with-identical-characters-ii.js --- ...-substring-with-identical-characters-ii.js | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 3399-smallest-substring-with-identical-characters-ii.js diff --git a/3399-smallest-substring-with-identical-characters-ii.js b/3399-smallest-substring-with-identical-characters-ii.js new file mode 100644 index 00000000..ae74d5c5 --- /dev/null +++ b/3399-smallest-substring-with-identical-characters-ii.js @@ -0,0 +1,48 @@ +/** + * @param {string} s + * @param {number} numOps + * @return {number} + */ +var minLength = function (s, numOps) { + const arr = Array.from(s, Number) + + const L = groupLengths(arr) + + let l = 1, + r = 100000 + while (l < r) { + const m = Math.floor((l + r) / 2) + const need = check(arr, m) + if (need <= numOps) { + r = m + } else { + l = m + 1 + } + } + return l + + function check(A, k) { + if (k === 1) { + let res = 0 + for (let i = 0; i < A.length; i++) { + if (A[i] === i % 2) res++ + } + return Math.min(res, A.length - res) + } + return L.reduce((acc, l) => acc + Math.floor(l / (k + 1)), 0) + } + + function groupLengths(arr) { + const lengths = [] + let count = 1 + for (let i = 1; i <= arr.length; i++) { + if (i < arr.length && arr[i] === arr[i - 1]) { + count++ + } else { + lengths.push(count) + count = 1 + } + } + return lengths + } +} From 770b0249397b9bfc94d555c84ff592cb0775b336 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Nov 2025 09:44:52 +0000 Subject: [PATCH 2032/2039] Create 3449-maximize-the-minimum-game-score.js --- 3449-maximize-the-minimum-game-score.js | 46 +++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 3449-maximize-the-minimum-game-score.js diff --git a/3449-maximize-the-minimum-game-score.js b/3449-maximize-the-minimum-game-score.js new file mode 100644 index 00000000..1477193b --- /dev/null +++ b/3449-maximize-the-minimum-game-score.js @@ -0,0 +1,46 @@ +/** + * @param {number[]} points + * @param {number} m + * @return {number} + */ +var maxScore = function (points, m) { + const n = points.length + if (m < n) return 0 + + const can = (val) => { + let total = 0, + transfer = 0, + skipAdd = 0 + for (let i = 0; i < n && total <= m; i++) { + const point = points[i] + const necessary = Math.floor((val + point - 1) / point) + if (transfer >= necessary) { + transfer = 0 + skipAdd++ + } else { + const p = transfer * point + const ops = Math.floor((val - p + point - 1) / point) + total += 2 * ops - 1 + total += skipAdd + + transfer = Math.max(ops - 1, 0) + skipAdd = 0 + } + } + return total <= m + } + + let l = 1n, + r = 10n ** 15n, + res = 0n + while (l <= r) { + const mid = l + (r - l) / 2n + if (can(Number(mid))) { + res = mid + l = mid + 1n + } else { + r = mid - 1n + } + } + return Number(res) +} From 1c56b6cf5dd9b2775d18dee5caf408301f1fe108 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 4 Nov 2025 09:52:46 +0000 Subject: [PATCH 2033/2039] Update 3449-maximize-the-minimum-game-score.js --- 3449-maximize-the-minimum-game-score.js | 12 +++++------- 1 file changed, 5 insertions(+), 7 deletions(-) diff --git a/3449-maximize-the-minimum-game-score.js b/3449-maximize-the-minimum-game-score.js index 1477193b..abd1f14d 100644 --- a/3449-maximize-the-minimum-game-score.js +++ b/3449-maximize-the-minimum-game-score.js @@ -31,16 +31,14 @@ var maxScore = function (points, m) { } let l = 1n, - r = 10n ** 15n, - res = 0n - while (l <= r) { - const mid = l + (r - l) / 2n + r = 10n ** 15n + while (l < r) { + const mid = r - (r - l) / 2n if (can(Number(mid))) { - res = mid - l = mid + 1n + l = mid } else { r = mid - 1n } } - return Number(res) + return Number(l) } From 6a0882fd8304d3c57d08907c63ec2dffdd23338d Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 5 Nov 2025 12:11:46 +0000 Subject: [PATCH 2034/2039] Update 3464-maximize-the-distance-between-points-on-a-square.js --- ...the-distance-between-points-on-a-square.js | 85 +++++++++++++++++++ 1 file changed, 85 insertions(+) diff --git a/3464-maximize-the-distance-between-points-on-a-square.js b/3464-maximize-the-distance-between-points-on-a-square.js index 47fcde20..57f343dd 100644 --- a/3464-maximize-the-distance-between-points-on-a-square.js +++ b/3464-maximize-the-distance-between-points-on-a-square.js @@ -1,3 +1,88 @@ +/** + * @param {number} side + * @param {number[][]} points + * @param {number} k + * @return {number} + */ +const maxDistance = function (side, points, k) { + const n = points.length + const arr = [] + + const next = new Array(15000) + + for (const p of points) { + if (p[0] === 0) { + arr.push(p[1]) + } else if (p[1] === side) { + arr.push(side + p[0]) + } else if (p[0] === side) { + arr.push(2 * side + side - p[1]) + } else if (p[1] === 0) { + arr.push(3 * side + side - p[0]) + } + } + + arr.sort((a, b) => a - b) + + let low = 0, + high = side + while (low < high) { + const mid = high - Math.floor((high - low) / 2) + if (isOK(mid, k)) { + low = mid + } else { + high = mid - 1 + } + } + return low + + function isOK(dist, k) { + let j = 0 + for (let i = 0; i < n; i++) { + while (pos(j) - arr[i] < dist) { + j++ + } + next[i] = j + } + + for (let i = 0; i < n; i++) { + let flag = true + let cur = i + for (let t = 0; t < k - 1; t++) { + if (cur < n) { + cur = next[cur] + } else { + cur = next[cur % n] + n + } + if (cur >= i + n) { + flag = false + break + } + } + if (pos(i) - pos(cur % n) < dist) { + flag = false + } + if (flag) { + return true + } + } + return false + } + + function pos(j) { + if (j < n) { + return arr[j] + } else { + return arr[j % n] + side * 4 + } + } + +} + + +// another + + /** * @param {number} side * @param {number[][]} points From fb67ea7fc40af17176610795d2f4b393559dd061 Mon Sep 17 00:00:00 2001 From: Nothing Date: Mon, 10 Nov 2025 06:19:02 +0000 Subject: [PATCH 2035/2039] Create 3696-minimum-time-to-activate-string.js --- 3696-minimum-time-to-activate-string.js | 43 +++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 3696-minimum-time-to-activate-string.js diff --git a/3696-minimum-time-to-activate-string.js b/3696-minimum-time-to-activate-string.js new file mode 100644 index 00000000..5430231e --- /dev/null +++ b/3696-minimum-time-to-activate-string.js @@ -0,0 +1,43 @@ +/** + * @param {string} s + * @param {number[]} order + * @param {number} k + * @return {number} + */ +var minTime = function(s, order, k) { + const len = order.length + let l = 0, r = len + const {floor: flr} = Math + while(l < r) { + const mid = flr((l + r) / 2) + if(isOK(mid)) r = mid + else l = mid + 1 + } + + return l >= len ? -1 : l + + function isOK(t) { + const n = s.length + + const isStar = Array(n).fill(false) + let inValid = 0, segLen = 0 + + for(let i = 0; i <= t; i++) isStar[order[i]] = true + + for(let i = 0; i < n; i++) { + if(isStar[i]) { + inValid += segLen * (segLen + 1) / 2 + segLen = 0 + } else { + segLen++ + } + } + + if(segLen) inValid += segLen * (segLen + 1) / 2 + + const all = n * (n + 1) / 2 + + const valid = all - inValid + return valid >= k + } +}; From 6c5c6b719c7a807501a793817a49b35e35470eb8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Nov 2025 11:48:27 +0000 Subject: [PATCH 2036/2039] Create 3677-count-binary-palindromic-numbers.js --- 3677-count-binary-palindromic-numbers.js | 62 ++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 3677-count-binary-palindromic-numbers.js diff --git a/3677-count-binary-palindromic-numbers.js b/3677-count-binary-palindromic-numbers.js new file mode 100644 index 00000000..5cb7037c --- /dev/null +++ b/3677-count-binary-palindromic-numbers.js @@ -0,0 +1,62 @@ +/** + * @param {number} n + * @return {number} + */ +var countBinaryPalindromes = function (n) { + let dp = [] + let built = false + n = BigInt(n) + + if (!built) { + dp = new Array(56).fill(0) + dp[1] = 1 + dp[2] = 1 + for (let i = 3; i <= 55; i++) dp[i] = 2 * dp[i - 2] + built = true + } + + let maxbit = bit(n) + if (maxbit === -1) return 1 + let len = maxbit + 1 + + let count = 1 + for (let i = 1; i < len; i++) count += dp[i] + + let half = Math.floor((len + 1) / 2) + let start = 1n << BigInt(half - 1) + let end = (1n << BigInt(half)) - 1n + + let lo = start, + hi = end, + best = start - 1n + while (lo <= hi) { + let mid = (lo + hi) >> 1n + let pal = makePal(mid, len) + if (pal <= n) { + best = mid + lo = mid + 1n + } else { + hi = mid - 1n + } + } + + if (best >= start) count += Number(best - start + 1n) + return count + + function bit(num) { + for (let i = 63; i >= 0; i--) { + if ((num & (1n << BigInt(i))) !== 0n) return i + } + return -1 + } + + function makePal(p, len) { + let pal = p + let q = len % 2 === 0 ? p : p >> 1n + while (q > 0n) { + pal = (pal << 1n) | (q & 1n) + q >>= 1n + } + return pal + } +} From c834c3aa82eff7bc575af8a4139ba0e5d1165397 Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Nov 2025 12:52:41 +0000 Subject: [PATCH 2037/2039] Update 3677-count-binary-palindromic-numbers.js --- 3677-count-binary-palindromic-numbers.js | 62 ++++++++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/3677-count-binary-palindromic-numbers.js b/3677-count-binary-palindromic-numbers.js index 5cb7037c..f6b813e1 100644 --- a/3677-count-binary-palindromic-numbers.js +++ b/3677-count-binary-palindromic-numbers.js @@ -1,3 +1,65 @@ +/** + * @param {number} n + * @return {number} + */ +var countBinaryPalindromes = function (n) { + n = BigInt(n) + if (n === 0n) return 1 + const maxLen = Math.floor(Math.log2(Number(n))) + 1 + + let ret = 1n + for (let L = 1; L < maxLen; L++) { + const h = Math.floor((L + 1) / 2) + const mn = 1n << BigInt(h - 1) + const mx = (1n << BigInt(h)) - 1n + ret += mx - mn + 1n + } + + { + const L = maxLen + const h = Math.floor((L + 1) / 2) + const mn = 1n << BigInt(h - 1) + const mx = (1n << BigInt(h)) - 1n + let lo = mn, + hi = mx + while (lo < hi) { + const mid = hi - (hi - lo) / 2n + const pal = build(mid, L) + if (pal <= n) { + lo = mid + } else { + hi = mid - 1n + } + } + const pal = build(hi, L) + if (pal <= n) ret += hi - mn + 1n + } + + return Number(ret) +} +function reverseBits(x) { + let r = 0n + while (x > 0n) { + r = r * 2n + (x & 1n) + x >>= 1n + } + return r +} + +function build(half, L) { + const h = Math.floor((L + 1) / 2) + const k = L - h + if (L % 2 === 0) { + return (half << BigInt(k)) | reverseBits(half) + } else { + return (half << BigInt(k)) | reverseBits(half >> 1n) + } +} + + +// another + + /** * @param {number} n * @return {number} From e676a1cc71f4f8c513cf1eed3ef73c3ee96c866a Mon Sep 17 00:00:00 2001 From: Nothing Date: Tue, 11 Nov 2025 13:30:55 +0000 Subject: [PATCH 2038/2039] Update 3677-count-binary-palindromic-numbers.js --- 3677-count-binary-palindromic-numbers.js | 35 ++++++++++++------------ 1 file changed, 18 insertions(+), 17 deletions(-) diff --git a/3677-count-binary-palindromic-numbers.js b/3677-count-binary-palindromic-numbers.js index f6b813e1..19d1903c 100644 --- a/3677-count-binary-palindromic-numbers.js +++ b/3677-count-binary-palindromic-numbers.js @@ -15,25 +15,25 @@ var countBinaryPalindromes = function (n) { ret += mx - mn + 1n } - { - const L = maxLen - const h = Math.floor((L + 1) / 2) - const mn = 1n << BigInt(h - 1) - const mx = (1n << BigInt(h)) - 1n - let lo = mn, - hi = mx - while (lo < hi) { - const mid = hi - (hi - lo) / 2n - const pal = build(mid, L) - if (pal <= n) { - lo = mid - } else { - hi = mid - 1n - } + + const L = maxLen + const h = Math.floor((L + 1) / 2) + const mn = 1n << BigInt(h - 1) + const mx = (1n << BigInt(h)) - 1n + let lo = mn, + hi = mx + while (lo < hi) { + const mid = hi - (hi - lo) / 2n + const pal = build(mid, L) + if (pal <= n) { + lo = mid + } else { + hi = mid - 1n } - const pal = build(hi, L) - if (pal <= n) ret += hi - mn + 1n } + const pal = build(hi, L) + if (pal <= n) ret += hi - mn + 1n + return Number(ret) } @@ -57,6 +57,7 @@ function build(half, L) { } + // another From 78376f9030fd42b36285d5625c56b2788eb16fd8 Mon Sep 17 00:00:00 2001 From: Nothing Date: Wed, 12 Nov 2025 15:34:06 +0000 Subject: [PATCH 2039/2039] Create 3691-maximum-total-subarray-value-ii.js --- 3691-maximum-total-subarray-value-ii.js | 80 +++++++++++++++++++++++++ 1 file changed, 80 insertions(+) create mode 100644 3691-maximum-total-subarray-value-ii.js diff --git a/3691-maximum-total-subarray-value-ii.js b/3691-maximum-total-subarray-value-ii.js new file mode 100644 index 00000000..89c56f1d --- /dev/null +++ b/3691-maximum-total-subarray-value-ii.js @@ -0,0 +1,80 @@ +/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +const maxTotalValue = function (nums, k) { + const n = nums.length + const K = Math.floor(Math.log2(n)) + 1 + + const mn = Array.from({ length: n }, () => Array(K + 1).fill(Infinity)) + const mx = Array.from({ length: n }, () => Array(K + 1).fill(-Infinity)) + + for (let i = 0; i < n; i++) { + mn[i][0] = nums[i] + mx[i][0] = nums[i] + } + + for (let kk = 1; kk <= K; kk++) { + for (let i = 0; i + (1 << kk) - 1 < n; i++) { + mn[i][kk] = Math.min(mn[i][kk - 1], mn[i + (1 << (kk - 1))][kk - 1]) + mx[i][kk] = Math.max(mx[i][kk - 1], mx[i + (1 << (kk - 1))][kk - 1]) + } + } + + let lo = 0, + hi = 2e9 + while (lo < hi) { + const mid = hi - Math.floor((hi - lo) / 2) + if (count_ge(mid) >= k) { + lo = mid + } else { + hi = mid - 1 + } + } + const th = lo + + let ret_g = 0n + let count_g = 0n + for (let i = 0; i < n; i++) { + let l = i, + r = n - 1 + while (l < r) { + const mid = l + Math.floor((r - l) / 2) + if (GetDiff(i, mid) > th) { + r = mid + } else { + l = mid + 1 + } + } + if (GetDiff(i, r) > th) { + count_g += BigInt(n - r) + for (let j = r; j < n; j++) { + ret_g += BigInt(GetDiff(i, j)) + } + } + } + + const ret = ret_g + BigInt(th) * (BigInt(k) - count_g) + + return Number(ret) + + function GetDiff(L, R) { + const length = R - L + 1 + const k = Math.floor(Math.log2(length)) + return ( + Math.max(mx[L][k], mx[R - (1 << k) + 1][k]) - + Math.min(mn[L][k], mn[R - (1 << k) + 1][k]) + ) + } + + function count_ge(th) { + let count = 0 + let j = 0 + for (let i = 0; i < n; i++) { + while (j < n && GetDiff(i, j) < th) j++ + count += n - j + } + return count + } +}