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

回文字符串的对比

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

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

//问输出值是啥？
1
2
3
4
5
6
7
8
9

二叉树的对比

/*
 * @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));
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
60
61
62
63
64
65
66