![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp
richarddia
这个作者很懒,什么都没留下…
展开
-
LeetCode 201次周赛第4题 1547. Minimum Cost to Cut a Stick
LeetCode 201次周赛第4题1547. Minimum Cost to Cut a Stick题目描述就不贴了,原题中有图片借鉴大神的方法思路代码dp填表注意事项题目描述就不贴了,原题中有图片上周比赛完没有及时写这道题,现在把坑填上。这个题的关键点在于:如果从某个位置切开了,那左右两边的就部分就一刀两断了,这样就把一个问题拆成了两个独立的子问题,非常好的动态规划样例。借鉴大神的方法思路把0和n作为两个端点加入到数组中对数组进行排序。加入了端点的数组就不只是切割点数组了,还可以作为分原创 2020-08-17 10:56:02 · 205 阅读 · 0 评论 -
LeetCode 202次周赛 1553. Minimum Number of Days to Eat N Oranges
1553. Minimum Number of Days to Eat N Oranges题目描述思路分析弱智动态规划可行的动态规划题目描述There are n oranges in the kitchen and you decided to eat some of these oranges every day as follows:Eat one orange.I f the number of remaining oranges (n) is divisible by 2 then yo原创 2020-08-17 10:20:36 · 239 阅读 · 0 评论 -
LeetCode 第201次周赛 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
Leetcode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target题目描述思路周赛代码优化代码复杂度分析题目描述Given an array nums and an integer target.Return the maximum number of non-empty non-overlapping subarrays such that the sum of values in each subarr原创 2020-08-10 15:51:29 · 269 阅读 · 0 评论