leetcode动态规划
文章平均质量分 50
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
552. Student Attendance Record II[Hard](Leetcode每日一题-2021.08.18)
Problem原创 2021-08-24 21:54:22 · 180 阅读 · 0 评论 -
526. Beautiful Arrangement[Medium](Leetcode每日一题-2021.08.16)
位运算DP原创 2021-08-17 20:11:54 · 297 阅读 · 0 评论 -
576. Out of Boundary Paths[Medium](Leetcode每日一题-2021.08.15)
DP原创 2021-08-17 20:10:51 · 246 阅读 · 0 评论 -
233. Number of Digit One[Hard](Leetcode每日一题-2021.08.13)
数位DP原创 2021-08-17 20:08:41 · 157 阅读 · 0 评论 -
516. Longest Palindromic Subsequence[Medium](Leetcode每日一题-2021.08.12)
DP原创 2021-08-17 20:07:42 · 118 阅读 · 0 评论 -
446. Arithmetic Slices II - Subsequence[Hard](Leetcode每日一题-2021.08.11)
111原创 2021-08-17 20:06:42 · 117 阅读 · 0 评论 -
313. Super Ugly Number[Medium](Leetcode每日一题-2021.08.09)
111原创 2021-08-17 20:03:36 · 170 阅读 · 0 评论 -
1137. N-th Tribonacci Number[Easy](Leetcode每日一题-2021.08.08)
111原创 2021-08-17 20:02:39 · 113 阅读 · 0 评论 -
剑指 Offer 42. 连续子数组的最大和[Easy](Leetcode每日一题-2021.07.17)
Problem输入一个整型数组,数组中的一个或连续多个整数组成一个子数组。求所有子数组的和的最大值。要求时间复杂度为O(n)。提示:1 <= arr.length <= 10^5-100 <= arr[i] <= 100Example输入: nums = [-2,1,-3,4,-1,2,1,-5,4]输出: 6解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。Solutionclass Solution {public: int ma原创 2021-07-18 22:38:59 · 143 阅读 · 0 评论 -
877. Stone Game[Medium](Leetcode每日一题-2021.06.16)--抄答案
ProblemAlex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].The objective of the game is to end with the most stones. The total number of ston原创 2021-06-16 08:34:08 · 193 阅读 · 0 评论 -
1449. Form Largest Integer With Digits That Add up to Target[Hard](Leetcode每日一题-2021.06.12)--抄答案
ProblemGiven an array of integers cost and an integer target. Return the maximum integer you can paint under the following rules:The cost of painting a digit (i+1) is given by cost[i] (0 indexed).The total cost used must be equal to target.Integer does原创 2021-06-15 08:24:20 · 624 阅读 · 0 评论 -
279. Perfect Squares[Medium](Leetcode每日一题-2021.06.11)--抄答案
ProblemGiven an integer n, return the least number of perfect square numbers that sum to n.A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 1, 4, 9, and 16 are pe原创 2021-06-15 08:20:22 · 548 阅读 · 0 评论 -
518. Coin Change 2[Medium](Leetcode每日一题-2021.06.10)
ProblemYou are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.Return the number of combinations that make up that amount. If that amount of money cannot be made up by原创 2021-06-10 08:05:11 · 156 阅读 · 0 评论 -
879. Profitable Schemes[Hard](Leetcode每日一题-2021.06.09)--抄答案
ProblemThere is a group of n members, and a list of various crimes they could commit. The ith crime generates a profit[i] and requires group[i] members to participate in it. If a member participates in one crime, that member can’t participate in another c原创 2021-06-09 08:47:16 · 552 阅读 · 1 评论 -
1049. Last Stone Weight II[Medium](Leetcode每日一题-2021.06.08)--抄答案
ProblemYou are given an array of integers stones where stones[i] is the weight of the ith stone.We are playing a game with the stones. On each turn, we choose any two stones and smash them together. Suppose the stones have weights x and y with x <= y.原创 2021-06-08 08:26:51 · 248 阅读 · 0 评论 -
494. Target Sum[Medium](Leetcode每日一题-2021.06.07)--抄答案
ProblemYou are given an integer array nums and an integer target.You want to build an expression out of nums by adding one of the symbols ‘+’ and ‘-’ before each integer in nums and then concatenate all the integers.For example, if nums = [2, 1], you c原创 2021-06-07 19:35:58 · 562 阅读 · 1 评论 -
474. Ones and Zeroes[Medium](Leetcode每日一题-2021.06.06)--抄答案
ProblemYou are given an array of binary strings strs and two integers m and n.Return the size of the largest subset of strs such that there are at most m 0’s and n 1’s in the subset.A set x is a subset of a set y if all elements of x are also elements o原创 2021-06-06 09:26:32 · 647 阅读 · 0 评论 -
1787. Make the XOR of All Segments Equal to Zero[Hard](Leetcode每日一题-2021.05.25)--抄答案
ProblemYou are given an array nums and an integer k. The XOR of a segment [left, right] where left <= right is the XOR of all the elements with indices between left and right, inclusive: nums[left] XOR nums[left+1] XOR … XOR nums[right].Return原创 2021-05-25 08:41:31 · 698 阅读 · 0 评论 -
664. Strange Printer[Hard](Leetcode每日一题-2021.05.24)--抄答案
ProblemThere is a strange printer with the following two special properties:The printer can only print a sequence of the same character each time.At each turn, the printer can print new characters starting from and ending at any place and will cover th原创 2021-05-24 08:32:10 · 231 阅读 · 0 评论 -
1035. Uncrossed Lines[Medium](Leetcode每日一题-2021.05.21)
ProblemWe write the integers of nums1 and nums2 (in the order they are given) on two separate horizontal lines.Now, we may draw connecting lines: a straight line connecting two numbers nums1[i] and nums2[j] such that:nums1[i] == nums2[j];The line we d原创 2021-05-21 08:45:27 · 243 阅读 · 0 评论 -
1269. Number of Ways to Stay in the Same Place After Some Steps[Hard](Leetcode每日一题-2021.05.13)
ProblemYou have a pointer at index 0 in an array of size arrLen. At each step, you can move 1 position to the left, 1 position to the right in the array or stay in the same place (The pointer should not be placed outside the array at any time).Given two原创 2021-05-13 20:59:44 · 373 阅读 · 0 评论 -
740. Delete and Earn(Leetcode每日一题-2021.05.05)--抄答案
ProblemGiven an array nums of integers, you can perform operations on the array.In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must delete every element equal to nums[i] - 1 or nums[i] + 1.You start with 0 point原创 2021-05-06 08:34:24 · 520 阅读 · 0 评论 -
1473. Paint House III(Leetcode每日一题-2021.05.04)--抄答案
ProblemThere is a row of m houses in a small city, each house must be painted with one of the n colors (labeled from 1 to n), some houses that have been painted last summer should not be painted again.A neighborhood is a maximal group of continuous house原创 2021-05-04 21:46:08 · 261 阅读 · 0 评论 -
403. Frog Jump(Leetcode每日一题-2021.04.29)--抄答案
ProblemA frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.Given a list of stones’ positions (in units) in sor原创 2021-04-29 09:51:01 · 194 阅读 · 0 评论 -
377. Combination Sum IV(Leetcode每日一题-2021.04.24)
ProblemGiven an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.The answer is guaranteed to fit in a 32-bit integer.Constraints:1 <= nums.length <= 2001 <= nums[i]原创 2021-04-24 11:13:27 · 207 阅读 · 0 评论 -
368. Largest Divisible Subset(Leetcode每日一题-2021.04.23)--抄答案
ProblemGiven a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies:answer[i] % answer[j] == 0, oranswer[j] % answer[i] == 0If there are multiple solu原创 2021-04-23 08:27:50 · 149 阅读 · 0 评论 -
91. Decode Ways(Leetcode每日一题-2021.04.21)
ProblemA message containing letters from A-Z can be encoded into numbers using the following mapping:‘A’ -> “1”‘B’ -> “2”…‘Z’ -> “26”To decode an encoded message, all the digits must be grouped then mapped back into letters using the rever原创 2021-04-21 08:33:43 · 214 阅读 · 0 评论 -
87. Scramble String(Leetcode每日一题-2021.04.16)--抄答案
ProblemWe can scramble a string s to get a string t using the following algorithm:If the length of the string is 1, stop.If the length of the string is > 1, do the following:Split the string into two non-empty substrings at a random index, i.e.,原创 2021-04-16 08:53:32 · 312 阅读 · 0 评论 -
213. House Robber II(Leetcode每日一题-2021.04.15)
ProblemYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacen原创 2021-04-15 08:53:45 · 534 阅读 · 0 评论 -
1143. Longest Common Subsequence(Leetcode每日一题-2021.04.03)
ProblemGiven two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.A subsequence of a string is a new string generated from the original string with some characters (can be none) d原创 2021-04-04 11:44:43 · 321 阅读 · 0 评论 -
115. Distinct Subsequences(Leetcode每日一题-2021.03.17)
ProblemGiven two strings s and t, return the number of distinct subsequences of s which equals t.A string’s subsequence is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining char原创 2021-03-17 08:46:32 · 193 阅读 · 0 评论 -
132. Palindrome Partitioning II(Leetcode每日一题-2021.03.08)
ProblemGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.Constraints:1 <= s.length <= 2000s consists of lower-case English letters only.E原创 2021-03-08 20:30:31 · 147 阅读 · 0 评论 -
131. Palindrome Partitioning(Leetcode每日一题-2021.03.07)
ProblemGiven a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.A palindrome string is a string that reads the same backward as forward.Constraints:1 <= s.length <原创 2021-03-07 09:51:56 · 232 阅读 · 0 评论 -
354. Russian Doll Envelopes(Leetcode每日一题-2021.03.04)-抄答案
ProblemYou are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope.One envelope can fit into another if and only if both the width and height of one envelope is greater than the width an原创 2021-03-04 17:57:32 · 256 阅读 · 1 评论 -
338. Counting Bits(Leetcode每日一题-2021.03.03)--抄答案
ProblemGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example1Input: 2Output: [0,1,1]Example2Input: 5Output: [0,1,1,2,1,原创 2021-03-03 18:18:35 · 125 阅读 · 1 评论 -
1004. Max Consecutive Ones III(Leetcode每日一题-2021.02.19)
ProblemGiven an array A of 0s and 1s, we may change up to K values from 0 to 1.Return the length of the longest (contiguous) subarray that contains only 1s.Note:1 <= A.length <= 200000 <= K <= A.lengthA[i] is 0 or 1Example1Input: A =原创 2021-02-19 18:56:58 · 131 阅读 · 0 评论 -
995. Minimum Number of K Consecutive Bit Flips(Leetcode每日一题-2021.02.18)--抄答案
ProblemIn an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.Return the minimum number of K-bit flips requ原创 2021-02-18 18:55:09 · 147 阅读 · 0 评论 -
119. Pascal‘s Triangle II(Leetcode每日一题-2021.02.12)
ProblemGiven an integer rowIndex, return the rowIndexth row of the Pascal’s triangle.Notice that the row index starts from 0.In Pascal’s triangle, each number is the sum of the two numbers directly above it.Constraints:0 <= rowIndex <= 33Exam原创 2021-02-12 12:23:12 · 132 阅读 · 0 评论 -
978. Longest Turbulent Subarray(Leetcode每日一题-2021.02.08)
ProblemGiven an integer array arr, return the length of a maximum size turbulent subarray of arr.A subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.More formally, a subarray [arr[i], arr[i + 1], …原创 2021-02-08 21:42:27 · 153 阅读 · 0 评论 -
123. Best Time to Buy and Sell Stock III(Leetcode每日一题-2021.01.09)
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 at most two transactions.Note: You may not engage in multiple transactions at the same time (i原创 2021-01-09 09:08:58 · 199 阅读 · 0 评论