LeetCode
文章平均质量分 66
descire
欢迎公众号@漫谈大前端,更多前端干货等你哦!
展开
-
200.Number of Islands [JavaScript]
一、题目Given a 2d grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may a...原创 2018-11-28 23:52:27 · 125 阅读 · 0 评论 -
807.Max Increase to Keep City Skyline [JavaScript]
一、题目In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the height of any number of buildings, by any amount (the amount...原创 2018-11-29 20:00:30 · 145 阅读 · 0 评论 -
935.Knight Dialer [JavaScript]
一、题目A chess knight can move as indicated in the chess diagram below:This time, we place our chess knight on any numbered key of a phone pad (indicated above), and the knight makes N-1 hops. Each ...原创 2018-11-26 23:55:41 · 187 阅读 · 0 评论 -
921. Minimum Add to Make Parentheses Valid [JavaScript]
一、题目Given a string S of ‘(’ and ‘)’ parentheses, we add the minimum number of parentheses ( ‘(’ or ‘)’, and in any positions ) so that the resulting parentheses string is valid.Formally, a parenthes...原创 2018-12-04 23:25:28 · 151 阅读 · 0 评论 -
946.Validate Stack Sequences [JavaScript]
一、题目Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.二、题目大意...原创 2018-11-27 23:03:35 · 126 阅读 · 0 评论 -
926. Flip String to Monotone Increasing [JavaScript]
一、题目A string of '0’s and '1’s is monotone increasing if it consists of some number of '0’s (possibly 0), followed by some number of '1’s (also possibly 0.)We are given a string S of '0’s and '1’s, a...原创 2018-12-02 00:07:59 · 123 阅读 · 0 评论 -
915. Partition Array into Disjoint Intervals [JavaScript]
一、题目Given an array A, partition it into two (contiguous) subarrays left and right so that:Every element in left is less than or equal to every element in right.left and right are non-empty.left h...原创 2018-12-08 02:06:08 · 91 阅读 · 0 评论 -
898. Bitwise ORs of Subarrays [JavaScript]
一、题目We have an array A of non-negative integers.For every (contiguous) subarray B = [A[i], A[i+1], …, A[j]] (with i <= j), we take the bitwise OR of all the elements in B, obtaining a result A[i]...原创 2018-12-12 21:46:20 · 110 阅读 · 0 评论 -
918. Maximum Sum Circular Subarray [JavaScript]
一、题目Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C.Here, a circular array means the end of the array connects to the beginning of t...原创 2018-12-06 00:28:18 · 112 阅读 · 0 评论 -
923. 3Sum With Multiplicity [JavaScript]
一、题目Given an integer array A, and an integer target, return the number of tuples i, j, k such that i < j < k and A[i] + A[j] + A[k] == target.As the answer can be very large, return it modulo...原创 2018-12-03 23:44:31 · 139 阅读 · 0 评论 -
890. Find and Replace Pattern [JavaScript]
一、题目You have a list of words and a pattern, and you want to know which words in words matches the pattern.A word matches the pattern if there exists a permutation of letters p so that after replacin...原创 2018-12-13 21:20:15 · 112 阅读 · 0 评论 -
916. Word Subsets [JavaScript]
一、题目We are given two arrays A and B of words. Each word is a string of lowercase letters.Now, say that word b is a subset of word a if every letter in b occurs in a, including multiplicity. For ex...原创 2018-12-07 00:10:10 · 133 阅读 · 0 评论 -
563. Binary Tree Tilt [JavaScript]
一、题目 Given a binary tree, return the tilt of the whole tree. The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right ...原创 2018-12-22 23:32:26 · 150 阅读 · 0 评论 -
543. Diameter of Binary Tree [JavaScript]
一、题目 Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may o...原创 2018-12-23 12:09:46 · 142 阅读 · 0 评论 -
257. Binary Tree Paths [JavaScript]
一、题目 Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Input: 1 / \ 2 3 \ 5 Output: ["1->2->5", "1-&原创 2018-12-23 13:00:06 · 128 阅读 · 0 评论 -
910. Smallest Range II [JavaScript]
一、题目Given an array A of integers, for each integer A[i] we need to choose either x = -K or x = K, and add x to A[i] (only once).After this process, we have some array B.Return the smallest possible...原创 2018-12-09 23:02:56 · 188 阅读 · 0 评论 -
886. Possible Bipartition [JavaScript]
一、题目Given a set of N people (numbered 1, 2, …, N), we would like to split everyone into two groups of any size.Each person may dislike some other people, and they should not go into the same group....原创 2018-12-16 00:16:47 · 137 阅读 · 0 评论 -
572. Subtree of Another Tree [JavaScript]
一、题目 Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of th...原创 2018-12-23 13:00:12 · 116 阅读 · 0 评论 -
110. Balanced Binary Tree [JavaScript]
一、题目 Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the depth of the two subtrees of every node ne...原创 2018-12-23 13:00:20 · 186 阅读 · 0 评论 -
106. Construct Binary Tree from Inorder and Postorder Traversal [JavaScript]
一、题目 Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. For example, given inorder = [9,3,15,20,7] p...原创 2018-12-27 20:47:22 · 127 阅读 · 0 评论 -
236. Lowest Common Ancestor of a Binary Tree [JavaScript]
一、题目 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two ...原创 2018-12-27 20:47:32 · 136 阅读 · 0 评论 -
JavaScript刷LeetCode -- 222. Count Complete Tree Nodes
一、题目 Given a complete binary tree, count the number of nodes.二、题目大意 计算完全二叉树节点的个数。三、解题思路 递归遍历四、代码实现const countNodes = root => { const ans = [] dfs(root) return ans.length function ...原创 2018-12-28 18:22:41 · 177 阅读 · 0 评论 -
JavaScript刷LeetCode -- 98. Validate Binary Search Tree
一、题目 Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s ke...原创 2018-12-29 10:59:31 · 182 阅读 · 0 评论 -
538. Convert BST to Greater Tree [JavaScript]
一、题目 Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST....原创 2018-12-23 13:00:27 · 95 阅读 · 0 评论 -
907. Sum of Subarray Minimums [JavaScript]
一、题目Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A.Since the answer may be large, return the answer modulo 10^9 + 7.1 <= A.length &lt...原创 2018-12-10 23:15:18 · 192 阅读 · 0 评论 -
904. Fruit Into Baskets [JavaScript]
一、题目In a row of trees, the i-th tree produces fruit with type tree[i].You start at any tree of your choice, then repeatedly perform the following steps:Add one piece of fruit from this tree to your...原创 2018-12-11 21:00:30 · 205 阅读 · 0 评论 -
700. Search in a Binary Search Tree [JavaScript]
一、题目 Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node’s value equals the given value. Return the subtree rooted with that node. If su...原创 2018-12-18 22:16:59 · 206 阅读 · 0 评论 -
654. Maximum Binary Tree [JavaScript]
一、题目 Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:The root is the maximum number in the array.The left subtree is the maximum tree constru...原创 2018-12-24 19:30:24 · 83 阅读 · 0 评论 -
814. Binary Tree Pruning [JavaScript]
一、题目 We are given the head node root of a binary tree, where additionally every node’s value is either a 0 or a 1. Return the same tree where every subtree (of the given tree) not containing a 1 h...原创 2018-12-25 01:13:08 · 90 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal [JavaScript]
一、题目 Given a binary tree, return the inorder traversal of its nodes’ values.二、题目大意 二叉树的中序遍历。三、解题思路 递归四、代码实现const inorderTraversal = root => { const ans = [] help(root) return ans ...原创 2018-12-25 01:13:22 · 162 阅读 · 0 评论 -
655. Print Binary Tree [JavaScript]
一、题目 Print a binary tree in an m*n 2D string array following these rules:The row number m should be equal to the height of the given binary tree.The column number n should always be an odd number...原创 2018-12-25 01:13:44 · 125 阅读 · 0 评论 -
662. Maximum Width of Binary Tree [JavaScript]
一、题目 Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full bin...原创 2018-12-29 10:59:38 · 114 阅读 · 0 评论 -
145. Binary Tree Postorder Traversal [JavaScript]
一、题目 Given a binary tree, return the postorder traversal of its nodes’ values.二、题目大意 后序遍历二叉树。三、解题思路 递归四、代码实现const postorderTraversal = root => { const ans = [] help(root) return ans...原创 2018-12-29 17:44:38 · 127 阅读 · 0 评论 -
99. Recover Binary Search Tree [JavaScript]
一、题目 Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure.二、题目大意 二叉搜索树中有两个元素放错位置了,现在需要在不改变树结构的情况下交换两个值。三、解题思路 解决这个问题需要找出这两个错误的元素...原创 2018-12-30 23:04:33 · 111 阅读 · 0 评论 -
897. Increasing Order Search Tree [JavaScript]
一、题目 Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.二、题目大意 给定一棵树,按顺序重新排列树,...原创 2019-01-03 18:14:42 · 184 阅读 · 0 评论 -
669. Trim a Binary Search Tree [JavaScript]
一、题目 Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so...原创 2019-01-03 20:49:39 · 88 阅读 · 0 评论 -
637. Average of Levels in Binary Tree [JavaScript]
一、题目 Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.二、题目大意 计算二叉树每一层节点的平均值。三、解题思路 递归分层遍历二叉树。四、代码实现const averageOfLevels = root =&gt...原创 2019-01-03 21:05:12 · 114 阅读 · 0 评论 -
653. Two Sum IV - Input is a BST [JavaScript]
一、题目 Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.二、题目大意 二叉搜索树中是否存在两个元素的值为k。三、解题思路 递归遍历二叉...原创 2019-01-04 10:14:36 · 134 阅读 · 0 评论 -
872. Leaf-Similar Trees [JavaScript]
一、题目 Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given tree above, the leaf value sequence is (...原创 2018-12-19 20:33:51 · 152 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree [JavaScript]
一、题目 Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.二、题目大意 求出二叉树的高度三、解题思路 老套路,...原创 2018-12-20 16:40:48 · 90 阅读 · 0 评论