记录一下reverse回文字符串的对比与二叉树的对比

Posted 2022-10-14 狼丶宇先森

回文字符串的对比

function diffstring (input = '') 
    if (!input) return false;
    return input === ['123aba321'][0].split('').reverse().join('');


console.log(diffstring('123aba321'))

//问输出值是啥？

二叉树的对比

/*
 * @Author: zhouliujun
 * @Date: 2022-08-10 16:26:40
 * @LastEditTime: 2022-08-10 17:17:27
 * @LastEditors: zhouliujun
 * @Description: file content
 * @FilePath: /H5.Web/Users/simple/Desktop/test.js
 * 可以输入预定的版权声明、个性签名、空行等
 */
function diffNode (node1, node2) 
    //判断根节点是否一致,都为undefined是相等的
    if (node1 === node2) return true;
    // 其中一个值为空，另一个不为空
    if ((node1 === undefined && node2 !== undefined) || (node2 === undefined && node1 !== undefined)) return false;
    // 相同位置的值不相等
    if (node1.val !== node2.val) return false;
    // 左右子树必须都相等才算相等
    return diffNode(node1.left, node2.left) && diffNode(node1.right, node2.right);



let n1 = 
    val: 1,
    left: 
        val: 2,
        left: 
            val: 4
        ,
        right: 
            val: 5
        
    ,
    right: 
        val: 3,
        left: 
            val: 6
        ,
        right: 
            val: 7
        
    


let n2 = 
    val: 1,
    left: 
        val: 2,
        left: 
            val: 4
        ,
        right: 
            val: 5
        
    ,
    right: 
        val: 3,
        left: 
            val: 6
        ,
        right: 
            val: 7
        
    


console.log(diffNode(n1, n2));