动态规划
文章平均质量分 69
决定要好好毒树的Lucifer
这个作者很懒,什么都没留下…
展开
-
LeetCode 42 - 接雨水(动态规划)
题目链接https://leetcode-cn.com/problems/trapping-rain-water/submissions/题目:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.Input: height = [0,1,0,2,1,0,1,3,2原创 2022-03-12 21:07:01 · 1362 阅读 · 0 评论 -
LeetCode 18 - 四数之和(双指针法)
题目链接https://leetcode-cn.com/problems/4sum/comments/题目:给你一个由 n 个整数组成的数组nums ,和一个目标值 target 。请你找出并返回满足下述全部条件且不重复的四元组[nums[a], nums[b], nums[c], nums[d]](若两个四元组元素一一对应,则认为两个四元组重复)Given an array nums of n integers, return an array of all the unique...原创 2022-03-10 09:48:42 · 426 阅读 · 0 评论 -
贪心法:LeetCode1218 - 最长定差子序列
题目:Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that the difference between adjacent elements in the subsequence equals difference.A subsequence is a sequ原创 2022-02-13 19:58:23 · 379 阅读 · 0 评论