动态规划 [TOC] 数字三角形问题 LeetCode 120.Triangle 尝试使用分治法 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent nu ...
分类：
其他好文 时间：
2019-12-22 16:41:16
阅读次数：
132
A hundred years ago it was assumed and scientifically "proved" by economists that the laws of society make it necessary to have a vast army of poor an ...
分类：
其他好文 时间：
2019-12-22 10:38:04
阅读次数：
89
Description Description Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is count ...
分类：
其他好文 时间：
2019-12-21 22:27:54
阅读次数：
111
Description Description There are n houses on a line. Given an array A and A[i] represents the position of i-th house. Now you need to pick k position ...
分类：
其他好文 时间：
2019-12-21 22:21:13
阅读次数：
107
Problem Description Problems that require minimum paths through some domain appear in many different areas of computer science. For example, one of th ...
分类：
其他好文 时间：
2019-12-21 20:35:46
阅读次数：
66
Description Given a list of Connections, which is the Connection class (the city name at both ends of the edge and a cost between them), find edges th ...
分类：
其他好文 时间：
2019-12-21 12:00:30
阅读次数：
76
最近践行的一个概念：最小化可行产品 https://www.jianshu.com/p/92c3034285a7 这是在采铜的《精进》里看到的一个概念。“最化小可行产品”（minimum viable product）是精益创业里的一个概念，指的是可以使用最少资源，被最快制作出来的、能被用户使用的试 ...
分类：
其他好文 时间：
2019-12-21 09:18:18
阅读次数：
71
time limit per test3 secondsmemory limit per test256 megabytesinput: standard inputoutput: standard output You are given a non-empty string s=s1s2…sn, ...
分类：
其他好文 时间：
2019-12-20 23:54:14
阅读次数：
181
原题链接在这里：https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/ 题目： There are a number of spherical balloons spread in two-dimension ...
分类：
其他好文 时间：
2019-12-19 12:39:58
阅读次数：
72
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. ...
分类：
其他好文 时间：
2019-12-16 09:34:47
阅读次数：
82
