- 博客(4)
- 收藏
- 关注
翻译 132. Palindrome Partitioning II
https://www.youtube.com/watch?v=vunyW9zVrx4Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.Fo...
2018-04-19 10:21:11
78
翻译 leetcode 576. Out of Boundary Paths
https://leetcode.com/problems/out-of-boundary-paths/solution/题目: https://leetcode.com/problems/out-of-boundary-paths/description/一个球在m * n的格子内,问多少种路径可以将它移出格子,最后的结果取模100000007方法#1 暴力搜索 [时间超限]算法描述基本思想:在...
2018-03-30 10:12:47
189
翻译 Leetcode 741 Cherry Pickup
http://zxi.mytechroad.com/blog/dynamic-programming/leetcode-741-cherry-pickup/Problem:In a N x N grid representing a field of cherries, each cell is one of three possible integers.0 means the cell is ...
2018-03-29 11:01:44
267
翻译 动态规划
https://algorithms.tutorialhorizon.com/introduction-to-dynamic-programming-fibonacci-series/什么是动态规划:动态规划是一种更高效解决递归问题的技术. 在递归问题中我们总是重复的解决子问题,而在动态规划问题中,我们存储子问题的结果以便于我们不会再去重复的解决此问题,这种方式被称为 Memoization.动态...
2018-03-27 16:38:00
120
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人