-
Notifications
You must be signed in to change notification settings - Fork 0
/
recursion.js
59 lines (52 loc) · 1.47 KB
/
recursion.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
//783. Minimum Distance Between BST Nodes
//https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
var minDiffInBST = function (root) {
function recursion(node) {
if (node === null) return;
recursion(node.left)
if (last !== null) {
ans = Math.min(ans, Math.abs(node.val - last));
}
last = node.val;
recursion(node.right)
}
let last = null, ans = Infinity;
recursion(root)
return ans
};
// 530, same solution do it again for practice
// left -> mid -> right, record last val then compare
// do we have faster solution?
// how about push it into an array
var getMinimumDifference = function (root) {
function recursion(node) {
if (node === null) return;
recursion(node.left)
if (last !== null) {
res = Math.min(res, Math.abs(node.val - last))
}
last = node.val
recursion(node.right)
}
let last = null, res = Infinity
recursion(root)
return res
};
// 16.11. Diving Board LCCI
/**
* @param {number} shorter
* @param {number} longer
* @param {number} k
* @return {number[]}
*/
// if k = 0 return
// from all shorties to all longies
var divingBoard = function (shorter, longer, k) {
if (k === 0) return []
if (shorter === longer) return [shorter * k]
var arr = []
// the most important part :)
for (let s = k, l = 0; s >= 0, l <= k; s-- , l++)
arr.push(s*shorter + l*longer)
return arr
};