取余
6 % 2
取整
抛弃整数
parseInt(7/3)
向上取整(天花板嘛,代表上)
Math.ceil(7/3)
向下取整(地板嘛,代表下)
Math.floor(7/3)
四舍五入
Math.round(7/3)
6 % 2
parseInt(7/3)
Math.ceil(7/3)
Math.floor(7/3)
Math.round(7/3)
const deserialize = (data) => {
let res = ''
for (let v of data) {
res = res + v + ',';
}
for (let i = 0; i <= data.length; i++) {
res = res + 'null' + ','
}
data = res;
function TreeNode(val) {
this.val = val;
this.left = null;
this.right = null;
}
if (data.length === 0) return null;
const list = data.split(','); // split成数组
list.splice(list.length - 1);
let list_Pointer = 1;
let queue_pointer = 0;
const root = new TreeNode(list[0])
let queue = [root];
while (list_Pointer !== list.length) {
if (queue[0] === null) {
queue.shift();
queue_pointer++;
continue;
}
if (queue_pointer === list_Pointer) {
list_Pointer = list_Pointer + 2;
}
if (list[list_Pointer] === 'null') {
queue[0].left = null;
} else {
queue[0].left = new TreeNode(list[list_Pointer]);
}
if (list[list_Pointer + 1] === 'null') {
queue[0].right = null;
} else {
queue[0].right = new TreeNode(list[list_Pointer + 1]);
}
queue.push(queue[0].left);
queue.push(queue[0].right);
queue.shift();
queue_pointer++
list_Pointer = list_Pointer + 2;
}
return root
};
const test2 = deserialize([1,2,3,4]);
这里的二叉树的每一个节点的val值不是Number类型的,而是字符串类型的
const mid = left + right >>> 1;
const mid = Math.floor((left + right) / 2);
function titleCase(str) {
const result = str.split(' ');
for (let i in result) {
result[i] = result[i][0].toUpperCase() + result[i].slice(1,result[i].length).toLowerCase();
}
result
const test = result.reduce((pre,value) => {
return pre + ' ' + value;
})
return test;
}
console.log(titleCase("sHoRt AnD sToUt"));