![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
我就吃辣的
这个作者很懒,什么都没留下…
展开
-
5.重构二叉树
5.重构二叉树 1.递归 function TreeNode(value) { this.val = value; this.left = null; this.right = null; } var preOrder = [] var inOrder = [] var buildTree = function (preorder, inorder) {原创 2021-01-19 12:36:02 · 90 阅读 · 0 评论 -
4.从头到尾打印
4.从头到尾打印 1.递归法 var reversePrint = function (head) { let result = []; fn(head, result); return result; } function fn(head, result) { if (head) { fn(head.next, result);原创 2021-01-19 12:35:21 · 69 阅读 · 0 评论 -
3.替换空格
3.替换空格 1.replace全局替换 var replaceSpace = function (s) { return s.replace(/ /g, "%20"); }; 2.分隔成数组,字符串拼接 var replaceSpace = function (s) { let temp = s.split(" "); let result = ''; for (let i = 0; i &l原创 2021-01-19 12:31:15 · 72 阅读 · 0 评论 -
2.二维数组中查找
2.二维数组中查找 找规律 /** * @param {number[][]} matrix * @param {number} target * @return {boolean} * 找规律,左下角 * 当martix[i][j]>target,上走一步 * 当martix[i][j]<target,右走一步 */ let matrix = [[原创 2021-01-17 20:49:12 · 68 阅读 · 0 评论 -
1.重复数字
1.重复数字 方法一:用map,空间换时间. let nums = [2, 3, 1, 0, 2, 5, 3]; var findRepeatNumber = function (nums) { let map = new Map(); for (let i = 0; i < nums.length; i++) { if (!map.has(nums[i])) { m原创 2021-01-17 20:45:43 · 131 阅读 · 0 评论