leetcode每日一题202007
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
面试题 08.03. Magic Index LCCI(Leetcode每日一题-2020.07.31)
ProblemA magic index in an array A[0…n-1] is defined to be an index such that A[i] = i. Given a sorted array of integers, write a method to find a magic index, if one exists, in array A. If not, return -1. If there are more than one magic index, return th原创 2020-07-31 21:24:16 · 216 阅读 · 0 评论 -
343. Integer Break(Leetcode每日一题-2020.07.30)
ProblemGiven a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.Example1Input: 2Output: 1Explanation: 2 = 1 + 1, 1 × 1 = 1.Example2Input原创 2020-07-30 22:16:35 · 151 阅读 · 0 评论 -
LCP 13. 寻宝(Leetcode每日一题-2020.07.29)--抄答案。。。。
Problem我们得到了一副藏宝图,藏宝图显示,在一个迷宫中存在着未被世人发现的宝藏。迷宫是一个二维矩阵,用一个字符串数组表示。它标识了唯一的入口(用 ‘S’ 表示),和唯一的宝藏地点(用 ‘T’ 表示)。但是,宝藏被一些隐蔽的机关保护了起来。在地图上有若干个机关点(用 ‘M’ 表示),只有所有机关均被触发,才可以拿到宝藏。要保持机关的触发,需要把一个重石放在上面。迷宫中有若干个石堆(用 ‘O’ 表示),每个石堆都有无限个足够触发机关的重石。但是由于石头太重,我们一次只能搬一个石头到指定地点。迷宫中原创 2020-07-29 21:47:39 · 301 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree(Leetcode每日一题-2020.07.28)
ProblemGiven 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.Note: A leaf is a node with no children.ExampleGiven binary tree [3,9,20,null,null,15,原创 2020-07-28 20:21:50 · 115 阅读 · 0 评论 -
392. Is Subsequence(Leetcode每日一题-2020.07.27)
ProblemGiven a string s and a string t, check if s is subsequence of t.A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the re原创 2020-07-27 20:51:16 · 160 阅读 · 0 评论 -
329. Longest Increasing Path in a Matrix(Leetcode每日一题-2020.07.26)
ProblemGiven an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).原创 2020-07-26 09:47:19 · 201 阅读 · 0 评论 -
410. Split Array Largest Sum(Leetcode每日一题-2020.07.25)
ProblemGiven an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.Note:If n is the length of array, assum原创 2020-07-26 09:44:58 · 213 阅读 · 0 评论 -
1025. Divisor Game(Leetcode每日一题-2020.07.24)
ProblemAlice and Bob take turns playing a game, with Alice starting first.Initially, there is a number N on the chalkboard. On each player’s turn, that player makes a move consisting of:Choosing any x with 0 < x < N and N % x == 0.Replacing the原创 2020-07-26 09:32:35 · 246 阅读 · 0 评论 -
64. Minimum Path Sum(Leetcode每日一题-2020.07.23)
ProblemGiven a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any point in time.ExampleSolutionclass Solutio原创 2020-07-23 20:04:20 · 161 阅读 · 0 评论 -
剑指 Offer 11. 旋转数组的最小数字&154. Find Minimum in Rotated Sorted Array II(Leetcode每日一题-2020.07.22)
ProblemSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).Find the minimum element.The array may contain duplicates.Example1Input: [1,3,5]Output: 1E原创 2020-07-22 21:12:41 · 180 阅读 · 0 评论 -
95. Unique Binary Search Trees II(Leetcode每日一题-2020.07.21)
ProblemGiven an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.Constraints:0 <= n <= 8ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeN原创 2020-07-22 21:09:19 · 181 阅读 · 0 评论 -
167. Two Sum II - Input array is sorted(Leetcode每日一题-2020.07.20)
ProblemGiven an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where index1原创 2020-07-20 21:52:06 · 170 阅读 · 0 评论 -
312. Burst Balloons(Leetcode每日一题-2020.07.19)
ProblemGiven n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and原创 2020-07-19 12:21:08 · 304 阅读 · 0 评论 -
97. Interleaving String(Leetcode每日一题-2020.07.18)
ProblemGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.Example1Input: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac”Output: trueExample2Input: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbbaccc”Output: falseSolutionclass原创 2020-07-18 10:09:58 · 222 阅读 · 0 评论 -
35. Search Insert Position(Leetcode每日一题-2020.07.17)
ProblemGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Example1Input: [1,3,5,6], 5Output: 2Example2原创 2020-07-18 10:06:31 · 171 阅读 · 0 评论 -
785. Is Graph Bipartite?(Leetcode每日一题-2020.07.16)
ProblemGiven an undirected graph, return true if and only if it is bipartite.Recall that a graph is bipartite if we can split it’s set of nodes into two independent subsets A and B such that every edge in the graph has one node in A and another node in B原创 2020-07-16 19:48:23 · 189 阅读 · 0 评论 -
96. Unique Binary Search Trees(Leetcode每日一题-2020.07.15)
ProblemGiven n, how many structurally unique BST’s (binary search trees) that store values 1 … n?ExampleSolutionclass Solution {public: int numTrees(int n) { vector<int> dp(n+1,0); dp[0] = 1; dp[1] = 1;原创 2020-07-15 21:09:54 · 151 阅读 · 0 评论 -
120. Triangle(Leetcode每日一题-2020.07.14)
ProblemGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.Note:Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triang原创 2020-07-14 22:41:30 · 162 阅读 · 0 评论 -
350. Intersection of Two Arrays II(Leetcode每日一题-2020.07.13)
ProblemGiven two arrays, write a function to compute their intersection.Note:Each element in the result should appear as many times as it shows in both arrays.The result can be in any order.Follow up:What if the given array is already sorted? How原创 2020-07-13 19:44:40 · 200 阅读 · 0 评论 -
174. Dungeon Game(Leetcode每日一题-2020.07.12)
ProblemThe demons had captured the princess § and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his wa原创 2020-07-12 10:17:18 · 265 阅读 · 0 评论 -
315. Count of Smaller Numbers After Self(Leetcode每日一题-2020.07.11)
ProblemYou are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].ExampleInput: [5,2,6,1]Output: [2,1,1,0]Explanation:To原创 2020-07-12 10:13:12 · 247 阅读 · 0 评论 -
309. Best Time to Buy and Sell Stock with Cooldown(Leetcode每日一题-2020.07.10)
ProblemSay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times) w原创 2020-07-12 10:11:17 · 212 阅读 · 0 评论 -
面试题 17.13. Re-Space LCCI(Leetcode每日一题-2020.07.09)
ProblemOh, no! You have accidentally removed all spaces, punctuation, and capitalization in a lengthy document. A sentence like “I reset the computer. It still didn’t boot!” became "iresetthecomputeritstilldidntboot’’. You’ll deal with the punctuation and原创 2020-07-09 19:58:04 · 226 阅读 · 0 评论 -
面试题 16.11. Diving Board LCCI(Leetcode每日一题-2020.07.08)
ProblemYou are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length shorter and one of length longer. You must use exactly K planks of wood. Write a method to generate all possible lengths f原创 2020-07-08 20:32:17 · 410 阅读 · 0 评论 -
112. Path Sum(Leetcode每日一题-2020.07.07)
ProblemGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Note: A leaf is a node with no children.ExampleGiven the below binary tree and sum = 22,return原创 2020-07-07 20:51:53 · 237 阅读 · 0 评论 -
63. Unique Paths II(Leetcode每日一题-2020.07.06)
ProblemA robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in原创 2020-07-06 21:24:39 · 235 阅读 · 0 评论 -
44. Wildcard Matching(Leetcode每日一题-2020.07.05)
ProblemGiven an input string (s) and a pattern §, implement wildcard pattern matching with support for ‘?’ and ‘*’.‘?’ Matches any single character.‘*’ Matches any sequence of characters (including the empty sequence).The matching should cover the en原创 2020-07-05 09:58:48 · 236 阅读 · 0 评论 -
32. Longest Valid Parentheses(Leetcode每日一题-2020.07.04)
ProblemGiven a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.来源:力扣(LeetCode)Example1Input: “(()”Output: 2Explanation: The longest valid parentheses substring is “()”Exam原创 2020-07-04 09:45:27 · 240 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree(Leetcode每日一题-2020.07.03)
ProblemGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.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 never differ by more原创 2020-07-04 09:41:12 · 234 阅读 · 0 评论 -
378. Kth Smallest Element in a Sorted Matrix(Leetcode每日一题-2020.07.02)
ProblemGiven a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.Note that it is the kth smallest element in the sorted order, not the kth distinct element.ExampleSolutionSoluti原创 2020-07-02 21:19:34 · 307 阅读 · 0 评论 -
718. Maximum Length of Repeated Subarray(Leetcode每日一题-2020.07.01)
ProblemGiven two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.ExampleInput:A: [1,2,3,2,1]B: [3,2,1,4,7]Output: 3Explanation:The repeated subarray with maximum length is [3, 2, 1].Solutionclass S原创 2020-07-01 20:16:34 · 218 阅读 · 0 评论