摘要：
Problem : Given 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 阅读全文
posted @ 2020-02-06 19:23
littledy
阅读(82)
评论(0)
推荐(0)
摘要：
Problem : 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 righ 阅读全文
posted @ 2020-02-06 18:12
littledy
阅读(98)
评论(0)
推荐(0)
摘要：
动态规划具备以下三个特点： 1.把原来的问题分解成几个 相似的子问题 ； 2.所有的子问题 只需要解决一次 ； 3. 储存 子问题的解。 LeetCode DP算法分类题目链接： 动态规划的问题有很多种，只能通过多刷才能知道对哪一类的问题应用DP算法求解方便。 阅读全文
posted @ 2020-02-06 16:15
littledy
阅读(116)
评论(0)
推荐(0)
摘要：
Problem : 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 righ 阅读全文
posted @ 2020-02-06 12:05
littledy
阅读(93)
评论(0)
推荐(0)
摘要：
Problem : Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represent 阅读全文
posted @ 2020-02-06 09:39
littledy
阅读(154)
评论(0)
推荐(0)
浙公网安备 33010602011771号