动态规划
ttinch
这个作者很懒,什么都没留下…
展开
-
【LeetCode】300. Longest Increasing Subsequence 解题报告(Python)
【LeetCode】300. Longest Increasing Subsequence 解题报告(Python)题目描述解法1:动态规划解法二:贪心算法+二分查找题目地址:https://leetcode.com/problems/longest-increasing-subsequence/题目描述Given an unsorted array of integers, find th...原创 2019-10-22 09:55:52 · 225 阅读 · 0 评论 -
【LeetCode】70. Climbing Stairs 解题报告(Python)
【LeetCode】70. Climbing Stairs 解题报告(Python)题目描述解法:动态规划题目地址:https://leetcode.com/problems/climbing-stairs/submissions/题目描述You are climbing a stair case. It takes n steps to reach to the top.Each tim...原创 2019-10-17 13:49:50 · 232 阅读 · 0 评论 -
【LeetCode】62. Unique Paths 解题报告(Python)
【LeetCode】62. Unique Paths 解题报告(Python)题目描述解法1:组合数直接求解防溢出(python大数不会溢出,给一个思路)类似动态规划,不可直接递归,有重复子问题解法2:动态规划题目地址:https://leetcode.com/problems/unique-paths/题目描述A robot is located at the top-left corne...原创 2019-10-16 20:59:37 · 153 阅读 · 0 评论 -
【LeetCode】53. Maximum Subarray 解题报告(Python)
【LeetCode】53. Maximum Subarray 解题报告(Python)题目描述解法1:动态规划解法2:分治法分治法和动态规划区别题目地址:https://leetcode.com/problems/maximum-subarray/题目描述Given an integer array nums, find the contiguous subarray (containing...原创 2019-10-15 17:31:20 · 181 阅读 · 0 评论