![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
hangyudd
这个作者很懒,什么都没留下…
展开
-
62. Unique Paths
题目: A 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 t...原创 2019-04-02 15:00:20 · 104 阅读 · 0 评论 -
leetcode 152. Maximum Product Subarray
题目:Given an integer arraynums, find the contiguous subarray within an array (containing at least one number) which has the largest product. 这是比较典型的动态规划题目,如果只考虑自然数,那么动态关系可以描述为: max[i]=max( nums[i]*m...原创 2019-03-29 12:46:42 · 152 阅读 · 0 评论