- 博客(3)
- 资源 (5)
- 收藏
- 关注
原创 【LeetCode】【Python】Minimum Path Sum
此题不难,可以用dfs来做,也可以用动态规划,但明显dfs性能不如dp。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 its path.Note:
2014-10-09 12:22:40 1860
原创 【LeetCode】【Python题解】Container with most water
这道题真真是在面试中碰到过,可惜当时复杂度到O(n2)了,太挫了,怪不得没有通过面试。Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two en
2014-10-08 21:30:05 4399 2
android口语对话系统
2014-05-10
Django1.6_利用Form实现注册登录注销修改密码
2014-03-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人