我正在尝试将这里看到的算法https://ideone.com/26G1fB(用python编写)移植到javascript。你知道吗
def divide(arr, depth, m):
if len(complements) <= depth:
complements.append(2 ** (depth + 2) + 1)
complement = complements[depth]
for i in range(2):
if complement - arr[i] <= m:
arr[i] = [arr[i], complement - arr[i]]
divide(arr[i], depth + 1, m)
m = int(raw_input())
arr = [1, 2]
complements = []
divide(arr, 0, m)
print arr
我是带着这个来的:
var bracketize = function(arr, depth, m) {
if (complements.length <= depth) {
complements.push(2 ** (depth +2) + 1)
}
var complement = complements[depth]
for ( i = 0; i < 2; i++ ) {
if (complement - arr[i] <= m) {
arr[i] = [arr[i], complement - arr[i]]
bracketize(arr[i], depth + 1 , m)
}
}
}
var m = 16
var arr = [1, 2]
var complements = []
bracketize(arr, 0, m)
console.log(JSON.stringify(arr))
// expected result [[[[1, 16], [8, 9]], [[4, 13], [5, 12]]], [[[2, 15], [7, 10]], [[3, 14], [6, 11]]]]
// actual result : [[[[1,16],8],4],2]
这里是一个jsfiddlehttps://jsfiddle.net/9umgwhoa/
这似乎是js对python进行递归调用的方式,但我不知道是什么。你知道吗
任何关于2个代码之间的差异所在的指针都将受到赞赏
基本上你需要一个局部变量
i
。在不考虑局部作用域的情况下,创建一个全局变量和任何循环递增变量。你知道吗var bracketize = function (arr, depth, m) { if (complements.length <= depth) { complements.push(2 ** (depth + 2) + 1) } var complement = complements[depth], i; for (i = 0; i < 2; i++) { if (complement - arr[i] <= m) { arr[i] = [arr[i], complement - arr[i]]; bracketize(arr[i], depth + 1, m); } } }; var m = 16, arr = [1, 2], complements = []; bracketize(arr, 0, m); console.log(arr);
; ^{pr2}$ ;相关问题 更多 >
编程相关推荐