leetcode每日一题202009
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
701. Insert into a Binary Search Tree(Leetcode每日一题-2020.09.30)
ProblemYou are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.Notice that there may exist原创 2020-10-07 21:34:53 · 404 阅读 · 0 评论 -
145. Binary Tree Postorder Traversal(Leetcode每日一题-2020.09.29)
ProblemGiven the root of a binary tree, return the postorder traversal of its nodes’ values.Constraints:The number of the nodes in the tree is in the range [0, 100].100 <= Node.val <= 100Example1Input: root = [1,null,2,3]Output: [3,2,1]E原创 2020-10-06 20:25:42 · 215 阅读 · 0 评论 -
117. Populating Next Right Pointers in Each Node II(Leetcode每日一题-2020.09.28)
占坑原创 2020-09-28 10:39:53 · 313 阅读 · 0 评论 -
235. Lowest Common Ancestor of a Binary Search Tree(Leetcode每日一题-2020.09.27)
占坑原创 2020-09-28 10:39:19 · 519 阅读 · 1 评论 -
113. Path Sum II(Leetcode每日一题-2020.09.26)
ProblemGiven a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.Note: A leaf is a node with no children.ExampleGiven the below binary tree and sum = 22,Return:Solution/** * Definition for a binary tree原创 2020-09-26 12:14:25 · 352 阅读 · 0 评论 -
106. Construct Binary Tree from Inorder and Postorder Traversal(Leetcode每日一题-2020.09.25)
ProblemGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.ExampleFor example, giveninorder = [9,3,15,20,7]postorder = [9,15,7,20,3]Return the following binary tr原创 2020-09-25 20:26:53 · 171 阅读 · 0 评论 -
501. Find Mode in Binary Search Tree(Leetcode每日一题-2020.09.24)
ProblemGiven a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than or equal to the原创 2020-09-24 21:32:21 · 356 阅读 · 0 评论 -
617. Merge Two Binary Trees(Leetcode每日一题-2020.09.23)
ProblemGiven two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, th原创 2020-09-23 21:30:58 · 324 阅读 · 0 评论 -
968. Binary Tree Cameras(Leetcode每日一题-2020.09.22)--抄答案
ProblemBinary Tree CamerasGiven a binary tree, we install cameras on the nodes of the tree.Each camera at a node can monitor its parent, itself, and its immediate children.Calculate the minimum number of cameras needed to monitor all nodes of the tre原创 2020-09-22 22:52:56 · 524 阅读 · 0 评论 -
538. Convert BST to Greater Tree&1038. BST to Greater Sum Tree(Leetcode每日一题-2020.09.22)
ProblemGiven 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.ExampleSolution右->中->左 遍历/** * Definition fo原创 2020-09-21 19:48:18 · 294 阅读 · 0 评论 -
78. Subsets(Leetcode每日一题-2020.09.20)
ProblemGiven a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.ExampleInput: nums = [1,2,3]Output:[[3],[1],[2],[1,2,3],[1,3],[2,3],[1,2],[]]Solutioncla原创 2020-09-20 11:01:54 · 211 阅读 · 0 评论 -
404. Sum of Left Leaves(Leetcode每日一题-2020.09.19)
ProblemFind the sum of all left leaves in a given binary tree.ExampleSolution首先就是我们只求叶子节点之和(左孩子右孩子为空就可以判断是否为叶子节点),然后需要判断是否是左边的叶子节点,所以我们只需要判断每个节点左边节点是否为空,如果不为空是否为叶子节点,如果成立我们就返回这个左孩子的值再加上向右边孩子进行递归计算的值(右孩子中也有可能有左叶子节点)。/** * Definition for a binary tree原创 2020-09-19 10:49:58 · 407 阅读 · 0 评论 -
47. Permutations II(Leetcode每日一题-2020.09.18)
ProblemGiven a collection of numbers that might contain duplicates, return all possible unique permutations.ExampleInput: [1,1,2]Output:[[1,1,2],[1,2,1],[2,1,1]]Solutionclass Solution {public: vector<vector<int>> ret;原创 2020-09-18 20:34:01 · 409 阅读 · 0 评论 -
685. Redundant Connection II(Leetcode每日一题-2020.09.17)---抄答案
ProblemIn this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents.The gi原创 2020-09-17 21:39:16 · 302 阅读 · 0 评论 -
226. Invert Binary Tree(Leetcode每日一题-2020.09.16)
ProblemInvert a binary tree.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti原创 2020-09-16 20:54:24 · 372 阅读 · 0 评论 -
37. Sudoku Solver(Leetcode每日一题-2020.09.15)
ProblemWrite a program to solve a Sudoku puzzle by filling the empty cells.A sudoku solution must satisfy all of the following rules:Each of the digits 1-9 must occur exactly once in each row.Each of the digits 1-9 must occur exactly once in each colum原创 2020-09-15 21:28:16 · 814 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal(Leetcode每日一题-2020.09.14)
ProblemGiven a binary tree, return the inorder traversal of its nodes’ values.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),原创 2020-09-14 20:50:06 · 423 阅读 · 0 评论 -
79. Word Search(Leetcode每日一题-2020.09.13)
ProblemGiven a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used原创 2020-09-13 21:50:25 · 600 阅读 · 0 评论 -
637. Average of Levels in Binary Tree(Leetcode每日一题-2020.09.12)
ProblemGiven a non-empty binary tree, return the average value of the nodes on each level in the form of an array.Note:The range of node’s value is in the range of 32-bit signed integer.ExampleSolution/** * Definition for a binary tree node. * str原创 2020-09-13 21:47:45 · 312 阅读 · 0 评论 -
216. Combination Sum III(Leetcode每日一题-2020.09.11)
ProblemFind all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Note:All numbers will be positive integers.The solution set must not c原创 2020-09-11 20:21:01 · 207 阅读 · 0 评论 -
40. Combination Sum II(Leetcode每日一题-2020.09.10)
ProblemGiven a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.Each number in candidates may only be used once in the combination.Note:All原创 2020-09-10 19:39:01 · 151 阅读 · 0 评论 -
39. Combination Sum(Leetcode每日一题-2020.09.09)
ProblemGiven a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.The same repeated number may be chosen from candidates unlimited原创 2020-09-09 21:54:30 · 206 阅读 · 0 评论 -
77. Combinations(Leetcode每日一题-2020.09.08)
ProblemGiven two integers n and k, return all possible combinations of k numbers out of 1 … n.You may return the answer in any order.Constraints:1 <= n <= 201 <= k <= nExample1Input: n = 4, k = 2Output:[[2,4],[3,4],[2,3],[1,2],原创 2020-09-08 21:04:26 · 167 阅读 · 0 评论 -
347. Top K Frequent Elements(Leetcode每日一题-2020.09.07)
ProblemGiven a non-empty array of integers, return the k most frequent elements.Note:You may assume k is always valid, 1 ≤ k ≤ number of unique elements.Your algorithm’s time complexity must be better than O(n log n), where n is the array’s size.It’s原创 2020-09-07 22:04:31 · 245 阅读 · 0 评论 -
107. Binary Tree Level Order Traversal II(Leetcode每日一题-2020.09.06)
ProblemGiven a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).ExampleGiven binary tree [3,9,20,null,null,15,7],return its bottom-up level order traversal as:So原创 2020-09-06 17:27:59 · 151 阅读 · 0 评论 -
60. Permutation Sequence(Leetcode每日一题-2020.09.05)
ProblemThe set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, we get the following sequence for n = 3:“123”“132”“213”“231”“312”“321”Given n and k, return the kth permutation sequenc原创 2020-09-06 17:26:23 · 175 阅读 · 0 评论 -
257. Binary Tree Paths(Leetcode每日一题-2020.09.04)
ProblemGiven a binary tree, return all root-to-leaf paths.Note: A leaf is a node with no children.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * Tree原创 2020-09-04 20:28:48 · 100 阅读 · 0 评论 -
51. N-Queens(Leetcode每日一题-2020.09.03)
ProblemThe n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each solution contains a distinct board configuration原创 2020-09-03 21:16:57 · 222 阅读 · 0 评论 -
65. Valid Number&&剑指 Offer 20. 表示数值的字符串(Leetcode每日一题-2020.09.02)
Problem请实现一个函数用来判断字符串是否表示数值(包括整数和小数)。例如,字符串"+100"、“5e2”、"-123"、“3.1416”、"-1E-16"、“0123"都表示数值,但"12e”、“1a3.14”、“1.2.3”、"±5"及"12e+5.4"都不是。Solutionclass Solution {public: bool isNumber(string s) { int l = 0, r = s.size() - 1; //去掉首尾的空格原创 2020-09-02 21:49:49 · 165 阅读 · 0 评论 -
486. Predict the Winner(Leetcode每日一题-2020.09.01)
ProblemGiven an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a number, that number will not be available for t原创 2020-09-01 22:12:50 · 186 阅读 · 0 评论