weixin_42100456的博客

题目https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/思路中序遍历实现中序遍历两种方法：1. 递归； 2：迭代code迭代// 迭代实现中序遍历var kthSmallest = function (root, k) { let stack = []; let res; while (root || stack.length) { if (root) {

题目https://leetcode-cn.com/problems/number-of-islands/思路遍历二维数组，若遇到一个陆地，res+1，但是为了不重复计算，将这个陆地周围跟他连通的并且也是陆地的值设置为’0’，也就是设置为水，这样就不会重复计算，设置为水的这个过程就是一个dfs过程，对陆地的四个方向进行dfs。code/** * @param {character[][]} grid * @return {number} */var numIslands = functio

题目https://leetcode-cn.com/problems/reverse-linked-list/思路递归：大问题拆成两个小问题，小问题和大问题有同样的解题步骤，存在最小子问题，本题中，在最小子问题就是只有一个节点的时候，也就是假如1->null就不必翻转，return 1出来即可，然后假设之前的连接为2->1->null，那么首先2->1->2，然后断开2->1，也就是2->1转化为2->null，所以就是成为1->2->nu

题目https://leetcode-cn.com/problems/binary-tree-level-order-traversal/思路队列，进入循环获取当前队列的节点个数，也就是上一层的节点个数，然后for循环对这些节点进行操作即可code/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val

题目https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/思路快慢指针code/** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } *//** * @param {ListNode} head * @

题目https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/思路dfscode/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left)

题目https://leetcode-cn.com/problems/minimum-size-subarray-sum/思路滑动窗口，首先向右扩大窗口，若此时窗口内的值大于target，那么可以收缩窗口，即是从左边压缩，找到最小值并记录code/** * @param {number} target * @param {number[]} nums * @return {number} */var minSubArrayLen = function(target, nums) {

题目https://leetcode-cn.com/problems/maximum-subarray/思路dp贪心code/** * @param {number[]} nums * @return {number} */var maxSubArray = function (nums) { // return greedy(nums); return dp_f(nums);};const greedy = function (nums) { le

题目https://leetcode-cn.com/problems/path-sum/思路dfsbfs + 两个队列code/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left)

题目https://leetcode-cn.com/problems/binary-tree-paths/思路dfs + 递归dfs + 栈code/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null :

题目https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/思路dfsbfs+队列code/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? n

题目https://leetcode-cn.com/problems/permutations/思路dfs + 回溯bfs + 队列codevar permute = function (nums) { // dfs // let depth = 0; // let tags = new Array(nums.length).fill(false); // let res, tmp; // res = []; // tmp = [];

题目https://leetcode-cn.com/problems/merge-sorted-array/思路用双指针，分别指向两个数组，比较然后push到一个新的数组中，最后在把新数组的值赋值给nums1反向双指针：对两个数组进行比较，较大值放在num1数组后面，就不用使用到O(m+n)的空间复杂度code/** * @param {number[]} nums1 * @param {number} m * @param {number[]} nums2 * @param {nu

题目https://leetcode-cn.com/problems/longest-palindromic-substring/思路中心扩散法：分为两种情况，…aa…和…aba…，用ll和rr记录这个子串的边界，判断长度rr-ll+1获取最大即可/** * @param {string} s * @return {string} */var longestPalindrome = function(s) { if (s.length == 0) return s; let

题目https://leetcode-cn.com/problems/reorder-list/submissions/思路快慢指针找到中间节点将链表根据中间节点分成两个，对后面这个链表进行倒序然后在依次组合这两个链表code/** * Definition for singly-linked list. * function ListNode(val, next) { * this.val = (val===undefined ? 0 : val) * this.

题目https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/code快速排序var getLeastNumbers = function (arr, k) { if (k > arr.length) return []; heap_sort(arr, arr.length); return arr.slice(0, k);}最大堆/** * @param {number[]} arr * @para

题目https://leetcode-cn.com/problems/compare-version-numbers/solution/思路找到每个.分割的版本号，然后转换成数字进行比较code/** * @param {string} version1 * @param {string} version2 * @return {number} */var compareVersion = function (version1, version2) { let len1 = ve

题目https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/思路按照每层打印，外层打完，进内层；先打印上侧，右侧若：left<right&&top<bottom，说明存在下侧，左侧需要打印code/** * @param {number[][]} matrix * @return {number[]} */var spiralOrder = function (matrix) {

题目https://leetcode-cn.com/problems/generate-parentheses/思路递归生成，当做一颗树，每层加入一个)或(，这样子就可以用dfs把所有的组合列出来，因为是有效的括号，对树的每一层进行判断，当右括号数大于左括号数，不成立；当左括号数大于总数的一半，不成立。code/** * @param {number} n * @return {string[]} */function f(n,res,str, left, right){ if (

题目https://leetcode-cn.com/problems/binary-search/code/** * @param {number[]} nums * @param {number} target * @return {number} */var search = function(nums, target) { let begin = 0; let end = nums.length; while (begin <= end){

题目https://leetcode-cn.com/problems/add-strings/思路大数相加，模拟code/** * @param {string} num1 * @param {string} num2 * @return {string} */var addStrings = function(num1, num2) { let len1 = num1.length-1; let len2 = num2.length-1; let add = 0