默许：核算面积。以习惯页面：最小规划和最大规划的物业核算规划
minimum-scale – The minimum scale of viewport. 最小规划 -视口的最低规划。[Default: 0.25, Range: >0 - 10] [默许：0.25规划：0 - 10] maximum-scale – The maximum scale of viewport. 最大规划的-视口的...
分类：
其他好文 时间：
2015-04-10 01:24:19
阅读次数：
228
Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) -- Push element x onto stack.pop() -- Removes the element on top o...
分类：
其他好文 时间：
2015-04-10 01:23:48
阅读次数：
130
求一棵二叉树的最低子树的高度 思路：用队列实现广度优先搜索即可，将每一层的节点放入队列，然后弹出时将下一层节点放入，遇到叶子节点时即返回当前的高度 class Solution {public: int minDepth(TreeNode *root) { if (!root) return 0; ...
分类：
其他好文 时间：
2015-04-09 21:42:15
阅读次数：
105
Follow up for “Find Minimum in Rotated Sorted Array”:
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Suppose a sorted array is rotated at some pivot...
分类：
其他好文 时间：
2015-04-09 19:49:17
阅读次数：
115
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol...
分类：
其他好文 时间：
2015-04-09 17:16:29
阅读次数：
114
problem：
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted
as 1 step.)
You have the following 3 operation...
分类：
其他好文 时间：
2015-04-09 10:36:31
阅读次数：
140
感觉这是一系列的动态规划的算法，正好也将动态规划的算法进行一个总结：
算法一：
带权重的最小路径的问题
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 i...
分类：
编程语言 时间：
2015-04-08 18:03:40
阅读次数：
167
Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root...
分类：
编程语言 时间：
2015-04-08 07:55:25
阅读次数：
137
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类：
其他好文 时间：
2015-04-07 17:01:07
阅读次数：
160
uva 10739 String to PalindromeIn this problem you are asked to convert a string into a palindrome with minimum number of operations. The operations are described below:Here you’d have the ultimate free...
分类：
其他好文 时间：
2015-04-07 10:02:16
阅读次数：
119
